[ { "path": ".gitignore", "content": "# pyc\n*.pyc\n\n# Compiled Object files\n*.lo\n*.o\n\n# Compiled Dynamic libraries\n*.so\n\n# Compiled Static libraries\n*.la\n*.a\n\n# Compiled misc\n*.dep\n*.gcda\n*.gcno\n*.gcov\n\n# Packages\n*.tar.gz\n*.tar.bz2\n\n# Logs\n*.log\n\n# vire\n*.swp\n*.~\n*.project\n*.cproject\n\n# Core and executable\ncore*\nvire\n\n# extracted jemalloc\n!/dep/jemalloc-*\n\n# Autotools\n.deps\n.libs\n\n/aclocal.m4\n/autom4te.cache\n/stamp-h1\n/autoscan.log\n/libtool\n\n/config/config.guess\n/config/config.sub\n/config/depcomp\n/config/install-sh\n/config/ltmain.sh\n/config/missing\n/config\n\n/config.h\n/config.h.in\n/config.h.in~\n/config.log\n/config.status\n/configure.scan\n/configure\n\nMakefile\nMakefile.in\n" }, { "path": "ChangeLog", "content": " 2016-10-25 deep011 \n * vire: version 1.0.0 release\n vire (pronounced \"vip-redis\") is a multithread redis(based on redis-3.2.0) maintains in vipshop.\n multi-threads support.\n command type CONNECTION supported: ping,quit,echo,select,auth,admin.\n command type SERVER supported: info,flushall,flushdb,time,dbsize,command,config,client,slowlog.\n command type KEY supported: del,exists,ttl,pttl,expire,expireat,pexpire,pexpireat,persist,randomkey,type,keys,scan,object.\n command type STRING supported: get,set,setnx,setex,psetex,incr,decr,incrby,decrby,append,strlen,getset,incrbyfloat,setbit,getbit,setrange,getrange,bitcount,bitpos,mget,mset.\n command type HASH supported: hset,hget,hlen,hdel,hexists,hkeys,hvals,hgetall,hincrby,hincrbyfloat,hmget,hmset,hsetnx,hstrlen,hscan.\n command type LIST supported: rpush,lpush,lrange,rpop,lpop,llen,lrem,ltrim,lindex,lset.\n command type SET supported: sadd,smembers,scard,srem,spop,sismember,sscan,sunion,sunionstore,sdiff,sdiffstore,sinter,sinterstore.\n command type SORTEDSET supported: zadd,zincrby,zrange,zrevrange,zrem,zcard,zcount,zrangebyscore,zrevrangebyscore,zrank,zrevrank,zscore,zremrangebyscore,zremrangebyrank,zremrangebylex,zscan.\n command type HYPERLOGLOG supported: pfadd,pfcount.\n config option added(used for config file and 'config get/set' command): port,databases,internal-dbs-per-databases,requirepass,adminpass,commands-need-adminpass,maxclients,maxmemory,maxmemory-policy,maxmemory-samples,max-time-complexity-limit,slowlog-log-slower-than,slowlog-max-len.\n viretest added that is for unit test.\n vireabtest added that is for compare command execution and data consistency with redis-3.2.0.\n vire-benchmark added that is modified from redis-benchmark but multi-threads supported and pressure test vire." }, { "path": "LICENSE", "content": "\n Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS" }, { "path": "Makefile.am", "content": "MAINTAINERCLEANFILES = Makefile.in aclocal.m4 configure config.h.in config.h.in~ stamp-h.in\n\nACLOCAL_AMFLAGS = -I m4\n\nSUBDIRS = dep src tests\n\nEXTRA_DIST = README.md NOTICE LICENSE ChangeLog conf scripts notes\n" }, { "path": "NOTICE", "content": "" }, { "path": "README.md", "content": "# vire\n\n**vire** (pronounced \"vip-redis\") is a multithread redis(based on redis-3.2.0) maintains in vipshop.\n\n### QQ交流群：276406429\n\n## Dependence\n\nPlease install automake, libtool, autoconf and bzip2 at first.\n\n## Build\n\nTo build vire from source with _debug logs enabled_ and _assertions enabled_:\n\n $ git clone https://github.com/vipshop/vire.git\n $ cd vire\n $ autoreconf -fvi\n $ ./configure --enable-debug=full\n $ make\n $ src/vire -h\n\nA quick checklist:\n\n+ Use newer version of gcc (older version of gcc has problems)\n+ Use CFLAGS=\"-O1\" ./configure && make\n+ Use CFLAGS=\"-O3 -fno-strict-aliasing\" ./configure && make\n+ `autoreconf -fvi && ./configure` needs `automake` and `libtool` to be installed\n\n## Run\n\n $ src/vire -c conf/vire.conf -o log -T 6 -d\n\n## Features\n\n+ Multithread.\n+ Fast.\n+ Works with Linux, *BSD, OS X and SmartOS (Solaris)\n\n## Help\n\n Usage: vire [-?hVdt] [-v verbosity level] [-o output file]\n [-c conf file] [-p pid file]\n [-T worker threads number]\n \n Options:\n -h, --help : this help\n -V, --version : show version and exit\n -t, --test-conf : test configuration for syntax errors and exit\n -d, --daemonize : run as a daemon\n -v, --verbose=N : set logging level (default: 5, min: 0, max: 11)\n -o, --output=S : set logging file (default: stderr)\n -c, --conf-file=S : set configuration file (default: conf/vire.conf)\n -p, --pid-file=S : set pid file (default: off)\n -T, --thread_num=N : set the worker threads number (default: 6)\n\n## Support redis command so far\n\n#### Connection\n\n+ ping\n+ quit\n+ echo\n+ select\n+ auth\n+ admin\n\n#### Server\n\n+ info\n+ flushall\n+ flushdb\n+ time\n+ dbsize\n+ command\n+ config\n+ client\n+ slowlog\n\n#### Key\n\n+ del\n+ exists\n+ ttl\n+ pttl\n+ expire\n+ expireat\n+ pexpire\n+ pexpireat\n+ persist\n+ randomkey\n+ type\n+ keys\n+ scan\n+ object\n\n#### String\n\n+ get\n+ set\n+ setnx\n+ setex\n+ psetex\n+ incr\n+ decr\n+ incrby\n+ decrby\n+ append\n+ strlen\n+ getset\n+ incrbyfloat\n+ setbit\n+ getbit\n+ setrange\n+ getrange\n+ bitcount\n+ bitpos\n+ mget\n+ mset\n\n#### Hash\n\n+ hset\n+ hget\n+ hlen\n+ hdel\n+ hexists\n+ hkeys\n+ hvals\n+ hgetall\n+ hincrby\n+ hincrbyfloat\n+ hmget\n+ hmset\n+ hsetnx\n+ hstrlen\n+ hscan\n\n#### List\n\n+ rpush\n+ lpush\n+ lrange\n+ rpop\n+ lpop\n+ llen\n+ lrem\n+ ltrim\n+ lindex\n+ lset\n\n#### Set\n\n+ sadd\n+ smembers\n+ scard\n+ srem\n+ spop\n+ sismember\n+ sscan\n+ sunion\n+ sunionstore\n+ sdiff\n+ sdiffstore\n+ sinter\n+ sinterstore\n\n#### SortedSet\n\n+ zadd\n+ zincrby\n+ zrange\n+ zrevrange\n+ zrem\n+ zcard\n+ zcount\n+ zrangebyscore\n+ zrevrangebyscore\n+ zrank\n+ zrevrank\n+ zscore\n+ zremrangebyscore\n+ zremrangebyrank\n+ zremrangebylex\n+ zscan\n\n#### HyperLogLog\n\n+ pfadd\n+ pfcount\n\n## License\n\nCopyright © 2016 VIPSHOP Inc.\n\nLicensed under the Apache License, Version 2.0: http://www.apache.org/licenses/LICENSE-2.0\n" }, { "path": "conf/vire.conf", "content": "################################## NETWORK #####################################\n\n# By default, if no \"bind\" configuration directive is specified, Vire listens\n# for connections from all the network interfaces available on the server.\n# It is possible to listen to just one or multiple selected interfaces using\n# the \"bind\" configuration directive, followed by one or more IP addresses.\n#\n# Examples:\n#\n# bind 192.168.1.100 10.0.0.1\n# bind 127.0.0.1 ::1\n#\n# ~~~ WARNING ~~~ If the computer running Vire is directly exposed to the\n# internet, binding to all the interfaces is dangerous and will expose the\n# instance to everybody on the internet. So by default we uncomment the\n# following bind directive, that will force Vire to listen only into\n# the IPv4 lookback interface address (this means Vire will be able to\n# accept connections only from clients running into the same computer it\n# is running).\n#\n# IF YOU ARE SURE YOU WANT YOUR INSTANCE TO LISTEN TO ALL THE INTERFACES\n# JUST COMMENT THE FOLLOWING LINE.\n# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n# bind 127.0.0.1\n\n# Accept connections on the specified port, default is 55555.\n# If port 0 is specified Vire will not listen on a TCP socket.\nport 55555\n\n################################# GENERAL #####################################\n\n# Set the number of databases. The default database is DB 0, you can select\n# a different one on a per-connection basis using SELECT where\n# dbid is a number between 0 and 'databases'-1\ndatabases 6\n\n# Set the number of internal dbs for every databases. This is used for\n# multi-threads avoid too much locker competition.\ninternal-dbs-per-databases 6\n\n################################## SECURITY ###################################\n\n# Require clients to issue AUTH before processing any other\n# commands. This might be useful in environments in which you do not trust\n# others with access to the host running redis-server.\n#\n# This should stay commented out for backward compatibility and because most\n# people do not need auth (e.g. they run their own servers).\n#\n# Warning: since Redis is pretty fast an outside user can try up to\n# 150k passwords per second against a good box. This means that you should\n# use a very strong password otherwise it will be very easy to break.\n#\n# requirepass foobared\n\n# Require clients to issue ADMIN before processing any other\n# needed admin right commands. This might be useful to prevent users from \n# doing some dangerous actions to the host running Vire.\n#\n# This should stay commented out for backward compatibility and because most\n# people do not need auth (e.g. they run their own servers).\n#\n# Warning: since Redis is pretty fast an outside user can try up to\n# 150k passwords per second against a good box. This means that you should\n# use a very strong password otherwise it will be very easy to break.\n#\n# adminpass iamadmin\n\n# Make some commands need adminpass to execute. Those commands just allowed \n# administrator to execute. This might be useful to prevent users from \n# doing some dangerous actions to the host running Vire.\n#\n# commands-need-adminpass flushall flushdb keys config\n\n################################### CLIENTS ####################################\n\n# Set the max number of connected clients at the same time. By default\n# this limit is set to 10000 clients, however if the Redis server is not\n# able to configure the process file limit to allow for the specified limit\n# the max number of allowed clients is set to the current file limit\n# minus 32 (as Redis reserves a few file descriptors for internal uses).\n#\n# Once the limit is reached Redis will close all the new connections sending\n# an error 'max number of clients reached'.\n#\n# maxclients 10000\n\n############################## MEMORY MANAGEMENT ################################\n\n# Don't use more memory than the specified amount of bytes.\n# When the memory limit is reached Vire will try to remove keys\n# according to the eviction policy selected (see maxmemory-policy).\n#\n# If Vire can't remove keys according to the policy, or if the policy is\n# set to 'noeviction', Vire will start to reply with errors to commands\n# that would use more memory, like SET, LPUSH, and so on, and will continue\n# to reply to read-only commands like GET.\n#\n# This option is usually useful when using Vire as an LRU cache, or to set\n# a hard memory limit for an instance (using the 'noeviction' policy).\n#\n# WARNING: If you have slaves attached to an instance with maxmemory on,\n# the size of the output buffers needed to feed the slaves are subtracted\n# from the used memory count, so that network problems / resyncs will\n# not trigger a loop where keys are evicted, and in turn the output\n# buffer of slaves is full with DELs of keys evicted triggering the deletion\n# of more keys, and so forth until the database is completely emptied.\n#\n# In short... if you have slaves attached it is suggested that you set a lower\n# limit for maxmemory so that there is some free RAM on the system for slave\n# output buffers (but this is not needed if the policy is 'noeviction').\n#\n# maxmemory \n\n# MAXMEMORY POLICY: how Vire will select what to remove when maxmemory\n# is reached. You can select among five behaviors:\n#\n# volatile-lru -> remove the key with an expire set using an LRU algorithm, not support now\n# allkeys-lru -> remove any key according to the LRU algorithm, not support now\n# volatile-random -> remove a random key with an expire set\n# allkeys-random -> remove a random key, any key\n# volatile-ttl -> remove the key with the nearest expire time (minor TTL)\n# noeviction -> don't expire at all, just return an error on write operations\n#\n# Note: with any of the above policies, Vire will return an error on write\n# operations, when there are no suitable keys for eviction.\n#\n# At the date of writing these commands are: set setnx setex append\n# incr decr rpush lpush rpushx lpushx linsert lset rpoplpush sadd\n# sinter sinterstore sunion sunionstore sdiff sdiffstore zadd zincrby\n# zunionstore zinterstore hset hsetnx hmset hincrby incrby decrby\n# getset mset msetnx exec sort\n#\n# The default is:\n#\n# maxmemory-policy noeviction\n\n# LRU and minimal TTL algorithms are not precise algorithms but approximated\n# algorithms (in order to save memory), so you can tune it for speed or\n# accuracy. For default Vire will check five keys and pick the one that was\n# used less recently, you can change the sample size using the following\n# configuration directive.\n#\n# The default of 5 produces good enough results. 10 Approximates very closely\n# true LRU but costs a bit more CPU. 3 is very fast but not very accurate.\n#\n# maxmemory-samples 5\n\n# Max time complexity limit for the commands that their time complexity is O(n).\n#\n# If n is bigger than max-time-complexity-limit, an error is returned for the client.\n# The default of 0 means unlimited.\n#\n# At the date of affected commands are: keys\n# \n# max-time-complexity-limit 0\n\n################################## SLOW LOG ###################################\n\n# The Vire Slow Log is a system to log queries that exceeded a specified\n# execution time. The execution time does not include the I/O operations\n# like talking with the client, sending the reply and so forth,\n# but just the time needed to actually execute the command (this is the only\n# stage of command execution where the thread is blocked and can not serve\n# other requests in the meantime).\n#\n# You can configure the slow log with two parameters: one tells Vire\n# what is the execution time, in microseconds, to exceed in order for the\n# command to get logged, and the other parameter is the length of the\n# slow log. When a new command is logged the oldest one is removed from the\n# queue of logged commands.\n\n# The following time is expressed in microseconds, so 1000000 is equivalent\n# to one second. Note that a negative number disables the slow log, while\n# a value of zero forces the logging of every command.\nslowlog-log-slower-than 10000\n\n# There is no limit to this length. Just be aware that it will consume memory.\n# You can reclaim memory used by the slow log with SLOWLOG RESET.\nslowlog-max-len 128" }, { "path": "configure.ac", "content": "# Define the package version numbers and the bug reporting address\nm4_define([VR_MAJOR], 1)\nm4_define([VR_MINOR], 0)\nm4_define([VR_PATCH], 0)\nm4_define([VR_BUGS], [diguo58@gmail.com])\n\n# Initialize autoconf\nAC_PREREQ([2.63])\nAC_INIT([vire], [VR_MAJOR.VR_MINOR.VR_PATCH], [VR_BUGS])\nAC_CONFIG_SRCDIR([src/vr.c])\nAC_CONFIG_AUX_DIR([config])\nAC_CONFIG_HEADERS([config.h:config.h.in])\nAC_CONFIG_MACRO_DIR([m4])\n\n# Initialize automake\nAM_INIT_AUTOMAKE([1.9 foreign])\n\n# Define macro variables for the package version numbers\nAC_DEFINE(VR_VERSION_MAJOR, VR_MAJOR, [Define the major version number])\nAC_DEFINE(VR_VERSION_MINOR, VR_MINOR, [Define the minor version number])\nAC_DEFINE(VR_VERSION_PATCH, VR_PATCH, [Define the patch version number])\nAC_DEFINE(VR_VERSION_STRING, \"VR_MAJOR.VR_MINOR.VR_PATCH\", [Define the version string])\n\n# Checks for language\nAC_LANG([C])\n\n# Checks for programs\nAC_PROG_AWK\nAC_PROG_CC\nAC_PROG_CPP\nAC_PROG_CXX\nAC_PROG_INSTALL\nAC_PROG_LN_S\nAC_PROG_MAKE_SET\nAC_PROG_RANLIB\nAC_PROG_LIBTOOL\n\n# Checks for typedefs, structures, and compiler characteristics\nAC_C_INLINE\nAC_TYPE_INT8_T\nAC_TYPE_INT16_T\nAC_TYPE_INT32_T\nAC_TYPE_INT64_T\nAC_TYPE_INTMAX_T\nAC_TYPE_INTPTR_T\nAC_TYPE_UINT8_T\nAC_TYPE_UINT16_T\nAC_TYPE_UINT32_T\nAC_TYPE_UINT64_T\nAC_TYPE_UINTMAX_T\nAC_TYPE_UINTPTR_T\nAC_TYPE_OFF_T\nAC_TYPE_PID_T\nAC_TYPE_SIZE_T\nAC_TYPE_SSIZE_T\n\nAC_C_BIGENDIAN(\n [],\n [AC_DEFINE(HAVE_LITTLE_ENDIAN, 1, [Define to 1 if machine is little endian])],\n [AC_MSG_ERROR([endianess of this machine is unknown])],\n [AC_MSG_ERROR([universial endianess not supported])]\n)\n\n# Checks for header files\nAC_HEADER_STDBOOL\nAC_CHECK_HEADERS([fcntl.h float.h limits.h stddef.h stdlib.h string.h unistd.h])\nAC_CHECK_HEADERS([inttypes.h stdint.h])\nAC_CHECK_HEADERS([sys/ioctl.h sys/time.h sys/uio.h])\nAC_CHECK_HEADERS([sys/socket.h sys/un.h netinet/in.h arpa/inet.h netdb.h])\nAC_CHECK_HEADERS([execinfo.h],\n [AC_DEFINE(HAVE_BACKTRACE, [1], [Define to 1 if backtrace is supported])], [])\nAC_CHECK_HEADERS([sys/epoll.h], [], [])\nAC_CHECK_HEADERS([sys/event.h], [], [])\n\n# Checks for libraries\nAC_CHECK_LIB([m], [pow])\nAC_CHECK_LIB([pthread], [pthread_create])\n\n# Checks for library functions\nAC_FUNC_FORK\nAC_FUNC_MALLOC\nAC_FUNC_REALLOC\nAC_CHECK_FUNCS([dup2 gethostname gettimeofday strerror])\nAC_CHECK_FUNCS([socket])\nAC_CHECK_FUNCS([memchr memmove memset])\nAC_CHECK_FUNCS([strchr strndup strtoul])\n\nAC_CACHE_CHECK([if epoll works], [ac_cv_epoll_works],\n AC_TRY_RUN([\n#include \n#include \n#include \nint\nmain(int argc, char **argv)\n{\n int fd;\n\n fd = epoll_create(256);\n if (fd < 0) {\n perror(\"epoll_create:\");\n exit(1);\n }\n exit(0);\n}\n ], [ac_cv_epoll_works=yes], [ac_cv_epoll_works=no]))\nAS_IF([test \"x$ac_cv_epoll_works\" = \"xyes\"],\n [AC_DEFINE([HAVE_EPOLL], [1], [Define to 1 if epoll is supported])], [])\n\nAC_CACHE_CHECK([if kqueue works], [ac_cv_kqueue_works],\n AC_TRY_RUN([\n#include \n#include \n#include \n#include \n#include \nint\nmain(int argc, char **argv)\n{\n int fd;\n\n fd = kqueue();\n if (fd < 0) {\n perror(\"kqueue:\");\n exit(1);\n }\n exit(0);\n}\n ], [ac_cv_kqueue_works=yes], [ac_cv_kqueue_works=no]))\nAS_IF([test \"x$ac_cv_kqueue_works\" = \"xyes\"],\n [AC_DEFINE([HAVE_KQUEUE], [1], [Define to 1 if kqueue is supported])], [])\n\nAC_CACHE_CHECK([if event ports works], [ac_cv_evports_works],\n AC_TRY_RUN([\n#include \n#include \n#include \nint\nmain(int argc, char **argv)\n{\n int fd;\n\n fd = port_create();\n if (fd < 0) {\n perror(\"port_create:\");\n exit(1);\n }\n exit(0);\n}\n ], [ac_cv_evports_works=yes], [ac_cv_evports_works=no]))\nAS_IF([test \"x$ac_cv_evports_works\" = \"xyes\"],\n [AC_DEFINE([HAVE_EVENT_PORTS], [1], [Define to 1 if event ports is supported])], [])\n\nAS_IF([test \"x$ac_cv_epoll_works\" = \"xno\" &&\n test \"x$ac_cv_kqueue_works\" = \"xno\" &&\n test \"x$ac_cv_evports_works\" = \"xno\"],\n [AC_MSG_ERROR([either epoll or kqueue or event ports support is required])], [])\n\nAM_CONDITIONAL([OS_LINUX], [test \"x$ac_cv_epoll_works\" = \"xyes\"])\nAM_CONDITIONAL([OS_BSD], [test \"x$ac_cv_kqueue_works\" = \"xyes\"])\nAM_CONDITIONAL([OS_SOLARIS], [test \"x$ac_cv_evports_works\" = \"xyes\"])\nAM_CONDITIONAL([OS_FREEBSD], [test \"$(uname -v | cut -c 1-10)\" == \"FreeBSD 10\"])\nAM_CONDITIONAL([OS_DARWIN], [test \"$(uname -v | cut -c 1-6)\" == \"Darwin\"])\n\n# Package options\nAC_MSG_CHECKING([whether to enable debug logs and asserts])\nAC_ARG_ENABLE([debug],\n [AS_HELP_STRING(\n [--enable-debug=@<:@full|yes|log|no@:>@],\n [enable debug logs and asserts @<:@default=no@:>@])\n ],\n [],\n [enable_debug=no])\nAS_CASE([x$enable_debug],\n [xfull], [AC_DEFINE([HAVE_ASSERT_PANIC], [1],\n [Define to 1 if panic on an assert is enabled])\n AC_DEFINE([HAVE_DEBUG_LOG], [1], [Define to 1 if debug log is enabled])\n ],\n [xyes], [AC_DEFINE([HAVE_ASSERT_LOG], [1],\n [Define to 1 if log on an assert is enabled])\n AC_DEFINE([HAVE_DEBUG_LOG], [1], [Define to 1 if debug log is enabled])\n ],\n [xlog], [AC_DEFINE([HAVE_DEBUG_LOG], [1], [Define to 1 if debug log is enabled])],\n [xno], [],\n [AC_MSG_FAILURE([invalid value ${enable_debug} for --enable-debug])])\nAC_MSG_RESULT($enable_debug)\n\nAC_MSG_CHECKING([whether to disable spinlock])\nAC_ARG_ENABLE([spinlock],\n [AS_HELP_STRING(\n [--disable-spinlock],\n [disable spinlock])\n ],\n [disable_spinlock=yes],\n [disable_spinlock=no])\nAS_IF([test \"x$disable_spinlock\" = xyes],\n [],\n [AC_DEFINE([HAVE_SPINLOCK], [1], [Define to 1 if spinlock is not disabled])])\nAC_MSG_RESULT($disable_spinlock)\n\nAC_MSG_CHECKING([whether to use jemalloc])\nAC_ARG_WITH([jemalloc],\n AS_HELP_STRING([--with-jemalloc@<:@=yes|no@:>@],\n [use jemalloc(default use jemalloc)]),\n [\n if test \"$withval\" = \"no\"; then\n enable_jemalloc=no\n else\n\t enable_jemalloc=yes\n fi\n ],\n [enable_jemalloc=yes])\nAS_IF([test \"x$enable_jemalloc\" = xyes],\n [AC_DEFINE([HAVE_JEMALLOC], [1], [Define to 1 if jemalloc is used])],\n [])\nAC_MSG_RESULT($enable_jemalloc)\n\n# Untar the jemalloc-4.2.0.tar.bz2 in dep/ before config.status is rerun\n# Run configure in dep/jemalloc-4.2.0\nAC_CONFIG_COMMANDS_PRE([rm -rf dep/jemalloc-4.2.0])\nAC_CONFIG_COMMANDS_PRE([mkdir dep/jemalloc-4.2.0])\nAC_CONFIG_COMMANDS_PRE([tar xvjf dep/jemalloc-4.2.0.tar.bz2 -C dep])\nAC_CONFIG_COMMANDS_PRE([cd dep/jemalloc-4.2.0])\nAC_CONFIG_COMMANDS_PRE([./configure --with-jemalloc-prefix=je_])\nAC_CONFIG_COMMANDS_PRE([cd ../..])\n\n# Untar the hiredis-0.13.3.tar.gz in dep/ before config.status is rerun\nAC_CONFIG_COMMANDS_PRE([rm -rf dep/hiredis-0.13.3])\nAC_CONFIG_COMMANDS_PRE([mkdir dep/hiredis-0.13.3])\nAC_CONFIG_COMMANDS_PRE([tar zxvf dep/hiredis-0.13.3.tar.gz -C dep])\nAC_CONFIG_COMMANDS_PRE([cd dep/hiredis-0.13.3])\nAC_CONFIG_COMMANDS_PRE([cd ../..])\n\n# Define Makefiles\nAC_CONFIG_FILES([Makefile\n dep/Makefile\n dep/util/Makefile\n dep/dhashkit/Makefile\n dep/dmalloc/Makefile\n dep/sds/Makefile\n dep/ae/Makefile\n dep/dlist/Makefile\n dep/darray/Makefile\n dep/himemcached-0.1.0/Makefile\n src/Makefile\n tests/Makefile])\n\n# Generate the \"configure\" script\nAC_OUTPUT\n" }, { "path": "dep/.gitignore", "content": "!*.tar.gz" }, { "path": "dep/Makefile.am", "content": "SUBDIRS = jemalloc-4.2.0 hiredis-0.13.3 himemcached-0.1.0 util dhashkit dmalloc ae sds dlist darray\n\nEXTRA_DIST = jemalloc-4.2.0.tar.bz2 hiredis-0.13.3.tar.gz\n" }, { "path": "dep/ae/Makefile.am", "content": "MAINTAINERCLEANFILES = Makefile.in\n\nAM_CPPFLAGS =\nif !OS_SOLARIS\nAM_CPPFLAGS += -D_GNU_SOURCE\nendif\nAM_CPPFLAGS += -I $(top_srcdir)/dep/util\nAM_CPPFLAGS += -I $(top_srcdir)/dep/jemalloc-4.2.0/include\nAM_CPPFLAGS += -I $(top_srcdir)/dep/dmalloc\n\nAM_CFLAGS = -Wall -Wshadow\nAM_CFLAGS += -Wno-unused-parameter -Wno-unused-value\n\nnoinst_LIBRARIES = libae.a\n\nnoinst_HEADERS = ae.h\n\nlibae_a_SOURCES =\t\\\n\tae.c ae.h" }, { "path": "dep/ae/ae.c", "content": "/* A simple event-driven programming library. Originally I wrote this code\n * for the Jim's event-loop (Jim is a Tcl interpreter) but later translated\n * it in form of a library for easy reuse.\n *\n * Copyright (c) 2006-2010, Salvatore Sanfilippo \n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * * Neither the name of Redis nor the names of its contributors may be used\n * to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\n#include \n\n#ifdef HAVE_CONFIG_H\n# include \n#endif\n\n/* Include the best multiplexing layer supported by this system.\n * The following should be ordered by performances, descending. */\n#ifdef HAVE_EVENT_PORTS\n#include \"ae_evport.c\"\n#else\n #ifdef HAVE_EPOLL\n #include \"ae_epoll.c\"\n #else\n #ifdef HAVE_KQUEUE\n #include \"ae_kqueue.c\"\n #else\n #include \"ae_select.c\"\n #endif\n #endif\n#endif\n\naeEventLoop *aeCreateEventLoop(int setsize) {\n aeEventLoop *eventLoop;\n int i;\n\n if ((eventLoop = dalloc(sizeof(*eventLoop))) == NULL) goto err;\n eventLoop->events = dalloc(sizeof(aeFileEvent)*setsize);\n eventLoop->fired = dalloc(sizeof(aeFiredEvent)*setsize);\n if (eventLoop->events == NULL || eventLoop->fired == NULL) goto err;\n eventLoop->setsize = setsize;\n eventLoop->lastTime = time(NULL);\n eventLoop->timeEventHead = NULL;\n eventLoop->timeEventNextId = 0;\n eventLoop->stop = 0;\n eventLoop->maxfd = -1;\n eventLoop->beforesleep = NULL;\n eventLoop->bsdata = NULL;\n if (aeApiCreate(eventLoop) == -1) goto err;\n /* Events with mask == AE_NONE are not set. So let's initialize the\n * vector with it. */\n for (i = 0; i < setsize; i++)\n eventLoop->events[i].mask = AE_NONE;\n return eventLoop;\n\nerr:\n if (eventLoop) {\n dfree(eventLoop->events);\n dfree(eventLoop->fired);\n dfree(eventLoop);\n }\n return NULL;\n}\n\n/* Return the current set size. */\nint aeGetSetSize(aeEventLoop *eventLoop) {\n return eventLoop->setsize;\n}\n\n/* Resize the maximum set size of the event loop.\n * If the requested set size is smaller than the current set size, but\n * there is already a file descriptor in use that is >= the requested\n * set size minus one, AE_ERR is returned and the operation is not\n * performed at all.\n *\n * Otherwise AE_OK is returned and the operation is successful. */\nint aeResizeSetSize(aeEventLoop *eventLoop, int setsize) {\n int i;\n\n if (setsize == eventLoop->setsize) return AE_OK;\n if (eventLoop->maxfd >= setsize) return AE_ERR;\n if (aeApiResize(eventLoop,setsize) == -1) return AE_ERR;\n\n eventLoop->events = drealloc(eventLoop->events,sizeof(aeFileEvent)*setsize);\n eventLoop->fired = drealloc(eventLoop->fired,sizeof(aeFiredEvent)*setsize);\n eventLoop->setsize = setsize;\n\n /* Make sure that if we created new slots, they are initialized with\n * an AE_NONE mask. */\n for (i = eventLoop->maxfd+1; i < setsize; i++)\n eventLoop->events[i].mask = AE_NONE;\n return AE_OK;\n}\n\nvoid aeDeleteEventLoop(aeEventLoop *eventLoop) {\n aeApiFree(eventLoop);\n dfree(eventLoop->events);\n dfree(eventLoop->fired);\n dfree(eventLoop);\n}\n\nvoid aeStop(aeEventLoop *eventLoop) {\n eventLoop->stop = 1;\n}\n\nint aeCreateFileEvent(aeEventLoop *eventLoop, int fd, int mask,\n aeFileProc *proc, void *clientData)\n{\n if (fd >= eventLoop->setsize) {\n if (aeResizeSetSize(eventLoop,fd+1000) != AE_OK) {\n return AE_ERR;\n }\n }\n aeFileEvent *fe = &eventLoop->events[fd];\n\n if (aeApiAddEvent(eventLoop, fd, mask) == -1)\n return AE_ERR;\n fe->mask |= mask;\n if (mask & AE_READABLE) fe->rfileProc = proc;\n if (mask & AE_WRITABLE) fe->wfileProc = proc;\n fe->clientData = clientData;\n if (fd > eventLoop->maxfd)\n eventLoop->maxfd = fd;\n return AE_OK;\n}\n\nvoid aeDeleteFileEvent(aeEventLoop *eventLoop, int fd, int mask)\n{\n if (fd >= eventLoop->setsize) return;\n aeFileEvent *fe = &eventLoop->events[fd];\n if (fe->mask == AE_NONE) return;\n\n aeApiDelEvent(eventLoop, fd, mask);\n fe->mask = fe->mask & (~mask);\n if (fd == eventLoop->maxfd && fe->mask == AE_NONE) {\n /* Update the max fd */\n int j;\n\n for (j = eventLoop->maxfd-1; j >= 0; j--)\n if (eventLoop->events[j].mask != AE_NONE) break;\n eventLoop->maxfd = j;\n }\n}\n\nint aeGetFileEvents(aeEventLoop *eventLoop, int fd) {\n if (fd >= eventLoop->setsize) return 0;\n aeFileEvent *fe = &eventLoop->events[fd];\n\n return fe->mask;\n}\n\nstatic void aeGetTime(long *seconds, long *milliseconds)\n{\n struct timeval tv;\n\n gettimeofday(&tv, NULL);\n *seconds = tv.tv_sec;\n *milliseconds = tv.tv_usec/1000;\n}\n\nstatic void aeAddMillisecondsToNow(long long milliseconds, long *sec, long *ms) {\n long cur_sec, cur_ms, when_sec, when_ms;\n\n aeGetTime(&cur_sec, &cur_ms);\n when_sec = cur_sec + milliseconds/1000;\n when_ms = cur_ms + milliseconds%1000;\n if (when_ms >= 1000) {\n when_sec ++;\n when_ms -= 1000;\n }\n *sec = when_sec;\n *ms = when_ms;\n}\n\nlong long aeCreateTimeEvent(aeEventLoop *eventLoop, long long milliseconds,\n aeTimeProc *proc, void *clientData,\n aeEventFinalizerProc *finalizerProc)\n{\n long long id = eventLoop->timeEventNextId++;\n aeTimeEvent *te;\n\n te = dalloc(sizeof(*te));\n if (te == NULL) return AE_ERR;\n te->id = id;\n aeAddMillisecondsToNow(milliseconds,&te->when_sec,&te->when_ms);\n te->timeProc = proc;\n te->finalizerProc = finalizerProc;\n te->clientData = clientData;\n te->next = eventLoop->timeEventHead;\n eventLoop->timeEventHead = te;\n return id;\n}\n\nint aeDeleteTimeEvent(aeEventLoop *eventLoop, long long id)\n{\n aeTimeEvent *te = eventLoop->timeEventHead;\n while(te) {\n if (te->id == id) {\n te->id = AE_DELETED_EVENT_ID;\n return AE_OK;\n }\n te = te->next;\n }\n return AE_ERR; /* NO event with the specified ID found */\n}\n\n/* Search the first timer to fire.\n * This operation is useful to know how many time the select can be\n * put in sleep without to delay any event.\n * If there are no timers NULL is returned.\n *\n * Note that's O(N) since time events are unsorted.\n * Possible optimizations (not needed by Redis so far, but...):\n * 1) Insert the event in order, so that the nearest is just the head.\n * Much better but still insertion or deletion of timers is O(N).\n * 2) Use a skiplist to have this operation as O(1) and insertion as O(log(N)).\n */\nstatic aeTimeEvent *aeSearchNearestTimer(aeEventLoop *eventLoop)\n{\n aeTimeEvent *te = eventLoop->timeEventHead;\n aeTimeEvent *nearest = NULL;\n\n while(te) {\n if (!nearest || te->when_sec < nearest->when_sec ||\n (te->when_sec == nearest->when_sec &&\n te->when_ms < nearest->when_ms))\n nearest = te;\n te = te->next;\n }\n return nearest;\n}\n\n/* Process time events */\nstatic int processTimeEvents(aeEventLoop *eventLoop) {\n int processed = 0;\n aeTimeEvent *te, *prev;\n long long maxId;\n time_t now = time(NULL);\n\n /* If the system clock is moved to the future, and then set back to the\n * right value, time events may be delayed in a random way. Often this\n * means that scheduled operations will not be performed soon enough.\n *\n * Here we try to detect system clock skews, and force all the time\n * events to be processed ASAP when this happens: the idea is that\n * processing events earlier is less dangerous than delaying them\n * indefinitely, and practice suggests it is. */\n if (now < eventLoop->lastTime) {\n te = eventLoop->timeEventHead;\n while(te) {\n te->when_sec = 0;\n te = te->next;\n }\n }\n eventLoop->lastTime = now;\n\n prev = NULL;\n te = eventLoop->timeEventHead;\n maxId = eventLoop->timeEventNextId-1;\n while(te) {\n long now_sec, now_ms;\n long long id;\n\n /* Remove events scheduled for deletion. */\n if (te->id == AE_DELETED_EVENT_ID) {\n aeTimeEvent *next = te->next;\n if (prev == NULL)\n eventLoop->timeEventHead = te->next;\n else\n prev->next = te->next;\n if (te->finalizerProc)\n te->finalizerProc(eventLoop, te->clientData);\n dfree(te);\n te = next;\n continue;\n }\n\n /* Make sure we don't process time events created by time events in\n * this iteration. Note that this check is currently useless: we always\n * add new timers on the head, however if we change the implementation\n * detail, this check may be useful again: we keep it here for future\n * defense. */\n if (te->id > maxId) {\n te = te->next;\n continue;\n }\n aeGetTime(&now_sec, &now_ms);\n if (now_sec > te->when_sec ||\n (now_sec == te->when_sec && now_ms >= te->when_ms))\n {\n int retval;\n\n id = te->id;\n retval = te->timeProc(eventLoop, id, te->clientData);\n processed++;\n if (retval != AE_NOMORE) {\n aeAddMillisecondsToNow(retval,&te->when_sec,&te->when_ms);\n } else {\n te->id = AE_DELETED_EVENT_ID;\n }\n }\n prev = te;\n te = te->next;\n }\n return processed;\n}\n\n/* Process every pending time event, then every pending file event\n * (that may be registered by time event callbacks just processed).\n * Without special flags the function sleeps until some file event\n * fires, or when the next time event occurs (if any).\n *\n * If flags is 0, the function does nothing and returns.\n * if flags has AE_ALL_EVENTS set, all the kind of events are processed.\n * if flags has AE_FILE_EVENTS set, file events are processed.\n * if flags has AE_TIME_EVENTS set, time events are processed.\n * if flags has AE_DONT_WAIT set the function returns ASAP until all\n * the events that's possible to process without to wait are processed.\n *\n * The function returns the number of events processed. */\nint aeProcessEvents(aeEventLoop *eventLoop, int flags)\n{\n int processed = 0, numevents;\n\n /* Nothing to do? return ASAP */\n if (!(flags & AE_TIME_EVENTS) && !(flags & AE_FILE_EVENTS)) return 0;\n\n /* Note that we want call select() even if there are no\n * file events to process as long as we want to process time\n * events, in order to sleep until the next time event is ready\n * to fire. */\n if (eventLoop->maxfd != -1 ||\n ((flags & AE_TIME_EVENTS) && !(flags & AE_DONT_WAIT))) {\n int j;\n aeTimeEvent *shortest = NULL;\n struct timeval tv, *tvp;\n\n if (flags & AE_TIME_EVENTS && !(flags & AE_DONT_WAIT))\n shortest = aeSearchNearestTimer(eventLoop);\n if (shortest) {\n long now_sec, now_ms;\n\n aeGetTime(&now_sec, &now_ms);\n tvp = &tv;\n\n /* How many milliseconds we need to wait for the next\n * time event to fire? */\n long long ms =\n (shortest->when_sec - now_sec)*1000 +\n shortest->when_ms - now_ms;\n\n if (ms > 0) {\n tvp->tv_sec = ms/1000;\n tvp->tv_usec = (ms % 1000)*1000;\n } else {\n tvp->tv_sec = 0;\n tvp->tv_usec = 0;\n }\n } else {\n /* If we have to check for events but need to return\n * ASAP because of AE_DONT_WAIT we need to set the timeout\n * to zero */\n if (flags & AE_DONT_WAIT) {\n tv.tv_sec = tv.tv_usec = 0;\n tvp = &tv;\n } else {\n /* Otherwise we can block */\n tvp = NULL; /* wait forever */\n }\n }\n\n numevents = aeApiPoll(eventLoop, tvp);\n for (j = 0; j < numevents; j++) {\n aeFileEvent *fe = &eventLoop->events[eventLoop->fired[j].fd];\n int mask = eventLoop->fired[j].mask;\n int fd = eventLoop->fired[j].fd;\n int rfired = 0;\n\n\t /* note the fe->mask & mask & ... code: maybe an already processed\n * event removed an element that fired and we still didn't\n * processed, so we check if the event is still valid. */\n if (fe->mask & mask & AE_READABLE) {\n rfired = 1;\n fe->rfileProc(eventLoop,fd,fe->clientData,mask);\n }\n if (fe->mask & mask & AE_WRITABLE) {\n if (!rfired || fe->wfileProc != fe->rfileProc)\n fe->wfileProc(eventLoop,fd,fe->clientData,mask);\n }\n processed++;\n }\n }\n /* Check time events */\n if (flags & AE_TIME_EVENTS)\n processed += processTimeEvents(eventLoop);\n\n return processed; /* return the number of processed file/time events */\n}\n\n/* Wait for milliseconds until the given file descriptor becomes\n * writable/readable/exception */\nint aeWait(int fd, int mask, long long milliseconds) {\n struct pollfd pfd;\n int retmask = 0, retval;\n\n memset(&pfd, 0, sizeof(pfd));\n pfd.fd = fd;\n if (mask & AE_READABLE) pfd.events |= POLLIN;\n if (mask & AE_WRITABLE) pfd.events |= POLLOUT;\n\n if ((retval = poll(&pfd, 1, milliseconds))== 1) {\n if (pfd.revents & POLLIN) retmask |= AE_READABLE;\n if (pfd.revents & POLLOUT) retmask |= AE_WRITABLE;\n\tif (pfd.revents & POLLERR) retmask |= AE_WRITABLE;\n if (pfd.revents & POLLHUP) retmask |= AE_WRITABLE;\n return retmask;\n } else {\n return retval;\n }\n}\n\nvoid aeMain(aeEventLoop *eventLoop) {\n eventLoop->stop = 0;\n while (!eventLoop->stop) {\n if (eventLoop->beforesleep != NULL)\n eventLoop->beforesleep(eventLoop, eventLoop->bsdata);\n aeProcessEvents(eventLoop, AE_ALL_EVENTS);\n }\n}\n\nchar *aeGetApiName(void) {\n return aeApiName();\n}\n\nvoid aeSetBeforeSleepProc(aeEventLoop *eventLoop, aeBeforeSleepProc *beforesleep, void *private_data) {\n eventLoop->beforesleep = beforesleep;\n eventLoop->bsdata = private_data;\n}\n" }, { "path": "dep/ae/ae.h", "content": "/* A simple event-driven programming library. Originally I wrote this code\n * for the Jim's event-loop (Jim is a Tcl interpreter) but later translated\n * it in form of a library for easy reuse.\n *\n * Copyright (c) 2006-2012, Salvatore Sanfilippo \n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * * Neither the name of Redis nor the names of its contributors may be used\n * to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n#ifndef __AE_H__\n#define __AE_H__\n\n#include \n\n#define AE_OK 0\n#define AE_ERR -1\n\n#define AE_NONE 0\n#define AE_READABLE 1\n#define AE_WRITABLE 2\n\n#define AE_FILE_EVENTS 1\n#define AE_TIME_EVENTS 2\n#define AE_ALL_EVENTS (AE_FILE_EVENTS|AE_TIME_EVENTS)\n#define AE_DONT_WAIT 4\n\n#define AE_NOMORE -1\n#define AE_DELETED_EVENT_ID -1\n\n/* Macros */\n#define AE_NOTUSED(V) ((void) V)\n\nstruct aeEventLoop;\n\n/* Types and data structures */\ntypedef void aeFileProc(struct aeEventLoop *eventLoop, int fd, void *clientData, int mask);\ntypedef int aeTimeProc(struct aeEventLoop *eventLoop, long long id, void *clientData);\ntypedef void aeEventFinalizerProc(struct aeEventLoop *eventLoop, void *clientData);\ntypedef void aeBeforeSleepProc(struct aeEventLoop *eventLoop, void *private_data);\n\n/* File event structure */\ntypedef struct aeFileEvent {\n int mask; /* one of AE_(READABLE|WRITABLE) */\n aeFileProc *rfileProc;\n aeFileProc *wfileProc;\n void *clientData;\n} aeFileEvent;\n\n/* Time event structure */\ntypedef struct aeTimeEvent {\n long long id; /* time event identifier. */\n long when_sec; /* seconds */\n long when_ms; /* milliseconds */\n aeTimeProc *timeProc;\n aeEventFinalizerProc *finalizerProc;\n void *clientData;\n struct aeTimeEvent *next;\n} aeTimeEvent;\n\n/* A fired event */\ntypedef struct aeFiredEvent {\n int fd;\n int mask;\n} aeFiredEvent;\n\n/* State of an event based program */\ntypedef struct aeEventLoop {\n int maxfd; /* highest file descriptor currently registered */\n int setsize; /* max number of file descriptors tracked */\n long long timeEventNextId;\n time_t lastTime; /* Used to detect system clock skew */\n aeFileEvent *events; /* Registered events */\n aeFiredEvent *fired; /* Fired events */\n aeTimeEvent *timeEventHead;\n int stop;\n void *apidata; /* This is used for polling API specific data */\n aeBeforeSleepProc *beforesleep;\n void *bsdata; /* This is used for beforesleep private data */\n} aeEventLoop;\n\n/* Prototypes */\naeEventLoop *aeCreateEventLoop(int setsize);\nvoid aeDeleteEventLoop(aeEventLoop *eventLoop);\nvoid aeStop(aeEventLoop *eventLoop);\nint aeCreateFileEvent(aeEventLoop *eventLoop, int fd, int mask,\n aeFileProc *proc, void *clientData);\nvoid aeDeleteFileEvent(aeEventLoop *eventLoop, int fd, int mask);\nint aeGetFileEvents(aeEventLoop *eventLoop, int fd);\nlong long aeCreateTimeEvent(aeEventLoop *eventLoop, long long milliseconds,\n aeTimeProc *proc, void *clientData,\n aeEventFinalizerProc *finalizerProc);\nint aeDeleteTimeEvent(aeEventLoop *eventLoop, long long id);\nint aeProcessEvents(aeEventLoop *eventLoop, int flags);\nint aeWait(int fd, int mask, long long milliseconds);\nvoid aeMain(aeEventLoop *eventLoop);\nchar *aeGetApiName(void);\nvoid aeSetBeforeSleepProc(aeEventLoop *eventLoop, aeBeforeSleepProc *beforesleep, void *private_data);\nint aeGetSetSize(aeEventLoop *eventLoop);\nint aeResizeSetSize(aeEventLoop *eventLoop, int setsize);\n\n#endif\n" }, { "path": "dep/ae/ae_epoll.c", "content": "/* Linux epoll(2) based ae.c module\n *\n * Copyright (c) 2009-2012, Salvatore Sanfilippo \n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * * Neither the name of Redis nor the names of its contributors may be used\n * to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n\n#include \n\ntypedef struct aeApiState {\n int epfd;\n struct epoll_event *events;\n} aeApiState;\n\nstatic int aeApiCreate(aeEventLoop *eventLoop) {\n aeApiState *state = dalloc(sizeof(aeApiState));\n\n if (!state) return -1;\n state->events = dalloc(sizeof(struct epoll_event)*eventLoop->setsize);\n if (!state->events) {\n dfree(state);\n return -1;\n }\n state->epfd = epoll_create(1024); /* 1024 is just a hint for the kernel */\n if (state->epfd == -1) {\n dfree(state->events);\n dfree(state);\n return -1;\n }\n eventLoop->apidata = state;\n return 0;\n}\n\nstatic int aeApiResize(aeEventLoop *eventLoop, int setsize) {\n aeApiState *state = eventLoop->apidata;\n\n state->events = drealloc(state->events, sizeof(struct epoll_event)*setsize);\n return 0;\n}\n\nstatic void aeApiFree(aeEventLoop *eventLoop) {\n aeApiState *state = eventLoop->apidata;\n\n close(state->epfd);\n dfree(state->events);\n dfree(state);\n}\n\nstatic int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {\n aeApiState *state = eventLoop->apidata;\n struct epoll_event ee = {0}; /* avoid valgrind warning */\n /* If the fd was already monitored for some event, we need a MOD\n * operation. Otherwise we need an ADD operation. */\n int op = eventLoop->events[fd].mask == AE_NONE ?\n EPOLL_CTL_ADD : EPOLL_CTL_MOD;\n\n ee.events = 0;\n mask |= eventLoop->events[fd].mask; /* Merge old events */\n if (mask & AE_READABLE) ee.events |= EPOLLIN;\n if (mask & AE_WRITABLE) ee.events |= EPOLLOUT;\n ee.data.fd = fd;\n if (epoll_ctl(state->epfd,op,fd,&ee) == -1) return -1;\n return 0;\n}\n\nstatic void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int delmask) {\n aeApiState *state = eventLoop->apidata;\n struct epoll_event ee = {0}; /* avoid valgrind warning */\n int mask = eventLoop->events[fd].mask & (~delmask);\n\n ee.events = 0;\n if (mask & AE_READABLE) ee.events |= EPOLLIN;\n if (mask & AE_WRITABLE) ee.events |= EPOLLOUT;\n ee.data.fd = fd;\n if (mask != AE_NONE) {\n epoll_ctl(state->epfd,EPOLL_CTL_MOD,fd,&ee);\n } else {\n /* Note, Kernel < 2.6.9 requires a non null event pointer even for\n * EPOLL_CTL_DEL. */\n epoll_ctl(state->epfd,EPOLL_CTL_DEL,fd,&ee);\n }\n}\n\nstatic int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {\n aeApiState *state = eventLoop->apidata;\n int retval, numevents = 0;\n\n retval = epoll_wait(state->epfd,state->events,eventLoop->setsize,\n tvp ? (tvp->tv_sec*1000 + tvp->tv_usec/1000) : -1);\n if (retval > 0) {\n int j;\n\n numevents = retval;\n for (j = 0; j < numevents; j++) {\n int mask = 0;\n struct epoll_event *e = state->events+j;\n\n if (e->events & EPOLLIN) mask |= AE_READABLE;\n if (e->events & EPOLLOUT) mask |= AE_WRITABLE;\n if (e->events & EPOLLERR) mask |= AE_WRITABLE;\n if (e->events & EPOLLHUP) mask |= AE_WRITABLE;\n eventLoop->fired[j].fd = e->data.fd;\n eventLoop->fired[j].mask = mask;\n }\n }\n return numevents;\n}\n\nstatic char *aeApiName(void) {\n return \"epoll\";\n}\n" }, { "path": "dep/ae/ae_evport.c", "content": "/* ae.c module for illumos event ports.\n *\n * Copyright (c) 2012, Joyent, Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * * Neither the name of Redis nor the names of its contributors may be used\n * to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n\n#include \n#include \n#include \n#include \n\n#include \n#include \n\n#include \n\nstatic int evport_debug = 0;\n\n/*\n * This file implements the ae API using event ports, present on Solaris-based\n * systems since Solaris 10. Using the event port interface, we associate file\n * descriptors with the port. Each association also includes the set of poll(2)\n * events that the consumer is interested in (e.g., POLLIN and POLLOUT).\n *\n * There's one tricky piece to this implementation: when we return events via\n * aeApiPoll, the corresponding file descriptors become dissociated from the\n * port. This is necessary because poll events are level-triggered, so if the\n * fd didn't become dissociated, it would immediately fire another event since\n * the underlying state hasn't changed yet. We must re-associate the file\n * descriptor, but only after we know that our caller has actually read from it.\n * The ae API does not tell us exactly when that happens, but we do know that\n * it must happen by the time aeApiPoll is called again. Our solution is to\n * keep track of the last fds returned by aeApiPoll and re-associate them next\n * time aeApiPoll is invoked.\n *\n * To summarize, in this module, each fd association is EITHER (a) represented\n * only via the in-kernel association OR (b) represented by pending_fds and\n * pending_masks. (b) is only true for the last fds we returned from aeApiPoll,\n * and only until we enter aeApiPoll again (at which point we restore the\n * in-kernel association).\n */\n#define MAX_EVENT_BATCHSZ 512\n\ntypedef struct aeApiState {\n int portfd; /* event port */\n int npending; /* # of pending fds */\n int pending_fds[MAX_EVENT_BATCHSZ]; /* pending fds */\n int pending_masks[MAX_EVENT_BATCHSZ]; /* pending fds' masks */\n} aeApiState;\n\nstatic int aeApiCreate(aeEventLoop *eventLoop) {\n int i;\n aeApiState *state = dalloc(sizeof(aeApiState));\n if (!state) return -1;\n\n state->portfd = port_create();\n if (state->portfd == -1) {\n dfree(state);\n return -1;\n }\n\n state->npending = 0;\n\n for (i = 0; i < MAX_EVENT_BATCHSZ; i++) {\n state->pending_fds[i] = -1;\n state->pending_masks[i] = AE_NONE;\n }\n\n eventLoop->apidata = state;\n return 0;\n}\n\nstatic int aeApiResize(aeEventLoop *eventLoop, int setsize) {\n /* Nothing to resize here. */\n return 0;\n}\n\nstatic void aeApiFree(aeEventLoop *eventLoop) {\n aeApiState *state = eventLoop->apidata;\n\n close(state->portfd);\n dfree(state);\n}\n\nstatic int aeApiLookupPending(aeApiState *state, int fd) {\n int i;\n\n for (i = 0; i < state->npending; i++) {\n if (state->pending_fds[i] == fd)\n return (i);\n }\n\n return (-1);\n}\n\n/*\n * Helper function to invoke port_associate for the given fd and mask.\n */\nstatic int aeApiAssociate(const char *where, int portfd, int fd, int mask) {\n int events = 0;\n int rv, err;\n\n if (mask & AE_READABLE)\n events |= POLLIN;\n if (mask & AE_WRITABLE)\n events |= POLLOUT;\n\n if (evport_debug)\n fprintf(stderr, \"%s: port_associate(%d, 0x%x) = \", where, fd, events);\n\n rv = port_associate(portfd, PORT_SOURCE_FD, fd, events,\n (void *)(uintptr_t)mask);\n err = errno;\n\n if (evport_debug)\n fprintf(stderr, \"%d (%s)\\n\", rv, rv == 0 ? \"no error\" : strerror(err));\n\n if (rv == -1) {\n fprintf(stderr, \"%s: port_associate: %s\\n\", where, strerror(err));\n\n if (err == EAGAIN)\n fprintf(stderr, \"aeApiAssociate: event port limit exceeded.\");\n }\n\n return rv;\n}\n\nstatic int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {\n aeApiState *state = eventLoop->apidata;\n int fullmask, pfd;\n\n if (evport_debug)\n fprintf(stderr, \"aeApiAddEvent: fd %d mask 0x%x\\n\", fd, mask);\n\n /*\n * Since port_associate's \"events\" argument replaces any existing events, we\n * must be sure to include whatever events are already associated when\n * we call port_associate() again.\n */\n fullmask = mask | eventLoop->events[fd].mask;\n pfd = aeApiLookupPending(state, fd);\n\n if (pfd != -1) {\n /*\n * This fd was recently returned from aeApiPoll. It should be safe to\n * assume that the consumer has processed that poll event, but we play\n * it safer by simply updating pending_mask. The fd will be\n * re-associated as usual when aeApiPoll is called again.\n */\n if (evport_debug)\n fprintf(stderr, \"aeApiAddEvent: adding to pending fd %d\\n\", fd);\n state->pending_masks[pfd] |= fullmask;\n return 0;\n }\n\n return (aeApiAssociate(\"aeApiAddEvent\", state->portfd, fd, fullmask));\n}\n\nstatic void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int mask) {\n aeApiState *state = eventLoop->apidata;\n int fullmask, pfd;\n\n if (evport_debug)\n fprintf(stderr, \"del fd %d mask 0x%x\\n\", fd, mask);\n\n pfd = aeApiLookupPending(state, fd);\n\n if (pfd != -1) {\n if (evport_debug)\n fprintf(stderr, \"deleting event from pending fd %d\\n\", fd);\n\n /*\n * This fd was just returned from aeApiPoll, so it's not currently\n * associated with the port. All we need to do is update\n * pending_mask appropriately.\n */\n state->pending_masks[pfd] &= ~mask;\n\n if (state->pending_masks[pfd] == AE_NONE)\n state->pending_fds[pfd] = -1;\n\n return;\n }\n\n /*\n * The fd is currently associated with the port. Like with the add case\n * above, we must look at the full mask for the file descriptor before\n * updating that association. We don't have a good way of knowing what the\n * events are without looking into the eventLoop state directly. We rely on\n * the fact that our caller has already updated the mask in the eventLoop.\n */\n\n fullmask = eventLoop->events[fd].mask;\n if (fullmask == AE_NONE) {\n /*\n * We're removing *all* events, so use port_dissociate to remove the\n * association completely. Failure here indicates a bug.\n */\n if (evport_debug)\n fprintf(stderr, \"aeApiDelEvent: port_dissociate(%d)\\n\", fd);\n\n if (port_dissociate(state->portfd, PORT_SOURCE_FD, fd) != 0) {\n perror(\"aeApiDelEvent: port_dissociate\");\n abort(); /* will not return */\n }\n } else if (aeApiAssociate(\"aeApiDelEvent\", state->portfd, fd,\n fullmask) != 0) {\n /*\n * ENOMEM is a potentially transient condition, but the kernel won't\n * generally return it unless things are really bad. EAGAIN indicates\n * we've reached an resource limit, for which it doesn't make sense to\n * retry (counter-intuitively). All other errors indicate a bug. In any\n * of these cases, the best we can do is to abort.\n */\n abort(); /* will not return */\n }\n}\n\nstatic int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {\n aeApiState *state = eventLoop->apidata;\n struct timespec timeout, *tsp;\n int mask, i;\n uint_t nevents;\n port_event_t event[MAX_EVENT_BATCHSZ];\n\n /*\n * If we've returned fd events before, we must re-associate them with the\n * port now, before calling port_get(). See the block comment at the top of\n * this file for an explanation of why.\n */\n for (i = 0; i < state->npending; i++) {\n if (state->pending_fds[i] == -1)\n /* This fd has since been deleted. */\n continue;\n\n if (aeApiAssociate(\"aeApiPoll\", state->portfd,\n state->pending_fds[i], state->pending_masks[i]) != 0) {\n /* See aeApiDelEvent for why this case is fatal. */\n abort();\n }\n\n state->pending_masks[i] = AE_NONE;\n state->pending_fds[i] = -1;\n }\n\n state->npending = 0;\n\n if (tvp != NULL) {\n timeout.tv_sec = tvp->tv_sec;\n timeout.tv_nsec = tvp->tv_usec * 1000;\n tsp = &timeout;\n } else {\n tsp = NULL;\n }\n\n /*\n * port_getn can return with errno == ETIME having returned some events (!).\n * So if we get ETIME, we check nevents, too.\n */\n nevents = 1;\n if (port_getn(state->portfd, event, MAX_EVENT_BATCHSZ, &nevents,\n tsp) == -1 && (errno != ETIME || nevents == 0)) {\n if (errno == ETIME || errno == EINTR)\n return 0;\n\n /* Any other error indicates a bug. */\n perror(\"aeApiPoll: port_get\");\n abort();\n }\n\n state->npending = nevents;\n\n for (i = 0; i < nevents; i++) {\n mask = 0;\n if (event[i].portev_events & POLLIN)\n mask |= AE_READABLE;\n if (event[i].portev_events & POLLOUT)\n mask |= AE_WRITABLE;\n\n eventLoop->fired[i].fd = event[i].portev_object;\n eventLoop->fired[i].mask = mask;\n\n if (evport_debug)\n fprintf(stderr, \"aeApiPoll: fd %d mask 0x%x\\n\",\n (int)event[i].portev_object, mask);\n\n state->pending_fds[i] = event[i].portev_object;\n state->pending_masks[i] = (uintptr_t)event[i].portev_user;\n }\n\n return nevents;\n}\n\nstatic char *aeApiName(void) {\n return \"evport\";\n}\n" }, { "path": "dep/ae/ae_kqueue.c", "content": "/* Kqueue(2)-based ae.c module\n *\n * Copyright (C) 2009 Harish Mallipeddi - harish.mallipeddi@gmail.com\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * * Neither the name of Redis nor the names of its contributors may be used\n * to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n\n#include \n#include \n#include \n\ntypedef struct aeApiState {\n int kqfd;\n struct kevent *events;\n} aeApiState;\n\nstatic int aeApiCreate(aeEventLoop *eventLoop) {\n aeApiState *state = dalloc(sizeof(aeApiState));\n\n if (!state) return -1;\n state->events = dalloc(sizeof(struct kevent)*eventLoop->setsize);\n if (!state->events) {\n dfree(state);\n return -1;\n }\n state->kqfd = kqueue();\n if (state->kqfd == -1) {\n dfree(state->events);\n dfree(state);\n return -1;\n }\n eventLoop->apidata = state;\n return 0;\n}\n\nstatic int aeApiResize(aeEventLoop *eventLoop, int setsize) {\n aeApiState *state = eventLoop->apidata;\n\n state->events = drealloc(state->events, sizeof(struct kevent)*setsize);\n return 0;\n}\n\nstatic void aeApiFree(aeEventLoop *eventLoop) {\n aeApiState *state = eventLoop->apidata;\n\n close(state->kqfd);\n dfree(state->events);\n dfree(state);\n}\n\nstatic int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {\n aeApiState *state = eventLoop->apidata;\n struct kevent ke;\n\n if (mask & AE_READABLE) {\n EV_SET(&ke, fd, EVFILT_READ, EV_ADD, 0, 0, NULL);\n if (kevent(state->kqfd, &ke, 1, NULL, 0, NULL) == -1) return -1;\n }\n if (mask & AE_WRITABLE) {\n EV_SET(&ke, fd, EVFILT_WRITE, EV_ADD, 0, 0, NULL);\n if (kevent(state->kqfd, &ke, 1, NULL, 0, NULL) == -1) return -1;\n }\n return 0;\n}\n\nstatic void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int mask) {\n aeApiState *state = eventLoop->apidata;\n struct kevent ke;\n\n if (mask & AE_READABLE) {\n EV_SET(&ke, fd, EVFILT_READ, EV_DELETE, 0, 0, NULL);\n kevent(state->kqfd, &ke, 1, NULL, 0, NULL);\n }\n if (mask & AE_WRITABLE) {\n EV_SET(&ke, fd, EVFILT_WRITE, EV_DELETE, 0, 0, NULL);\n kevent(state->kqfd, &ke, 1, NULL, 0, NULL);\n }\n}\n\nstatic int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {\n aeApiState *state = eventLoop->apidata;\n int retval, numevents = 0;\n\n if (tvp != NULL) {\n struct timespec timeout;\n timeout.tv_sec = tvp->tv_sec;\n timeout.tv_nsec = tvp->tv_usec * 1000;\n retval = kevent(state->kqfd, NULL, 0, state->events, eventLoop->setsize,\n &timeout);\n } else {\n retval = kevent(state->kqfd, NULL, 0, state->events, eventLoop->setsize,\n NULL);\n }\n\n if (retval > 0) {\n int j;\n\n numevents = retval;\n for(j = 0; j < numevents; j++) {\n int mask = 0;\n struct kevent *e = state->events+j;\n\n if (e->filter == EVFILT_READ) mask |= AE_READABLE;\n if (e->filter == EVFILT_WRITE) mask |= AE_WRITABLE;\n eventLoop->fired[j].fd = e->ident;\n eventLoop->fired[j].mask = mask;\n }\n }\n return numevents;\n}\n\nstatic char *aeApiName(void) {\n return \"kqueue\";\n}\n" }, { "path": "dep/ae/ae_select.c", "content": "/* Select()-based ae.c module.\n *\n * Copyright (c) 2009-2012, Salvatore Sanfilippo \n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * * Neither the name of Redis nor the names of its contributors may be used\n * to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n\n#include \n\ntypedef struct aeApiState {\n fd_set rfds, wfds;\n /* We need to have a copy of the fd sets as it's not safe to reuse\n * FD sets after select(). */\n fd_set _rfds, _wfds;\n} aeApiState;\n\nstatic int aeApiCreate(aeEventLoop *eventLoop) {\n aeApiState *state = dalloc(sizeof(aeApiState));\n\n if (!state) return -1;\n FD_ZERO(&state->rfds);\n FD_ZERO(&state->wfds);\n eventLoop->apidata = state;\n return 0;\n}\n\nstatic int aeApiResize(aeEventLoop *eventLoop, int setsize) {\n /* Just ensure we have enough room in the fd_set type. */\n if (setsize >= FD_SETSIZE) return -1;\n return 0;\n}\n\nstatic void aeApiFree(aeEventLoop *eventLoop) {\n dfree(eventLoop->apidata);\n}\n\nstatic int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {\n aeApiState *state = eventLoop->apidata;\n\n if (mask & AE_READABLE) FD_SET(fd,&state->rfds);\n if (mask & AE_WRITABLE) FD_SET(fd,&state->wfds);\n return 0;\n}\n\nstatic void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int mask) {\n aeApiState *state = eventLoop->apidata;\n\n if (mask & AE_READABLE) FD_CLR(fd,&state->rfds);\n if (mask & AE_WRITABLE) FD_CLR(fd,&state->wfds);\n}\n\nstatic int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {\n aeApiState *state = eventLoop->apidata;\n int retval, j, numevents = 0;\n\n memcpy(&state->_rfds,&state->rfds,sizeof(fd_set));\n memcpy(&state->_wfds,&state->wfds,sizeof(fd_set));\n\n retval = select(eventLoop->maxfd+1,\n &state->_rfds,&state->_wfds,NULL,tvp);\n if (retval > 0) {\n for (j = 0; j <= eventLoop->maxfd; j++) {\n int mask = 0;\n aeFileEvent *fe = &eventLoop->events[j];\n\n if (fe->mask == AE_NONE) continue;\n if (fe->mask & AE_READABLE && FD_ISSET(j,&state->_rfds))\n mask |= AE_READABLE;\n if (fe->mask & AE_WRITABLE && FD_ISSET(j,&state->_wfds))\n mask |= AE_WRITABLE;\n eventLoop->fired[numevents].fd = j;\n eventLoop->fired[numevents].mask = mask;\n numevents++;\n }\n }\n return numevents;\n}\n\nstatic char *aeApiName(void) {\n return \"select\";\n}\n" }, { "path": "dep/darray/Makefile.am", "content": "MAINTAINERCLEANFILES = Makefile.in\n\nAM_CPPFLAGS =\nif !OS_SOLARIS\nAM_CPPFLAGS += -D_GNU_SOURCE\nendif\nAM_CPPFLAGS += -I $(top_srcdir)/dep/util\nAM_CPPFLAGS += -I $(top_srcdir)/dep/jemalloc-4.2.0/include\nAM_CPPFLAGS += -I $(top_srcdir)/dep/dmalloc\n\nAM_CFLAGS = -Wall -Wshadow\nAM_CFLAGS += -Wno-unused-parameter -Wno-unused-value\n\nnoinst_LIBRARIES = libdarray.a\n\nnoinst_HEADERS = darray.h\n\nlibdarray_a_SOURCES = \\\n\tdarray.c darray.h" }, { "path": "dep/darray/darray.c", "content": "#include \n\n#include \n\n#include \n\ndarray *\ndarray_create(unsigned long long n, size_t size)\n{\n darray *a;\n\n a = dalloc(sizeof(*a));\n if (a == NULL) {\n return NULL;\n }\n\n a->elem = dalloc(n * size);\n if (a->elem == NULL) {\n dfree(a);\n return NULL;\n }\n\n a->nelem = 0;\n a->size = size;\n a->nalloc = n;\n\n return a;\n}\n\nvoid\ndarray_destroy(darray *a)\n{\n darray_deinit(a);\n dfree(a);\n}\n\nint\ndarray_init(darray *a, unsigned long long n, size_t size)\n{\n a->elem = dalloc(n * size);\n if (a->elem == NULL) {\n return -1;\n }\n\n a->nelem = 0;\n a->size = size;\n a->nalloc = n;\n\n return 0;\n}\n\nvoid\ndarray_deinit(darray *a)\n{\n if (a->elem != NULL) {\n dfree(a->elem);\n }\n}\n\nunsigned long long\ndarray_idx(darray *a, void *elem)\n{\n char *p, *q;\n unsigned long long off, idx;\n\n p = a->elem;\n q = elem;\n off = (unsigned long long)(q - p);\n\n idx = off / (unsigned long long)a->size;\n\n return idx;\n}\n\nvoid *\ndarray_push(darray *a)\n{\n void *elem, *new;\n size_t size;\n\n if (a->nelem == a->nalloc) {\n\n /* the array is full; allocate new array */\n size = a->size * a->nalloc;\n new = drealloc(a->elem, 2 * size);\n if (new == NULL) {\n return NULL;\n }\n\n a->elem = new;\n a->nalloc *= 2;\n }\n\n elem = (char *)a->elem + a->size * a->nelem;\n a->nelem++;\n\n return elem;\n}\n\nvoid *\ndarray_pop(darray *a)\n{\n void *elem;\n\n a->nelem--;\n elem = (char *)a->elem + a->size * a->nelem;\n\n return elem;\n}\n\nvoid *\ndarray_get(darray *a, unsigned long long idx)\n{\n void *elem;\n\n elem = (char *)a->elem + (a->size * idx);\n\n return elem;\n}\n\nvoid *\ndarray_top(darray *a)\n{\n return darray_get(a, a->nelem - 1);\n}\n\nvoid\ndarray_swap(darray *a, darray *b)\n{\n darray tmp;\n\n tmp = *a;\n *a = *b;\n *b = tmp;\n}\n\n/*\n * Sort nelem elements of the array in ascending order based on the\n * compare comparator.\n */\nvoid\ndarray_sort(darray *a, darray_compare_t compare)\n{\n qsort(a->elem, a->nelem, a->size, compare);\n}\n\n/*\n * Calls the func once for each element in the array as long as func returns\n * success. On failure short-circuits and returns the error status.\n */\nint\ndarray_each(darray *a, darray_each_t func, void *data)\n{\n unsigned long long i, nelem;\n\n for (i = 0, nelem = darray_n(a); i < nelem; i++) {\n void *elem = darray_get(a, i);\n int ret;\n\n ret = func(elem, data);\n if (ret != 0) {\n return -1;\n }\n }\n\n return 0;\n}\n" }, { "path": "dep/darray/darray.h", "content": "#ifndef _DARRAY_H_\n#define _DARRAY_H_\n\ntypedef int (*darray_compare_t)(const void *, const void *);\ntypedef int (*darray_each_t)(void *, void *);\n\ntypedef struct darray {\n unsigned long long nelem; /* # element */\n void *elem; /* element */\n size_t size; /* element size */\n unsigned long long nalloc; /* # allocated element */\n} darray;\n\n#define null_darray { 0, NULL, 0, 0 }\n\nstatic inline void\ndarray_null(darray *a)\n{\n a->nelem = 0;\n a->elem = NULL;\n a->size = 0;\n a->nalloc = 0;\n}\n\nstatic inline void\ndarray_set(darray *a, void *elem, size_t size, unsigned long long nalloc)\n{\n a->nelem = 0;\n a->elem = elem;\n a->size = size;\n a->nalloc = nalloc;\n}\n\nstatic inline unsigned long long\ndarray_n(const darray *a)\n{\n return a->nelem;\n}\n\ndarray *darray_create(unsigned long long n, size_t size);\nvoid darray_destroy(darray *a);\nint darray_init(darray *a, unsigned long long n, size_t size);\nvoid darray_deinit(darray *a);\n\nunsigned long long darray_idx(darray *a, void *elem);\nvoid *darray_push(darray *a);\nvoid *darray_pop(darray *a);\nvoid *darray_get(darray *a, unsigned long long idx);\nvoid *darray_top(darray *a);\nvoid darray_swap(darray *a, darray *b);\nvoid darray_sort(darray *a, darray_compare_t compare);\nint darray_each(darray *a, darray_each_t func, void *data);\n\n#endif\n" }, { "path": "dep/dhashkit/Makefile.am", "content": "MAINTAINERCLEANFILES = Makefile.in\n\nAM_CFLAGS = -Wall -Wshadow\nAM_CFLAGS += -Wno-unused-parameter -Wno-unused-value\n\nnoinst_LIBRARIES = libdhashkit.a\n\nnoinst_HEADERS = dhashkit.h\n\nlibdhashkit_a_SOURCES =\t\\\n\tdhashkit.h\t\t \\\n\tdcrc16.c\t\t\t\\\n\tdcrc32.c\t\t\t\\\n\tdfnv.c\t\t\t \\\n\tdhsieh.c\t\t\t\\\n\tdjenkins.c\t\t \\\n\tdketama.c\t\t\t\\\n\tdmd5.c\t\t\t \\\n\tdmodula.c\t\t\t\\\n\tdmurmur.c\t\t\t\\\n\tdone_at_a_time.c\t\\\n\tdrandom.c\t\t\t\\\n\tdsha1.c" }, { "path": "dep/dhashkit/dcrc16.c", "content": "#include \n\nstatic const uint16_t crc16tab[256] = {\n 0x0000, 0x1021, 0x2042, 0x3063, 0x4084, 0x50a5, 0x60c6, 0x70e7,\n 0x8108, 0x9129, 0xa14a, 0xb16b, 0xc18c, 0xd1ad, 0xe1ce, 0xf1ef,\n 0x1231, 0x0210, 0x3273, 0x2252, 0x52b5, 0x4294, 0x72f7, 0x62d6,\n 0x9339, 0x8318, 0xb37b, 0xa35a, 0xd3bd, 0xc39c, 0xf3ff, 0xe3de,\n 0x2462, 0x3443, 0x0420, 0x1401, 0x64e6, 0x74c7, 0x44a4, 0x5485,\n 0xa56a, 0xb54b, 0x8528, 0x9509, 0xe5ee, 0xf5cf, 0xc5ac, 0xd58d,\n 0x3653, 0x2672, 0x1611, 0x0630, 0x76d7, 0x66f6, 0x5695, 0x46b4,\n 0xb75b, 0xa77a, 0x9719, 0x8738, 0xf7df, 0xe7fe, 0xd79d, 0xc7bc,\n 0x48c4, 0x58e5, 0x6886, 0x78a7, 0x0840, 0x1861, 0x2802, 0x3823,\n 0xc9cc, 0xd9ed, 0xe98e, 0xf9af, 0x8948, 0x9969, 0xa90a, 0xb92b,\n 0x5af5, 0x4ad4, 0x7ab7, 0x6a96, 0x1a71, 0x0a50, 0x3a33, 0x2a12,\n 0xdbfd, 0xcbdc, 0xfbbf, 0xeb9e, 0x9b79, 0x8b58, 0xbb3b, 0xab1a,\n 0x6ca6, 0x7c87, 0x4ce4, 0x5cc5, 0x2c22, 0x3c03, 0x0c60, 0x1c41,\n 0xedae, 0xfd8f, 0xcdec, 0xddcd, 0xad2a, 0xbd0b, 0x8d68, 0x9d49,\n 0x7e97, 0x6eb6, 0x5ed5, 0x4ef4, 0x3e13, 0x2e32, 0x1e51, 0x0e70,\n 0xff9f, 0xefbe, 0xdfdd, 0xcffc, 0xbf1b, 0xaf3a, 0x9f59, 0x8f78,\n 0x9188, 0x81a9, 0xb1ca, 0xa1eb, 0xd10c, 0xc12d, 0xf14e, 0xe16f,\n 0x1080, 0x00a1, 0x30c2, 0x20e3, 0x5004, 0x4025, 0x7046, 0x6067,\n 0x83b9, 0x9398, 0xa3fb, 0xb3da, 0xc33d, 0xd31c, 0xe37f, 0xf35e,\n 0x02b1, 0x1290, 0x22f3, 0x32d2, 0x4235, 0x5214, 0x6277, 0x7256,\n 0xb5ea, 0xa5cb, 0x95a8, 0x8589, 0xf56e, 0xe54f, 0xd52c, 0xc50d,\n 0x34e2, 0x24c3, 0x14a0, 0x0481, 0x7466, 0x6447, 0x5424, 0x4405,\n 0xa7db, 0xb7fa, 0x8799, 0x97b8, 0xe75f, 0xf77e, 0xc71d, 0xd73c,\n 0x26d3, 0x36f2, 0x0691, 0x16b0, 0x6657, 0x7676, 0x4615, 0x5634,\n 0xd94c, 0xc96d, 0xf90e, 0xe92f, 0x99c8, 0x89e9, 0xb98a, 0xa9ab,\n 0x5844, 0x4865, 0x7806, 0x6827, 0x18c0, 0x08e1, 0x3882, 0x28a3,\n 0xcb7d, 0xdb5c, 0xeb3f, 0xfb1e, 0x8bf9, 0x9bd8, 0xabbb, 0xbb9a,\n 0x4a75, 0x5a54, 0x6a37, 0x7a16, 0x0af1, 0x1ad0, 0x2ab3, 0x3a92,\n 0xfd2e, 0xed0f, 0xdd6c, 0xcd4d, 0xbdaa, 0xad8b, 0x9de8, 0x8dc9,\n 0x7c26, 0x6c07, 0x5c64, 0x4c45, 0x3ca2, 0x2c83, 0x1ce0, 0x0cc1,\n 0xef1f, 0xff3e, 0xcf5d, 0xdf7c, 0xaf9b, 0xbfba, 0x8fd9, 0x9ff8,\n 0x6e17, 0x7e36, 0x4e55, 0x5e74, 0x2e93, 0x3eb2, 0x0ed1, 0x1ef0,\n};\n\nuint32_t\nhash_crc16(const char *key, size_t key_length)\n{\n uint64_t x;\n uint32_t crc = 0;\n\n for (x=0; x < key_length; x++) {\n crc = (crc << 8) ^ crc16tab[((crc >> 8) ^ *key++) & 0x00ff];\n }\n\n return crc;\n}\n" }, { "path": "dep/dhashkit/dcrc32.c", "content": "#include \n\nstatic const uint32_t crc32tab[256] = {\n 0x00000000, 0x77073096, 0xee0e612c, 0x990951ba,\n 0x076dc419, 0x706af48f, 0xe963a535, 0x9e6495a3,\n 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,\n 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91,\n 0x1db71064, 0x6ab020f2, 0xf3b97148, 0x84be41de,\n 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,\n 0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec,\n 0x14015c4f, 0x63066cd9, 0xfa0f3d63, 0x8d080df5,\n 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,\n 0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b,\n 0x35b5a8fa, 0x42b2986c, 0xdbbbc9d6, 0xacbcf940,\n 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,\n 0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116,\n 0x21b4f4b5, 0x56b3c423, 0xcfba9599, 0xb8bda50f,\n 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,\n 0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d,\n 0x76dc4190, 0x01db7106, 0x98d220bc, 0xefd5102a,\n 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,\n 0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818,\n 0x7f6a0dbb, 0x086d3d2d, 0x91646c97, 0xe6635c01,\n 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,\n 0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457,\n 0x65b0d9c6, 0x12b7e950, 0x8bbeb8ea, 0xfcb9887c,\n 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,\n 0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2,\n 0x4adfa541, 0x3dd895d7, 0xa4d1c46d, 0xd3d6f4fb,\n 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,\n 0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9,\n 0x5005713c, 0x270241aa, 0xbe0b1010, 0xc90c2086,\n 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,\n 0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4,\n 0x59b33d17, 0x2eb40d81, 0xb7bd5c3b, 0xc0ba6cad,\n 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,\n 0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683,\n 0xe3630b12, 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8,\n 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,\n 0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe,\n 0xf762575d, 0x806567cb, 0x196c3671, 0x6e6b06e7,\n 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,\n 0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5,\n 0xd6d6a3e8, 0xa1d1937e, 0x38d8c2c4, 0x4fdff252,\n 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,\n 0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60,\n 0xdf60efc3, 0xa867df55, 0x316e8eef, 0x4669be79,\n 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,\n 0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f,\n 0xc5ba3bbe, 0xb2bd0b28, 0x2bb45a92, 0x5cb36a04,\n 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,\n 0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a,\n 0x9c0906a9, 0xeb0e363f, 0x72076785, 0x05005713,\n 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,\n 0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21,\n 0x86d3d2d4, 0xf1d4e242, 0x68ddb3f8, 0x1fda836e,\n 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,\n 0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c,\n 0x8f659eff, 0xf862ae69, 0x616bffd3, 0x166ccf45,\n 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,\n 0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db,\n 0xaed16a4a, 0xd9d65adc, 0x40df0b66, 0x37d83bf0,\n 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,\n 0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6,\n 0xbad03605, 0xcdd70693, 0x54de5729, 0x23d967bf,\n 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,\n 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d,\n};\n\n/*\n * CRC-32 implementation compatible with libmemcached library. Unfortunately\n * this implementation does not return CRC-32 as per spec.\n */\nuint32_t\nhash_crc32(const char *key, size_t key_length)\n{\n uint64_t x;\n uint32_t crc = UINT32_MAX;\n\n for (x = 0; x < key_length; x++) {\n crc = (crc >> 8) ^ crc32tab[(crc ^ (uint64_t)key[x]) & 0xff];\n }\n\n return ((~crc) >> 16) & 0x7fff;\n}\n\nuint32_t\nhash_crc32a(const char *key, size_t key_length)\n{\n const uint8_t *p = key;\n uint32_t crc;\n\n crc = ~0U;\n while (key_length--) {\n crc = crc32tab[(crc ^ *p++) & 0xFF] ^ (crc >> 8);\n }\n\n return crc ^ ~0U;\n}\n" }, { "path": "dep/dhashkit/dfnv.c", "content": "#include \n\nstatic uint64_t FNV_64_INIT = UINT64_C(0xcbf29ce484222325);\nstatic uint64_t FNV_64_PRIME = UINT64_C(0x100000001b3);\nstatic uint32_t FNV_32_INIT = 2166136261UL;\nstatic uint32_t FNV_32_PRIME = 16777619;\n\nuint32_t\nhash_fnv1_64(const char *key, size_t key_length)\n{\n uint64_t hash = FNV_64_INIT;\n size_t x;\n\n for (x = 0; x < key_length; x++) {\n hash *= FNV_64_PRIME;\n hash ^= (uint64_t)key[x];\n }\n\n return (uint32_t)hash;\n}\n\nuint32_t\nhash_fnv1a_64(const char *key, size_t key_length)\n{\n uint32_t hash = (uint32_t) FNV_64_INIT;\n size_t x;\n\n for (x = 0; x < key_length; x++) {\n uint32_t val = (uint32_t)key[x];\n hash ^= val;\n hash *= (uint32_t) FNV_64_PRIME;\n }\n\n return hash;\n}\n\nuint32_t\nhash_fnv1_32(const char *key, size_t key_length)\n{\n uint32_t hash = FNV_32_INIT;\n size_t x;\n\n for (x = 0; x < key_length; x++) {\n uint32_t val = (uint32_t)key[x];\n hash *= FNV_32_PRIME;\n hash ^= val;\n }\n\n return hash;\n}\n\nuint32_t\nhash_fnv1a_32(const char *key, size_t key_length)\n{\n uint32_t hash = FNV_32_INIT;\n size_t x;\n\n for (x= 0; x < key_length; x++) {\n uint32_t val = (uint32_t)key[x];\n hash ^= val;\n hash *= FNV_32_PRIME;\n }\n\n return hash;\n}\n" }, { "path": "dep/dhashkit/dhashkit.h", "content": "#ifndef _DHASHKIT_H_\n#define _DHASHKIT_H_\n\n#include \n#include \n\n#include \n\nstruct continuum {\n uint32_t index; /* server index */\n uint32_t value; /* hash value */\n};\n\n#define HASH_CODEC(ACTION) \\\n ACTION( HASH_ONE_AT_A_TIME, one_at_a_time ) \\\n ACTION( HASH_MD5, md5 ) \\\n ACTION( HASH_CRC16, crc16 ) \\\n ACTION( HASH_CRC32, crc32 ) \\\n ACTION( HASH_CRC32A, crc32a ) \\\n ACTION( HASH_FNV1_64, fnv1_64 ) \\\n ACTION( HASH_FNV1A_64, fnv1a_64 ) \\\n ACTION( HASH_FNV1_32, fnv1_32 ) \\\n ACTION( HASH_FNV1A_32, fnv1a_32 ) \\\n ACTION( HASH_HSIEH, hsieh ) \\\n ACTION( HASH_MURMUR, murmur ) \\\n ACTION( HASH_JENKINS, jenkins ) \\\n\n#define DIST_CODEC(ACTION) \\\n ACTION( DIST_KETAMA, ketama ) \\\n ACTION( DIST_MODULA, modula ) \\\n ACTION( DIST_RANDOM, random ) \\\n\n#define DEFINE_ACTION(_hash, _name) _hash,\ntypedef enum hash_type {\n HASH_CODEC( DEFINE_ACTION )\n HASH_SENTINEL\n} hash_type_t;\n#undef DEFINE_ACTION\n\n#define DEFINE_ACTION(_dist, _name) _dist,\ntypedef enum dist_type {\n DIST_CODEC( DEFINE_ACTION )\n DIST_SENTINEL\n} dist_type_t;\n#undef DEFINE_ACTION\n\nuint32_t hash_one_at_a_time(const char *key, size_t key_length);\nvoid md5_signature(const unsigned char *key, unsigned long length, unsigned char *result);\nuint32_t hash_md5(const char *key, size_t key_length);\nuint32_t hash_crc16(const char *key, size_t key_length);\nuint32_t hash_crc32(const char *key, size_t key_length);\nuint32_t hash_crc32a(const char *key, size_t key_length);\nuint32_t hash_fnv1_64(const char *key, size_t key_length);\nuint32_t hash_fnv1a_64(const char *key, size_t key_length);\nuint32_t hash_fnv1_32(const char *key, size_t key_length);\nuint32_t hash_fnv1a_32(const char *key, size_t key_length);\nuint32_t hash_hsieh(const char *key, size_t key_length);\nuint32_t hash_jenkins(const char *key, size_t length);\nuint32_t hash_murmur(const char *key, size_t length);\n\nuint32_t ketama_dispatch(struct continuum *continuum, uint32_t ncontinuum, uint32_t hash);\nuint32_t modula_dispatch(struct continuum *continuum, uint32_t ncontinuum, uint32_t hash);\nuint32_t random_dispatch(struct continuum *continuum, uint32_t ncontinuum, uint32_t hash);\n\n\n/*SHA-1 in CBy Steve Reid 100% Public Domain*/\ntypedef struct {\n uint32_t state[5]; \n uint32_t count[2]; \n unsigned char buffer[64];\n} SHA1_CTX;\n\nvoid SHA1Transform(uint32_t state[5], const unsigned char buffer[64]);\nvoid SHA1Init(SHA1_CTX* context);\nvoid SHA1Update(SHA1_CTX* context, const unsigned char* data, uint32_t len);\nvoid SHA1Final(unsigned char digest[20], SHA1_CTX* context);\n\n#endif\n" }, { "path": "dep/dhashkit/dhsieh.c", "content": "#include \n\n#undef get16bits\n#if (defined(__GNUC__) && defined(__i386__))\n#define get16bits(d) (*((const uint16_t *) (d)))\n#endif\n\n#if !defined (get16bits)\n#define get16bits(d) ((((uint32_t)(((const uint8_t *)(d))[1])) << 8)\\\n +(uint32_t)(((const uint8_t *)(d))[0]) )\n#endif\n\nuint32_t\nhash_hsieh(const char *key, size_t key_length)\n{\n uint32_t hash = 0, tmp;\n int rem;\n\n if (key_length <= 0 || key == NULL) {\n return 0;\n }\n\n rem = key_length & 3;\n key_length >>= 2;\n\n /* Main loop */\n for (;key_length > 0; key_length--) {\n hash += get16bits (key);\n tmp = (get16bits (key+2) << 11) ^ hash;\n hash = (hash << 16) ^ tmp;\n key += 2*sizeof (uint16_t);\n hash += hash >> 11;\n }\n\n /* Handle end cases */\n switch (rem) {\n case 3:\n hash += get16bits (key);\n hash ^= hash << 16;\n hash ^= (uint32_t)key[sizeof (uint16_t)] << 18;\n hash += hash >> 11;\n break;\n\n case 2:\n hash += get16bits (key);\n hash ^= hash << 11;\n hash += hash >> 17;\n break;\n\n case 1:\n hash += (unsigned char)(*key);\n hash ^= hash << 10;\n hash += hash >> 1;\n\n default:\n break;\n }\n\n /* Force \"avalanching\" of final 127 bits */\n hash ^= hash << 3;\n hash += hash >> 5;\n hash ^= hash << 4;\n hash += hash >> 17;\n hash ^= hash << 25;\n hash += hash >> 6;\n\n return hash;\n}\n" }, { "path": "dep/dhashkit/djenkins.c", "content": "#include \n\n#define hashsize(n) ((uint32_t)1<<(n))\n#define hashmask(n) (hashsize(n)-1)\n#define rot(x,k) (((x)<<(k)) | ((x)>>(32-(k))))\n\n#define mix(a,b,c) \\\n{ \\\n a -= c; a ^= rot(c, 4); c += b; \\\n b -= a; b ^= rot(a, 6); a += c; \\\n c -= b; c ^= rot(b, 8); b += a; \\\n a -= c; a ^= rot(c,16); c += b; \\\n b -= a; b ^= rot(a,19); a += c; \\\n c -= b; c ^= rot(b, 4); b += a; \\\n}\n\n#define final(a,b,c) \\\n{ \\\n c ^= b; c -= rot(b,14); \\\n a ^= c; a -= rot(c,11); \\\n b ^= a; b -= rot(a,25); \\\n c ^= b; c -= rot(b,16); \\\n a ^= c; a -= rot(c,4); \\\n b ^= a; b -= rot(a,14); \\\n c ^= b; c -= rot(b,24); \\\n}\n\n#define JENKINS_INITVAL 13\n\n/*\n * jenkins_hash() -- hash a variable-length key into a 32-bit value\n * k : the key (the unaligned variable-length array of bytes)\n * length : the length of the key, counting by bytes\n * initval : can be any 4-byte value\n * Returns a 32-bit value. Every bit of the key affects every bit of\n * the return value. Two keys differing by one or two bits will have\n * totally different hash values.\n\n * The best hash table sizes are powers of 2. There is no need to do\n * mod a prime (mod is sooo slow!). If you need less than 32 bits,\n * use a bitmask. For example, if you need only 10 bits, do\n * h = (h & hashmask(10));\n * In which case, the hash table should have hashsize(10) elements.\n */\n\nuint32_t\nhash_jenkins(const char *key, size_t length)\n{\n uint32_t a,b,c; /* internal state */\n union { const void *ptr; size_t i; } u; /* needed for Mac Powerbook G4 */\n\n /* Set up the internal state */\n a = b = c = 0xdeadbeef + ((uint32_t)length) + JENKINS_INITVAL;\n\n u.ptr = key;\n#ifndef WORDS_BIGENDIAN\n if ((u.i & 0x3) == 0)\n {\n const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */\n\n /*------ all but last block: aligned reads and affect 32 bits of (a,b,c) */\n while (length > 12)\n {\n a += k[0];\n b += k[1];\n c += k[2];\n mix(a,b,c);\n length -= 12;\n k += 3;\n }\n\n /*----------------------------- handle the last (probably partial) block */\n /*\n * \"k[2]&0xffffff\" actually reads beyond the end of the string, but\n * then masks off the part it's not allowed to read. Because the\n * string is aligned, the masked-off tail is in the same word as the\n * rest of the string. Every machine with memory protection I've seen\n * does it on word boundaries, so is OK with this. But VALGRIND will\n * still catch it and complain. The masking trick does make the hash\n * noticeably faster for short strings (like English words).\n */\n switch(length)\n {\n case 12: c+=k[2]; b+=k[1]; a+=k[0]; break;\n case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break;\n case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break;\n case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break;\n case 8 : b+=k[1]; a+=k[0]; break;\n case 7 : b+=k[1]&0xffffff; a+=k[0]; break;\n case 6 : b+=k[1]&0xffff; a+=k[0]; break;\n case 5 : b+=k[1]&0xff; a+=k[0]; break;\n case 4 : a+=k[0]; break;\n case 3 : a+=k[0]&0xffffff; break;\n case 2 : a+=k[0]&0xffff; break;\n case 1 : a+=k[0]&0xff; break;\n case 0 : return c; /* zero length strings require no mixing */\n default: return c;\n }\n\n }\n else if ((u.i & 0x1) == 0)\n {\n const uint16_t *k = (const uint16_t *)key; /* read 16-bit chunks */\n const uint8_t *k8;\n\n /*--------------- all but last block: aligned reads and different mixing */\n while (length > 12)\n {\n a += k[0] + (((uint32_t)k[1])<<16);\n b += k[2] + (((uint32_t)k[3])<<16);\n c += k[4] + (((uint32_t)k[5])<<16);\n mix(a,b,c);\n length -= 12;\n k += 6;\n }\n\n /*----------------------------- handle the last (probably partial) block */\n k8 = (const uint8_t *)k;\n switch(length)\n {\n case 12: c+=k[4]+(((uint32_t)k[5])<<16);\n b+=k[2]+(((uint32_t)k[3])<<16);\n a+=k[0]+(((uint32_t)k[1])<<16);\n break;\n case 11: c+=((uint32_t)k8[10])<<16; /* fall through */\n case 10: c+=k[4];\n b+=k[2]+(((uint32_t)k[3])<<16);\n a+=k[0]+(((uint32_t)k[1])<<16);\n break;\n case 9 : c+=k8[8]; /* fall through */\n case 8 : b+=k[2]+(((uint32_t)k[3])<<16);\n a+=k[0]+(((uint32_t)k[1])<<16);\n break;\n case 7 : b+=((uint32_t)k8[6])<<16; /* fall through */\n case 6 : b+=k[2];\n a+=k[0]+(((uint32_t)k[1])<<16);\n break;\n case 5 : b+=k8[4]; /* fall through */\n case 4 : a+=k[0]+(((uint32_t)k[1])<<16);\n break;\n case 3 : a+=((uint32_t)k8[2])<<16; /* fall through */\n case 2 : a+=k[0];\n break;\n case 1 : a+=k8[0];\n break;\n case 0 : return c; /* zero length requires no mixing */\n default: return c;\n }\n\n }\n else\n { /* need to read the key one byte at a time */\n#endif /* little endian */\n const uint8_t *k = (const uint8_t *)key;\n\n /*--------------- all but the last block: affect some 32 bits of (a,b,c) */\n while (length > 12)\n {\n a += k[0];\n a += ((uint32_t)k[1])<<8;\n a += ((uint32_t)k[2])<<16;\n a += ((uint32_t)k[3])<<24;\n b += k[4];\n b += ((uint32_t)k[5])<<8;\n b += ((uint32_t)k[6])<<16;\n b += ((uint32_t)k[7])<<24;\n c += k[8];\n c += ((uint32_t)k[9])<<8;\n c += ((uint32_t)k[10])<<16;\n c += ((uint32_t)k[11])<<24;\n mix(a,b,c);\n length -= 12;\n k += 12;\n }\n\n /*-------------------------------- last block: affect all 32 bits of (c) */\n switch(length) /* all the case statements fall through */\n {\n case 12: c+=((uint32_t)k[11])<<24;\n case 11: c+=((uint32_t)k[10])<<16;\n case 10: c+=((uint32_t)k[9])<<8;\n case 9 : c+=k[8];\n case 8 : b+=((uint32_t)k[7])<<24;\n case 7 : b+=((uint32_t)k[6])<<16;\n case 6 : b+=((uint32_t)k[5])<<8;\n case 5 : b+=k[4];\n case 4 : a+=((uint32_t)k[3])<<24;\n case 3 : a+=((uint32_t)k[2])<<16;\n case 2 : a+=((uint32_t)k[1])<<8;\n case 1 : a+=k[0];\n break;\n case 0 : return c;\n default : return c;\n }\n#ifndef WORDS_BIGENDIAN\n }\n#endif\n\n final(a,b,c);\n return c;\n}\n" }, { "path": "dep/dhashkit/dketama.c", "content": "#include \n#include \n#include \n\n#include \n\n#define KETAMA_CONTINUUM_ADDITION 10 /* # extra slots to build into continuum */\n#define KETAMA_POINTS_PER_SERVER 160 /* 40 points per hash */\n#define KETAMA_MAX_HOSTLEN 86\n\nstatic uint32_t\nketama_hash(const char *key, size_t key_length, uint32_t alignment)\n{\n unsigned char results[16];\n\n md5_signature((const unsigned char*)key, (unsigned long)key_length, results);\n\n return ((uint32_t) (results[3 + alignment * 4] & 0xFF) << 24)\n | ((uint32_t) (results[2 + alignment * 4] & 0xFF) << 16)\n | ((uint32_t) (results[1 + alignment * 4] & 0xFF) << 8)\n | (results[0 + alignment * 4] & 0xFF);\n}\n\nstatic int\nketama_item_cmp(const void *t1, const void *t2)\n{\n const struct continuum *ct1 = t1, *ct2 = t2;\n\n if (ct1->value == ct2->value) {\n return 0;\n } else if (ct1->value > ct2->value) {\n return 1;\n } else {\n return -1;\n }\n}\n\nuint32_t\nketama_dispatch(struct continuum *continuum, uint32_t ncontinuum, uint32_t hash)\n{\n struct continuum *begin, *end, *left, *right, *middle;\n\n ASSERT(continuum != NULL);\n ASSERT(ncontinuum != 0);\n\n begin = left = continuum;\n end = right = continuum + ncontinuum;\n\n while (left < right) {\n middle = left + (right - left) / 2;\n if (middle->value < hash) {\n left = middle + 1;\n } else {\n right = middle;\n }\n }\n\n if (right == end) {\n right = begin;\n }\n\n return right->index;\n}\n" }, { "path": "dep/dhashkit/dmd5.c", "content": "#include \n\n#include \n\n/*\n * This is an OpenSSL-compatible implementation of the RSA Data Security, Inc.\n * MD5 Message-Digest Algorithm (RFC 1321).\n *\n * Homepage: http://openwall.info/wiki/people/solar/software/public-domain-source-code/md5\n *\n * Author: Alexander Peslyak, better known as Solar Designer \n */\n\ntypedef unsigned int MD5_u32plus;\n\ntypedef struct {\n MD5_u32plus lo, hi;\n MD5_u32plus a, b, c, d;\n unsigned char buffer[64];\n MD5_u32plus block[16];\n} MD5_CTX;\n\n/*\n * The basic MD5 functions.\n *\n * F and G are optimized compared to their RFC 1321 definitions for\n * architectures that lack an AND-NOT instruction, just like in Colin Plumb's\n * implementation.\n */\n#define F(x, y, z)\t\t\t((z) ^ ((x) & ((y) ^ (z))))\n#define G(x, y, z)\t\t\t((y) ^ ((z) & ((x) ^ (y))))\n#define H(x, y, z)\t\t\t((x) ^ (y) ^ (z))\n#define I(x, y, z)\t\t\t((y) ^ ((x) | ~(z)))\n\n/*\n * The MD5 transformation for all four rounds.\n */\n#define STEP(f, a, b, c, d, x, t, s) \\\n\t(a) += f((b), (c), (d)) + (x) + (t); \\\n\t(a) = (((a) << (s)) | (((a) & 0xffffffff) >> (32 - (s)))); \\\n\t(a) += (b);\n\n/*\n * SET reads 4 input bytes in little-endian byte order and stores them\n * in a properly aligned word in host byte order.\n *\n * The check for little-endian architectures that tolerate unaligned\n * memory accesses is just an optimization. Nothing will break if it\n * doesn't work.\n */\n#if defined(__i386__) || defined(__x86_64__) || defined(__vax__)\n#define SET(n) \\\n (*(MD5_u32plus *)&ptr[(n) * 4])\n#define GET(n) \\\n SET(n)\n#else\n#define SET(n) \\\n (ctx->block[(n)] = \\\n (MD5_u32plus)ptr[(n) * 4] | \\\n ((MD5_u32plus)ptr[(n) * 4 + 1] << 8) | \\\n ((MD5_u32plus)ptr[(n) * 4 + 2] << 16) | \\\n ((MD5_u32plus)ptr[(n) * 4 + 3] << 24))\n#define GET(n) \\\n (ctx->block[(n)])\n#endif\n\n/*\n * This processes one or more 64-byte data blocks, but does NOT update\n * the bit counters. There are no alignment requirements.\n */\nstatic void *\nbody(MD5_CTX *ctx, void *data, unsigned long size)\n{\n unsigned char *ptr;\n MD5_u32plus a, b, c, d;\n MD5_u32plus saved_a, saved_b, saved_c, saved_d;\n\n ptr = data;\n\n a = ctx->a;\n b = ctx->b;\n c = ctx->c;\n d = ctx->d;\n\n\tdo {\n saved_a = a;\n saved_b = b;\n saved_c = c;\n saved_d = d;\n\n /* Round 1 */\n STEP(F, a, b, c, d, SET(0), 0xd76aa478, 7)\n STEP(F, d, a, b, c, SET(1), 0xe8c7b756, 12)\n STEP(F, c, d, a, b, SET(2), 0x242070db, 17)\n STEP(F, b, c, d, a, SET(3), 0xc1bdceee, 22)\n STEP(F, a, b, c, d, SET(4), 0xf57c0faf, 7)\n STEP(F, d, a, b, c, SET(5), 0x4787c62a, 12)\n STEP(F, c, d, a, b, SET(6), 0xa8304613, 17)\n STEP(F, b, c, d, a, SET(7), 0xfd469501, 22)\n STEP(F, a, b, c, d, SET(8), 0x698098d8, 7)\n STEP(F, d, a, b, c, SET(9), 0x8b44f7af, 12)\n STEP(F, c, d, a, b, SET(10), 0xffff5bb1, 17)\n STEP(F, b, c, d, a, SET(11), 0x895cd7be, 22)\n STEP(F, a, b, c, d, SET(12), 0x6b901122, 7)\n STEP(F, d, a, b, c, SET(13), 0xfd987193, 12)\n STEP(F, c, d, a, b, SET(14), 0xa679438e, 17)\n STEP(F, b, c, d, a, SET(15), 0x49b40821, 22)\n\n /* Round 2 */\n STEP(G, a, b, c, d, GET(1), 0xf61e2562, 5)\n STEP(G, d, a, b, c, GET(6), 0xc040b340, 9)\n STEP(G, c, d, a, b, GET(11), 0x265e5a51, 14)\n STEP(G, b, c, d, a, GET(0), 0xe9b6c7aa, 20)\n STEP(G, a, b, c, d, GET(5), 0xd62f105d, 5)\n STEP(G, d, a, b, c, GET(10), 0x02441453, 9)\n STEP(G, c, d, a, b, GET(15), 0xd8a1e681, 14)\n STEP(G, b, c, d, a, GET(4), 0xe7d3fbc8, 20)\n STEP(G, a, b, c, d, GET(9), 0x21e1cde6, 5)\n STEP(G, d, a, b, c, GET(14), 0xc33707d6, 9)\n STEP(G, c, d, a, b, GET(3), 0xf4d50d87, 14)\n STEP(G, b, c, d, a, GET(8), 0x455a14ed, 20)\n STEP(G, a, b, c, d, GET(13), 0xa9e3e905, 5)\n STEP(G, d, a, b, c, GET(2), 0xfcefa3f8, 9)\n STEP(G, c, d, a, b, GET(7), 0x676f02d9, 14)\n STEP(G, b, c, d, a, GET(12), 0x8d2a4c8a, 20)\n\n /* Round 3 */\n STEP(H, a, b, c, d, GET(5), 0xfffa3942, 4)\n STEP(H, d, a, b, c, GET(8), 0x8771f681, 11)\n STEP(H, c, d, a, b, GET(11), 0x6d9d6122, 16)\n STEP(H, b, c, d, a, GET(14), 0xfde5380c, 23)\n STEP(H, a, b, c, d, GET(1), 0xa4beea44, 4)\n STEP(H, d, a, b, c, GET(4), 0x4bdecfa9, 11)\n STEP(H, c, d, a, b, GET(7), 0xf6bb4b60, 16)\n STEP(H, b, c, d, a, GET(10), 0xbebfbc70, 23)\n STEP(H, a, b, c, d, GET(13), 0x289b7ec6, 4)\n STEP(H, d, a, b, c, GET(0), 0xeaa127fa, 11)\n STEP(H, c, d, a, b, GET(3), 0xd4ef3085, 16)\n STEP(H, b, c, d, a, GET(6), 0x04881d05, 23)\n STEP(H, a, b, c, d, GET(9), 0xd9d4d039, 4)\n STEP(H, d, a, b, c, GET(12), 0xe6db99e5, 11)\n STEP(H, c, d, a, b, GET(15), 0x1fa27cf8, 16)\n STEP(H, b, c, d, a, GET(2), 0xc4ac5665, 23)\n\n /* Round 4 */\n STEP(I, a, b, c, d, GET(0), 0xf4292244, 6)\n STEP(I, d, a, b, c, GET(7), 0x432aff97, 10)\n STEP(I, c, d, a, b, GET(14), 0xab9423a7, 15)\n STEP(I, b, c, d, a, GET(5), 0xfc93a039, 21)\n STEP(I, a, b, c, d, GET(12), 0x655b59c3, 6)\n STEP(I, d, a, b, c, GET(3), 0x8f0ccc92, 10)\n STEP(I, c, d, a, b, GET(10), 0xffeff47d, 15)\n STEP(I, b, c, d, a, GET(1), 0x85845dd1, 21)\n STEP(I, a, b, c, d, GET(8), 0x6fa87e4f, 6)\n STEP(I, d, a, b, c, GET(15), 0xfe2ce6e0, 10)\n STEP(I, c, d, a, b, GET(6), 0xa3014314, 15)\n STEP(I, b, c, d, a, GET(13), 0x4e0811a1, 21)\n STEP(I, a, b, c, d, GET(4), 0xf7537e82, 6)\n STEP(I, d, a, b, c, GET(11), 0xbd3af235, 10)\n STEP(I, c, d, a, b, GET(2), 0x2ad7d2bb, 15)\n STEP(I, b, c, d, a, GET(9), 0xeb86d391, 21)\n\n a += saved_a;\n b += saved_b;\n c += saved_c;\n d += saved_d;\n\n ptr += 64;\n } while (size -= 64);\n\n ctx->a = a;\n ctx->b = b;\n ctx->c = c;\n ctx->d = d;\n\n return ptr;\n}\n\nvoid\nMD5_Init(MD5_CTX *ctx)\n{\n ctx->a = 0x67452301;\n ctx->b = 0xefcdab89;\n ctx->c = 0x98badcfe;\n ctx->d = 0x10325476;\n\n ctx->lo = 0;\n ctx->hi = 0;\n}\n\nvoid\nMD5_Update(MD5_CTX *ctx, void *data, unsigned long size)\n{\n MD5_u32plus saved_lo;\n unsigned long used, free;\n\n saved_lo = ctx->lo;\n if ((ctx->lo = (saved_lo + size) & 0x1fffffff) < saved_lo) {\n ctx->hi++;\n }\n ctx->hi += size >> 29;\n\n used = saved_lo & 0x3f;\n\n if (used) {\n free = 64 - used;\n\n if (size < free) {\n memcpy(&ctx->buffer[used], data, size);\n return;\n }\n\n memcpy(&ctx->buffer[used], data, free);\n data = (unsigned char *)data + free;\n size -= free;\n body(ctx, ctx->buffer, 64);\n }\n\n if (size >= 64) {\n data = body(ctx, data, size & ~(unsigned long)0x3f);\n size &= 0x3f;\n }\n\n memcpy(ctx->buffer, data, size);\n}\n\nvoid\nMD5_Final(unsigned char *result, MD5_CTX *ctx)\n{\n unsigned long used, free;\n\n used = ctx->lo & 0x3f;\n\n ctx->buffer[used++] = 0x80;\n\n free = 64 - used;\n\n if (free < 8) {\n memset(&ctx->buffer[used], 0, free);\n body(ctx, ctx->buffer, 64);\n used = 0;\n free = 64;\n }\n\n memset(&ctx->buffer[used], 0, free - 8);\n\n ctx->lo <<= 3;\n ctx->buffer[56] = ctx->lo;\n ctx->buffer[57] = ctx->lo >> 8;\n ctx->buffer[58] = ctx->lo >> 16;\n ctx->buffer[59] = ctx->lo >> 24;\n ctx->buffer[60] = ctx->hi;\n ctx->buffer[61] = ctx->hi >> 8;\n ctx->buffer[62] = ctx->hi >> 16;\n ctx->buffer[63] = ctx->hi >> 24;\n\n body(ctx, ctx->buffer, 64);\n\n result[0] = ctx->a;\n result[1] = ctx->a >> 8;\n result[2] = ctx->a >> 16;\n result[3] = ctx->a >> 24;\n result[4] = ctx->b;\n result[5] = ctx->b >> 8;\n result[6] = ctx->b >> 16;\n result[7] = ctx->b >> 24;\n result[8] = ctx->c;\n result[9] = ctx->c >> 8;\n result[10] = ctx->c >> 16;\n result[11] = ctx->c >> 24;\n result[12] = ctx->d;\n result[13] = ctx->d >> 8;\n result[14] = ctx->d >> 16;\n result[15] = ctx->d >> 24;\n\n memset(ctx, 0, sizeof(*ctx));\n}\n\n/*\n * Just a simple method for getting the signature\n * result must be == 16\n */\nvoid\nmd5_signature(const unsigned char *key, unsigned long length, unsigned char *result)\n{\n MD5_CTX my_md5;\n\n MD5_Init(&my_md5);\n (void)MD5_Update(&my_md5, key, length);\n MD5_Final(result, &my_md5);\n}\n\nuint32_t\nhash_md5(const char *key, size_t key_length)\n{\n unsigned char results[16];\n\n md5_signature((const unsigned char*)key, (unsigned long)key_length, results);\n\n return ((uint32_t) (results[3] & 0xFF) << 24) |\n ((uint32_t) (results[2] & 0xFF) << 16) |\n ((uint32_t) (results[1] & 0xFF) << 8) |\n (results[0] & 0xFF);\n}\n" }, { "path": "dep/dhashkit/dmodula.c", "content": "#include \n#include \n\n#include \n\n#define MODULA_CONTINUUM_ADDITION 10 /* # extra slots to build into continuum */\n#define MODULA_POINTS_PER_SERVER 1\n\nuint32_t\nmodula_dispatch(struct continuum *continuum, uint32_t ncontinuum, uint32_t hash)\n{\n struct continuum *c;\n\n ASSERT(continuum != NULL);\n ASSERT(ncontinuum != 0);\n\n c = continuum + hash % ncontinuum;\n\n return c->index;\n}\n" }, { "path": "dep/dhashkit/dmurmur.c", "content": "/*\n * \"Murmur\" hash provided by Austin, tanjent@gmail.com\n * http://murmurhash.googlepages.com/\n *\n * Note - This code makes a few assumptions about how your machine behaves -\n *\n * 1. We can read a 4-byte value from any address without crashing\n * 2. sizeof(int) == 4\n *\n * And it has a few limitations -\n * 1. It will not work incrementally.\n * 2. It will not produce the same results on little-endian and big-endian\n * machines.\n *\n * Updated to murmur2 hash - BP\n */\n\n#include \n\nuint32_t\nhash_murmur(const char *key, size_t length)\n{\n /*\n * 'm' and 'r' are mixing constants generated offline. They're not\n * really 'magic', they just happen to work well.\n */\n\n const unsigned int m = 0x5bd1e995;\n const uint32_t seed = (0xdeadbeef * (uint32_t)length);\n const int r = 24;\n\n\n /* Initialize the hash to a 'random' value */\n\n uint32_t h = seed ^ (uint32_t)length;\n\n /* Mix 4 bytes at a time into the hash */\n\n const unsigned char * data = (const unsigned char *)key;\n\n while (length >= 4) {\n unsigned int k = *(unsigned int *)data;\n\n k *= m;\n k ^= k >> r;\n k *= m;\n\n h *= m;\n h ^= k;\n\n data += 4;\n length -= 4;\n }\n\n /* Handle the last few bytes of the input array */\n\n switch(length) {\n case 3:\n h ^= ((uint32_t)data[2]) << 16;\n\n case 2:\n h ^= ((uint32_t)data[1]) << 8;\n\n case 1:\n h ^= data[0];\n h *= m;\n\n default:\n break;\n };\n\n /*\n * Do a few final mixes of the hash to ensure the last few bytes are\n * well-incorporated.\n */\n\n h ^= h >> 13;\n h *= m;\n h ^= h >> 15;\n\n return h;\n}\n" }, { "path": "dep/dhashkit/done_at_a_time.c", "content": "/*\n * HashKit\n * Copyright (C) 2009 Brian Aker\n * All rights reserved.\n *\n * Use and distribution licensed under the BSD license. See\n * the COPYING file in the parent directory for full text.\n */\n\n/*\n * This has is Jenkin's \"One at A time Hash\".\n * http://en.wikipedia.org/wiki/Jenkins_hash_function\n */\n\n#include \n\nuint32_t\nhash_one_at_a_time(const char *key, size_t key_length)\n{\n const char *ptr = key;\n uint32_t value = 0;\n\n while (key_length--) {\n uint32_t val = (uint32_t) *ptr++;\n value += val;\n value += (value << 10);\n value ^= (value >> 6);\n }\n value += (value << 3);\n value ^= (value >> 11);\n value += (value << 15);\n\n return value;\n}\n" }, { "path": "dep/dhashkit/drandom.c", "content": "#include \n#include \n\n#include \n\n#define RANDOM_CONTINUUM_ADDITION 10 /* # extra slots to build into continuum */\n#define RANDOM_POINTS_PER_SERVER 1\n\nuint32_t\nrandom_dispatch(struct continuum *continuum, uint32_t ncontinuum, uint32_t hash)\n{\n struct continuum *c;\n\n ASSERT(continuum != NULL);\n ASSERT(ncontinuum != 0);\n\n c = continuum + random() % ncontinuum;\n\n return c->index;\n}\n" }, { "path": "dep/dhashkit/dsha1.c", "content": "\n/* from valgrind tests */\n\n/* ================ sha1.c ================ */\n/*\nSHA-1 in C\nBy Steve Reid \n100% Public Domain\n\nTest Vectors (from FIPS PUB 180-1)\n\"abc\"\n A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n\"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq\"\n 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\nA million repetitions of \"a\"\n 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n*/\n\n/* #define LITTLE_ENDIAN * This should be #define'd already, if true. */\n/* #define SHA1HANDSOFF * Copies data before messing with it. */\n\n#define SHA1HANDSOFF\n\n#include \n#include \n#include \n\n#include \n\n#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))\n\n/* blk0() and blk() perform the initial expand. */\n/* I got the idea of expanding during the round function from SSLeay */\n#ifdef VR_LITTLE_ENDIAN\n#define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \\\n |(rol(block->l[i],8)&0x00FF00FF))\n#else\n#define blk0(i) block->l[i]\n#endif\n#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \\\n ^block->l[(i+2)&15]^block->l[i&15],1))\n\n/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */\n#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);\n#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);\n#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);\n#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);\n#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);\n\n\n/* Hash a single 512-bit block. This is the core of the algorithm. */\n\nvoid SHA1Transform(uint32_t state[5], const unsigned char buffer[64])\n{\n uint32_t a, b, c, d, e;\n typedef union {\n unsigned char c[64];\n uint32_t l[16];\n } CHAR64LONG16;\n#ifdef SHA1HANDSOFF\n CHAR64LONG16 block[1]; /* use array to appear as a pointer */\n memcpy(block, buffer, 64);\n#else\n /* The following had better never be used because it causes the\n * pointer-to-const buffer to be cast into a pointer to non-const.\n * And the result is written through. I threw a \"const\" in, hoping\n * this will cause a diagnostic.\n */\n CHAR64LONG16* block = (const CHAR64LONG16*)buffer;\n#endif\n /* Copy context->state[] to working vars */\n a = state[0];\n b = state[1];\n c = state[2];\n d = state[3];\n e = state[4];\n /* 4 rounds of 20 operations each. Loop unrolled. */\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n 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);\n /* Add the working vars back into context.state[] */\n state[0] += a;\n state[1] += b;\n state[2] += c;\n state[3] += d;\n state[4] += e;\n /* Wipe variables */\n a = b = c = d = e = 0;\n#ifdef SHA1HANDSOFF\n memset(block, '\\0', sizeof(block));\n#endif\n}\n\n\n/* SHA1Init - Initialize new context */\n\nvoid SHA1Init(SHA1_CTX* context)\n{\n /* SHA1 initialization constants */\n context->state[0] = 0x67452301;\n context->state[1] = 0xEFCDAB89;\n context->state[2] = 0x98BADCFE;\n context->state[3] = 0x10325476;\n context->state[4] = 0xC3D2E1F0;\n context->count[0] = context->count[1] = 0;\n}\n\n\n/* Run your data through this. */\n\nvoid SHA1Update(SHA1_CTX* context, const unsigned char* data, uint32_t len)\n{\n uint32_t i, j;\n\n j = context->count[0];\n if ((context->count[0] += len << 3) < j)\n context->count[1]++;\n context->count[1] += (len>>29);\n j = (j >> 3) & 63;\n if ((j + len) > 63) {\n memcpy(&context->buffer[j], data, (i = 64-j));\n SHA1Transform(context->state, context->buffer);\n for ( ; i + 63 < len; i += 64) {\n SHA1Transform(context->state, &data[i]);\n }\n j = 0;\n }\n else i = 0;\n memcpy(&context->buffer[j], &data[i], len - i);\n}\n\n\n/* Add padding and return the message digest. */\n\nvoid SHA1Final(unsigned char digest[20], SHA1_CTX* context)\n{\n unsigned i;\n unsigned char finalcount[8];\n unsigned char c;\n\n#if 0\t/* untested \"improvement\" by DHR */\n /* Convert context->count to a sequence of bytes\n * in finalcount. Second element first, but\n * big-endian order within element.\n * But we do it all backwards.\n */\n unsigned char *fcp = &finalcount[8];\n\n for (i = 0; i < 2; i++)\n {\n uint32_t t = context->count[i];\n int j;\n\n for (j = 0; j < 4; t >>= 8, j++)\n\t *--fcp = (unsigned char) t;\n }\n#else\n for (i = 0; i < 8; i++) {\n finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]\n >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */\n }\n#endif\n c = 0200;\n SHA1Update(context, &c, 1);\n while ((context->count[0] & 504) != 448) {\n\tc = 0000;\n SHA1Update(context, &c, 1);\n }\n SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */\n for (i = 0; i < 20; i++) {\n digest[i] = (unsigned char)\n ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);\n }\n /* Wipe variables */\n memset(context, '\\0', sizeof(*context));\n memset(&finalcount, '\\0', sizeof(finalcount));\n}\n/* ================ end of sha1.c ================ */\n" }, { "path": "dep/dlist/Makefile.am", "content": "MAINTAINERCLEANFILES = Makefile.in\n\nAM_CPPFLAGS =\nif !OS_SOLARIS\nAM_CPPFLAGS += -D_GNU_SOURCE\nendif\nAM_CPPFLAGS += -I $(top_srcdir)/dep/util\nAM_CPPFLAGS += -I $(top_srcdir)/dep/jemalloc-4.2.0/include\nAM_CPPFLAGS += -I $(top_srcdir)/dep/dmalloc\n\nAM_CFLAGS = -Wall -Wshadow\nAM_CFLAGS += -Wno-unused-parameter -Wno-unused-value\n\nnoinst_LIBRARIES = libdlist.a\n\nnoinst_HEADERS = dlist.h dmtqueue.h dlockqueue.h\n\nlibdlist_a_SOURCES =\t \\\n\tdlist.c dlist.h \\\n dmtqueue.c dmtqueue.h \\\n dlockqueue.c dlockqueue.h" }, { "path": "dep/dlist/dlist.c", "content": "#include \n\n#include \n\n#include \n\n/* Create a new list. The created list can be freed with\n * AlFreeList(), but private value of every node need to be freed\n * by the user before to call AlFreeList().\n *\n * On error, NULL is returned. Otherwise the pointer to the new list. */\ndlist *dlistCreate(void)\n{\n struct dlist *list;\n\n if ((list = dalloc(sizeof(*list))) == NULL)\n return NULL;\n list->head = list->tail = NULL;\n list->len = 0;\n list->dup = NULL;\n list->free = NULL;\n list->match = NULL;\n return list;\n}\n\n/* Free the whole list.\n *\n * This function can't fail. */\nvoid dlistRelease(dlist *list)\n{\n unsigned long len;\n dlistNode *current, *next;\n\n current = list->head;\n len = list->len;\n while(len--) {\n next = current->next;\n if (list->free) list->free(current->value);\n dfree(current);\n current = next;\n }\n dfree(list);\n}\n\n/* Add a new node to the list, to head, containing the specified 'value'\n * pointer as value.\n *\n * On error, NULL is returned and no operation is performed (i.e. the\n * list remains unaltered).\n * On success the 'list' pointer you pass to the function is returned. */\ndlist *dlistAddNodeHead(dlist *list, void *value)\n{\n dlistNode *node;\n\n if ((node = dalloc(sizeof(*node))) == NULL)\n return NULL;\n node->value = value;\n if (list->len == 0) {\n list->head = list->tail = node;\n node->prev = node->next = NULL;\n } else {\n node->prev = NULL;\n node->next = list->head;\n list->head->prev = node;\n list->head = node;\n }\n list->len++;\n return list;\n}\n\n/* Add a new node to the list, to tail, containing the specified 'value'\n * pointer as value.\n *\n * On error, NULL is returned and no operation is performed (i.e. the\n * list remains unaltered).\n * On success the 'list' pointer you pass to the function is returned. */\ndlist *dlistAddNodeTail(dlist *list, void *value)\n{\n dlistNode *node;\n\n if ((node = dalloc(sizeof(*node))) == NULL)\n return NULL;\n node->value = value;\n if (list->len == 0) {\n list->head = list->tail = node;\n node->prev = node->next = NULL;\n } else {\n node->prev = list->tail;\n node->next = NULL;\n list->tail->next = node;\n list->tail = node;\n }\n list->len++;\n return list;\n}\n\ndlist *dlistInsertNode(dlist *list, dlistNode *old_node, void *value, int after) {\n dlistNode *node;\n\n if ((node = dalloc(sizeof(*node))) == NULL)\n return NULL;\n node->value = value;\n if (after) {\n node->prev = old_node;\n node->next = old_node->next;\n if (list->tail == old_node) {\n list->tail = node;\n }\n } else {\n node->next = old_node;\n node->prev = old_node->prev;\n if (list->head == old_node) {\n list->head = node;\n }\n }\n if (node->prev != NULL) {\n node->prev->next = node;\n }\n if (node->next != NULL) {\n node->next->prev = node;\n }\n list->len++;\n return list;\n}\n\n/* Remove the specified node from the specified list.\n * It's up to the caller to free the private value of the node.\n *\n * This function can't fail. */\nvoid dlistDelNode(dlist *list, dlistNode *node)\n{\n if (node->prev)\n node->prev->next = node->next;\n else\n list->head = node->next;\n if (node->next)\n node->next->prev = node->prev;\n else\n list->tail = node->prev;\n if (list->free) list->free(node->value);\n dfree(node);\n list->len--;\n}\n\n/* Returns a list iterator 'iter'. After the initialization every\n * call to dlistNext() will return the next element of the list.\n *\n * This function can't fail. */\ndlistIter *dlistGetIterator(dlist *list, int direction)\n{\n dlistIter *iter;\n\n if ((iter = dalloc(sizeof(*iter))) == NULL) return NULL;\n if (direction == AL_START_HEAD)\n iter->next = list->head;\n else\n iter->next = list->tail;\n iter->direction = direction;\n return iter;\n}\n\n/* Release the iterator memory */\nvoid dlistReleaseIterator(dlistIter *iter) {\n dfree(iter);\n}\n\n/* Create an iterator in the list private iterator structure */\nvoid dlistRewind(dlist *list, dlistIter *li) {\n li->next = list->head;\n li->direction = AL_START_HEAD;\n}\n\nvoid dlistRewindTail(dlist *list, dlistIter *li) {\n li->next = list->tail;\n li->direction = AL_START_TAIL;\n}\n\n/* Return the next element of an iterator.\n * It's valid to remove the currently returned element using\n * dlistDelNode(), but not to remove other elements.\n *\n * The function returns a pointer to the next element of the list,\n * or NULL if there are no more elements, so the classical usage patter\n * is:\n *\n * iter = dlistGetIterator(list,);\n * while ((node = dlistNext(iter)) != NULL) {\n * doSomethingWith(dlistNodeValue(node));\n * }\n *\n * */\ndlistNode *dlistNext(dlistIter *iter)\n{\n dlistNode *current = iter->next;\n\n if (current != NULL) {\n if (iter->direction == AL_START_HEAD)\n iter->next = current->next;\n else\n iter->next = current->prev;\n }\n return current;\n}\n\n/* Duplicate the whole list. On out of memory NULL is returned.\n * On success a copy of the original list is returned.\n *\n * The 'Dup' method set with listSetDupMethod() function is used\n * to copy the node value. Otherwise the same pointer value of\n * the original node is used as value of the copied node.\n *\n * The original list both on success or error is never modified. */\ndlist *dlistDup(dlist *orig)\n{\n dlist *copy;\n dlistIter iter;\n dlistNode *node;\n\n if ((copy = dlistCreate()) == NULL)\n return NULL;\n copy->dup = orig->dup;\n copy->free = orig->free;\n copy->match = orig->match;\n dlistRewind(orig, &iter);\n while((node = dlistNext(&iter)) != NULL) {\n void *value;\n\n if (copy->dup) {\n value = copy->dup(node->value);\n if (value == NULL) {\n dlistRelease(copy);\n return NULL;\n }\n } else\n value = node->value;\n if (dlistAddNodeTail(copy, value) == NULL) {\n dlistRelease(copy);\n return NULL;\n }\n }\n return copy;\n}\n\n/* Search the list for a node matching a given key.\n * The match is performed using the 'match' method\n * set with listSetMatchMethod(). If no 'match' method\n * is set, the 'value' pointer of every node is directly\n * compared with the 'key' pointer.\n *\n * On success the first matching node pointer is returned\n * (search starts from head). If no matching node exists\n * NULL is returned. */\ndlistNode *dlistSearchKey(dlist *list, void *key)\n{\n dlistIter iter;\n dlistNode *node;\n\n dlistRewind(list, &iter);\n while((node = dlistNext(&iter)) != NULL) {\n if (list->match) {\n if (list->match(node->value, key)) {\n return node;\n }\n } else {\n if (key == node->value) {\n return node;\n }\n }\n }\n return NULL;\n}\n\n/* Return the element at the specified zero-based index\n * where 0 is the head, 1 is the element next to head\n * and so on. Negative integers are used in order to count\n * from the tail, -1 is the last element, -2 the penultimate\n * and so on. If the index is out of range NULL is returned. */\ndlistNode *dlistIndex(dlist *list, long index) {\n dlistNode *n;\n\n if (index < 0) {\n index = (-index)-1;\n n = list->tail;\n while(index-- && n) n = n->prev;\n } else {\n n = list->head;\n while(index-- && n) n = n->next;\n }\n return n;\n}\n\n/* Rotate the list removing the tail node and inserting it to the head. */\nvoid dlistRotate(dlist *list) {\n dlistNode *tail = list->tail;\n\n if (dlistLength(list) <= 1) return;\n\n /* Detach current tail */\n list->tail = tail->prev;\n list->tail->next = NULL;\n /* Move it as head */\n list->head->prev = tail;\n tail->prev = NULL;\n tail->next = list->head;\n list->head = tail;\n}\n\ndlist *dlistPush(dlist *list, void *value) {\n dlistAddNodeTail(list, value);\n return list;\n}\n\nvoid *dlistPop(dlist *list) {\n dlistNode *node;\n void *value;\n \n node = dlistFirst(list);\n if (node == NULL) {\n return NULL;\n }\n\n value = dlistNodeValue(node);\n dlistDelNode(list, node);\n\n if (list->free) return NULL;\n \n return value;\n}\n" }, { "path": "dep/dlist/dlist.h", "content": "#ifndef _DLIST_H__\n#define _DLIST_H__\n\n/* Node, List, and Iterator are the only data structures used currently. */\n\ntypedef struct dlistNode {\n struct dlistNode *prev;\n struct dlistNode *next;\n void *value;\n} dlistNode;\n\ntypedef struct dlistIter {\n dlistNode *next;\n int direction;\n} dlistIter;\n\ntypedef struct dlist {\n dlistNode *head;\n dlistNode *tail;\n void *(*dup)(void *ptr);\n void (*free)(void *ptr);\n int (*match)(void *ptr, void *key);\n unsigned long len;\n} dlist;\n\n/* Functions implemented as macros */\n#define dlistLength(l) ((l)->len)\n#define dlistFirst(l) ((l)->head)\n#define dlistLast(l) ((l)->tail)\n#define dlistPrevNode(n) ((n)->prev)\n#define dlistNextNode(n) ((n)->next)\n#define dlistNodeValue(n) ((n)->value)\n\n#define dlistSetDupMethod(l,m) ((l)->dup = (m))\n#define dlistSetFreeMethod(l,m) ((l)->free = (m))\n#define dlistSetMatchMethod(l,m) ((l)->match = (m))\n\n#define dlistGetDupMethod(l) ((l)->dup)\n#define dlistGetFree(l) ((l)->free)\n#define dlistGetMatchMethod(l) ((l)->match)\n\n/* Prototypes */\ndlist *dlistCreate(void);\nvoid dlistRelease(dlist *list);\ndlist *dlistAddNodeHead(dlist *list, void *value);\ndlist *dlistAddNodeTail(dlist *list, void *value);\ndlist *dlistInsertNode(dlist *list, dlistNode *old_node, void *value, int after);\nvoid dlistDelNode(dlist *list, dlistNode *node);\ndlistIter *dlistGetIterator(dlist *list, int direction);\ndlistNode *dlistNext(dlistIter *iter);\nvoid dlistReleaseIterator(dlistIter *iter);\ndlist *dlistDup(dlist *orig);\ndlistNode *dlistSearchKey(dlist *list, void *key);\ndlistNode *dlistIndex(dlist *list, long index);\nvoid dlistRewind(dlist *list, dlistIter *li);\nvoid dlistRewindTail(dlist *list, dlistIter *li);\nvoid dlistRotate(dlist *list);\ndlist *dlistPush(dlist *list, void *value);\nvoid *dlistPop(dlist *list);\n\n/* Directions for iterators */\n#define AL_START_HEAD 0\n#define AL_START_TAIL 1\n\n#endif /* __ADLIST_H__ */\n" }, { "path": "dep/dlist/dlockqueue.c", "content": "#include \n#include \n#include \n\n#include \n\n#include \n#include \n#include \n\ndlockqueue *dlockqueue_create(void)\n{\n dlockqueue *lqueue;\n\n lqueue = dalloc(sizeof(*lqueue));\n if (lqueue == NULL) {\n return NULL;\n }\n\n lqueue->maxlen = -1;\n lqueue->maxlen_policy = MAX_LENGTH_POLICY_REJECT;\n pthread_mutex_init(&lqueue->lmutex,NULL);\n \n lqueue->l = dlistCreate();\n if (lqueue->l == NULL) {\n dlockqueue_destroy(lqueue);\n return NULL;\n }\n\n return lqueue;\n}\n\nlong long dlockqueue_push(void *q, void *value)\n{\n dlockqueue *lqueue = q;\n dlist *list;\n long long length;\n \n pthread_mutex_lock(&lqueue->lmutex);\n length = (long long)dlistLength(lqueue->l);\n if (lqueue->maxlen >0 && length >= lqueue->maxlen) {\n if (lqueue->maxlen_policy == MAX_LENGTH_POLICY_REJECT) {\n length = -1;\n } else if (lqueue->maxlen_policy == MAX_LENGTH_POLICY_EVICT_HEAD) {\n while (length >= lqueue->maxlen) {\n dlistNode *ln = dlistFirst(lqueue->l);\n dlistDelNode(lqueue->l,ln);\n length = (long long)dlistLength(lqueue->l);\n }\n list = dlistAddNodeTail(lqueue->l, value);\n length ++;\n } else if (lqueue->maxlen_policy == MAX_LENGTH_POLICY_EVICT_END) {\n while (length >= lqueue->maxlen) {\n dlistNode *ln = dlistLast(lqueue->l);\n dlistDelNode(lqueue->l,ln);\n length = (long long)dlistLength(lqueue->l);\n }\n list = dlistAddNodeTail(lqueue->l, value);\n length ++;\n }\n } else {\n list = dlistAddNodeTail(lqueue->l, value);\n length ++;\n }\n pthread_mutex_unlock(&lqueue->lmutex);\n\n if (list == NULL) {\n return -1;\n }\n\n return length;\n}\n\nvoid *dlockqueue_pop(void *q)\n{\n dlockqueue *lqueue = q;\n dlistNode *node;\n void *value;\n \n if (lqueue == NULL || lqueue->l == NULL) {\n return NULL;\n }\n \n pthread_mutex_lock(&lqueue->lmutex);\n \n node = dlistFirst(lqueue->l);\n if (node == NULL) {\n pthread_mutex_unlock(&lqueue->lmutex);\n return NULL;\n }\n\n value = dlistNodeValue(node);\n\n dlistDelNode(lqueue->l, node);\n\n pthread_mutex_unlock(&lqueue->lmutex);\n\n return value;\n}\n\nvoid dlockqueue_destroy(void *q)\n{\n dlockqueue *lqueue = q;\n if (lqueue == NULL) {\n return;\n }\n\n if (lqueue->l != NULL) {\n dlistRelease(lqueue->l);\n }\n\n pthread_mutex_destroy(&lqueue->lmutex);\n\n dfree(lqueue);\n}\n\nlong long dlockqueue_length(void *q)\n{\n dlockqueue *lqueue = q;\n long long length;\n \n if (lqueue == NULL || lqueue->l == NULL) {\n return -1;\n }\n\n pthread_mutex_lock(&lqueue->lmutex);\n length = dlistLength(lqueue->l);\n pthread_mutex_unlock(&lqueue->lmutex);\n \n return length;\n}\n" }, { "path": "dep/dlist/dlockqueue.h", "content": "#ifndef _DLOCKQUEUE_H_\n#define _DLOCKQUEUE_H_\n\nstruct dlist;\n\ntypedef struct dlockqueue{\n struct dlist *l;\n long long maxlen;\n int maxlen_policy;\n pthread_mutex_t lmutex;\n} dlockqueue;\n\ndlockqueue *dlockqueue_create(void);\nlong long dlockqueue_push(void *q, void *value);\nvoid *dlockqueue_pop(void *q);\nvoid dlockqueue_destroy(void *q);\nlong long dlockqueue_length(void *q);\n\n#endif\n" }, { "path": "dep/dlist/dmtqueue.c", "content": "#include \n\n#include \n\n#include \n#include \n#include \n\n/******** multi-thread safe queue interface ********/\ndmtqueue *dmtqueue_create(void)\n{\n dmtqueue *q;\n\n q = dalloc(sizeof(*q));\n if (q == NULL) {\n return NULL;\n }\n\n q->l = NULL;\n q->lock_push = NULL;\n q->lock_pop = NULL;\n q->destroy = NULL;\n q->length = NULL;\n \n return q;\n}\n\nvoid dmtqueue_destroy(dmtqueue *q)\n{\n if (q == NULL) {\n return;\n }\n\n if (q->destroy) {\n q->destroy(q->l);\n }\n\n dfree(q);\n}\n\nlong long dmtqueue_push(dmtqueue *q, void *value)\n{\n if(q == NULL || q->l == NULL\n || q->lock_push == NULL)\n {\n return -1;\n }\n\n return q->lock_push(q->l, value);\n}\n\nvoid *dmtqueue_pop(dmtqueue *q)\n{\n if(q == NULL || q->l == NULL\n || q->lock_pop == NULL)\n {\n return NULL;\n }\n \n return q->lock_pop(q->l);\n}\n\nint dmtqueue_empty(dmtqueue *q)\n{\n if(q == NULL || q->l == NULL\n || q->length == NULL)\n {\n return -1;\n }\n\n if(q->length(q->l) > 0)\n {\n return 0;\n }\n\n return 1;\n}\n\nlong long dmtqueue_length(dmtqueue *q)\n{\n if(q == NULL || q->l == NULL\n || q->length == NULL)\n {\n return -1;\n }\n\n return q->length(q->l);\n}\n\n/******** multi-thread safe queue implement ********/\n\n/**\n* This is multi-thread safe queue.\n* This lock list's performance is not good, but it is safe.\n*/\nint dmtqueue_init_with_lockqueue(dmtqueue *q, dlockqueue_freefunc freefunc)\n{\n dlockqueue *lq;\n \n if (q == NULL) {\n return -1;\n }\n\n lq = dlockqueue_create();\n if (lq == NULL) {\n return -1;\n }\n\n lq->l->free = freefunc;\n\n q->l = lq;\n q->lock_push = dlockqueue_push;\n q->lock_pop = dlockqueue_pop;\n q->destroy = dlockqueue_destroy;\n q->length = dlockqueue_length;\n \n return 0;\n}\n" }, { "path": "dep/dlist/dmtqueue.h", "content": "#ifndef _DMTQUEUE_H_\n#define _DMTQUEUE_H_\n\n#define MAX_LENGTH_POLICY_REJECT 0\n#define MAX_LENGTH_POLICY_EVICT_HEAD 1\n#define MAX_LENGTH_POLICY_EVICT_END 2\n\n/* Multi-thread safe queue */\ntypedef struct dmtqueue{\n void *l;\n long long (*lock_push)(void *q, void *value);\n void *(*lock_pop)(void *q);\n void (*destroy)(void *q);\n long long (*length)(void *q);\n} dmtqueue;\n\n#define dmtqueueSetMaxlength(q,l) ((q)->l->maxlen = (l))\n#define dmtqueueSetMaxlengthPolicy(q,p) ((q)->l->maxlen = (p))\n\ntypedef int (*dmtqueue_init)(dmtqueue *);\n\n/******** multi-thread safe list interface ********/\n\ndmtqueue *dmtqueue_create(void);\nvoid dmtqueue_destroy(dmtqueue *q);\nlong long dmtqueue_push(dmtqueue *q, void *value);\nvoid *dmtqueue_pop(dmtqueue *q);\nint dmtqueue_empty(dmtqueue *q);\nlong long dmtqueue_length(dmtqueue *q);\n\n/******** multi-thread safe list implement ********/\n\ntypedef void (*dlockqueue_freefunc)(void *);\nint dmtqueue_init_with_lockqueue(dmtqueue *l, dlockqueue_freefunc freefunc);\n\n#endif\n" }, { "path": "dep/dmalloc/Makefile.am", "content": "MAINTAINERCLEANFILES = Makefile.in\n\nAM_CPPFLAGS =\nif !OS_SOLARIS\nAM_CPPFLAGS += -D_GNU_SOURCE\nendif\nAM_CPPFLAGS += -I $(top_srcdir)/dep/jemalloc-4.2.0/include\nAM_CPPFLAGS += -I $(top_srcdir)/dep/util\n\nAM_CFLAGS = -Wall -Wshadow\nAM_CFLAGS += -Wno-unused-parameter -Wno-unused-value\n\nnoinst_LIBRARIES = libdmalloc.a\n\nnoinst_HEADERS = dmalloc.h\n\nlibdmalloc_a_SOURCES = \\\n\tdmalloc.c dmalloc.h" }, { "path": "dep/dmalloc/dmalloc.c", "content": "#include \n#include \n#include \n#include \n#include \n\n#include \n\n#include \n#include \n\n#include \n\n/*memory api*/\nstatic size_t used_memory = 0;\npthread_mutex_t used_memory_mutex = PTHREAD_MUTEX_INITIALIZER;\n\n#if defined(__ATOMIC_RELAXED)\n#define update_used_mem_stat_add(__n) __atomic_add_fetch(&used_memory, (__n), __ATOMIC_RELAXED)\n#define update_used_mem_stat_sub(__n) __atomic_sub_fetch(&used_memory, (__n), __ATOMIC_RELAXED)\nchar *malloc_lock_type(void) {return \"__ATOMIC_RELAXED\";}\n#elif defined(HAVE_ATOMIC)\n#define update_used_mem_stat_add(__n) __sync_add_and_fetch(&used_memory, (__n))\n#define update_used_mem_stat_sub(__n) __sync_sub_and_fetch(&used_memory, (__n))\nchar *malloc_lock_type(void) {return \"HAVE_ATOMIC\";}\n#else\n#define update_used_mem_stat_add(__n) do { \\\n pthread_mutex_lock(&used_memory_mutex); \\\n used_memory += (__n); \\\n pthread_mutex_unlock(&used_memory_mutex); \\\n} while(0)\n\n#define update_used_mem_stat_sub(__n) do { \\\n pthread_mutex_lock(&used_memory_mutex); \\\n used_memory -= (__n); \\\n pthread_mutex_unlock(&used_memory_mutex); \\\n} while(0)\n\nchar *malloc_lock_type(void) {return \"pthread_mutex_t\";}\n#endif\n\n#define update_dmalloc_stat_alloc(__n) do { \\\n size_t _n = (__n); \\\n if (_n&(sizeof(long)-1)) _n += sizeof(long)-(_n&(sizeof(long)-1)); \\\n update_used_mem_stat_add(_n); \\\n} while(0)\n\n#define update_dmalloc_stat_free(__n) do { \\\n size_t _n = (__n); \\\n if (_n&(sizeof(long)-1)) _n += sizeof(long)-(_n&(sizeof(long)-1)); \\\n update_used_mem_stat_sub(_n); \\\n} while(0)\n\n#ifdef HAVE_MALLOC_SIZE\n#define PREFIX_SIZE (0)\n#else\n#if defined(__sun) || defined(__sparc) || defined(__sparc__)\n#define PREFIX_SIZE (sizeof(long long))\n#else\n#define PREFIX_SIZE (sizeof(size_t))\n#endif\n#endif\n\n/* Provide dmalloc_size() for systems where this function is not provided by\n * malloc itself, given that in that case we store a header with this\n * information as the first bytes of every allocation. */\n#ifndef HAVE_MALLOC_SIZE\nsize_t dmalloc_size(void *ptr) {\n void *realptr = (char*)ptr-PREFIX_SIZE;\n size_t size = *((size_t*)realptr);\n /* Assume at least that all the allocations are padded at sizeof(long) by\n * the underlying allocator. */\n if (size&(sizeof(long)-1)) size += sizeof(long)-(size&(sizeof(long)-1));\n return size+PREFIX_SIZE;\n}\n#endif\n\nvoid *\n_dalloc(size_t size, const char *name, int line)\n{\n void *p;\n\n ASSERT(size != 0);\n\n#ifdef DUSE_JEMALLOC\n p = je_malloc(size+PREFIX_SIZE);\n#else\n p = malloc(size+PREFIX_SIZE);\n#endif\n if (p == NULL) {\n log_error(\"malloc(%zu) failed @ %s:%d\", size, name, line);\n } else {\n#ifdef HAVE_MALLOC_SIZE\n update_dmalloc_stat_alloc(dmalloc_size(p));\n return p;\n#else\n *((size_t*)p) = size;\n update_dmalloc_stat_alloc(size+PREFIX_SIZE);\n return (char*)p+PREFIX_SIZE;\n#endif\n log_debug(LOG_VVERB, \"malloc(%zu) at %p @ %s:%d\", size, p, name, line);\n }\n\n return p;\n}\n\nvoid *\n_dzalloc(size_t size, const char *name, int line)\n{\n void *p;\n\n p = _dalloc(size, name, line);\n if (p != NULL) {\n memset(p, 0, size);\n }\n\n return p;\n}\n\nvoid *\n_dcalloc(size_t nmemb, size_t size, const char *name, int line)\n{\n return _dzalloc(nmemb * size, name, line);\n}\n\nvoid *\n_drealloc(void *ptr, size_t size, const char *name, int line)\n{\n#ifndef HAVE_MALLOC_SIZE\n void *realp;\n#endif\n void *p;\n size_t oldsize;\n\n ASSERT(size != 0);\n\n if (ptr == NULL) return _dalloc(size, name, line);\n\n#ifdef HAVE_MALLOC_SIZE\n oldsize = dmalloc_size(ptr);\n#ifdef DUSE_JEMALLOC\n p = je_realloc(ptr, size);\n#else\n p = realloc(ptr, size);\n#endif\n#else\n realp = (char*)ptr-PREFIX_SIZE;\n oldsize = *((size_t*)realp);\n#ifdef DUSE_JEMALLOC\n p = je_realloc(ptr, size+PREFIX_SIZE);\n#else\n p = realloc(ptr, size+PREFIX_SIZE);\n#endif\n#endif\n if (p == NULL) {\n log_error(\"realloc(%zu) failed @ %s:%d\", size, name, line);\n return NULL;\n } else {\n log_debug(LOG_VVERB, \"realloc(%zu) at %p @ %s:%d\", size, p, name, line);\n#ifdef HAVE_MALLOC_SIZE\n update_dmalloc_stat_free(oldsize);\n update_dmalloc_stat_alloc(dmalloc_size(p));\n return p;\n#else\n *((size_t*)p) = size;\n update_dmalloc_stat_free(oldsize);\n update_dmalloc_stat_alloc(size);\n return p+PREFIX_SIZE;\n#endif\n }\n\n return NULL;\n}\n\nvoid\n_dfree(void *ptr, const char *name, int line)\n{\n#ifndef HAVE_MALLOC_SIZE\n void *realp;\n size_t oldsize;\n#endif\n\n ASSERT(ptr != NULL);\n log_debug(LOG_VVERB, \"free(%p) @ %s:%d\", ptr, name, line);\n\n#ifdef HAVE_MALLOC_SIZE\n update_dmalloc_stat_free(dmalloc_size(ptr));\n#ifdef DUSE_JEMALLOC\n je_free(ptr);\n#else\n free(ptr);\n#endif\n#else\n realp = (char*)ptr-PREFIX_SIZE;\n oldsize = *((size_t*)realp);\n update_dmalloc_stat_free(oldsize+PREFIX_SIZE);\n free(realp);\n#ifdef DUSE_JEMALLOC\n je_free(realp);\n#else\n free(realp);\n#endif\n#endif\n}\n\nsize_t\ndalloc_used_memory(void)\n{\n size_t um;\n\n#if defined(__ATOMIC_RELAXED) || defined(HAVE_ATOMIC)\n um = update_used_mem_stat_add(0);\n#else\n pthread_mutex_lock(&used_memory_mutex);\n um = used_memory;\n pthread_mutex_unlock(&used_memory_mutex);\n#endif\n\n return um;\n}\n\n/* Returns the size of physical memory (RAM) in bytes.\n * It looks ugly, but this is the cleanest way to achive cross platform results.\n * Cleaned up from:\n *\n * http://nadeausoftware.com/articles/2012/09/c_c_tip_how_get_physical_memory_size_system\n *\n * Note that this function:\n * 1) Was released under the following CC attribution license:\n * http://creativecommons.org/licenses/by/3.0/deed.en_US.\n * 2) Was originally implemented by David Robert Nadeau.\n * 3) Was modified for Redis by Matt Stancliff.\n * 4) This note exists in order to comply with the original license.\n */\nsize_t dalloc_get_memory_size(void) {\n#if defined(__unix__) || defined(__unix) || defined(unix) || \\\n (defined(__APPLE__) && defined(__MACH__))\n#if defined(CTL_HW) && (defined(HW_MEMSIZE) || defined(HW_PHYSMEM64))\n int mib[2];\n mib[0] = CTL_HW;\n#if defined(HW_MEMSIZE)\n mib[1] = HW_MEMSIZE; /* OSX. --------------------- */\n#elif defined(HW_PHYSMEM64)\n mib[1] = HW_PHYSMEM64; /* NetBSD, OpenBSD. --------- */\n#endif\n int64_t size = 0; /* 64-bit */\n size_t len = sizeof(size);\n if (sysctl( mib, 2, &size, &len, NULL, 0) == 0)\n return (size_t)size;\n return 0L; /* Failed? */\n\n#elif defined(_SC_PHYS_PAGES) && defined(_SC_PAGESIZE)\n /* FreeBSD, Linux, OpenBSD, and Solaris. -------------------- */\n return (size_t)sysconf(_SC_PHYS_PAGES) * (size_t)sysconf(_SC_PAGESIZE);\n\n#elif defined(CTL_HW) && (defined(HW_PHYSMEM) || defined(HW_REALMEM))\n /* DragonFly BSD, FreeBSD, NetBSD, OpenBSD, and OSX. -------- */\n int mib[2];\n mib[0] = CTL_HW;\n#if defined(HW_REALMEM)\n mib[1] = HW_REALMEM; /* FreeBSD. ----------------- */\n#elif defined(HW_PYSMEM)\n mib[1] = HW_PHYSMEM; /* Others. ------------------ */\n#endif\n unsigned int size = 0; /* 32-bit */\n size_t len = sizeof(size);\n if (sysctl(mib, 2, &size, &len, NULL, 0) == 0)\n return (size_t)size;\n return 0L; /* Failed? */\n#endif /* sysctl and sysconf variants */\n\n#else\n return 0L; /* Unknown OS. */\n#endif\n}\n\n/* Get the RSS information in an OS-specific way.\n *\n * WARNING: the function zmalloc_get_rss() is not designed to be fast\n * and may not be called in the busy loops where Redis tries to release\n * memory expiring or swapping out objects.\n *\n * For this kind of \"fast RSS reporting\" usages use instead the\n * function RedisEstimateRSS() that is a much faster (and less precise)\n * version of the function. */\n\n#if defined(HAVE_PROC_STAT)\n#include \n#include \n#include \n#include \n\nsize_t dalloc_get_rss(void) {\n int page = sysconf(_SC_PAGESIZE);\n size_t rss;\n char buf[4096];\n char filename[256];\n int fd, count;\n char *p, *x;\n\n snprintf(filename,256,\"/proc/%d/stat\",getpid());\n if ((fd = open(filename,O_RDONLY)) == -1) return 0;\n if (read(fd,buf,4096) <= 0) {\n close(fd);\n return 0;\n }\n close(fd);\n\n p = buf;\n count = 23; /* RSS is the 24th field in /proc//stat */\n while(p && count--) {\n p = strchr(p,' ');\n if (p) p++;\n }\n if (!p) return 0;\n x = strchr(p,' ');\n if (!x) return 0;\n *x = '\\0';\n\n rss = strtoll(p,NULL,10);\n rss *= page;\n return rss;\n}\n#elif defined(HAVE_TASKINFO)\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nsize_t dalloc_get_rss(void) {\n task_t task = MACH_PORT_NULL;\n struct task_basic_info t_info;\n mach_msg_type_number_t t_info_count = TASK_BASIC_INFO_COUNT;\n\n if (task_for_pid(current_task(), getpid(), &task) != KERN_SUCCESS)\n return 0;\n task_info(task, TASK_BASIC_INFO, (task_info_t)&t_info, &t_info_count);\n\n return t_info.resident_size;\n}\n#else\nsize_t dalloc_get_rss(void) {\n /* If we can't get the RSS in an OS-specific way for this system just\n * return the memory usage we estimated in dalloc()..\n *\n * Fragmentation will appear to be always 1 (no fragmentation)\n * of course... */\n return dalloc_used_memory();\n}\n#endif\n\n/* Fragmentation = RSS / allocated-bytes */\nfloat dalloc_get_fragmentation_ratio(size_t rss) {\n return (float)rss/dalloc_used_memory();\n}\n" }, { "path": "dep/dmalloc/dmalloc.h", "content": "#ifndef _DMALLOC_H_\n#define _DMALLOC_H_\n\n#ifdef HAVE_CONFIG_H\n# include \n#endif\n\n#include \n\n#ifdef HAVE_JEMALLOC\n# define DUSE_JEMALLOC 1\n#endif\n\n/*\n * Memory allocation and free wrappers.\n *\n * These wrappers enables us to loosely detect double free, dangling\n * pointer access and zero-byte alloc.\n */\n#if defined(DUSE_JEMALLOC)\n#define DMALLOC_LIB (\"jemalloc-\" __xstr(JEMALLOC_VERSION_MAJOR) \".\" __xstr(JEMALLOC_VERSION_MINOR) \".\" __xstr(JEMALLOC_VERSION_BUGFIX))\n#include \n#if (JEMALLOC_VERSION_MAJOR == 2 && JEMALLOC_VERSION_MINOR >= 1) || (JEMALLOC_VERSION_MAJOR > 2)\n#define HAVE_MALLOC_SIZE 1\n#define dmalloc_size(p) je_malloc_usable_size(p)\n#else\n#error \"Newer version of jemalloc required\"\n#endif\n#elif defined(__APPLE__)\n#include \n#define HAVE_MALLOC_SIZE 1\n#define dmalloc_size(p) malloc_size(p)\n#endif\n \n#ifndef DMALLOC_LIB\n#define DMALLOC_LIB \"libc\"\n#endif\n\n#define dalloc(_s) \\\n _dalloc((size_t)(_s), __FILE__, __LINE__)\n\n#define dzalloc(_s) \\\n _dzalloc((size_t)(_s), __FILE__, __LINE__)\n\n#define dcalloc(_n, _s) \\\n _dcalloc((size_t)(_n), (size_t)(_s), __FILE__, __LINE__)\n\n#define drealloc(_p, _s) \\\n _drealloc(_p, (size_t)(_s), __FILE__, __LINE__)\n\n#define dfree(_p) do { \\\n _dfree(_p, __FILE__, __LINE__); \\\n} while (0)\n\nchar *dmalloc_lock_type(void);\n\n#ifndef HAVE_MALLOC_SIZE\nsize_t dmalloc_size(void *ptr);\n#endif\n\nvoid *_dalloc(size_t size, const char *name, int line);\nvoid *_dzalloc(size_t size, const char *name, int line);\nvoid *_dcalloc(size_t nmemb, size_t size, const char *name, int line);\nvoid *_drealloc(void *ptr, size_t size, const char *name, int line);\nvoid _dfree(void *ptr, const char *name, int line);\n\nsize_t dalloc_used_memory(void);\n\nsize_t dalloc_get_memory_size(void);\n\nsize_t dalloc_get_rss(void);\nfloat dalloc_get_fragmentation_ratio(size_t rss);\n\n#endif\n" }, { "path": "dep/himemcached-0.1.0/Makefile.am", "content": "MAINTAINERCLEANFILES = Makefile.in\n\nAM_CFLAGS = -Wall -Wshadow\nAM_CFLAGS += -Wno-unused-parameter -Wno-unused-value\n\nnoinst_LIBRARIES = libhimemcached.a\n\nnoinst_HEADERS = himemcached.h himcread.h himcdep/sds.h\n\nlibhimemcached_a_SOURCES = \\\n himcdep/sds.c himcdep/sds.h \\\n himcread.c himcread.h \\\n\thimemcached.c himemcached.h" }, { "path": "dep/himemcached-0.1.0/himcdep/sds.c", "content": "/* SDS (Simple Dynamic Strings), A C dynamic strings library.\n *\n * Copyright (c) 2006-2014, Salvatore Sanfilippo \n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * * Neither the name of Redis nor the names of its contributors may be used\n * to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n#include \n#include \n#include \n#include \n#include \n\n#include \"sds.h\"\n\n/* Create a new sds string with the content specified by the 'init' pointer\n * and 'initlen'.\n * If NULL is used for 'init' the string is initialized with zero bytes.\n *\n * The string is always null-termined (all the sds strings are, always) so\n * even if you create an sds string with:\n *\n * mystring = sdsnewlen(\"abc\",3\");\n *\n * You can print the string with printf() as there is an implicit \\0 at the\n * end of the string. However the string is binary safe and can contain\n * \\0 characters in the middle, as the length is stored in the sds header. */\nsds sdsnewlen(const void *init, size_t initlen) {\n struct sdshdr *sh;\n\n if (init) {\n sh = malloc(sizeof *sh+initlen+1);\n } else {\n sh = calloc(sizeof *sh+initlen+1,1);\n }\n if (sh == NULL) return NULL;\n sh->len = initlen;\n sh->free = 0;\n if (initlen && init)\n memcpy(sh->buf, init, initlen);\n sh->buf[initlen] = '\\0';\n return (char*)sh->buf;\n}\n\n/* Create an empty (zero length) sds string. Even in this case the string\n * always has an implicit null term. */\nsds sdsempty(void) {\n return sdsnewlen(\"\",0);\n}\n\n/* Create a new sds string starting from a null termined C string. */\nsds sdsnew(const char *init) {\n size_t initlen = (init == NULL) ? 0 : strlen(init);\n return sdsnewlen(init, initlen);\n}\n\n/* Duplicate an sds string. */\nsds sdsdup(const sds s) {\n return sdsnewlen(s, sdslen(s));\n}\n\n/* Free an sds string. No operation is performed if 's' is NULL. */\nvoid sdsfree(sds s) {\n if (s == NULL) return;\n free(s-sizeof(struct sdshdr));\n}\n\n/* Set the sds string length to the length as obtained with strlen(), so\n * considering as content only up to the first null term character.\n *\n * This function is useful when the sds string is hacked manually in some\n * way, like in the following example:\n *\n * s = sdsnew(\"foobar\");\n * s[2] = '\\0';\n * sdsupdatelen(s);\n * printf(\"%d\\n\", sdslen(s));\n *\n * The output will be \"2\", but if we comment out the call to sdsupdatelen()\n * the output will be \"6\" as the string was modified but the logical length\n * remains 6 bytes. */\nvoid sdsupdatelen(sds s) {\n struct sdshdr *sh = (void*) (s-sizeof *sh);\n int reallen = strlen(s);\n sh->free += (sh->len-reallen);\n sh->len = reallen;\n}\n\n/* Modify an sds string on-place to make it empty (zero length).\n * However all the existing buffer is not discarded but set as free space\n * so that next append operations will not require allocations up to the\n * number of bytes previously available. */\nvoid sdsclear(sds s) {\n struct sdshdr *sh = (void*) (s-sizeof *sh);\n sh->free += sh->len;\n sh->len = 0;\n sh->buf[0] = '\\0';\n}\n\n/* Enlarge the free space at the end of the sds string so that the caller\n * is sure that after calling this function can overwrite up to addlen\n * bytes after the end of the string, plus one more byte for nul term.\n *\n * Note: this does not change the *length* of the sds string as returned\n * by sdslen(), but only the free buffer space we have. */\nsds sdsMakeRoomFor(sds s, size_t addlen) {\n struct sdshdr *sh, *newsh;\n size_t free = sdsavail(s);\n size_t len, newlen;\n\n if (free >= addlen) return s;\n len = sdslen(s);\n sh = (void*) (s-sizeof *sh);\n newlen = (len+addlen);\n if (newlen < SDS_MAX_PREALLOC)\n newlen *= 2;\n else\n newlen += SDS_MAX_PREALLOC;\n newsh = realloc(sh, sizeof *newsh+newlen+1);\n if (newsh == NULL) return NULL;\n\n newsh->free = newlen - len;\n return newsh->buf;\n}\n\n/* Reallocate the sds string so that it has no free space at the end. The\n * contained string remains not altered, but next concatenation operations\n * will require a reallocation.\n *\n * After the call, the passed sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call. */\nsds sdsRemoveFreeSpace(sds s) {\n struct sdshdr *sh;\n\n sh = (void*) (s-sizeof *sh);\n sh = realloc(sh, sizeof *sh+sh->len+1);\n sh->free = 0;\n return sh->buf;\n}\n\n/* Return the total size of the allocation of the specifed sds string,\n * including:\n * 1) The sds header before the pointer.\n * 2) The string.\n * 3) The free buffer at the end if any.\n * 4) The implicit null term.\n */\nsize_t sdsAllocSize(sds s) {\n struct sdshdr *sh = (void*) (s-sizeof *sh);\n\n return sizeof(*sh)+sh->len+sh->free+1;\n}\n\n/* Increment the sds length and decrements the left free space at the\n * end of the string according to 'incr'. Also set the null term\n * in the new end of the string.\n *\n * This function is used in order to fix the string length after the\n * user calls sdsMakeRoomFor(), writes something after the end of\n * the current string, and finally needs to set the new length.\n *\n * Note: it is possible to use a negative increment in order to\n * right-trim the string.\n *\n * Usage example:\n *\n * Using sdsIncrLen() and sdsMakeRoomFor() it is possible to mount the\n * following schema, to cat bytes coming from the kernel to the end of an\n * sds string without copying into an intermediate buffer:\n *\n * oldlen = sdslen(s);\n * s = sdsMakeRoomFor(s, BUFFER_SIZE);\n * nread = read(fd, s+oldlen, BUFFER_SIZE);\n * ... check for nread <= 0 and handle it ...\n * sdsIncrLen(s, nread);\n */\nvoid sdsIncrLen(sds s, int incr) {\n struct sdshdr *sh = (void*) (s-sizeof *sh);\n\n assert(sh->free >= incr);\n sh->len += incr;\n sh->free -= incr;\n assert(sh->free >= 0);\n s[sh->len] = '\\0';\n}\n\n/* Grow the sds to have the specified length. Bytes that were not part of\n * the original length of the sds will be set to zero.\n *\n * if the specified length is smaller than the current length, no operation\n * is performed. */\nsds sdsgrowzero(sds s, size_t len) {\n struct sdshdr *sh = (void*) (s-sizeof *sh);\n size_t totlen, curlen = sh->len;\n\n if (len <= curlen) return s;\n s = sdsMakeRoomFor(s,len-curlen);\n if (s == NULL) return NULL;\n\n /* Make sure added region doesn't contain garbage */\n sh = (void*)(s-sizeof *sh);\n memset(s+curlen,0,(len-curlen+1)); /* also set trailing \\0 byte */\n totlen = sh->len+sh->free;\n sh->len = len;\n sh->free = totlen-sh->len;\n return s;\n}\n\n/* Append the specified binary-safe string pointed by 't' of 'len' bytes to the\n * end of the specified sds string 's'.\n *\n * After the call, the passed sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call. */\nsds sdscatlen(sds s, const void *t, size_t len) {\n struct sdshdr *sh;\n size_t curlen = sdslen(s);\n\n s = sdsMakeRoomFor(s,len);\n if (s == NULL) return NULL;\n sh = (void*) (s-sizeof *sh);\n memcpy(s+curlen, t, len);\n sh->len = curlen+len;\n sh->free = sh->free-len;\n s[curlen+len] = '\\0';\n return s;\n}\n\n/* Append the specified null termianted C string to the sds string 's'.\n *\n * After the call, the passed sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call. */\nsds sdscat(sds s, const char *t) {\n return sdscatlen(s, t, strlen(t));\n}\n\n/* Append the specified sds 't' to the existing sds 's'.\n *\n * After the call, the modified sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call. */\nsds sdscatsds(sds s, const sds t) {\n return sdscatlen(s, t, sdslen(t));\n}\n\n/* Destructively modify the sds string 's' to hold the specified binary\n * safe string pointed by 't' of length 'len' bytes. */\nsds sdscpylen(sds s, const char *t, size_t len) {\n struct sdshdr *sh = (void*) (s-sizeof *sh);\n size_t totlen = sh->free+sh->len;\n\n if (totlen < len) {\n s = sdsMakeRoomFor(s,len-sh->len);\n if (s == NULL) return NULL;\n sh = (void*) (s-sizeof *sh);\n totlen = sh->free+sh->len;\n }\n memcpy(s, t, len);\n s[len] = '\\0';\n sh->len = len;\n sh->free = totlen-len;\n return s;\n}\n\n/* Like sdscpylen() but 't' must be a null-termined string so that the length\n * of the string is obtained with strlen(). */\nsds sdscpy(sds s, const char *t) {\n return sdscpylen(s, t, strlen(t));\n}\n\n/* Helper for sdscatlonglong() doing the actual number -> string\n * conversion. 's' must point to a string with room for at least\n * SDS_LLSTR_SIZE bytes.\n *\n * The function returns the lenght of the null-terminated string\n * representation stored at 's'. */\n#define SDS_LLSTR_SIZE 21\nint sdsll2str(char *s, long long value) {\n char *p, aux;\n unsigned long long v;\n size_t l;\n\n /* Generate the string representation, this method produces\n * an reversed string. */\n v = (value < 0) ? -value : value;\n p = s;\n do {\n *p++ = '0'+(v%10);\n v /= 10;\n } while(v);\n if (value < 0) *p++ = '-';\n\n /* Compute length and add null term. */\n l = p-s;\n *p = '\\0';\n\n /* Reverse the string. */\n p--;\n while(s < p) {\n aux = *s;\n *s = *p;\n *p = aux;\n s++;\n p--;\n }\n return l;\n}\n\n/* Identical sdsll2str(), but for unsigned long long type. */\nint sdsull2str(char *s, unsigned long long v) {\n char *p, aux;\n size_t l;\n\n /* Generate the string representation, this method produces\n * an reversed string. */\n p = s;\n do {\n *p++ = '0'+(v%10);\n v /= 10;\n } while(v);\n\n /* Compute length and add null term. */\n l = p-s;\n *p = '\\0';\n\n /* Reverse the string. */\n p--;\n while(s < p) {\n aux = *s;\n *s = *p;\n *p = aux;\n s++;\n p--;\n }\n return l;\n}\n\n/* Like sdscatpritf() but gets va_list instead of being variadic. */\nsds sdscatvprintf(sds s, const char *fmt, va_list ap) {\n va_list cpy;\n char *buf, *t;\n size_t buflen = 16;\n\n while(1) {\n buf = malloc(buflen);\n if (buf == NULL) return NULL;\n buf[buflen-2] = '\\0';\n va_copy(cpy,ap);\n vsnprintf(buf, buflen, fmt, cpy);\n if (buf[buflen-2] != '\\0') {\n free(buf);\n buflen *= 2;\n continue;\n }\n break;\n }\n t = sdscat(s, buf);\n free(buf);\n return t;\n}\n\n/* Append to the sds string 's' a string obtained using printf-alike format\n * specifier.\n *\n * After the call, the modified sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call.\n *\n * Example:\n *\n * s = sdsnew(\"Sum is: \");\n * s = sdscatprintf(s,\"%d+%d = %d\",a,b,a+b);\n *\n * Often you need to create a string from scratch with the printf-alike\n * format. When this is the need, just use sdsempty() as the target string:\n *\n * s = sdscatprintf(sdsempty(), \"... your format ...\", args);\n */\nsds sdscatprintf(sds s, const char *fmt, ...) {\n va_list ap;\n char *t;\n va_start(ap, fmt);\n t = sdscatvprintf(s,fmt,ap);\n va_end(ap);\n return t;\n}\n\n/* This function is similar to sdscatprintf, but much faster as it does\n * not rely on sprintf() family functions implemented by the libc that\n * are often very slow. Moreover directly handling the sds string as\n * new data is concatenated provides a performance improvement.\n *\n * However this function only handles an incompatible subset of printf-alike\n * format specifiers:\n *\n * %s - C String\n * %S - SDS string\n * %i - signed int\n * %I - 64 bit signed integer (long long, int64_t)\n * %u - unsigned int\n * %U - 64 bit unsigned integer (unsigned long long, uint64_t)\n * %T - A size_t variable.\n * %% - Verbatim \"%\" character.\n */\nsds sdscatfmt(sds s, char const *fmt, ...) {\n struct sdshdr *sh = (void*) (s-(sizeof(struct sdshdr)));\n size_t initlen = sdslen(s);\n const char *f = fmt;\n int i;\n va_list ap;\n\n va_start(ap,fmt);\n f = fmt; /* Next format specifier byte to process. */\n i = initlen; /* Position of the next byte to write to dest str. */\n while(*f) {\n char next, *str;\n int l;\n long long num;\n unsigned long long unum;\n\n /* Make sure there is always space for at least 1 char. */\n if (sh->free == 0) {\n s = sdsMakeRoomFor(s,1);\n sh = (void*) (s-(sizeof(struct sdshdr)));\n }\n\n switch(*f) {\n case '%':\n next = *(f+1);\n f++;\n switch(next) {\n case 's':\n case 'S':\n str = va_arg(ap,char*);\n l = (next == 's') ? strlen(str) : sdslen(str);\n if (sh->free < l) {\n s = sdsMakeRoomFor(s,l);\n sh = (void*) (s-(sizeof(struct sdshdr)));\n }\n memcpy(s+i,str,l);\n sh->len += l;\n sh->free -= l;\n i += l;\n break;\n case 'i':\n case 'I':\n if (next == 'i')\n num = va_arg(ap,int);\n else\n num = va_arg(ap,long long);\n {\n char buf[SDS_LLSTR_SIZE];\n l = sdsll2str(buf,num);\n if (sh->free < l) {\n s = sdsMakeRoomFor(s,l);\n sh = (void*) (s-(sizeof(struct sdshdr)));\n }\n memcpy(s+i,buf,l);\n sh->len += l;\n sh->free -= l;\n i += l;\n }\n break;\n case 'u':\n case 'U':\n case 'T':\n if (next == 'u')\n unum = va_arg(ap,unsigned int);\n else if(next == 'U')\n unum = va_arg(ap,unsigned long long);\n else\n unum = (unsigned long long)va_arg(ap,size_t);\n {\n char buf[SDS_LLSTR_SIZE];\n l = sdsull2str(buf,unum);\n if (sh->free < l) {\n s = sdsMakeRoomFor(s,l);\n sh = (void*) (s-(sizeof(struct sdshdr)));\n }\n memcpy(s+i,buf,l);\n sh->len += l;\n sh->free -= l;\n i += l;\n }\n break;\n default: /* Handle %% and generally %. */\n s[i++] = next;\n sh->len += 1;\n sh->free -= 1;\n break;\n }\n break;\n default:\n s[i++] = *f;\n sh->len += 1;\n sh->free -= 1;\n break;\n }\n f++;\n }\n va_end(ap);\n\n /* Add null-term */\n s[i] = '\\0';\n return s;\n}\n\n\n/* Remove the part of the string from left and from right composed just of\n * contiguous characters found in 'cset', that is a null terminted C string.\n *\n * After the call, the modified sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call.\n *\n * Example:\n *\n * s = sdsnew(\"AA...AA.a.aa.aHelloWorld :::\");\n * s = sdstrim(s,\"A. :\");\n * printf(\"%s\\n\", s);\n *\n * Output will be just \"Hello World\".\n */\nvoid sdstrim(sds s, const char *cset) {\n struct sdshdr *sh = (void*) (s-sizeof *sh);\n char *start, *end, *sp, *ep;\n size_t len;\n\n sp = start = s;\n ep = end = s+sdslen(s)-1;\n while(sp <= end && strchr(cset, *sp)) sp++;\n while(ep > start && strchr(cset, *ep)) ep--;\n len = (sp > ep) ? 0 : ((ep-sp)+1);\n if (sh->buf != sp) memmove(sh->buf, sp, len);\n sh->buf[len] = '\\0';\n sh->free = sh->free+(sh->len-len);\n sh->len = len;\n}\n\n/* Turn the string into a smaller (or equal) string containing only the\n * substring specified by the 'start' and 'end' indexes.\n *\n * start and end can be negative, where -1 means the last character of the\n * string, -2 the penultimate character, and so forth.\n *\n * The interval is inclusive, so the start and end characters will be part\n * of the resulting string.\n *\n * The string is modified in-place.\n *\n * Example:\n *\n * s = sdsnew(\"Hello World\");\n * sdsrange(s,1,-1); => \"ello World\"\n */\nvoid sdsrange(sds s, int start, int end) {\n struct sdshdr *sh = (void*) (s-sizeof *sh);\n size_t newlen, len = sdslen(s);\n\n if (len == 0) return;\n if (start < 0) {\n start = len+start;\n if (start < 0) start = 0;\n }\n if (end < 0) {\n end = len+end;\n if (end < 0) end = 0;\n }\n newlen = (start > end) ? 0 : (end-start)+1;\n if (newlen != 0) {\n if (start >= (signed)len) {\n newlen = 0;\n } else if (end >= (signed)len) {\n end = len-1;\n newlen = (start > end) ? 0 : (end-start)+1;\n }\n } else {\n start = 0;\n }\n if (start && newlen) memmove(sh->buf, sh->buf+start, newlen);\n sh->buf[newlen] = 0;\n sh->free = sh->free+(sh->len-newlen);\n sh->len = newlen;\n}\n\n/* Apply tolower() to every character of the sds string 's'. */\nvoid sdstolower(sds s) {\n int len = sdslen(s), j;\n\n for (j = 0; j < len; j++) s[j] = tolower(s[j]);\n}\n\n/* Apply toupper() to every character of the sds string 's'. */\nvoid sdstoupper(sds s) {\n int len = sdslen(s), j;\n\n for (j = 0; j < len; j++) s[j] = toupper(s[j]);\n}\n\n/* Compare two sds strings s1 and s2 with memcmp().\n *\n * Return value:\n *\n * 1 if s1 > s2.\n * -1 if s1 < s2.\n * 0 if s1 and s2 are exactly the same binary string.\n *\n * If two strings share exactly the same prefix, but one of the two has\n * additional characters, the longer string is considered to be greater than\n * the smaller one. */\nint sdscmp(const sds s1, const sds s2) {\n size_t l1, l2, minlen;\n int cmp;\n\n l1 = sdslen(s1);\n l2 = sdslen(s2);\n minlen = (l1 < l2) ? l1 : l2;\n cmp = memcmp(s1,s2,minlen);\n if (cmp == 0) return l1-l2;\n return cmp;\n}\n\n/* Split 's' with separator in 'sep'. An array\n * of sds strings is returned. *count will be set\n * by reference to the number of tokens returned.\n *\n * On out of memory, zero length string, zero length\n * separator, NULL is returned.\n *\n * Note that 'sep' is able to split a string using\n * a multi-character separator. For example\n * sdssplit(\"foo_-_bar\",\"_-_\"); will return two\n * elements \"foo\" and \"bar\".\n *\n * This version of the function is binary-safe but\n * requires length arguments. sdssplit() is just the\n * same function but for zero-terminated strings.\n */\nsds *sdssplitlen(const char *s, int len, const char *sep, int seplen, int *count) {\n int elements = 0, slots = 5, start = 0, j;\n sds *tokens;\n\n if (seplen < 1 || len < 0) return NULL;\n\n tokens = malloc(sizeof(sds)*slots);\n if (tokens == NULL) return NULL;\n\n if (len == 0) {\n *count = 0;\n return tokens;\n }\n for (j = 0; j < (len-(seplen-1)); j++) {\n /* make sure there is room for the next element and the final one */\n if (slots < elements+2) {\n sds *newtokens;\n\n slots *= 2;\n newtokens = realloc(tokens,sizeof(sds)*slots);\n if (newtokens == NULL) goto cleanup;\n tokens = newtokens;\n }\n /* search the separator */\n if ((seplen == 1 && *(s+j) == sep[0]) || (memcmp(s+j,sep,seplen) == 0)) {\n tokens[elements] = sdsnewlen(s+start,j-start);\n if (tokens[elements] == NULL) goto cleanup;\n elements++;\n start = j+seplen;\n j = j+seplen-1; /* skip the separator */\n }\n }\n /* Add the final element. We are sure there is room in the tokens array. */\n tokens[elements] = sdsnewlen(s+start,len-start);\n if (tokens[elements] == NULL) goto cleanup;\n elements++;\n *count = elements;\n return tokens;\n\ncleanup:\n {\n int i;\n for (i = 0; i < elements; i++) sdsfree(tokens[i]);\n free(tokens);\n *count = 0;\n return NULL;\n }\n}\n\n/* Free the result returned by sdssplitlen(), or do nothing if 'tokens' is NULL. */\nvoid sdsfreesplitres(sds *tokens, int count) {\n if (!tokens) return;\n while(count--)\n sdsfree(tokens[count]);\n free(tokens);\n}\n\n/* Create an sds string from a long long value. It is much faster than:\n *\n * sdscatprintf(sdsempty(),\"%lld\\n\", value);\n */\nsds sdsfromlonglong(long long value) {\n char buf[32], *p;\n unsigned long long v;\n\n v = (value < 0) ? -value : value;\n p = buf+31; /* point to the last character */\n do {\n *p-- = '0'+(v%10);\n v /= 10;\n } while(v);\n if (value < 0) *p-- = '-';\n p++;\n return sdsnewlen(p,32-(p-buf));\n}\n\n/* Append to the sds string \"s\" an escaped string representation where\n * all the non-printable characters (tested with isprint()) are turned into\n * escapes in the form \"\\n\\r\\a....\" or \"\\x\".\n *\n * After the call, the modified sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call. */\nsds sdscatrepr(sds s, const char *p, size_t len) {\n s = sdscatlen(s,\"\\\"\",1);\n while(len--) {\n switch(*p) {\n case '\\\\':\n case '\"':\n s = sdscatprintf(s,\"\\\\%c\",*p);\n break;\n case '\\n': s = sdscatlen(s,\"\\\\n\",2); break;\n case '\\r': s = sdscatlen(s,\"\\\\r\",2); break;\n case '\\t': s = sdscatlen(s,\"\\\\t\",2); break;\n case '\\a': s = sdscatlen(s,\"\\\\a\",2); break;\n case '\\b': s = sdscatlen(s,\"\\\\b\",2); break;\n default:\n if (isprint(*p))\n s = sdscatprintf(s,\"%c\",*p);\n else\n s = sdscatprintf(s,\"\\\\x%02x\",(unsigned char)*p);\n break;\n }\n p++;\n }\n return sdscatlen(s,\"\\\"\",1);\n}\n\n/* Helper function for sdssplitargs() that returns non zero if 'c'\n * is a valid hex digit. */\nint is_hex_digit(char c) {\n return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') ||\n (c >= 'A' && c <= 'F');\n}\n\n/* Helper function for sdssplitargs() that converts a hex digit into an\n * integer from 0 to 15 */\nint hex_digit_to_int(char c) {\n switch(c) {\n case '0': return 0;\n case '1': return 1;\n case '2': return 2;\n case '3': return 3;\n case '4': return 4;\n case '5': return 5;\n case '6': return 6;\n case '7': return 7;\n case '8': return 8;\n case '9': return 9;\n case 'a': case 'A': return 10;\n case 'b': case 'B': return 11;\n case 'c': case 'C': return 12;\n case 'd': case 'D': return 13;\n case 'e': case 'E': return 14;\n case 'f': case 'F': return 15;\n default: return 0;\n }\n}\n\n/* Split a line into arguments, where every argument can be in the\n * following programming-language REPL-alike form:\n *\n * foo bar \"newline are supported\\n\" and \"\\xff\\x00otherstuff\"\n *\n * The number of arguments is stored into *argc, and an array\n * of sds is returned.\n *\n * The caller should free the resulting array of sds strings with\n * sdsfreesplitres().\n *\n * Note that sdscatrepr() is able to convert back a string into\n * a quoted string in the same format sdssplitargs() is able to parse.\n *\n * The function returns the allocated tokens on success, even when the\n * input string is empty, or NULL if the input contains unbalanced\n * quotes or closed quotes followed by non space characters\n * as in: \"foo\"bar or \"foo'\n */\nsds *sdssplitargs(const char *line, int *argc) {\n const char *p = line;\n char *current = NULL;\n char **vector = NULL;\n\n *argc = 0;\n while(1) {\n /* skip blanks */\n while(*p && isspace(*p)) p++;\n if (*p) {\n /* get a token */\n int inq=0; /* set to 1 if we are in \"quotes\" */\n int insq=0; /* set to 1 if we are in 'single quotes' */\n int done=0;\n\n if (current == NULL) current = sdsempty();\n while(!done) {\n if (inq) {\n if (*p == '\\\\' && *(p+1) == 'x' &&\n is_hex_digit(*(p+2)) &&\n is_hex_digit(*(p+3)))\n {\n unsigned char byte;\n\n byte = (hex_digit_to_int(*(p+2))*16)+\n hex_digit_to_int(*(p+3));\n current = sdscatlen(current,(char*)&byte,1);\n p += 3;\n } else if (*p == '\\\\' && *(p+1)) {\n char c;\n\n p++;\n switch(*p) {\n case 'n': c = '\\n'; break;\n case 'r': c = '\\r'; break;\n case 't': c = '\\t'; break;\n case 'b': c = '\\b'; break;\n case 'a': c = '\\a'; break;\n default: c = *p; break;\n }\n current = sdscatlen(current,&c,1);\n } else if (*p == '\"') {\n /* closing quote must be followed by a space or\n * nothing at all. */\n if (*(p+1) && !isspace(*(p+1))) goto err;\n done=1;\n } else if (!*p) {\n /* unterminated quotes */\n goto err;\n } else {\n current = sdscatlen(current,p,1);\n }\n } else if (insq) {\n if (*p == '\\\\' && *(p+1) == '\\'') {\n p++;\n current = sdscatlen(current,\"'\",1);\n } else if (*p == '\\'') {\n /* closing quote must be followed by a space or\n * nothing at all. */\n if (*(p+1) && !isspace(*(p+1))) goto err;\n done=1;\n } else if (!*p) {\n /* unterminated quotes */\n goto err;\n } else {\n current = sdscatlen(current,p,1);\n }\n } else {\n switch(*p) {\n case ' ':\n case '\\n':\n case '\\r':\n case '\\t':\n case '\\0':\n done=1;\n break;\n case '\"':\n inq=1;\n break;\n case '\\'':\n insq=1;\n break;\n default:\n current = sdscatlen(current,p,1);\n break;\n }\n }\n if (*p) p++;\n }\n /* add the token to the vector */\n vector = realloc(vector,((*argc)+1)*sizeof(char*));\n vector[*argc] = current;\n (*argc)++;\n current = NULL;\n } else {\n /* Even on empty input string return something not NULL. */\n if (vector == NULL) vector = malloc(sizeof(void*));\n return vector;\n }\n }\n\nerr:\n while((*argc)--)\n sdsfree(vector[*argc]);\n free(vector);\n if (current) sdsfree(current);\n *argc = 0;\n return NULL;\n}\n\n/* Modify the string substituting all the occurrences of the set of\n * characters specified in the 'from' string to the corresponding character\n * in the 'to' array.\n *\n * For instance: sdsmapchars(mystring, \"ho\", \"01\", 2)\n * will have the effect of turning the string \"hello\" into \"0ell1\".\n *\n * The function returns the sds string pointer, that is always the same\n * as the input pointer since no resize is needed. */\nsds sdsmapchars(sds s, const char *from, const char *to, size_t setlen) {\n size_t j, i, l = sdslen(s);\n\n for (j = 0; j < l; j++) {\n for (i = 0; i < setlen; i++) {\n if (s[j] == from[i]) {\n s[j] = to[i];\n break;\n }\n }\n }\n return s;\n}\n\n/* Join an array of C strings using the specified separator (also a C string).\n * Returns the result as an sds string. */\nsds sdsjoin(char **argv, int argc, char *sep, size_t seplen) {\n sds join = sdsempty();\n int j;\n\n for (j = 0; j < argc; j++) {\n join = sdscat(join, argv[j]);\n if (j != argc-1) join = sdscatlen(join,sep,seplen);\n }\n return join;\n}\n\n/* Like sdsjoin, but joins an array of SDS strings. */\nsds sdsjoinsds(sds *argv, int argc, const char *sep, size_t seplen) {\n sds join = sdsempty();\n int j;\n\n for (j = 0; j < argc; j++) {\n join = sdscatsds(join, argv[j]);\n if (j != argc-1) join = sdscatlen(join,sep,seplen);\n }\n return join;\n}\n\n#ifdef SDS_TEST_MAIN\n#include \n#include \"testhelp.h\"\n\nint main(void) {\n {\n struct sdshdr *sh;\n sds x = sdsnew(\"foo\"), y;\n\n test_cond(\"Create a string and obtain the length\",\n sdslen(x) == 3 && memcmp(x,\"foo\\0\",4) == 0)\n\n sdsfree(x);\n x = sdsnewlen(\"foo\",2);\n test_cond(\"Create a string with specified length\",\n sdslen(x) == 2 && memcmp(x,\"fo\\0\",3) == 0)\n\n x = sdscat(x,\"bar\");\n test_cond(\"Strings concatenation\",\n sdslen(x) == 5 && memcmp(x,\"fobar\\0\",6) == 0);\n\n x = sdscpy(x,\"a\");\n test_cond(\"sdscpy() against an originally longer string\",\n sdslen(x) == 1 && memcmp(x,\"a\\0\",2) == 0)\n\n x = sdscpy(x,\"xyzxxxxxxxxxxyyyyyyyyyykkkkkkkkkk\");\n test_cond(\"sdscpy() against an originally shorter string\",\n sdslen(x) == 33 &&\n memcmp(x,\"xyzxxxxxxxxxxyyyyyyyyyykkkkkkkkkk\\0\",33) == 0)\n\n sdsfree(x);\n x = sdscatprintf(sdsempty(),\"%d\",123);\n test_cond(\"sdscatprintf() seems working in the base case\",\n sdslen(x) == 3 && memcmp(x,\"123\\0\",4) ==0)\n\n sdsfree(x);\n x = sdsnew(\"xxciaoyyy\");\n sdstrim(x,\"xy\");\n test_cond(\"sdstrim() correctly trims characters\",\n sdslen(x) == 4 && memcmp(x,\"ciao\\0\",5) == 0)\n\n y = sdsdup(x);\n sdsrange(y,1,1);\n test_cond(\"sdsrange(...,1,1)\",\n sdslen(y) == 1 && memcmp(y,\"i\\0\",2) == 0)\n\n sdsfree(y);\n y = sdsdup(x);\n sdsrange(y,1,-1);\n test_cond(\"sdsrange(...,1,-1)\",\n sdslen(y) == 3 && memcmp(y,\"iao\\0\",4) == 0)\n\n sdsfree(y);\n y = sdsdup(x);\n sdsrange(y,-2,-1);\n test_cond(\"sdsrange(...,-2,-1)\",\n sdslen(y) == 2 && memcmp(y,\"ao\\0\",3) == 0)\n\n sdsfree(y);\n y = sdsdup(x);\n sdsrange(y,2,1);\n test_cond(\"sdsrange(...,2,1)\",\n sdslen(y) == 0 && memcmp(y,\"\\0\",1) == 0)\n\n sdsfree(y);\n y = sdsdup(x);\n sdsrange(y,1,100);\n test_cond(\"sdsrange(...,1,100)\",\n sdslen(y) == 3 && memcmp(y,\"iao\\0\",4) == 0)\n\n sdsfree(y);\n y = sdsdup(x);\n sdsrange(y,100,100);\n test_cond(\"sdsrange(...,100,100)\",\n sdslen(y) == 0 && memcmp(y,\"\\0\",1) == 0)\n\n sdsfree(y);\n sdsfree(x);\n x = sdsnew(\"foo\");\n y = sdsnew(\"foa\");\n test_cond(\"sdscmp(foo,foa)\", sdscmp(x,y) > 0)\n\n sdsfree(y);\n sdsfree(x);\n x = sdsnew(\"bar\");\n y = sdsnew(\"bar\");\n test_cond(\"sdscmp(bar,bar)\", sdscmp(x,y) == 0)\n\n sdsfree(y);\n sdsfree(x);\n x = sdsnew(\"aar\");\n y = sdsnew(\"bar\");\n test_cond(\"sdscmp(bar,bar)\", sdscmp(x,y) < 0)\n\n sdsfree(y);\n sdsfree(x);\n x = sdsnewlen(\"\\a\\n\\0foo\\r\",7);\n y = sdscatrepr(sdsempty(),x,sdslen(x));\n test_cond(\"sdscatrepr(...data...)\",\n memcmp(y,\"\\\"\\\\a\\\\n\\\\x00foo\\\\r\\\"\",15) == 0)\n\n {\n int oldfree;\n\n sdsfree(x);\n x = sdsnew(\"0\");\n sh = (void*) (x-(sizeof(struct sdshdr)));\n test_cond(\"sdsnew() free/len buffers\", sh->len == 1 && sh->free == 0);\n x = sdsMakeRoomFor(x,1);\n sh = (void*) (x-(sizeof(struct sdshdr)));\n test_cond(\"sdsMakeRoomFor()\", sh->len == 1 && sh->free > 0);\n oldfree = sh->free;\n x[1] = '1';\n sdsIncrLen(x,1);\n test_cond(\"sdsIncrLen() -- content\", x[0] == '0' && x[1] == '1');\n test_cond(\"sdsIncrLen() -- len\", sh->len == 2);\n test_cond(\"sdsIncrLen() -- free\", sh->free == oldfree-1);\n }\n }\n test_report()\n return 0;\n}\n#endif\n" }, { "path": "dep/himemcached-0.1.0/himcdep/sds.h", "content": "/* SDS (Simple Dynamic Strings), A C dynamic strings library.\n *\n * Copyright (c) 2006-2014, Salvatore Sanfilippo \n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * * Neither the name of Redis nor the names of its contributors may be used\n * to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n#ifndef __SDS_H\n#define __SDS_H\n\n#define SDS_MAX_PREALLOC (1024*1024)\n\n#include \n#include \n#ifdef _MSC_VER\n#include \"win32.h\"\n#endif\n\ntypedef char *sds;\n\nstruct sdshdr {\n int len;\n int free;\n char buf[];\n};\n\nstatic inline size_t sdslen(const sds s) {\n struct sdshdr *sh = (struct sdshdr *)(s-sizeof *sh);\n return sh->len;\n}\n\nstatic inline size_t sdsavail(const sds s) {\n struct sdshdr *sh = (struct sdshdr *)(s-sizeof *sh);\n return sh->free;\n}\n\nsds sdsnewlen(const void *init, size_t initlen);\nsds sdsnew(const char *init);\nsds sdsempty(void);\nsize_t sdslen(const sds s);\nsds sdsdup(const sds s);\nvoid sdsfree(sds s);\nsize_t sdsavail(const sds s);\nsds sdsgrowzero(sds s, size_t len);\nsds sdscatlen(sds s, const void *t, size_t len);\nsds sdscat(sds s, const char *t);\nsds sdscatsds(sds s, const sds t);\nsds sdscpylen(sds s, const char *t, size_t len);\nsds sdscpy(sds s, const char *t);\n\nsds sdscatvprintf(sds s, const char *fmt, va_list ap);\n#ifdef __GNUC__\nsds sdscatprintf(sds s, const char *fmt, ...)\n __attribute__((format(printf, 2, 3)));\n#else\nsds sdscatprintf(sds s, const char *fmt, ...);\n#endif\n\nsds sdscatfmt(sds s, char const *fmt, ...);\nvoid sdstrim(sds s, const char *cset);\nvoid sdsrange(sds s, int start, int end);\nvoid sdsupdatelen(sds s);\nvoid sdsclear(sds s);\nint sdscmp(const sds s1, const sds s2);\nsds *sdssplitlen(const char *s, int len, const char *sep, int seplen, int *count);\nvoid sdsfreesplitres(sds *tokens, int count);\nvoid sdstolower(sds s);\nvoid sdstoupper(sds s);\nsds sdsfromlonglong(long long value);\nsds sdscatrepr(sds s, const char *p, size_t len);\nsds *sdssplitargs(const char *line, int *argc);\nsds sdsmapchars(sds s, const char *from, const char *to, size_t setlen);\nsds sdsjoin(char **argv, int argc, char *sep, size_t seplen);\nsds sdsjoinsds(sds *argv, int argc, const char *sep, size_t seplen);\n\n/* Low level functions exposed to the user API */\nsds sdsMakeRoomFor(sds s, size_t addlen);\nvoid sdsIncrLen(sds s, int incr);\nsds sdsRemoveFreeSpace(sds s);\nsize_t sdsAllocSize(sds s);\n\n#endif\n" }, { "path": "dep/himemcached-0.1.0/himcread.c", "content": "#include \n#include \n#ifndef _MSC_VER\n#include \n#endif\n#include \n#include \n#include \n\n#include \"himcread.h\"\n#include \"himcdep/sds.h\"\n\n#define PARSE_OK 0 /* Parsing ok */\n#define PARSE_ERROR 1 /* Parsing error */\n#define PARSE_AGAIN 3 /* Incomplete -> parse again */\n\n#define RSP_TYPE_UNKNOWN 0\n#define RSP_TYPE_NUM 1\n#define RSP_TYPE_STORED 2\n#define RSP_TYPE_NOT_STORED 3\n#define RSP_TYPE_EXISTS 4\n#define RSP_TYPE_NOT_FOUND 5\n#define RSP_TYPE_END 6\n#define RSP_TYPE_VALUE 7\n#define RSP_TYPE_DELETED 8\n#define RSP_TYPE_ERROR 9\n#define RSP_TYPE_CLIENT_ERROR 10\n#define RSP_TYPE_SERVER_ERROR 11\n\nstatic void memcachedReaderReset(mcReader *r);\n\nstatic void __memcachedReaderSetError(mcReader *r, int type, const char *str) {\n size_t len;\n\n memcachedReaderReset(r);\n\n /* Clear input buffer on errors. */\n if (r->buf != NULL) {\n sdsfree(r->buf);\n r->buf = NULL;\n r->pos = r->len = 0;\n }\n\n /* Set error. */\n r->err = type;\n len = strlen(str);\n len = len < (sizeof(r->errstr)-1) ? len : (sizeof(r->errstr)-1);\n memcpy(r->errstr,str,len);\n r->errstr[len] = '\\0';\n}\n\nstatic size_t chrtos(char *buf, size_t size, char byte) \n{\n size_t len = 0;\n\n switch(byte) {\n case '\\\\':\n case '\"':\n len = snprintf(buf,size,\"\\\"\\\\%c\\\"\",byte);\n break;\n case '\\n': len = snprintf(buf,size,\"\\\"\\\\n\\\"\"); break;\n case '\\r': len = snprintf(buf,size,\"\\\"\\\\r\\\"\"); break;\n case '\\t': len = snprintf(buf,size,\"\\\"\\\\t\\\"\"); break;\n case '\\a': len = snprintf(buf,size,\"\\\"\\\\a\\\"\"); break;\n case '\\b': len = snprintf(buf,size,\"\\\"\\\\b\\\"\"); break;\n default:\n if (isprint(byte))\n len = snprintf(buf,size,\"\\\"%c\\\"\",byte);\n else\n len = snprintf(buf,size,\"\\\"\\\\x%02x\\\"\",(unsigned char)byte);\n break;\n }\n\n return len;\n}\n\nstatic void __memcachedReaderSetErrorProtocolByte(mcReader *r, char byte) {\n char cbuf[8], sbuf[128];\n\n chrtos(cbuf,sizeof(cbuf),byte);\n snprintf(sbuf,sizeof(sbuf),\n \"Protocol error, got %s as reply type byte\", cbuf);\n __memcachedReaderSetError(r,MC_ERR_PROTOCOL,sbuf);\n}\n\nstatic void __memcachedReaderSetErrorOOM(mcReader *r) {\n __memcachedReaderSetError(r,MC_ERR_OOM,\"Out of memory\");\n}\n\nstatic int elementArrayCreate(mcReader *r)\n{\n assert(r->alloc_len == 0);\n assert(r->element == NULL);\n assert(r->elements == 0);\n\n r->element = malloc(10*sizeof(void*));\n if (r->element == NULL) {\n __memcachedReaderSetErrorOOM(r);\n return MC_ERR;\n }\n r->alloc_len = 10;\n r->elements = 0;\n \n return MC_OK;\n}\n\nstatic void elementArrayDestroy(mcReader *r)\n{\n unsigned int i;\n\n if (r->element == NULL)\n return;\n\n if (r->fn && r->fn->freeObject) {\n for (i = 0; i < r->elements; i ++) {\n if (r->element[i])\n r->fn->freeObject(r->element[i]);\n }\n }\n free(r->element);\n r->element = NULL;\n r->elements = 0;\n r->alloc_len = 0;\n \n return MC_OK;\n}\n\n#define EXPAND_MAX_SIZE_PER_TIME 300\nstatic int elementArrayExpand(mcReader *r) \n{\n size_t new_length;\n if (r->alloc_len <= 150) {\n new_length = r->alloc_len*2;\n } else if (r->alloc_len <= 500) {\n new_length = r->alloc_len+EXPAND_MAX_SIZE_PER_TIME;\n }\n r->element = realloc(r->element,new_length*sizeof(void*));\n if (r->element == NULL) {\n __memcachedReaderSetErrorOOM(r);\n return MC_ERR;\n }\n r->alloc_len = new_length;\n\n return MC_OK;\n}\n\nstatic int elementArrayAdd(mcReader *r, void *reply)\n{\n assert(r->elements <= r->alloc_len);\n if (r->elements == r->alloc_len) {\n if (elementArrayExpand(r) != MC_OK)\n return MC_ERR;\n }\n r->element[r->elements++] = reply;\n\n return MC_OK;\n}\n\nstatic void memcachedParseResponse(mcReader *r)\n{\n void *obj;\n char *p, *m;\n char ch;\n enum {\n SW_START,\n SW_RSP_NUM,\n SW_RSP_STR,\n SW_SPACES_BEFORE_KEY,\n SW_KEY,\n SW_SPACES_BEFORE_FLAGS, /* 5 */\n SW_FLAGS,\n SW_SPACES_BEFORE_VLEN,\n SW_VLEN,\n SW_RUNTO_VAL,\n SW_VAL, /* 10 */\n SW_VAL_LF,\n SW_END,\n SW_RUNTO_CRLF,\n SW_CRLF,\n SW_ALMOST_DONE, /* 15 */\n SW_SENTINEL\n } state;\n\n state = r->state;\n\n assert(state >= SW_START && state < SW_SENTINEL);\n\n /* validate the parsing marker */\n assert(r->buf != NULL);\n assert(r->pos < r->len);\n\n for (p = r->buf+r->pos; p <= r->buf+r->len; p++) {\n ch = *p;\n\n switch (state) {\n case SW_START:\n if (isdigit(ch)) {\n state = SW_RSP_NUM;\n } else {\n state = SW_RSP_STR;\n }\n p = p - 1; /* go back by 1 byte */\n\n break;\n\n case SW_RSP_NUM:\n if (r->token == NULL) {\n /* rsp_start <- p; type_start <- p */\n r->token = p;\n }\n\n if (isdigit(ch)) {\n /* num <- num * 10 + (ch - '0') */\n r->integer = r->integer*10 + (long long)(ch-'0');\n } else if (ch == ' ' || ch == '\\r') {\n /* type_end <- p - 1 */\n r->token = NULL;\n r->integer = 0;\n r->type = RSP_TYPE_NUM;\n p = p - 1; /* go back by 1 byte */\n state = SW_CRLF;\n } else {\n goto error;\n }\n\n break;\n\n case SW_RSP_STR:\n if (r->token == NULL) {\n /* rsp_start <- p; type_start <- p */\n r->token = p;\n }\n\n if (ch == ' ' || ch == '\\r') {\n /* type_end <- p - 1 */\n m = r->token;\n /* r->token = NULL; */\n r->type = RSP_TYPE_UNKNOWN;\n assert(r->str == NULL && r->strlen == 0);\n \n switch (p - m) {\n case 3:\n if (!strncmp(m,\"END\\r\",4)) {\n r->type = RSP_TYPE_END;\n /* end_start <- m; end_end <- p - 1 */\n }\n\n break;\n\n case 5:\n if (!strncmp(m,\"VALUE\",5)) {\n /*\n * Encompasses responses for 'get', 'gets' and\n * 'cas' command.\n */\n r->type = RSP_TYPE_VALUE;\n break;\n }\n\n if (!strncmp(m,\"ERROR\",5)) {\n r->type = RSP_TYPE_ERROR;\n break;\n }\n\n break;\n\n case 6:\n if (!strncmp(m,\"STORED\",6)) {\n r->type = RSP_TYPE_STORED;\n\n r->str = m;\n r->strlen = 6;\n break;\n }\n\n if (!strncmp(m,\"EXISTS\",6)) {\n r->type = RSP_TYPE_EXISTS;\n\n r->str = m;\n r->strlen = 6;\n break;\n }\n\n break;\n\n case 7:\n if (!strncmp(m,\"DELETED\",7)) {\n r->type = RSP_TYPE_DELETED;\n \n r->str = m;\n r->strlen = 7;\n break;\n }\n\n break;\n\n case 9:\n if (!strncmp(m,\"NOT_FOUND\",9)) {\n r->type = RSP_TYPE_NOT_FOUND;\n\n r->str = m;\n r->strlen = 9;\n break;\n }\n\n break;\n\n case 10:\n if (!strncmp(m,\"NOT_STORED\",10)) {\n r->type = RSP_TYPE_NOT_STORED;\n\n r->str = m;\n r->strlen = 10;\n break;\n }\n\n break;\n\n case 12:\n if (!strncmp(m,\"CLIENT_ERROR\",12)) {\n r->type = RSP_TYPE_CLIENT_ERROR;\n break;\n }\n\n if (!strncmp(m,\"SERVER_ERROR\",12)) {\n r->type = RSP_TYPE_SERVER_ERROR;\n break;\n }\n\n break;\n }\n\n switch (r->type) {\n case RSP_TYPE_UNKNOWN:\n goto error;\n\n case RSP_TYPE_STORED:\n case RSP_TYPE_NOT_STORED:\n case RSP_TYPE_EXISTS:\n case RSP_TYPE_NOT_FOUND:\n case RSP_TYPE_DELETED:\n state = SW_CRLF;\n break;\n\n case RSP_TYPE_END:\n state = SW_CRLF;\n break;\n\n case RSP_TYPE_VALUE:\n state = SW_SPACES_BEFORE_KEY;\n break;\n\n case RSP_TYPE_ERROR:\n state = SW_CRLF;\n break;\n\n case RSP_TYPE_CLIENT_ERROR:\n case RSP_TYPE_SERVER_ERROR:\n r->token = NULL;\n state = SW_RUNTO_CRLF;\n break;\n\n default:\n NOT_REACHED();\n }\n\n p = p - 1; /* go back by 1 byte */\n }\n\n break;\n\n case SW_SPACES_BEFORE_KEY:\n if (ch != ' ') {\n state = SW_KEY;\n p = p - 1; /* go back by 1 byte */\n r->token = NULL;\n }\n\n break;\n\n case SW_KEY:\n if (r->token == NULL) {\n r->token = p;\n }\n \n if (ch == ' ') {\n assert(r->str == NULL && r->strlen == 0);\n m = r->token;\n r->token = NULL;\n state = SW_SPACES_BEFORE_FLAGS;\n r->strlen = p-m;\n r->str = m;\n }\n\n break;\n\n case SW_SPACES_BEFORE_FLAGS:\n if (ch != ' ') {\n if (!isdigit(ch)) {\n goto error;\n }\n state = SW_FLAGS;\n p = p - 1; /* go back by 1 byte */\n r->kflags = 0;\n }\n\n break;\n\n case SW_FLAGS:\n if (isdigit(ch)) {\n /* flags <- flags * 10 + (ch - '0') */\n r->kflags = r->kflags*10 + (int)(ch-'0');\n } else if (ch == ' ') {\n /* flags_end <- p - 1 */\n /* r->token = NULL; */\n state = SW_SPACES_BEFORE_VLEN;\n } else {\n goto error;\n }\n\n break;\n\n case SW_SPACES_BEFORE_VLEN:\n if (ch != ' ') {\n if (!isdigit(ch)) {\n goto error;\n }\n p = p - 1; /* go back by 1 byte */\n state = SW_VLEN;\n r->integer = 0;\n }\n\n break;\n\n case SW_VLEN:\n if (isdigit(ch)) {\n r->integer = r->integer*10 + (long long)(ch-'0');\n } else if (ch == ' ' || ch == '\\r') {\n /* vlen_end <- p - 1 */\n p = p - 1; /* go back by 1 byte */\n /* r->token = NULL; */\n state = SW_RUNTO_CRLF;\n } else {\n goto error;\n }\n\n break;\n\n case SW_RUNTO_VAL:\n switch (ch) {\n case '\\n':\n /* val_start <- p + 1 */\n state = SW_VAL;\n r->token = NULL;\n break;\n\n default:\n goto error;\n }\n\n break;\n\n case SW_VAL:\n if (r->token == NULL) {\n /* flags_start <- p */\n r->token = p;\n }\n\n m = r->token + r->integer;\n if (m > r->buf+r->len) {\n p = r->buf + r->len;\n break;\n }\n \n switch (*m) {\n case '\\r':\n /* val_end <- p - 1 */\n p = m; /* move forward by vlen bytes */\n state = SW_VAL_LF;\n break;\n\n default:\n goto error;\n }\n\n break;\n\n case SW_VAL_LF:\n switch (ch) {\n case '\\n':\n /* state = SW_END; */\n if (r->fn && r->fn->createString)\n obj = r->fn->createString(MC_REPLY_STRING,r->str,r->strlen,\n r->token,r->integer,r->kflags,r->kversion);\n else\n obj = (void*)MC_REPLY_STRING;\n if (r->element) {\n assert(r->subreply == NULL);\n elementArrayAdd(r,r->subreply);\n } else if (r->subreply) {\n elementArrayCreate(r);\n elementArrayAdd(r,r->subreply);\n r->subreply = NULL;\n elementArrayAdd(r,obj);\n } else {\n r->subreply = obj;\n }\n \n r->token = NULL;\n r->str = NULL;\n r->strlen = 0;\n r->kflags = 0;\n r->kversion = -1;\n state = SW_RSP_STR;\n break;\n\n default:\n goto error;\n }\n\n break;\n\n case SW_END:\n if (r->token == NULL) {\n if (ch != 'E') {\n goto error;\n }\n /* end_start <- p */\n r->token = p;\n } else if (ch == '\\r') {\n /* end_end <- p */\n m = r->token;\n r->token = NULL;\n\n switch (p - m) {\n case 3:\n if (!strncmp(m,\"END\\r\",4)) {\n state = SW_ALMOST_DONE;\n }\n break;\n\n default:\n goto error;\n }\n }\n\n break;\n\n case SW_RUNTO_CRLF:\n switch (ch) {\n case '\\r':\n if (r->type == RSP_TYPE_VALUE) {\n state = SW_RUNTO_VAL;\n } else {\n if (r->type == RSP_TYPE_CLIENT_ERROR || \n r->type == RSP_TYPE_SERVER_ERROR) {\n m = r->token;\n r->token = NULL;\n r->strlen = p-m;\n r->str = m;\n }\n state = SW_ALMOST_DONE;\n }\n\n break;\n\n default:\n break;\n }\n\n break;\n\n case SW_CRLF:\n switch (ch) {\n case ' ':\n break;\n\n case '\\r':\n state = SW_ALMOST_DONE;\n break;\n\n default:\n goto error;\n }\n\n break;\n\n case SW_ALMOST_DONE:\n switch (ch) {\n case '\\n':\n /* rsp_end <- p */\n goto done;\n\n default:\n goto error;\n }\n\n break;\n\n case SW_SENTINEL:\n default:\n NOT_REACHED();\n break;\n\n }\n }\n\n assert(p == r->buf+r->len);\n r->pos = r->len;\n r->state = state;\n \n r->result = PARSE_AGAIN;\n\n return;\n\ndone:\n r->pos = p-r->buf+1;\n assert(r->pos <= r->len);\n r->state = SW_START;\n r->token = NULL;\n r->result = PARSE_OK;\n\n return;\n\nerror:\n r->result = PARSE_ERROR;\n r->state = state;\n errno = EINVAL;\n}\n\nmcReader *memcachedReaderCreateWithFunctions(mcReplyObjectFunctions *fn) \n{\n mcReader *r;\n\n r = calloc(sizeof(mcReader),1);\n if (r == NULL)\n return NULL;\n\n r->err = 0;\n r->errstr[0] = '\\0';\n r->buf = sdsempty();\n r->maxbuf = MC_READER_MAX_BUF;\n if (r->buf == NULL) {\n free(r);\n return NULL;\n }\n\n r->subreply = NULL;\n r->alloc_len = 0;\n r->elements = 0;\n r->element = NULL;\n\n r->state = 0;\n r->token = NULL;\n\n r->str = NULL;\n r->strlen = 0;\n r->kflags = 0;\n r->kversion = -1;\n r->integer = 0;\n r->type = RSP_TYPE_UNKNOWN;\n r->result = PARSE_OK;\n\n r->fn = fn;\n \n return r;\n}\n\nvoid memcachedReaderFree(mcReader *r) \n{\n memcachedReaderReset(r);\n \n if (r->buf != NULL)\n sdsfree(r->buf);\n free(r);\n}\n\nint memcachedReaderFeed(mcReader *r, const char *buf, size_t len) \n{\n sds newbuf;\n\n /* Return early when this reader is in an erroneous state. */\n if (r->err)\n return MC_ERR;\n\n /* Copy the provided buffer. */\n if (buf != NULL && len >= 1) {\n /* Destroy internal buffer when it is empty and is quite large. */\n if (r->len == 0 && r->maxbuf != 0 && sdsavail(r->buf) > r->maxbuf) {\n sdsfree(r->buf);\n r->buf = sdsempty();\n r->pos = 0;\n\n /* r->buf should not be NULL since we just free'd a larger one. */\n assert(r->buf != NULL);\n }\n\n newbuf = sdscatlen(r->buf,buf,len);\n if (newbuf == NULL) {\n __memcachedReaderSetErrorOOM(r);\n return MC_ERR;\n }\n\n r->buf = newbuf;\n r->len = sdslen(r->buf);\n }\n\n return MC_OK;\n}\n\nstatic void memcachedReaderReset(mcReader *r) \n{\n r->str = NULL;\n r->strlen = 0;\n r->kflags = 0;\n r->kversion = -1;\n\n r->state = 0;\n r->token = 0;\n \n r->integer = 0;\n\n r->type = RSP_TYPE_UNKNOWN;\n r->result = PARSE_OK;\n \n if (r->subreply != NULL) {\n if (r->fn && r->fn->freeObject)\n r->fn->freeObject(r->subreply);\n \n r->subreply = NULL;\n }\n\n elementArrayDestroy(r);\n\n r->err = 0;\n r->errstr[0] = '\\0';\n}\n\nstatic void *getReplyFromReader(mcReader *r)\n{\n void *reply;\n\n switch (r->type) {\n case RSP_TYPE_VALUE:\n if (r->element) {\n assert(r->subreply == NULL);\n if (r->fn && r->fn->createArray) {\n reply = r->fn->createArray(r->elements,r->element);\n r->element = NULL;\n r->elements = 0;\n r->alloc_len = 0;\n } else {\n reply = (void*)MC_REPLY_ARRAY;\n }\n } else if (r->subreply) {\n reply = r->subreply;\n }\n break;\n case RSP_TYPE_NUM:\n if (r->fn && r->fn->createInteger)\n reply = r->fn->createInteger(r->integer);\n else\n reply = (void*)MC_REPLY_INTEGER;\n break;\n case RSP_TYPE_END:\n if (r->fn && r->fn->createNil)\n reply = r->fn->createNil();\n else\n reply = (void*)MC_REPLY_NIL;\n break;\n case RSP_TYPE_CLIENT_ERROR:\n case RSP_TYPE_SERVER_ERROR:\n if (r->fn && r->fn->createString)\n reply = r->fn->createString(MC_REPLY_ERROR,\n NULL,0,r->str,r->strlen,0,0);\n else\n reply = (void*)MC_REPLY_ERROR;\n break;\n case RSP_TYPE_ERROR:\n if (r->fn && r->fn->createString)\n reply = r->fn->createString(MC_REPLY_ERROR,\n NULL,0,\"\",0,0,0);\n else\n reply = (void*)MC_REPLY_ERROR;\n break;\n case RSP_TYPE_STORED:\n case RSP_TYPE_NOT_STORED:\n case RSP_TYPE_EXISTS:\n case RSP_TYPE_NOT_FOUND:\n case RSP_TYPE_DELETED:\n if (r->fn && r->fn->createString)\n reply = r->fn->createString(MC_REPLY_STATUS,\n NULL,0,r->str,r->strlen,0,0);\n else\n reply = (void*)MC_REPLY_STATUS;\n break;\n default:\n reply = NULL;\n break;\n }\n \n return reply;\n}\n\nint memcachedReaderGetReply(mcReader *r, void **reply) {\n /* Default target pointer to NULL. */\n if (reply != NULL)\n *reply = NULL;\n\n /* Return early when this reader is in an erroneous state. */\n if (r->err)\n return MC_ERR;\n\n /* When the buffer is empty, there will never be a reply. */\n if (r->len == 0)\n return MC_OK;\n\n memcachedParseResponse(r);\n\n /* Return ASAP when an error occurred. */\n if (r->err)\n return MC_ERR;\n\n /*\n printf(\"!######### r->result: %d, r->state: %d, r->type: %d, r->pos: %d, r->len: %d,\" \n \"r->kflags: %d, r->kversion : %lld, r->strlen: %zu, r->integer: %lld r->buf: %s, r->str: %s\\n\", \n r->result, r->state, r->type, r->pos, r->len, r->kflags, r->kversion, \n r->strlen, r->integer, r->buf, r->str);\n */\n /* Emit a reply when there is one. */\n if (r->result == PARSE_OK) {\n if (reply != NULL) {\n *reply = getReplyFromReader(r);\n }\n memcachedReaderReset(r);\n }\n\n /* Discard part of the buffer when we've consumed at least 1k, to avoid\n * doing unnecessary calls to memmove() in sds.c. */\n if (r->pos >= 1024 && r->token == NULL && r->str == NULL) {\n sdsrange(r->buf,r->pos,-1);\n r->pos = 0;\n r->len = sdslen(r->buf);\n }\n\n return MC_OK;\n}\n" }, { "path": "dep/himemcached-0.1.0/himcread.h", "content": "#ifndef _HIMC_READ_H_\n#define _HIMC_READ_H_\n#include /* for size_t */\n\n#include \n\n#define MC_ERR -1\n#define MC_OK 0\n\n/* When an error occurs, the err flag in a context is set to hold the type of\n * error that occured. REDIS_ERR_IO means there was an I/O error and you\n * should use the \"errno\" variable to find out what is wrong.\n * For other values, the \"errstr\" field will hold a description. */\n#define MC_ERR_IO 1 /* Error in read or write */\n#define MC_ERR_EOF 3 /* End of file */\n#define MC_ERR_PROTOCOL 4 /* Protocol error */\n#define MC_ERR_OOM 5 /* Out of memory */\n#define MC_ERR_OTHER 2 /* Everything else... */\n\n#define MC_REPLY_STRING 1\n#define MC_REPLY_ARRAY 2\n#define MC_REPLY_INTEGER 3\n#define MC_REPLY_NIL 4\n#define MC_REPLY_STATUS 5\n#define MC_REPLY_ERROR 6\n\n#define MC_READER_MAX_BUF (1024*16) /* Default max unused reader buffer. */\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\ntypedef struct mcReplyObjectFunctions {\n void *(*createString)(int, char*, size_t, char*, size_t, int, long long);\n void *(*createArray)(size_t, void **);\n void *(*createInteger)(long long);\n void *(*createNil)(void);\n void (*freeObject)(void*);\n} mcReplyObjectFunctions;\n\ntypedef struct mcReader {\n int err; /* Error flags, 0 when there is no error */\n char errstr[128]; /* String representation of error when applicable */\n\n char *buf; /* Read buffer */\n size_t pos; /* Buffer cursor */\n size_t len; /* Buffer length */\n size_t maxbuf; /* Max length of unused buffer */\n\n void *subreply; /* Temporary reply for array type */\n size_t alloc_len; /* Temporary reply array alloc length */\n size_t elements; /* Temporary reply array length */\n void **element; /* Temporary reply array */\n\n char *str;\n size_t strlen;\n int kflags; /* Used for key flags (get/gets command reply) */\n long long kversion; /* Used for key version (gets command reply) */\n\n int state; /* Current parser state */\n char *token; /* Token marker */\n\n long long integer; /* Cache the integer if need */\n\n int type; /* Response type */\n int result; /* Parsing result */\n\n mcReplyObjectFunctions *fn;\n void *privdata;\n} mcReader;\n\n/* Public API for the protocol parser. */\nmcReader *memcachedReaderCreateWithFunctions(mcReplyObjectFunctions *fn);\nvoid memcachedReaderFree(mcReader *r);\nint memcachedReaderFeed(mcReader *r, const char *buf, size_t len);\nint memcachedReaderGetReply(mcReader *r, void **reply);\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n" }, { "path": "dep/himemcached-0.1.0/himemcached.c", "content": "#include \n#include \n#include \n\n#include \"himemcached.h\"\n\n#define REQ_TYPE_UNKNOWN 0\n#define REQ_TYPE_STORAGE 1\n#define REQ_TYPE_CAS 2\n#define REQ_TYPE_RETRIEVAL 3\n#define REQ_TYPE_ARITHMETIC 4\n#define REQ_TYPE_DELETE 5\n\nstatic mcReply *createReplyObject(int type);\nstatic void *createStringObject(int type, char *key, size_t keylen, char *str, size_t len, int flags, long long version);\nstatic void *createArrayObject(size_t elements, void **element);\nstatic void *createIntegerObject(long long value);\nstatic void *createNilObject(void);\n\n/* Default set of functions to build the reply. Keep in mind that such a\n * function returning NULL is interpreted as OOM. */\nstatic mcReplyObjectFunctions defaultFunctions = {\n createStringObject,\n createArrayObject,\n createIntegerObject,\n createNilObject,\n freeMcReplyObject\n};\n\n/* Create a reply object */\nstatic mcReply *createReplyObject(int type) {\n mcReply *r = calloc(1,sizeof(*r));\n\n if (r == NULL)\n return NULL;\n\n r->type = type;\n \n return r;\n}\n\n/* Free a reply object */\nvoid freeMcReplyObject(void *reply) {\n mcReply *r = reply;\n size_t j;\n\n if (r == NULL)\n return;\n\n switch(r->type) {\n case MC_REPLY_INTEGER:\n case MC_REPLY_NIL:\n break; /* Nothing to free */\n case MC_REPLY_ARRAY:\n if (r->element != NULL) {\n for (j = 0; j < r->elements; j++)\n if (r->element[j] != NULL)\n freeMcReplyObject(r->element[j]);\n free(r->element);\n }\n break;\n case MC_REPLY_ERROR:\n case MC_REPLY_STATUS:\n case MC_REPLY_STRING:\n if (r->key != NULL)\n free(r->key);\n if (r->str != NULL)\n free(r->str);\n break;\n default:\n assert(0);\n break;\n }\n free(r);\n}\n\nstatic void *createStringObject(int type, char *key, size_t keylen, char *str, size_t len, int flags, long long version) {\n mcReply *r, *parent;\n char *buf;\n\n assert(type == MC_REPLY_ERROR ||\n type == MC_REPLY_STATUS ||\n type == MC_REPLY_STRING);\n\n r = createReplyObject(type);\n if (r == NULL)\n return NULL;\n\n if (key != NULL) {\n r->key = malloc(keylen+1);\n if (r->key == NULL) {\n freeMcReplyObject(r);\n return NULL;\n }\n if (keylen > 0)\n /* Copy string value */\n memcpy(r->key,key,keylen);\n r->key[keylen] = '\\0';\n r->keylen = keylen;\n }\n\n buf = malloc(len+1);\n if (buf == NULL) {\n freeMcReplyObject(r);\n return NULL;\n }\n if (len > 0)\n /* Copy string value */\n memcpy(buf,str,len);\n buf[len] = '\\0';\n r->str = buf;\n r->len = len;\n\n r->flags = flags;\n r->version = version;\n \n return r;\n}\n\nstatic void *createArrayObject(size_t elements, void **element) {\n mcReply *r;\n\n r = createReplyObject(MC_REPLY_ARRAY);\n if (r == NULL)\n return NULL;\n\n r->elements = elements;\n r->element = (mcReply **)element;\n\n return r;\n}\n\nstatic void *createIntegerObject(long long value) {\n mcReply *r;\n\n r = createReplyObject(MC_REPLY_INTEGER);\n if (r == NULL)\n return NULL;\n\n r->integer = value;\n \n return r;\n}\n\nstatic void *createNilObject(void) {\n mcReply *r;\n\n r = createReplyObject(MC_REPLY_NIL);\n if (r == NULL)\n return NULL;\n\n return r;\n}\n\nvoid __memcachedSetError(mcContext *c, int type, const char *str) {\n size_t len;\n\n c->err = type;\n if (str != NULL) {\n len = strlen(str);\n len = len < (sizeof(c->errstr)-1) ? len : (sizeof(c->errstr)-1);\n memcpy(c->errstr,str,len);\n c->errstr[len] = '\\0';\n } else {\n /* Only REDIS_ERR_IO may lack a description! */\n assert(type == MC_ERR_IO);\n //__redis_strerror_r(errno, c->errstr, sizeof(c->errstr));\n }\n}\n\n\n/* Write the output buffer to the socket.\n *\n * Returns MC_OK when the buffer is empty, or (a part of) the buffer was\n * succesfully written to the socket. When the buffer is empty after the\n * write operation, \"done\" is set to 1 (if given).\n *\n * Returns MC_ERR if an error occured trying to write and sets\n * c->errstr to hold the appropriate error string.\n */\nint memcachedBufferWrite(mcContext *c, int *done) {\n int nwritten;\n\n /* Return early when the context has seen an error. */\n if (c->err)\n return MC_ERR;\n\n if (sdslen(c->obuf) > 0) {\n nwritten = write(c->fd,c->obuf,sdslen(c->obuf));\n if (nwritten == -1) {\n if ((errno == EAGAIN && !(c->flags & MC_BLOCK)) || (errno == EINTR)) {\n /* Try again later */\n } else {\n __memcachedSetError(c,MC_ERR_IO,NULL);\n return MC_ERR;\n }\n } else if (nwritten > 0) {\n if (nwritten == (signed)sdslen(c->obuf)) {\n sdsfree(c->obuf);\n c->obuf = sdsempty();\n } else {\n sdsrange(c->obuf,nwritten,-1);\n }\n }\n }\n if (done != NULL) *done = (sdslen(c->obuf) == 0);\n return MC_OK;\n}\n\n/* Internal helper function to try and get a reply from the reader,\n * or set an error in the context otherwise. */\nint memcachedGetReplyFromReader(mcContext *c, void **reply) {\n if (memcachedReaderGetReply(c->reader,reply) == MC_ERR) {\n __memcachedSetError(c,c->reader->err,c->reader->errstr);\n return MC_ERR;\n }\n return MC_OK;\n}\n\nint memcachedGetReply(mcContext *c, void **reply) {\n int wdone = 0;\n void *aux = NULL;\n\n /* Try to read pending replies */\n if (memcachedGetReplyFromReader(c,&aux) == MC_ERR)\n return MC_ERR;\n\n /* For the blocking context, flush output buffer and read reply */\n if (aux == NULL && c->flags & MC_BLOCK) {\n /* Write until done */\n do {\n if (memcachedBufferWrite(c,&wdone) == MC_ERR)\n return MC_ERR;\n } while (!wdone);\n\n /* Read until there is a reply */\n do {\n if (memcachedBufferRead(c) == MC_ERR)\n return MC_ERR;\n if (memcachedGetReplyFromReader(c,&aux) == MC_ERR)\n return MC_ERR;\n } while (aux == NULL);\n }\n\n /* Set reply object */\n if (reply != NULL) *reply = aux;\n return MC_OK;\n}\n\nmcReader *memcachedReaderCreate(void) {\n return memcachedReaderCreateWithFunctions(&defaultFunctions);\n}\n\nmcContext *memcachedContextInit(void) {\n mcContext *c;\n\n c = calloc(1,sizeof(mcContext));\n if (c == NULL)\n return NULL;\n\n c->err = 0;\n c->errstr[0] = '\\0';\n c->obuf = sdsempty();\n c->reader = memcachedReaderCreate();\n c->tcp.host = NULL;\n c->tcp.source_addr = NULL;\n c->unix_sock.path = NULL;\n c->timeout = NULL;\n\n if (c->obuf == NULL || c->reader == NULL) {\n memcachedFree(c);\n return NULL;\n }\n\n return c;\n}\n\nvoid memcachedFree(mcContext *c) {\n if (c == NULL)\n return;\n if (c->fd > 0)\n close(c->fd);\n if (c->obuf != NULL)\n sdsfree(c->obuf);\n if (c->reader != NULL)\n memcachedReaderFree(c->reader);\n if (c->tcp.host)\n free(c->tcp.host);\n if (c->tcp.source_addr)\n free(c->tcp.source_addr);\n if (c->unix_sock.path)\n free(c->unix_sock.path);\n if (c->timeout)\n free(c->timeout);\n free(c);\n}\n\n/* Use this function to handle a read event on the descriptor. It will try\n * and read some bytes from the socket and feed them to the reply parser.\n *\n * After this function is called, you may use memcachedContextReadReply to\n * see if there is a reply available. */\nint memcachedBufferRead(mcContext *c) {\n char buf[1024*16];\n int nread;\n\n /* Return early when the context has seen an error. */\n if (c->err)\n return MC_ERR;\n\n nread = read(c->fd,buf,sizeof(buf));\n if (nread == -1) {\n if ((errno == EAGAIN && !(c->flags & MC_BLOCK)) || (errno == EINTR)) {\n /* Try again later */\n } else {\n __memcachedSetError(c,MC_ERR_IO,NULL);\n return MC_ERR;\n }\n } else if (nread == 0) {\n __memcachedSetError(c,MC_ERR_EOF,\"Server closed the connection\");\n return MC_ERR;\n } else {\n if (memcachedReaderFeed(c->reader,buf,nread) != MC_OK) {\n __memcachedSetError(c,c->reader->err,c->reader->errstr);\n return MC_ERR;\n }\n }\n return MC_OK;\n}\n\nstatic int getRequestTypeFromString(char *str, size_t len)\n{\n if (str == NULL || len == 0)\n return -1;\n\n if (len == 3) {\n if (!strncasecmp(str,\"set\",3) || \n !strncasecmp(str,\"add\",3)) {\n return REQ_TYPE_STORAGE;\n } else if (!strncasecmp(str,\"cas\",3)) {\n return REQ_TYPE_CAS;\n } else if (!strncasecmp(str,\"get\",3)) {\n return REQ_TYPE_RETRIEVAL;\n } else {\n return -1;\n }\n } else if (len == 4) {\n if (!strncasecmp(str,\"gets\",4)) {\n return REQ_TYPE_RETRIEVAL;\n } else if (!strncasecmp(str,\"incr\",4) || \n !strncasecmp(str,\"decr\",4)) {\n return REQ_TYPE_ARITHMETIC;\n } else {\n return -1;\n }\n } else if (len == 6) {\n if (!strncasecmp(str,\"append\",6)) {\n return REQ_TYPE_STORAGE;\n } else if (!strncasecmp(str,\"delete\",6)) {\n return REQ_TYPE_DELETE;\n } else {\n return -1;\n }\n } else if (len == 7) {\n if (!strncasecmp(str,\"replace\",7) || \n !strncasecmp(str,\"prepend\",7)) {\n return REQ_TYPE_STORAGE;\n } else {\n return -1;\n }\n }\n\n return -1;\n}\n\n#define ARGUMENTLEN(_argtype,_argv,_argvlen,_idx) \\\n (_argtype==0?sdslen(_argv[_idx]):(_argvlen==NULL?strlen(_argv[_idx]):_argvlen[_idx]))\n\n/* argtype==0 : argv is sds array \n * argtype==1 : argv is c-string array and an array with their lengths. \n * If the length array is set to NULL, strlen will be used to compute the\n * argument lengths.\n */\nstatic int checkCmdValidAndGetTotalLen(int cmdtype, int argtype, int argc, char **argv, size_t *argvlen)\n{\n size_t len;\n int totlen, j;\n \n switch (cmdtype) {\n case REQ_TYPE_STORAGE:\n if (argc != 6 && argc != 7) {\n return -1;\n }\n if (argc == 7 && (ARGUMENTLEN(argtype,argv,argvlen,5) != 7 || \n strncasecmp(argv[5],\"noreply\",7))) {\n return -1;\n }\n\n totlen = 0;\n for (j = 0; j < argc-1; j ++) {\n totlen += ARGUMENTLEN(argtype,argv,argvlen,j) + 1;\n }\n totlen += 2 + ARGUMENTLEN(argtype,argv,argvlen,argc-1) + 2;\n break;\n case REQ_TYPE_CAS:\n if (argc != 7 && argc != 8) {\n return -1;\n }\n if (argc == 8 && (ARGUMENTLEN(argtype,argv,argvlen,6) != 7 || \n strncasecmp(argv[6],\"noreply\",7))) {\n return -1;\n }\n\n totlen = 0;\n for (j = 0; j < argc-1; j ++) {\n totlen += ARGUMENTLEN(argtype,argv,argvlen,j) + 1;\n }\n totlen += 2 + ARGUMENTLEN(argtype,argv,argvlen,argc-1) + 2;\n break;\n case REQ_TYPE_ARITHMETIC:\n if (argc != 3) {\n return -1;\n }\n totlen = ARGUMENTLEN(argtype,argv,argvlen,0) + 1 + \n ARGUMENTLEN(argtype,argv,argvlen,1) + 1 + \n ARGUMENTLEN(argtype,argv,argvlen,2) + 2;\n break;\n case REQ_TYPE_RETRIEVAL:\n if (argc <= 1) {\n return -1;\n }\n\n totlen = 0;\n for (j = 0; j < argc-1; j ++) {\n totlen += ARGUMENTLEN(argtype,argv,argvlen,j) + 1;\n }\n totlen += ARGUMENTLEN(argtype,argv,argvlen,argc-1) + 2;\n break;\n case REQ_TYPE_DELETE:\n if (argc != 2 && argc != 3) {\n return -1;\n }\n \n totlen = ARGUMENTLEN(argtype,argv,argvlen,0) + 1 + \n ARGUMENTLEN(argtype,argv,argvlen,1);\n if (argc == 3) {\n if (strncasecmp(argv[2],\"noreply\",7)) {\n return -1;\n }\n totlen += 1 + ARGUMENTLEN(argtype,argv,argvlen,2);\n }\n totlen += 2;\n break;\n default:\n totlen = -1;\n break;\n }\n\n return totlen;\n}\n\n/* Like the checkCmdValidAndGetTotalLen() function */\nstatic int genericMemcachedCommand(int cmdtype, char *cmd, int argtype, int argc, char **argv, size_t *argvlen)\n{\n int j;\n size_t len;\n int pos = 0; /* position in final command */\n \n switch (cmdtype) {\n case REQ_TYPE_STORAGE:\n case REQ_TYPE_CAS:\n for (j = 0; j < argc-1; j ++) {\n len = ARGUMENTLEN(argtype,argv,argvlen,j);\n memcpy(cmd+pos,argv[j],len);\n pos += (int)len;\n cmd[pos++] = ' ';\n }\n cmd[pos++] = '\\r';\n cmd[pos++] = '\\n';\n len = ARGUMENTLEN(argtype,argv,argvlen,argc-1);\n memcpy(cmd+pos,argv[argc-1],len);\n pos += (int)len;\n cmd[pos++] = '\\r';\n cmd[pos++] = '\\n';\n break;\n case REQ_TYPE_ARITHMETIC:\n case REQ_TYPE_RETRIEVAL:\n case REQ_TYPE_DELETE:\n for (j = 0; j < argc-1; j ++) {\n len = ARGUMENTLEN(argtype,argv,argvlen,j);\n memcpy(cmd+pos,argv[j],len);\n pos += len;\n cmd[pos++] = ' ';\n }\n len = ARGUMENTLEN(argtype,argv,argvlen,argc-1);\n memcpy(cmd+pos,argv[argc-1],len);\n pos += (int)len;\n cmd[pos++] = '\\r';\n cmd[pos++] = '\\n';\n break;\n default:\n pos = -1;\n break;\n }\n\n return pos;\n}\n\n/* Format a command according to the Memcached protocol. This function\n * takes the number of arguments, an array with arguments and an sds array. \n */\nint memcachedFormatCommandSdsArgv(char **target, int argc, const sds *argv) {\n char *cmd = NULL; /* final command */\n int pos; /* position in final command */\n int totlen;\n int type;\n\n /* Abort on a NULL target */\n if (target == NULL || argc < 1)\n return -1;\n\n type = getRequestTypeFromString(argv[0], sdslen(argv[0]));\n if (type < 0)\n goto format_err;\n\n totlen = checkCmdValidAndGetTotalLen(type, 0, argc, argv, NULL);\n if (totlen < 0) {\n goto format_err;\n }\n\n /* Build the command at protocol level */\n cmd = malloc(totlen+1);\n if (cmd == NULL) goto memory_err;\n\n pos = genericMemcachedCommand(type, cmd, 0, argc, argv, NULL);\n if (pos < 0) goto format_err;\n \n assert(pos == totlen);\n cmd[pos] = '\\0';\n\n *target = cmd;\n return totlen;\n\nformat_err:\n if (cmd) free(cmd);\n return -2;\n\nmemory_err:\n return -1;\n}\n\nint memcachedvFormatCommand(char **target, const char *format, va_list ap)\n{\n const char *c = format;\n char *cmd = NULL; /* final command */\n int pos; /* position in final command */\n sds curarg, newarg; /* current argument */\n int touched = 0; /* was the current argument touched? */\n char **curargv = NULL, **newargv = NULL;\n int argc = 0;\n int totlen;\n int error_type = 0; /* 0 = no error; -1 = memory error; -2 = format error */\n int j;\n\n /* Abort if there is not target to set */\n if (target == NULL)\n return -1;\n\n /* Build the command string accordingly to protocol */\n curarg = sdsempty();\n if (curarg == NULL)\n return -1;\n\n while(*c != '\\0') {\n if (*c != '%' || c[1] == '\\0') {\n if (*c == ' ') {\n if (touched) {\n newargv = realloc(curargv,sizeof(char*)*(argc+1));\n if (newargv == NULL) goto memory_err;\n curargv = newargv;\n curargv[argc++] = curarg;\n\n /* curarg is put in argv so it can be overwritten. */\n curarg = sdsempty();\n if (curarg == NULL) goto memory_err;\n touched = 0;\n }\n } else {\n newarg = sdscatlen(curarg,c,1);\n if (newarg == NULL) goto memory_err;\n curarg = newarg;\n touched = 1;\n }\n } else {\n char *arg;\n size_t size;\n\n /* Set newarg so it can be checked even if it is not touched. */\n newarg = curarg;\n\n switch(c[1]) {\n case 's':\n arg = va_arg(ap,char*);\n size = strlen(arg);\n if (size > 0)\n newarg = sdscatlen(curarg,arg,size);\n break;\n case 'b':\n arg = va_arg(ap,char*);\n size = va_arg(ap,size_t);\n if (size > 0)\n newarg = sdscatlen(curarg,arg,size);\n break;\n case '%':\n newarg = sdscat(curarg,\"%\");\n break;\n default:\n /* Try to detect printf format */\n {\n static const char intfmts[] = \"diouxX\";\n static const char flags[] = \"#0-+ \";\n char _format[16];\n const char *_p = c+1;\n size_t _l = 0;\n va_list _cpy;\n\n /* Flags */\n while (*_p != '\\0' && strchr(flags,*_p) != NULL) _p++;\n\n /* Field width */\n while (*_p != '\\0' && isdigit(*_p)) _p++;\n\n /* Precision */\n if (*_p == '.') {\n _p++;\n while (*_p != '\\0' && isdigit(*_p)) _p++;\n }\n\n /* Copy va_list before consuming with va_arg */\n va_copy(_cpy,ap);\n\n /* Integer conversion (without modifiers) */\n if (strchr(intfmts,*_p) != NULL) {\n va_arg(ap,int);\n goto fmt_valid;\n }\n\n /* Double conversion (without modifiers) */\n if (strchr(\"eEfFgGaA\",*_p) != NULL) {\n va_arg(ap,double);\n goto fmt_valid;\n }\n\n /* Size: char */\n if (_p[0] == 'h' && _p[1] == 'h') {\n _p += 2;\n if (*_p != '\\0' && strchr(intfmts,*_p) != NULL) {\n va_arg(ap,int); /* char gets promoted to int */\n goto fmt_valid;\n }\n goto fmt_invalid;\n }\n\n /* Size: short */\n if (_p[0] == 'h') {\n _p += 1;\n if (*_p != '\\0' && strchr(intfmts,*_p) != NULL) {\n va_arg(ap,int); /* short gets promoted to int */\n goto fmt_valid;\n }\n goto fmt_invalid;\n }\n\n /* Size: long long */\n if (_p[0] == 'l' && _p[1] == 'l') {\n _p += 2;\n if (*_p != '\\0' && strchr(intfmts,*_p) != NULL) {\n va_arg(ap,long long);\n goto fmt_valid;\n }\n goto fmt_invalid;\n }\n\n /* Size: long */\n if (_p[0] == 'l') {\n _p += 1;\n if (*_p != '\\0' && strchr(intfmts,*_p) != NULL) {\n va_arg(ap,long);\n goto fmt_valid;\n }\n goto fmt_invalid;\n }\n\n fmt_invalid:\n va_end(_cpy);\n goto format_err;\n\n fmt_valid:\n _l = (_p+1)-c;\n if (_l < sizeof(_format)-2) {\n memcpy(_format,c,_l);\n _format[_l] = '\\0';\n newarg = sdscatvprintf(curarg,_format,_cpy);\n\n /* Update current position (note: outer blocks\n * increment c twice so compensate here) */\n c = _p-1;\n }\n\n va_end(_cpy);\n break;\n }\n }\n\n if (newarg == NULL) goto memory_err;\n curarg = newarg;\n\n touched = 1;\n c++;\n }\n c++;\n }\n\n /* Add the last argument if needed */\n if (touched) {\n newargv = realloc(curargv,sizeof(char*)*(argc+1));\n if (newargv == NULL) goto memory_err;\n curargv = newargv;\n curargv[argc++] = curarg;\n } else {\n sdsfree(curarg);\n }\n\n /* Clear curarg because it was put in curargv or was free'd. */\n curarg = NULL;\n\n totlen = memcachedFormatCommandSdsArgv(&cmd, argc,curargv);\n if (totlen < 0) {\n error_type = totlen;\n goto cleanup;\n }\n\n free(curargv);\n *target = cmd;\n return totlen;\n\nformat_err:\n error_type = -2;\n goto cleanup;\n\nmemory_err:\n error_type = -1;\n goto cleanup;\n\ncleanup:\n if (curargv) {\n while(argc--)\n sdsfree(curargv[argc]);\n free(curargv);\n }\n\n sdsfree(curarg);\n\n /* No need to check cmd since it is the last statement that can fail,\n * but do it anyway to be as defensive as possible. */\n if (cmd != NULL)\n free(cmd);\n\n return error_type;\n}\n\n/* Format a command according to the Memcached protocol. This function\n * takes a format similar to printf:\n *\n * %s represents a C null terminated string you want to interpolate\n * %b represents a binary safe string\n *\n * When using %b you need to provide both the pointer to the string\n * and the length in bytes as a size_t. Examples:\n *\n * len = memcachedFormatCommand(target, \"GET %s\", mykey);\n * len = memcachedFormatCommand(target, \"SET %s %d, %lld %zu %s\", mykey, myflags, myexptime, myvallen, myval);\n */\nint memcachedFormatCommand(char **target, const char *format, ...) {\n va_list ap;\n int len;\n va_start(ap,format);\n len = memcachedvFormatCommand(target,format,ap);\n va_end(ap);\n\n /* The API says \"-1\" means bad result, but we now also return \"-2\" in some\n * cases. Force the return value to always be -1. */\n if (len < 0)\n len = -1;\n\n return len;\n}\n\n/* Format a command according to the Redis protocol. This function takes the\n * number of arguments, an array with arguments and an array with their\n * lengths. If the latter is set to NULL, strlen will be used to compute the\n * argument lengths.\n */\nint memcachedFormatCommandArgv(char **target, int argc, const char **argv, const size_t *argvlen) {\n char *cmd = NULL; /* final command */\n int pos; /* position in final command */\n int totlen;\n int type;\n\n /* Abort on a NULL target */\n if (target == NULL || argc < 1)\n return -1;\n\n type = getRequestTypeFromString(argv[0], argvlen==NULL?strlen(argv[0]):argvlen[0]);\n if (type < 0) {\n goto format_err;\n }\n\n totlen = checkCmdValidAndGetTotalLen(type, 1, argc, argv, argvlen);\n if (totlen < 0) {\n goto format_err;\n }\n\n /* Build the command at protocol level */\n cmd = malloc(totlen+1);\n if (cmd == NULL) goto memory_err;\n\n pos = genericMemcachedCommand(type, cmd, 1, argc, argv, argvlen);\n if (pos < 0) {\n goto format_err;\n }\n \n assert(pos == totlen);\n cmd[pos] = '\\0';\n\n *target = cmd;\n return totlen;\n\nformat_err:\n if (cmd) free(cmd);\n return -2;\n\nmemory_err:\n return -1;\n}\n\n" }, { "path": "dep/himemcached-0.1.0/himemcached.h", "content": "#ifndef _HIMEMCACHED_H_\n#define _HIMEMCACHED_H_\n\n#include \"himcread.h\"\n#include \"himcdep/sds.h\"\n\n#define HIMC_MAJOR 0\n#define HIMC_MINOR 13\n#define HIMC_PATCH 1\n\n/* Connection type can be blocking or non-blocking and is set in the\n * least significant bit of the flags field in redisContext. */\n#define MC_BLOCK 0x1\n\n/* Connection may be disconnected before being free'd. The second bit\n * in the flags field is set when the context is connected. */\n#define MC_CONNECTED 0x2\n\n/* The async API might try to disconnect cleanly and flush the output\n * buffer and read all subsequent replies before disconnecting.\n * This flag means no new commands can come in and the connection\n * should be terminated once all replies have been read. */\n#define MC_DISCONNECTING 0x4\n\n/* Flag specific to the async API which means that the context should be clean\n * up as soon as possible. */\n#define MC_FREEING 0x8\n\n/* Flag that is set when an async callback is executed. */\n#define MC_IN_CALLBACK 0x10\n\n/* Flag that is set when the async context has one or more subscriptions. */\n#define MC_SUBSCRIBED 0x20\n\n/* Flag that is set when monitor mode is active */\n#define MC_MONITORING 0x40\n\n/* Flag that is set when we should set SO_REUSEADDR before calling bind() */\n#define MC_REUSEADDR 0x80\n\n#define MC_KEEPALIVE_INTERVAL 15 /* seconds */\n\n/* number of times we retry to connect in the case of EADDRNOTAVAIL and\n * SO_REUSEADDR is being used. */\n#define MC_CONNECT_RETRIES 10\n\n/* This is the reply object returned by memcachedCommand() */\ntypedef struct mcReply {\n int type; /* MC_REPLY_* */\n long long integer; /* The integer when type is MC_REPLY_INTEGER */\n int keylen; /* Length of key */\n char *key; /* Key string */\n int len; /* Length of string */\n char *str; /* Used for both REDIS_REPLY_ERROR and MC_REPLY_STRING */\n int flags;\n long long version;\n size_t elements; /* number of elements, for MC_REPLY_ARRAY */\n struct mcReply **element; /* elements vector for MC_REPLY_ARRAY */\n} mcReply;\n\nmcReader *memcachedReaderCreate(void);\n\n/* Function to free the reply objects hiredis returns by default. */\nvoid freeMcReplyObject(void *reply);\n\nenum mcConnectionType {\n MC_CONN_TCP,\n MC_CONN_UNIX,\n};\n\n/* Context for a connection to Memcached */\ntypedef struct mcContext {\n int err; /* Error flags, 0 when there is no error */\n char errstr[128]; /* String representation of error when applicable */\n int fd;\n int flags;\n char *obuf; /* Write buffer */\n mcReader *reader; /* Protocol reader */\n\n enum mcConnectionType connection_type;\n struct timeval *timeout;\n\n struct {\n char *host;\n char *source_addr;\n int port;\n } tcp;\n\n struct {\n char *path;\n } unix_sock;\n} mcContext;\n\nint memcachedBufferWrite(mcContext *c, int *done);\nint memcachedBufferRead(mcContext *c);\n\nint memcachedGetReplyFromReader(mcContext *c, void **reply);\nint memcachedGetReply(mcContext *c, void **reply);\n\nmcContext *memcachedContextInit(void);\nvoid memcachedFree(mcContext *c) ;\n\nint memcachedFormatCommandSdsArgv(char **target, int argc, const sds *argv);\nint memcachedvFormatCommand(char **target, const char *format, va_list ap);\nint memcachedFormatCommand(char **target, const char *format, ...);\nint memcachedFormatCommandArgv(char **target, int argc, const char **argv, const size_t *argvlen);\n\n#endif /* _HIMEMCACHED_H_ */\n" }, { "path": "dep/hiredis-0.13.3/.gitignore", "content": "\n" }, { "path": "dep/jemalloc-4.2.0/.gitignore", "content": "\n" }, { "path": "dep/sds/Makefile.am", "content": "MAINTAINERCLEANFILES = Makefile.in\n\nAM_CPPFLAGS =\nif !OS_SOLARIS\nAM_CPPFLAGS += -D_GNU_SOURCE\nendif\nAM_CPPFLAGS += -I $(top_srcdir)/dep/util\nAM_CPPFLAGS += -I $(top_srcdir)/dep/jemalloc-4.2.0/include\nAM_CPPFLAGS += -I $(top_srcdir)/dep/dmalloc\n\nAM_CFLAGS = -Wall -Wshadow\nAM_CFLAGS += -Wno-unused-parameter -Wno-unused-value\n\nnoinst_LIBRARIES = libsds.a\n\nnoinst_HEADERS = sds.h sdsalloc.h\n\nlibsds_a_SOURCES = \\\n sdsalloc.h \\\n\tsds.c sds.h" }, { "path": "dep/sds/sds.c", "content": "/* SDSLib 2.0 -- A C dynamic strings library\n *\n * Copyright (c) 2006-2015, Salvatore Sanfilippo \n * Copyright (c) 2015, Oran Agra\n * Copyright (c) 2015, Redis Labs, Inc\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * * Neither the name of Redis nor the names of its contributors may be used\n * to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n\nstatic inline int sdsHdrSize(char type) {\n switch(type&SDS_TYPE_MASK) {\n case SDS_TYPE_5:\n return sizeof(struct sdshdr5);\n case SDS_TYPE_8:\n return sizeof(struct sdshdr8);\n case SDS_TYPE_16:\n return sizeof(struct sdshdr16);\n case SDS_TYPE_32:\n return sizeof(struct sdshdr32);\n case SDS_TYPE_64:\n return sizeof(struct sdshdr64);\n }\n return 0;\n}\n\nstatic inline char sdsReqType(size_t string_size) {\n if (string_size < 32)\n return SDS_TYPE_5;\n if (string_size < 0xff)\n return SDS_TYPE_8;\n if (string_size < 0xffff)\n return SDS_TYPE_16;\n if (string_size < 0xffffffff)\n return SDS_TYPE_32;\n return SDS_TYPE_64;\n}\n\n/* Create a new sds string with the content specified by the 'init' pointer\n * and 'initlen'.\n * If NULL is used for 'init' the string is initialized with zero bytes.\n *\n * The string is always null-termined (all the sds strings are, always) so\n * even if you create an sds string with:\n *\n * mystring = sdsnewlen(\"abc\",3);\n *\n * You can print the string with printf() as there is an implicit \\0 at the\n * end of the string. However the string is binary safe and can contain\n * \\0 characters in the middle, as the length is stored in the sds header. */\nsds sdsnewlen(const void *init, size_t initlen) {\n void *sh;\n sds s;\n char type = sdsReqType(initlen);\n /* Empty strings are usually created in order to append. Use type 8\n * since type 5 is not good at this. */\n if (type == SDS_TYPE_5 && initlen == 0) type = SDS_TYPE_8;\n int hdrlen = sdsHdrSize(type);\n unsigned char *fp; /* flags pointer. */\n\n sh = s_malloc(hdrlen+initlen+1);\n if (!init)\n memset(sh, 0, hdrlen+initlen+1);\n if (sh == NULL) return NULL;\n s = (char*)sh+hdrlen;\n fp = ((unsigned char*)s)-1;\n switch(type) {\n case SDS_TYPE_5: {\n *fp = type | (initlen << SDS_TYPE_BITS);\n break;\n }\n case SDS_TYPE_8: {\n SDS_HDR_VAR(8,s);\n sh->len = initlen;\n sh->alloc = initlen;\n *fp = type;\n break;\n }\n case SDS_TYPE_16: {\n SDS_HDR_VAR(16,s);\n sh->len = initlen;\n sh->alloc = initlen;\n *fp = type;\n break;\n }\n case SDS_TYPE_32: {\n SDS_HDR_VAR(32,s);\n sh->len = initlen;\n sh->alloc = initlen;\n *fp = type;\n break;\n }\n case SDS_TYPE_64: {\n SDS_HDR_VAR(64,s);\n sh->len = initlen;\n sh->alloc = initlen;\n *fp = type;\n break;\n }\n }\n if (initlen && init)\n memcpy(s, init, initlen);\n s[initlen] = '\\0';\n return s;\n}\n\n/* Create an empty (zero length) sds string. Even in this case the string\n * always has an implicit null term. */\nsds sdsempty(void) {\n return sdsnewlen(\"\",0);\n}\n\n/* Create a new sds string starting from a null terminated C string. */\nsds sdsnew(const char *init) {\n size_t initlen = (init == NULL) ? 0 : strlen(init);\n return sdsnewlen(init, initlen);\n}\n\n/* Duplicate an sds string. */\nsds sdsdup(const sds s) {\n return sdsnewlen(s, sdslen(s));\n}\n\n/* Free an sds string. No operation is performed if 's' is NULL. */\nvoid sdsfree(sds s) {\n if (s == NULL) return;\n s_free((char*)s-sdsHdrSize(s[-1]));\n}\n\n/* Set the sds string length to the length as obtained with strlen(), so\n * considering as content only up to the first null term character.\n *\n * This function is useful when the sds string is hacked manually in some\n * way, like in the following example:\n *\n * s = sdsnew(\"foobar\");\n * s[2] = '\\0';\n * sdsupdatelen(s);\n * printf(\"%d\\n\", sdslen(s));\n *\n * The output will be \"2\", but if we comment out the call to sdsupdatelen()\n * the output will be \"6\" as the string was modified but the logical length\n * remains 6 bytes. */\nvoid sdsupdatelen(sds s) {\n int reallen = strlen(s);\n sdssetlen(s, reallen);\n}\n\n/* Modify an sds string in-place to make it empty (zero length).\n * However all the existing buffer is not discarded but set as free space\n * so that next append operations will not require allocations up to the\n * number of bytes previously available. */\nvoid sdsclear(sds s) {\n sdssetlen(s, 0);\n s[0] = '\\0';\n}\n\n/* Enlarge the free space at the end of the sds string so that the caller\n * is sure that after calling this function can overwrite up to addlen\n * bytes after the end of the string, plus one more byte for nul term.\n *\n * Note: this does not change the *length* of the sds string as returned\n * by sdslen(), but only the free buffer space we have. */\nsds sdsMakeRoomFor(sds s, size_t addlen) {\n void *sh, *newsh;\n size_t avail = sdsavail(s);\n size_t len, newlen;\n char type, oldtype = s[-1] & SDS_TYPE_MASK;\n int hdrlen;\n\n /* Return ASAP if there is enough space left. */\n if (avail >= addlen) return s;\n\n len = sdslen(s);\n sh = (char*)s-sdsHdrSize(oldtype);\n newlen = (len+addlen);\n if (newlen < SDS_MAX_PREALLOC)\n newlen *= 2;\n else\n newlen += SDS_MAX_PREALLOC;\n\n type = sdsReqType(newlen);\n\n /* Don't use type 5: the user is appending to the string and type 5 is\n * not able to remember empty space, so sdsMakeRoomFor() must be called\n * at every appending operation. */\n if (type == SDS_TYPE_5) type = SDS_TYPE_8;\n\n hdrlen = sdsHdrSize(type);\n if (oldtype==type) {\n newsh = s_realloc(sh, hdrlen+newlen+1);\n if (newsh == NULL) return NULL;\n s = (char*)newsh+hdrlen;\n } else {\n /* Since the header size changes, need to move the string forward,\n * and can't use realloc */\n newsh = s_malloc(hdrlen+newlen+1);\n if (newsh == NULL) return NULL;\n memcpy((char*)newsh+hdrlen, s, len+1);\n s_free(sh);\n s = (char*)newsh+hdrlen;\n s[-1] = type;\n sdssetlen(s, len);\n }\n sdssetalloc(s, newlen);\n return s;\n}\n\n/* Reallocate the sds string so that it has no free space at the end. The\n * contained string remains not altered, but next concatenation operations\n * will require a reallocation.\n *\n * After the call, the passed sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call. */\nsds sdsRemoveFreeSpace(sds s) {\n void *sh, *newsh;\n char type, oldtype = s[-1] & SDS_TYPE_MASK;\n int hdrlen;\n size_t len = sdslen(s);\n sh = (char*)s-sdsHdrSize(oldtype);\n\n type = sdsReqType(len);\n hdrlen = sdsHdrSize(type);\n if (oldtype==type) {\n newsh = s_realloc(sh, hdrlen+len+1);\n if (newsh == NULL) return NULL;\n s = (char*)newsh+hdrlen;\n } else {\n newsh = s_malloc(hdrlen+len+1);\n if (newsh == NULL) return NULL;\n memcpy((char*)newsh+hdrlen, s, len+1);\n s_free(sh);\n s = (char*)newsh+hdrlen;\n s[-1] = type;\n sdssetlen(s, len);\n }\n sdssetalloc(s, len);\n return s;\n}\n\n/* Return the total size of the allocation of the specifed sds string,\n * including:\n * 1) The sds header before the pointer.\n * 2) The string.\n * 3) The free buffer at the end if any.\n * 4) The implicit null term.\n */\nsize_t sdsAllocSize(sds s) {\n size_t alloc = sdsalloc(s);\n return sdsHdrSize(s[-1])+alloc+1;\n}\n\n/* Return the pointer of the actual SDS allocation (normally SDS strings\n * are referenced by the start of the string buffer). */\nvoid *sdsAllocPtr(sds s) {\n return (void*) (s-sdsHdrSize(s[-1]));\n}\n\n/* Increment the sds length and decrements the left free space at the\n * end of the string according to 'incr'. Also set the null term\n * in the new end of the string.\n *\n * This function is used in order to fix the string length after the\n * user calls sdsMakeRoomFor(), writes something after the end of\n * the current string, and finally needs to set the new length.\n *\n * Note: it is possible to use a negative increment in order to\n * right-trim the string.\n *\n * Usage example:\n *\n * Using sdsIncrLen() and sdsMakeRoomFor() it is possible to mount the\n * following schema, to cat bytes coming from the kernel to the end of an\n * sds string without copying into an intermediate buffer:\n *\n * oldlen = sdslen(s);\n * s = sdsMakeRoomFor(s, BUFFER_SIZE);\n * nread = read(fd, s+oldlen, BUFFER_SIZE);\n * ... check for nread <= 0 and handle it ...\n * sdsIncrLen(s, nread);\n */\nvoid sdsIncrLen(sds s, int incr) {\n unsigned char flags = s[-1];\n size_t len;\n switch(flags&SDS_TYPE_MASK) {\n case SDS_TYPE_5: {\n unsigned char *fp = ((unsigned char*)s)-1;\n unsigned char oldlen = SDS_TYPE_5_LEN(flags);\n assert((incr > 0 && oldlen+incr < 32) || (incr < 0 && oldlen >= (unsigned int)(-incr)));\n *fp = SDS_TYPE_5 | ((oldlen+incr) << SDS_TYPE_BITS);\n len = oldlen+incr;\n break;\n }\n case SDS_TYPE_8: {\n SDS_HDR_VAR(8,s);\n assert((incr >= 0 && sh->alloc-sh->len >= incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));\n len = (sh->len += incr);\n break;\n }\n case SDS_TYPE_16: {\n SDS_HDR_VAR(16,s);\n assert((incr >= 0 && sh->alloc-sh->len >= incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));\n len = (sh->len += incr);\n break;\n }\n case SDS_TYPE_32: {\n SDS_HDR_VAR(32,s);\n assert((incr >= 0 && sh->alloc-sh->len >= (unsigned int)incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));\n len = (sh->len += incr);\n break;\n }\n case SDS_TYPE_64: {\n SDS_HDR_VAR(64,s);\n assert((incr >= 0 && sh->alloc-sh->len >= (uint64_t)incr) || (incr < 0 && sh->len >= (uint64_t)(-incr)));\n len = (sh->len += incr);\n break;\n }\n default: len = 0; /* Just to avoid compilation warnings. */\n }\n s[len] = '\\0';\n}\n\n/* Grow the sds to have the specified length. Bytes that were not part of\n * the original length of the sds will be set to zero.\n *\n * if the specified length is smaller than the current length, no operation\n * is performed. */\nsds sdsgrowzero(sds s, size_t len) {\n size_t curlen = sdslen(s);\n\n if (len <= curlen) return s;\n s = sdsMakeRoomFor(s,len-curlen);\n if (s == NULL) return NULL;\n\n /* Make sure added region doesn't contain garbage */\n memset(s+curlen,0,(len-curlen+1)); /* also set trailing \\0 byte */\n sdssetlen(s, len);\n return s;\n}\n\n/* Append the specified binary-safe string pointed by 't' of 'len' bytes to the\n * end of the specified sds string 's'.\n *\n * After the call, the passed sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call. */\nsds sdscatlen(sds s, const void *t, size_t len) {\n size_t curlen = sdslen(s);\n\n s = sdsMakeRoomFor(s,len);\n if (s == NULL) return NULL;\n memcpy(s+curlen, t, len);\n sdssetlen(s, curlen+len);\n s[curlen+len] = '\\0';\n return s;\n}\n\n/* Append the specified null termianted C string to the sds string 's'.\n *\n * After the call, the passed sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call. */\nsds sdscat(sds s, const char *t) {\n return sdscatlen(s, t, strlen(t));\n}\n\n/* Append the specified sds 't' to the existing sds 's'.\n *\n * After the call, the modified sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call. */\nsds sdscatsds(sds s, const sds t) {\n return sdscatlen(s, t, sdslen(t));\n}\n\n/* Destructively modify the sds string 's' to hold the specified binary\n * safe string pointed by 't' of length 'len' bytes. */\nsds sdscpylen(sds s, const char *t, size_t len) {\n if (sdsalloc(s) < len) {\n s = sdsMakeRoomFor(s,len-sdslen(s));\n if (s == NULL) return NULL;\n }\n memcpy(s, t, len);\n s[len] = '\\0';\n sdssetlen(s, len);\n return s;\n}\n\n/* Like sdscpylen() but 't' must be a null-termined string so that the length\n * of the string is obtained with strlen(). */\nsds sdscpy(sds s, const char *t) {\n return sdscpylen(s, t, strlen(t));\n}\n\n/* Helper for sdscatlonglong() doing the actual number -> string\n * conversion. 's' must point to a string with room for at least\n * SDS_LLSTR_SIZE bytes.\n *\n * The function returns the length of the null-terminated string\n * representation stored at 's'. */\n#define SDS_LLSTR_SIZE 21\nint sdsll2str(char *s, long long value) {\n char *p, aux;\n unsigned long long v;\n size_t l;\n\n /* Generate the string representation, this method produces\n * an reversed string. */\n v = (value < 0) ? -value : value;\n p = s;\n do {\n *p++ = '0'+(v%10);\n v /= 10;\n } while(v);\n if (value < 0) *p++ = '-';\n\n /* Compute length and add null term. */\n l = p-s;\n *p = '\\0';\n\n /* Reverse the string. */\n p--;\n while(s < p) {\n aux = *s;\n *s = *p;\n *p = aux;\n s++;\n p--;\n }\n return l;\n}\n\n/* Identical sdsll2str(), but for unsigned long long type. */\nint sdsull2str(char *s, unsigned long long v) {\n char *p, aux;\n size_t l;\n\n /* Generate the string representation, this method produces\n * an reversed string. */\n p = s;\n do {\n *p++ = '0'+(v%10);\n v /= 10;\n } while(v);\n\n /* Compute length and add null term. */\n l = p-s;\n *p = '\\0';\n\n /* Reverse the string. */\n p--;\n while(s < p) {\n aux = *s;\n *s = *p;\n *p = aux;\n s++;\n p--;\n }\n return l;\n}\n\n/* Create an sds string from a long long value. It is much faster than:\n *\n * sdscatprintf(sdsempty(),\"%lld\\n\", value);\n */\nsds sdsfromlonglong(long long value) {\n char buf[SDS_LLSTR_SIZE];\n int len = sdsll2str(buf,value);\n\n return sdsnewlen(buf,len);\n}\n\n/* Like sdscatprintf() but gets va_list instead of being variadic. */\nsds sdscatvprintf(sds s, const char *fmt, va_list ap) {\n va_list cpy;\n char staticbuf[1024], *buf = staticbuf, *t;\n size_t buflen = strlen(fmt)*2;\n\n /* We try to start using a static buffer for speed.\n * If not possible we revert to heap allocation. */\n if (buflen > sizeof(staticbuf)) {\n buf = s_malloc(buflen);\n if (buf == NULL) return NULL;\n } else {\n buflen = sizeof(staticbuf);\n }\n\n /* Try with buffers two times bigger every time we fail to\n * fit the string in the current buffer size. */\n while(1) {\n buf[buflen-2] = '\\0';\n va_copy(cpy,ap);\n vsnprintf(buf, buflen, fmt, cpy);\n va_end(cpy);\n if (buf[buflen-2] != '\\0') {\n if (buf != staticbuf) s_free(buf);\n buflen *= 2;\n buf = s_malloc(buflen);\n if (buf == NULL) return NULL;\n continue;\n }\n break;\n }\n\n /* Finally concat the obtained string to the SDS string and return it. */\n t = sdscat(s, buf);\n if (buf != staticbuf) s_free(buf);\n return t;\n}\n\n/* Append to the sds string 's' a string obtained using printf-alike format\n * specifier.\n *\n * After the call, the modified sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call.\n *\n * Example:\n *\n * s = sdsnew(\"Sum is: \");\n * s = sdscatprintf(s,\"%d+%d = %d\",a,b,a+b).\n *\n * Often you need to create a string from scratch with the printf-alike\n * format. When this is the need, just use sdsempty() as the target string:\n *\n * s = sdscatprintf(sdsempty(), \"... your format ...\", args);\n */\nsds sdscatprintf(sds s, const char *fmt, ...) {\n va_list ap;\n char *t;\n va_start(ap, fmt);\n t = sdscatvprintf(s,fmt,ap);\n va_end(ap);\n return t;\n}\n\n/* This function is similar to sdscatprintf, but much faster as it does\n * not rely on sprintf() family functions implemented by the libc that\n * are often very slow. Moreover directly handling the sds string as\n * new data is concatenated provides a performance improvement.\n *\n * However this function only handles an incompatible subset of printf-alike\n * format specifiers:\n *\n * %s - C String\n * %S - SDS string\n * %i - signed int\n * %I - 64 bit signed integer (long long, int64_t)\n * %u - unsigned int\n * %U - 64 bit unsigned integer (unsigned long long, uint64_t)\n * %% - Verbatim \"%\" character.\n */\nsds sdscatfmt(sds s, char const *fmt, ...) {\n size_t initlen = sdslen(s);\n const char *f = fmt;\n int i;\n va_list ap;\n\n va_start(ap,fmt);\n f = fmt; /* Next format specifier byte to process. */\n i = initlen; /* Position of the next byte to write to dest str. */\n while(*f) {\n char next, *str;\n size_t l;\n long long num;\n unsigned long long unum;\n\n /* Make sure there is always space for at least 1 char. */\n if (sdsavail(s)==0) {\n s = sdsMakeRoomFor(s,1);\n }\n\n switch(*f) {\n case '%':\n next = *(f+1);\n f++;\n switch(next) {\n case 's':\n case 'S':\n str = va_arg(ap,char*);\n l = (next == 's') ? strlen(str) : sdslen(str);\n if (sdsavail(s) < l) {\n s = sdsMakeRoomFor(s,l);\n }\n memcpy(s+i,str,l);\n sdsinclen(s,l);\n i += l;\n break;\n case 'i':\n case 'I':\n if (next == 'i')\n num = va_arg(ap,int);\n else\n num = va_arg(ap,long long);\n {\n char buf[SDS_LLSTR_SIZE];\n l = sdsll2str(buf,num);\n if (sdsavail(s) < l) {\n s = sdsMakeRoomFor(s,l);\n }\n memcpy(s+i,buf,l);\n sdsinclen(s,l);\n i += l;\n }\n break;\n case 'u':\n case 'U':\n if (next == 'u')\n unum = va_arg(ap,unsigned int);\n else\n unum = va_arg(ap,unsigned long long);\n {\n char buf[SDS_LLSTR_SIZE];\n l = sdsull2str(buf,unum);\n if (sdsavail(s) < l) {\n s = sdsMakeRoomFor(s,l);\n }\n memcpy(s+i,buf,l);\n sdsinclen(s,l);\n i += l;\n }\n break;\n default: /* Handle %% and generally %. */\n s[i++] = next;\n sdsinclen(s,1);\n break;\n }\n break;\n default:\n s[i++] = *f;\n sdsinclen(s,1);\n break;\n }\n f++;\n }\n va_end(ap);\n\n /* Add null-term */\n s[i] = '\\0';\n return s;\n}\n\n/* Remove the part of the string from left and from right composed just of\n * contiguous characters found in 'cset', that is a null terminted C string.\n *\n * After the call, the modified sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call.\n *\n * Example:\n *\n * s = sdsnew(\"AA...AA.a.aa.aHelloWorld :::\");\n * s = sdstrim(s,\"Aa. :\");\n * printf(\"%s\\n\", s);\n *\n * Output will be just \"Hello World\".\n */\nsds sdstrim(sds s, const char *cset) {\n char *start, *end, *sp, *ep;\n size_t len;\n\n sp = start = s;\n ep = end = s+sdslen(s)-1;\n while(sp <= end && strchr(cset, *sp)) sp++;\n while(ep > sp && strchr(cset, *ep)) ep--;\n len = (sp > ep) ? 0 : ((ep-sp)+1);\n if (s != sp) memmove(s, sp, len);\n s[len] = '\\0';\n sdssetlen(s,len);\n return s;\n}\n\n/* Turn the string into a smaller (or equal) string containing only the\n * substring specified by the 'start' and 'end' indexes.\n *\n * start and end can be negative, where -1 means the last character of the\n * string, -2 the penultimate character, and so forth.\n *\n * The interval is inclusive, so the start and end characters will be part\n * of the resulting string.\n *\n * The string is modified in-place.\n *\n * Example:\n *\n * s = sdsnew(\"Hello World\");\n * sdsrange(s,1,-1); => \"ello World\"\n */\nvoid sdsrange(sds s, int start, int end) {\n size_t newlen, len = sdslen(s);\n\n if (len == 0) return;\n if (start < 0) {\n start = len+start;\n if (start < 0) start = 0;\n }\n if (end < 0) {\n end = len+end;\n if (end < 0) end = 0;\n }\n newlen = (start > end) ? 0 : (end-start)+1;\n if (newlen != 0) {\n if (start >= (signed)len) {\n newlen = 0;\n } else if (end >= (signed)len) {\n end = len-1;\n newlen = (start > end) ? 0 : (end-start)+1;\n }\n } else {\n start = 0;\n }\n if (start && newlen) memmove(s, s+start, newlen);\n s[newlen] = 0;\n sdssetlen(s,newlen);\n}\n\n/* Apply tolower() to every character of the sds string 's'. */\nvoid sdstolower(sds s) {\n int len = sdslen(s), j;\n\n for (j = 0; j < len; j++) s[j] = tolower(s[j]);\n}\n\n/* Apply toupper() to every character of the sds string 's'. */\nvoid sdstoupper(sds s) {\n int len = sdslen(s), j;\n\n for (j = 0; j < len; j++) s[j] = toupper(s[j]);\n}\n\n/* Compare two sds strings s1 and s2 with memcmp().\n *\n * Return value:\n *\n * positive if s1 > s2.\n * negative if s1 < s2.\n * 0 if s1 and s2 are exactly the same binary string.\n *\n * If two strings share exactly the same prefix, but one of the two has\n * additional characters, the longer string is considered to be greater than\n * the smaller one. */\nint sdscmp(const sds s1, const sds s2) {\n size_t l1, l2, minlen;\n int cmp;\n\n l1 = sdslen(s1);\n l2 = sdslen(s2);\n minlen = (l1 < l2) ? l1 : l2;\n cmp = memcmp(s1,s2,minlen);\n if (cmp == 0) return l1-l2;\n return cmp;\n}\n\n/* Split 's' with separator in 'sep'. An array\n * of sds strings is returned. *count will be set\n * by reference to the number of tokens returned.\n *\n * On out of memory, zero length string, zero length\n * separator, NULL is returned.\n *\n * Note that 'sep' is able to split a string using\n * a multi-character separator. For example\n * sdssplit(\"foo_-_bar\",\"_-_\"); will return two\n * elements \"foo\" and \"bar\".\n *\n * This version of the function is binary-safe but\n * requires length arguments. sdssplit() is just the\n * same function but for zero-terminated strings.\n */\nsds *sdssplitlen(const char *s, int len, const char *sep, int seplen, int *count) {\n int elements = 0, slots = 5, start = 0, j;\n sds *tokens;\n\n if (seplen < 1 || len < 0) return NULL;\n\n tokens = s_malloc(sizeof(sds)*slots);\n if (tokens == NULL) return NULL;\n\n if (len == 0) {\n *count = 0;\n return tokens;\n }\n for (j = 0; j < (len-(seplen-1)); j++) {\n /* make sure there is room for the next element and the final one */\n if (slots < elements+2) {\n sds *newtokens;\n\n slots *= 2;\n newtokens = s_realloc(tokens,sizeof(sds)*slots);\n if (newtokens == NULL) goto cleanup;\n tokens = newtokens;\n }\n /* search the separator */\n if ((seplen == 1 && *(s+j) == sep[0]) || (memcmp(s+j,sep,seplen) == 0)) {\n tokens[elements] = sdsnewlen(s+start,j-start);\n if (tokens[elements] == NULL) goto cleanup;\n elements++;\n start = j+seplen;\n j = j+seplen-1; /* skip the separator */\n }\n }\n /* Add the final element. We are sure there is room in the tokens array. */\n tokens[elements] = sdsnewlen(s+start,len-start);\n if (tokens[elements] == NULL) goto cleanup;\n elements++;\n *count = elements;\n return tokens;\n\ncleanup:\n {\n int i;\n for (i = 0; i < elements; i++) sdsfree(tokens[i]);\n s_free(tokens);\n *count = 0;\n return NULL;\n }\n}\n\n/* Free the result returned by sdssplitlen(), or do nothing if 'tokens' is NULL. */\nvoid sdsfreesplitres(sds *tokens, int count) {\n if (!tokens) return;\n while(count--)\n sdsfree(tokens[count]);\n s_free(tokens);\n}\n\n/* Append to the sds string \"s\" an escaped string representation where\n * all the non-printable characters (tested with isprint()) are turned into\n * escapes in the form \"\\n\\r\\a....\" or \"\\x\".\n *\n * After the call, the modified sds string is no longer valid and all the\n * references must be substituted with the new pointer returned by the call. */\nsds sdscatrepr(sds s, const char *p, size_t len) {\n s = sdscatlen(s,\"\\\"\",1);\n while(len--) {\n switch(*p) {\n case '\\\\':\n case '\"':\n s = sdscatprintf(s,\"\\\\%c\",*p);\n break;\n case '\\n': s = sdscatlen(s,\"\\\\n\",2); break;\n case '\\r': s = sdscatlen(s,\"\\\\r\",2); break;\n case '\\t': s = sdscatlen(s,\"\\\\t\",2); break;\n case '\\a': s = sdscatlen(s,\"\\\\a\",2); break;\n case '\\b': s = sdscatlen(s,\"\\\\b\",2); break;\n default:\n if (isprint(*p))\n s = sdscatprintf(s,\"%c\",*p);\n else\n s = sdscatprintf(s,\"\\\\x%02x\",(unsigned char)*p);\n break;\n }\n p++;\n }\n return sdscatlen(s,\"\\\"\",1);\n}\n\n/* Helper function for sdssplitargs() that returns non zero if 'c'\n * is a valid hex digit. */\nint is_hex_digit(char c) {\n return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') ||\n (c >= 'A' && c <= 'F');\n}\n\n/* Helper function for sdssplitargs() that converts a hex digit into an\n * integer from 0 to 15 */\nint hex_digit_to_int(char c) {\n switch(c) {\n case '0': return 0;\n case '1': return 1;\n case '2': return 2;\n case '3': return 3;\n case '4': return 4;\n case '5': return 5;\n case '6': return 6;\n case '7': return 7;\n case '8': return 8;\n case '9': return 9;\n case 'a': case 'A': return 10;\n case 'b': case 'B': return 11;\n case 'c': case 'C': return 12;\n case 'd': case 'D': return 13;\n case 'e': case 'E': return 14;\n case 'f': case 'F': return 15;\n default: return 0;\n }\n}\n\n/* Split a line into arguments, where every argument can be in the\n * following programming-language REPL-alike form:\n *\n * foo bar \"newline are supported\\n\" and \"\\xff\\x00otherstuff\"\n *\n * The number of arguments is stored into *argc, and an array\n * of sds is returned.\n *\n * The caller should free the resulting array of sds strings with\n * sdsfreesplitres().\n *\n * Note that sdscatrepr() is able to convert back a string into\n * a quoted string in the same format sdssplitargs() is able to parse.\n *\n * The function returns the allocated tokens on success, even when the\n * input string is empty, or NULL if the input contains unbalanced\n * quotes or closed quotes followed by non space characters\n * as in: \"foo\"bar or \"foo'\n */\nsds *sdssplitargs(const char *line, int *argc) {\n const char *p = line;\n char *current = NULL;\n char **vector = NULL;\n\n *argc = 0;\n while(1) {\n /* skip blanks */\n while(*p && isspace(*p)) p++;\n if (*p) {\n /* get a token */\n int inq=0; /* set to 1 if we are in \"quotes\" */\n int insq=0; /* set to 1 if we are in 'single quotes' */\n int done=0;\n\n if (current == NULL) current = sdsempty();\n while(!done) {\n if (inq) {\n if (*p == '\\\\' && *(p+1) == 'x' &&\n is_hex_digit(*(p+2)) &&\n is_hex_digit(*(p+3)))\n {\n unsigned char byte;\n\n byte = (hex_digit_to_int(*(p+2))*16)+\n hex_digit_to_int(*(p+3));\n current = sdscatlen(current,(char*)&byte,1);\n p += 3;\n } else if (*p == '\\\\' && *(p+1)) {\n char c;\n\n p++;\n switch(*p) {\n case 'n': c = '\\n'; break;\n case 'r': c = '\\r'; break;\n case 't': c = '\\t'; break;\n case 'b': c = '\\b'; break;\n case 'a': c = '\\a'; break;\n default: c = *p; break;\n }\n current = sdscatlen(current,&c,1);\n } else if (*p == '\"') {\n /* closing quote must be followed by a space or\n * nothing at all. */\n if (*(p+1) && !isspace(*(p+1))) goto err;\n done=1;\n } else if (!*p) {\n /* unterminated quotes */\n goto err;\n } else {\n current = sdscatlen(current,p,1);\n }\n } else if (insq) {\n if (*p == '\\\\' && *(p+1) == '\\'') {\n p++;\n current = sdscatlen(current,\"'\",1);\n } else if (*p == '\\'') {\n /* closing quote must be followed by a space or\n * nothing at all. */\n if (*(p+1) && !isspace(*(p+1))) goto err;\n done=1;\n } else if (!*p) {\n /* unterminated quotes */\n goto err;\n } else {\n current = sdscatlen(current,p,1);\n }\n } else {\n switch(*p) {\n case ' ':\n case '\\n':\n case '\\r':\n case '\\t':\n case '\\0':\n done=1;\n break;\n case '\"':\n inq=1;\n break;\n case '\\'':\n insq=1;\n break;\n default:\n current = sdscatlen(current,p,1);\n break;\n }\n }\n if (*p) p++;\n }\n /* add the token to the vector */\n vector = s_realloc(vector,((*argc)+1)*sizeof(char*));\n vector[*argc] = current;\n (*argc)++;\n current = NULL;\n } else {\n /* Even on empty input string return something not NULL. */\n if (vector == NULL) vector = s_malloc(sizeof(void*));\n return vector;\n }\n }\n\nerr:\n while((*argc)--)\n sdsfree(vector[*argc]);\n s_free(vector);\n if (current) sdsfree(current);\n *argc = 0;\n return NULL;\n}\n\n/* Modify the string substituting all the occurrences of the set of\n * characters specified in the 'from' string to the corresponding character\n * in the 'to' array.\n *\n * For instance: sdsmapchars(mystring, \"ho\", \"01\", 2)\n * will have the effect of turning the string \"hello\" into \"0ell1\".\n *\n * The function returns the sds string pointer, that is always the same\n * as the input pointer since no resize is needed. */\nsds sdsmapchars(sds s, const char *from, const char *to, size_t setlen) {\n size_t j, i, l = sdslen(s);\n\n for (j = 0; j < l; j++) {\n for (i = 0; i < setlen; i++) {\n if (s[j] == from[i]) {\n s[j] = to[i];\n break;\n }\n }\n }\n return s;\n}\n\n/* Join an array of C strings using the specified separator (also a C string).\n * Returns the result as an sds string. */\nsds sdsjoin(char **argv, int argc, char *sep) {\n sds join = sdsempty();\n int j;\n\n for (j = 0; j < argc; j++) {\n join = sdscat(join, argv[j]);\n if (j != argc-1) join = sdscat(join,sep);\n }\n return join;\n}\n\n/* Like sdsjoin, but joins an array of SDS strings. */\nsds sdsjoinsds(sds *argv, int argc, const char *sep, size_t seplen) {\n sds join = sdsempty();\n int j;\n\n for (j = 0; j < argc; j++) {\n join = sdscatsds(join, argv[j]);\n if (j != argc-1) join = sdscatlen(join,sep,seplen);\n }\n return join;\n}\n\nint sdsIsNum(sds s) {\n size_t i;\n \n if (s == NULL || sdslen(s) == 0) {\n return 0;\n }\n\n for (i = 0; i < sdslen(s); i ++) {\n if(*(s+i) < '0' || *(s+i) > '9'){\n return 0;\n }\n }\n\n return 1;\n}\n\n/* Wrappers to the allocators used by SDS. Note that SDS will actually\n * just use the macros defined into sdsalloc.h in order to avoid to pay\n * the overhead of function calls. Here we define these wrappers only for\n * the programs SDS is linked to, if they want to touch the SDS internals\n * even if they use a different allocator. */\nvoid *sds_malloc(size_t size) { return s_malloc(size); }\nvoid *sds_realloc(void *ptr, size_t size) { return s_realloc(ptr,size); }\nvoid sds_free(void *ptr) { s_free(ptr); }\n\n#if defined(SDS_TEST_MAIN)\n#include \n#include \"testhelp.h\"\n#include \"limits.h\"\n\n#define UNUSED(x) (void)(x)\nint sdsTest(void) {\n {\n sds x = sdsnew(\"foo\"), y;\n\n test_cond(\"Create a string and obtain the length\",\n sdslen(x) == 3 && memcmp(x,\"foo\\0\",4) == 0)\n\n sdsfree(x);\n x = sdsnewlen(\"foo\",2);\n test_cond(\"Create a string with specified length\",\n sdslen(x) == 2 && memcmp(x,\"fo\\0\",3) == 0)\n\n x = sdscat(x,\"bar\");\n test_cond(\"Strings concatenation\",\n sdslen(x) == 5 && memcmp(x,\"fobar\\0\",6) == 0);\n\n x = sdscpy(x,\"a\");\n test_cond(\"sdscpy() against an originally longer string\",\n sdslen(x) == 1 && memcmp(x,\"a\\0\",2) == 0)\n\n x = sdscpy(x,\"xyzxxxxxxxxxxyyyyyyyyyykkkkkkkkkk\");\n test_cond(\"sdscpy() against an originally shorter string\",\n sdslen(x) == 33 &&\n memcmp(x,\"xyzxxxxxxxxxxyyyyyyyyyykkkkkkkkkk\\0\",33) == 0)\n\n sdsfree(x);\n x = sdscatprintf(sdsempty(),\"%d\",123);\n test_cond(\"sdscatprintf() seems working in the base case\",\n sdslen(x) == 3 && memcmp(x,\"123\\0\",4) == 0)\n\n sdsfree(x);\n x = sdsnew(\"--\");\n x = sdscatfmt(x, \"Hello %s World %I,%I--\", \"Hi!\", LLONG_MIN,LLONG_MAX);\n test_cond(\"sdscatfmt() seems working in the base case\",\n sdslen(x) == 60 &&\n memcmp(x,\"--Hello Hi! World -9223372036854775808,\"\n \"9223372036854775807--\",60) == 0)\n printf(\"[%s]\\n\",x);\n\n sdsfree(x);\n x = sdsnew(\"--\");\n x = sdscatfmt(x, \"%u,%U--\", UINT_MAX, ULLONG_MAX);\n test_cond(\"sdscatfmt() seems working with unsigned numbers\",\n sdslen(x) == 35 &&\n memcmp(x,\"--4294967295,18446744073709551615--\",35) == 0)\n\n sdsfree(x);\n x = sdsnew(\" x \");\n sdstrim(x,\" x\");\n test_cond(\"sdstrim() works when all chars match\",\n sdslen(x) == 0)\n\n sdsfree(x);\n x = sdsnew(\" x \");\n sdstrim(x,\" \");\n test_cond(\"sdstrim() works when a single char remains\",\n sdslen(x) == 1 && x[0] == 'x')\n\n sdsfree(x);\n x = sdsnew(\"xxciaoyyy\");\n sdstrim(x,\"xy\");\n test_cond(\"sdstrim() correctly trims characters\",\n sdslen(x) == 4 && memcmp(x,\"ciao\\0\",5) == 0)\n\n y = sdsdup(x);\n sdsrange(y,1,1);\n test_cond(\"sdsrange(...,1,1)\",\n sdslen(y) == 1 && memcmp(y,\"i\\0\",2) == 0)\n\n sdsfree(y);\n y = sdsdup(x);\n sdsrange(y,1,-1);\n test_cond(\"sdsrange(...,1,-1)\",\n sdslen(y) == 3 && memcmp(y,\"iao\\0\",4) == 0)\n\n sdsfree(y);\n y = sdsdup(x);\n sdsrange(y,-2,-1);\n test_cond(\"sdsrange(...,-2,-1)\",\n sdslen(y) == 2 && memcmp(y,\"ao\\0\",3) == 0)\n\n sdsfree(y);\n y = sdsdup(x);\n sdsrange(y,2,1);\n test_cond(\"sdsrange(...,2,1)\",\n sdslen(y) == 0 && memcmp(y,\"\\0\",1) == 0)\n\n sdsfree(y);\n y = sdsdup(x);\n sdsrange(y,1,100);\n test_cond(\"sdsrange(...,1,100)\",\n sdslen(y) == 3 && memcmp(y,\"iao\\0\",4) == 0)\n\n sdsfree(y);\n y = sdsdup(x);\n sdsrange(y,100,100);\n test_cond(\"sdsrange(...,100,100)\",\n sdslen(y) == 0 && memcmp(y,\"\\0\",1) == 0)\n\n sdsfree(y);\n sdsfree(x);\n x = sdsnew(\"foo\");\n y = sdsnew(\"foa\");\n test_cond(\"sdscmp(foo,foa)\", sdscmp(x,y) > 0)\n\n sdsfree(y);\n sdsfree(x);\n x = sdsnew(\"bar\");\n y = sdsnew(\"bar\");\n test_cond(\"sdscmp(bar,bar)\", sdscmp(x,y) == 0)\n\n sdsfree(y);\n sdsfree(x);\n x = sdsnew(\"aar\");\n y = sdsnew(\"bar\");\n test_cond(\"sdscmp(bar,bar)\", sdscmp(x,y) < 0)\n\n sdsfree(y);\n sdsfree(x);\n x = sdsnewlen(\"\\a\\n\\0foo\\r\",7);\n y = sdscatrepr(sdsempty(),x,sdslen(x));\n test_cond(\"sdscatrepr(...data...)\",\n memcmp(y,\"\\\"\\\\a\\\\n\\\\x00foo\\\\r\\\"\",15) == 0)\n\n {\n unsigned int oldfree;\n char *p;\n int step = 10, j, i;\n\n sdsfree(x);\n sdsfree(y);\n x = sdsnew(\"0\");\n test_cond(\"sdsnew() free/len buffers\", sdslen(x) == 1 && sdsavail(x) == 0);\n\n /* Run the test a few times in order to hit the first two\n * SDS header types. */\n for (i = 0; i < 10; i++) {\n int oldlen = sdslen(x);\n x = sdsMakeRoomFor(x,step);\n int type = x[-1]&SDS_TYPE_MASK;\n\n test_cond(\"sdsMakeRoomFor() len\", sdslen(x) == oldlen);\n if (type != SDS_TYPE_5) {\n test_cond(\"sdsMakeRoomFor() free\", sdsavail(x) >= step);\n oldfree = sdsavail(x);\n }\n p = x+oldlen;\n for (j = 0; j < step; j++) {\n p[j] = 'A'+j;\n }\n sdsIncrLen(x,step);\n }\n test_cond(\"sdsMakeRoomFor() content\",\n memcmp(\"0ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJ\",x,101) == 0);\n test_cond(\"sdsMakeRoomFor() final length\",sdslen(x)==101);\n\n sdsfree(x);\n }\n }\n test_report()\n return 0;\n}\n#endif\n\n#ifdef SDS_TEST_MAIN\nint main(void) {\n return sdsTest();\n}\n#endif\n" }, { "path": "dep/sds/sds.h", "content": "/* SDSLib 2.0 -- A C dynamic strings library\n *\n * Copyright (c) 2006-2015, Salvatore Sanfilippo \n * Copyright (c) 2015, Oran Agra\n * Copyright (c) 2015, Redis Labs, Inc\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * * Neither the name of Redis nor the names of its contributors may be used\n * to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n#ifndef __SDS_H\n#define __SDS_H\n\n#define SDS_MAX_PREALLOC (1024*1024)\n\n#include \n#include \n#include \n\ntypedef char *sds;\n\n/* Note: sdshdr5 is never used, we just access the flags byte directly.\n * However is here to document the layout of type 5 SDS strings. */\nstruct __attribute__ ((__packed__)) sdshdr5 {\n unsigned char flags; /* 3 lsb of type, and 5 msb of string length */\n char buf[];\n};\nstruct __attribute__ ((__packed__)) sdshdr8 {\n uint8_t len; /* used */\n uint8_t alloc; /* excluding the header and null terminator */\n unsigned char flags; /* 3 lsb of type, 5 unused bits */\n char buf[];\n};\nstruct __attribute__ ((__packed__)) sdshdr16 {\n uint16_t len; /* used */\n uint16_t alloc; /* excluding the header and null terminator */\n unsigned char flags; /* 3 lsb of type, 5 unused bits */\n char buf[];\n};\nstruct __attribute__ ((__packed__)) sdshdr32 {\n uint32_t len; /* used */\n uint32_t alloc; /* excluding the header and null terminator */\n unsigned char flags; /* 3 lsb of type, 5 unused bits */\n char buf[];\n};\nstruct __attribute__ ((__packed__)) sdshdr64 {\n uint64_t len; /* used */\n uint64_t alloc; /* excluding the header and null terminator */\n unsigned char flags; /* 3 lsb of type, 5 unused bits */\n char buf[];\n};\n\n#define SDS_TYPE_5 0\n#define SDS_TYPE_8 1\n#define SDS_TYPE_16 2\n#define SDS_TYPE_32 3\n#define SDS_TYPE_64 4\n#define SDS_TYPE_MASK 7\n#define SDS_TYPE_BITS 3\n#define SDS_HDR_VAR(T,s) struct sdshdr##T *sh = (void*)((s)-(sizeof(struct sdshdr##T)));\n#define SDS_HDR(T,s) ((struct sdshdr##T *)((s)-(sizeof(struct sdshdr##T))))\n#define SDS_TYPE_5_LEN(f) ((f)>>SDS_TYPE_BITS)\n\nstatic inline size_t sdslen(const sds s) {\n unsigned char flags = s[-1];\n switch(flags&SDS_TYPE_MASK) {\n case SDS_TYPE_5:\n return SDS_TYPE_5_LEN(flags);\n case SDS_TYPE_8:\n return SDS_HDR(8,s)->len;\n case SDS_TYPE_16:\n return SDS_HDR(16,s)->len;\n case SDS_TYPE_32:\n return SDS_HDR(32,s)->len;\n case SDS_TYPE_64:\n return SDS_HDR(64,s)->len;\n }\n return 0;\n}\n\nstatic inline size_t sdsavail(const sds s) {\n unsigned char flags = s[-1];\n switch(flags&SDS_TYPE_MASK) {\n case SDS_TYPE_5: {\n return 0;\n }\n case SDS_TYPE_8: {\n SDS_HDR_VAR(8,s);\n return sh->alloc - sh->len;\n }\n case SDS_TYPE_16: {\n SDS_HDR_VAR(16,s);\n return sh->alloc - sh->len;\n }\n case SDS_TYPE_32: {\n SDS_HDR_VAR(32,s);\n return sh->alloc - sh->len;\n }\n case SDS_TYPE_64: {\n SDS_HDR_VAR(64,s);\n return sh->alloc - sh->len;\n }\n }\n return 0;\n}\n\nstatic inline void sdssetlen(sds s, size_t newlen) {\n unsigned char flags = s[-1];\n switch(flags&SDS_TYPE_MASK) {\n case SDS_TYPE_5:\n {\n unsigned char *fp = ((unsigned char*)s)-1;\n *fp = SDS_TYPE_5 | (newlen << SDS_TYPE_BITS);\n }\n break;\n case SDS_TYPE_8:\n SDS_HDR(8,s)->len = newlen;\n break;\n case SDS_TYPE_16:\n SDS_HDR(16,s)->len = newlen;\n break;\n case SDS_TYPE_32:\n SDS_HDR(32,s)->len = newlen;\n break;\n case SDS_TYPE_64:\n SDS_HDR(64,s)->len = newlen;\n break;\n }\n}\n\nstatic inline void sdsinclen(sds s, size_t inc) {\n unsigned char flags = s[-1];\n switch(flags&SDS_TYPE_MASK) {\n case SDS_TYPE_5:\n {\n unsigned char *fp = ((unsigned char*)s)-1;\n unsigned char newlen = SDS_TYPE_5_LEN(flags)+inc;\n *fp = SDS_TYPE_5 | (newlen << SDS_TYPE_BITS);\n }\n break;\n case SDS_TYPE_8:\n SDS_HDR(8,s)->len += inc;\n break;\n case SDS_TYPE_16:\n SDS_HDR(16,s)->len += inc;\n break;\n case SDS_TYPE_32:\n SDS_HDR(32,s)->len += inc;\n break;\n case SDS_TYPE_64:\n SDS_HDR(64,s)->len += inc;\n break;\n }\n}\n\n/* sdsalloc() = sdsavail() + sdslen() */\nstatic inline size_t sdsalloc(const sds s) {\n unsigned char flags = s[-1];\n switch(flags&SDS_TYPE_MASK) {\n case SDS_TYPE_5:\n return SDS_TYPE_5_LEN(flags);\n case SDS_TYPE_8:\n return SDS_HDR(8,s)->alloc;\n case SDS_TYPE_16:\n return SDS_HDR(16,s)->alloc;\n case SDS_TYPE_32:\n return SDS_HDR(32,s)->alloc;\n case SDS_TYPE_64:\n return SDS_HDR(64,s)->alloc;\n }\n return 0;\n}\n\nstatic inline void sdssetalloc(sds s, size_t newlen) {\n unsigned char flags = s[-1];\n switch(flags&SDS_TYPE_MASK) {\n case SDS_TYPE_5:\n /* Nothing to do, this type has no total allocation info. */\n break;\n case SDS_TYPE_8:\n SDS_HDR(8,s)->alloc = newlen;\n break;\n case SDS_TYPE_16:\n SDS_HDR(16,s)->alloc = newlen;\n break;\n case SDS_TYPE_32:\n SDS_HDR(32,s)->alloc = newlen;\n break;\n case SDS_TYPE_64:\n SDS_HDR(64,s)->alloc = newlen;\n break;\n }\n}\n\nsds sdsnewlen(const void *init, size_t initlen);\nsds sdsnew(const char *init);\nsds sdsempty(void);\nsds sdsdup(const sds s);\nvoid sdsfree(sds s);\nsds sdsgrowzero(sds s, size_t len);\nsds sdscatlen(sds s, const void *t, size_t len);\nsds sdscat(sds s, const char *t);\nsds sdscatsds(sds s, const sds t);\nsds sdscpylen(sds s, const char *t, size_t len);\nsds sdscpy(sds s, const char *t);\n\nsds sdscatvprintf(sds s, const char *fmt, va_list ap);\n#ifdef __GNUC__\nsds sdscatprintf(sds s, const char *fmt, ...)\n __attribute__((format(printf, 2, 3)));\n#else\nsds sdscatprintf(sds s, const char *fmt, ...);\n#endif\n\nsds sdscatfmt(sds s, char const *fmt, ...);\nsds sdstrim(sds s, const char *cset);\nvoid sdsrange(sds s, int start, int end);\nvoid sdsupdatelen(sds s);\nvoid sdsclear(sds s);\nint sdscmp(const sds s1, const sds s2);\nsds *sdssplitlen(const char *s, int len, const char *sep, int seplen, int *count);\nvoid sdsfreesplitres(sds *tokens, int count);\nvoid sdstolower(sds s);\nvoid sdstoupper(sds s);\nsds sdsfromlonglong(long long value);\nsds sdscatrepr(sds s, const char *p, size_t len);\nsds *sdssplitargs(const char *line, int *argc);\nsds sdsmapchars(sds s, const char *from, const char *to, size_t setlen);\nsds sdsjoin(char **argv, int argc, char *sep);\nsds sdsjoinsds(sds *argv, int argc, const char *sep, size_t seplen);\n\nint sdsIsNum(sds s);\n\n/* Low level functions exposed to the user API */\nsds sdsMakeRoomFor(sds s, size_t addlen);\nvoid sdsIncrLen(sds s, int incr);\nsds sdsRemoveFreeSpace(sds s);\nsize_t sdsAllocSize(sds s);\nvoid *sdsAllocPtr(sds s);\n\n/* Export the allocator used by SDS to the program using SDS.\n * Sometimes the program SDS is linked to, may use a different set of\n * allocators, but may want to allocate or free things that SDS will\n * respectively free or allocate. */\nvoid *sds_malloc(size_t size);\nvoid *sds_realloc(void *ptr, size_t size);\nvoid sds_free(void *ptr);\n\n#ifdef REDIS_TEST\nint sdsTest(int argc, char *argv[]);\n#endif\n\n#endif\n" }, { "path": "dep/sds/sdsalloc.h", "content": "/* SDSLib 2.0 -- A C dynamic strings library\n *\n * Copyright (c) 2006-2015, Salvatore Sanfilippo \n * Copyright (c) 2015, Redis Labs, Inc\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * * Neither the name of Redis nor the names of its contributors may be used\n * to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* SDS allocator selection.\n *\n * This file is used in order to change the SDS allocator at compile time.\n * Just define the following defines to what you want to use. Also add\n * the include of your alternate allocator if needed (not needed in order\n * to use the default libc allocator). */\n\n#include \n\n#define s_malloc dalloc\n#define s_realloc drealloc\n#define s_free dfree\n" }, { "path": "dep/util/Makefile.am", "content": "MAINTAINERCLEANFILES = Makefile.in\n\nAM_CFLAGS = -Wall -Wshadow\nAM_CFLAGS += -Wno-unused-parameter -Wno-unused-value\n\nnoinst_LIBRARIES = libdutil.a\n\nnoinst_HEADERS = dspecialconfig.h dutil.h dlog.h\n\nlibdutil_a_SOURCES = \\\n dspecialconfig.h \\\n\tdutil.c dutil.h \\\n dlog.c dlog.h" }, { "path": "dep/util/dlog.c", "content": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n\nstatic struct logger logger;\n\nint\nlog_init(int level, char *name)\n{\n struct logger *l = &logger;\n\n l->level = MAX(LOG_EMERG, MIN(level, LOG_PVERB));\n l->name = name;\n if (name == NULL || !strlen(name)) {\n l->fd = STDERR_FILENO;\n } else {\n l->fd = open(name, O_WRONLY | O_APPEND | O_CREAT, 0644);\n if (l->fd < 0) {\n log_stderr(\"opening log file '%s' failed: %s\", name,\n strerror(errno));\n return -1;\n }\n }\n\n return 0;\n}\n\nvoid\nlog_deinit(void)\n{\n struct logger *l = &logger;\n\n if (l->fd < 0 || l->fd == STDERR_FILENO) {\n return;\n }\n\n close(l->fd);\n}\n\nvoid\nlog_reopen(void)\n{\n struct logger *l = &logger;\n\n if (l->fd != STDERR_FILENO) {\n close(l->fd);\n l->fd = open(l->name, O_WRONLY | O_APPEND | O_CREAT, 0644);\n if (l->fd < 0) {\n log_stderr_safe(\"reopening log file '%s' failed, ignored: %s\", l->name,\n strerror(errno));\n }\n }\n}\n\nvoid\nlog_level_up(void)\n{\n struct logger *l = &logger;\n\n if (l->level < LOG_PVERB) {\n l->level++;\n log_safe(\"up log level to %d\", l->level);\n }\n}\n\nvoid\nlog_level_down(void)\n{\n struct logger *l = &logger;\n\n if (l->level > LOG_EMERG) {\n l->level--;\n log_safe(\"down log level to %d\", l->level);\n }\n}\n\nvoid\nlog_level_set(int level)\n{\n struct logger *l = &logger;\n\n l->level = MAX(LOG_EMERG, MIN(level, LOG_PVERB));\n loga(\"set log level to %d\", l->level);\n}\n\nvoid\nlog_stacktrace(void)\n{\n struct logger *l = &logger;\n\n if (l->fd < 0) {\n return;\n }\n dstacktrace_fd(l->fd);\n}\n\nint\nlog_loggable(int level)\n{\n struct logger *l = &logger;\n\n if (level > l->level) {\n return 0;\n }\n\n return 1;\n}\n\nvoid\n_log(const char *file, int line, int level, int panic, const char *fmt, ...)\n{\n struct logger *l = &logger;\n int len, size, errno_save;\n char buf[LOG_MAX_LEN];\n va_list args;\n ssize_t n;\n struct timeval tv;\n\n if (l->fd < 0) {\n return;\n }\n\n errno_save = errno;\n len = 0; /* length of output buffer */\n size = LOG_MAX_LEN; /* size of output buffer */\n\n gettimeofday(&tv, NULL);\n buf[len++] = '[';\n len += dstrftime(buf + len, size - len, \"%Y-%m-%d %H:%M:%S.\", localtime(&tv.tv_sec));\n len += dscnprintf(buf + len, size - len, \"%03ld\", tv.tv_usec/1000);\n len += dscnprintf(buf + len, size - len, \"] %s:%d \", file, line);\n\n va_start(args, fmt);\n len += dvscnprintf(buf + len, size - len, fmt, args);\n va_end(args);\n\n buf[len++] = '\\n';\n\n n = write(l->fd, buf, len);\n if (n < 0) {\n l->nerror++;\n }\n\n errno = errno_save;\n\n if (panic) {\n abort();\n }\n}\n\nvoid\n_log_stderr(const char *fmt, ...)\n{\n struct logger *l = &logger;\n int len, size, errno_save;\n char buf[4 * LOG_MAX_LEN];\n va_list args;\n ssize_t n;\n\n errno_save = errno;\n len = 0; /* length of output buffer */\n size = 4 * LOG_MAX_LEN; /* size of output buffer */\n\n va_start(args, fmt);\n len += dvscnprintf(buf, size, fmt, args);\n va_end(args);\n\n buf[len++] = '\\n';\n\n n = write(STDERR_FILENO, buf, len);\n if (n < 0) {\n l->nerror++;\n }\n\n errno = errno_save;\n}\n\nvoid\n_log_stdout(const char *fmt, ...)\n{\n struct logger *l = &logger;\n int len, size, errno_save;\n char buf[4 * LOG_MAX_LEN];\n va_list args;\n ssize_t n;\n\n errno_save = errno;\n len = 0; /* length of output buffer */\n size = 4 * LOG_MAX_LEN; /* size of output buffer */\n\n va_start(args, fmt);\n len += dvscnprintf(buf, size, fmt, args);\n va_end(args);\n\n buf[len++] = '\\n';\n\n n = write(STDOUT_FILENO, buf, len);\n if (n < 0) {\n l->nerror++;\n }\n\n errno = errno_save;\n}\n\n/*\n * Hexadecimal dump in the canonical hex + ascii display\n * See -C option in man hexdump\n */\nvoid\n_log_hexdump(const char *file, int line, char *data, int datalen,\n const char *fmt, ...)\n{\n struct logger *l = &logger;\n char buf[8 * LOG_MAX_LEN];\n int i, off, len, size, errno_save;\n ssize_t n;\n\n if (l->fd < 0) {\n return;\n }\n\n /* log hexdump */\n errno_save = errno;\n off = 0; /* data offset */\n len = 0; /* length of output buffer */\n size = 8 * LOG_MAX_LEN; /* size of output buffer */\n\n while (datalen != 0 && (len < size - 1)) {\n char *save, *str;\n unsigned char c;\n int savelen;\n\n len += dscnprintf(buf + len, size - len, \"%08x \", off);\n\n save = data;\n savelen = datalen;\n\n for (i = 0; datalen != 0 && i < 16; data++, datalen--, i++) {\n c = (unsigned char)(*data);\n str = (i == 7) ? \" \" : \" \";\n len += dscnprintf(buf + len, size - len, \"%02x%s\", c, str);\n }\n for ( ; i < 16; i++) {\n str = (i == 7) ? \" \" : \" \";\n len += dscnprintf(buf + len, size - len, \" %s\", str);\n }\n\n data = save;\n datalen = savelen;\n\n len += dscnprintf(buf + len, size - len, \" |\");\n\n for (i = 0; datalen != 0 && i < 16; data++, datalen--, i++) {\n c = (unsigned char)(isprint(*data) ? *data : '.');\n len += dscnprintf(buf + len, size - len, \"%c\", c);\n }\n len += dscnprintf(buf + len, size - len, \"|\\n\");\n\n off += 16;\n }\n\n n = write(l->fd, buf, len);\n if (n < 0) {\n l->nerror++;\n }\n\n if (len >= size - 1) {\n n = write(l->fd, \"\\n\", 1);\n if (n < 0) {\n l->nerror++;\n }\n }\n\n errno = errno_save;\n}\n\nvoid\n_log_safe(const char *fmt, ...)\n{\n struct logger *l = &logger;\n int len, size, errno_save;\n char buf[LOG_MAX_LEN];\n va_list args;\n ssize_t n;\n\n if (l->fd < 0) {\n return;\n }\n\n errno_save = errno;\n len = 0; /* length of output buffer */\n size = LOG_MAX_LEN; /* size of output buffer */\n\n len += dsafe_snprintf(buf + len, size - len, \"[.......................] \");\n\n va_start(args, fmt);\n len += dsafe_vsnprintf(buf + len, size - len, fmt, args);\n va_end(args);\n\n buf[len++] = '\\n';\n\n n = write(l->fd, buf, len);\n if (n < 0) {\n l->nerror++;\n }\n\n errno = errno_save;\n}\n\nvoid\n_log_stderr_safe(const char *fmt, ...)\n{\n struct logger *l = &logger;\n int len, size, errno_save;\n char buf[LOG_MAX_LEN];\n va_list args;\n ssize_t n;\n\n errno_save = errno;\n len = 0; /* length of output buffer */\n size = LOG_MAX_LEN; /* size of output buffer */\n\n len += dsafe_snprintf(buf + len, size - len, \"[.......................] \");\n\n va_start(args, fmt);\n len += dsafe_vsnprintf(buf + len, size - len, fmt, args);\n va_end(args);\n\n buf[len++] = '\\n';\n\n n = write(STDERR_FILENO, buf, len);\n if (n < 0) {\n l->nerror++;\n }\n\n errno = errno_save;\n}\n\nvoid log_write_len(char *str, size_t len)\n{\n struct logger *l = &logger;\n int errno_save;\n ssize_t n;\n\n if (l->fd < 0) {\n return;\n }\n\n errno_save = errno;\n n = write(l->fd, str, len);\n if (n < 0) {\n l->nerror++;\n }\n\n errno = errno_save;\n}\n" }, { "path": "dep/util/dlog.h", "content": "#ifndef _DLOG_H_\n#define _DLOG_H_\n\n#ifdef HAVE_CONFIG_H\n# include \n#endif\n\nstruct logger {\n char *name; /* log file name */\n int level; /* log level */\n int fd; /* log file descriptor */\n int nerror; /* # log error */\n};\n\n#define LOG_EMERG 0 /* system in unusable */\n#define LOG_ALERT 1 /* action must be taken immediately */\n#define LOG_CRIT 2 /* critical conditions */\n#define LOG_ERR 3 /* error conditions */\n#define LOG_WARN 4 /* warning conditions */\n#define LOG_NOTICE 5 /* normal but significant condition (default) */\n#define LOG_INFO 6 /* informational */\n#define LOG_DEBUG 7 /* debug messages */\n#define LOG_VERB 8 /* verbose messages */\n#define LOG_VVERB 9 /* verbose messages on crack */\n#define LOG_VVVERB 10 /* verbose messages on ganga */\n#define LOG_PVERB 11 /* periodic verbose messages on crack */\n\n#define LOG_MAX_LEN 256 /* max length of log message */\n\n/*\n * log_stderr - log to stderr\n * loga - log always\n * loga_hexdump - log hexdump always\n * log_error - error log messages\n * log_warn - warning log messages\n * log_panic - log messages followed by a panic\n * ...\n * log_debug - debug log messages based on a log level\n * log_hexdump - hexadump -C of a log buffer\n */\n#ifdef HAVE_DEBUG_LOG\n\n#define log_debug(_level, ...) do { \\\n if (log_loggable(_level) != 0) { \\\n _log(__FILE__, __LINE__, _level, 0, __VA_ARGS__); \\\n } \\\n} while (0)\n\n#else\n\n#define log_debug(_level, ...)\n\n#endif\n\n#define log_hexdump(_level, _data, _datalen, ...) do { \\\n if (log_loggable(_level) != 0) { \\\n _log(__FILE__, __LINE__, _level, 0, __VA_ARGS__); \\\n _log_hexdump(__FILE__, __LINE__, (char *)(_data), (int)(_datalen), \\\n __VA_ARGS__); \\\n } \\\n} while (0)\n\n#define log_stderr(...) do { \\\n _log_stderr(__VA_ARGS__); \\\n} while (0)\n\n#define log_stdout(...) do { \\\n _log_stdout(__VA_ARGS__); \\\n} while (0)\n\n#define log_safe(...) do { \\\n _log_safe(__VA_ARGS__); \\\n} while (0)\n\n#define log_stderr_safe(...) do { \\\n _log_stderr_safe(__VA_ARGS__); \\\n} while (0)\n\n#define loga(...) do { \\\n _log(__FILE__, __LINE__, LOG_EMERG, 0, __VA_ARGS__); \\\n} while (0)\n\n#define loga_hexdump(_data, _datalen, ...) do { \\\n _log(__FILE__, __LINE__, LOG_EMERG, 0, __VA_ARGS__); \\\n _log_hexdump(__FILE__, __LINE__, (char *)(_data), (int)(_datalen), \\\n __VA_ARGS__); \\\n} while (0) \\\n\n#define log_error(...) do { \\\n if (log_loggable(LOG_ERR) != 0) { \\\n _log(__FILE__, __LINE__, LOG_ERR, 0, __VA_ARGS__); \\\n } \\\n} while (0)\n\n#define log_warn(...) do { \\\n if (log_loggable(LOG_WARN) != 0) { \\\n _log(__FILE__, __LINE__, LOG_WARN, 0, __VA_ARGS__); \\\n } \\\n} while (0)\n\n#define log_notice(...) do { \\\n if (log_loggable(LOG_NOTICE) != 0) { \\\n _log(__FILE__, __LINE__, LOG_NOTICE, 0, __VA_ARGS__); \\\n } \\\n} while (0)\n\n#define log_panic(...) do { \\\n if (log_loggable(LOG_EMERG) != 0) { \\\n _log(__FILE__, __LINE__, LOG_EMERG, 1, __VA_ARGS__); \\\n } \\\n} while (0)\n\nint log_init(int level, char *filename);\nvoid log_deinit(void);\nvoid log_level_up(void);\nvoid log_level_down(void);\nvoid log_level_set(int level);\nvoid log_stacktrace(void);\nvoid log_reopen(void);\nint log_loggable(int level);\n\nvoid _log(const char *file, int line, int level, int panic, const char *fmt, ...);\nvoid _log_stderr(const char *fmt, ...);\nvoid _log_stdout(const char *fmt, ...);\nvoid _log_safe(const char *fmt, ...);\nvoid _log_stderr_safe(const char *fmt, ...);\nvoid _log_hexdump(const char *file, int line, char *data, int datalen, const char *fmt, ...);\n\nvoid log_write_len(char * str, size_t len);\n\n#endif\n" }, { "path": "dep/util/dspecialconfig.h", "content": "#ifndef _DSPECIALCONFIG_H_\n#define _DSPECIALCONFIG_H_\n\n#ifdef __APPLE__\n#include \n#endif\n\n#ifdef __linux__\n#include \n#include \n#endif\n\n#if (__i386 || __amd64 || __powerpc__) && __GNUC__\n#define GNUC_VERSION (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__)\n#if defined(__clang__)\n#define HAVE_ATOMIC\n#endif\n#if (defined(__GLIBC__) && defined(__GLIBC_PREREQ))\n#if (GNUC_VERSION >= 40100 && __GLIBC_PREREQ(2, 6))\n#define HAVE_ATOMIC\n#endif\n#endif\n#endif\n\n\n#if defined(__sun)\n#if defined(__GNUC__)\n#include \n#undef isnan\n#define isnan(x) \\\n __extension__({ __typeof (x) __x_a = (x); \\\n __builtin_expect(__x_a != __x_a, 0); })\n\n#undef isfinite\n#define isfinite(x) \\\n __extension__ ({ __typeof (x) __x_f = (x); \\\n __builtin_expect(!isnan(__x_f - __x_f), 1); })\n\n#undef isinf\n#define isinf(x) \\\n __extension__ ({ __typeof (x) __x_i = (x); \\\n __builtin_expect(!isnan(__x_i) && !isfinite(__x_i), 0); })\n\n#define u_int uint\n#define u_int32_t uint32_t\n#endif /* __GNUC__ */\n#endif /* __sun */\n\n\n/* Test for proc filesystem */\n#ifdef __linux__\n#define HAVE_PROC_STAT 1\n#define HAVE_PROC_MAPS 1\n#define HAVE_PROC_SMAPS 1\n#define HAVE_PROC_SOMAXCONN 1\n#endif\n\n/* Test for task_info() */\n#if defined(__APPLE__)\n#define HAVE_TASKINFO 1\n#endif\n\n\n#endif\n" }, { "path": "dep/util/dutil.c", "content": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n\n#include \n#include \n\n#ifdef HAVE_CONFIG_H\n# include \n#endif\n\n#ifdef HAVE_BACKTRACE\n# include \n#endif\n\n#include \n#include \n\n/* GCC version >= 4.7 */\n#if defined(__ATOMIC_RELAXED)\n/* GCC version >= 4.1 */\n#elif defined(HAVE_ATOMIC)\n#else\npthread_mutex_t atomic_locker = PTHREAD_MUTEX_INITIALIZER;\n#endif\n\nvoid\ndassert(const char *cond, const char *file, int line, int panic)\n{\n log_error(\"assert '%s' failed @ (%s, %d)\", cond, file, line);\n\n if (panic) {\n dstacktrace(1);\n abort();\n }\n}\n\nvoid\ndstacktrace(int skip_count)\n{\n#ifdef HAVE_BACKTRACE\n void *stack[64];\n char **symbols;\n int size, i, j;\n\n size = backtrace(stack, 64);\n symbols = backtrace_symbols(stack, size);\n if (symbols == NULL) {\n return;\n }\n\n skip_count++; /* skip the current frame also */\n\n for (i = skip_count, j = 0; i < size; i++, j++) {\n loga(\"[%d] %s\", j, symbols[i]);\n }\n\n free(symbols);\n#endif\n}\n\nvoid\ndstacktrace_fd(int fd)\n{\n#ifdef HAVE_BACKTRACE\n void *stack[64];\n int size;\n\n size = backtrace(stack, 64);\n backtrace_symbols_fd(stack, size, fd);\n#endif\n}\n\nint\n_dvscnprintf(char *buf, size_t size, const char *fmt, va_list args)\n{\n int n;\n\n n = vsnprintf(buf, size, fmt, args);\n\n /*\n * The return value is the number of characters which would be written\n * into buf not including the trailing '\\0'. If size is == 0 the\n * function returns 0.\n *\n * On error, the function also returns 0. This is to allow idiom such\n * as len += _vscnprintf(...)\n *\n * See: http://lwn.net/Articles/69419/\n */\n if (n <= 0) {\n return 0;\n }\n\n if (n < (int) size) {\n return n;\n }\n\n return (int)(size - 1);\n}\n\nint\n_dscnprintf(char *buf, size_t size, const char *fmt, ...)\n{\n va_list args;\n int n;\n\n va_start(args, fmt);\n n = _dvscnprintf(buf, size, fmt, args);\n va_end(args);\n\n return n;\n}\n\nstatic char *\n_safe_utoa(int _base, uint64_t val, char *buf)\n{\n char hex[] = \"0123456789abcdef\";\n uint32_t base = (uint32_t) _base;\n *buf-- = 0;\n do {\n *buf-- = hex[val % base];\n } while ((val /= base) != 0);\n return buf + 1;\n}\n\nstatic char *\n_safe_itoa(int base, int64_t val, char *buf)\n{\n char hex[] = \"0123456789abcdef\";\n char *orig_buf = buf;\n const int32_t is_neg = (val < 0);\n *buf-- = 0;\n\n if (is_neg) {\n val = -val;\n }\n if (is_neg && base == 16) {\n int ix;\n val -= 1;\n for (ix = 0; ix < 16; ++ix)\n buf[-ix] = '0';\n }\n\n do {\n *buf-- = hex[val % base];\n } while ((val /= base) != 0);\n\n if (is_neg && base == 10) {\n *buf-- = '-';\n }\n\n if (is_neg && base == 16) {\n int ix;\n buf = orig_buf - 1;\n for (ix = 0; ix < 16; ++ix, --buf) {\n /* *INDENT-OFF* */\n switch (*buf) {\n case '0': *buf = 'f'; break;\n case '1': *buf = 'e'; break;\n case '2': *buf = 'd'; break;\n case '3': *buf = 'c'; break;\n case '4': *buf = 'b'; break;\n case '5': *buf = 'a'; break;\n case '6': *buf = '9'; break;\n case '7': *buf = '8'; break;\n case '8': *buf = '7'; break;\n case '9': *buf = '6'; break;\n case 'a': *buf = '5'; break;\n case 'b': *buf = '4'; break;\n case 'c': *buf = '3'; break;\n case 'd': *buf = '2'; break;\n case 'e': *buf = '1'; break;\n case 'f': *buf = '0'; break;\n }\n /* *INDENT-ON* */\n }\n }\n return buf + 1;\n}\n\nstatic const char *\n_safe_check_longlong(const char *fmt, int *have_longlong)\n{\n *have_longlong = 0;\n if (*fmt == 'l') {\n fmt++;\n if (*fmt != 'l') {\n *have_longlong = (sizeof(long) == sizeof(long long));\n } else {\n fmt++;\n *have_longlong = 1;\n }\n }\n return fmt;\n}\n\nint\n_safe_vsnprintf(char *to, size_t size, const char *format, va_list ap)\n{\n char *start = to;\n char *end = start + size - 1;\n for (; *format; ++format) {\n int have_longlong = 0;\n if (*format != '%') {\n if (to == end) { /* end of buffer */\n break;\n }\n *to++ = *format; /* copy ordinary char */\n continue;\n }\n ++format; /* skip '%' */\n\n format = _safe_check_longlong(format, &have_longlong);\n\n switch (*format) {\n case 'd':\n case 'i':\n case 'u':\n case 'x':\n case 'p':\n {\n int64_t ival = 0;\n uint64_t uval = 0;\n if (*format == 'p')\n have_longlong = (sizeof(void *) == sizeof(uint64_t));\n if (have_longlong) {\n if (*format == 'u') {\n uval = va_arg(ap, uint64_t);\n } else {\n ival = va_arg(ap, int64_t);\n }\n } else {\n if (*format == 'u') {\n uval = va_arg(ap, uint32_t);\n } else {\n ival = va_arg(ap, int32_t);\n }\n }\n\n {\n char buff[22];\n const int base = (*format == 'x' || *format == 'p') ? 16 : 10;\n\n\t\t /* *INDENT-OFF* */\n char *val_as_str = (*format == 'u') ?\n _safe_utoa(base, uval, &buff[sizeof(buff) - 1]) :\n _safe_itoa(base, ival, &buff[sizeof(buff) - 1]);\n\t\t /* *INDENT-ON* */\n\n /* Strip off \"ffffffff\" if we have 'x' format without 'll' */\n if (*format == 'x' && !have_longlong && ival < 0) {\n val_as_str += 8;\n }\n\n while (*val_as_str && to < end) {\n *to++ = *val_as_str++;\n }\n continue;\n }\n }\n case 's':\n {\n const char *val = va_arg(ap, char *);\n if (!val) {\n val = \"(null)\";\n }\n while (*val && to < end) {\n *to++ = *val++;\n }\n continue;\n }\n }\n }\n *to = 0;\n return (int)(to - start);\n}\n\nint\n_safe_snprintf(char *to, size_t n, const char *fmt, ...)\n{\n int result;\n va_list args;\n va_start(args, fmt);\n result = _safe_vsnprintf(to, n, fmt, args);\n va_end(args);\n return result;\n}\n\n/*\n * Return the current time in microseconds since Epoch\n */\nlong long\ndusec_now(void)\n{\n struct timeval now;\n int64_t usec;\n int status;\n\n status = gettimeofday(&now, NULL);\n if (status < 0) {\n log_error(\"gettimeofday failed: %s\", strerror(errno));\n return -1;\n }\n\n usec = (int64_t)now.tv_sec * 1000000LL + (int64_t)now.tv_usec;\n\n return usec;\n}\n\n/*\n * Return the current time in milliseconds since Epoch\n */\nlong long\ndmsec_now(void)\n{\n return dusec_now() / 1000LL;\n}\n\n/*\n * Return the current time in seconds since Epoch\n */\nlong long\ndsec_now(void)\n{\n return dusec_now() / 1000000LL;\n}\n\n/* Glob-style pattern matching. */\nint string_match_len(const char *pattern, int patternLen,\n const char *string, int stringLen, int nocase)\n{\n while(patternLen) {\n switch(pattern[0]) {\n case '*':\n while (pattern[1] == '*') {\n pattern++;\n patternLen--;\n }\n if (patternLen == 1)\n return 1; /* match */\n while(stringLen) {\n if (string_match_len(pattern+1, patternLen-1,\n string, stringLen, nocase))\n return 1; /* match */\n string++;\n stringLen--;\n }\n return 0; /* no match */\n break;\n case '?':\n if (stringLen == 0)\n return 0; /* no match */\n string++;\n stringLen--;\n break;\n case '[':\n {\n int not, match;\n\n pattern++;\n patternLen--;\n not = pattern[0] == '^';\n if (not) {\n pattern++;\n patternLen--;\n }\n match = 0;\n while(1) {\n if (pattern[0] == '\\\\') {\n pattern++;\n patternLen--;\n if (pattern[0] == string[0])\n match = 1;\n } else if (pattern[0] == ']') {\n break;\n } else if (patternLen == 0) {\n pattern--;\n patternLen++;\n break;\n } else if (pattern[1] == '-' && patternLen >= 3) {\n int start = pattern[0];\n int end = pattern[2];\n int c = string[0];\n if (start > end) {\n int t = start;\n start = end;\n end = t;\n }\n if (nocase) {\n start = tolower(start);\n end = tolower(end);\n c = tolower(c);\n }\n pattern += 2;\n patternLen -= 2;\n if (c >= start && c <= end)\n match = 1;\n } else {\n if (!nocase) {\n if (pattern[0] == string[0])\n match = 1;\n } else {\n if (tolower((int)pattern[0]) == tolower((int)string[0]))\n match = 1;\n }\n }\n pattern++;\n patternLen--;\n }\n if (not)\n match = !match;\n if (!match)\n return 0; /* no match */\n string++;\n stringLen--;\n break;\n }\n case '\\\\':\n if (patternLen >= 2) {\n pattern++;\n patternLen--;\n }\n /* fall through */\n default:\n if (!nocase) {\n if (pattern[0] != string[0])\n return 0; /* no match */\n } else {\n if (tolower((int)pattern[0]) != tolower((int)string[0]))\n return 0; /* no match */\n }\n string++;\n stringLen--;\n break;\n }\n pattern++;\n patternLen--;\n if (stringLen == 0) {\n while(*pattern == '*') {\n pattern++;\n patternLen--;\n }\n break;\n }\n }\n if (patternLen == 0 && stringLen == 0)\n return 1;\n return 0;\n}\n\nint string_match(const char *pattern, const char *string, int nocase) {\n return string_match_len(pattern,strlen(pattern),string,strlen(string),nocase);\n}\n" }, { "path": "dep/util/dutil.h", "content": "#ifndef _DUTIL_H_\n#define _DUTIL_H_\n\n#include \n\n#include \n\n#define UNUSED(x) (void)(x)\n\n#define LF (uint8_t) 10\n#define CR (uint8_t) 13\n#define CRLF \"\\x0d\\x0a\"\n#define CRLF_LEN (sizeof(\"\\x0d\\x0a\") - 1)\n\n#define NELEMS(a) ((sizeof(a)) / sizeof((a)[0]))\n\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n\n#define SQUARE(d) ((d) * (d))\n#define VAR(s, s2, n) (((n) < 2) ? 0.0 : ((s2) - SQUARE(s)/(n)) / ((n) - 1))\n#define STDDEV(s, s2, n) (((n) < 2) ? 0.0 : sqrt(VAR((s), (s2), (n))))\n\n/*\n * Wrappers for defining custom assert based on whether macro\n * RMT_ASSERT_PANIC or RMT_ASSERT_LOG was defined at the moment\n * ASSERT was called.\n */\n#ifdef HAVE_ASSERT_PANIC\n\n#define ASSERT(_x) do { \\\n if (!(_x)) { \\\n dassert(#_x, __FILE__, __LINE__, 1); \\\n } \\\n} while (0)\n\n#define NOT_REACHED() ASSERT(0)\n\n#elif HAVE_ASSERT_LOG\n\n#define ASSERT(_x) do { \\\n if (!(_x)) { \\\n dassert(#_x, __FILE__, __LINE__, 0); \\\n } \\\n} while (0)\n\n#define NOT_REACHED() ASSERT(0)\n\n#else\n\n#define ASSERT(_x)\n\n#define NOT_REACHED()\n\n#endif\n\nvoid dassert(const char *cond, const char *file, int line, int panic);\nvoid dstacktrace(int skip_count);\nvoid dstacktrace_fd(int fd);\n\nint _dscnprintf(char *buf, size_t size, const char *fmt, ...);\nint _dvscnprintf(char *buf, size_t size, const char *fmt, va_list args);\nlong long dusec_now(void);\nlong long dmsec_now(void);\nlong long dsec_now(void);\n\n/*\n * A (very) limited version of snprintf\n * @param to Destination buffer\n * @param n Size of destination buffer\n * @param fmt printf() style format string\n * @returns Number of bytes written, including terminating '\\0'\n * Supports 'd' 'i' 'u' 'x' 'p' 's' conversion\n * Supports 'l' and 'll' modifiers for integral types\n * Does not support any width/precision\n * Implemented with simplicity, and async-signal-safety in mind\n */\nint _safe_vsnprintf(char *to, size_t size, const char *format, va_list ap);\nint _safe_snprintf(char *to, size_t n, const char *fmt, ...);\n\n#define dsafe_snprintf(_s, _n, ...) \\\n _safe_snprintf((char *)(_s), (size_t)(_n), __VA_ARGS__)\n\n#define dsafe_vsnprintf(_s, _n, _f, _a) \\\n _safe_vsnprintf((char *)(_s), (size_t)(_n), _f, _a)\n\n/*\n * snprintf(s, n, ...) will write at most n - 1 of the characters printed into\n * the output string; the nth character then gets the terminating `\\0'; if\n * the return value is greater than or equal to the n argument, the string\n * was too short and some of the printed characters were discarded; the output\n * is always null-terminated.\n *\n * Note that, the return value of snprintf() is always the number of characters\n * that would be printed into the output string, assuming n were limited not\n * including the trailing `\\0' used to end output.\n *\n * scnprintf(s, n, ...) is same as snprintf() except, it returns the number\n * of characters printed into the output string not including the trailing '\\0'\n */\n#define dsnprintf(_s, _n, ...) \\\n snprintf((char *)(_s), (size_t)(_n), __VA_ARGS__)\n\n#define dscnprintf(_s, _n, ...) \\\n _dscnprintf((char *)(_s), (size_t)(_n), __VA_ARGS__)\n\n#define dvsnprintf(_s, _n, _f, _a) \\\n vsnprintf((char *)(_s), (size_t)(_n), _f, _a)\n\n#define dvscnprintf(_s, _n, _f, _a) \\\n _dvscnprintf((char *)(_s), (size_t)(_n), _f, _a)\n\n#define dstrftime(_s, _n, fmt, tm) \\\n (int)strftime((char *)(_s), (size_t)(_n), fmt, tm)\n\nint string_match_len(const char *pattern, int patternLen, const char *string, int stringLen, int nocase);\nint string_match(const char *pattern, const char *string, int nocase);\n\n\n/* Atomic API */\n/* GCC version >= 4.7 */\n#if defined(__ATOMIC_RELAXED)\n#define atomic_add(_value, _n) __atomic_add_fetch(&_value, (_n), __ATOMIC_RELAXED)\n#define atomic_sub(_value, _n) __atomic_sub_fetch(&_value, (_n), __ATOMIC_RELAXED)\n#define atomic_set(_value, _n) __atomic_store_n(&_value, (_n), __ATOMIC_RELAXED)\n#define atomic_get(_value, _v) do { \\\n __atomic_load(&_value, _v, __ATOMIC_RELAXED); \\\n} while(0)\n\n#define ATOMIC_LOCK_TYPE \"__ATOMIC_RELAXED\"\n/* GCC version >= 4.1 */\n#elif defined(HAVE_ATOMIC)\n#define atomic_add(_value, _n) __sync_add_and_fetch(&_value, (_n))\n#define atomic_sub(_value, _n) __sync_sub_and_fetch(&_value, (_n))\n#define atomic_set(_value, _n) __sync_lock_test_and_set(&_value, (_n))\n#define atomic_get(_value, _v) do { \\\n (*_v) = __sync_add_and_fetch(&_value, 0); \\\n} while(0)\n\n#define ATOMIC_LOCK_TYPE \"HAVE_ATOMIC\"\n#else\nextern pthread_mutex_t atomic_locker;\n\n#define atomic_add(_value, _n) do { \\\n pthread_mutex_lock(&atomic_locker); \\\n _value += (_n); \\\n pthread_mutex_unlock(&atomic_locker); \\\n} while(0)\n\n#define atomic_sub(_value, _n) do { \\\n pthread_mutex_lock(&atomic_locker); \\\n _value -= (_n); \\\n pthread_mutex_unlock(&atomic_locker); \\\n} while(0)\n\n#define atomic_set(_value, _n) do { \\\n pthread_mutex_lock(&atomic_locker); \\\n _value = (_n); \\\n pthread_mutex_unlock(&atomic_locker); \\\n} while(0)\n\n#define atomic_get(_value, _v) do { \\\n pthread_mutex_lock(&atomic_locker); \\\n (*_v) = _value; \\\n pthread_mutex_unlock(&atomic_locker); \\\n} while(0)\n\n#define ATOMIC_LOCK_TYPE \"pthread_mutex_lock\"\n#endif\n\n#endif\n" }, { "path": "m4/.gitignore", "content": "# Ignore everything\n*\n\n# Except me\n!.gitignore\n" }, { "path": "notes/c-styleguide.txt", "content": "- No literal tabs. Expand tabs to 4 spaces.\n- Indentation is 4 spaces.\n- No more than 3 levels of indentation, otherwise you should think about\n refactoring your code.\n- Use one statement per line.\n- Make sure that your editor does not leave space at the end of the line.\n- snake_case for variable, function and file names.\n- Use your own judgment when naming variables and functions. Be as Spartan\n as possible. Eg: Using name like this_variable_is_a_temporary_counter\n will usually be frowned upon.\n- Don’t use local variables or parameters that shadow global identifiers.\n GCC’s ‘-Wshadow’ option can help you to detect this problem.\n\n- Avoid using int, char, short, long. Instead use int8_t uint8_t, int16_t,\n uint16_t, int32_t, uint32_t, int64_t, uint64_t, which are available in\n . However, when interfacing with system calls and libraries\n you cannot get away from using int and char.\n- Use bool for boolean variables. You have to include \n- Avoid using a bool as type for struct member names. Instead use unsigned\n 1-bit bit field. Eg:\n struct foo {\n unsigned is_bar:1;\n };\n- Always use size_t type when dealing with sizes of objects or memory ranges.\n- Your code should be 64-bit and 32-bit friendly. Bear in mind problems\n of printing, comparisons, and structure alignment. You have to include\n to get generic format specifier macros for printing.\n\n- 80 column line limit.\n- If you have to wrap a long statement (> 80 column), put the operator at the\n end of the line and indent the next line at the same column as the arguments\n in the previous column. Eg:\n while (cnt < 20 && this_variable_name_is_too_long &&\n ep != NULL) {\n z = a + really + long + statement + that + needs + three + lines +\n gets + indented + on + the + same + column + as + the +\n previous + column\n }\n\n and:\n\n int a = function(param_a, param_b, param_c, param_d, param_e, param_f,\n param_g, param_h, param_i, param_j, param_k, param_l);\n\n- Always use braces for all conditional blocks (if, switch, for, while, do).\n This holds good even for single statement conditional blocks. Eg:\n if (cond) {\n stmt;\n }\n- Placement of braces for non-function statement blocks - put opening brace\n last on the line and closing brace first. Eg:\n if (x is true) {\n we do y\n }\n- Placement of brace for functions - put the opening brace at the beginning\n of the next line and closing brace first. This is useful because several\n tools look for opening brace in column one to find beginning of C\n functions. Eg:\nint\nfunction(int x)\n{\n body of the function\n}\n\n- Closing brace is empty on a line of its own, except in cases where it is\n followed by a continuation of the same statement, i.e. a \"while\" in a\n do-statement or an \"else\" in an if-statement, like this:\n do {\n body of do-loop\n } while (condition);\n\n and,\n\n if (x == y) {\n ..\n } else if (x > y) {\n ...\n } else {\n ....\n }\n\n- Column align switch keyword and the corresponding case/default keyword. Eg:\n switch (alphabet) {\n case 'a':\n case 'b':\n printf(\"I am a or b\\n\");\n break;\n\n default:\n break;\n }\n\n- Forever loops are done with for, and not while. Eg:\n for (;;) {\n stmt;\n }\n\n- Don't use a space after a function name.\n- Do not needlessly surround the return expression with parentheses.\n- Use space after keywords. Exceptions are sizeof, typeof, alignof and\n __attribute__, which look like functions.\n- Do not add spaces around (inside) parenthesized expressions.\n s = sizeof( sizeof(*p)) ); /* bad example */\n s = sizeof(sizeof(*p)); /* good example */\n- Casts should not be followed by space. Eg:\n int q = *(int *)&p\n- There is no need to type cast when assigning a void pointer to a non-void\n pointer, or vice versa.\n- Avoid using goto statements. However there are some exceptions to this rule\n when a single goto label within a function and one or more goto statements\n come in handy when a function exits from multiple locations and some common\n work such as cleanup has to be done. Eg:\nint\nfun(void)\n{\n int result = 0;\n char *buffer;\n\n buffer = malloc(1024);\n if (buffer == NULL) {\n return -1;\n }\n\n if (condition1) {\n while (loop1) {\n ...\n }\n result = 1;\n goto out;\n }\n\n ...\nout:\n free(buffer);\n return result;\n}\n- When declaring pointer data, use '*' adjacent to the data name and not\n adjacent to the type name. Eg:\n int\n function(int *p)\n {\n char *p;\n \n }\n- Use one space around (on each side of) most binary and ternary operators,\n such as any of these:\n = + - < > * / % | & ^ <= >= == != ? :\n but no space after unary operators:\n & * + - ~ ! sizeof typeof alignof __attribute__ defined\n no space before the postfix increment & decrement unary operators:\n ++ --\n and no space around the '.' and \"->\" structure member operators.\n\n- 0 and NULL; use 0 for integers, 0.0 for doubles, NULL for pointers, and\n '\\0' for chars.\n- Test pointers against NULL. E.g, use:\n if (p == NULL)\n\n not:\n\n !(p)\n\n- Do not use ! for tests unless it is a boolean. E.g. use:\n if (*p == '\\0')\n\n not:\n\n if (!*p)\n\n- Don't use assignments inside if or while-conditions. E.g, use:\n\n struct foo *foo;\n foo = malloc(sizeof(*foo));\n if (foo == NULL) {\n return -1\n }\n\n not:\n\n struct foo *foo;\n if ((foo = malloc(sizeof(*foo))) == NULL) {\n return -1;\n }\n\n- Don't ever use typedef for structure types. Typedefs are problematic\n because they do not properly hide their underlying type; for example you\n need to know if the typedef is the structure itself or a pointer to the\n structure. In addition they must be declared exactly once, whereas an\n incomplete structure type can be mentioned as many times as necessary.\n Typedefs are difficult to use in stand-alone header files: the header\n that defines the typedef must be included before the header that uses it,\n or by the header that uses it (which causes namespace pollution), or\n there must be a back-door mechanism for obtaining the typedef.\n- The only exception for using a typedef is when you are defining a type\n for a function pointer or a type for an enum. Eg:\n\n typedef void (*foo_handler_t)(int, void *);\n\n or:\n\n typedef enum types {\n TYPE_1,\n TYPE_2\n } types_t;\n\n- Use just one variable declaration per line when variables are part of a\n struct. This leaves you room for a small comment on each item, explaining\n its use. Declarations should also be aligned. Eg, use:\n\n struct foo {\n int *foo_a; /* comment for foo_a */\n int foo_b; /* comment for foo_b */\n unsigned foo_c:1; /* comment for foo_c */\n };\n\n and not:\n\n struct foo {\n int *foo_a, foo_b;\n unsigned foo_c:1;\n };\n\n- For variable declaration outside a struct, either collect all the\n declarations of the same type on a single line, or use one variable\n per line if the variables purpose needs to be commented. Eg:\n char *a, *b, c;\n\n or:\n\n char *a, *b;\n char c; /* comments for c */\n\n- Avoid magic numbers because no-one has a clue (including the author) of\n what it means after a month.\n\n- Function definitions should start the name of the function in column\n one. This is useful because it makes searching for function definitions\n fairly trivial. Eg:\nstatic char *\nconcat(char *s1, char *s2)\n{\n body of the function\n}\n\n- Function and variables local to a file should be static.\n- Separate two successive functions with one blank line.\n- Include parameter names with their datypes in function declaration. Eg:\nvoid function(int param);\n\n- Functions should be short and sweet, and do just one thing. They should\n fit on one or two screenfuls of text (80 x 24 screen size), and do one\n thing and do that well.\n The maximum length of a function is inversely proportional to the\n complexity and indentation level of that function. So, if you have a\n conceptually simple function that is just one long (but simple)\n case-statement, where you have to do lots of small things for a lot of\n different cases, it's OK to have a longer function.\n Another measure of the function is the number of local variables. They\n shouldn't exceed 5-10, or you're doing something wrong. Re-think the\n function, and split it into smaller pieces. A human brain can\n generally easily keep track of about 7 different things, anything more\n and it gets confused. You know you're brilliant, but maybe you'd like\n to understand what you did 2 weeks from now.\n- Use const for function parameters passed by reference, if the passed\n pointer has no side effect.\n\n- C style comments only. Don't use // for single line comments. Instead\n use /* ... */ style.\n- For multi-line comments use the following style\n /*\n * This is the preferred style for multi-line\n * comments in the Linux kernel source code.\n * Please use it consistently.\n *\n * Description: A column of asterisks on the left side,\n * with beginning and ending almost-blank lines.\n */\n\n- To comment out block of code spanning several lines use preprocessor\n directive \"#ifdef 0 ... #endif\"\n\n- Please write a brief comment at the start of each source file, with the\n file name and a line or two about the overall purpose of the file.\n\n- All major functions should have comments describing what they do at the\n head of the function. Avoid putting comments in the function body unless\n absolutely needed. If possible, add a comment on what sorts of arguments\n the function gets, and what the possible values of arguments mean and\n what they are used for and the significance of return value if there is\n one. It is not necessary to duplicate in words the meaning of the C\n argument declarations, if a C type is being used in its customary fashion.\n If there is anything nonstandard about its use (such as an argument of\n type char * which is really the address of the second character of a\n string, not the first), or any possible values that would not work the\n way one would expect (such as, that strings containing newlines are not\n guaranteed to work), be sure to say so. Eg:\n\n/*\n * Try to acquire a physical address lock while a pmap is locked. If we\n * fail to trylock we unlock and lock the pmap directly and cache the\n * locked pa in *locked. The caller should then restart their loop in case\n * the virtual to physical mapping has changed.\n *\n * Returns 0 on success and -1 on failure.\n */\nint\nvm_page_pa_tryrelock(pmap_t pmap, vm_paddr_t pa, vm_paddr_t *locked)\n{\n ...\n\n- The comment on a function is much clearer if you use the argument names\n to speak about the argument values. The variable name itself should be\n lower case, but write it in upper case when you are speaking about the\n value rather than the variable itself. Thus, “the inode number NODE_NUM”\n rather than “an inode”.\n\n- Every struct definition should have an accompanying comment that\n describes what it is for and how it should be used.\n\n- Finally, while comments are absolutely important to keep the code readable,\n remember that the best code is self-documenting. Giving sensible names to\n types and variables is much better than using obscure names that you must\n then explain through comments.\n\n- Recommend using UPPERCASE for macro names. However, sometimes using\n lowercase for macro names makes sense when macros masquerade as well-known\n function calls. Eg, it makes sense to write the wrapper for the\n standard free() function in lowercase to keep the readability\n consistent:\n\n#define my_free(_p) do { \\\n free(_p); \\\n (_p) = NULL; \\\n} while (0)\n\n- Use enums when defining more than one related constants. All enumeration\n values are in UPPERCASE.\n- Avoid macros as much as possible and use inline functions, enums and const\n variables wherever you can.\n- For macros encapsulating compound statements, right justify the backslashes\n and enclose it in do { ... } while (0)\n- For parameterized macros, all the parameters used in the macro body must\n be surrounded by parentheses. Eg:\n #define ADD_1(_x) ((_x) + 1)\n\n- Use sizeof(varname) instead of sizeof(type) whenever possible. Eg:\n char *p;\n p = malloc(sizeof(*p)); /* good example */\n p = malloc(sizeof(char)); /* bad example */\n\n- All variables should be declared at the beginning of a scope block {..}.\n It is even preferred to declare all variables at the beginning of the\n function so that all the local variable declarations is in one place and\n we can see the comprehensive list in one glance.\n- Global structs should be declared at the top of the file in which they\n are used, or in separate header files if they are used in multiple\n source files.\n- Declarations of external functions and functions to appear later in the\n source file should all go in one place near the beginning of the file,\n somewhere before the first function definition in the file or else\n should go in a header file.\n- Use of extern should be considered as evil, if it is used in header files\n to reference global variables.\n- Don’t put extern declarations inside functions.\n\n- Usually every *.c file should have an associated *.h file. There are some\n exceptions to this rule, such as unit tests and small *.c files containing\n just the main() function.\n- Every header file in the source code must have preprocessor conditional\n to prevent the header file from being scanned multiple times and avoiding\n mutual dependency cycles. Alternatively you can use #pragma once directive,\n as it avoids name clashes and increases the compile speed. Eg, for a\n header file named foo.h, the entire contents of the header file must be\n between the guard macros as follows:\n\n#ifndef _FOO_H_\n#define _FOO_H_\n...\n#endif /* _FOO_H_ */\n\nOr,\n\n#pragma once\n#ifndef _FOO_H_\n#define _FOO_H_\n...\n#endif /* _FOO_H_ */\n\n- Don't use #include when a forward declaration would suffice.\n- Functions defined in header files should be static inline.\n\n- Don’t make the program ugly just to placate GCC when extra warnings options\n such as ‘-Wconversion’ or ‘-Wundef’ are used. These options can help in\n finding bugs, but they can also generate so many false alarms that that\n it hurts readability to silence them with unnecessary casts, wrappers, and\n other complications.\n\n- Conditional compilation: when supporting configuration options already\n known when building your program we prefer using if (... ) over conditional\n compilation, as in the former case the compiler is able to perform more\n extensive checking of all possible code paths. Eg, use:\n\n if (HAS_FOO)\n ...\n else\n ...\n\ninstead of:\n\n #ifdef HAS_FOO\n ...\n #else\n ...\n #endif\n\n A modern compiler such as GCC will generate exactly the same code in both\n cases and of course, the former method assumes that HAS_FOO is defined as\n either 0 or 1.\n\n- Finally, rules are rules. Sometimes they are sensible and sometimes not\n and regardless of your preference, we would like you to follow them.\n A project is easier to follow if all project contributors follow the style\n rules so that they can all read and understand everyone's code easily. But\n remember, like all good rules, they are exceptions where it makes sense not\n to be too rigid on the grounds of common sense and consistency!\n" }, { "path": "notes/debug.txt", "content": "- strace\n strace -o strace.txt -ttT -s 1024 -p `pgrep nutcracker`\n\n- libyaml (yaml-0.1.4)\n\n - yaml tokens:\n\n 0 YAML_NO_TOKEN,\n 1 YAML_STREAM_START_TOKEN,\n 2 YAML_STREAM_END_TOKEN,\n 3 YAML_VERSION_DIRECTIVE_TOKEN,\n 4 YAML_TAG_DIRECTIVE_TOKEN,\n 5 YAML_DOCUMENT_START_TOKEN,\n 6 YAML_DOCUMENT_END_TOKEN,\n 7 YAML_BLOCK_SEQUENCE_START_TOKEN,\n 8 YAML_BLOCK_MAPPING_START_TOKEN,\n 9 YAML_BLOCK_END_TOKEN,\n 10 YAML_FLOW_SEQUENCE_START_TOKEN,\n 11 YAML_FLOW_SEQUENCE_END_TOKEN,\n 12 YAML_FLOW_MAPPING_START_TOKEN,\n 13 YAML_FLOW_MAPPING_END_TOKEN,\n 14 YAML_BLOCK_ENTRY_TOKEN,\n 15 YAML_FLOW_ENTRY_TOKEN,\n 16 YAML_KEY_TOKEN,\n 17 YAML_VALUE_TOKEN,\n 18 YAML_ALIAS_TOKEN,\n 19 YAML_ANCHOR_TOKEN,\n 20 YAML_TAG_TOKEN,\n 21 YAML_SCALAR_TOKEN\n\n - yaml events\n\n 0 YAML_NO_EVENT,\n 1 YAML_STREAM_START_EVENT,\n 2 YAML_STREAM_END_EVENT,\n 3 YAML_DOCUMENT_START_EVENT,\n 4 YAML_DOCUMENT_END_EVENT,\n 5 YAML_ALIAS_EVENT,\n 6 YAML_SCALAR_EVENT,\n 7 YAML_SEQUENCE_START_EVENT,\n 8 YAML_SEQUENCE_END_EVENT,\n 9 YAML_MAPPING_START_EVENT,\n 10 YAML_MAPPING_END_EVENT\n\n- sys/queue.h\n\n queue.h is a generic linked list library adapted from BSD. It has three\n macro knobs that are useful for debugging:\n\n - QUEUE_MACRO_SCRUB nullifies links (next and prev pointers) of deleted\n elements and catches cases where we are attempting to do operations\n on an element that has already been unlinked.\n - QUEUE_MACRO_TRACE keeps track of __FILE__ and __LINE__ of last two\n updates to the list data structure.\n - QUEUE_MACRO_ASSERT verifies the sanity of list data structure on every\n operation.\n\n- valgrind\n valgrind --tool=memcheck --leak-check=yes \n\n- Core dump\n ulimit -c unlimited\n\n- Generate ENOMEM to test \"Out of Memory\"\n ulimit -m # limit maximum memory size\n ulimit -v # limit virtual memory\n\n- get nutcracker stats\n printf \"\" | socat - TCP:localhost:22222 | tee stats.txt\n printf \"\" | nc localhost 22222 | python -mjson.tool\n\n- Signalling and Logging\n SIGTTIN - To up the log level\n SIGTTOU - To down the log level\n SIGHUP - To reopen log file\n\n- Error codes:\n http://www.cs.utah.edu/dept/old/texinfo/glibc-manual-0.02/library_2.html\n /usr/include/asm-generic/errno-base.h\n /usr/include/asm-generic/errno.h\n\n- epoll (linux)\n\n union epoll_data {\n void *ptr;\n int fd;\n uint32_t u32;\n uint64_t u64;\n };\n\n struct epoll_event {\n uint32_t events; /* epoll events */\n struct epoll_data data; /* user data variable */\n };\n\n /* events */\n EPOLLIN = 0x001,\n EPOLLPRI = 0x002,\n EPOLLOUT = 0x004,\n EPOLLERR = 0x008,\n EPOLLHUP = 0x010,\n EPOLLRDNORM = 0x040,\n EPOLLRDBAND = 0x080,\n EPOLLWRNORM = 0x100,\n EPOLLWRBAND = 0x200,\n EPOLLMSG = 0x400,\n EPOLLRDHUP = 0x2000,\n EPOLLONESHOT = (1 << 30),\n EPOLLET = (1 << 31)\n\n /* opcodes */\n EPOLL_CTL_ADD = 1 /* add a file decriptor to the interface */\n EPOLL_CTL_DEL = 2 /* remove a file decriptor from the interface */\n EPOLL_CTL_MOD = 3 /* change file decriptor epoll_event structure */\n\n- kqueue (bsd)\n\n struct kevent {\n uintptr_t ident; /* identifier for this event */\n int16_t filter; /* filter for event */\n uint16_t flags; /* general flags */\n uint32_t fflags; /* filter-specific flags */\n intptr_t data; /* filter-specific data */\n void *udata; /* opaque user data identifier */\n };\n\n /* flags / events */\n EV_ADD = 0x0001 /* action - add event to kq (implies enable) */\n EV_DELETE = 0x0002 /* action - delete event from kq */\n EV_ENABLE = 0x0004 /* action - enable event */\n EV_DISABLE = 0x0008 /* action - disable event (not reported) */\n EV_RECEIPT = 0x0040 /* action - force EV_ERROR on success, data == 0 */\n\n EV_ONESHOT = 0x0010 /* flags - only report one occurrence */\n EV_CLEAR = 0x0020 /* flags - clear event state after reporting */\n EV_DISPATCH = 0x0080 /* flags - disable event after reporting */\n EV_SYSFLAGS = 0xF000 /* flags - reserved by system */\n EV_FLAG0 = 0x1000 /* flags - filter-specific flag */\n EV_FLAG1 = 0x2000 /* flags - filter-specific flag */\n\n EV_EOF = 0x8000 /* returned values - EOF detected */\n EV_ERROR = 0x4000 /* returned values - error, data contains errno */\n\n /* filters */\n EVFILT_READ (-1) /* readable */\n EVFILT_WRITE (-2) /* writable */\n EVFILT_AIO (-3) /* attached to aio requests */\n EVFILT_VNODE (-4) /* attached to vnodes */\n EVFILT_PROC (-5) /* attached to struct proc */\n EVFILT_SIGNAL (-6) /* attached to struct proc */\n EVFILT_TIMER (-7) /* timers */\n EVFILT_MACHPORT (-8) /* mach portsets */\n EVFILT_FS (-9) /* filesystem events */\n EVFILT_USER (-10) /* user events */\n EVFILT_VM (-12) /* virtual memory events */\n\n EV_CLEAR behaves like EPOLLET because it resets the event after it is\n returned; without this flag, the event would be repeatedly returned.\n\n- poll (unix)\n\n POLLIN 0x001 /* there is data to read */\n POLLPRI 0x002 /* there is urgent data to read */\n POLLOUT 0x004 /* writing now will not block */\n\n POLLRDNORM 0x040 /* normal data may be read */\n POLLRDBAND 0x080 /* priority data may be read */\n POLLWRNORM 0x100 /* writing now will not block */\n POLLWRBAND 0x200 /* priority data may be written */\n\n POLLMSG 0x400\n POLLREMOVE 0x1000\n POLLRDHUP 0x2000\n\n POLLERR\t 0x008 /* error condition */\n POLLHUP 0x010 /* hung up */\n POLLNVAL 0x020 /* invalid polling request */\n\n- event ports (solaris)\n\n typedef struct port_event {\n int portev_events; /* event data is source specific */\n ushort_t portev_source; /* event source */\n ushort_t portev_pad; /* port internal use */\n uintptr_t portev_object; /* source specific object */\n void *portev_user; /* user cookie */\n } port_event_t;\n\n /* port sources */\n PORT_SOURCE_AIO 1\n PORT_SOURCE_TIMER 2\n PORT_SOURCE_USER 3\n PORT_SOURCE_FD 4\n PORT_SOURCE_ALERT 5\n PORT_SOURCE_MQ 6\n PORT_SOURCE_FILE 7\n" }, { "path": "notes/socket.txt", "content": "- int listen(int sockfd, int backlog);\n\n Linux: The backlog argument defines the maximum length to which the\n queue of pending connections for sockfd may grow. If a connection\n request arrives when the queue is full, the client may receive an error\n with an indication of ECONNREFUSED or, if the underlying protocol\n supports retransmission, the request may be ignored so that a later\n reattempt at connection succeeds.\n\n backlog specifies the queue length for completely established sockets\n waiting to be accepted, instead of the number of incomplete connection\n requests. The maximum length of the queue for incomplete sockets can\n be set using /proc/sys/net/ipv4/tcp_max_syn_backlog.\n\n If the backlog argument is greater than the value in /proc/sys/net/core/somaxconn,\n then it is silently truncated to that value; the default value in this\n file is 128. In kernels before 2.4.25, this limit was a hard coded value,\n SOMAXCONN, with the value 128.\n\n BSD: The backlog argument defines the maximum length the queue of pending\n connections may grow to. The real maximum queue length will be 1.5 times\n more than the value specified in the backlog argument. A subsequent\n listen() system call on the listening socket allows the caller to change\n the maximum queue length using a new backlog argument. If a connection\n request arrives with the queue full the client may receive an error with\n an indication of ECONNREFUSED, or, in the case of TCP, the connection\n will be silently dropped.\n\n The listen() system call appeared in 4.2BSD. The ability to configure\n the maximum backlog at run-time, and to use a negative backlog to request\n the maximum allowable value, was introduced in FreeBSD 2.2.\n\n- SO_LINGER (linger) socket option\n\n This option specifies what should happen when the socket of a type that\n promises reliable delivery still has untransmitted messages when it is\n closed\n\n struct linger {\n int l_onoff; /* nonzero to linger on close */\n int l_linger; /* time to linger (in secs) */\n };\n\n l_onoff = 0 (default), then l_linger value is ignored and close returns\n immediately. But if there is any data still remaining in the socket send\n buffer, the system will try to deliver the data to the peer\n\n l_onoff = nonzero, then close blocks until data is transmitted or the\n l_linger timeout period expires\n a) l_linger = 0, TCP aborts connection, discards any data still remaining\n in the socket send buffer and sends RST to peer. This avoids the\n TCP's TIME_WAIT state\n b) l_linger = nonzero, then kernel will linger when socket is closed. If\n there is any pending data in the socket send buffer, the kernel waits\n until all the data is sent and acknowledged by peer TCP, or the\n linger time expires\n\n If a socket is set as nonblocking, it will not wait for close to complete\n even if linger time is nonzero\n\n- TIME_WAIT state\n\n The end that performs active close i.e. the end that sends the first FIN\n goes into TIME_WAIT state. After a FIN packet is sent to the peer and\n after that peers FIN/ACK arrvies and is ACKed, we go into a TIME_WAIT\n state. The duration that the end point remains in this state is 2 x MSL\n (maximum segment lifetime). The reason that the duration of the TIME_WAIT\n state is 2 x MSL is because the maximum amount of time a packet can wander\n around a network is assumed to be MSL seconds. The factor of 2 is for the\n round-trip. The recommended value for MSL is 120 seconds, but Berkeley\n derived implementations normally use 30 seconds instead. This means a\n TIME_WAIT delay is between 1 and 4 minutes.\n\n For Linux, the TIME_WAIT state duration is 1 minute (net/tcp.h):\n #define TCP_TIMEWAIT_LEN (60*HZ) /* how long to wait to destroy TIME-WAIT\n * state, about 60 seconds */\n\n TIME_WAIT state on client, combined with limited number of ephermeral ports\n available for TCP connections severely limits the rate at which new\n connections to the server can be created. On Linux, by default ephemeral\n ports are in the range of 32768 to 61000:\n\n $ cat /proc/sys/net/ipv4/ip_local_port_range\n 32768 61000\n\n So with a TIME_WAIT state duration of 1 minute, the maximum sustained rate\n for any client is ~470 new connections per second\n\n- TCP keepalive\n\n TCP keepalive packet (TCP packet with no data and the ACK flag turned on)\n is used to assert that connection is still up and running. This is useful\n because if the remote peer goes away without closing their connection, the\n keepalive probe will detect this and notice that the connection is broken\n even if there is no traffic on it.\n\n Imagine, the following scenario: You have a valid TCP connection established\n between two endpoints A and B. B terminates abnormally (think kernel panic\n or unplugging of network cable) without sending anything over the network\n to notify A that connection is broken. A, from its side, is ready to\n receive data, and has no idea that B has gone away. Now B comes back up\n again, and while A knows about a connection with B and still thinks that it\n active, B has no such idea. A tries to send data to B over a dead\n connection, and B replies with an RST packet, causing A to finally close\n the connection. So, without a keepalive probe A would never close the\n connection if it never sent data over it.\n\n- There are four socket functions that pass a socket address structure from\n the process to the kernel - bind, connect, sendmsg and sendto. These\n function are also responsible for passing the length of the sockaddr that\n they are passing (socklen_t).\n There are five socket functions that pass a socket from the kernel to the\n process - accept, recvfrom, recvmsg, getpeername, getsockname. The kernel\n is also responsible for returning the length of the sockaddr struct that\n it returns back to the userspace\n\n Different sockaddr structs:\n 1. sockaddr_in\n 2. sockaddr_in6\n 3. sockaddr_un\n\n Special types of in_addr_t\n /* Address to accept any incoming messages */\n #define INADDR_ANY ((in_addr_t) 0x00000000)\n\n /* Address to send to all hosts */\n #define INADDR_BROADCAST ((in_addr_t) 0xffffffff)\n\n /* Address indicating an error return */\n #define INADDR_NONE ((in_addr_t) 0xffffffff)\n\n" }, { "path": "scripts/.gitignore", "content": "*.pyc\n*.out\n*.log\n" }, { "path": "src/Makefile.am", "content": "MAINTAINERCLEANFILES = Makefile.in\n\nAM_CPPFLAGS =\nif !OS_SOLARIS\nAM_CPPFLAGS += -D_GNU_SOURCE\nendif\nAM_CPPFLAGS += -I $(top_srcdir)/dep/dhashkit\nAM_CPPFLAGS += -I $(top_srcdir)/dep/ae\nAM_CPPFLAGS += -I $(top_srcdir)/dep/util\nAM_CPPFLAGS += -I $(top_srcdir)/dep/jemalloc-4.2.0/include\nAM_CPPFLAGS += -I $(top_srcdir)/dep/dmalloc\nAM_CPPFLAGS += -I $(top_srcdir)/dep/sds\nAM_CPPFLAGS += -I $(top_srcdir)/dep/darray\nAM_CPPFLAGS += -I $(top_srcdir)/dep/dlist\n\nAM_CFLAGS = \nAM_CFLAGS += -fno-strict-aliasing\nAM_CFLAGS += -Wall -Wshadow\nAM_CFLAGS += -Wpointer-arith\nAM_CFLAGS += -Winline\nAM_CFLAGS += -Wunused-function -Wunused-variable -Wunused-value\nAM_CFLAGS += -Wno-unused-parameter -Wno-unused-value\nAM_CFLAGS += -Wconversion -Wsign-compare\nAM_CFLAGS += -Wstrict-prototypes -Wmissing-prototypes -Wredundant-decls -Wmissing-declarations\n\nAM_LDFLAGS =\nAM_LDFLAGS += -lm -lpthread -rdynamic\nif !OS_DARWIN\nAM_LDFLAGS += -lrt\nendif\nif OS_SOLARIS\nAM_LDFLAGS += -lnsl -lsocket\nendif\nif OS_FREEBSD\nAM_LDFLAGS += -lexecinfo\nendif\n\nsbin_PROGRAMS = vire\n\nvire_SOURCES = \\\n vr_aof.c vr_aof.h \\\n vr_block.c vr_block.h \\\n vr_client.c vr_client.h \\\n vr_command.c vr_command.h \\\n vr_conf.c vr_conf.h \\\n vr_connection.c vr_connection.h \\\n vr_core.c vr_core.h \\\n vr_db.c vr_db.h \\\n vr_dict.c vr_dict.h \\\n vr_eventloop.c vr_eventloop.h \\\n vr_intset.c vr_intset.h \\\n vr_listen.c vr_listen.h \\\n vr_lzf.h vr_lzfP.h \\\n vr_lzf_c.c vr_lzf_d.c \\\n vr_master.c vr_master.h \\\n vr_multi.c vr_multi.h \\\n vr_notify.c vr_notify.h \\\n vr_object.c vr_object.h \\\n vr_pubsub.c vr_pubsub.h \\\n vr_quicklist.c vr_quicklist.h \\\n vr_rbtree.c vr_rbtree.h \\\n vr_rdb.c vr_rdb.h \\\n vr_replication.c vr_replication.h \\\n vr_scripting.c vr_scripting.h \\\n vr_server.c vr_server.h \\\n vr_signal.c vr_signal.h \\\n vr_slowlog.c vr_slowlog.h \\\n vr_specialconfig.h \\\n vr_stats.c vr_stats.h \\\n vr_thread.c vr_thread.h \\\n vr_t_hash.c vr_t_hash.h \\\n vr_t_list.c vr_t_list.h \\\n vr_t_set.c vr_t_set.h \\\n vr_t_string.c vr_t_string.h \\\n vr_t_zset.c vr_t_zset.h \\\n vr_util.c vr_util.h \\\n vr_worker.c vr_worker.h \\\n vr_backend.c vr_backend.h \\\n vr_ziplist.c vr_ziplist.h \\\n vr_zipmap.c vr_zipmap.h \\\n vr_bitops.c vr_bitops.h \\\n vr_hyperloglog.c vr_hyperloglog.h \\\n vr.c\n \nvire_LDADD = $(top_builddir)/dep/util/libdutil.a\nvire_LDADD += $(top_builddir)/dep/ae/libae.a\nvire_LDADD += $(top_builddir)/dep/sds/libsds.a\nvire_LDADD += $(top_builddir)/dep/darray/libdarray.a\nvire_LDADD += $(top_builddir)/dep/dlist/libdlist.a\nvire_LDADD += $(top_builddir)/dep/dhashkit/libdhashkit.a\nvire_LDADD += $(top_builddir)/dep/jemalloc-4.2.0/lib/libjemalloc.a\nvire_LDADD += $(top_builddir)/dep/dmalloc/libdmalloc.a" }, { "path": "src/vr.c", "content": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n\n#define VR_CONF_PATH \"conf/vire.conf\"\n\n#define VR_LOG_DEFAULT LOG_NOTICE\n#define VR_LOG_MIN LOG_EMERG\n#define VR_LOG_MAX LOG_PVERB\n#define VR_LOG_PATH NULL\n\n#define VR_PORT 8889\n#define VR_ADDR \"0.0.0.0\"\n#define VR_INTERVAL (30 * 1000) /* in msec */\n\n#define VR_PID_FILE NULL\n\n#define VR_THREAD_NUM_DEFAULT\t(sysconf(_SC_NPROCESSORS_ONLN)>6?6:sysconf(_SC_NPROCESSORS_ONLN))\n\nstatic int show_help;\nstatic int show_version;\nstatic int test_conf;\nstatic int daemonize;\n\nstatic struct option long_options[] = {\n { \"help\", no_argument, NULL, 'h' },\n { \"version\", no_argument, NULL, 'V' },\n { \"test-conf\", no_argument, NULL, 't' },\n { \"daemonize\", no_argument, NULL, 'd' },\n { \"verbose\", required_argument, NULL, 'v' },\n { \"output\", required_argument, NULL, 'o' },\n { \"conf-file\", required_argument, NULL, 'c' },\n { \"pid-file\", required_argument, NULL, 'p' },\n { \"thread-num\", required_argument, NULL, 'T' },\n { NULL, 0, NULL, 0 }\n};\n\nstatic char short_options[] = \"hVtdv:o:c:p:T:\";\n\nstatic rstatus_t\nvr_daemonize(int dump_core)\n{\n rstatus_t status;\n pid_t pid, sid;\n int fd;\n\n pid = fork();\n switch (pid) {\n case -1:\n log_error(\"fork() failed: %s\", strerror(errno));\n return VR_ERROR;\n\n case 0:\n break;\n\n default:\n /* parent terminates */\n _exit(0);\n }\n\n /* 1st child continues and becomes the session leader */\n\n sid = setsid();\n if (sid < 0) {\n log_error(\"setsid() failed: %s\", strerror(errno));\n return VR_ERROR;\n }\n\n if (signal(SIGHUP, SIG_IGN) == SIG_ERR) {\n log_error(\"signal(SIGHUP, SIG_IGN) failed: %s\", strerror(errno));\n return VR_ERROR;\n }\n\n pid = fork();\n switch (pid) {\n case -1:\n log_error(\"fork() failed: %s\", strerror(errno));\n return VR_ERROR;\n\n case 0:\n break;\n\n default:\n /* 1st child terminates */\n _exit(0);\n }\n\n /* 2nd child continues */\n\n /* change working directory */\n if (dump_core == 0) {\n status = chdir(\"/\");\n if (status < 0) {\n log_error(\"chdir(\\\"/\\\") failed: %s\", strerror(errno));\n return VR_ERROR;\n }\n }\n\n /* clear file mode creation mask */\n umask(0);\n\n /* redirect stdin, stdout and stderr to \"/dev/null\" */\n\n fd = open(\"/dev/null\", O_RDWR);\n if (fd < 0) {\n log_error(\"open(\\\"/dev/null\\\") failed: %s\", strerror(errno));\n return VR_ERROR;\n }\n\n status = dup2(fd, STDIN_FILENO);\n if (status < 0) {\n log_error(\"dup2(%d, STDIN) failed: %s\", fd, strerror(errno));\n close(fd);\n return VR_ERROR;\n }\n\n status = dup2(fd, STDOUT_FILENO);\n if (status < 0) {\n log_error(\"dup2(%d, STDOUT) failed: %s\", fd, strerror(errno));\n close(fd);\n return VR_ERROR;\n }\n\n status = dup2(fd, STDERR_FILENO);\n if (status < 0) {\n log_error(\"dup2(%d, STDERR) failed: %s\", fd, strerror(errno));\n close(fd);\n return VR_ERROR;\n }\n\n if (fd > STDERR_FILENO) {\n status = close(fd);\n if (status < 0) {\n log_error(\"close(%d) failed: %s\", fd, strerror(errno));\n return VR_ERROR;\n }\n }\n\n return VR_OK;\n}\n\nstatic void\nvr_print_run(struct instance *nci)\n{\n int status;\n struct utsname name;\n\n status = uname(&name);\n\n if (nci->log_filename) {\n char *ascii_logo =\n\" _._ \\n\"\n\" _.-``__ ''-._ \\n\"\n\" _.-`` `. *_. ''-._ Vire %s %s bit\\n\"\n\" .-`` .-```. ```\\-/ _.,_ ''-._ \\n\"\n\" ( | | .-` `, ) Running in %s mode\\n\"\n\" |`-._`-...-` __...-.``-._;'` _.-'| Port: %d\\n\"\n\" | `-._ `._ / _.-' | PID: %ld\\n\"\n\" `-._ `-._ `-./ _.-' _.-' OS: %s %s %s\\n\"\n\" |`-._`-._ `-.__.-' _.-'_.-'| \\n\"\n\" | `-._`-._ _.-'_.-' | https://github.com/vipshop/vire\\n\"\n\" `-._ `-._`-.__.-'_.-' _.-' \\n\"\n\" |`-._`-._ `-.__.-' _.-'_.-'| \\n\"\n\" | `-._`-._ _.-'_.-' | \\n\"\n\" `-._ `-._`-.__.-'_.-' _.-' \\n\"\n\" `-._ `-.__.-' _.-' \\n\"\n\" `-._ _.-' \\n\"\n\" `-.__.-' \\n\\n\";\n char *buf = dalloc(1024*16);\n snprintf(buf,1024*16,ascii_logo,\n VR_VERSION_STRING,\n (sizeof(long) == 8) ? \"64\" : \"32\",\n \"standalone\", server.port,\n (long) nci->pid,\n status < 0 ? \" \":name.sysname,\n status < 0 ? \" \":name.release,\n status < 0 ? \" \":name.machine);\n log_write_len(buf, strlen(buf));\n dfree(buf);\n }else {\n char buf[256];\n snprintf(buf,256,\"Vire %s, %s bit, %s mode, port %d, pid %ld, built for %s %s %s ready to run.\\n\",\n VR_VERSION_STRING, (sizeof(long) == 8) ? \"64\" : \"32\",\n \"standalone\", server.port, (long) nci->pid,\n status < 0 ? \" \":name.sysname,\n status < 0 ? \" \":name.release,\n status < 0 ? \" \":name.machine);\n log_write_len(buf, strlen(buf));\n }\n}\n\nstatic void\nvr_print_done(void)\n{\n loga(\"done, rabbit done\");\n}\n\nstatic void\nvr_show_usage(void)\n{\n log_stderr(\n \"Usage: vire [-?hVdt] [-v verbosity level] [-o output file]\" CRLF\n \" [-c conf file] [-p pid file]\" CRLF\n \" [-T worker threads number]\" CRLF\n \"\");\n log_stderr(\n \"Options:\" CRLF\n \" -h, --help : this help\" CRLF\n \" -V, --version : show version and exit\" CRLF\n \" -t, --test-conf : test configuration for syntax errors and exit\" CRLF\n \" -d, --daemonize : run as a daemon\");\n log_stderr(\n \" -v, --verbose=N : set logging level (default: %d, min: %d, max: %d)\" CRLF\n \" -o, --output=S : set logging file (default: %s)\" CRLF\n \" -c, --conf-file=S : set configuration file (default: %s)\" CRLF\n \" -p, --pid-file=S : set pid file (default: %s)\" CRLF\n \" -T, --thread_num=N : set the worker threads number (default: %d)\" CRLF\n \"\",\n VR_LOG_DEFAULT, VR_LOG_MIN, VR_LOG_MAX,\n VR_LOG_PATH != NULL ? VR_LOG_PATH : \"stderr\",\n VR_CONF_PATH,\n VR_PID_FILE != NULL ? VR_PID_FILE : \"off\",\n VR_THREAD_NUM_DEFAULT);\n}\n\nstatic rstatus_t\nvr_create_pidfile(struct instance *nci)\n{\n char pid[VR_UINTMAX_MAXLEN];\n int fd, pid_len;\n ssize_t n;\n\n fd = open(nci->pid_filename, O_WRONLY | O_CREAT | O_TRUNC, 0644);\n if (fd < 0) {\n log_error(\"opening pid file '%s' failed: %s\", nci->pid_filename,\n strerror(errno));\n return VR_ERROR;\n }\n nci->pidfile = 1;\n\n pid_len = dsnprintf(pid, VR_UINTMAX_MAXLEN, \"%d\", nci->pid);\n\n n = vr_write(fd, pid, pid_len);\n if (n < 0) {\n log_error(\"write to pid file '%s' failed: %s\", nci->pid_filename,\n strerror(errno));\n return VR_ERROR;\n }\n\n close(fd);\n\n return VR_OK;\n}\n\nstatic void\nvr_remove_pidfile(struct instance *nci)\n{\n int status;\n\n status = unlink(nci->pid_filename);\n if (status < 0) {\n log_error(\"unlink of pid file '%s' failed, ignored: %s\",\n nci->pid_filename, strerror(errno));\n }\n}\n\nstatic void\nvr_set_default_options(struct instance *nci)\n{\n int status;\n\n nci->log_level = VR_LOG_DEFAULT;\n nci->log_filename = VR_LOG_PATH;\n\n nci->conf_filename = VR_CONF_PATH;\n\n status = vr_gethostname(nci->hostname, VR_MAXHOSTNAMELEN);\n if (status < 0) {\n log_warn(\"gethostname failed, ignored: %s\", strerror(errno));\n dsnprintf(nci->hostname, VR_MAXHOSTNAMELEN, \"unknown\");\n }\n nci->hostname[VR_MAXHOSTNAMELEN - 1] = '\\0';\n\n nci->pid = (pid_t)-1;\n nci->pid_filename = NULL;\n nci->pidfile = 0;\n\n nci->thread_num = (int)VR_THREAD_NUM_DEFAULT;\n}\n\nstatic rstatus_t\nvr_get_options(int argc, char **argv, struct instance *nci)\n{\n int c, value;\n\n opterr = 0;\n\n for (;;) {\n c = getopt_long(argc, argv, short_options, long_options, NULL);\n if (c == -1) {\n /* no more options */\n break;\n }\n\n switch (c) {\n case 'h':\n show_version = 1;\n show_help = 1;\n break;\n\n case 'V':\n show_version = 1;\n break;\n\n case 't':\n test_conf = 1;\n break;\n\n case 'd':\n daemonize = 1;\n break;\n\n case 'v':\n value = vr_atoi(optarg, strlen(optarg));\n if (value < 0) {\n log_stderr(\"vire: option -v requires a number\");\n return VR_ERROR;\n }\n nci->log_level = value;\n break;\n\n case 'o':\n nci->log_filename = optarg;\n break;\n\n case 'c':\n nci->conf_filename = optarg;\n break;\n\n case 'p':\n nci->pid_filename = optarg;\n break;\n \n case 'T':\n value = vr_atoi(optarg, strlen(optarg));\n if (value < 0) {\n log_stderr(\"vire: option -T requires a number\");\n return VR_ERROR;\n }\n\n nci->thread_num = value;\n break;\n\n case '?':\n switch (optopt) {\n case 'o':\n case 'c':\n case 'p':\n log_stderr(\"vire: option -%c requires a file name\",\n optopt);\n break;\n\n case 'v':\n case 'T':\n log_stderr(\"vire: option -%c requires a number\", optopt);\n break;\n\n default:\n log_stderr(\"vire: invalid option -- '%c'\", optopt);\n break;\n }\n return VR_ERROR;\n\n default:\n log_stderr(\"vire: invalid option -- '%c'\", optopt);\n return VR_ERROR;\n\n }\n }\n\n return VR_OK;\n}\n\n/*\n * Returns true if configuration file has a valid syntax, otherwise\n * returns false\n */\nstatic bool\nvr_test_conf(struct instance *nci, int test)\n{\n vr_conf *cf;\n\n cf = conf_create(nci->conf_filename);\n if (cf == NULL) {\n if (test)\n log_stderr(\"vire: configuration file '%s' syntax is invalid\",\n nci->conf_filename);\n return false;\n }\n\n conf_destroy(cf);\n\n if (test)\n log_stderr(\"vire: configuration file '%s' syntax is ok\",\n nci->conf_filename);\n return true;\n}\n\nstatic int\nvr_pre_run(struct instance *nci)\n{\n int ret;\n\n ret = log_init(nci->log_level, nci->log_filename);\n if (ret != VR_OK) {\n return ret;\n }\n\n log_debug(LOG_VERB, \"Vire used logfile: %s\", nci->conf_filename);\n\n if (!vr_test_conf(nci, false)) {\n log_error(\"conf file %s is error\", nci->conf_filename);\n return VR_ERROR;\n }\n\n if (daemonize) {\n ret = vr_daemonize(1);\n if (ret != VR_OK) {\n return ret;\n }\n }\n\n nci->pid = getpid();\n\n ret = signal_init();\n if (ret != VR_OK) {\n return ret;\n }\n\n if (nci->pid_filename) {\n ret = vr_create_pidfile(nci);\n if (ret != VR_OK) {\n return VR_ERROR;\n }\n }\n\n ret = init_server(nci);\n if (ret != VR_OK) {\n return VR_ERROR;\n }\n\n vr_print_run(nci);\n\n return VR_OK;\n}\n\nstatic void\nvr_post_run(struct instance *nci)\n{\n /* deinit the threads */\n workers_deinit();\n backends_deinit();\n master_deinit();\n \n if (nci->pidfile) {\n vr_remove_pidfile(nci);\n }\n\n signal_deinit();\n\n vr_print_done();\n\n log_deinit();\n}\n\nstatic void\nvr_run(struct instance *nci)\n{\n if (nci->thread_num <= 0) {\n log_error(\"number of work threads must be greater than 0\");\n return;\n } else if (nci->thread_num > 64) {\n log_warn(\"WARNING: Setting a high number of worker threads is not recommended.\"\n \" Set this value to the number of cores in your machine or less.\");\n }\n\n /* run the threads */\n master_run();\n workers_run();\n backends_run();\n\n /* wait for the threads finish */\n workers_wait();\n backends_wait();\n}\n\nint\nmain(int argc, char **argv)\n{\n rstatus_t status;\n struct instance nci;\n\n vr_set_default_options(&nci);\n\n status = vr_get_options(argc, argv, &nci);\n if (status != VR_OK) {\n vr_show_usage();\n exit(1);\n }\n\n if (show_version) {\n log_stderr(\"This is vire-%s\" CRLF, VR_VERSION_STRING);\n if (show_help) {\n vr_show_usage();\n }\n exit(0);\n }\n\n if (test_conf) {\n if (!vr_test_conf(&nci, true)) {\n exit(1);\n }\n exit(0);\n }\n\n status = vr_pre_run(&nci);\n if (status != VR_OK) {\n vr_post_run(&nci);\n exit(1);\n }\n\n server.executable = getAbsolutePath(argv[0]);\n\n vr_run(&nci);\n\n vr_post_run(&nci);\n\n return VR_OK;\n}\n" }, { "path": "src/vr_aof.c", "content": "#include \n\n/* Return the current size of the AOF rewrite buffer. */\nunsigned long aofRewriteBufferSize(void) {\n dlistNode *ln;\n dlistIter li;\n unsigned long size = 0;\n\n dlistRewind(server.aof_rewrite_buf_blocks,&li);\n while((ln = dlistNext(&li))) {\n aofrwblock *block = dlistNodeValue(ln);\n size += block->used;\n }\n return size;\n}\n\n/* Create the sds representation of an PEXPIREAT command, using\n * 'seconds' as time to live and 'cmd' to understand what command\n * we are translating into a PEXPIREAT.\n *\n * This command is used in order to translate EXPIRE and PEXPIRE commands\n * into PEXPIREAT command so that we retain precision in the append only\n * file, and the time is always absolute and not relative. */\nsds catAppendOnlyExpireAtCommand(sds buf, struct redisCommand *cmd, robj *key, robj *seconds) {\n long long when;\n robj *argv[3];\n\n /* Make sure we can use strtoll */\n seconds = getDecodedObject(seconds);\n when = strtoll(seconds->ptr,NULL,10);\n /* Convert argument into milliseconds for EXPIRE, SETEX, EXPIREAT */\n if (cmd->proc == expireCommand || cmd->proc == setexCommand ||\n cmd->proc == expireatCommand)\n {\n when *= 1000;\n }\n /* Convert into absolute time for EXPIRE, PEXPIRE, SETEX, PSETEX */\n if (cmd->proc == expireCommand || cmd->proc == pexpireCommand ||\n cmd->proc == setexCommand || cmd->proc == psetexCommand)\n {\n when += vr_msec_now();\n }\n decrRefCount(seconds);\n\n argv[0] = createStringObject(\"PEXPIREAT\",9);\n argv[1] = key;\n argv[2] = createStringObjectFromLongLong(when);\n buf = catAppendOnlyGenericCommand(buf, 3, argv);\n decrRefCount(argv[0]);\n decrRefCount(argv[2]);\n return buf;\n}\n\nsds catAppendOnlyGenericCommand(sds dst, int argc, robj **argv) {\n char buf[32];\n int len, j;\n robj *o;\n\n buf[0] = '*';\n len = 1+ll2string(buf+1,sizeof(buf)-1,argc);\n buf[len++] = '\\r';\n buf[len++] = '\\n';\n dst = sdscatlen(dst,buf,len);\n\n for (j = 0; j < argc; j++) {\n o = getDecodedObject(argv[j]);\n buf[0] = '$';\n len = 1+ll2string(buf+1,sizeof(buf)-1,sdslen(o->ptr));\n buf[len++] = '\\r';\n buf[len++] = '\\n';\n dst = sdscatlen(dst,buf,len);\n dst = sdscatlen(dst,o->ptr,sdslen(o->ptr));\n dst = sdscatlen(dst,\"\\r\\n\",2);\n decrRefCount(o);\n }\n return dst;\n}\n\n/* Event handler used to send data to the child process doing the AOF\n * rewrite. We send pieces of our AOF differences buffer so that the final\n * write when the child finishes the rewrite will be small. */\nvoid aofChildWriteDiffData(aeEventLoop *el, int fd, void *privdata, int mask) {\n dlistNode *ln;\n aofrwblock *block;\n ssize_t nwritten;\n UNUSED(el);\n UNUSED(fd);\n UNUSED(privdata);\n UNUSED(mask);\n\n while(1) {\n ln = dlistFirst(server.aof_rewrite_buf_blocks);\n block = ln ? ln->value : NULL;\n if (server.aof_stop_sending_diff || !block) {\n aeDeleteFileEvent(server.el,server.aof_pipe_write_data_to_child,\n AE_WRITABLE);\n return;\n }\n if (block->used > 0) {\n nwritten = vr_write(server.aof_pipe_write_data_to_child,\n block->buf,block->used);\n if (nwritten <= 0) return;\n memmove(block->buf,block->buf+nwritten,block->used-nwritten);\n block->used -= nwritten;\n }\n if (block->used == 0) dlistDelNode(server.aof_rewrite_buf_blocks,ln);\n }\n}\n\n/* Append data to the AOF rewrite buffer, allocating new blocks if needed. */\nvoid aofRewriteBufferAppend(unsigned char *s, unsigned long len) {\n dlistNode *ln = dlistLast(server.aof_rewrite_buf_blocks);\n aofrwblock *block = ln ? ln->value : NULL;\n\n while(len) {\n /* If we already got at least an allocated block, try appending\n * at least some piece into it. */\n if (block) {\n unsigned long thislen = (block->free < len) ? block->free : len;\n if (thislen) { /* The current block is not already full. */\n memcpy(block->buf+block->used, s, thislen);\n block->used += thislen;\n block->free -= thislen;\n s += thislen;\n len -= thislen;\n }\n }\n\n if (len) { /* First block to allocate, or need another block. */\n int numblocks;\n\n block = dalloc(sizeof(*block));\n block->free = AOF_RW_BUF_BLOCK_SIZE;\n block->used = 0;\n dlistAddNodeTail(server.aof_rewrite_buf_blocks,block);\n\n /* Log every time we cross more 10 or 100 blocks, respectively\n * as a notice or warning. */\n numblocks = dlistLength(server.aof_rewrite_buf_blocks);\n if (((numblocks+1) % 10) == 0) {\n int level = ((numblocks+1) % 100) == 0 ? LOG_WARN :\n LOG_NOTICE;\n log_debug(level, \"Background AOF buffer size: %lu MB\",\n aofRewriteBufferSize()/(1024*1024));\n }\n }\n }\n\n /* Install a file event to send data to the rewrite child if there is\n * not one already. */\n if (aeGetFileEvents(server.el,server.aof_pipe_write_data_to_child) == 0) {\n aeCreateFileEvent(server.el, server.aof_pipe_write_data_to_child,\n AE_WRITABLE, aofChildWriteDiffData, NULL);\n }\n}\n\nvoid feedAppendOnlyFile(struct redisCommand *cmd, int dictid, robj **argv, int argc) {\n sds buf = sdsempty();\n robj *tmpargv[3];\n\n /* The DB this command was targeting is not the same as the last command\n * we appended. To issue a SELECT command is needed. */\n if (dictid != server.aof_selected_db) {\n char seldb[64];\n\n snprintf(seldb,sizeof(seldb),\"%d\",dictid);\n buf = sdscatprintf(buf,\"*2\\r\\n$6\\r\\nSELECT\\r\\n$%lu\\r\\n%s\\r\\n\",\n (unsigned long)strlen(seldb),seldb);\n server.aof_selected_db = dictid;\n }\n\n if (cmd->proc == expireCommand || cmd->proc == pexpireCommand ||\n cmd->proc == expireatCommand) {\n /* Translate EXPIRE/PEXPIRE/EXPIREAT into PEXPIREAT */\n buf = catAppendOnlyExpireAtCommand(buf,cmd,argv[1],argv[2]);\n } else if (cmd->proc == setexCommand || cmd->proc == psetexCommand) {\n /* Translate SETEX/PSETEX to SET and PEXPIREAT */\n tmpargv[0] = createStringObject(\"SET\",3);\n tmpargv[1] = argv[1];\n tmpargv[2] = argv[3];\n buf = catAppendOnlyGenericCommand(buf,3,tmpargv);\n decrRefCount(tmpargv[0]);\n buf = catAppendOnlyExpireAtCommand(buf,cmd,argv[1],argv[2]);\n } else {\n /* All the other commands don't need translation or need the\n * same translation already operated in the command vector\n * for the replication itself. */\n buf = catAppendOnlyGenericCommand(buf,argc,argv);\n }\n\n /* Append to the AOF buffer. This will be flushed on disk just before\n * of re-entering the event loop, so before the client will get a\n * positive reply about the operation performed. */\n if (server.aof_state == AOF_ON)\n server.aof_buf = sdscatlen(server.aof_buf,buf,sdslen(buf));\n\n /* If a background append only file rewriting is in progress we want to\n * accumulate the differences between the child DB and the current one\n * in a buffer, so that when the child process will do its work we\n * can append the differences to the new append only file. */\n if (server.aof_child_pid != -1)\n aofRewriteBufferAppend((unsigned char*)buf,sdslen(buf));\n\n sdsfree(buf);\n}\n\n" }, { "path": "src/vr_aof.h", "content": "#ifndef _VR_AOF_H_\n#define _VR_AOF_H_\n\n/* AOF states */\n#define AOF_OFF 0 /* AOF is off */\n#define AOF_ON 1 /* AOF is on */\n#define AOF_WAIT_REWRITE 2 /* AOF waits rewrite to start appending */\n\n#define AOF_AUTOSYNC_BYTES (1024*1024*32) /* fdatasync every 32MB */\n\n/* ----------------------------------------------------------------------------\n * AOF rewrite buffer implementation.\n *\n * The following code implement a simple buffer used in order to accumulate\n * changes while the background process is rewriting the AOF file.\n *\n * We only need to append, but can't just use realloc with a large block\n * because 'huge' reallocs are not always handled as one could expect\n * (via remapping of pages at OS level) but may involve copying data.\n *\n * For this reason we use a list of blocks, every block is\n * AOF_RW_BUF_BLOCK_SIZE bytes.\n * ------------------------------------------------------------------------- */\n\n#define AOF_RW_BUF_BLOCK_SIZE (1024*1024*10) /* 10 MB per block */\n\ntypedef struct aofrwblock {\n unsigned long used, free;\n char buf[AOF_RW_BUF_BLOCK_SIZE];\n} aofrwblock;\n\nunsigned long aofRewriteBufferSize(void);\nvoid aofChildWriteDiffData(aeEventLoop *el, int fd, void *privdata, int mask);\nsds catAppendOnlyExpireAtCommand(sds buf, struct redisCommand *cmd, robj *key, robj *seconds);\nsds catAppendOnlyGenericCommand(sds dst, int argc, robj **argv);\nvoid aofRewriteBufferAppend(unsigned char *s, unsigned long len);\nvoid feedAppendOnlyFile(struct redisCommand *cmd, int dictid, robj **argv, int argc);\n\n#endif\n" }, { "path": "src/vr_backend.c", "content": "#include \n\n/* Which thread we assigned a connection to most recently. */\nstatic int num_backend_threads;\n\nstruct darray backends;\n\nstatic void *backend_thread_run(void *args);\n\nint\nvr_backend_init(vr_backend *backend)\n{\n rstatus_t status;\n int threads_num;\n \n if (backend == NULL) {\n return VR_ERROR;\n }\n\n backend->id = 0;\n backend->current_db = 0;\n backend->timelimit_exit = 0;\n backend->last_fast_cycle = 0;\n backend->resize_db = 0;\n backend->rehash_db = 0;\n\n vr_eventloop_init(&backend->vel, 10);\n backend->vel.thread.fun_run = backend_thread_run;\n backend->vel.thread.data = backend;\n \n return VR_OK;\n}\n\nvoid\nvr_backend_deinit(vr_backend *backend)\n{\n if (backend == NULL) {\n return;\n }\n\n vr_eventloop_deinit(&backend->vel);\n}\n\nstatic int\nbackend_cron(struct aeEventLoop *eventLoop, long long id, void *clientData) {\n vr_worker *backend = clientData;\n vr_eventloop *vel = &backend->vel;\n size_t stat_used_memory, stats_peak_memory;\n\n UNUSED(eventLoop);\n UNUSED(id);\n UNUSED(clientData);\n\n ASSERT(eventLoop == vel->el);\n\n vel->unixtime = time(NULL);\n vel->mstime = vr_msec_now();\n\n /* Record the max memory used since the server was started. */\n stat_used_memory = dalloc_used_memory();\n update_stats_get(vel->stats, peak_memory, &stats_peak_memory);\n if (stat_used_memory > stats_peak_memory) {\n update_stats_set(vel->stats, peak_memory, stat_used_memory);\n }\n\n databasesCron(backend);\n\n /* Update the config cache */\n run_with_period(1000, vel->cronloops) {\n conf_cache_update(&vel->cc);\n }\n \n vel->cronloops ++;\n return 1000/vel->hz;\n}\n\nstatic int\nsetup_backend(vr_backend *backend)\n{\n /* Create the serverCron() time event, that's our main way to process\n * background operations. */\n if(aeCreateTimeEvent(backend->vel.el, 1, backend_cron, backend, NULL) == AE_ERR) {\n serverPanic(\"Can't create the serverCron time event.\");\n return VR_ERROR;\n }\n \n return VR_OK;\n}\n\nstatic void *\nbackend_thread_run(void *args)\n{\n vr_worker *backend = args;\n \n /* vire worker run */\n aeMain(backend->vel.el);\n\n return NULL;\n}\n\nint\nbackends_init(uint32_t backend_count)\n{\n rstatus_t status;\n uint32_t idx;\n vr_backend *backend;\n\n darray_init(&backends, backend_count, sizeof(vr_backend));\n\n for (idx = 0; idx < backend_count; idx ++) {\n backend = darray_push(&backends);\n vr_backend_init(backend);\n backend->id = idx;\n status = setup_backend(backend);\n if (status != VR_OK) {\n exit(1);\n }\n }\n \n num_backend_threads = (int)darray_n(&backends);\n\n return VR_OK;\n}\n\nint\nbackends_run(void)\n{\n uint32_t i, thread_count;\n vr_backend *backend;\n\n thread_count = (uint32_t)num_backend_threads;\n\n for (i = 0; i < thread_count; i ++) {\n backend = darray_get(&backends, i);\n vr_thread_start(&backend->vel.thread);\n }\n\n return VR_OK;\n}\n\nint\nbackends_wait(void)\n{\n uint32_t i, thread_count;\n vr_backend *backend;\n\n thread_count = (uint32_t)num_backend_threads;\n\n for (i = 0; i < thread_count; i ++) {\n backend = darray_get(&backends, i);\n pthread_join(backend->vel.thread.thread_id, NULL);\n }\n\n return VR_OK;\n}\n\nvoid\nbackends_deinit(void)\n{\n vr_backend *backend;\n\n while(darray_n(&backends)) {\n backend = darray_pop(&backends);\n\t\tvr_backend_deinit(backend);\n }\n}\n" }, { "path": "src/vr_backend.h", "content": "#ifndef _VR_BACKEND_H_\n#define _VR_BACKEND_H_\n\ntypedef struct vr_backend {\n\n int id;\n vr_eventloop vel;\n\n /* Some global state in order to continue the work incrementally \n * across calls for activeExpireCycle() to expire some keys. */\n unsigned int current_db; /* Last DB tested. */\n int timelimit_exit; /* Time limit hit in previous call? */\n long long last_fast_cycle; /* When last fast cycle ran. */\n\n /* We use global counters so if we stop the computation at a given\n * DB we'll be able to start from the successive in the next\n * cron loop iteration for databasesCron() to resize and reshash db. */\n unsigned int resize_db;\n unsigned int rehash_db;\n}vr_backend;\n\nextern struct darray backends;\n\nint backends_init(uint32_t backend_count);\nint backends_run(void);\nint backends_wait(void);\nvoid backends_deinit(void);\n\n#endif\n" }, { "path": "src/vr_bitops.c", "content": "#include \n\n/* -----------------------------------------------------------------------------\n * Helpers and low level bit functions.\n * -------------------------------------------------------------------------- */\n\n/* Count number of bits set in the binary array pointed by 's' and long\n * 'count' bytes. The implementation of this function is required to\n * work with a input string length up to 512 MB. */\nsize_t redisPopcount(void *s, long count) {\n size_t bits = 0;\n unsigned char *p = s;\n uint32_t *p4;\n 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};\n\n /* Count initial bytes not aligned to 32 bit. */\n while((unsigned long)p & 3 && count) {\n bits += bitsinbyte[*p++];\n count--;\n }\n\n /* Count bits 28 bytes at a time */\n p4 = (uint32_t*)p;\n while(count>=28) {\n uint32_t aux1, aux2, aux3, aux4, aux5, aux6, aux7;\n\n aux1 = *p4++;\n aux2 = *p4++;\n aux3 = *p4++;\n aux4 = *p4++;\n aux5 = *p4++;\n aux6 = *p4++;\n aux7 = *p4++;\n count -= 28;\n\n aux1 = aux1 - ((aux1 >> 1) & 0x55555555);\n aux1 = (aux1 & 0x33333333) + ((aux1 >> 2) & 0x33333333);\n aux2 = aux2 - ((aux2 >> 1) & 0x55555555);\n aux2 = (aux2 & 0x33333333) + ((aux2 >> 2) & 0x33333333);\n aux3 = aux3 - ((aux3 >> 1) & 0x55555555);\n aux3 = (aux3 & 0x33333333) + ((aux3 >> 2) & 0x33333333);\n aux4 = aux4 - ((aux4 >> 1) & 0x55555555);\n aux4 = (aux4 & 0x33333333) + ((aux4 >> 2) & 0x33333333);\n aux5 = aux5 - ((aux5 >> 1) & 0x55555555);\n aux5 = (aux5 & 0x33333333) + ((aux5 >> 2) & 0x33333333);\n aux6 = aux6 - ((aux6 >> 1) & 0x55555555);\n aux6 = (aux6 & 0x33333333) + ((aux6 >> 2) & 0x33333333);\n aux7 = aux7 - ((aux7 >> 1) & 0x55555555);\n aux7 = (aux7 & 0x33333333) + ((aux7 >> 2) & 0x33333333);\n bits += ((((aux1 + (aux1 >> 4)) & 0x0F0F0F0F) +\n ((aux2 + (aux2 >> 4)) & 0x0F0F0F0F) +\n ((aux3 + (aux3 >> 4)) & 0x0F0F0F0F) +\n ((aux4 + (aux4 >> 4)) & 0x0F0F0F0F) +\n ((aux5 + (aux5 >> 4)) & 0x0F0F0F0F) +\n ((aux6 + (aux6 >> 4)) & 0x0F0F0F0F) +\n ((aux7 + (aux7 >> 4)) & 0x0F0F0F0F))* 0x01010101) >> 24;\n }\n /* Count the remaining bytes. */\n p = (unsigned char*)p4;\n while(count--) bits += bitsinbyte[*p++];\n return bits;\n}\n\n/* Return the position of the first bit set to one (if 'bit' is 1) or\n * zero (if 'bit' is 0) in the bitmap starting at 's' and long 'count' bytes.\n *\n * The function is guaranteed to return a value >= 0 if 'bit' is 0 since if\n * no zero bit is found, it returns count*8 assuming the string is zero\n * padded on the right. However if 'bit' is 1 it is possible that there is\n * not a single set bit in the bitmap. In this special case -1 is returned. */\nlong redisBitpos(void *s, unsigned long count, int bit) {\n unsigned long *l;\n unsigned char *c;\n unsigned long skipval, word = 0, one;\n long pos = 0; /* Position of bit, to return to the caller. */\n unsigned long j;\n\n /* Process whole words first, seeking for first word that is not\n * all ones or all zeros respectively if we are lookig for zeros\n * or ones. This is much faster with large strings having contiguous\n * blocks of 1 or 0 bits compared to the vanilla bit per bit processing.\n *\n * Note that if we start from an address that is not aligned\n * to sizeof(unsigned long) we consume it byte by byte until it is\n * aligned. */\n\n /* Skip initial bits not aligned to sizeof(unsigned long) byte by byte. */\n skipval = bit ? 0 : UCHAR_MAX;\n c = (unsigned char*) s;\n while((unsigned long)c & (sizeof(*l)-1) && count) {\n if (*c != skipval) break;\n c++;\n count--;\n pos += 8;\n }\n\n /* Skip bits with full word step. */\n skipval = bit ? 0 : ULONG_MAX;\n l = (unsigned long*) c;\n while (count >= sizeof(*l)) {\n if (*l != skipval) break;\n l++;\n count -= sizeof(*l);\n pos += sizeof(*l)*8;\n }\n\n /* Load bytes into \"word\" considering the first byte as the most significant\n * (we basically consider it as written in big endian, since we consider the\n * string as a set of bits from left to right, with the first bit at position\n * zero.\n *\n * Note that the loading is designed to work even when the bytes left\n * (count) are less than a full word. We pad it with zero on the right. */\n c = (unsigned char*)l;\n for (j = 0; j < sizeof(*l); j++) {\n word <<= 8;\n if (count) {\n word |= *c;\n c++;\n count--;\n }\n }\n\n /* Special case:\n * If bits in the string are all zero and we are looking for one,\n * return -1 to signal that there is not a single \"1\" in the whole\n * string. This can't happen when we are looking for \"0\" as we assume\n * that the right of the string is zero padded. */\n if (bit == 1 && word == 0) return -1;\n\n /* Last word left, scan bit by bit. The first thing we need is to\n * have a single \"1\" set in the most significant position in an\n * unsigned long. We don't know the size of the long so we use a\n * simple trick. */\n one = ULONG_MAX; /* All bits set to 1.*/\n one >>= 1; /* All bits set to 1 but the MSB. */\n one = ~one; /* All bits set to 0 but the MSB. */\n\n while(one) {\n if (((one & word) != 0) == bit) return pos;\n pos++;\n one >>= 1;\n }\n\n /* If we reached this point, there is a bug in the algorithm, since\n * the case of no match is handled as a special case before. */\n serverPanic(\"End of redisBitpos() reached.\");\n return 0; /* Just to avoid warnings. */\n}\n\n/* The following set.*Bitfield and get.*Bitfield functions implement setting\n * and getting arbitrary size (up to 64 bits) signed and unsigned integers\n * at arbitrary positions into a bitmap.\n *\n * The representation considers the bitmap as having the bit number 0 to be\n * the most significant bit of the first byte, and so forth, so for example\n * setting a 5 bits unsigned integer to value 23 at offset 7 into a bitmap\n * previously set to all zeroes, will produce the following representation:\n *\n * +--------+--------+\n * |00000001|01110000|\n * +--------+--------+\n *\n * When offsets and integer sizes are aligned to bytes boundaries, this is the\n * same as big endian, however when such alignment does not exist, its important\n * to also understand how the bits inside a byte are ordered.\n *\n * Note that this format follows the same convention as SETBIT and related\n * commands.\n */\n\nvoid setUnsignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits, uint64_t value) {\n uint64_t byte, bit, byteval, bitval, j;\n\n for (j = 0; j < bits; j++) {\n bitval = (value & ((uint64_t)1<<(bits-1-j))) != 0;\n byte = offset >> 3;\n bit = 7 - (offset & 0x7);\n byteval = p[byte];\n byteval &= ~(1 << bit);\n byteval |= bitval << bit;\n p[byte] = byteval & 0xff;\n offset++;\n }\n}\n\nvoid setSignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits, int64_t value) {\n uint64_t uv;\n\n if (value >= 0)\n uv = value;\n else\n uv = UINT64_MAX + value + 1;\n setUnsignedBitfield(p,offset,bits,uv);\n}\n\nuint64_t getUnsignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits) {\n uint64_t byte, bit, byteval, bitval, j, value = 0;\n\n for (j = 0; j < bits; j++) {\n byte = offset >> 3;\n bit = 7 - (offset & 0x7);\n byteval = p[byte];\n bitval = (byteval >> bit) & 1;\n value = (value<<1) | bitval;\n offset++;\n }\n return value;\n}\n\nint64_t getSignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits) {\n int64_t value = getUnsignedBitfield(p,offset,bits);\n /* If the top significant bit is 1, propagate it to all the\n * higher bits for two complement representation of signed\n * integers. */\n if (value & ((uint64_t)1 << (bits-1)))\n value |= ((uint64_t)-1) << bits;\n return value;\n}\n\n/* The following two functions detect overflow of a value in the context\n * of storing it as an unsigned or signed integer with the specified\n * number of bits. The functions both take the value and a possible increment.\n * If no overflow could happen and the value+increment fit inside the limits,\n * then zero is returned, otherwise in case of overflow, 1 is returned,\n * otherwise in case of underflow, -1 is returned.\n *\n * When non-zero is returned (oferflow or underflow), if not NULL, *limit is\n * set to the value the operation should result when an overflow happens,\n * depending on the specified overflow semantics:\n *\n * For BFOVERFLOW_SAT if 1 is returned, *limit it is set maximum value that\n * you can store in that integer. when -1 is returned, *limit is set to the\n * minimum value that an integer of that size can represent.\n *\n * For BFOVERFLOW_WRAP *limit is set by performing the operation in order to\n * \"wrap\" around towards zero for unsigned integers, or towards the most\n * negative number that is possible to represent for signed integers. */\n\n#define BFOVERFLOW_WRAP 0\n#define BFOVERFLOW_SAT 1\n#define BFOVERFLOW_FAIL 2 /* Used by the BITFIELD command implementation. */\n\nint checkUnsignedBitfieldOverflow(uint64_t value, int64_t incr, uint64_t bits, int owtype, uint64_t *limit) {\n uint64_t max = (bits == 64) ? UINT64_MAX : (((uint64_t)1< max || (incr > 0 && incr > maxincr)) {\n if (limit) {\n if (owtype == BFOVERFLOW_WRAP) {\n goto handle_wrap;\n } else if (owtype == BFOVERFLOW_SAT) {\n *limit = max;\n }\n }\n return 1;\n } else if (incr < 0 && incr < minincr) {\n if (limit) {\n if (owtype == BFOVERFLOW_WRAP) {\n goto handle_wrap;\n } else if (owtype == BFOVERFLOW_SAT) {\n *limit = 0;\n }\n }\n return -1;\n }\n return 0;\n\nhandle_wrap:\n {\n uint64_t mask = ((int64_t)-1) << bits;\n uint64_t res = value+incr;\n\n res &= ~mask;\n *limit = res;\n }\n return 1;\n}\n\nint checkSignedBitfieldOverflow(int64_t value, int64_t incr, uint64_t bits, int owtype, int64_t *limit) {\n int64_t max = (bits == 64) ? INT64_MAX : (((int64_t)1<<(bits-1))-1);\n int64_t min = (-max)-1;\n\n /* Note that maxincr and minincr could overflow, but we use the values\n * only after checking 'value' range, so when we use it no overflow\n * happens. */\n int64_t maxincr = max-value;\n int64_t minincr = min-value;\n\n if (value > max || (bits != 64 && incr > maxincr) || (value >= 0 && incr > 0 && incr > maxincr))\n {\n if (limit) {\n if (owtype == BFOVERFLOW_WRAP) {\n goto handle_wrap;\n } else if (owtype == BFOVERFLOW_SAT) {\n *limit = max;\n }\n }\n return 1;\n } else if (value < min || (bits != 64 && incr < minincr) || (value < 0 && incr < 0 && incr < minincr)) {\n if (limit) {\n if (owtype == BFOVERFLOW_WRAP) {\n goto handle_wrap;\n } else if (owtype == BFOVERFLOW_SAT) {\n *limit = min;\n }\n }\n return -1;\n }\n return 0;\n\nhandle_wrap:\n {\n uint64_t mask = ((int64_t)-1) << bits;\n uint64_t msb = (uint64_t)1 << (bits-1);\n uint64_t a = value, b = incr, c;\n c = a+b; /* Perform addition as unsigned so that's defined. */\n\n /* If the sign bit is set, propagate to all the higher order\n * bits, to cap the negative value. If it's clear, mask to\n * the positive integer limit. */\n if (c & msb) {\n c |= mask;\n } else {\n c &= ~mask;\n }\n *limit = c;\n }\n return 1;\n}\n\n/* Debugging function. Just show bits in the specified bitmap. Not used\n * but here for not having to rewrite it when debugging is needed. */\nvoid printBits(unsigned char *p, unsigned long count) {\n unsigned long j, i, byte;\n\n for (j = 0; j < count; j++) {\n byte = p[j];\n for (i = 0x80; i > 0; i /= 2)\n printf(\"%c\", (byte & i) ? '1' : '0');\n printf(\"|\");\n }\n printf(\"\\n\");\n}\n\n/* -----------------------------------------------------------------------------\n * Bits related string commands: GETBIT, SETBIT, BITCOUNT, BITOP.\n * -------------------------------------------------------------------------- */\n\n#define BITOP_AND 0\n#define BITOP_OR 1\n#define BITOP_XOR 2\n#define BITOP_NOT 3\n\n#define BITFIELDOP_GET 0\n#define BITFIELDOP_SET 1\n#define BITFIELDOP_INCRBY 2\n\n/* This helper function used by GETBIT / SETBIT parses the bit offset argument\n * making sure an error is returned if it is negative or if it overflows\n * Redis 512 MB limit for the string value.\n *\n * If the 'hash' argument is true, and 'bits is positive, then the command\n * will also parse bit offsets prefixed by \"#\". In such a case the offset\n * is multiplied by 'bits'. This is useful for the BITFIELD command. */\nint getBitOffsetFromArgument(client *c, robj *o, size_t *offset, int hash, int bits) {\n long long loffset;\n char *err = \"bit offset is not an integer or out of range\";\n char *p = o->ptr;\n size_t plen = sdslen(p);\n int usehash = 0;\n\n /* Handle # form. */\n if (p[0] == '#' && hash && bits > 0) usehash = 1;\n\n if (string2ll(p+usehash,plen-usehash,&loffset) == 0) {\n addReplyError(c,err);\n return VR_ERROR;\n }\n\n /* Adjust the offset by 'bits' for # form. */\n if (usehash) loffset *= bits;\n\n /* Limit offset to 512MB in bytes */\n if ((loffset < 0) || ((unsigned long long)loffset >> 3) >= (512*1024*1024))\n {\n addReplyError(c,err);\n return VR_ERROR;\n }\n\n *offset = (size_t)loffset;\n return VR_OK;\n}\n\n/* This helper function for BITFIELD parses a bitfield type in the form\n * where sign is 'u' or 'i' for unsigned and signed, and\n * the bits is a value between 1 and 64. However 64 bits unsigned integers\n * are reported as an error because of current limitations of Redis protocol\n * to return unsigned integer values greater than INT64_MAX.\n *\n * On error VR_ERROR is returned and an error is sent to the client. */\nint getBitfieldTypeFromArgument(client *c, robj *o, int *sign, int *bits) {\n char *p = o->ptr;\n char *err = \"Invalid bitfield type. Use something like i16 u8. Note that u64 is not supported but i64 is.\";\n long long llbits;\n\n if (p[0] == 'i') {\n *sign = 1;\n } else if (p[0] == 'u') {\n *sign = 0;\n } else {\n addReplyError(c,err);\n return VR_ERROR;\n }\n\n if ((string2ll(p+1,strlen(p+1),&llbits)) == 0 ||\n llbits < 1 ||\n (*sign == 1 && llbits > 64) ||\n (*sign == 0 && llbits > 63))\n {\n addReplyError(c,err);\n return VR_ERROR;\n }\n *bits = llbits;\n return VR_OK;\n}\n\n/* This is an helper function for commands implementations that need to write\n * bits to a string object. The command creates or pad with zeroes the string\n * so that the 'maxbit' bit can be addressed. The object is finally\n * returned. Otherwise if the key holds a wrong type NULL is returned and\n * an error is sent to the client. */\nrobj *lookupStringForBitCommand(client *c, size_t maxbit, int *expired) {\n size_t byte = maxbit >> 3;\n robj *o = lookupKeyWrite(c->db,c->argv[1],expired);\n\n if (o == NULL) {\n o = createObject(OBJ_STRING,sdsnewlen(NULL, byte+1));\n dbAdd(c->db,c->argv[1],o);\n } else {\n if (checkType(c,o,OBJ_STRING)) return NULL;\n o = dbUnshareStringValue(c->db,c->argv[1],o);\n o->ptr = sdsgrowzero(o->ptr,byte+1);\n }\n return o;\n}\n\n/* SETBIT key offset bitvalue */\nvoid setbitCommand(client *c) {\n robj *o;\n char *err = \"bit is not an integer or out of range\";\n size_t bitoffset;\n ssize_t byte, bit;\n int byteval, bitval;\n long on;\n int expired = 0;\n\n if (getBitOffsetFromArgument(c,c->argv[2],&bitoffset,0,0) != VR_OK)\n return;\n\n if (getLongFromObjectOrReply(c,c->argv[3],&on,err) != VR_OK)\n return;\n\n /* Bits can only be set or cleared... */\n if (on & ~1) {\n addReplyError(c,err);\n return;\n }\n\n fetchInternalDbByKey(c, c->argv[1]);\n lockDbWrite(c->db);\n if ((o = lookupStringForBitCommand(c,bitoffset,&expired)) == NULL) { \n unlockDb(c->db);\n if (expired) update_stats_add(c->vel->stats,expiredkeys,1);\n return;\n }\n\n /* Get current values */\n byte = bitoffset >> 3;\n byteval = ((uint8_t*)o->ptr)[byte];\n bit = 7 - (bitoffset & 0x7);\n bitval = byteval & (1 << bit);\n\n /* Update byte with new bit value and return original value */\n byteval &= ~(1 << bit);\n byteval |= ((on & 0x1) << bit);\n ((uint8_t*)o->ptr)[byte] = byteval;\n signalModifiedKey(c->db,c->argv[1]);\n notifyKeyspaceEvent(NOTIFY_STRING,\"setbit\",c->argv[1],c->db->id);\n c->vel->dirty++;\n addReply(c, bitval ? shared.cone : shared.czero);\n unlockDb(c->db);\n if (expired) update_stats_add(c->vel->stats,expiredkeys,1);\n}\n\n/* GETBIT key offset */\nvoid getbitCommand(client *c) {\n robj *o;\n char llbuf[32];\n size_t bitoffset;\n size_t byte, bit;\n size_t bitval = 0;\n\n if (getBitOffsetFromArgument(c,c->argv[2],&bitoffset,0,0) != VR_OK)\n return;\n\n fetchInternalDbByKey(c, c->argv[1]);\n lockDbRead(c->db);\n if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL) {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_misses, 1);\n return;\n } else if (checkType(c,o,OBJ_STRING)) {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n return;\n }\n byte = bitoffset >> 3;\n bit = 7 - (bitoffset & 0x7);\n if (sdsEncodedObject(o)) {\n if (byte < sdslen(o->ptr))\n bitval = ((uint8_t*)o->ptr)[byte] & (1 << bit);\n } else {\n if (byte < (size_t)ll2string(llbuf,sizeof(llbuf),(long)o->ptr))\n bitval = llbuf[byte] & (1 << bit);\n }\n\n addReply(c, bitval ? shared.cone : shared.czero);\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n}\n\n/* BITOP op_name target_key src_key1 src_key2 src_key3 ... src_keyN */\nvoid bitopCommand(client *c) {\n char *opname = c->argv[1]->ptr;\n robj *o, *targetkey = c->argv[2];\n unsigned long op, j, numkeys;\n robj **objects; /* Array of source objects. */\n unsigned char **src; /* Array of source strings pointers. */\n unsigned long *len, maxlen = 0; /* Array of length of src strings,\n and max len. */\n unsigned long minlen = 0; /* Min len among the input keys. */\n unsigned char *res = NULL; /* Resulting string. */\n\n /* Parse the operation name. */\n if ((opname[0] == 'a' || opname[0] == 'A') && !strcasecmp(opname,\"and\"))\n op = BITOP_AND;\n else if((opname[0] == 'o' || opname[0] == 'O') && !strcasecmp(opname,\"or\"))\n op = BITOP_OR;\n else if((opname[0] == 'x' || opname[0] == 'X') && !strcasecmp(opname,\"xor\"))\n op = BITOP_XOR;\n else if((opname[0] == 'n' || opname[0] == 'N') && !strcasecmp(opname,\"not\"))\n op = BITOP_NOT;\n else {\n addReply(c,shared.syntaxerr);\n return;\n }\n\n /* Sanity check: NOT accepts only a single key argument. */\n if (op == BITOP_NOT && c->argc != 4) {\n addReplyError(c,\"BITOP NOT must be called with a single source key.\");\n return;\n }\n\n /* Lookup keys, and store pointers to the string objects into an array. */\n numkeys = c->argc - 3;\n src = dalloc(sizeof(unsigned char*) * numkeys);\n len = dalloc(sizeof(long) * numkeys);\n objects = dalloc(sizeof(robj*) * numkeys);\n for (j = 0; j < numkeys; j++) {\n o = lookupKeyRead(c->db,c->argv[j+3]);\n /* Handle non-existing keys as empty strings. */\n if (o == NULL) {\n objects[j] = NULL;\n src[j] = NULL;\n len[j] = 0;\n minlen = 0;\n continue;\n }\n /* Return an error if one of the keys is not a string. */\n if (checkType(c,o,OBJ_STRING)) {\n unsigned long i;\n for (i = 0; i < j; i++) {\n if (objects[i])\n decrRefCount(objects[i]);\n }\n dfree(src);\n dfree(len);\n dfree(objects);\n return;\n }\n objects[j] = getDecodedObject(o);\n src[j] = objects[j]->ptr;\n len[j] = sdslen(objects[j]->ptr);\n if (len[j] > maxlen) maxlen = len[j];\n if (j == 0 || len[j] < minlen) minlen = len[j];\n }\n\n /* Compute the bit operation, if at least one string is not empty. */\n if (maxlen) {\n res = (unsigned char*) sdsnewlen(NULL,maxlen);\n unsigned char output, byte;\n unsigned long i;\n\n /* Fast path: as far as we have data for all the input bitmaps we\n * can take a fast path that performs much better than the\n * vanilla algorithm. */\n j = 0;\n if (minlen >= sizeof(unsigned long)*4 && numkeys <= 16) {\n unsigned long *lp[16];\n unsigned long *lres = (unsigned long*) res;\n\n /* Note: sds pointer is always aligned to 8 byte boundary. */\n memcpy(lp,src,sizeof(unsigned long*)*numkeys);\n memcpy(res,src[0],minlen);\n\n /* Different branches per different operations for speed (sorry). */\n if (op == BITOP_AND) {\n while(minlen >= sizeof(unsigned long)*4) {\n for (i = 1; i < numkeys; i++) {\n lres[0] &= lp[i][0];\n lres[1] &= lp[i][1];\n lres[2] &= lp[i][2];\n lres[3] &= lp[i][3];\n lp[i]+=4;\n }\n lres+=4;\n j += sizeof(unsigned long)*4;\n minlen -= sizeof(unsigned long)*4;\n }\n } else if (op == BITOP_OR) {\n while(minlen >= sizeof(unsigned long)*4) {\n for (i = 1; i < numkeys; i++) {\n lres[0] |= lp[i][0];\n lres[1] |= lp[i][1];\n lres[2] |= lp[i][2];\n lres[3] |= lp[i][3];\n lp[i]+=4;\n }\n lres+=4;\n j += sizeof(unsigned long)*4;\n minlen -= sizeof(unsigned long)*4;\n }\n } else if (op == BITOP_XOR) {\n while(minlen >= sizeof(unsigned long)*4) {\n for (i = 1; i < numkeys; i++) {\n lres[0] ^= lp[i][0];\n lres[1] ^= lp[i][1];\n lres[2] ^= lp[i][2];\n lres[3] ^= lp[i][3];\n lp[i]+=4;\n }\n lres+=4;\n j += sizeof(unsigned long)*4;\n minlen -= sizeof(unsigned long)*4;\n }\n } else if (op == BITOP_NOT) {\n while(minlen >= sizeof(unsigned long)*4) {\n lres[0] = ~lres[0];\n lres[1] = ~lres[1];\n lres[2] = ~lres[2];\n lres[3] = ~lres[3];\n lres+=4;\n j += sizeof(unsigned long)*4;\n minlen -= sizeof(unsigned long)*4;\n }\n }\n }\n\n /* j is set to the next byte to process by the previous loop. */\n for (; j < maxlen; j++) {\n output = (len[0] <= j) ? 0 : src[0][j];\n if (op == BITOP_NOT) output = ~output;\n for (i = 1; i < numkeys; i++) {\n byte = (len[i] <= j) ? 0 : src[i][j];\n switch(op) {\n case BITOP_AND: output &= byte; break;\n case BITOP_OR: output |= byte; break;\n case BITOP_XOR: output ^= byte; break;\n }\n }\n res[j] = output;\n }\n }\n for (j = 0; j < numkeys; j++) {\n if (objects[j])\n decrRefCount(objects[j]);\n }\n dfree(src);\n dfree(len);\n dfree(objects);\n\n /* Store the computed value into the target key */\n if (maxlen) {\n o = createObject(OBJ_STRING,res);\n setKey(c->db,targetkey,o,NULL);\n notifyKeyspaceEvent(NOTIFY_STRING,\"set\",targetkey,c->db->id);\n decrRefCount(o);\n } else if (dbDelete(c->db,targetkey)) {\n signalModifiedKey(c->db,targetkey);\n notifyKeyspaceEvent(NOTIFY_GENERIC,\"del\",targetkey,c->db->id);\n }\n server.dirty++;\n addReplyLongLong(c,maxlen); /* Return the output string length in bytes. */\n}\n\n/* BITCOUNT key [start end] */\nvoid bitcountCommand(client *c) {\n robj *o;\n long start, end, strlen;\n unsigned char *p;\n char llbuf[32];\n\n fetchInternalDbByKey(c, c->argv[1]);\n lockDbRead(c->db);\n /* Lookup, check for type, and return 0 for non existing keys. */\n if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL) {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_misses, 1);\n return;\n } else if (checkType(c,o,OBJ_STRING)) {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n return;\n }\n\n /* Set the 'p' pointer to the string, that can be just a stack allocated\n * array if our string was integer encoded. */\n if (o->encoding == OBJ_ENCODING_INT) {\n p = (unsigned char*) llbuf;\n strlen = ll2string(llbuf,sizeof(llbuf),(long)o->ptr);\n } else {\n p = (unsigned char*) o->ptr;\n strlen = sdslen(o->ptr);\n }\n\n /* Parse start/end range if any. */\n if (c->argc == 4) {\n if (getLongFromObjectOrReply(c,c->argv[2],&start,NULL) != VR_OK) {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n return;\n }\n if (getLongFromObjectOrReply(c,c->argv[3],&end,NULL) != VR_OK) {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n return;\n }\n /* Convert negative indexes */\n if (start < 0) start = strlen+start;\n if (end < 0) end = strlen+end;\n if (start < 0) start = 0;\n if (end < 0) end = 0;\n if (end >= strlen) end = strlen-1;\n } else if (c->argc == 2) {\n /* The whole string. */\n start = 0;\n end = strlen-1;\n } else {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n /* Syntax error. */\n addReply(c,shared.syntaxerr);\n return;\n }\n\n /* Precondition: end >= 0 && end < strlen, so the only condition where\n * zero can be returned is: start > end. */\n if (start > end) {\n addReply(c,shared.czero);\n } else {\n long bytes = end-start+1;\n\n addReplyLongLong(c,redisPopcount(p+start,bytes));\n }\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n}\n\n/* BITPOS key bit [start [end]] */\nvoid bitposCommand(client *c) {\n robj *o;\n long bit, start, end, strlen;\n unsigned char *p;\n char llbuf[32];\n int end_given = 0;\n\n /* Parse the bit argument to understand what we are looking for, set\n * or clear bits. */\n if (getLongFromObjectOrReply(c,c->argv[2],&bit,NULL) != VR_OK)\n return;\n if (bit != 0 && bit != 1) {\n addReplyError(c, \"The bit argument must be 1 or 0.\");\n return;\n }\n\n fetchInternalDbByKey(c, c->argv[1]);\n lockDbRead(c->db);\n /* If the key does not exist, from our point of view it is an infinite\n * array of 0 bits. If the user is looking for the fist clear bit return 0,\n * If the user is looking for the first set bit, return -1. */\n if ((o = lookupKeyRead(c->db,c->argv[1])) == NULL) {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_misses, 1);\n addReplyLongLong(c, bit ? -1 : 0);\n return;\n }\n if (checkType(c,o,OBJ_STRING)) {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n return;\n }\n\n /* Set the 'p' pointer to the string, that can be just a stack allocated\n * array if our string was integer encoded. */\n if (o->encoding == OBJ_ENCODING_INT) {\n p = (unsigned char*) llbuf;\n strlen = ll2string(llbuf,sizeof(llbuf),(long)o->ptr);\n } else {\n p = (unsigned char*) o->ptr;\n strlen = sdslen(o->ptr);\n }\n\n /* Parse start/end range if any. */\n if (c->argc == 4 || c->argc == 5) {\n if (getLongFromObjectOrReply(c,c->argv[3],&start,NULL) != VR_OK) {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n return;\n }\n if (c->argc == 5) {\n if (getLongFromObjectOrReply(c,c->argv[4],&end,NULL) != VR_OK) {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n return;\n }\n end_given = 1;\n } else {\n end = strlen-1;\n }\n /* Convert negative indexes */\n if (start < 0) start = strlen+start;\n if (end < 0) end = strlen+end;\n if (start < 0) start = 0;\n if (end < 0) end = 0;\n if (end >= strlen) end = strlen-1;\n } else if (c->argc == 3) {\n /* The whole string. */\n start = 0;\n end = strlen-1;\n } else {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n /* Syntax error. */\n addReply(c,shared.syntaxerr);\n return;\n }\n\n /* For empty ranges (start > end) we return -1 as an empty range does\n * not contain a 0 nor a 1. */\n if (start > end) {\n addReplyLongLong(c, -1);\n } else {\n long bytes = end-start+1;\n long pos = redisBitpos(p+start,bytes,bit);\n\n /* If we are looking for clear bits, and the user specified an exact\n * range with start-end, we can't consider the right of the range as\n * zero padded (as we do when no explicit end is given).\n *\n * So if redisBitpos() returns the first bit outside the range,\n * we return -1 to the caller, to mean, in the specified range there\n * is not a single \"0\" bit. */\n if (end_given && bit == 0 && pos == bytes*8) {\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n addReplyLongLong(c,-1);\n return;\n }\n if (pos != -1) pos += start*8; /* Adjust for the bytes we skipped. */\n addReplyLongLong(c,pos);\n }\n unlockDb(c->db);\n update_stats_add(c->vel->stats, keyspace_hits, 1);\n}\n\n/* BITFIELD key subcommmand-1 arg ... subcommand-2 arg ... subcommand-N ...\n *\n * Supported subcommands:\n *\n * GET \n * SET \n * INCRBY \n * OVERFLOW [WRAP|SAT|FAIL]\n */\n\nstruct bitfieldOp {\n uint64_t offset; /* Bitfield offset. */\n int64_t i64; /* Increment amount (INCRBY) or SET value */\n int opcode; /* Operation id. */\n int owtype; /* Overflow type to use. */\n int bits; /* Integer bitfield bits width. */\n int sign; /* True if signed, otherwise unsigned op. */\n};\n\nvoid bitfieldCommand(client *c) {\n robj *o;\n size_t bitoffset;\n int j, numops = 0, changes = 0;\n struct bitfieldOp *ops = NULL; /* Array of ops to execute at end. */\n int owtype = BFOVERFLOW_WRAP; /* Overflow type. */\n\n for (j = 2; j < c->argc; j++) {\n int remargs = c->argc-j-1; /* Remaining args other than current. */\n char *subcmd = c->argv[j]->ptr; /* Current command name. */\n int opcode; /* Current operation code. */\n long long i64 = 0; /* Signed SET value. */\n int sign = 0; /* Signed or unsigned type? */\n int bits = 0; /* Bitfield width in bits. */\n\n if (!strcasecmp(subcmd,\"get\") && remargs >= 2)\n opcode = BITFIELDOP_GET;\n else if (!strcasecmp(subcmd,\"set\") && remargs >= 3)\n opcode = BITFIELDOP_SET;\n else if (!strcasecmp(subcmd,\"incrby\") && remargs >= 3)\n opcode = BITFIELDOP_INCRBY;\n else if (!strcasecmp(subcmd,\"overflow\") && remargs >= 1) {\n char *owtypename = c->argv[j+1]->ptr;\n j++;\n if (!strcasecmp(owtypename,\"wrap\"))\n owtype = BFOVERFLOW_WRAP;\n else if (!strcasecmp(owtypename,\"sat\"))\n owtype = BFOVERFLOW_SAT;\n else if (!strcasecmp(owtypename,\"fail\"))\n owtype = BFOVERFLOW_FAIL;\n else {\n addReplyError(c,\"Invalid OVERFLOW type specified\");\n dfree(ops);\n return;\n }\n continue;\n } else {\n addReply(c,shared.syntaxerr);\n dfree(ops);\n return;\n }\n\n /* Get the type and offset arguments, common to all the ops. */\n if (getBitfieldTypeFromArgument(c,c->argv[j+1],&sign,&bits) != VR_OK) {\n dfree(ops);\n return;\n }\n\n if (getBitOffsetFromArgument(c,c->argv[j+2],&bitoffset,1,bits) != VR_OK){\n dfree(ops);\n return;\n }\n\n /* INCRBY and SET require another argument. */\n if (opcode != BITFIELDOP_GET) {\n if (getLongLongFromObjectOrReply(c,c->argv[j+3],&i64,NULL) != VR_OK){\n dfree(ops);\n return;\n }\n }\n\n /* Populate the array of operations we'll process. */\n ops = drealloc(ops,sizeof(*ops)*(numops+1));\n ops[numops].offset = bitoffset;\n ops[numops].i64 = i64;\n ops[numops].opcode = opcode;\n ops[numops].owtype = owtype;\n ops[numops].bits = bits;\n ops[numops].sign = sign;\n numops++;\n\n j += 3 - (opcode == BITFIELDOP_GET);\n }\n\n addReplyMultiBulkLen(c,numops);\n\n /* Actually process the operations. */\n for (j = 0; j < numops; j++) {\n struct bitfieldOp *thisop = ops+j;\n\n /* Execute the operation. */\n if (thisop->opcode == BITFIELDOP_SET ||\n thisop->opcode == BITFIELDOP_INCRBY)\n {\n /* SET and INCRBY: We handle both with the same code path\n * for simplicity. SET return value is the previous value so\n * we need fetch & store as well. */\n\n /* Lookup by making room up to the farest bit reached by\n * this operation. */\n if ((o = lookupStringForBitCommand(c,\n thisop->offset + (thisop->bits-1), NULL)) == NULL) return;\n\n /* We need two different but very similar code paths for signed\n * and unsigned operations, since the set of functions to get/set\n * the integers and the used variables types are different. */\n if (thisop->sign) {\n int64_t oldval, newval, wrapped, retval;\n int overflow;\n\n oldval = getSignedBitfield(o->ptr,thisop->offset,\n thisop->bits);\n\n if (thisop->opcode == BITFIELDOP_INCRBY) {\n newval = oldval + thisop->i64;\n overflow = checkSignedBitfieldOverflow(oldval,\n thisop->i64,thisop->bits,thisop->owtype,&wrapped);\n if (overflow) newval = wrapped;\n retval = newval;\n } else {\n newval = thisop->i64;\n overflow = checkSignedBitfieldOverflow(newval,\n 0,thisop->bits,thisop->owtype,&wrapped);\n if (overflow) newval = wrapped;\n retval = oldval;\n }\n\n /* On overflow of type is \"FAIL\", don't write and return\n * NULL to signal the condition. */\n if (!(overflow && thisop->owtype == BFOVERFLOW_FAIL)) {\n addReplyLongLong(c,retval);\n setSignedBitfield(o->ptr,thisop->offset,\n thisop->bits,newval);\n } else {\n addReply(c,shared.nullbulk);\n }\n } else {\n uint64_t oldval, newval, wrapped, retval;\n int overflow;\n\n oldval = getUnsignedBitfield(o->ptr,thisop->offset,\n thisop->bits);\n\n if (thisop->opcode == BITFIELDOP_INCRBY) {\n newval = oldval + thisop->i64;\n overflow = checkUnsignedBitfieldOverflow(oldval,\n thisop->i64,thisop->bits,thisop->owtype,&wrapped);\n if (overflow) newval = wrapped;\n retval = newval;\n } else {\n newval = thisop->i64;\n overflow = checkUnsignedBitfieldOverflow(newval,\n 0,thisop->bits,thisop->owtype,&wrapped);\n if (overflow) newval = wrapped;\n retval = oldval;\n }\n /* On overflow of type is \"FAIL\", don't write and return\n * NULL to signal the condition. */\n if (!(overflow && thisop->owtype == BFOVERFLOW_FAIL)) {\n addReplyLongLong(c,retval);\n setUnsignedBitfield(o->ptr,thisop->offset,\n thisop->bits,newval);\n } else {\n addReply(c,shared.nullbulk);\n }\n }\n changes++;\n } else {\n /* GET */\n o = lookupKeyRead(c->db,c->argv[1]);\n size_t olen = (o == NULL) ? 0 : sdslen(o->ptr);\n unsigned char buf[9];\n\n /* For GET we use a trick: before executing the operation\n * copy up to 9 bytes to a local buffer, so that we can easily\n * execute up to 64 bit operations that are at actual string\n * object boundaries. */\n memset(buf,0,9);\n unsigned char *src = o ? o->ptr : NULL;\n int i;\n size_t byte = thisop->offset >> 3;\n for (i = 0; i < 9; i++) {\n if (src == NULL || i+byte >= olen) break;\n buf[i] = src[i+byte];\n }\n\n /* Now operate on the copied buffer which is guaranteed\n * to be zero-padded. */\n if (thisop->sign) {\n int64_t val = getSignedBitfield(buf,thisop->offset-(byte*8),\n thisop->bits);\n addReplyLongLong(c,val);\n } else {\n uint64_t val = getUnsignedBitfield(buf,thisop->offset-(byte*8),\n thisop->bits);\n addReplyLongLong(c,val);\n }\n }\n }\n\n if (changes) {\n signalModifiedKey(c->db,c->argv[1]);\n notifyKeyspaceEvent(NOTIFY_STRING,\"setbit\",c->argv[1],c->db->id);\n server.dirty += changes;\n }\n dfree(ops);\n}\n" }, { "path": "src/vr_bitops.h", "content": "#ifndef _VR_BITOPS_H_\n#define _VR_BITOPS_H_\n\nsize_t redisPopcount(void *s, long count);\nlong redisBitpos(void *s, unsigned long count, int bit);\nvoid setUnsignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits, uint64_t value);\nvoid setSignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits, int64_t value);\nuint64_t getUnsignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits);\nint64_t getSignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits);\nint checkUnsignedBitfieldOverflow(uint64_t value, int64_t incr, uint64_t bits, int owtype, uint64_t *limit);\nint checkSignedBitfieldOverflow(int64_t value, int64_t incr, uint64_t bits, int owtype, int64_t *limit);\nvoid printBits(unsigned char *p, unsigned long count);\nint getBitOffsetFromArgument(struct client *c, robj *o, size_t *offset, int hash, int bits);\nint getBitfieldTypeFromArgument(struct client *c, robj *o, int *sign, int *bits);\nrobj *lookupStringForBitCommand(struct client *c, size_t maxbit, int *expired);\nvoid setbitCommand(struct client *c);\nvoid getbitCommand(struct client *c);\nvoid bitopCommand(struct client *c);\nvoid bitcountCommand(struct client *c);\nvoid bitposCommand(struct client *c);\nvoid bitfieldCommand(client *c);\n#endif\n" }, { "path": "src/vr_block.c", "content": "#include \n\n\n/* Unblock a client calling the right function depending on the kind\n * of operation the client is blocking for. */\nvoid unblockClient(client *c) {\n if (c->btype == BLOCKED_LIST) {\n unblockClientWaitingData(c);\n } else if (c->btype == BLOCKED_WAIT) {\n unblockClientWaitingReplicas(c);\n } else {\n serverPanic(\"Unknown btype in unblockClient().\");\n }\n /* Clear the flags, and put the client in the unblocked list so that\n * we'll process new commands in its query buffer ASAP. */\n c->flags &= ~CLIENT_BLOCKED;\n c->btype = BLOCKED_NONE;\n c->vel->bpop_blocked_clients--;\n /* The client may already be into the unblocked list because of a previous\n * blocking operation, don't add back it into the list multiple times. */\n if (!(c->flags & CLIENT_UNBLOCKED)) {\n c->flags |= CLIENT_UNBLOCKED;\n dlistAddNodeTail(c->vel->unblocked_clients,c);\n }\n}\n\n/* Get a timeout value from an object and store it into 'timeout'.\n * The final timeout is always stored as milliseconds as a time where the\n * timeout will expire, however the parsing is performed according to\n * the 'unit' that can be seconds or milliseconds.\n *\n * Note that if the timeout is zero (usually from the point of view of\n * commands API this means no timeout) the value stored into 'timeout'\n * is zero. */\nint getTimeoutFromObjectOrReply(client *c, robj *object, long long *timeout, int unit) {\n long long tval;\n\n if (getLongLongFromObjectOrReply(c,object,&tval,\n \"timeout is not an integer or out of range\") != VR_OK)\n return VR_ERROR;\n\n if (tval < 0) {\n addReplyError(c,\"timeout is negative\");\n return VR_ERROR;\n }\n\n if (tval > 0) {\n if (unit == UNIT_SECONDS) tval *= 1000;\n tval += vr_msec_now();\n }\n *timeout = tval;\n\n return VR_OK;\n}\n\n/* Block a client for the specific operation type. Once the CLIENT_BLOCKED\n * flag is set client query buffer is not longer processed, but accumulated,\n * and will be processed when the client is unblocked. */\nvoid blockClient(client *c, int btype) {\n c->flags |= CLIENT_BLOCKED;\n c->btype = btype;\n c->vel->bpop_blocked_clients++;\n}\n" }, { "path": "src/vr_block.h", "content": "#ifndef _VR_BLOCK_H_\n#define _VR_BLOCK_H_\n\n/* This structure holds the blocking operation state for a client.\n * The fields used depend on client->btype. */\ntypedef struct blockingState {\n /* Generic fields. */\n long long timeout; /* Blocking operation timeout. If UNIX current time\n * is > timeout then the operation timed out. */\n\n /* BLOCKED_LIST */\n dict *keys; /* The keys we are waiting to terminate a blocking\n * operation such as BLPOP. Otherwise NULL. */\n robj *target; /* The key that should receive the element,\n * for BRPOPLPUSH. */\n\n /* BLOCKED_WAIT */\n int numreplicas; /* Number of replicas we are waiting for ACK. */\n long long reploffset; /* Replication offset to reach. */\n} blockingState;\n\nvoid blockClient(struct client *c, int btype);\nvoid unblockClient(struct client *c);\nint getTimeoutFromObjectOrReply(struct client *c, robj *object, long long *timeout, int unit);\n\n#endif\n" }, { "path": "src/vr_client.c", "content": "#include \n\nint ncurr_cconn = 0; /* current # client connections */\n\nstatic void setProtocolError(client *c, int pos);\n\n/* Return the size consumed from the allocator, for the specified SDS string,\n * including internal fragmentation. This function is used in order to compute\n * the client output buffer size. */\nsize_t sdsZmallocSize(sds s) {\n void *sh = sdsAllocPtr(s);\n return dmalloc_size(sh);\n}\n\nvoid *dupClientReplyValue(void *o) {\n return o;\n}\n\nvoid freeClientReplyValue(void *o) {\n freeObject(o);\n}\n\nint listMatchObjects(void *a, void *b) {\n return equalStringObjects(a,b);\n}\n\nclient *createClient(vr_eventloop *vel, struct conn *conn) {\n client *c = dalloc(sizeof(client));\n\n /* passing -1 as fd it is possible to create a non connected client.\n * This is useful since all the commands needs to be executed\n * in the context of a client. When commands are executed in other\n * contexts (for instance a Lua script) we need a non connected client. */\n if (conn->sd != -1) {\n vr_set_nonblocking(conn->sd);\n vr_set_tcpnodelay(conn->sd);\n if (server.tcpkeepalive)\n vr_set_tcpkeepalive(conn->sd,server.tcpkeepalive,0,0);\n if (aeCreateFileEvent(vel->el,conn->sd,AE_READABLE,\n readQueryFromClient, c) == AE_ERR)\n {\n log_error(\"Unrecoverable error creating client ipfd file event.\");\n dfree(c);\n return NULL;\n }\n }\n\n selectDb(c,0);\n c->id = vel->next_client_id++;\n c->conn = conn;\n c->vel = vel;\n c->scanid = -1;\n c->name = NULL;\n c->bufpos = 0;\n c->querybuf = sdsempty();\n c->querybuf_peak = 0;\n c->reqtype = 0;\n c->argc = 0;\n c->argv = NULL;\n c->cmd = c->lastcmd = NULL;\n c->multibulklen = 0;\n c->bulklen = -1;\n c->sentlen = 0;\n c->flags = 0;\n c->ctime = c->lastinteraction = vel->unixtime;\n c->authenticated = 0;\n c->replstate = REPL_STATE_NONE;\n c->repl_put_online_on_ack = 0;\n c->reploff = 0;\n c->repl_ack_off = 0;\n c->repl_ack_time = 0;\n c->slave_listening_port = 0;\n c->slave_capa = SLAVE_CAPA_NONE;\n c->reply = dlistCreate();\n c->reply_bytes = 0;\n c->obuf_soft_limit_reached_time = 0;\n dlistSetFreeMethod(c->reply,freeClientReplyValue);\n dlistSetDupMethod(c->reply,dupClientReplyValue);\n c->btype = BLOCKED_NONE;\n c->bpop.timeout = 0;\n c->bpop.keys = dictCreate(&setDictType,NULL);\n c->bpop.target = NULL;\n c->bpop.numreplicas = 0;\n c->bpop.reploffset = 0;\n c->woff = 0;\n c->watched_keys = dlistCreate();\n c->pubsub_channels = dictCreate(&setDictType,NULL);\n c->pubsub_patterns = dlistCreate();\n c->peerid = NULL;\n c->curidx = -1;\n c->taridx = -1;\n c->steps = 0;\n c->cache = NULL;\n dlistSetFreeMethod(c->pubsub_patterns,decrRefCountVoid);\n dlistSetMatchMethod(c->pubsub_patterns,listMatchObjects);\n if (conn->sd != -1) dlistAddNodeTail(vel->clients,c);\n initClientMultiState(c);\n return c;\n}\n\n/* This function is called every time we are going to transmit new data\n * to the client. The behavior is the following:\n *\n * If the client should receive new data (normal clients will) the function\n * returns VR_OK, and make sure to install the write handler in our event\n * loop so that when the socket is writable new data gets written.\n *\n * If the client should not receive new data, because it is a fake client\n * (used to load AOF in memory), a master or because the setup of the write\n * handler failed, the function returns VR_ERROR.\n *\n * The function may return VR_OK without actually installing the write\n * event handler in the following cases:\n *\n * 1) The event handler should already be installed since the output buffer\n * already contained something.\n * 2) The client is a slave but not yet online, so we want to just accumulate\n * writes in the buffer but not actually sending them yet.\n *\n * Typically gets called every time a reply is built, before adding more\n * data to the clients output buffers. If the function returns VR_ERROR no\n * data should be appended to the output buffers. */\nint prepareClientToWrite(client *c) {\n /* If it's the Lua client we always return ok without installing any\n * handler since there is no socket at all. */\n if (c->flags & CLIENT_LUA) return VR_OK;\n\n /* CLIENT REPLY OFF / SKIP handling: don't send replies. */\n if (c->flags & (CLIENT_REPLY_OFF|CLIENT_REPLY_SKIP)) return VR_ERROR;\n\n /* Masters don't receive replies, unless CLIENT_MASTER_FORCE_REPLY flag\n * is set. */\n if ((c->flags & CLIENT_MASTER) &&\n !(c->flags & CLIENT_MASTER_FORCE_REPLY)) return VR_ERROR;\n\n if (c->conn->sd <= 0) return VR_ERROR; /* Fake client for AOF loading. */\n\n /* Schedule the client to write the output buffers to the socket only\n * if not already done (there were no pending writes already and the client\n * was yet not flagged), and, for slaves, if the slave can actually\n * receive writes at this stage. */\n if (!clientHasPendingReplies(c) &&\n !(c->flags & CLIENT_PENDING_WRITE) &&\n (c->replstate == REPL_STATE_NONE ||\n (c->replstate == SLAVE_STATE_ONLINE && !c->repl_put_online_on_ack)))\n {\n /* Here instead of installing the write handler, we just flag the\n * client and put it into a list of clients that have something\n * to write to the socket. This way before re-entering the event\n * loop, we can try to directly write to the client sockets avoiding\n * a system call. We'll only really install the write handler if\n * we'll not be able to write the whole reply at once. */\n c->flags |= CLIENT_PENDING_WRITE;\n dlistAddNodeHead(c->vel->clients_pending_write,c);\n }\n\n /* Authorize the caller to queue in the output buffer of this client. */\n return VR_OK;\n}\n\n/* Create a duplicate of the last object in the reply list when\n * it is not exclusively owned by the reply list. */\nrobj *dupLastObjectIfNeeded(dlist *reply) {\n robj *new, *cur;\n dlistNode *ln;\n ASSERT(dlistLength(reply) > 0);\n ln = dlistLast(reply);\n cur = dlistNodeValue(ln);\n if (cur->constant) {\n new = dupStringObject(cur);\n dlistNodeValue(ln) = new;\n }\n return dlistNodeValue(ln);\n}\n\n/* -----------------------------------------------------------------------------\n * Low level functions to add more data to output buffers.\n * -------------------------------------------------------------------------- */\n\nint _addReplyToBuffer(client *c, const char *s, size_t len) {\n size_t available = sizeof(c->buf)-c->bufpos;\n\n if (c->flags & CLIENT_CLOSE_AFTER_REPLY) return VR_OK;\n\n /* If there already are entries in the reply list, we cannot\n * add anything more to the static buffer. */\n if (dlistLength(c->reply) > 0) return VR_ERROR;\n\n /* Check that the buffer has enough space available for this string. */\n if (len > available) return VR_ERROR;\n\n memcpy(c->buf+c->bufpos,s,len);\n c->bufpos+=len;\n return VR_OK;\n}\n\nvoid _addReplyObjectToList(client *c, robj *o) {\n robj *tail, *obj;\n\n if (c->flags & CLIENT_CLOSE_AFTER_REPLY) return;\n\n if (dlistLength(c->reply) == 0) {\n if (o->constant)\n obj = o;\n else\n obj = dupStringObject(o);\n dlistAddNodeTail(c->reply,obj);\n c->reply_bytes += getStringObjectSdsUsedMemory(obj);\n } else {\n tail = dlistNodeValue(dlistLast(c->reply));\n\n /* Append to this object when possible. */\n if (tail->ptr != NULL &&\n tail->encoding == OBJ_ENCODING_RAW &&\n sdslen(tail->ptr)+sdslen(o->ptr) <= PROTO_REPLY_CHUNK_BYTES)\n {\n c->reply_bytes -= sdsZmallocSize(tail->ptr);\n tail = dupLastObjectIfNeeded(c->reply);\n tail->ptr = sdscatlen(tail->ptr,o->ptr,sdslen(o->ptr));\n c->reply_bytes += sdsZmallocSize(tail->ptr);\n } else {\n if (o->constant)\n obj = o;\n else\n obj = dupStringObject(o);\n dlistAddNodeTail(c->reply,obj);\n c->reply_bytes += getStringObjectSdsUsedMemory(obj);\n }\n }\n asyncCloseClientOnOutputBufferLimitReached(c);\n}\n\n/* This method takes responsibility over the sds. When it is no longer\n * needed it will be free'd, otherwise it ends up in a robj. */\nvoid _addReplySdsToList(client *c, sds s) {\n robj *tail;\n\n if (c->flags & CLIENT_CLOSE_AFTER_REPLY) {\n sdsfree(s);\n return;\n }\n\n if (dlistLength(c->reply) == 0) {\n dlistAddNodeTail(c->reply,createObject(OBJ_STRING,s));\n c->reply_bytes += sdsZmallocSize(s);\n } else {\n tail = dlistNodeValue(dlistLast(c->reply));\n\n /* Append to this object when possible. */\n if (tail->ptr != NULL && tail->encoding == OBJ_ENCODING_RAW &&\n sdslen(tail->ptr)+sdslen(s) <= PROTO_REPLY_CHUNK_BYTES)\n {\n c->reply_bytes -= sdsZmallocSize(tail->ptr);\n tail = dupLastObjectIfNeeded(c->reply);\n tail->ptr = sdscatlen(tail->ptr,s,sdslen(s));\n c->reply_bytes += sdsZmallocSize(tail->ptr);\n sdsfree(s);\n } else {\n dlistAddNodeTail(c->reply,createObject(OBJ_STRING,s));\n c->reply_bytes += sdsZmallocSize(s);\n }\n }\n asyncCloseClientOnOutputBufferLimitReached(c);\n}\n\nvoid _addReplyStringToList(client *c, const char *s, size_t len) {\n robj *tail;\n\n if (c->flags & CLIENT_CLOSE_AFTER_REPLY) return;\n\n if (dlistLength(c->reply) == 0) {\n robj *o = createStringObject(s,len);\n\n dlistAddNodeTail(c->reply,o);\n c->reply_bytes += getStringObjectSdsUsedMemory(o);\n } else {\n tail = dlistNodeValue(dlistLast(c->reply));\n\n /* Append to this object when possible. */\n if (tail->ptr != NULL && tail->encoding == OBJ_ENCODING_RAW &&\n sdslen(tail->ptr)+len <= PROTO_REPLY_CHUNK_BYTES)\n {\n c->reply_bytes -= sdsZmallocSize(tail->ptr);\n tail = dupLastObjectIfNeeded(c->reply);\n tail->ptr = sdscatlen(tail->ptr,s,len);\n c->reply_bytes += sdsZmallocSize(tail->ptr);\n } else {\n robj *o = createStringObject(s,len);\n\n dlistAddNodeTail(c->reply,o);\n c->reply_bytes += getStringObjectSdsUsedMemory(o);\n }\n }\n asyncCloseClientOnOutputBufferLimitReached(c);\n}\n\n/* -----------------------------------------------------------------------------\n * Higher level functions to queue data on the client output buffer.\n * The following functions are the ones that commands implementations will call.\n * -------------------------------------------------------------------------- */\n\nvoid addReply(client *c, robj *obj) {\n if (prepareClientToWrite(c) != VR_OK) return;\n\n /* This is an important place where we can avoid copy-on-write\n * when there is a saving child running, avoiding touching the\n * refcount field of the object if it's not needed.\n *\n * If the encoding is RAW and there is room in the static buffer\n * we'll be able to send the object to the client without\n * messing with its page. */\n if (sdsEncodedObject(obj)) {\n if (_addReplyToBuffer(c,obj->ptr,sdslen(obj->ptr)) != VR_OK)\n _addReplyObjectToList(c,obj);\n } else if (obj->encoding == OBJ_ENCODING_INT) {\n robj *obj_new;\n /* Optimization: if there is room in the static buffer for 32 bytes\n * (more than the max chars a 64 bit integer can take as string) we\n * avoid decoding the object and go for the lower level approach. */\n if (dlistLength(c->reply) == 0 && (sizeof(c->buf) - c->bufpos) >= 32) {\n char buf[32];\n int len;\n\n len = ll2string(buf,sizeof(buf),(long)obj->ptr);\n if (_addReplyToBuffer(c,buf,len) == VR_OK)\n return;\n /* else... continue with the normal code path, but should never\n * happen actually since we verified there is room. */\n }\n obj_new = getDecodedObject(obj);\n if (_addReplyToBuffer(c,obj_new->ptr,sdslen(obj_new->ptr)) != VR_OK)\n _addReplyObjectToList(c,obj_new);\n if (obj_new != obj) freeObject(obj_new);\n } else {\n serverPanic(\"Wrong obj->encoding in addReply()\");\n }\n}\n\nvoid addReplySds(client *c, sds s) {\n if (prepareClientToWrite(c) != VR_OK) {\n /* The caller expects the sds to be free'd. */\n sdsfree(s);\n return;\n }\n if (_addReplyToBuffer(c,s,sdslen(s)) == VR_OK) {\n sdsfree(s);\n } else {\n /* This method free's the sds when it is no longer needed. */\n _addReplySdsToList(c,s);\n }\n}\n\nvoid addReplyString(client *c, const char *s, size_t len) {\n if (prepareClientToWrite(c) != VR_OK) return;\n if (_addReplyToBuffer(c,s,len) != VR_OK)\n _addReplyStringToList(c,s,len);\n}\n\nvoid addReplyErrorLength(client *c, const char *s, size_t len) {\n addReplyString(c,\"-ERR \",5);\n addReplyString(c,s,len);\n addReplyString(c,\"\\r\\n\",2);\n}\n\nvoid addReplyError(client *c, const char *err) {\n addReplyErrorLength(c,err,strlen(err));\n}\n\nvoid addReplyErrorFormat(client *c, const char *fmt, ...) {\n size_t l, j;\n va_list ap;\n va_start(ap,fmt);\n sds s = sdscatvprintf(sdsempty(),fmt,ap);\n va_end(ap);\n /* Make sure there are no newlines in the string, otherwise invalid protocol\n * is emitted. */\n l = sdslen(s);\n for (j = 0; j < l; j++) {\n if (s[j] == '\\r' || s[j] == '\\n') s[j] = ' ';\n }\n addReplyErrorLength(c,s,sdslen(s));\n sdsfree(s);\n}\n\nvoid addReplyStatusLength(client *c, const char *s, size_t len) {\n addReplyString(c,\"+\",1);\n addReplyString(c,s,len);\n addReplyString(c,\"\\r\\n\",2);\n}\n\nvoid addReplyStatus(client *c, const char *status) {\n addReplyStatusLength(c,status,strlen(status));\n}\n\nvoid addReplyStatusFormat(client *c, const char *fmt, ...) {\n va_list ap;\n va_start(ap,fmt);\n sds s = sdscatvprintf(sdsempty(),fmt,ap);\n va_end(ap);\n addReplyStatusLength(c,s,sdslen(s));\n sdsfree(s);\n}\n\n/* Adds an empty object to the reply list that will contain the multi bulk\n * length, which is not known when this function is called. */\nvoid *addDeferredMultiBulkLength(client *c) {\n /* Note that we install the write event here even if the object is not\n * ready to be sent, since we are sure that before returning to the\n * event loop setDeferredMultiBulkLength() will be called. */\n if (prepareClientToWrite(c) != VR_OK) return NULL;\n dlistAddNodeTail(c->reply,createObject(OBJ_STRING,NULL));\n return dlistLast(c->reply);\n}\n\n/* Populate the length object and try gluing it to the next chunk. */\nvoid setDeferredMultiBulkLength(client *c, void *node, long length) {\n dlistNode *ln = (dlistNode*)node;\n robj *len, *next;\n\n /* Abort when *node is NULL (see addDeferredMultiBulkLength). */\n if (node == NULL) return;\n\n len = dlistNodeValue(ln);\n len->ptr = sdscatprintf(sdsempty(),\"*%ld\\r\\n\",length);\n len->encoding = OBJ_ENCODING_RAW; /* in case it was an EMBSTR. */\n c->reply_bytes += sdsZmallocSize(len->ptr);\n if (ln->next != NULL) {\n next = dlistNodeValue(ln->next);\n\n /* Only glue when the next node is non-NULL (an sds in this case) */\n if (next->ptr != NULL) {\n c->reply_bytes -= sdsZmallocSize(len->ptr);\n c->reply_bytes -= getStringObjectSdsUsedMemory(next);\n len->ptr = sdscatlen(len->ptr,next->ptr,sdslen(next->ptr));\n c->reply_bytes += sdsZmallocSize(len->ptr);\n dlistDelNode(c->reply,ln->next);\n }\n }\n asyncCloseClientOnOutputBufferLimitReached(c);\n}\n\n/* Add a double as a bulk reply */\nvoid addReplyDouble(client *c, double d) {\n char dbuf[128], sbuf[128];\n int dlen, slen;\n if (isinf(d)) {\n /* Libc in odd systems (Hi Solaris!) will format infinite in a\n * different way, so better to handle it in an explicit way. */\n addReplyBulkCString(c, d > 0 ? \"inf\" : \"-inf\");\n } else {\n dlen = snprintf(dbuf,sizeof(dbuf),\"%.17g\",d);\n slen = snprintf(sbuf,sizeof(sbuf),\"$%d\\r\\n%s\\r\\n\",dlen,dbuf);\n addReplyString(c,sbuf,slen);\n }\n}\n\n/* Add a long double as a bulk reply, but uses a human readable formatting\n * of the double instead of exposing the crude behavior of doubles to the\n * dear user. */\nvoid addReplyHumanLongDouble(client *c, long double d) {\n robj *o = createStringObjectFromLongDouble(d,1);\n addReplyBulk(c,o);\n decrRefCount(o);\n}\n\n/* Add a long long as integer reply or bulk len / multi bulk count.\n * Basically this is used to output . */\nvoid addReplyLongLongWithPrefix(client *c, long long ll, char prefix) {\n char buf[128];\n int len;\n\n /* Things like $3\\r\\n or *2\\r\\n are emitted very often by the protocol\n * so we have a few shared objects to use if the integer is small\n * like it is most of the times. */\n if (prefix == '*' && ll < OBJ_SHARED_BULKHDR_LEN && ll >= 0) {\n addReply(c,shared.mbulkhdr[ll]);\n return;\n } else if (prefix == '$' && ll < OBJ_SHARED_BULKHDR_LEN && ll >= 0) {\n addReply(c,shared.bulkhdr[ll]);\n return;\n }\n\n buf[0] = prefix;\n len = ll2string(buf+1,sizeof(buf)-1,ll);\n buf[len+1] = '\\r';\n buf[len+2] = '\\n';\n addReplyString(c,buf,len+3);\n}\n\nvoid addReplyLongLong(client *c, long long ll) {\n if (ll == 0)\n addReply(c,shared.czero);\n else if (ll == 1)\n addReply(c,shared.cone);\n else\n addReplyLongLongWithPrefix(c,ll,':');\n}\n\nvoid addReplyMultiBulkLen(client *c, long length) {\n if (length < OBJ_SHARED_BULKHDR_LEN)\n addReply(c,shared.mbulkhdr[length]);\n else\n addReplyLongLongWithPrefix(c,length,'*');\n}\n\n/* Create the length prefix of a bulk reply, example: $2234 */\nvoid addReplyBulkLen(client *c, robj *obj) {\n size_t len;\n\n if (sdsEncodedObject(obj)) {\n len = sdslen(obj->ptr);\n } else {\n long n = (long)obj->ptr;\n\n /* Compute how many bytes will take this integer as a radix 10 string */\n len = 1;\n if (n < 0) {\n len++;\n n = -n;\n }\n while((n = n/10) != 0) {\n len++;\n }\n }\n\n if (len < OBJ_SHARED_BULKHDR_LEN)\n addReply(c,shared.bulkhdr[len]);\n else\n addReplyLongLongWithPrefix(c,len,'$');\n}\n\n/* Add a Redis Object as a bulk reply */\nvoid addReplyBulk(client *c, robj *obj) {\n addReplyBulkLen(c,obj);\n addReply(c,obj);\n addReply(c,shared.crlf);\n}\n\n/* Add a C buffer as bulk reply */\nvoid addReplyBulkCBuffer(client *c, const void *p, size_t len) {\n addReplyLongLongWithPrefix(c,len,'$');\n addReplyString(c,p,len);\n addReply(c,shared.crlf);\n}\n\n/* Add sds to reply (takes ownership of this sds and frees it) */\nvoid addReplyBulkSds(client *c, sds s) {\n addReplySds(c,sdscatfmt(sdsempty(),\"$%u\\r\\n\",\n (unsigned long)sdslen(s)));\n addReplySds(c,s);\n addReply(c,shared.crlf);\n}\n\n/* Add a C nul term string as bulk reply */\nvoid addReplyBulkCString(client *c, const char *s) {\n if (s == NULL) {\n addReply(c,shared.nullbulk);\n } else {\n addReplyBulkCBuffer(c,s,strlen(s));\n }\n}\n\n/* Add a long long as a bulk reply */\nvoid addReplyBulkLongLong(client *c, long long ll) {\n char buf[64];\n int len;\n\n len = ll2string(buf,64,ll);\n addReplyBulkCBuffer(c,buf,len);\n}\n\n/* Copy 'src' client output buffers into 'dst' client output buffers.\n * The function takes care of freeing the old output buffers of the\n * destination client. */\nvoid copyClientOutputBuffer(client *dst, client *src) {\n dlistRelease(dst->reply);\n dst->reply = dlistDup(src->reply);\n memcpy(dst->buf,src->buf,src->bufpos);\n dst->bufpos = src->bufpos;\n dst->reply_bytes = src->reply_bytes;\n}\n\n/* Return true if the specified client has pending reply buffers to write to\n * the socket. */\nint clientHasPendingReplies(client *c) {\n return c->bufpos || dlistLength(c->reply);\n}\n\nstatic void freeClientArgv(client *c) {\n int j;\n for (j = 0; j < c->argc; j++)\n freeObject(c->argv[j]);\n c->argc = 0;\n c->cmd = NULL;\n}\n\n/* Close all the slaves connections. This is useful in chained replication\n * when we resync with our own master and want to force all our slaves to\n * resync with us as well. */\nvoid disconnectSlaves(void) {\n while (dlistLength(repl.slaves)) {\n dlistNode *ln = dlistFirst(repl.slaves);\n freeClient((client*)ln->value);\n }\n}\n\n/* Remove the specified client from eventloop lists where the client could\n * be referenced from this eventloop, not including the Pub/Sub channels.\n * This is used by clients jump between workers. */\nvoid unlinkClientFromEventloop(client *c) {\n dlistNode *ln;\n vr_eventloop *vel = c->vel;\n\n c->vel = NULL;\n\n if (c->steps >= 1) return;\n \n /* If this is marked as current client unset it. */\n if (vel->current_client == c) vel->current_client = NULL;\n\n /* Certain operations must be done only if the client has an active socket.\n * If the client was already unlinked or if it's a \"fake client\" the\n * fd is already set to -1. */\n if (c->conn->sd != -1) {\n /* Remove from the list of active clients. */\n ln = dlistSearchKey(vel->clients,c);\n ASSERT(ln != NULL);\n dlistDelNode(vel->clients,ln);\n\n /* Unregister async I/O handlers and close the socket. */\n aeDeleteFileEvent(vel->el,c->conn->sd,AE_READABLE);\n aeDeleteFileEvent(vel->el,c->conn->sd,AE_WRITABLE);\n }\n\n /* Remove from the list of pending writes if needed. */\n if (c->flags & CLIENT_PENDING_WRITE) {\n ln = dlistSearchKey(vel->clients_pending_write,c);\n ASSERT(ln != NULL);\n dlistDelNode(vel->clients_pending_write,ln);\n c->flags &= ~CLIENT_PENDING_WRITE;\n }\n\n /* When client was just unblocked because of a blocking operation,\n * remove it from the list of unblocked clients. */\n if (c->flags & CLIENT_UNBLOCKED) {\n ln = dlistSearchKey(vel->unblocked_clients,c);\n ASSERT(ln != NULL);\n dlistDelNode(vel->unblocked_clients,ln);\n c->flags &= ~CLIENT_UNBLOCKED;\n }\n}\n\nvoid linkClientToEventloop(client *c,vr_eventloop *vel) {\n dlistPush(vel->clients,c);\n c->vel = vel;\n if (aeCreateFileEvent(vel->el,c->conn->sd,AE_READABLE,\n readQueryFromClient,c) == AE_ERR)\n {\n freeClient(c);\n return;\n }\n\n /* Handle the remain query buffer */\n processInputBuffer(c);\n if (c->flags&CLIENT_JUMP) {\n dispatch_conn_exist(c,c->taridx);\n } else {\n if (clientHasPendingReplies(c) && \n !(c->flags&CLIENT_PENDING_WRITE)) {\n if (aeCreateFileEvent(vel->el, c->conn->sd, AE_WRITABLE,\n sendReplyToClient, c) == AE_ERR)\n {\n freeClientAsync(c);\n }\n }\n }\n}\n\n/* Remove the specified client from global lists where the client could\n * be referenced, not including the Pub/Sub channels.\n * This is used by freeClient() and replicationCacheMaster(). */\nvoid unlinkClient(client *c) {\n dlistNode *ln;\n\n /* If this is marked as current client unset it. */\n if (c->vel->current_client == c) c->vel->current_client = NULL;\n\n /* Certain operations must be done only if the client has an active socket.\n * If the client was already unlinked or if it's a \"fake client\" the\n * fd is already set to -1. */\n if (c->conn->sd != -1) {\n /* Remove from the list of active clients. */\n ln = dlistSearchKey(c->vel->clients,c);\n ASSERT(ln != NULL);\n dlistDelNode(c->vel->clients,ln);\n\n /* Unregister async I/O handlers and close the socket. */\n aeDeleteFileEvent(c->vel->el,c->conn->sd,AE_READABLE);\n aeDeleteFileEvent(c->vel->el,c->conn->sd,AE_WRITABLE);\n conn_put(c->conn);\n c->conn = NULL;\n }\n\n /* Remove from the list of pending writes if needed. */\n if (c->flags & CLIENT_PENDING_WRITE) {\n ln = dlistSearchKey(c->vel->clients_pending_write,c);\n ASSERT(ln != NULL);\n dlistDelNode(c->vel->clients_pending_write,ln);\n c->flags &= ~CLIENT_PENDING_WRITE;\n }\n\n /* When client was just unblocked because of a blocking operation,\n * remove it from the list of unblocked clients. */\n if (c->flags & CLIENT_UNBLOCKED) {\n ln = dlistSearchKey(c->vel->unblocked_clients,c);\n ASSERT(ln != NULL);\n dlistDelNode(c->vel->unblocked_clients,ln);\n c->flags &= ~CLIENT_UNBLOCKED;\n }\n}\n\nvoid freeClient(client *c) {\n dlistNode *ln;\n\n /* If it is our master that's beging disconnected we should make sure\n * to cache the state to try a partial resynchronization later.\n *\n * Note that before doing this we make sure that the client is not in\n * some unexpected state, by checking its flags. */\n if (repl.role == REPLICATION_ROLE_MASTER && c->flags & CLIENT_MASTER) {\n log_warn(\"connection with master lost.\");\n if (!(c->flags & (CLIENT_CLOSE_AFTER_REPLY|\n CLIENT_CLOSE_ASAP|\n CLIENT_BLOCKED|\n CLIENT_UNBLOCKED)))\n {\n replicationCacheMaster(c);\n return;\n }\n }\n\n /* Log link disconnection with slave */\n if ((c->flags & CLIENT_SLAVE) && !(c->flags & CLIENT_MONITOR)) {\n log_warn(\"connection with slave %s lost.\",\n replicationGetSlaveName(c));\n }\n\n /* Free the query buffer */\n sdsfree(c->querybuf);\n c->querybuf = NULL;\n\n /* Deallocate structures used to block on blocking ops. */\n if (c->flags & CLIENT_BLOCKED) unblockClient(c);\n dictRelease(c->bpop.keys);\n\n /* UNWATCH all the keys */\n unwatchAllKeys(c);\n dlistRelease(c->watched_keys);\n\n /* Unsubscribe from all the pubsub channels */\n pubsubUnsubscribeAllChannels(c,0);\n pubsubUnsubscribeAllPatterns(c,0);\n dictRelease(c->pubsub_channels);\n dlistRelease(c->pubsub_patterns);\n\n /* Free data structures. */\n dlistRelease(c->reply);\n freeClientArgv(c);\n\n /* Unlink the client: this will close the socket, remove the I/O\n * handlers, and remove references of the client from different\n * places where active clients may be referenced. */\n unlinkClient(c);\n\n /* Master/slave cleanup Case 1:\n * we lost the connection with a slave. */\n if (c->flags & CLIENT_SLAVE) {\n if (c->replstate == SLAVE_STATE_SEND_BULK) {\n if (c->repldbfd != -1) close(c->repldbfd);\n if (c->replpreamble) sdsfree(c->replpreamble);\n }\n dlist *l = (c->flags & CLIENT_MONITOR) ? server.monitors : repl.slaves;\n ln = dlistSearchKey(l,c);\n ASSERT(ln != NULL);\n dlistDelNode(l,ln);\n /* We need to remember the time when we started to have zero\n * attached slaves, as after some time we'll free the replication\n * backlog. */\n if (c->flags & CLIENT_SLAVE && dlistLength(repl.slaves) == 0)\n repl.repl_no_slaves_since = c->vel->unixtime;\n refreshGoodSlavesCount();\n }\n\n /* Master/slave cleanup Case 2:\n * we lost the connection with the master. */\n if (c->flags & CLIENT_MASTER) replicationHandleMasterDisconnection();\n\n /* If this client was scheduled for async freeing we need to remove it\n * from the queue. */\n if (c->flags & CLIENT_CLOSE_ASAP) {\n ln = dlistSearchKey(c->vel->clients_to_close,c);\n ASSERT(ln != NULL);\n dlistDelNode(c->vel->clients_to_close,ln);\n }\n\n /* Release other dynamically allocated client structure fields,\n * and finally release the client structure itself. */\n if (c->name) freeObject(c->name);\n if (c->argv) dfree(c->argv);\n freeClientMultiState(c);\n sdsfree(c->peerid);\n dfree(c);\n}\n\n/* Schedule a client to free it at a safe time in the serverCron() function.\n * This function is useful when we need to terminate a client but we are in\n * a context where calling freeClient() is not possible, because the client\n * should be valid for the continuation of the flow of the program. */\nvoid freeClientAsync(client *c) {\n if (c->flags & CLIENT_CLOSE_ASAP || c->flags & CLIENT_LUA) return;\n c->flags |= CLIENT_CLOSE_ASAP;\n dlistAddNodeTail(c->vel->clients_to_close,c);\n}\n\nvoid freeClientsInAsyncFreeQueue(vr_eventloop *vel) {\n while (dlistLength(vel->clients_to_close)) {\n dlistNode *ln = dlistFirst(vel->clients_to_close);\n client *c = dlistNodeValue(ln);\n\n c->flags &= ~CLIENT_CLOSE_ASAP;\n freeClient(c);\n dlistDelNode(vel->clients_to_close,ln);\n }\n}\n\n/* Write data in output buffers to client. Return VR_OK if the client\n * is still valid after the call, VR_ERROR if it was freed. */\nint writeToClient(int fd, client *c, int handler_installed) {\n ssize_t nwritten = 0, totwritten = 0;\n size_t objlen;\n size_t objmem;\n robj *o;\n long long maxmemory;\n\n maxmemory = c->vel->cc.maxmemory;\n while(clientHasPendingReplies(c)) {\n if (c->bufpos > 0) {\n nwritten = vr_write(fd,c->buf+c->sentlen,c->bufpos-c->sentlen);\n if (nwritten <= 0) break;\n c->sentlen += nwritten;\n totwritten += nwritten;\n\n /* If the buffer was sent, set bufpos to zero to continue with\n * the remainder of the reply. */\n if ((int)c->sentlen == c->bufpos) {\n c->bufpos = 0;\n c->sentlen = 0;\n }\n } else {\n o = dlistNodeValue(dlistFirst(c->reply));\n objlen = sdslen(o->ptr);\n objmem = getStringObjectSdsUsedMemory(o);\n\n if (objlen == 0) {\n dlistDelNode(c->reply,dlistFirst(c->reply));\n c->reply_bytes -= objmem;\n continue;\n }\n\n nwritten = vr_write(fd, ((char*)o->ptr)+c->sentlen,objlen-c->sentlen);\n if (nwritten <= 0) break;\n c->sentlen += nwritten;\n totwritten += nwritten;\n\n /* If we fully sent the object on head go to the next one */\n if (c->sentlen == objlen) {\n dlistDelNode(c->reply,dlistFirst(c->reply));\n c->sentlen = 0;\n c->reply_bytes -= objmem;\n }\n }\n /* Note that we avoid to send more than NET_MAX_WRITES_PER_EVENT\n * bytes, in a single threaded server it's a good idea to serve\n * other clients as well, even if a very large request comes from\n * super fast link that is always able to accept data (in real world\n * scenario think about 'KEYS *' against the loopback interface).\n *\n * However if we are over the maxmemory limit we ignore that and\n * just deliver as much data as it is possible to deliver. */\n if (totwritten > NET_MAX_WRITES_PER_EVENT &&\n (maxmemory == 0 || dalloc_used_memory() < maxmemory)) \n break;\n }\n if (nwritten == -1) {\n if (errno == EAGAIN) {\n nwritten = 0;\n } else {\n log_debug(LOG_VERB,\n \"error writing to client: %s\", strerror(errno));\n freeClient(c);\n return VR_ERROR;\n }\n }\n if (totwritten > 0) {\n update_stats_add(c->vel->stats, net_output_bytes, (long long)totwritten);\n /* For clients representing masters we don't count sending data\n * as an interaction, since we always send REPLCONF ACK commands\n * that take some time to just fill the socket output buffer.\n * We just rely on data / pings received for timeout detection. */\n if (!(c->flags & CLIENT_MASTER)) c->lastinteraction = c->vel->unixtime;\n }\n if (!clientHasPendingReplies(c)) {\n c->sentlen = 0;\n if (handler_installed) aeDeleteFileEvent(c->vel->el,c->conn->sd,AE_WRITABLE);\n\n /* Close connection after entire reply has been sent. */\n if (c->flags & CLIENT_CLOSE_AFTER_REPLY) {\n freeClient(c);\n return VR_ERROR;\n }\n }\n return VR_OK;\n}\n\n/* Write event handler. Just send data to the client. */\nvoid sendReplyToClient(aeEventLoop *el, int fd, void *privdata, int mask) {\n UNUSED(el);\n UNUSED(mask);\n writeToClient(fd,privdata,1);\n}\n\n/* This function is called just before entering the event loop, in the hope\n * we can just write the replies to the client output buffer without any\n * need to use a syscall in order to install the writable event handler,\n * get it called, and so forth. */\nint handleClientsWithPendingWrites(vr_eventloop *vel) {\n dlistIter li;\n dlistNode *ln;\n int processed = dlistLength(vel->clients_pending_write);\n\n dlistRewind(vel->clients_pending_write,&li);\n while((ln = dlistNext(&li))) {\n client *c = dlistNodeValue(ln);\n c->flags &= ~CLIENT_PENDING_WRITE;\n dlistDelNode(vel->clients_pending_write,ln);\n\n /* Try to write buffers to the client socket. */\n if (writeToClient(c->conn->sd,c,0) == VR_ERROR) continue;\n\n /* If there is nothing left, do nothing. Otherwise install\n * the write handler. */\n if (clientHasPendingReplies(c) &&\n aeCreateFileEvent(vel->el, c->conn->sd, AE_WRITABLE,\n sendReplyToClient, c) == AE_ERR)\n {\n freeClientAsync(c);\n }\n }\n return processed;\n}\n\n/* resetClient prepare the client to process the next command */\nvoid resetClient(client *c) {\n redisCommandProc *prevcmd = c->cmd ? c->cmd->proc : NULL;\n\n if (c->flags&CLIENT_JUMP)\n return;\n\n freeClientArgv(c);\n c->reqtype = 0;\n c->multibulklen = 0;\n c->bulklen = -1;\n\n /* Remove the CLIENT_REPLY_SKIP flag if any so that the reply\n * to the next command will be sent, but set the flag if the command\n * we just processed was \"CLIENT REPLY SKIP\". */\n c->flags &= ~CLIENT_REPLY_SKIP;\n if (c->flags & CLIENT_REPLY_SKIP_NEXT) {\n c->flags |= CLIENT_REPLY_SKIP;\n c->flags &= ~CLIENT_REPLY_SKIP_NEXT;\n }\n}\n\nint processInlineBuffer(client *c) {\n char *newline;\n int argc, j;\n sds *argv, aux;\n size_t querylen;\n\n /* Search for end of line */\n newline = strchr(c->querybuf,'\\n');\n\n /* Nothing to do without a \\r\\n */\n if (newline == NULL) {\n if (sdslen(c->querybuf) > PROTO_INLINE_MAX_SIZE) {\n addReplyError(c,\"Protocol error: too big inline request\");\n setProtocolError(c,0);\n }\n return VR_ERROR;\n }\n\n /* Handle the \\r\\n case. */\n if (newline && newline != c->querybuf && *(newline-1) == '\\r')\n newline--;\n\n /* Split the input buffer up to the \\r\\n */\n querylen = newline-(c->querybuf);\n aux = sdsnewlen(c->querybuf,querylen);\n argv = sdssplitargs(aux,&argc);\n sdsfree(aux);\n if (argv == NULL) {\n addReplyError(c,\"Protocol error: unbalanced quotes in request\");\n setProtocolError(c,0);\n return VR_ERROR;\n }\n\n /* Newline from slaves can be used to refresh the last ACK time.\n * This is useful for a slave to ping back while loading a big\n * RDB file. */\n if (querylen == 0 && c->flags & CLIENT_SLAVE)\n c->repl_ack_time = c->vel->unixtime;\n\n /* Leave data after the first line of the query in the buffer */\n sdsrange(c->querybuf,querylen+2,-1);\n\n /* Setup argv array on client structure */\n if (argc) {\n if (c->argv) dfree(c->argv);\n c->argv = dalloc(sizeof(robj*)*argc);\n }\n\n /* Create redis objects for all arguments. */\n for (c->argc = 0, j = 0; j < argc; j++) {\n if (sdslen(argv[j])) {\n c->argv[c->argc] = createObject(OBJ_STRING,argv[j]);\n c->argc++;\n } else {\n sdsfree(argv[j]);\n }\n }\n dfree(argv);\n return VR_OK;\n}\n\n/* Helper function. Trims query buffer to make the function that processes\n * multi bulk requests idempotent. */\nstatic void setProtocolError(client *c, int pos) {\n if (log_loggable(LOG_VERB)) {\n sds client = catClientInfoString(sdsempty(),c);\n log_debug(LOG_VERB,\n \"Protocol error from client: %s\", client);\n sdsfree(client);\n }\n c->flags |= CLIENT_CLOSE_AFTER_REPLY;\n sdsrange(c->querybuf,pos,-1);\n}\n\nint processMultibulkBuffer(client *c) {\n char *newline = NULL;\n int pos = 0, ok;\n long long ll;\n\n if (c->multibulklen == 0) {\n /* The client should have been reset */\n serverAssertWithInfo(c,NULL,c->argc == 0);\n\n /* Multi bulk length cannot be read without a \\r\\n */\n newline = strchr(c->querybuf,'\\r');\n if (newline == NULL) {\n if (sdslen(c->querybuf) > PROTO_INLINE_MAX_SIZE) {\n addReplyError(c,\"Protocol error: too big mbulk count string\");\n setProtocolError(c,0);\n }\n return VR_ERROR;\n }\n\n /* Buffer should also contain \\n */\n if (newline-(c->querybuf) > ((signed)sdslen(c->querybuf)-2))\n return VR_ERROR;\n\n /* We know for sure there is a whole line since newline != NULL,\n * so go ahead and find out the multi bulk length. */\n serverAssertWithInfo(c,NULL,c->querybuf[0] == '*');\n ok = string2ll(c->querybuf+1,newline-(c->querybuf+1),&ll);\n if (!ok || ll > 1024*1024) {\n addReplyError(c,\"Protocol error: invalid multibulk length\");\n setProtocolError(c,pos);\n return VR_ERROR;\n }\n\n pos = (newline-c->querybuf)+2;\n if (ll <= 0) {\n sdsrange(c->querybuf,pos,-1);\n return VR_OK;\n }\n\n c->multibulklen = ll;\n\n /* Setup argv array on client structure */\n if (c->argv) dfree(c->argv);\n c->argv = dalloc(sizeof(robj*)*c->multibulklen);\n }\n\n serverAssertWithInfo(c,NULL,c->multibulklen > 0);\n while(c->multibulklen) {\n /* Read bulk length if unknown */\n if (c->bulklen == -1) {\n newline = strchr(c->querybuf+pos,'\\r');\n if (newline == NULL) {\n if (sdslen(c->querybuf) > PROTO_INLINE_MAX_SIZE) {\n addReplyError(c,\n \"Protocol error: too big bulk count string\");\n setProtocolError(c,0);\n return VR_ERROR;\n }\n break;\n }\n\n /* Buffer should also contain \\n */\n if (newline-(c->querybuf) > ((signed)sdslen(c->querybuf)-2))\n break;\n\n if (c->querybuf[pos] != '$') {\n addReplyErrorFormat(c,\n \"Protocol error: expected '$', got '%c'\",\n c->querybuf[pos]);\n setProtocolError(c,pos);\n return VR_ERROR;\n }\n\n ok = string2ll(c->querybuf+pos+1,newline-(c->querybuf+pos+1),&ll);\n if (!ok || ll < 0 || ll > 512*1024*1024) {\n addReplyError(c,\"Protocol error: invalid bulk length\");\n setProtocolError(c,pos);\n return VR_ERROR;\n }\n\n pos += newline-(c->querybuf+pos)+2;\n if (ll >= PROTO_MBULK_BIG_ARG) {\n size_t qblen;\n\n /* If we are going to read a large object from network\n * try to make it likely that it will start at c->querybuf\n * boundary so that we can optimize object creation\n * avoiding a large copy of data. */\n sdsrange(c->querybuf,pos,-1);\n pos = 0;\n qblen = sdslen(c->querybuf);\n /* Hint the sds library about the amount of bytes this string is\n * going to contain. */\n if (qblen < (size_t)ll+2)\n c->querybuf = sdsMakeRoomFor(c->querybuf,ll+2-qblen);\n }\n c->bulklen = ll;\n }\n\n /* Read bulk argument */\n if (sdslen(c->querybuf)-pos < (unsigned)(c->bulklen+2)) {\n /* Not enough data (+2 == trailing \\r\\n) */\n break;\n } else {\n /* Optimization: if the buffer contains JUST our bulk element\n * instead of creating a new object by *copying* the sds we\n * just use the current sds string. */\n if (pos == 0 &&\n c->bulklen >= PROTO_MBULK_BIG_ARG &&\n (signed) sdslen(c->querybuf) == c->bulklen+2)\n {\n c->argv[c->argc++] = createObject(OBJ_STRING,c->querybuf);\n sdsIncrLen(c->querybuf,-2); /* remove CRLF */\n /* Assume that if we saw a fat argument we'll see another one\n * likely... */\n c->querybuf = sdsnewlen(NULL,c->bulklen+2);\n sdsclear(c->querybuf);\n pos = 0;\n } else {\n c->argv[c->argc++] =\n createStringObject(c->querybuf+pos,c->bulklen);\n pos += c->bulklen+2;\n }\n c->bulklen = -1;\n c->multibulklen--;\n }\n }\n\n /* Trim to pos */\n if (pos) sdsrange(c->querybuf,pos,-1);\n\n /* We're done when c->multibulk == 0 */\n if (c->multibulklen == 0) return VR_OK;\n\n /* Still not read to process the command */\n return VR_ERROR;\n}\n\nvoid processInputBuffer(client *c) {\n c->vel->current_client = c;\n /* Keep processing while there is something in the input buffer */\n while(sdslen(c->querybuf)) {\n /* Return if clients are paused. */\n if (!(c->flags & CLIENT_SLAVE) && clientsArePaused(c->vel)) break;\n\n /* Immediately abort if the client is in the middle of something. */\n if (c->flags & CLIENT_BLOCKED) break;\n\n /* CLIENT_CLOSE_AFTER_REPLY closes the connection once the reply is\n * written to the client. Make sure to not let the reply grow after\n * this flag has been set (i.e. don't process more commands). */\n if (c->flags & CLIENT_CLOSE_AFTER_REPLY) break;\n\n /* Determine request type when unknown. */\n if (!c->reqtype) {\n if (c->querybuf[0] == '*') {\n c->reqtype = PROTO_REQ_MULTIBULK;\n } else {\n c->reqtype = PROTO_REQ_INLINE;\n }\n }\n\n if (c->reqtype == PROTO_REQ_INLINE) {\n if (processInlineBuffer(c) != VR_OK) break;\n } else if (c->reqtype == PROTO_REQ_MULTIBULK) {\n if (processMultibulkBuffer(c) != VR_OK) break;\n } else {\n serverPanic(\"Unknown request type\");\n }\n\n /* Multibulk processing could see a <= 0 length. */\n if (c->argc == 0) {\n resetClient(c);\n } else {\n /* Only reset the client when the command was executed. */\n if (processCommand(c) == VR_OK)\n resetClient(c);\n /* freeMemoryIfNeeded may flush slave output buffers. This may result\n * into a slave, that may be the active client, to be freed. */\n if (c->vel->current_client == NULL) break;\n\n /* If this client need to jump to another worker,\n * break this while loop. When this client jumped finished, \n * continue handle the remain query buffer. */\n if (c->flags&CLIENT_JUMP) break;\n }\n }\n c->vel->current_client = NULL;\n}\n\nvoid readQueryFromClient(aeEventLoop *el, int fd, void *privdata, int mask) {\n client *c = (client*) privdata;\n int nread, readlen;\n size_t qblen;\n UNUSED(el);\n UNUSED(mask);\n\n readlen = PROTO_IOBUF_LEN;\n /* If this is a multi bulk request, and we are processing a bulk reply\n * that is large enough, try to maximize the probability that the query\n * buffer contains exactly the SDS string representing the object, even\n * at the risk of requiring more read(2) calls. This way the function\n * processMultiBulkBuffer() can avoid copying buffers to create the\n * Redis Object representing the argument. */\n if (c->reqtype == PROTO_REQ_MULTIBULK && c->multibulklen && c->bulklen != -1\n && c->bulklen >= PROTO_MBULK_BIG_ARG)\n {\n int remaining = (unsigned)(c->bulklen+2)-sdslen(c->querybuf);\n\n if (remaining < readlen) readlen = remaining;\n }\n\n qblen = sdslen(c->querybuf);\n if (c->querybuf_peak < qblen) c->querybuf_peak = qblen;\n c->querybuf = sdsMakeRoomFor(c->querybuf, readlen);\n nread = vr_read(fd, c->querybuf+qblen, readlen);\n if (nread == -1) {\n if (errno == EAGAIN) {\n return;\n } else {\n log_debug(LOG_VERB, \"reading from client: %s\",strerror(errno));\n freeClient(c);\n return;\n }\n } else if (nread == 0) {\n log_debug(LOG_VERB, \"client closed connection\");\n freeClient(c);\n return;\n }\n\n sdsIncrLen(c->querybuf,nread);\n c->lastinteraction = c->vel->unixtime;\n if (c->flags & CLIENT_MASTER) c->reploff += nread;\n update_stats_add(c->vel->stats, net_input_bytes, nread);\n if (sdslen(c->querybuf) > server.client_max_querybuf_len) {\n sds ci = catClientInfoString(sdsempty(),c), bytes = sdsempty();\n\n bytes = sdscatrepr(bytes,c->querybuf,64);\n log_warn(\"closing client that reached max query buffer length: %s (qbuf initial bytes: %s)\", ci, bytes);\n sdsfree(ci);\n sdsfree(bytes);\n freeClient(c);\n return;\n }\n processInputBuffer(c);\n\n if (c->flags&CLIENT_JUMP) {\n dispatch_conn_exist(c,c->taridx);\n }\n}\n\nvoid getClientsMaxBuffers(vr_eventloop *vel, unsigned long *longest_output_list,\n unsigned long *biggest_input_buffer) {\n client *c;\n dlistNode *ln;\n dlistIter li;\n unsigned long lol = 0, bib = 0;\n\n dlistRewind(vel->clients,&li);\n while ((ln = dlistNext(&li)) != NULL) {\n c = dlistNodeValue(ln);\n\n if (dlistLength(c->reply) > lol) lol = dlistLength(c->reply);\n if (sdslen(c->querybuf) > bib) bib = sdslen(c->querybuf);\n }\n *longest_output_list = lol;\n *biggest_input_buffer = bib;\n}\n\n/* A Redis \"Peer ID\" is a colon separated ip:port pair.\n * For IPv4 it's in the form x.y.z.k:port, example: \"127.0.0.1:1234\".\n * For IPv6 addresses we use [] around the IP part, like in \"[::1]:1234\".\n * For Unix sockets we use path:0, like in \"/tmp/redis:0\".\n *\n * A Peer ID always fits inside a buffer of NET_PEER_ID_LEN bytes, including\n * the null term.\n *\n * On failure the function still populates 'peerid' with the \"?:0\" string\n * in case you want to relax error checking or need to display something\n * anyway (see anetPeerToString implementation for more info). */\nvoid genClientPeerId(client *client, char *peerid,\n size_t peerid_len) {\n if (client->flags & CLIENT_UNIX_SOCKET) {\n /* Unix socket client. */\n snprintf(peerid,peerid_len,\"%s:0\",server.unixsocket);\n } else {\n /* TCP client. */\n vr_net_format_peer(client->conn->sd,peerid,peerid_len);\n }\n}\n\n/* This function returns the client peer id, by creating and caching it\n * if client->peerid is NULL, otherwise returning the cached value.\n * The Peer ID never changes during the life of the client, however it\n * is expensive to compute. */\nchar *getClientPeerId(client *c) {\n char peerid[VR_INET_PEER_ID_LEN];\n\n if (c->peerid == NULL) {\n genClientPeerId(c,peerid,sizeof(peerid));\n c->peerid = sdsnew(peerid);\n }\n return c->peerid;\n}\n\n/* Concatenate a string representing the state of a client in an human\n * readable format, into the sds string 's'. */\nsds catClientInfoString(sds s, client *client) {\n char flags[16], events[3], *p;\n int emask;\n\n p = flags;\n if (client->flags & CLIENT_SLAVE) {\n if (client->flags & CLIENT_MONITOR)\n *p++ = 'O';\n else\n *p++ = 'S';\n }\n if (client->flags & CLIENT_MASTER) *p++ = 'M';\n if (client->flags & CLIENT_MULTI) *p++ = 'x';\n if (client->flags & CLIENT_BLOCKED) *p++ = 'b';\n if (client->flags & CLIENT_DIRTY_CAS) *p++ = 'd';\n if (client->flags & CLIENT_CLOSE_AFTER_REPLY) *p++ = 'c';\n if (client->flags & CLIENT_UNBLOCKED) *p++ = 'u';\n if (client->flags & CLIENT_CLOSE_ASAP) *p++ = 'A';\n if (client->flags & CLIENT_UNIX_SOCKET) *p++ = 'U';\n if (client->flags & CLIENT_READONLY) *p++ = 'r';\n if (p == flags) *p++ = 'N';\n *p++ = '\\0';\n\n emask = client->conn->sd == -1 ? 0 : aeGetFileEvents(client->vel->el,client->conn->sd);\n p = events;\n if (emask & AE_READABLE) *p++ = 'r';\n if (emask & AE_WRITABLE) *p++ = 'w';\n *p = '\\0';\n \n return sdscatfmt(s,\n \"oid=%i id=%U addr=%s fd=%i name=%s age=%I idle=%I flags=%s db=%i sub=%i psub=%i multi=%i qbuf=%U qbuf-free=%U obl=%U oll=%U omem=%U events=%s cmd=%s\",\n client->curidx,\n (unsigned long long) client->id,\n getClientPeerId(client),\n client->conn->sd,\n client->name ? (char*)client->name->ptr : \"\",\n (long long)(client->vel->unixtime - client->ctime),\n (long long)(client->vel->unixtime - client->lastinteraction),\n flags,\n client->dictid,\n (int) dictSize(client->pubsub_channels),\n (int) dlistLength(client->pubsub_patterns),\n (client->flags & CLIENT_MULTI) ? client->mstate.count : -1,\n (unsigned long long) sdslen(client->querybuf),\n (unsigned long long) sdsavail(client->querybuf),\n (unsigned long long) client->bufpos,\n (unsigned long long) dlistLength(client->reply),\n (unsigned long long) getClientOutputBufferMemoryUsage(client),\n events,\n client->lastcmd ? client->lastcmd->name : \"NULL\");\n}\n\nsds getAllClientsInfoString(vr_eventloop *vel) {\n dlistNode *ln;\n dlistIter li;\n client *client;\n sds o = sdsnewlen(NULL,200*dlistLength(vel->clients));\n sdsclear(o);\n dlistRewind(vel->clients,&li);\n while ((ln = dlistNext(&li)) != NULL) {\n client = dlistNodeValue(ln);\n o = catClientInfoString(o,client);\n o = sdscatlen(o,\"\\n\",1);\n }\n return o;\n}\n\nstruct clientkilldata {\n sds addr;\n int type;\n uint64_t id;\n int skipme;\n int killed;\n int close_this_client;\n};\n\nvoid clientCommand(client *c) {\n dlistNode *ln;\n dlistIter li;\n client *client;\n\n if (!strcasecmp(c->argv[1]->ptr,\"list\") && c->argc == 2) {\n /* CLIENT LIST */\n sds str = c->cache;\n sds o = getAllClientsInfoString(c->vel);\n\n str = sdscatsds(str?str:sdsempty(),o);\n\n if (c->steps >= (darray_n(&workers) - 1)) {\n addReplyBulkCBuffer(c,str,sdslen(str));\n c->steps = 0;\n c->taridx = -1;\n sdsfree(str);\n c->cache = NULL;\n c->flags &= ~CLIENT_JUMP;\n } else {\n if (!(c->flags&CLIENT_JUMP))\n c->flags |= CLIENT_JUMP;\n c->taridx = worker_get_next_idx(c->curidx);\n c->cache = str;\n }\n sdsfree(o);\n return;\n } else if (!strcasecmp(c->argv[1]->ptr,\"kill\")) {\n /* CLIENT KILL \n * CLIENT KILL