/*---
This software is copyrighted by the Regents of the University of
California, and other parties. The following terms apply to all files
associated with the software unless explicitly disclaimed in
individual files.

The authors hereby grant permission to use, copy, modify, distribute,
and license this software and its documentation for any purpose,
provided that existing copyright notices are retained in all copies
and that this notice is included verbatim in any distributions. No
written agreement, license, or royalty fee is required for any of the
authorized uses. Modifications to this software may be copyrighted by
their authors and need not follow the licensing terms described here,
provided that the new terms are clearly indicated on the first page of
each file where they apply.

IN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY
FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
ARISING OUT OF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY
DERIVATIVES THEREOF, EVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.

THE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND
NON-INFRINGEMENT. THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, AND
THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE
MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.

GOVERNMENT USE: If you are acquiring this software on behalf of the
U.S. government, the Government shall have only "Restricted Rights" in
the software and related documentation as defined in the Federal
Acquisition Regulations (FARs) in Clause 52.227.19 (c) (2). If you are
acquiring the software on behalf of the Department of Defense, the
software shall be classified as "Commercial Computer Software" and the
Government shall have only "Restricted Rights" as defined in Clause
252.227-7013 (c) (1) of DFARs. Notwithstanding the foregoing, the
authors grant the U.S. Government and others acting in its behalf
permission to use and distribute the software in accordance with the
terms specified in this license.
---*/

/** @file

    @todo check_page should judiciously avoid stasis_page_lsn_ptr()
*/
#include "../check_includes.h"

#include <stasis/page.h>
#include <stasis/page/slotted.h>
#include <stasis/page/fixed.h>
#include <stasis/experimental/latchFree/lfSlotted.h>
#include <stasis/operations/blobs.h>
#include <stasis/bufferManager.h>
#include <stasis/transactional.h>
#include <stasis/util/latches.h>
#include <stasis/util/random.h>

#include <sched.h>
#include <assert.h>

#define LOG_NAME   "check_page.log"

#define RECORD_SIZE sizeof(int)

pthread_mutex_t random_mutex;
static lsn_t lsn;
static pthread_mutex_t lsn_mutex;

static void * multiple_simultaneous_pages ( void * arg_ptr) {
  Page * p = (Page*)arg_ptr;
  int i;
  lsn_t this_lsn;
  short j;
  int first = 1;
  int k;
  recordid rid[100];

  for(i = 0; i < 10000; i++) {
    pthread_mutex_lock(&lsn_mutex);
    lsn++;
    this_lsn = lsn;
    readlock(p->rwlatch,0);
    assert(stasis_page_lsn_read(p) < this_lsn);
    unlock(p->rwlatch);
    pthread_mutex_unlock(&lsn_mutex);

    if(!first) {
      for(k = 0; k < 100; k++) {
        writelock(p->rwlatch,0);
        stasis_record_read(1, p, rid[k], (byte*)&j);
        assert((j + 1) ==  i + k);
        stasis_record_free(-1, p, rid[k]);
        stasis_page_lsn_write(-1, p, this_lsn);
        unlock(p->rwlatch);
        sched_yield();
      }
    }

    first = 0;

    for(k = 0; k < 100; k++) {
      writelock(p->rwlatch,0);
      rid[k] = stasis_record_alloc_begin(-1,p,sizeof(short));
      if(rid[k].size == INVALID_SLOT) { // Is rid[k] == NULLRID?
        stasis_record_compact(p);
        rid[k] = stasis_record_alloc_begin(-1,p,sizeof(short));
      }
      stasis_record_alloc_done(-1,p,rid[k]);
      short * buf = (short*)stasis_record_write_begin(-1,p,rid[k]);
      *buf = i+k;
      stasis_record_write_done(-1,p,rid[k],(byte*)buf);
      stasis_page_lsn_write(-1, p, this_lsn);
      assert(stasis_page_lsn_read(p) >= this_lsn);
      unlock(p->rwlatch);
      sched_yield();
    }

  }

  return NULL;
}


