- 10 Jul, 2020 1 commit
-
-
zhaozhao.zz authored
For example: BITOP not targetkey sourcekey If targetkey and sourcekey doesn't exist, BITOP has no effect, we do not propagate it, thus can save aof and replica flow.
-
- 22 Jun, 2020 1 commit
-
-
antirez authored
-
- 21 Apr, 2020 1 commit
-
-
antirez authored
-
- 08 Apr, 2020 1 commit
-
-
hayleeliu authored
-
- 23 Mar, 2020 2 commits
- 04 Mar, 2020 1 commit
-
-
bodong.ybd authored
-
- 18 Dec, 2019 2 commits
-
-
antirez authored
-
zhaozhao.zz authored
-
- 09 Apr, 2019 1 commit
-
-
yongman authored
-
- 09 Jan, 2019 1 commit
-
-
antirez authored
-
- 03 Jul, 2018 1 commit
-
-
Jack Drogon authored
-
- 23 Feb, 2017 2 commits
-
-
Salvatore Sanfilippo authored
-
Salvatore Sanfilippo authored
-
- 19 Feb, 2017 1 commit
-
-
Salvatore Sanfilippo authored
GCC will produce certain unaligned multi load-store instructions that will be trapped by the Linux kernel since ARM v6 cannot handle them with unaligned addresses. Better to use the slower but safer implementation instead of generating the exception which should be anyway very slow.
-
- 21 Oct, 2016 1 commit
-
-
sunhe authored
-
- 16 Jun, 2016 1 commit
-
-
antirez authored
Comment format fixed + local var modified from camel case to underscore separators as Redis code base normally does (camel case is mostly used for global symbols like structure names, function names, global vars, ...).
-
- 15 Jun, 2016 2 commits
- 05 Jun, 2016 1 commit
-
-
Pierre Chapuis authored
-
- 31 May, 2016 1 commit
-
-
antirez authored
Probably there is no compiler that will actaully break the code or raise a signal for unsigned -> signed overflowing conversion, still it was apparently possible to write it in a more correct way. All tests passing.
-
- 30 May, 2016 1 commit
-
-
wenduo authored
-
- 24 May, 2016 2 commits
-
-
oranagra authored
optimization: lookup key only once, and grow at once to the max need fixes #3259 and #3221, and also an early return if wrongtype is discovered by SET
-
- 18 May, 2016 1 commit
-
-
antirez authored
-
- 10 May, 2016 1 commit
-
-
oranagra authored
-
- 02 Mar, 2016 3 commits
- 29 Feb, 2016 1 commit
-
-
antirez authored
-
- 26 Feb, 2016 3 commits
-
-
antirez authored
-
antirez authored
-
antirez authored
The new bitfield command is an extension to the Redis bit operations, where not just single bit operations are performed, but the array of bits composing a string, can be addressed at random, not aligned offsets, with any width unsigned and signed integers like u8, s5, u10 (up to 64 bit signed integers and 63 bit unsigned integers). The BITFIELD command supports subcommands that can SET, GET, or INCRBY those arbitrary bit counters, with multiple overflow semantics. Trivial and credits: A similar command was imagined a few times in the past, but for some reason looked a bit far fetched or not well specified. Finally the command was proposed again in a clear form by Yoav Steinberg from Redis Labs, that proposed a set of commands on arbitrary sized integers stored at bit offsets. Starting from this proposal I wrote an initial specification of a single command with sub-commands similar to what Yoav envisioned, using short names for types definitions, and adding control on the overflow. This commit is the resulting implementation. Examples: BITFIELD mykey OVERFLOW wrap INCRBY i2 10 -1 GET i2 10
-
- 27 Jul, 2015 1 commit
-
-
antirez authored
-
- 26 Jul, 2015 4 commits
- 11 Dec, 2014 1 commit
-
-
Matt Stancliff authored
Previously the string was created empty then re-sized to fit the offset, but sds resize causes the sds to over-allocate by at least 1 MB (which is a lot when you are operating at bit-level access). This also improves the speed of initial sets by 2% to 6% based on quick testing. Patch logic provided by @oranagra Fixes #1918
-
- 03 Dec, 2014 1 commit
-
-
Sun He authored
-