1. 07 Mar, 2012 2 commits
  2. 29 Feb, 2012 1 commit
  3. 28 Feb, 2012 3 commits
    • antirez's avatar
      Better system for additional commands replication. · 78d6a22d
      antirez authored
      The new code uses a more generic data structure to describe redis operations.
      The new design allows for multiple alsoPropagate() calls within the scope of a
      single command, that is useful in different contexts. For instance there
      when there are multiple clients doing BRPOPLPUSH against the same list,
      and a variadic LPUSH is performed against this list, the blocked clients
      will both be served, and we should correctly replicate multiple LPUSH
      commands after the replication of the current command.
      78d6a22d
    • antirez's avatar
      Added a new API to replicate an additional command after the replication of... · eeb34eff
      antirez authored
      Added a new API to replicate an additional command after the replication of the currently executed command, in order to propagte the LPUSH originating from RPOPLPUSH and indirectly by BRPOPLPUSH.
      eeb34eff
    • antirez's avatar
      Added command propagation API. · ad08d059
      antirez authored
      ad08d059
  4. 07 Feb, 2012 2 commits
  5. 06 Feb, 2012 2 commits
  6. 04 Feb, 2012 2 commits
    • antirez's avatar
      This fixes issue #327, is a very complex fix (unfortunately), details: · f6b32c14
      antirez authored
      1) sendReplyToClient() now no longer stops transferring data to a single
      client in the case we are out of memory (maxmemory-wise).
      
      2) in processCommand() the idea of we being out of memory is no longer
      the naive zmalloc_used_memory() > server.maxmemory. To say if we can
      accept or not write queries is up to the return value of
      freeMemoryIfNeeded(), that has full control about that.
      
      3) freeMemoryIfNeeded() now does its math without considering output
      buffers size. But at the same time it can't let the output buffers to
      put us too much outside the max memory limit, so at the same time it
      makes sure there is enough effort into delivering the output buffers to
      the slaves, calling the write handler directly.
      
      This three changes are the result of many tests, I found (partially
      empirically) that is the best way to address the problem, but maybe
      we'll find better solutions in the future.
      f6b32c14
    • antirez's avatar
      Use less memory when emitting the protocol, by using more shared objects for... · 355f8591
      antirez authored
      Use less memory when emitting the protocol, by using more shared objects for commonly emitted parts of the protocol.
      355f8591
  7. 02 Feb, 2012 3 commits
  8. 01 Feb, 2012 1 commit
    • antirez's avatar
      SORT is now more deterministic: does not accept to compare by score items that... · 2c861050
      antirez authored
      SORT is now more deterministic: does not accept to compare by score items that have scores not representing a valid double. Also items with the same score are compared lexycographically. At the same time the scripting side introduced the ability to sort the output of SORT when sort uses the BY <constant> optimization, resulting in no specific ordering. Since in this case the user may use GET, and the result of GET can be null, converted into false as Lua data type, this commit also introduces the ability to sort Lua tables containining false, only if the first (faster) attempt at using just table.sort with a single argument fails.
      2c861050
  9. 31 Jan, 2012 2 commits
  10. 24 Jan, 2012 1 commit
  11. 23 Jan, 2012 2 commits
  12. 21 Jan, 2012 2 commits
  13. 20 Jan, 2012 1 commit
  14. 12 Jan, 2012 1 commit
  15. 10 Jan, 2012 1 commit
  16. 21 Dec, 2011 5 commits
  17. 15 Dec, 2011 2 commits
  18. 14 Dec, 2011 1 commit
  19. 01 Dec, 2011 5 commits
  20. 30 Nov, 2011 1 commit