static int dbAutoWork(lsm_db *pDb, int nUnit){
int rc = LSM_OK; /* Return code */
assert( pDb->pWorker==0 );
assert( pDb->bAutowork );
assert( nUnit>0 );
/* If one is required, run a checkpoint. */
rc = lsmCheckpointWrite(pDb);
dbWorkerStart(pDb);
rc = lsmSortedAutoWork(pDb, nUnit);
dbWorkerDone(pDb);
return rc;
}
static int doWriteOp(
lsm_db *pDb,
int bDeleteRange,
const void *pKey, int nKey, /* Key to write or delete */
const void *pVal, int nVal /* Value to write. Or nVal==-1 for a delete */
){
int rc = LSM_OK; /* Return code */
int bCommit = 0; /* True to commit before returning */
if( pDb->nTransOpen==0 ){
bCommit = 1;
rc = lsm_begin(pDb, 1);
}
if( rc==LSM_OK ){
if( bDeleteRange==0 ){
rc = lsmLogWrite(pDb, (void *)pKey, nKey, (void *)pVal, nVal);
}else{
/* TODO */
}
}
lsmSortedSaveTreeCursors(pDb);
if( rc==LSM_OK ){
int pgsz = lsmFsPageSize(pDb->pFS);
int nQuant = LSM_AUTOWORK_QUANT * pgsz;
int nBefore;
int nAfter;
int nDiff;
if( nQuant>pDb->nTreeLimit ){
nQuant = pDb->nTreeLimit;
}
nBefore = lsmTreeSize(pDb);
if( bDeleteRange ){
rc = lsmTreeDelete(pDb, (void *)pKey, nKey, (void *)pVal, nVal);
}else{
rc = lsmTreeInsert(pDb, (void *)pKey, nKey, (void *)pVal, nVal);
}
nAfter = lsmTreeSize(pDb);
nDiff = (nAfter/nQuant) - (nBefore/nQuant);
if( rc==LSM_OK && pDb->bAutowork && nDiff!=0 ){
rc = lsmSortedAutoWork(pDb, nDiff * LSM_AUTOWORK_QUANT);
}
}
/* If a transaction was opened at the start of this function, commit it.
** Or, if an error has occurred, roll it back. */
if( bCommit ){
if( rc==LSM_OK ){
rc = lsm_commit(pDb, 0);
}else{
lsm_rollback(pDb, 0);
}
}
return rc;
}
