<commit_before>/* -*- mode: C; c-basic-offset: 4 -*- */

/* Test for #3522.    Show that even with DB_TRYAGAIN, isolation still works.
 * Strategy:
 *  1. Create a tree (with relatively small nodes so things happen quickly, and relatively large compared to the cache).
 *  2. Start two transactions YY and XX.
 *  3. Force XX to precede YY (e.g., XX reads the last row, and then YY deletes it, under MVCC).
 *  4. YY, in a single transaction: deletes everything
 *  5. YY does do a DB_FIRST.
 *     Set things up so that while YY is doing it's retries, XX inserts a row at the beginning.
 *  Make the test terminate by capturing the calls to pread(). */

#ident "$Id$"
#ident "Copyright (c) 2011 Tokutek Inc.  All rights reserved."
#ident "The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11/760379 and to the patents and/or patent applications resulting from it."

#include "test.h"

static DB_ENV *env;
static DB *db;
const int N = 1000;
static DB_TXN *XX, *YY;

long do_XX_on_pread = -1;
const int n_preads_limit = 1000;
long n_preads = 0;

static void insert(int i, DB_TXN *txn);

static ssize_t my_pread (int fd, void *buf, size_t count, off_t offset) {
    long n_read_so_far = __sync_fetch_and_add(&n_preads, 1);
    if (do_XX_on_pread==n_read_so_far) {
	// we're supposed to do the XX operation now.  Insert a row.
	printf("Did XX\n");
	insert(0, XX);
    }
    if (n_read_so_far > n_preads_limit) {
	if (verbose) fprintf(stderr, "Apparent infinite loop detected\n");
	abort();
    }
    return pread(fd, buf, count, offset);
}

static void
insert(int i, DB_TXN *txn)
{
    char hello[30], there[30];
    snprintf(hello, sizeof(hello), "hello%04d", i);
    snprintf(there, sizeof(there), "there%d", i);
    DBT key, val;
    int r=db->put(db, txn,
		  dbt_init(&key, hello, strlen(hello)+1),
		  dbt_init(&val, there, strlen(there)+1),
		  0);
    CKERR(r);
}

static void delete (int i, DB_TXN *x) {
    char hello[30];
    DBT key;
    if (verbose>1) printf("delete %d\n", i);
    snprintf(hello, sizeof(hello), "hello%04d", i);
    int r = db->del(db, x,
		    dbt_init(&key,  hello, strlen(hello)+1),
		    0);
    CKERR(r);
}

int did_nothing = 0;

static int
do_nothing(DBT const *UU(a), DBT  const *UU(b), void *UU(c)) {
    did_nothing++;
    return 0;
}


static void
setup (void) {<commit_msg>[t:4046], fix test3529<commit_after>/* -*- mode: C; c-basic-offset: 4 -*- */

/* Test for #3522.    Show that even with DB_TRYAGAIN, isolation still works.
 * Strategy:
 *  1. Create a tree (with relatively small nodes so things happen quickly, and relatively large compared to the cache).
 *  2. Start two transactions YY and XX.
 *  3. Force XX to precede YY (e.g., XX reads the last row, and then YY deletes it, under MVCC).
 *  4. YY, in a single transaction: deletes everything
 *  5. YY does do a DB_FIRST.
 *     Set things up so that while YY is doing it's retries, XX inserts a row at the beginning.
 *  Make the test terminate by capturing the calls to pread(). */

#ident "$Id$"
#ident "Copyright (c) 2011 Tokutek Inc.  All rights reserved."
#ident "The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11/760379 and to the patents and/or patent applications resulting from it."

#include "test.h"

static DB_ENV *env;
static DB *db;
const int N = 1000;
static DB_TXN *XX, *YY;

long do_XX_on_pread = -1;
const int n_preads_limit = 1000;
long n_preads = 0;

static void insert(int i, DB_TXN *txn);

static ssize_t my_pread (int fd, void *buf, size_t count, off_t offset) {
    long n_read_so_far = __sync_fetch_and_add(&n_preads, 1);
    if (do_XX_on_pread==n_read_so_far) {
	// we're supposed to do the XX operation now.  Insert a row.
	printf("Did XX\n");
	insert(0, XX);
    }
    if (n_read_so_far > n_preads_limit) {
	if (verbose) fprintf(stderr, "Apparent infinite loop detected\n");
	abort();
    }
    return pread(fd, buf, count, offset);
}

static void
insert(int i, DB_TXN *txn)
{
    char hello[30], there[30];
    snprintf(hello, sizeof(hello), "hello%04d", i);
    snprintf(there, sizeof(there), "there%d", i);
    DBT key, val;
    if (db) {
    int r=db->put(db, txn,
		  dbt_init(&key, hello, strlen(hello)+1),
		  dbt_init(&val, there, strlen(there)+1),
		  0);
    CKERR(r);
    }
}

static void delete (int i, DB_TXN *x) {
    char hello[30];
    DBT key;
    if (verbose>1) printf("delete %d\n", i);
    snprintf(hello, sizeof(hello), "hello%04d", i);
    int r = db->del(db, x,
		    dbt_init(&key,  hello, strlen(hello)+1),
		    0);
    CKERR(r);
}

int did_nothing = 0;

static int
do_nothing(DBT const *UU(a), DBT  const *UU(b), void *UU(c)) {
    did_nothing++;
    return 0;
}


static void
setup (void) {
    db = NULL;
{'fraction_non_alphanumeric': 0.12450278440731902, 'fraction_numerical': 0.022275258552108195, 'mean_word_length': 3.514362657091562, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 11, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '74382', 'n_tokens_mistral': 1898, 'n_tokens_neox': 1768, 'n_words': 652}