static void* fixed_worker_thread(void * arg_ptr) {
  Page * p = (Page*)arg_ptr;
  int i;
  lsn_t this_lsn;
  int first = 1;
  recordid rid;

  for(i = 0; i < 100; i++) {
    pthread_mutex_lock(&lsn_mutex);
    this_lsn = lsn;
    lsn++;
    pthread_mutex_unlock(&lsn_mutex);

    writelock(p->rwlatch,0);
    if(! first ) {
      int * buf = (int*)stasis_record_read_begin(-1,p,rid);
      assert(((*buf) + 1) ==  i);
      stasis_record_read_done(-1,p,rid,(byte*)buf);
    }
    first = 0;
    rid = stasis_record_alloc_begin(-1, p, sizeof(int));
    stasis_record_alloc_done(-1, p, rid);
    int * buf = (int*)stasis_record_write_begin(-1,p,rid);
    *buf = i;
    stasis_record_write_done(-1,p,rid,(byte*)buf);
    stasis_page_lsn_write(-1, p,lsn);
    assert(stasis_page_lsn_read(p) >= this_lsn);
    unlock(p->rwlatch);
    sched_yield();
  }
  return NULL;
}

typedef struct {
  Page ** pages;
  int num_pages;
  int my_page;
} latchFree_worker_thread_args;

static void* latchFree_worker_thread(void * arg_ptr) {
  latchFree_worker_thread_args * arg = arg_ptr;

  int alloced_count = 0;
  while(1) {
    int off = stasis_util_random64(arg->num_pages);
    Page * p = arg->pages[off];
    if(off == arg->my_page) {
      recordid rid = stasis_record_alloc_begin(-1, p, sizeof(char));
      if(rid.size == INVALID_SLOT) {
        assert(alloced_count > 200);
        return 0;
      } else {
        stasis_record_alloc_done(-1, p, rid);
        alloced_count++;
        assert(alloced_count < PAGE_SIZE/2);
        unsigned char c = (unsigned char)rid.slot;
        stasis_record_write(-1, p, rid, &c);
      }
    } else if(*stasis_page_slotted_numslots_cptr(p)) { // if the page is empty, try another.
      // read a random record
      int slot = stasis_util_random64(stasis_record_last(-1, p).slot+1);
      recordid rid;
      rid.page = p->id;
      rid.slot = slot;
      rid.size = sizeof(char);
      assert(stasis_record_type_read(-1, p, rid) == NORMAL_SLOT);
      assert(stasis_record_length_read(-1, p, rid) == sizeof(char));
      unsigned char c = 0;
      stasis_record_read(-1, p, rid, &c);
      assert(c == (unsigned char) rid.slot);
    }
  }
}
START_TEST(latchFreeThreadTest) {
  Tinit();
  int NUM_THREADS = 200;
  Page ** pages = stasis_malloc(NUM_THREADS, Page*);
  int xid = Tbegin();

  pageid_t region = TregionAlloc(xid, NUM_THREADS, -1);

  for(int i = 0; i < NUM_THREADS; i++) {
    pages[i] = loadPage(xid, i+region);
    stasis_page_slotted_latch_free_initialize_page(pages[i]);
  }

  pthread_t * threads = stasis_malloc(NUM_THREADS, pthread_t);

  for(int i = 0; i < NUM_THREADS; i++) {
    latchFree_worker_thread_args * arg = stasis_alloc(latchFree_worker_thread_args);
    arg->pages = pages;
    arg->my_page = i;
    arg->num_pages = NUM_THREADS;
    pthread_create(&threads[i], 0, &latchFree_worker_thread, arg);
  }
  for(int i = 0; i < NUM_THREADS; i++) {
    pthread_join(threads[i],0);
  }
  for(int i = 0; i < NUM_THREADS; i++) {
    releasePage(pages[i]);
  }
  Tcommit(xid);
  Tdeinit();

} END_TEST
static void* worker_thread(void * arg_ptr) {
  Page * p = (Page*)arg_ptr;
  int i;
  lsn_t this_lsn;
  int j;
  int first = 1;
  recordid rid;
  for(i = 0; i < 10000; i++) {
    pthread_mutex_lock(&lsn_mutex);

    this_lsn = lsn;
    lsn++;

    pthread_mutex_unlock(&lsn_mutex);

    if(! first ) {
      writelock(p->rwlatch,0);
      stasis_record_read(1, p, rid, (byte*)&j);
      assert((j + 1) ==  i);
      stasis_record_free(-1, p, rid);
      stasis_page_lsn_write(-1, p, this_lsn);
      unlock(p->rwlatch);
      sched_yield();
    }

    first = 0;

    // @todo In check_page, a condition variable would be more efficient...
    writelock(p->rwlatch,0);
    if(stasis_record_freespace(-1, p) < sizeof(int)) {
      first = 1;
    } else {
      rid = stasis_record_alloc_begin(-1, p, sizeof(int));
      stasis_record_alloc_done(-1, p, rid);
      int * buf = (int*)stasis_record_write_begin(-1, p, rid);
      stasis_page_lsn_write(-1,p,this_lsn);
      *buf = i;
      stasis_record_write_done(-1,p,rid,(byte*)buf);
      assert(stasis_page_lsn_read(p) >= this_lsn);
    }
    unlock(p->rwlatch);
    sched_yield();

  }

  return NULL;
}

