1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/persistentdata/persistentstorage/store/TCONT/t_storset.cpp Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,609 @@
1.4 +// Copyright (c) 1998-2010 Nokia Corporation and/or its subsidiary(-ies).
1.5 +// All rights reserved.
1.6 +// This component and the accompanying materials are made available
1.7 +// under the terms of "Eclipse Public License v1.0"
1.8 +// which accompanies this distribution, and is available
1.9 +// at the URL "http://www.eclipse.org/legal/epl-v10.html".
1.10 +//
1.11 +// Initial Contributors:
1.12 +// Nokia Corporation - initial contribution.
1.13 +//
1.14 +// Contributors:
1.15 +//
1.16 +// Description:
1.17 +//
1.18 +
1.19 +#include <s32cont.h>
1.20 +#include <s32page.h>
1.21 +#include <s32mem.h>
1.22 +#include <e32test.h>
1.23 +#include "U32STD.H"
1.24 +
1.25 +const TInt KTestCleanupStack=0x20;
1.26 +
1.27 +LOCAL_D CTrapCleanup* TheTrapCleanup;
1.28 +LOCAL_D RTest test(_L("t_storset"));
1.29 +
1.30 +/**
1.31 +@SYMTestCaseID SYSLIB-STORE-CT-1121
1.32 +@SYMTestCaseDesc TPagedSet class functionality test
1.33 +@SYMTestPriority High
1.34 +@SYMTestActions Tests insert/delete/contains without duplicates.
1.35 + Tests for emptying the set
1.36 +@SYMTestExpectedResults Test must not fail
1.37 +@SYMREQ REQ0000
1.38 +*/
1.39 +LOCAL_C void test1L()
1.40 + {
1.41 + test.Start(_L(" @SYMTestCaseID:SYSLIB-STORE-CT-1121 Insertion & Deletion "));
1.42 +
1.43 + const TInt KEntryCount=200;
1.44 + TPagedSet<TInt32> set;
1.45 + set.Connect(CMemPagePool::NewLC());
1.46 + //IsIntact() and IsDirty() test
1.47 + TBool rc = set.IsIntact();
1.48 + test(rc);
1.49 + rc = set.IsDirty();
1.50 + test(!rc);
1.51 + set.MarkDirty();
1.52 + rc = set.IsDirty();
1.53 + test(rc);
1.54 + //IsBroken() test
1.55 + rc = set.IsBroken();
1.56 + test(!rc);
1.57 + set.MarkBroken();
1.58 + rc = set.IsBroken();
1.59 + test(!rc);//Empty tree - cannot be marked as broken
1.60 + TInt yy = 10;
1.61 + set.InsertL(yy);
1.62 + set.MarkBroken();
1.63 + rc = set.IsBroken();
1.64 + test(rc);
1.65 + set.RepairL();
1.66 + rc = set.IsBroken();
1.67 + test(!rc);
1.68 + set.ClearL();
1.69 + rc = set.IsBroken();
1.70 + test(!rc);
1.71 +
1.72 + TInt32 it=0;
1.73 +//* test(set.InsertL(it));
1.74 + set.InsertL(it);
1.75 + test(set.Count()==1);
1.76 +//* test(!set.InsertL(it));
1.77 + test(set.Count()==1);
1.78 + test(set.ContainsL(it));
1.79 +//* test(set.DeleteL(it));
1.80 + set.DeleteL(it);
1.81 + test(set.Count()==0);
1.82 +//* test(!set.DeleteL(it));
1.83 +//* test(set.Count()==0);
1.84 + test(!set.ContainsL(it));
1.85 +
1.86 +//* test.Next(_L("Duplicates"));
1.87 + TInt ii;
1.88 +//* for (ii=0;ii<KEntryCount;++ii)
1.89 +//* test(set.InsertL(it,EAllowDuplicates));
1.90 +//* test(set.Count()==KEntryCount);
1.91 +//* test(set.ContainsL(it));
1.92 +//* test(!set.InsertL(it));
1.93 +//* for (ii=0;ii<KEntryCount;++ii)
1.94 +//* test(set.DeleteL(it));
1.95 +//* test(!set.ContainsL(it));
1.96 +//* test(!set.DeleteL(it));
1.97 +//* test(set.Count()==0);
1.98 +
1.99 + test.Next(_L("No duplicates"));
1.100 + for (ii=0;ii<KEntryCount;++ii)
1.101 + {
1.102 + it=ii;
1.103 +//* test(set.InsertL(it));
1.104 + set.InsertL(it);
1.105 + }
1.106 + for (ii=0;ii<KEntryCount;++ii)
1.107 + {
1.108 + it=ii;
1.109 +//* test(!set.InsertL(it));
1.110 + test(set.ContainsL(it));
1.111 + }
1.112 + test(set.Count()==KEntryCount);
1.113 +
1.114 + test.Next(_L("Empty the set"));
1.115 + set.ClearL();
1.116 + test(set.Count()==0);
1.117 + for (ii=0;ii<KEntryCount;++ii)
1.118 + {
1.119 + it=ii;
1.120 + test(!set.ContainsL(it));
1.121 + }
1.122 +
1.123 + test.End();
1.124 + CleanupStack::PopAndDestroy();
1.125 + }
1.126 +/**
1.127 +@SYMTestCaseID SYSLIB-STORE-CT-1122
1.128 +@SYMTestCaseDesc TPagedSet class functionality test with large (10000) set of TUint32.
1.129 +@SYMTestPriority High
1.130 +@SYMTestActions Insert,delete,contains,iteration operations test
1.131 +@SYMTestExpectedResults Test must not fail
1.132 +@SYMREQ REQ0000
1.133 +*/
1.134 +LOCAL_C void test2L()
1.135 + {
1.136 + const TInt KEntryCount=10000;
1.137 +
1.138 + TPagedSet<TUint32> set;
1.139 +//* set.Connect(CMemPagePool::NewLC(),TBtree::EQosFastest);
1.140 + set.Connect(CMemPagePool::NewLC());
1.141 +
1.142 + test.Start(_L(" @SYMTestCaseID:SYSLIB-STORE-CT-1122 Add items "));
1.143 + TUint32 jj=0;
1.144 + TInt32 ii;
1.145 + for (ii=KEntryCount;ii>0;--ii)
1.146 + {
1.147 + jj=(jj+17)%KEntryCount;
1.148 +//* test(set.InsertL(jj));
1.149 + set.InsertL(jj);
1.150 + }
1.151 + test(set.Count()==KEntryCount);
1.152 +
1.153 + test.Next(_L("Check contents"));
1.154 + for (ii=0;ii<KEntryCount;++ii)
1.155 + test(set.ContainsL(ii));
1.156 +
1.157 + test.Next(_L("Iterate over items"));
1.158 + TUint8 *checkMap=(TUint8*)User::AllocLC(KEntryCount);
1.159 + Mem::FillZ(checkMap,KEntryCount);
1.160 + TPagedSetIter<TUint32> iter(set);
1.161 + if (iter.ResetL())
1.162 + {
1.163 + do
1.164 + {
1.165 + TUint32 data1 = iter.AtL();
1.166 + ++checkMap[data1];
1.167 + TUint32 data2;
1.168 + iter.ExtractAtL(data2);
1.169 + test(data1 == data2);
1.170 + }while(iter.NextL());
1.171 + }
1.172 + for (ii=0;ii<KEntryCount;++ii)
1.173 + test(checkMap[ii]==1);
1.174 + CleanupStack::PopAndDestroy();
1.175 +
1.176 + test.Next(_L("Delete items"));
1.177 + jj=0;
1.178 + for (ii=KEntryCount;ii>KEntryCount/2;--ii)
1.179 + {
1.180 + jj=(jj+17)%KEntryCount;
1.181 +//* test(set.DeleteL(jj));
1.182 + set.DeleteL(jj);
1.183 + }
1.184 + test(set.Count()==KEntryCount/2);
1.185 +
1.186 + test.Next(_L("Check contents"));
1.187 + for (;ii>0;--ii)
1.188 + {
1.189 + jj=(jj+17)%KEntryCount;
1.190 + test(set.ContainsL(jj));
1.191 + }
1.192 + jj=0;
1.193 + for (ii=KEntryCount;ii>KEntryCount/2;--ii)
1.194 + {
1.195 + jj=(jj+17)%KEntryCount;
1.196 + test(!set.ContainsL(jj));
1.197 + }
1.198 +
1.199 + test.Next(_L("Delete items"));
1.200 + for (;ii>1;--ii)
1.201 + {
1.202 + jj=(jj+17)%KEntryCount;
1.203 +//* test(set.DeleteL(jj));
1.204 + set.DeleteL(jj);
1.205 + }
1.206 + test(set.Count()==1);
1.207 +
1.208 + test.Next(_L("Check contents"));
1.209 + jj=(jj+17)%KEntryCount;
1.210 + TPagedSetBiIter<TUint32> biter(set);
1.211 + test(biter.FirstL());
1.212 + test(biter.AtL()==jj);
1.213 + TUint32 data;
1.214 + biter.ExtractAtL(data);
1.215 + test(data == jj);
1.216 + test(!biter.NextL());
1.217 + test(biter.LastL());
1.218 + test(biter.AtL()==jj);
1.219 + test(!biter.PreviousL());
1.220 + TPagedSetRIter<TUint32> riter(set);
1.221 + test(riter.ResetL());
1.222 + test(riter.AtL()==jj);
1.223 + riter.ExtractAtL(data);
1.224 + test(data == jj);
1.225 + test(!riter.NextL());
1.226 +
1.227 +//* test(set.DeleteL(jj));
1.228 + set.DeleteL(jj);
1.229 + test(!iter.ResetL());
1.230 + test(set.Count()==0);
1.231 +
1.232 + test.End();
1.233 +
1.234 + CleanupStack::PopAndDestroy();
1.235 + }
1.236 +/**
1.237 +@SYMTestCaseID SYSLIB-STORE-CT-1123
1.238 +@SYMTestCaseDesc Stream set out test
1.239 +@SYMTestPriority High
1.240 +@SYMTestActions Build set and stream out
1.241 +@SYMTestExpectedResults Test must not fail
1.242 +@SYMREQ REQ0000
1.243 +*/
1.244 +LOCAL_C void test3aL(RWriteStream& aStream,MPagePool *aPool,TInt aCount)
1.245 + {
1.246 + test.Next(_L(" @SYMTestCaseID:SYSLIB-STORE-CT-1123 "));
1.247 + TPagedSet<TInt32> set;
1.248 +//* set.Connect(aPool,TBtree::EQosFastest);
1.249 + set.Connect(aPool);
1.250 +
1.251 + for (TInt ii=0;ii<aCount;ii++)
1.252 + {
1.253 + TInt32 it=ii;
1.254 +//* test(set.InsertL(it));
1.255 + set.InsertL(it);
1.256 + }
1.257 + aStream<<set.Token();
1.258 + }
1.259 +/**
1.260 +@SYMTestCaseID SYSLIB-STORE-CT-1124
1.261 +@SYMTestCaseDesc Stream in and set test
1.262 +@SYMTestPriority High
1.263 +@SYMTestActions Read a token from a stream,create and a pagedset.Tests for emptying the set.
1.264 +@SYMTestExpectedResults Test must not fail
1.265 +@SYMREQ REQ0000
1.266 +*/
1.267 +LOCAL_C void test3bL(RReadStream& aStream,MPagePool *aPool,TInt aCount)
1.268 + {
1.269 + test.Next(_L(" @SYMTestCaseID:SYSLIB-STORE-CT-1124 "));
1.270 + TPagedSetToken token;
1.271 + aStream>>token;
1.272 + TPagedSet<TInt32> set(token);
1.273 +//* set.Connect(aPool,TBtree::EQosFastest);
1.274 + set.Connect(aPool);
1.275 +
1.276 + test(set.Count()==aCount);
1.277 + for (TInt ii=0;ii<aCount;ii++)
1.278 + {
1.279 + TInt32 it=ii;
1.280 +//* test(set.DeleteL(it));
1.281 + set.DeleteL(it);
1.282 + }
1.283 + test(set.Count()==0);
1.284 + }
1.285 +
1.286 +/**
1.287 +@SYMTestCaseID SYSLIB-STORE-CT-1125
1.288 +@SYMTestCaseDesc Streaming sets test
1.289 +@SYMTestPriority High
1.290 +@SYMTestActions Tests for token streaming operations on pagedsets.
1.291 +@SYMTestExpectedResults Test must not fail
1.292 +@SYMREQ REQ0000
1.293 +*/
1.294 +LOCAL_C void test3L()
1.295 + {
1.296 + const TInt KEntryCount=1000;
1.297 + MPagePool *pool=CMemPagePool::NewLC();
1.298 + TUint8 stream[0x40];
1.299 + test.Start(_L(" @SYMTestCaseID:SYSLIB-STORE-CT-1125 Build set and stream out "));
1.300 + RMemWriteStream out(stream,sizeof(stream));
1.301 + test3aL(out,pool,KEntryCount);
1.302 + test.Next(_L("Stream in and test set "));
1.303 + RMemReadStream in(stream,sizeof(stream));
1.304 + test3bL(in,pool,KEntryCount);
1.305 + test.End();
1.306 + CleanupStack::PopAndDestroy();
1.307 + }
1.308 +
1.309 +class CPersistentStoreHelper: public CPersistentStore
1.310 + {
1.311 + virtual MStreamBuf* DoReadL(TStreamId /*anId*/) const
1.312 + {
1.313 + return NULL;
1.314 + }
1.315 + virtual MStreamBuf* DoCreateL(TStreamId& /*anId*/)
1.316 + {
1.317 + return NULL;
1.318 + }
1.319 + void Help()
1.320 + {
1.321 + //just do nothing
1.322 + return;
1.323 + }
1.324 + };
1.325 +
1.326 +/**
1.327 +@SYMTestCaseID PDS-STORE-CT-4015
1.328 +@SYMTestCaseDesc Test untested APIs of TPagedMultiset and TPagedSetToken
1.329 +@SYMTestPriority High
1.330 +@SYMTestActions Test possibility of adding duplicates into TPagedMultiset. Calling empy constructor TPagedSetToken.
1.331 + Test RepairL();
1.332 +@SYMTestExpectedResults Insterting duplicates should be possible and should not fail. After adding KEntryCount
1.333 + identical elements Count() should equal KEntryCount. Constructor should create valid object.
1.334 + RepairL function can't be runned now, because it has a problem inside that cause KERN-EXEC: 3.
1.335 +@SYMDEF DEF135804
1.336 +*/
1.337 +LOCAL_C void test4L()
1.338 + {
1.339 + const TInt KEntryCount=200;
1.340 +
1.341 + test.Start(_L(" @SYMTestCaseID:PDS-STORE-CT-4015 Test untested APIs "));
1.342 +
1.343 + TInt32 it=0;
1.344 + TPagedMultiset<TInt32> set;
1.345 + set.Connect(CMemPagePool::NewLC());
1.346 + test.Next(_L("Duplicates"));
1.347 + TInt ii, err;
1.348 + for (ii=0;ii<KEntryCount;++ii)
1.349 + {
1.350 + TRAP(err, set.InsertL(it));
1.351 + test(err==KErrNone);
1.352 + }
1.353 + test(set.Count()==KEntryCount);
1.354 + TBool rc = set.IsEmpty();
1.355 + test(!rc);
1.356 + set.MarkDirty();
1.357 + set.MarkCurrent();
1.358 + TRAP(err, set.ContainsL(it));
1.359 + test(err==KErrNone);
1.360 + TRAP(err, set.InsertL(it));
1.361 + test(err==KErrNone);
1.362 +
1.363 + for (ii=0;ii<KEntryCount;++ii)
1.364 + {
1.365 + TRAP(err, set.DeleteL(it));
1.366 + test(err==KErrNone);
1.367 + }
1.368 +
1.369 + TRAP(err, set.ContainsL(it));
1.370 + test(err==KErrNone);
1.371 + TRAP(err, set.DeleteL(it));
1.372 + test(err==KErrNone);
1.373 + test(set.Count()==0);
1.374 +
1.375 + test.Next(_L("Calling MPagePool::Delete"));
1.376 + CMemPagePool* mpp = CMemPagePool::NewLC();
1.377 + const TPageAbandonFunction& nopFunc = mpp->AcquireL();
1.378 + test(&nopFunc != NULL);
1.379 + TAny* any = mpp->AllocL();
1.380 + TPageRef pref;
1.381 + pref = mpp->AssignL(any, EPageReclaimable);
1.382 + mpp->MPagePool::Delete(pref);
1.383 + CleanupStack::PopAndDestroy();
1.384 +
1.385 + test.Next(_L("CPersistentStore DoSetRootL"));
1.386 + CPersistentStoreHelper* ps = new (ELeave) CPersistentStoreHelper();
1.387 + CleanupStack::PushL(ps);
1.388 + ps->SetRootL(KNullStreamId);
1.389 + CleanupStack::PopAndDestroy();
1.390 +
1.391 + test.Next(_L("HDirectStoreBuf::DoSeekL calls"));
1.392 + HBufC8* buf = HBufC8::NewLC(1024);
1.393 + RDesWriteStream wts;
1.394 +
1.395 + TPtr8 ptr(buf->Des());
1.396 + wts.Open(ptr);
1.397 + TStreamId id(5);
1.398 + wts << id;
1.399 + wts.CommitL();
1.400 + wts.Close();
1.401 + buf->Des().Append(_L8("Ala ma kota a kot ma futro. Futro jest dobre by chronic przed zimnem."));
1.402 + RDesReadStream rts;
1.403 + ptr.Set(buf->Des());
1.404 + rts.Open(ptr);
1.405 +
1.406 + CEmbeddedStore* estor = CEmbeddedStore::FromLC(rts);
1.407 + RStoreReadStream rstream;
1.408 + rstream.OpenL(*estor, id);
1.409 + TStreamPos pos = rstream.Source()->SeekL(MStreamBuf::ERead, 5);
1.410 + test(pos.Offset() == 5);
1.411 + rts.Close();
1.412 + rstream.Close();
1.413 + CleanupStack::PopAndDestroy(2);
1.414 +
1.415 + test.Next(_L("Calling TEmpty Constructor"));
1.416 + TPagedSetToken set2(TBtreeToken::EEmpty);
1.417 + test( set2.Count() == 0);
1.418 +
1.419 + test.Next(_L("Set function"));
1.420 + set.Set(set2);
1.421 + const TPagedSetToken& pst = set.Token();
1.422 + test(pst.Count() == set2.Count());
1.423 +
1.424 + test.End();
1.425 + CleanupStack::PopAndDestroy();
1.426 + }
1.427 +
1.428 +/**
1.429 +@SYMTestCaseID PDS-STORE-CT-4065
1.430 +@SYMTestCaseDesc TStreamPos tests.
1.431 +@SYMTestActions Tests operations provided by TStreamPos class.
1.432 +@SYMTestPriority High
1.433 +@SYMTestExpectedResults Test must not fail
1.434 +*/
1.435 +void StreamPosTest()
1.436 + {
1.437 + TStreamPos pos1;
1.438 + TStreamPos pos2(5);
1.439 + pos1 = pos2;
1.440 + test(pos1 == pos2);
1.441 +
1.442 + pos1 = 5 + pos2;
1.443 + test(pos1 > pos2);
1.444 + test(pos2 < pos1);
1.445 + test(pos2 <= pos1);
1.446 + test(pos1 != pos2);
1.447 + pos1 = pos1 - 5;
1.448 + test(pos1 == pos2);
1.449 +
1.450 + pos2 += 0;
1.451 + test(pos1 == pos2);
1.452 + pos2 -= 0;
1.453 + test(pos1 == pos2);
1.454 + }
1.455 +
1.456 +struct TTestEntry
1.457 + {
1.458 + inline TTestEntry() :
1.459 + iKey(-1),
1.460 + iData(-1)
1.461 + {
1.462 + }
1.463 + inline TTestEntry(TInt aKey, TInt aData) :
1.464 + iKey(aKey),
1.465 + iData(aData)
1.466 + {
1.467 + }
1.468 + TInt iKey;
1.469 + TInt iData;
1.470 + };
1.471 +
1.472 +/**
1.473 +@SYMTestCaseID PDS-STORE-CT-4066
1.474 +@SYMTestCaseDesc TBtreeFix tests.
1.475 +@SYMTestActions Tests operations provided by TBtreeFix class.
1.476 +@SYMTestPriority High
1.477 +@SYMTestExpectedResults Test must not fail
1.478 +*/
1.479 +void BTreeFixTestL()
1.480 + {
1.481 + CMemPagePool* pool = CMemPagePool::NewLC();
1.482 +
1.483 + TBtreeToken token(TBtreeToken::EEmpty);
1.484 + TBool rc = token.IsEmpty();
1.485 + test(rc);
1.486 + rc = token.IsIntact();
1.487 + test(rc);
1.488 +
1.489 + TBtreeFix<TTestEntry, TInt> bentry(token, EBtreeSecure);
1.490 + TBtreeKey bkey(sizeof(TInt));
1.491 + bentry.Connect(pool, &bkey);
1.492 +
1.493 + TBtreePos bpos;
1.494 + rc = bentry.FindL(bpos, 1);
1.495 + test(!rc);
1.496 + rc = bentry.InsertL(bpos, TTestEntry(1, 101));
1.497 + test(rc);
1.498 + rc = bentry.FindL(bpos, 1);
1.499 + test(rc);
1.500 + TTestEntry entry1 = bentry.AtL(bpos);
1.501 + test(entry1.iKey == 1 && entry1.iData == 101);
1.502 + const void* key = bkey.Key(&entry1);
1.503 + TInt keyVal = *((const TInt*)key);
1.504 + test.Printf(_L("keyVal=%d\n"), keyVal);
1.505 +
1.506 + rc = bentry.InsertL(bpos, TTestEntry(3, 103));
1.507 + test(rc);
1.508 + rc = bentry.InsertL(bpos, TTestEntry(2, 102));
1.509 + test(rc);
1.510 +
1.511 + rc = bentry.FindL(bpos, 2);
1.512 + test(rc);
1.513 + TTestEntry entry2;
1.514 + bentry.ExtractAtL(bpos, entry2);
1.515 + test(entry2.iKey == 2 && entry2.iData == 102);
1.516 +
1.517 + rc = bentry.FindL(bpos, 3);
1.518 + test(rc);
1.519 + TTestEntry entry3;
1.520 + bentry.ExtractAtL(bpos, entry3);
1.521 + test(entry3.iKey == 3 && entry3.iData == 103);
1.522 +
1.523 + //==============================================
1.524 +
1.525 + TBtreeMark bmark;
1.526 + if(bentry.ResetL(bmark))
1.527 + {
1.528 + do
1.529 + {
1.530 + TTestEntry entry = bentry.AtL(bmark);
1.531 + test.Printf(_L("AtL(): entry.iKey=%d, entry.iData=%d\n"), entry.iKey, entry.iData);
1.532 + bentry.ExtractAtL(bmark, entry);
1.533 + test.Printf(_L("ExtractAtL(): entry.iKey=%d, entry.iData=%d\n"), entry.iKey, entry.iData);
1.534 + }while(bentry.NextL(bmark));
1.535 + }
1.536 +
1.537 + rc = bentry.NextL(bmark);
1.538 + test(!rc);
1.539 +
1.540 + //==============================================
1.541 +
1.542 + rc = bentry.DeleteL(2);
1.543 + test(rc);
1.544 + rc = bentry.FindL(bpos, 2);
1.545 + test(!rc);
1.546 + rc = bentry.FindL(bpos, 3);
1.547 + test(rc);
1.548 + TRAPD(err, bentry.DeleteAtL(bpos));
1.549 + test(err == KErrNone);
1.550 + rc = bentry.FindL(bpos, 3);
1.551 + test(!rc);
1.552 +
1.553 + bentry.MarkDirty();
1.554 + rc = bentry.IsDirty();
1.555 + test(rc);
1.556 + bentry.MarkCurrent();
1.557 + rc = bentry.IsDirty();
1.558 + test(!rc);
1.559 +
1.560 + bentry.ClearL();
1.561 + CleanupStack::PopAndDestroy(pool);
1.562 + }
1.563 +
1.564 +LOCAL_C void doMainL()
1.565 + {
1.566 + test.Start(_L("Basic operations"));
1.567 + test1L();
1.568 + test.Next(_L("Large set TUint32"));
1.569 + test2L();
1.570 + test.Next(_L("Tokens and streaming"));
1.571 + test3L();
1.572 + test.Next(_L("Forgotten API"));
1.573 + test4L();
1.574 + test.Next(_L("@SYMTestCaseID:PDS-STORE-CT-4065: TStreamPos test"));
1.575 + StreamPosTest();
1.576 + test.Next(_L("@SYMTestCaseID:PDS-STORE-CT-4066: TBtreeFix test"));
1.577 + BTreeFixTestL();
1.578 + test.End();
1.579 + }
1.580 +
1.581 +LOCAL_C void setupCleanup()
1.582 +//
1.583 +// Initialise the cleanup stack.
1.584 +//
1.585 + {
1.586 + TheTrapCleanup=CTrapCleanup::New();
1.587 + test(TheTrapCleanup!=NULL);
1.588 + TRAPD(r,\
1.589 + {\
1.590 + for (TInt i=KTestCleanupStack;i>0;i--)\
1.591 + CleanupStack::PushL((TAny*)1);\
1.592 + test(r==KErrNone);\
1.593 + CleanupStack::Pop(KTestCleanupStack);\
1.594 + });
1.595 + test(r==KErrNone);
1.596 + }
1.597 +
1.598 +GLDEF_C TInt E32Main()
1.599 + {
1.600 + test.Title();
1.601 + setupCleanup();
1.602 + __UHEAP_MARK;
1.603 +//
1.604 + TRAPD(r,doMainL());
1.605 + test(r==KErrNone);
1.606 +//
1.607 + __UHEAP_MARKEND;
1.608 + delete TheTrapCleanup;
1.609 + test.Close();
1.610 + return 0;
1.611 + }
1.612 +