equal
deleted
inserted
replaced
1 // Copyright (c) 2007-2010 Nokia Corporation and/or its subsidiary(-ies). |
1 // Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies). |
2 // All rights reserved. |
2 // All rights reserved. |
3 // This component and the accompanying materials are made available |
3 // This component and the accompanying materials are made available |
4 // under the terms of "Eclipse Public License v1.0" |
4 // under the terms of "Eclipse Public License v1.0" |
5 // which accompanies this distribution, and is available |
5 // which accompanies this distribution, and is available |
6 // at the URL "http://www.eclipse.org/legal/epl-v10.html". |
6 // at the URL "http://www.eclipse.org/legal/epl-v10.html". |
377 { |
377 { |
378 AddEntryL((*blockPtr)[count], ETrue); |
378 AddEntryL((*blockPtr)[count], ETrue); |
379 } |
379 } |
380 else |
380 else |
381 { |
381 { |
382 CMsvEntryFreePool::Instance()->ReleaseEntryL((*blockPtr)[count]); |
382 CMsvEntryFreePool::Instance()->ReleaseEntry((*blockPtr)[count]); |
383 } |
383 } |
384 } |
384 } |
385 blockPtr->Reset(); |
385 blockPtr->Reset(); |
386 blockPtr->Close(); |
386 blockPtr->Close(); |
387 } |
387 } |
582 //1.2 yes, check if getchildren has beeb performed on this visible folder |
582 //1.2 yes, check if getchildren has beeb performed on this visible folder |
583 if(IsComplete()) |
583 if(IsComplete()) |
584 { |
584 { |
585 //1.2.1 yes, only few blocks are dirty, so fetch and fill the dirty blocks |
585 //1.2.1 yes, only few blocks are dirty, so fetch and fill the dirty blocks |
586 RBuf8 buf; |
586 RBuf8 buf; |
587 buf.CreateL(2000); |
587 buf.Create(2000); |
588 CleanupClosePushL(buf); |
588 CleanupClosePushL(buf); |
589 TBool isDBOperationReqd = EFalse; |
589 TBool isDBOperationReqd = EFalse; |
590 for(TInt index=0; index < iIndexTable.Count(); ++index) |
590 for(TInt index=0; index < iIndexTable.Count(); ++index) |
591 { |
591 { |
592 if(iIndexTable[index]->IsDirty()) |
592 if(iIndexTable[index]->IsDirty()) |
692 } |
692 } |
693 // 2.4 Check If GetChildren has been already performed |
693 // 2.4 Check If GetChildren has been already performed |
694 else |
694 else |
695 { |
695 { |
696 RBuf8 buf; |
696 RBuf8 buf; |
697 buf.CreateL(2000); |
697 buf.Create(2000); |
698 CleanupClosePushL(buf); |
698 CleanupClosePushL(buf); |
699 CMsvCacheEntry* childEntry; |
699 CMsvCacheEntry* childEntry; |
700 TBool isDBOperationReqd = EFalse; |
700 TBool isDBOperationReqd = EFalse; |
701 for(TInt index=0; index< parentEntry->ChildIdArray()->Count(); ++index) |
701 for(TInt index=0; index< parentEntry->ChildIdArray()->Count(); ++index) |
702 { |
702 { |
1191 TInt blockCount = iIndexTable.Count(); |
1191 TInt blockCount = iIndexTable.Count(); |
1192 |
1192 |
1193 for(TInt index=0; index < blockCount; index++) |
1193 for(TInt index=0; index < blockCount; index++) |
1194 { |
1194 { |
1195 RBuf8 text; |
1195 RBuf8 text; |
1196 text.CreateL(100); |
1196 text.Create(100); |
1197 text.Append(KBlock); |
1197 text.Append(KBlock); |
1198 text.AppendNum(index+1); |
1198 text.AppendNum(index+1); |
1199 aLogger.Write(text); |
1199 aLogger.Write(text); |
1200 text.Close(); |
1200 text.Close(); |
1201 iIndexTable[index]->Print(aLogger); |
1201 iIndexTable[index]->Print(aLogger); |