/**
   @test

   just run one the worker_thread function once to make sure that it passes
   without interference from other threads.

   The number of slots allocated by the page tests is too low to check
   that freed space is recovered.

*/
START_TEST(pageNoThreadTest)
{
  Page * p;

  pthread_mutex_init(&lsn_mutex, NULL);

  Tinit();
  p = loadPage(-1, 0);
  writelock(p->rwlatch,0);
  memset(p->memAddr, 0, PAGE_SIZE);
  stasis_page_slotted_initialize_page(p);
  unlock(p->rwlatch);
  worker_thread(p);

  p->LSN = 0;
  *stasis_page_lsn_ptr(p) = p->LSN;

  releasePage(p);

  Tdeinit();

  pthread_mutex_destroy(&lsn_mutex);

}
END_TEST

/**
   @test
*/

START_TEST(pageCheckMacros) {
  Page p;
  byte buffer[PAGE_SIZE];
  memset(buffer, -1, PAGE_SIZE);

  p.memAddr = buffer;

  lsn_t lsn = 5;

  *stasis_page_lsn_ptr(&p) = lsn;
  *stasis_page_type_ptr(&p) = 10;
  *stasis_page_slotted_freespace_ptr(&p) = 15;
  *stasis_page_slotted_numslots_ptr(&p)  = 20;
  *stasis_page_slotted_slot_ptr(&p, 0)   = 30;
  *stasis_page_slotted_slot_ptr(&p, 1)   = 35;
  *stasis_page_slotted_slot_ptr(&p, 40)   = 40;
  *stasis_page_slotted_slot_length_ptr(&p, 0)   = 31;
  *stasis_page_slotted_slot_length_ptr(&p, 1)   = 36;
  *stasis_page_slotted_slot_length_ptr(&p, 40)   = 41;

  *stasis_page_byte_ptr_from_start(&p, 0) = 50;
  *stasis_page_byte_ptr_from_start(&p, 1) = 51;
  *stasis_page_byte_ptr_from_start(&p, 2) = 52;
  *stasis_page_byte_ptr_from_start(&p, 3) = 53;
  *stasis_page_byte_ptr_from_start(&p, 4) = 54;

  assert(*stasis_page_lsn_ptr(&p) == lsn);
  assert(*stasis_page_type_ptr(&p) == 10);
  //assert(end_of_usable_space_ptr(&p) == stasis_page_type_ptr(&p));
  assert(*stasis_page_slotted_freespace_ptr(&p) == 15);
  assert(*stasis_page_slotted_numslots_ptr(&p)  == 20);
  assert(*stasis_page_slotted_slot_ptr(&p, 0) == 30);
  assert(*stasis_page_slotted_slot_ptr(&p, 1) == 35);
  assert(*stasis_page_slotted_slot_ptr(&p, 40) == 40);
  assert(*stasis_page_slotted_slot_length_ptr(&p, 0) == 31);
  assert(*stasis_page_slotted_slot_length_ptr(&p, 1) == 36);
  assert(*stasis_page_slotted_slot_length_ptr(&p, 40) == 41);

  assert(*stasis_page_byte_ptr_from_start(&p, 0) == 50);
  assert(*stasis_page_byte_ptr_from_start(&p, 1) == 51);
  assert(*stasis_page_byte_ptr_from_start(&p, 2) == 52);
  assert(*stasis_page_byte_ptr_from_start(&p, 3) == 53);
  assert(*stasis_page_byte_ptr_from_start(&p, 4) == 54);

} END_TEST

