Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
| Comment: | Avoid writing completely empty segments to the snapshot. |
|---|---|
| Downloads: | Tarball | ZIP archive | SQL archive |
| Timelines: | family | ancestors | descendants | both | freelist-rework |
| Files: | files | file ages | folders |
| SHA1: |
803f36b62f1216b6a45c3c6ef66ac759 |
| User & Date: | dan 2012-10-30 17:34:44 |
Context
|
2012-10-30
| ||
| 18:46 | Another free-list related fix. check-in: a8acce6c87 user: dan tags: freelist-rework | |
| 17:34 | Avoid writing completely empty segments to the snapshot. check-in: 803f36b62f user: dan tags: freelist-rework | |
| 17:19 | Fix another free block list related bug. check-in: f9e75777b0 user: dan tags: freelist-rework | |
Changes
Changes to src/lsm_sorted.c.
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
....
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
|
mergeworker.bFlush = 1;
/* Do the work to create the new merged segment on disk */
if( rc==LSM_OK ) rc = lsmMCursorFirst(pCsr);
while( rc==LSM_OK && mergeWorkerDone(&mergeworker)==0 ){
rc = mergeWorkerStep(&mergeworker);
}
nWrite = mergeworker.nWork;
mergeWorkerShutdown(&mergeworker, &rc);
pNew->pMerge = 0;
pNew->iAge = 0;
}
/* Link the new level into the top of the tree. */
if( rc==LSM_OK ){
if( pDel ) pDel->iRoot = 0;
}else{
lsmDbSnapshotSetLevel(pDb->pWorker, pNext);
sortedFreeLevel(pDb->pEnv, pNew);
}
#if 0
lsmSortedDumpStructure(pDb, pDb->pWorker, 1, 0, "new-toplevel");
#endif
if( rc==LSM_OK ){
if( freelist.nEntry ){
Freelist *p = &pDb->pWorker->freelist;
lsmFree(pDb->pEnv, p->aEntry);
memcpy(p, &freelist, sizeof(freelist));
................................................................................
/* Clean up the MergeWorker object initialized above. If no error
** has occurred, invoke the work-hook to inform the application that
** the database structure has changed. */
mergeWorkerShutdown(&mergeworker, &rc);
if( rc==LSM_OK ) sortedInvokeWorkHook(pDb);
#if 0
lsmSortedDumpStructure(pDb, pDb->pWorker, 1, 0, "work");
#endif
assertBtreeOk(pDb, &pLevel->lhs);
assertRunInOrder(pDb, &pLevel->lhs);
/* If bFlush is true and the database is no longer considered "full",
** break out of the loop even if nRemaining is still greater than
** zero. The caller has an in-memory tree to flush to disk. */
|
>
|
>
|
>
|
|
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
....
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
|
mergeworker.bFlush = 1;
/* Do the work to create the new merged segment on disk */
if( rc==LSM_OK ) rc = lsmMCursorFirst(pCsr);
while( rc==LSM_OK && mergeWorkerDone(&mergeworker)==0 ){
rc = mergeWorkerStep(&mergeworker);
}
assert( rc!=LSM_OK || mergeworker.nWork==0 || pNew->lhs.iFirst );
nWrite = mergeworker.nWork;
mergeWorkerShutdown(&mergeworker, &rc);
pNew->pMerge = 0;
pNew->iAge = 0;
}
/* Link the new level into the top of the tree. */
if( rc==LSM_OK && pNew->lhs.iFirst ){
if( pDel ) pDel->iRoot = 0;
}else{
lsmDbSnapshotSetLevel(pDb->pWorker, pNext);
sortedFreeLevel(pDb->pEnv, pNew);
}
#if 0
if( pNew->lhs.iFirst ){
lsmSortedDumpStructure(pDb, pDb->pWorker, 0, 0, "new-toplevel");
}
#endif
if( rc==LSM_OK ){
if( freelist.nEntry ){
Freelist *p = &pDb->pWorker->freelist;
lsmFree(pDb->pEnv, p->aEntry);
memcpy(p, &freelist, sizeof(freelist));
................................................................................
/* Clean up the MergeWorker object initialized above. If no error
** has occurred, invoke the work-hook to inform the application that
** the database structure has changed. */
mergeWorkerShutdown(&mergeworker, &rc);
if( rc==LSM_OK ) sortedInvokeWorkHook(pDb);
#if 0
lsmSortedDumpStructure(pDb, pDb->pWorker, 0, 0, "work");
#endif
assertBtreeOk(pDb, &pLevel->lhs);
assertRunInOrder(pDb, &pLevel->lhs);
/* If bFlush is true and the database is no longer considered "full",
** break out of the loop even if nRemaining is still greater than
** zero. The caller has an in-memory tree to flush to disk. */
|