1. 14 Mar, 2014 1 commit
  2. 13 Mar, 2014 1 commit
  3. 11 Mar, 2014 4 commits
  4. 10 Mar, 2014 3 commits
    • antirez's avatar
      DEBUG ERROR implemented. · eb9e1526
      antirez authored
      The new "error" subcommand of the DEBUG command can reply with an user
      selected error, specified as its sole argument:
      
          DEBUG ERROR "LOADING please wait..."
      
      The error is generated just prefixing the command argument with a "-"
      character, and replacing newlines with spaces (since error replies can't
      include newlines).
      
      The goal of the command is to help in Client libraries unit tests by
      making simple to simulate a command call triggering a given error.
      eb9e1526
    • Matt Stancliff's avatar
      Fix return value check for anetTcpAccept · a6970570
      Matt Stancliff authored
      anetTcpAccept returns ANET_ERR, not AE_ERR.
      
      This isn't a physical error since both ANET_ERR
      and AE_ERR are -1, but better to be consistent.
      a6970570
    • antirez's avatar
  5. 05 Mar, 2014 8 commits
    • antirez's avatar
      Redis 2.8.7. · 464fef9b
      antirez authored
      464fef9b
    • antirez's avatar
      aab16ead
    • antirez's avatar
      Document why we update peak memory in INFO. · 55b8f6ec
      antirez authored
      55b8f6ec
    • Matt Stancliff's avatar
      Force INFO used_memory_peak to match peak memory · 647a2614
      Matt Stancliff authored
      used_memory_peak only updates in serverCron every server.hz,
      but Redis can use more memory and a user can request memory
      INFO before used_memory_peak gets updated in the next
      cron run.
      
      This patch updates used_memory_peak to the current
      memory usage if the current memory usage is higher
      than the recorded used_memory_peak value.
      
      (And it only calls zmalloc_used_memory() once instead of
      twice as it was doing before.)
      647a2614
    • antirez's avatar
      Sentinel test: Makefile target added. · 9c66cd91
      antirez authored
      9c66cd91
    • michael-grunder's avatar
      Improved bigkeys with progress, pipelining and summary · 69917929
      michael-grunder authored
      This commit reworks the redis-cli --bigkeys command to provide more
      information about our progress as well as output summary information
      when we're done.
      
       - We now show an approximate percentage completion as we go
       - Hiredis pipelining is used for TYPE and SIZE retreival
       - A summary of keyspace distribution and overall breakout at the end
      69917929
    • antirez's avatar
      Sentinel: more aggressive failover start desynchronization. · 1606978a
      antirez authored
      Sentinel needs to avoid split brain conditions due to multiple sentinels
      trying to get voted at the exact same time.
      
      So far some desynchronization was provided by fluctuating server.hz,
      that is the frequency of the timer function call. However the
      desynchonization provided in this way was not enough when using many
      Sentinel instances, especially when a large quorum value is used in
      order to force a greater degree of agreement (more than N/2+1).
      
      It was verified that it was likely to trigger a split brain
      condition, forcing the system to try again after a timeout.
      Usually the system will succeed after a few retries, but this is not
      optimal.
      
      This commit desynchronizes instances in a more effective way to make it
      likely that the first attempt will be successful.
      1606978a
    • antirez's avatar
      62001919
  6. 28 Feb, 2014 1 commit
  7. 27 Feb, 2014 8 commits
    • antirez's avatar
      warnigns -> warnings in redisBitpos(). · 1892b562
      antirez authored
      1892b562
    • antirez's avatar
      More consistent BITPOS behavior with bit=0 and ranges. · 2c8036f7
      antirez authored
      With the new behavior it is possible to specify just the start in the
      range (the end will be assumed to be the first byte), or it is possible
      to specify both start and end.
      
      This is useful to change the behavior of the command when looking for
      zeros inside a string.
      
      1) If the user specifies both start and end, and no 0 is found inside
         the range, the command returns -1.
      
      2) If instead no range is specified, or just the start is given, even
         if in the actual string no 0 bit is found, the command returns the
         first bit on the right after the end of the string.
      
      So for example if the string stored at key foo is "\xff\xff":
      
          BITPOS foo (returns 16)
          BITPOS foo 0 -1 (returns -1)
          BITPOS foo 0 (returns 16)
      
      The idea is that when no end is given the user is just looking for the
      first bit that is zero and can be set to 1 with SETBIT, as it is
      "available". Instead when a specific range is given, we just look for a
      zero within the boundaries of the range.
      2c8036f7
    • antirez's avatar
      Initial implementation of BITPOS. · 3294f74f
      antirez authored
      It appears to work but more stress testing, and both unit tests and
      fuzzy testing, is needed in order to ensure the implementation is sane.
      3294f74f
    • antirez's avatar
      Fix misaligned word access in redisPopcount(). · 30a92b6c
      antirez authored
      30a92b6c
    • antirez's avatar
      warnigns -> warnings in redisBitpos(). · c1cc28f2
      antirez authored
      c1cc28f2
    • antirez's avatar
      More consistent BITPOS behavior with bit=0 and ranges. · d79f9ebd
      antirez authored
      With the new behavior it is possible to specify just the start in the
      range (the end will be assumed to be the first byte), or it is possible
      to specify both start and end.
      
      This is useful to change the behavior of the command when looking for
      zeros inside a string.
      
      1) If the user specifies both start and end, and no 0 is found inside
         the range, the command returns -1.
      
      2) If instead no range is specified, or just the start is given, even
         if in the actual string no 0 bit is found, the command returns the
         first bit on the right after the end of the string.
      
      So for example if the string stored at key foo is "\xff\xff":
      
          BITPOS foo (returns 16)
          BITPOS foo 0 -1 (returns -1)
          BITPOS foo 0 (returns 16)
      
      The idea is that when no end is given the user is just looking for the
      first bit that is zero and can be set to 1 with SETBIT, as it is
      "available". Instead when a specific range is given, we just look for a
      zero within the boundaries of the range.
      d79f9ebd
    • antirez's avatar
      Initial implementation of BITPOS. · 25e2791e
      antirez authored
      It appears to work but more stress testing, and both unit tests and
      fuzzy testing, is needed in order to ensure the implementation is sane.
      25e2791e
    • antirez's avatar
      Fix misaligned word access in redisPopcount(). · 580ed076
      antirez authored
      580ed076
  8. 25 Feb, 2014 12 commits
  9. 20 Feb, 2014 1 commit
  10. 18 Feb, 2014 1 commit