static void assertRecordCountSizeType(int xid, Page *p, int count, int size, int type) {
  int foundRecords = 0;

  recordid it = stasis_record_first(xid,p);
  assert(it.size != INVALID_SLOT);
  do {
    foundRecords++;
    assert(stasis_record_length_read(xid,p,it)  == size);
    assert(stasis_record_type_read(xid,p,it) == type);
    it.size = 0;
    assert(stasis_record_length_read(xid,p,it)  == size);
    assert(stasis_record_type_read(xid,p,it) == type);
    it.size = INVALID_SLOT;
    assert(stasis_record_length_read(xid,p,it)  == size);
    assert(stasis_record_type_read(xid,p,it) == type);
    it = stasis_record_next(xid,p,it);
  } while(it.size != INVALID_SLOT);

  assert(foundRecords == count);
  assert(it.page == NULLRID.page);
  assert(it.slot   == NULLRID.slot);
  assert(it.size   == NULLRID.size);
}

static void checkPageIterators(int xid, Page *p,int record_count) {
  recordid first = stasis_record_alloc_begin(xid, p, sizeof(int64_t));
  stasis_record_alloc_done(xid,p,first);
  int64_t i = 0;
  stasis_record_write(xid,p,first,(byte*)&i);
  for(i = 1; i < record_count; i++) {
    recordid rid = stasis_record_alloc_begin(xid,p,sizeof(int64_t));
    stasis_record_alloc_done(xid,p,rid);
    stasis_record_write(xid,p,rid,(byte*)&i);
  }

  assertRecordCountSizeType(xid, p, record_count, sizeof(int64_t), NORMAL_SLOT);


  if(p->pageType == SLOTTED_PAGE) {
    recordid other = first;
    other.slot = 3;
    stasis_record_free(xid,p,other);
    assertRecordCountSizeType(xid, p, record_count-1, sizeof(int64_t), NORMAL_SLOT);
  }
}
/**
   @test

   Check functions used to iterate over pages

   XXX this should also test indirect pages.
*/
START_TEST(pageRecordSizeTypeIteratorTest) {
  Tinit();
  int xid = Tbegin();
  pageid_t pid = TpageAlloc(xid);

  Page * p = loadPage(xid,pid);

  memset(p->memAddr, 0, PAGE_SIZE);
  stasis_page_slotted_initialize_page(p);

  checkPageIterators(xid,p,10);

  pid = TpageAlloc(xid);
  releasePage(p);
  p = loadPage(xid,pid);

  memset(p->memAddr, 0, PAGE_SIZE);
  stasis_page_fixed_initialize_page(p,sizeof(int64_t),0);

  checkPageIterators(xid,p,10);

  memset(p->memAddr, 0, PAGE_SIZE);
  stasis_page_slotted_latch_free_initialize_page(p);

  checkPageIterators(xid,p,10);

  releasePage(p);

  Tcommit(xid);
  Tdeinit();
} END_TEST
/**
   @test

   Page test that allocates multiple records

*/
START_TEST(pageNoThreadMultPageTest)
{
  Page * p;
  /*    p->id = 0;*/


  pthread_mutex_init(&lsn_mutex, NULL);

  Tinit();

  p = loadPage(-1, 1);
  memset(p->memAddr, 0, PAGE_SIZE);
  p->LSN = 0;
  *stasis_page_lsn_ptr(p) = p->LSN;

  stasis_page_slotted_initialize_page(p);

  multiple_simultaneous_pages(p);
  // Normally, you would call pageWriteLSN() to update the LSN.  This
  // is a hack, since Tdeinit() will crash if it detects page updates
  // that are off the end of the log..
  p->LSN = 0;
  *stasis_page_lsn_ptr(p) = p->LSN;

  releasePage(p);

  /*  unlock(p->loadlatch); */


  Tdeinit();
  pthread_mutex_destroy(&lsn_mutex);

}
END_TEST

