Skip to content
Snippets Groups Projects
  1. Oct 05, 2012
    • Konstantin Osipov's avatar
      Refactoring: make sure row applier is called with context. · a48b9108
      Konstantin Osipov authored
      When we recover either from a remote source or
      from local log file/snapshot, a module "apply row" function
      is invoked. Up until now this function
      was invoked with a single argument - the row to apply,
      and there were no context which would be passed around.
      
      This worked fine as long as fibers were "all inclusive" --
      i.e. contained all possible context which a function may need.
      
      Now, when networking API and IO handles are split from
      struct fiber, they need to be passed around explicitly,
      in particular, into row apply function.
      
      Prepeare the code base for this.
      a48b9108
    • Konstantin Osipov's avatar
      Update AUTHORS · 8e464b42
      Konstantin Osipov authored
      8e464b42
  2. Oct 04, 2012
  3. Oct 05, 2012
  4. Oct 04, 2012
  5. Oct 03, 2012
  6. Oct 02, 2012
  7. Sep 30, 2012
  8. Sep 26, 2012
  9. Sep 24, 2012
  10. Sep 21, 2012
  11. Sep 19, 2012
  12. Sep 18, 2012
  13. Sep 17, 2012
  14. Sep 16, 2012
    • Konstantin Osipov's avatar
    • Konstantin Osipov's avatar
      A fix and a test case for Bug#1051006 · 52a25610
      Konstantin Osipov authored
      A fix and a test case for Bug#1051006
      "Tree iterators return garbage if an index is modified between calls"
      
      Mark in a deleted node in sptree.h that it's been  put into the
      garbage heap. When iterting over a garbage collected node, skip it,
      and go up the stack until we find the first valid node.
      
      This breaks the "sorted" quality of tree iterators in case there
      are modifications between invocations of an iterator:
      it is possible that a node is deleted and recycled, and we don't see
      it in the iterator. When we go up the stack, we can jump to a different
      part of the range than the one the recycled node belongs to.
      . With this fix, it is also possible, that the iteration goes more
      than once over entire tree range. But it's a good enough quick fix for a
      crashing expire loop, which uses the tree iterator over the primary key to
      scan the entire range and deletes expired keys on the go (additionally,
      deletions may occur between invocations of the expire loop).
      52a25610
  15. Sep 14, 2012
  16. Sep 13, 2012
  17. Sep 12, 2012
Loading