text: /* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
  // vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
  #ident "$Id$"
  /*======
  This file is part of PerconaFT.
  
  
  Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved.
  
      PerconaFT is free software: you can redistribute it and/or modify
      it under the terms of the GNU General Public License, version 2,
      as published by the Free Software Foundation.
  
      PerconaFT is distributed in the hope that it will be useful,
      but WITHOUT ANY WARRANTY; without even the implied warranty of
      MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
      GNU General Public License for more details.
  
      You should have received a copy of the GNU General Public License
      along with PerconaFT.  If not, see <http://www.gnu.org/licenses/>.
  
  ----------------------------------------
  
      PerconaFT is free software: you can redistribute it and/or modify
      it under the terms of the GNU Affero General Public License, version 3,
      as published by the Free Software Foundation.
  
      PerconaFT is distributed in the hope that it will be useful,
      but WITHOUT ANY WARRANTY; without even the implied warranty of
      MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
      GNU Affero General Public License for more details.
  
      You should have received a copy of the GNU Affero General Public License
      along with PerconaFT.  If not, see <http://www.gnu.org/licenses/>.
  ======= */
  
  #ident "Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved."
  
  #pragma once
  
  #include "test.h"
  
  #include "locktree.h"
  #include "concurrent_tree.h"
  
  namespace toku {
  
  class locktree_unit_test {
  public:
      // test simple create and destroy of the locktree
      void test_create_destroy(void);
  
      // test that get/set userdata works, and that get_manager() works
      void test_misc(void);
  
      // test that simple read and write locks can be acquired
      void test_simple_lock(void);
  
      // test that:
      // - existing read locks can be upgrading to write locks
      // - overlapping locks are consolidated in the tree
      // - dominated locks succeed and are not stored in the tree
      void test_overlapping_relock(void);
  
      // test write lock conflicts when read or write locks exist
      // test read lock conflicts when write locks exist
      void test_conflicts(void);
      
      // test that ranges with infinite endpoints work
      void test_infinity(void);
  
      // make sure the single txnid optimization does not screw
      // up when there is more than one txnid with locks in the tree
      void test_single_txnid_optimization(void);
  
  private:
  
  
      template <typename F>
      static void locktree_iterate(const locktree *lt, F *function) {
          concurrent_tree::locked_keyrange ltr;
          keyrange infinite_range = keyrange::get_infinite_range();
  
          ltr.prepare(lt->m_rangetree);
          ltr.acquire(infinite_range);
          ltr.iterate<F>(function);
          ltr.release();
      }
  
      static bool no_row_locks(const locktree *lt) {
          return lt->m_rangetree->is_empty() && lt->m_sto_buffer.is_empty();
      }
  
      static void locktree_test_release_lock(locktree *lt, TXNID txnid, const DBT *left_key, const DBT *right_key) {
          range_buffer buffer;
          buffer.create();
          buffer.append(left_key, right_key);
          lt->release_locks(txnid, &buffer);
          buffer.destroy();
      }
  
      friend class lock_request_unit_test;
  };
  
  } /* namespace toku */
  