/**
    Check the page implementation in the multi-threaded case.
*/
START_TEST(pageThreadTest) {

#define  THREAD_COUNT 10
  pthread_t workers[THREAD_COUNT];
  int i;
  pthread_mutex_init(&random_mutex, NULL);
  pthread_mutex_init(&lsn_mutex, NULL);

  fail_unless(1, NULL);
  Tinit();
  Tdeinit();
  Tinit();
  fail_unless(1, NULL);

  Page * p = loadPage(-1, 2);
  memset(p->memAddr, 0, PAGE_SIZE);
  stasis_page_slotted_initialize_page(p);
  p->LSN = 0;
  *stasis_page_lsn_ptr(p) = p->LSN;

  fail_unless(1, NULL);

  for(i = 0; i < THREAD_COUNT; i++) {
    pthread_create(&workers[i], NULL, worker_thread, p);
  }
  fail_unless(1, NULL);

  for(i = 0; i < THREAD_COUNT; i++) {
    pthread_join(workers[i], NULL);
  }

  /*  unlock(p->loadlatch); */
  p->LSN = 0;
  *stasis_page_lsn_ptr(p) = p->LSN;
  releasePage(p);

  Tdeinit();

  pthread_mutex_destroy(&lsn_mutex);
  pthread_mutex_destroy(&random_mutex);

} END_TEST


/**
    @test
*/
START_TEST(fixedPageThreadTest) {
  pthread_t workers[THREAD_COUNT];
  int i;
  pthread_mutex_init(&random_mutex, NULL);
  pthread_mutex_init(&lsn_mutex, NULL);
  Tinit();
  Page * p = loadPage(-1, 2);
  memset(p->memAddr, 0, PAGE_SIZE);
  stasis_page_fixed_initialize_page(p, sizeof(int), 0);
  p->LSN = 0;
  *stasis_page_lsn_ptr(p) = p->LSN;


  for(i = 0; i < THREAD_COUNT; i++) {
    pthread_create(&workers[i], NULL, fixed_worker_thread, p);
  }

  for(i = 0; i < THREAD_COUNT; i++) {
    pthread_join(workers[i], NULL);
  }

  p->LSN = 0;
  *stasis_page_lsn_ptr(p) = p->LSN;
  releasePage(p);
  Tdeinit();
  pthread_mutex_destroy(&lsn_mutex);
  pthread_mutex_destroy(&random_mutex);
} END_TEST


START_TEST(pageCheckSlotTypeTest) {
	Tinit();
	int xid = Tbegin();

	recordid slot      = Talloc(xid, sizeof(int));
	recordid fixedRoot = TarrayListAlloc(xid, 2, 10, 10);
	recordid blob      = Talloc(xid, PAGE_SIZE * 2);

	Page * p = loadPage(-1, slot.page);
        assert(stasis_record_type_read(xid, p, slot) == NORMAL_SLOT);
        assert(stasis_record_length_read(xid, p, slot) == sizeof(int));
	releasePage(p);

	/** @todo the use of the fixedRoot recordid to check getRecordType is
		  a bit questionable, but should work. */
	p = loadPage(-1, fixedRoot.page);
	assert(stasis_record_type_read(xid, p, fixedRoot) == NORMAL_SLOT);
	releasePage(p);

	fixedRoot.slot = 1;

    assert(TrecordType(xid, fixedRoot) == NORMAL_SLOT);

	p = loadPage(-1, blob.page);
 	int type = stasis_record_type_read(xid, p, blob);
        assert(type == BLOB_SLOT);
	releasePage(p);

	recordid bad;
	bad.page = slot.page;
	bad.slot = slot.slot + 10;
	bad.size = 4;

	p = loadPage(xid, bad.page);
	assert(stasis_record_type_read(xid, p, bad) == INVALID_SLOT);
	bad.size = 100000;
	assert(stasis_record_type_read(xid, p, bad) == INVALID_SLOT);
	/** recordGetType now ignores the size field, so this (correctly) returns SLOTTED_RECORD */
	bad.slot = slot.slot;
	assert(stasis_record_type_read(xid, p, bad) == NORMAL_SLOT);
	p->LSN = 0;
	*stasis_page_lsn_ptr(p) = p->LSN;
	releasePage(p);

	Tcommit(xid);

	Tdeinit();
} END_TEST
/**
  @test unit test for TrecordType
*/
START_TEST(pageTrecordTypeTest) {
	Tinit();
	int xid = Tbegin();

	recordid slot      = Talloc(xid, sizeof(int));
	recordid fixedRoot = TarrayListAlloc(xid, 2, 10, 10);
	recordid blob      = Talloc(xid, PAGE_SIZE * 2);

	assert(TrecordType(xid, slot) == NORMAL_SLOT);
	assert(TrecordType(xid, fixedRoot) == NORMAL_SLOT);

	fixedRoot.slot = 1;

	int type = TrecordType(xid, blob);
	assert(type == BLOB_SLOT);

	recordid bad;
	bad.page = slot.page;
	bad.slot = slot.slot + 10;
	bad.size = 4;

	assert(TrecordType(xid, bad) == INVALID_SLOT);
	bad.size = 100000;
	assert(TrecordType(xid, bad) == INVALID_SLOT);

	bad.slot = slot.slot;
	assert(TrecordType(xid, bad) == NORMAL_SLOT);
	/* Try to trick TrecordType by allocating a record that's the
	   same length as the slot used by blobs. */
	recordid rid2 = Talloc(xid, sizeof(blob_record_t));
	assert(TrecordType(xid, rid2) == NORMAL_SLOT);

	Tcommit(xid);

	Tdeinit();
} END_TEST

