- 07 May, 2014 5 commits
-
-
antirez authored
Bug introduced when adding a fast path to avoid copying the reply buffer for small replies that fit into the client static buffer.
-
antirez authored
The function showed up consuming a non trivial amount of time in the profiler output. After this change benchmarking gives a 6% speed improvement that can be consistently measured.
-
antirez authored
When the reply is only contained in the client static output buffer, use a fast path avoiding the dynamic allocation of an SDS string to concatenate the client reply objects.
-
antirez authored
-
antirez authored
It if faster to just create the string with a single sdsnewlen() call. If c->bufpos is zero, the call will simply be like sdsemtpy().
-
- 23 Apr, 2014 5 commits
-
-
Matt Stancliff authored
Verify proper expire-before-delete behavior. This test passes with the expire-before-delete commit and fails without it.
-
Matt Stancliff authored
Deleting an expired key should return 0, not success. Fixes #1648
-
Glauber Costa authored
I happen to be working on a system that lacks urandom. While the code does try to handle this case and artificially create some bytes if the file pointer is empty, it does try to close it unconditionally, leading to a segfault.
-
Salvatore Sanfilippo authored
Fixed typos.
-
antirez authored
When we set a protocol error we should return with REDIS_ERR to let the caller know it should stop processing the client. Bug found in a code auditing related to issue #1699.
-
- 22 Apr, 2014 4 commits
-
-
Kevin Menard authored
-
antirez authored
-
antirez authored
-
antirez authored
-
- 18 Apr, 2014 11 commits
-
-
antirez authored
-
antirez authored
-
antirez authored
-
antirez authored
The internal HLL raw encoding used by PFCOUNT when merging multiple keys is aligned to 8 bits (1 byte per register) so we can exploit this to improve performances by processing multiple bytes per iteration. In benchmarks the new code was several times faster with HLLs with many registers set to zero, while no slowdown was observed with populated HLLs.
-
antirez authored
When the register is set to zero, we need to add 2^-0 to E, which is 1, but it is faster to just add 'ez' at the end, which is the number of registers set to zero, a value we need to compute anyway.
-
antirez authored
-
antirez authored
-
antirez authored
-
antirez authored
-
antirez authored
-
antirez authored
-
- 16 Apr, 2014 15 commits
-
-
antirez authored
-
antirez authored
Given that the code was written with a 2 years pause... something strange happened in the middle. So there was no function to free a lex range min/max objects, and in some places the range was passed by value.
-
antirez authored
Like ZCOUNT for lexicographical ranges.
-
antirez authored
-
antirez authored
-
antirez authored
Converts HyperLogLogs from sparse to dense. Used for testing.
-
antirez authored
-
antirez authored
-
antirez authored
-
antirez authored
After running a few benchmarks, 3000 looks like a reasonable value to keep HLLs with a few thousand elements small while the CPU cost is still not huge. This covers all the cases where the dense representation would use N orders of magnitude more space, like in the case of many HLLs with carinality of a few tens or hundreds. It is not impossible that in the future this gets user configurable, however it is easy to pick an unreasoable value just looking at savings in the space dimension without checking what happens in the time dimension.
-
antirez authored
-
antirez authored
-
antirez authored
It is safer since it is able to have side effects.
-
antirez authored
Even if it is a debugging command, make sure that when it forces a change in encoding, the command is propagated.
-
antirez authored
If we converted to dense, a register must be updated in the dense representation.
-