/*
* __wt_btcur_range_truncate --
* Discard a cursor range from the tree.
*/
int
__wt_btcur_range_truncate(WT_CURSOR_BTREE *start, WT_CURSOR_BTREE *stop)
{
WT_BTREE *btree;
WT_CURSOR_BTREE *cbt;
WT_DECL_RET;
WT_SESSION_IMPL *session;
cbt = (start != NULL) ? start : stop;
session = (WT_SESSION_IMPL *)cbt->iface.session;
btree = cbt->btree;
/*
* For recovery, we log the start and stop keys for a truncate
* operation, not the individual records removed. On the other hand,
* for rollback we need to keep track of all the in-memory operations.
*
* We deal with this here by logging the truncate range first, then (in
* the logging code) disabling writing of the in-memory remove records
* to disk.
*/
if (FLD_ISSET(S2C(session)->log_flags, WT_CONN_LOG_ENABLED))
WT_RET(__wt_txn_truncate_log(session, start, stop));
switch (btree->type) {
case BTREE_COL_FIX:
WT_ERR(__cursor_truncate_fix(
session, start, stop, __cursor_col_modify));
break;
case BTREE_COL_VAR:
WT_ERR(__cursor_truncate(
session, start, stop, __cursor_col_modify));
break;
case BTREE_ROW:
/*
* The underlying cursor comparison routine requires cursors be
* fully instantiated when truncating row-store objects because
* it's comparing page and/or skiplist positions, not keys. (Key
* comparison would work, it's only that a key comparison would
* be relatively expensive. Column-store objects have record
* number keys, so the key comparison is cheap.) Cursors may
* have only had their keys set, so we must ensure the cursors
* are positioned in the tree.
*/
if (start != NULL)
WT_ERR(__wt_btcur_search(start));
if (stop != NULL)
WT_ERR(__wt_btcur_search(stop));
WT_ERR(__cursor_truncate(
session, start, stop, __cursor_row_modify));
break;
}
err: if (FLD_ISSET(S2C(session)->log_flags, WT_CONN_LOG_ENABLED))
WT_TRET(__wt_txn_truncate_end(session));
return (ret);
}
/*
* __curfile_search --
* WT_CURSOR->search method for the btree cursor type.
*/
static int
__curfile_search(WT_CURSOR *cursor)
{
WT_CURSOR_BTREE *cbt;
WT_DECL_RET;
WT_SESSION_IMPL *session;
cbt = (WT_CURSOR_BTREE *)cursor;
CURSOR_API_CALL(cursor, session, search, cbt->btree);
WT_CURSOR_NEEDKEY(cursor);
ret = __wt_btcur_search(cbt);
err: API_END(session);
return (ret);
}
/*
* __curfile_search --
* WT_CURSOR->search method for the btree cursor type.
*/
static int
__curfile_search(WT_CURSOR *cursor)
{
WT_CURSOR_BTREE *cbt;
WT_DECL_RET;
WT_SESSION_IMPL *session;
cbt = (WT_CURSOR_BTREE *)cursor;
CURSOR_API_CALL(cursor, session, search, cbt->btree);
WT_CURSOR_NEEDKEY(cursor);
WT_CURSOR_NOVALUE(cursor);
WT_BTREE_CURSOR_SAVE_AND_RESTORE(cursor, __wt_btcur_search(cbt), ret);
err: API_END_RET(session, ret);
}
/*
* __curfile_search --
* WT_CURSOR->search method for the btree cursor type.
*/
static int
__curfile_search(WT_CURSOR *cursor)
{
WT_CURSOR_BTREE *cbt;
WT_DECL_RET;
WT_SESSION_IMPL *session;
cbt = (WT_CURSOR_BTREE *)cursor;
CURSOR_API_CALL(cursor, session, search, cbt->btree);
WT_ERR(__cursor_checkkey(cursor));
WT_ERR(__wt_btcur_search(cbt));
/* Search maintains a position, key and value. */
WT_ASSERT(session,
F_MASK(cursor, WT_CURSTD_KEY_SET) == WT_CURSTD_KEY_INT &&
F_MASK(cursor, WT_CURSTD_VALUE_SET) == WT_CURSTD_VALUE_INT);
err: API_END_RET(session, ret);
}