START_TEST(pageTreeOpTest) {
  Tinit();
  int xid = Tbegin();

  pageid_t page = TpageAlloc(xid);

  // run a sanity check on a page pinned in ram; don't bother logging (since we don't care about recovery for this test)
  Page *p = loadPage(xid, page);

  stasis_page_slotted_initialize_page(p);

  recordid rids[5];
  // Alloc + set five records
  for(int i = 0; i < 5; i++) {
    rids[i] = stasis_record_alloc_begin(xid, p, sizeof(int));
    stasis_record_alloc_done(xid, p, rids[i]);
    assert(rids[i].slot == i);
    stasis_record_write(xid, p, rids[i], (byte*)(&i));
  }
  //Read them back, free the odd ones.
  for(int i = 0; i < 5; i++) {
    int j;
    stasis_record_read(xid, p, rids[i], (byte*)(&j));
    assert(i == j);
    if(i % 2) {
      stasis_record_free(xid, p, rids[i]);
    }
  }
  // Close holes due to odd ones.
  stasis_record_compact_slotids(xid, p);
  for(int i = 0; i < 3; i++) {
    int k = i * 2;
    int j;
    assert(stasis_record_type_read(xid, p, rids[i]) == NORMAL_SLOT);
    stasis_record_read(xid, p, rids[i], (byte*)(&j));
    assert(j == k);
  }
  // Reinsert odd ones at the end, then splice them back to their original position
  for(int i = 1; i < 5; i+=2) {
    recordid rid = stasis_record_alloc_begin(xid, p, sizeof(int));
    stasis_record_alloc_done(xid, p, rid);
    stasis_record_write(xid, p, rid, (byte*)(&i));
    stasis_record_splice(xid, p, i, rid.slot);
    int j;
    stasis_record_read(xid, p, rids[i], (byte*)(&j));
    assert(i == j);
  }
  // Does it still look right?
  for(int i = 0; i < 5; i++) {
    int j;
    stasis_record_read(xid, p, rids[i], (byte*)(&j));
    assert(i == j);
  }

  releasePage(p);

  Tcommit(xid);
  Tdeinit();
} END_TEST


Suite * check_suite(void) {
  Suite *s = suite_create("page");
  /* Begin a new test */
  TCase *tc = tcase_create("pagethreads");
  tcase_set_timeout(tc, 0); // disable timeouts
  /* Sub tests are added, one per line, here */

  tcase_add_test(tc, pageRecordSizeTypeIteratorTest);
  tcase_add_test(tc, pageCheckMacros);
  tcase_add_test(tc, pageCheckSlotTypeTest);
  tcase_add_test(tc, pageTrecordTypeTest);
  tcase_add_test(tc, pageTreeOpTest);
  tcase_add_test(tc, pageNoThreadMultPageTest);
  tcase_add_test(tc, pageNoThreadTest);
  tcase_add_test(tc, pageThreadTest);
  tcase_add_test(tc, fixedPageThreadTest);
  tcase_add_test(tc, latchFreeThreadTest);

  /* --------------------------------------------- */

  tcase_add_checked_fixture(tc, setup, teardown);

  suite_add_tcase(s, tc);
  return s;
}

#include "../check_setup.h"