# HG changeset patch
# User hgs
# Date 1276166881 -3600
# Node ID d9f1e5bfe28c6dd7ce2cf1166e6a885ce8d8d3dd
# Parent  5e441a173c6319c325907308274c0261316ef8fd
201021_18

diff -r 5e441a173c63 -r d9f1e5bfe28c baseapitest/basesvs/group/basesvs.mrp
--- a/baseapitest/basesvs/group/basesvs.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/baseapitest/basesvs/group/basesvs.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,19 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
-
 component		basesvs
 source			\sf\os\kernelhwsrv\baseapitest\basesvs
 notes_source	\sf\os\kernelhwsrv\baseapitest\basesvs\group\release.txt
diff -r 5e441a173c63 -r d9f1e5bfe28c brdbootldr/ubootldr/base_ubootldr.mrp
--- a/brdbootldr/ubootldr/base_ubootldr.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/brdbootldr/ubootldr/base_ubootldr.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Bootstrap"
 
 component	base_ubootldr
diff -r 5e441a173c63 -r d9f1e5bfe28c brdbootldr/ubootldr/inflate.c
--- a/brdbootldr/ubootldr/inflate.c	Mon May 24 18:45:46 2010 +0100
+++ b/brdbootldr/ubootldr/inflate.c	Thu Jun 10 11:48:01 2010 +0100
@@ -1,19 +1,3 @@
-/*
-* Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-* All rights reserved.
-* This component and the accompanying materials are made available
-* under the terms of "Eclipse Public License v1.0"
-* which accompanies this distribution, and is available
-* at the URL "http://www.eclipse.org/legal/epl-v10.html".
-*
-* Initial Contributors:
-* Nokia Corporation - initial contribution.
-*
-* Contributors:
-*
-* Description: 
-*
-*/
 /* inflate.c -- Not copyrighted 1992 by Mark Adler
    version c10p1, 10 January 1993 */
 
diff -r 5e441a173c63 -r d9f1e5bfe28c bsptemplate/asspandvariant/base_template.mrp
--- a/bsptemplate/asspandvariant/base_template.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/bsptemplate/asspandvariant/base_template.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Template Variant"
 
 component	base_template
diff -r 5e441a173c63 -r d9f1e5bfe28c bsptemplate/asspandvariant/template_variant/exiic.mmp
--- a/bsptemplate/asspandvariant/template_variant/exiic.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/bsptemplate/asspandvariant/template_variant/exiic.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 2008-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2008-2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
@@ -17,6 +17,8 @@
 
 #define __USING_ASSP_REGISTER_API__
 #define __USING_ASSP_INTERRUPT_API__
+#define __USING_MHA_GPIO_API__
+
 
 #include <variant.mmh>
 
@@ -58,9 +60,6 @@
 //SYMBIAN_BASE_SYSTEMINCLUDE(template/specific)
 
 
-library     VariantTarget(gpio,lib)
-
-
 //VENDORID 0x70000001
 
 //uid			0x100039d0 0x10285812
diff -r 5e441a173c63 -r d9f1e5bfe28c bsptemplate/asspandvariant/template_variant/variant.mmh
--- a/bsptemplate/asspandvariant/template_variant/variant.mmh	Mon May 24 18:45:46 2010 +0100
+++ b/bsptemplate/asspandvariant/template_variant/variant.mmh	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 1998-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 1998-2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
@@ -149,7 +149,13 @@
 // For the status of errata of L210 & L220 cache, see the header of source file:
 // e32\kernel\arm\cachel2.cpp
 
-#if defined(__USING_USING_ASSP_REGISTER_API__) || defined(__USING_INTERRUPT_API__) || defined(__USING_ASSP_REGISTER_API__)
+// Modular Hardware Adaptation - Service API library macros
+// MMP files define the relevant macro to add the library statement
+// 
+#if defined(__USING_ASSP_INTERRUPT_API__) || defined(__USING_ASSP_REGISTER_API__)
 library	VariantTarget(katemplate,lib)
 #endif
 
+#if defined(__USING_MHA_GPIO_API__)
+library	VariantTarget(gpio,lib)
+#endif
diff -r 5e441a173c63 -r d9f1e5bfe28c halservices/hal/base_hal.mrp
--- a/halservices/hal/base_hal.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/halservices/hal/base_hal.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "User Side Hardware Abstraction"
 
 component	base_hal
diff -r 5e441a173c63 -r d9f1e5bfe28c halservices/hal/src/hal_gcc_shim.cia
--- a/halservices/hal/src/hal_gcc_shim.cia	Mon May 24 18:45:46 2010 +0100
+++ b/halservices/hal/src/hal_gcc_shim.cia	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,18 @@
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
 //
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// hal/src/hal_gcc_shim.cia
+// 
 // HAL_GCC_SHIM.CIA - generated by GENSHIMSRC.BAT
 //
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/base.bld
--- a/kernel/eka/base.bld	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/base.bld	Thu Jun 10 11:48:01 2010 +0100
@@ -1,13 +1,13 @@
-
-!COMPULSORY
-!INCREMENTAL
-
-<option keepgoing>
-<option tools>
-<option epoconly>
-
-e32tools	e32tools\group
-e32			e32
-compsupp	e32\compsupp
-f32			f32\group
-hal			hal
+
+!COMPULSORY
+!INCREMENTAL
+
+<option keepgoing>
+<option tools>
+<option epoconly>
+
+e32tools	e32tools\group
+e32			e32
+compsupp	e32\compsupp
+f32			f32\group
+hal			hal
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/base_e32.history.xml
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/base_e32.history.xml	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<relnotes name="Kernel Architecture 2">
+  <purpose>
+  </purpose>
+
+  <minorchange revision="001">
+    MINOR CHANGE: Improved test code T_Match by adding more cases to test for INC092513 (SYSLIB-UNICODE-CT-3337)
+  </minorchange>
+</relnotes>
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/base_e32.mrp
--- a/kernel/eka/base_e32.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/base_e32.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Kernel Architecture 2"
 
 component	base_e32
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/bmarm/ekernsmp.def
--- a/kernel/eka/bmarm/ekernsmp.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/bmarm/ekernsmp.def	Thu Jun 10 11:48:01 2010 +0100
@@ -1055,4 +1055,7 @@
 	SetIdleHandler__3ArmPFPvUlPVv_vPv @ 1054 NONAME R3UNUSED ; Arm::SetIdleHandler(void (*)(void *, unsigned long, void volatile *), void *)
 	FreeRamZone__4EpocUi @ 1055 NONAME R3UNUSED ; Epoc::FreeRamZone(unsigned int)
 	SelectiveAlloc__16TBitMapAllocatorii @ 1056 NONAME R3UNUSED ; TBitMapAllocator::SelectiveAlloc(int, int)
+	SetKeyOffset__10RArrayBasei @ 1057  NONAME R3UNUSED ; RArrayBase::SetKeyOffset(int)
+	CpuRetires__5Cache @ 1058 NONAME R3UNUSED ; Cache::CpuRetires(void)
+	KernelRetires__5Cache @ 1059 NONAME R3UNUSED ; Cache::KernelRetires(void)
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/bmarm/ekernu.def
--- a/kernel/eka/bmarm/ekernu.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/bmarm/ekernu.def	Thu Jun 10 11:48:01 2010 +0100
@@ -1052,3 +1052,6 @@
 	SetIdleHandler__3ArmPFPvUl_vPv @ 1051 NONAME R3UNUSED ; Arm::SetIdleHandler(void (*)(void *, unsigned long), void *)
 	FreeRamZone__4EpocUi @ 1052 NONAME R3UNUSED ; Epoc::FreeRamZone(unsigned int)
 	SelectiveAlloc__16TBitMapAllocatorii @ 1053 NONAME R3UNUSED ; TBitMapAllocator::SelectiveAlloc(int, int)
+	SetKeyOffset__10RArrayBasei @ 1054  NONAME R3UNUSED ; RArrayBase::SetKeyOffset(int)
+	CpuRetires__5Cache @ 1055 NONAME R3UNUSED ; Cache::CpuRetires(void)
+	KernelRetires__5Cache @ 1056 NONAME R3UNUSED ; Cache::KernelRetires(void)
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/bmarm/euseru.def
--- a/kernel/eka/bmarm/euseru.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/bmarm/euseru.def	Thu Jun 10 11:48:01 2010 +0100
@@ -620,7 +620,7 @@
 	FsRegisterThread__7UserSvr @ 619 NONAME R3UNUSED ; UserSvr::FsRegisterThread(void)
 	FullName__C11RHandleBase @ 620 NONAME R3UNUSED ; RHandleBase::FullName(void) const
 	FullName__C7CObject @ 621 NONAME R3UNUSED ; CObject::FullName(void) const
-	GetAddress__C5RHeapPCv @ 622 NONAME R3UNUSED ; RHeap::GetAddress(void const *) const
+	GetAddress__C5RHeapPCv @ 622 NONAME R3UNUSED ABSENT ; RHeap::GetAddress(void const *) const
 	GetBdCategory__C5TChar @ 623 NONAME R3UNUSED ; TChar::GetBdCategory(void) const
 	GetCaps__C7RDeviceR5TDes8 @ 624 NONAME R3UNUSED ; RDevice::GetCaps(TDes8 &) const
 	GetCategory__C5TChar @ 625 NONAME R3UNUSED ; TChar::GetCategory(void) const
@@ -1616,8 +1616,8 @@
 	__5RBuf8 @ 1615 NONAME R3UNUSED ; RBuf8::RBuf8(void)
 	__5RBuf8P6HBufC8 @ 1616 NONAME R3UNUSED ; RBuf8::RBuf8(HBufC8 *)
 	__5RBuf8iii @ 1617 NONAME ; RBuf8::RBuf8(int, int, int)
-	__5RHeapiii @ 1618 NONAME ; RHeap::RHeap(int, int, int)
-	__5RHeapiiiiiii @ 1619 NONAME ; RHeap::RHeap(int, int, int, int, int, int, int)
+	__5RHeapiii @ 1618 NONAME ABSENT ; RHeap::RHeap(int, int, int)
+	__5RHeapiiiiiii @ 1619 NONAME ABSENT ; RHeap::RHeap(int, int, int, int, int, int, int)
 	__5RTestRC7TDesC16 @ 1620 NONAME R3UNUSED ; RTest::RTest(TDesC16 const &)
 	__5RTestRC7TDesC16i @ 1621 NONAME R3UNUSED ; RTest::RTest(TDesC16 const &, int)
 	__5RTestRC7TDesC16iPCUs @ 1622 NONAME ; RTest::RTest(TDesC16 const &, int, unsigned short const *)
@@ -1832,7 +1832,7 @@
 	__negdi2 @ 1831 NONAME ; (null)
 	__negsf2 @ 1832 NONAME ; (null)
 	__nesf2 @ 1833 NONAME ; (null)
-	__nw__5RHeapUiPv @ 1834 NONAME R3UNUSED ; RHeap::operator new(unsigned int, void *)
+	__nw__5RHeapUiPv @ 1834 NONAME R3UNUSED ABSENT ; RHeap::operator new(unsigned int, void *)
 	__nw__FUiUi @ 1835 NONAME R3UNUSED ; operator new(unsigned int, unsigned int)
 	__opUi__C6TRealX @ 1836 NONAME R3UNUSED ; TRealX::operator unsigned int(void) const
 	__opd__C6TRealX @ 1837 NONAME R3UNUSED ; TRealX::operator double(void) const
@@ -2260,3 +2260,12 @@
 	Match2__C7TDesC16RC7TDesC16 @ 2259  NONAME R3UNUSED ; TDesC16::Match2(TDesC16 const &) const
 	UpperCase2__6TDes16 @ 2260  NONAME R3UNUSED ; TDes16::UpperCase2(void)
 	AgainHighRes__6RTimerR14TRequestStatusG27TTimeIntervalMicroSeconds32 @ 2261 NONAME R3UNUSED ; RTimer::AgainHighRes(TRequestStatus &, TTimeIntervalMicroSeconds32)
+	Align__C10RAllocatorPv @ 2262 NONAME R3UNUSED ; RAllocator::Align(void *) const
+	Align__C10RAllocatori @ 2263 NONAME R3UNUSED ; RAllocator::Align(int) const
+	Base__C10RAllocator @ 2264 NONAME R3UNUSED ; RAllocator::Base(void) const
+	MaxLength__C10RAllocator @ 2265 NONAME R3UNUSED ; RAllocator::MaxLength(void) const
+	Size__C10RAllocator @ 2266 NONAME R3UNUSED ; RAllocator::Size(void) const
+	__DbgGetAllocFail__10RAllocator @ 2267 NONAME R3UNUSED ; RAllocator::__DbgGetAllocFail(void)
+	__DbgGetAllocFail__4Useri @ 2268 NONAME R3UNUSED ; User::__DbgGetAllocFail(int)
+	SetKeyOffset__10RArrayBasei @ 2269  NONAME R3UNUSED ; RArrayBase::SetKeyOffset(int)
+	
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/bwins/ekernu.def
--- a/kernel/eka/bwins/ekernu.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/bwins/ekernu.def	Thu Jun 10 11:48:01 2010 +0100
@@ -935,4 +935,7 @@
 	?Retire@KernCoreStats@@SAHHH@Z @ 934 NONAME	;  public: static int KernCoreStats::Retire(int, int)
 	?Stats@KernCoreStats@@SAHPAX@Z @ 935 NONAME	;  public: static int KernCoreStats::Stats(void *)
 	?SelectiveAlloc@TBitMapAllocator@@QAEIHH@Z @ 936 NONAME ; public: unsigned int __thiscall TBitMapAllocator::SelectiveAlloc(int,int)
+	?SetKeyOffset@RArrayBase@@IAEXH@Z @ 937  NONAME ; void RArrayBase::SetKeyOffset(int)
+	?CpuRetires@Cache@@SAXXZ @ 938 NONAME ; public: static void __cdecl Cache::CpuRetires(void)
+	?KernelRetires@Cache@@SAXXZ @ 939 NONAME ; public: static void __cdecl Cache::KernelRetires(void)
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/bwins/euseru.def
--- a/kernel/eka/bwins/euseru.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/bwins/euseru.def	Thu Jun 10 11:48:01 2010 +0100
@@ -48,8 +48,8 @@
 	??0RBuf8@@QAE@PAVHBufC8@@@Z @ 47 NONAME ; public: __thiscall RBuf8::RBuf8(class HBufC8 *)
 	??0RBuf8@@QAE@XZ @ 48 NONAME ; public: __thiscall RBuf8::RBuf8(void)
 	??0RCriticalSection@@QAE@XZ @ 49 NONAME ; public: __thiscall RCriticalSection::RCriticalSection(void)
-	??0RHeap@@QAE@HHH@Z @ 50 NONAME ; public: __thiscall RHeap::RHeap(int,int,int)
-	??0RHeap@@QAE@HHHHHHH@Z @ 51 NONAME ; public: __thiscall RHeap::RHeap(int,int,int,int,int,int,int)
+	??0RHeap@@QAE@HHH@Z @ 50 NONAME ABSENT ; public: __thiscall RHeap::RHeap(int,int,int)
+	??0RHeap@@QAE@HHHHHHH@Z @ 51 NONAME ABSENT ; public: __thiscall RHeap::RHeap(int,int,int,int,int,int,int)
 	??0RMessage2@@QAE@ABVRMessagePtr2@@@Z @ 52 NONAME ; public: __thiscall RMessage2::RMessage2(class RMessagePtr2 const &)
 	??0RNotifier@@QAE@XZ @ 53 NONAME ; public: __thiscall RNotifier::RNotifier(void)
 	??0RPointerArrayBase@@IAE@H@Z @ 54 NONAME ; protected: __thiscall RPointerArrayBase::RPointerArrayBase(int)
@@ -216,7 +216,7 @@
 	??1CSession2@@UAE@XZ @ 215 NONAME ; public: virtual __thiscall CSession2::~CSession2(void)
 	??1CTimer@@UAE@XZ @ 216 NONAME ; public: virtual __thiscall CTimer::~CTimer(void)
 	??1CTrapCleanup@@UAE@XZ @ 217 NONAME ; public: virtual __thiscall CTrapCleanup::~CTrapCleanup(void)
-	??2RHeap@@SAPAXIPAX@Z @ 218 NONAME ; public: static void * __cdecl RHeap::operator new(unsigned int,void *)
+	??2RHeap@@SAPAXIPAX@Z @ 218 NONAME ABSENT ; public: static void * __cdecl RHeap::operator new(unsigned int,void *)
 	??4HBufC16@@QAEAAV0@ABVTDesC16@@@Z @ 219 NONAME ; public: class HBufC16 & __thiscall HBufC16::operator=(class TDesC16 const &)
 	??4HBufC16@@QAEAAV0@PBG@Z @ 220 NONAME ; public: class HBufC16 & __thiscall HBufC16::operator=(unsigned short const *)
 	??4HBufC8@@QAEAAV0@ABVTDesC8@@@Z @ 221 NONAME ; public: class HBufC8 & __thiscall HBufC8::operator=(class TDesC8 const &)
@@ -943,7 +943,7 @@
 	?Get@RProperty@@SAHVTUid@@IAAVTDes8@@@Z @ 942 NONAME ; public: static int __cdecl RProperty::Get(class TUid,unsigned int,class TDes8 &)
 	?Get@TLex16@@QAE?AVTChar@@XZ @ 943 NONAME ; public: class TChar  __thiscall TLex16::Get(void)
 	?Get@TLex8@@QAE?AVTChar@@XZ @ 944 NONAME ; public: class TChar  __thiscall TLex8::Get(void)
-	?GetAddress@RHeap@@IBEPAUSCell@1@PBX@Z @ 945 NONAME ; protected: struct RHeap::SCell * __thiscall RHeap::GetAddress(void const *)const 
+	?GetAddress@RHeap@@IBEPAUSCell@1@PBX@Z @ 945 NONAME ABSENT ; protected: struct RHeap::SCell * __thiscall RHeap::GetAddress(void const *)const 
 	?GetBdCategory@TChar@@QBE?AW4TBdCategory@1@XZ @ 946 NONAME ; public: enum TChar::TBdCategory  __thiscall TChar::GetBdCategory(void)const 
 	?GetCaps@RDevice@@QBEXAAVTDes8@@@Z @ 947 NONAME ; public: void __thiscall RDevice::GetCaps(class TDes8 &)const 
 	?GetCategory@TChar@@QBE?AW4TCategory@1@XZ @ 948 NONAME ; public: enum TChar::TCategory  __thiscall TChar::GetCategory(void)const 
@@ -2208,4 +2208,12 @@
 	?LocateReverseF2@TDesC16@@QBEHVTChar@@@Z @ 2207 NONAME ; int TDesC16::LocateReverseF2(class TChar) const
 	?CopyCP2@TDes16@@QAEXABVTDesC16@@@Z @ 2208 NONAME ; void TDes16::CopyCP2(class TDesC16 const &)
 	?AgainHighRes@RTimer@@QAEXAAVTRequestStatus@@VTTimeIntervalMicroSeconds32@@@Z @ 2209 NONAME ; public: void __thiscall RTimer::AgainHighRes(class TRequestStatus &,class TTimeIntervalMicroSeconds32)
+	?Align@RAllocator@@QBEPAXPAX@Z @ 2210 NONAME ; void * RAllocator::Align(void *) const
+	?Align@RAllocator@@QBEHH@Z @ 2211 NONAME ; int RAllocator::Align(int) const
+	?Size@RAllocator@@QBEHXZ @ 2212 NONAME ; int RAllocator::Size(void) const
+	?Base@RAllocator@@QBEPAEXZ @ 2213 NONAME ; void * RAllocator::Base(void) const
+	?MaxLength@RAllocator@@QBEHXZ @ 2214 NONAME ; int RAllocator::MaxLength(void) const
+	?__DbgGetAllocFail@RAllocator@@QAE?AW4TAllocFail@1@XZ @ 2215 NONAME ; enum RAllocator::TAllocFail RAllocator::__DbgGetAllocFail(void)
+	?__DbgGetAllocFail@User@@SA?AW4TAllocFail@RAllocator@@H@Z @ 2216 NONAME ; enum RAllocator::TAllocFail User::__DbgGetAllocFail(int)
+	?SetKeyOffset@RArrayBase@@IAEXH@Z @ 2217  NONAME ; void RArrayBase::SetKeyOffset(int)
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/bx86/ekernsmp.def
--- a/kernel/eka/bx86/ekernsmp.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/bx86/ekernsmp.def	Thu Jun 10 11:48:01 2010 +0100
@@ -1012,4 +1012,7 @@
 	?SetNumberOfActiveCpus@NKern@@SAXH@Z @ 1011 NONAME ; public: static void __cdecl NKern::SetNumberOfActiveCpus(int)
 	?FreeRamZone@Epoc@@SAHI@Z @ 1012 NONAME ; public: static int Epoc::FreeRamZone(unsigned int)
 	?SelectiveAlloc@TBitMapAllocator@@QAEIHH@Z @ 1013 NONAME ; public: unsigned int __thiscall TBitMapAllocator::SelectiveAlloc(int,int)
+	?SetKeyOffset@RArrayBase@@IAEXH@Z @ 1014  NONAME ; void RArrayBase::SetKeyOffset(int)
+	?CpuRetires@Cache@@SAXXZ @ 1015 NONAME ; public: static void __cdecl Cache::CpuRetires(void)
+	?KernelRetires@Cache@@SAXXZ @ 1016 NONAME ; public: static void __cdecl Cache::KernelRetires(void)
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/bx86/ekernu.def
--- a/kernel/eka/bx86/ekernu.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/bx86/ekernu.def	Thu Jun 10 11:48:01 2010 +0100
@@ -957,4 +957,7 @@
 	?Stats@KernCoreStats@@SAHPAX@Z @ 956 NONAME	;  public: static int KernCoreStats::Stats(void *)
 	?FreeRamZone@Epoc@@SAHI@Z @ 957 NONAME ; public: static int Epoc::FreeRamZone(unsigned int)
 	?SelectiveAlloc@TBitMapAllocator@@QAEIHH@Z @ 958 NONAME ; public: unsigned int __thiscall TBitMapAllocator::SelectiveAlloc(int,int)
+	?SetKeyOffset@RArrayBase@@IAEXH@Z @ 959  NONAME ; void RArrayBase::SetKeyOffset(int)
+	?CpuRetires@Cache@@SAXXZ @ 960 NONAME ; public: static void __cdecl Cache::CpuRetires(void)
+	?KernelRetires@Cache@@SAXXZ @ 961 NONAME ; public: static void __cdecl Cache::KernelRetires(void)
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/bx86/euseru.def
--- a/kernel/eka/bx86/euseru.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/bx86/euseru.def	Thu Jun 10 11:48:01 2010 +0100
@@ -48,8 +48,8 @@
 	??0RBuf8@@QAE@PAVHBufC8@@@Z @ 47 NONAME ; public: __thiscall RBuf8::RBuf8(class HBufC8 *)
 	??0RBuf8@@QAE@XZ @ 48 NONAME ; public: __thiscall RBuf8::RBuf8(void)
 	??0RCriticalSection@@QAE@XZ @ 49 NONAME ; public: __thiscall RCriticalSection::RCriticalSection(void)
-	??0RHeap@@QAE@HHH@Z @ 50 NONAME ; public: __thiscall RHeap::RHeap(int,int,int)
-	??0RHeap@@QAE@HHHHHHH@Z @ 51 NONAME ; public: __thiscall RHeap::RHeap(int,int,int,int,int,int,int)
+	??0RHeap@@QAE@HHH@Z @ 50 NONAME ABSENT ; public: __thiscall RHeap::RHeap(int,int,int)
+	??0RHeap@@QAE@HHHHHHH@Z @ 51 NONAME ABSENT ; public: __thiscall RHeap::RHeap(int,int,int,int,int,int,int)
 	??0RMessage2@@QAE@ABVRMessagePtr2@@@Z @ 52 NONAME ; public: __thiscall RMessage2::RMessage2(class RMessagePtr2 const &)
 	??0RNotifier@@QAE@XZ @ 53 NONAME ; public: __thiscall RNotifier::RNotifier(void)
 	??0RPointerArrayBase@@IAE@H@Z @ 54 NONAME ; protected: __thiscall RPointerArrayBase::RPointerArrayBase(int)
@@ -216,7 +216,7 @@
 	??1CSession2@@UAE@XZ @ 215 NONAME ; public: virtual __thiscall CSession2::~CSession2(void)
 	??1CTimer@@UAE@XZ @ 216 NONAME ; public: virtual __thiscall CTimer::~CTimer(void)
 	??1CTrapCleanup@@UAE@XZ @ 217 NONAME ; public: virtual __thiscall CTrapCleanup::~CTrapCleanup(void)
-	??2RHeap@@SAPAXIPAX@Z @ 218 NONAME ; public: static void * __cdecl RHeap::operator new(unsigned int,void *)
+	??2RHeap@@SAPAXIPAX@Z @ 218 NONAME ABSENT ; public: static void * __cdecl RHeap::operator new(unsigned int,void *)
 	??4HBufC16@@QAEAAV0@ABVTDesC16@@@Z @ 219 NONAME ; public: class HBufC16 & __thiscall HBufC16::operator=(class TDesC16 const &)
 	??4HBufC16@@QAEAAV0@PBG@Z @ 220 NONAME ; public: class HBufC16 & __thiscall HBufC16::operator=(unsigned short const *)
 	??4HBufC8@@QAEAAV0@ABVTDesC8@@@Z @ 221 NONAME ; public: class HBufC8 & __thiscall HBufC8::operator=(class TDesC8 const &)
@@ -943,7 +943,7 @@
 	?Get@RProperty@@SAHVTUid@@IAAVTDes8@@@Z @ 942 NONAME ; public: static int __cdecl RProperty::Get(class TUid,unsigned int,class TDes8 &)
 	?Get@TLex16@@QAE?AVTChar@@XZ @ 943 NONAME ; public: class TChar  __thiscall TLex16::Get(void)
 	?Get@TLex8@@QAE?AVTChar@@XZ @ 944 NONAME ; public: class TChar  __thiscall TLex8::Get(void)
-	?GetAddress@RHeap@@IBEPAUSCell@1@PBX@Z @ 945 NONAME ; protected: struct RHeap::SCell * __thiscall RHeap::GetAddress(void const *)const 
+	?GetAddress@RHeap@@IBEPAUSCell@1@PBX@Z @ 945 NONAME ABSENT ; protected: struct RHeap::SCell * __thiscall RHeap::GetAddress(void const *)const 
 	?GetBdCategory@TChar@@QBE?AW4TBdCategory@1@XZ @ 946 NONAME ; public: enum TChar::TBdCategory  __thiscall TChar::GetBdCategory(void)const 
 	?GetCaps@RDevice@@QBEXAAVTDes8@@@Z @ 947 NONAME ; public: void __thiscall RDevice::GetCaps(class TDes8 &)const 
 	?GetCategory@TChar@@QBE?AW4TCategory@1@XZ @ 948 NONAME ; public: enum TChar::TCategory  __thiscall TChar::GetCategory(void)const 
@@ -2208,4 +2208,12 @@
 	?LocateReverseF2@TDesC16@@QBEHVTChar@@@Z @ 2207 NONAME ; int TDesC16::LocateReverseF2(class TChar) const
 	?CopyCP2@TDes16@@QAEXABVTDesC16@@@Z @ 2208 NONAME ; void TDes16::CopyCP2(class TDesC16 const &)
 	?AgainHighRes@RTimer@@QAEXAAVTRequestStatus@@VTTimeIntervalMicroSeconds32@@@Z @ 2209 NONAME ; public: void __thiscall RTimer::AgainHighRes(class TRequestStatus &,class TTimeIntervalMicroSeconds32)
-
+	?Align@RAllocator@@QBEHH@Z @ 2210 NONAME ; public: int __thiscall RAllocator::Align(int)const 
+	?Align@RAllocator@@QBEPAXPAX@Z @ 2211 NONAME ; public: void * __thiscall RAllocator::Align(void *)const 
+	?Base@RAllocator@@QBEPAEXZ @ 2212 NONAME ; public: void * __thiscall RAllocator::Base(void)const 
+	?MaxLength@RAllocator@@QBEHXZ @ 2213 NONAME ; public: int __thiscall RAllocator::MaxLength(void)const 
+	?Size@RAllocator@@QBEHXZ @ 2214 NONAME ; public: int __thiscall RAllocator::Size(void)const 
+	?__DbgGetAllocFail@RAllocator@@QAE?AW4TAllocFail@1@XZ @ 2215 NONAME ; enum RAllocator::TAllocFail RAllocator::__DbgGetAllocFail(void)
+	?__DbgGetAllocFail@User@@SA?AW4TAllocFail@RAllocator@@H@Z @ 2216 NONAME ; enum RAllocator::TAllocFail User::__DbgGetAllocFail(int)
+	?SetKeyOffset@RArrayBase@@IAEXH@Z @ 2217  NONAME ; void RArrayBase::SetKeyOffset(int)
+	
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/bx86gcc/ekernsmp.def
--- a/kernel/eka/bx86gcc/ekernsmp.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/bx86gcc/ekernsmp.def	Thu Jun 10 11:48:01 2010 +0100
@@ -1100,4 +1100,8 @@
 	_ZN5NKern21SetNumberOfActiveCpusEi @ 1099 NONAME
 	_ZN4Epoc11FreeRamZoneEj @ 1100 NONAME
 	_ZN16TBitMapAllocator14SelectiveAllocEii @ 1101 NONAME
+	_ZN10RArrayBase12SetKeyOffsetEi @ 1102 NONAME
+	_ZN5Cache10CpuRetiresEv @ 1103 NONAME
+	_ZN5Cache13KernelRetiresEv @ 1104 NONAME
 
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/bx86gcc/ekernu.def
--- a/kernel/eka/bx86gcc/ekernu.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/bx86gcc/ekernu.def	Thu Jun 10 11:48:01 2010 +0100
@@ -1040,4 +1040,7 @@
 	_ZN13KernCoreStats9LeaveIdleEj @ 1039 NONAME
 	_ZN4Epoc11FreeRamZoneEj @ 1040 NONAME
 	_ZN16TBitMapAllocator14SelectiveAllocEii @ 1041 NONAME
+	_ZN10RArrayBase12SetKeyOffsetEi @ 1042 NONAME
+	_ZN5Cache10CpuRetiresEv @ 1043 NONAME
+	_ZN5Cache13KernelRetiresEv @ 1044 NONAME
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/bx86gcc/euseru.def
--- a/kernel/eka/bx86gcc/euseru.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/bx86gcc/euseru.def	Thu Jun 10 11:48:01 2010 +0100
@@ -697,11 +697,11 @@
 	_ZN5RHeap5ResetEv @ 696 NONAME ; RHeap::Reset()
 	_ZN5RHeap7ReAllocEPvii @ 697 NONAME ; RHeap::ReAlloc(void*, int, int)
 	_ZN5RHeap8CompressEv @ 698 NONAME ; RHeap::Compress()
-	_ZN5RHeapC1Eiii @ 699 NONAME ; RHeap::RHeap(int, int, int)
-	_ZN5RHeapC1Eiiiiiii @ 700 NONAME ; RHeap::RHeap(int, int, int, int, int, int, int)
-	_ZN5RHeapC2Eiii @ 701 NONAME ; RHeap::RHeap(int, int, int)
-	_ZN5RHeapC2Eiiiiiii @ 702 NONAME ; RHeap::RHeap(int, int, int, int, int, int, int)
-	_ZN5RHeapnwEjPv @ 703 NONAME ; RHeap::operator new(unsigned int, void*)
+	_ZN5RHeapC1Eiii @ 699 NONAME ABSENT ; RHeap::RHeap(int, int, int)
+	_ZN5RHeapC1Eiiiiiii @ 700 NONAME ABSENT ; RHeap::RHeap(int, int, int, int, int, int, int)
+	_ZN5RHeapC2Eiii @ 701 NONAME ABSENT ; RHeap::RHeap(int, int, int)
+	_ZN5RHeapC2Eiiiiiii @ 702 NONAME ABSENT ; RHeap::RHeap(int, int, int, int, int, int, int)
+	_ZN5RHeapnwEjPv @ 703 NONAME ABSENT ; RHeap::operator new(unsigned int, void*)
 	_ZN5RTest3EndEv @ 704 NONAME ; RTest::End()
 	_ZN5RTest4NextERK7TDesC16 @ 705 NONAME ; RTest::Next(TDesC16 const&)
 	_ZN5RTest5CloseEv @ 706 NONAME ; RTest::Close()
@@ -1601,7 +1601,7 @@
 	_ZNK4TUid4NameEv @ 1600 NONAME ; TUid::Name() const
 	_ZNK4TUideqERKS_ @ 1601 NONAME ; TUid::operator==(TUid const&) const
 	_ZNK4TUidneERKS_ @ 1602 NONAME ; TUid::operator!=(TUid const&) const
-	_ZNK5RHeap10GetAddressEPKv @ 1603 NONAME ; RHeap::GetAddress(void const*) const
+	_ZNK5RHeap10GetAddressEPKv @ 1603 NONAME ABSENT ; RHeap::GetAddress(void const*) const
 	_ZNK5RHeap8AllocLenEPKv @ 1604 NONAME ; RHeap::AllocLen(void const*) const
 	_ZNK5RHeap9AllocSizeERi @ 1605 NONAME ; RHeap::AllocSize(int&) const
 	_ZNK5RHeap9AvailableERi @ 1606 NONAME ; RHeap::Available(int&) const
@@ -1935,7 +1935,7 @@
 	_ZTV20CActiveSchedulerWait @ 1934 NONAME ; vtable for CActiveSchedulerWait
 	_ZTV4TKey @ 1935 NONAME ; vtable for TKey
 	_ZTV5CIdle @ 1936 NONAME ; vtable for CIdle
-	_ZTV5RHeap @ 1937 NONAME ; vtable for RHeap
+	_ZTV5RHeap @ 1937 NONAME ABSENT ; vtable for RHeap
 	_ZTV5TSwap @ 1938 NONAME ; vtable for TSwap
 	_ZTV6CTimer @ 1939 NONAME ; vtable for CTimer
 	_ZTV7CActive @ 1940 NONAME ; vtable for CActive
@@ -2487,3 +2487,12 @@
 	_ZNK7TDesC167Locate2E5TChar @ 2486 NONAME
 	_ZNK7TDesC168LocateF2E5TChar @ 2487 NONAME
 	_ZN6RTimer12AgainHighResER14TRequestStatus27TTimeIntervalMicroSeconds32 @ 2488 NONAME ; RTimer::AgainHighRes(TRequestStatus&, TTimeIntervalMicroSeconds32)
+	_ZNK10RAllocator4BaseEv @ 2489 NONAME
+	_ZNK10RAllocator4SizeEv @ 2490 NONAME
+	_ZNK10RAllocator5AlignEPv @ 2491 NONAME
+	_ZNK10RAllocator5AlignEi @ 2492 NONAME
+	_ZNK10RAllocator9MaxLengthEv @ 2493 NONAME
+	_ZN10RAllocator17__DbgGetAllocFailEv @ 2494 NONAME
+	_ZN4User17__DbgGetAllocFailEi @ 2495 NONAME
+	_ZN10RArrayBase12SetKeyOffsetEi @ 2496 NONAME
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/common/alloc.cpp
--- a/kernel/eka/common/alloc.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/common/alloc.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -11,7 +11,7 @@
 // Contributors:
 //
 // Description:
-// e32\common\alloc.cpp
+// kernel\eka\common\alloc.cpp
 // 
 //
 
@@ -19,7 +19,6 @@
 #include <e32atomics.h>
 
 
-
 #ifndef __KERNEL_MODE__
 /**
 Opens this heap for shared access.
@@ -280,7 +279,8 @@
 */
 EXPORT_C TInt RAllocator::Count() const
 	{
-	return iCellCount;
+	TInt totalAllocSize; 
+	return ((RAllocator*)this)->AllocSize(totalAllocSize);
 	}
 
 
@@ -461,6 +461,22 @@
 
 
 /**
+Obtains the current heap failure simulation type.
+
+After calling __DbgSetAllocFail(), this function may be called to retrieve the
+value set.  This is useful primarily for test code that doesn't know if a heap
+has been set to fail and needs to check.
+
+@return RAllocator::ENone if heap is not in failure simulation mode;
+		Otherwise one of the other RAllocator::TAllocFail enumerations
+*/
+UEXPORT_C RAllocator::TAllocFail RAllocator::__DbgGetAllocFail()
+	{
+	return((TAllocFail) DebugFunction(EGetFail));
+	}
+
+
+/**
 Simulates a burst of heap allocation failures for this heap.
 
 The failure occurs for aBurst allocations attempt via subsequent calls 
@@ -516,7 +532,66 @@
 	return DebugFunction(ECheckFailure);
 	}
 
+/**
+Gets the current size of the heap.
 
+This is the total number of bytes committed by the host chunk, less the number
+of bytes used by the heap's metadata (the internal structures used for keeping
+track of allocated and free memory).
+
+Size = (Rounded committed size - size of heap metadata).
+
+@return The size of the heap, in bytes.
+*/		
+UEXPORT_C TInt RAllocator::Size() const	
+	{
+	return ((RAllocator*)this)->DebugFunction(EGetSize);
+	}
+
+/**
+@return The maximum length to which the heap can grow.
+
+@publishedAll
+@released
+*/
+UEXPORT_C TInt RAllocator::MaxLength() const	
+	{
+	return ((RAllocator*)this)->DebugFunction(EGetMaxLength);
+	}
+
+/**
+Gets a pointer to the start of the heap.
+
+Note that this function exists mainly for compatibility reasons.  In a modern
+heap implementation such as that present in Symbian it is not appropriate to
+concern oneself with details such as the address of the start of the heap, as
+it is not as meaningful as it was in older heap implementations.  In fact, the
+"base" might not even be the base of the heap at all!
+
+In other words, you can call this but it's not guaranteed to point to the start
+of the heap (and in fact it never really was, even in legacy implementations).
+
+@return A pointer to the base of the heap.  Maybe.
+*/
+UEXPORT_C TUint8* RAllocator::Base() const	
+	{
+	TUint8* base;
+	((RAllocator*)this)->DebugFunction(EGetBase, &base);	
+	return base;
+	}
+
+UEXPORT_C TInt RAllocator::Align(TInt a) const	
+	{
+	return ((RAllocator*)this)->DebugFunction(EAlignInteger, (TAny*)a);
+	}
+
+UEXPORT_C TAny* RAllocator::Align(TAny* a) const	
+	{
+	TAny* result;
+	((RAllocator*)this)->DebugFunction(EAlignAddr, a, &result);
+	return result;
+	}
+	
 UEXPORT_C TInt RAllocator::Extension_(TUint, TAny*& a0, TAny*)
 	{
 	a0 = NULL;
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/common/arm/cheap.cia
--- a/kernel/eka/common/arm/cheap.cia	Mon May 24 18:45:46 2010 +0100
+++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
@@ -1,142 +0,0 @@
-// Copyright (c) 1994-2009 Nokia Corporation and/or its subsidiary(-ies).
-// All rights reserved.
-// This component and the accompanying materials are made available
-// under the terms of the License "Eclipse Public License v1.0"
-// which accompanies this distribution, and is available
-// at the URL "http://www.eclipse.org/legal/epl-v10.html".
-//
-// Initial Contributors:
-// Nokia Corporation - initial contribution.
-//
-// Contributors:
-//
-// Description:
-// e32\common\arm\cheap.cia
-// 
-//
-
-#include <e32cia.h>
-#include "../common.h"
-
-#if defined(__HEAP_MACHINE_CODED__) && !defined(_DEBUG)
-GLREF_C void RHeap_PanicBadAllocatedCellSize();
-GLREF_C void RHeap_PanicBadNextCell();
-GLREF_C void RHeap_PanicBadPrevCell();
-GLREF_C void RHeap_PanicBadCellAddress();
-
-IMPORT_D extern const TInt KHeapShrinkHysRatio;
-
-
-__NAKED__ RHeap::SCell* RHeap::DoAlloc(TInt /*aSize*/, SCell*& /*aLastFree*/)
-//
-// Allocate a cell.
-//
-	{
-	asm("stmfd sp!, {r4,r5,lr} ");
-	asm("mov r4, r0 ");										// r4=this
-	asm("add r3, r0, #%a0" : : "i" _FOFF(RHeap,iFree));		// r3=pP=&iFree
-	asm("ldr r0, [r3, #4] ");								// r0=pC=pP->next
-	asm("cmp r0, #0 ");
-	asm("beq 0f ");								// if no free cells, alloc failed
-
-	// optimised unfolded scanning loop
-	asm("2: ");
-	asm("ldmia r0, {r12,r14} ");				// r12=pC->size, r14=pC->next
-	asm("cmp r1, r12 ");						// compare aSize to size
-	asm("movhi r3, r0 ");						// if aSize>size, pP=pC
-	asm("movhis r0, r14 ");						// and pC=pC->next
-#ifndef __CPU_ARMV6 // don't unroll on armv6
-	asm("ldmhiia r0, {r12,r14} ");				// r12=pC->size, r14=pC->next
-	asm("cmphi r1, r12 ");						// compare aSize to size
-	asm("movhi r3, r0 ");						// if aSize>size, pP=pC
-	asm("movhis r0, r14 ");						// and pC=pC->next
-#endif
-	asm("bhi 2b ");								// branch back if scan not finished
-	
-	asm("1: ");
-	asm("subs r5, r12, r1 ");					// r5 = pC->len - aSize
-	asm("ldrhs r2, [r4, #%a0]" : : "i" _FOFF(RHeap,iMinCell));		// if big enough, r2=iMinCell
-	asm("blo 0f ");								// branch if no free cell was big enough
-	asm("cmp r5, r2 ");							// leftover big enough?
-	asm("movlo r1, r12 ");						// if not, aSize=pC->len ...
-	asm("strlo r14, [r3, #4] ");				// ... and pP->next = pC->next
-	asm("addhs r2, r0, r1 ");					// else r2 = pE = address of new free cell ...
-	asm("stmhsia r2, {r5, r14} ");				// ... pE->len = pC->len - aSize, pE->next = pC->next ...
-	asm("strhs r2, [r3, #4] ");					// ... and pP->next = pE
-	asm("str r1, [r0] ");						// pC->len = aSize
-	__POPRET("r4,r5,");							// restore and exit, return pC
-
-	asm("0: ");
-	asm("str r3, [r2] ");						// alloc failed - aLastFree=pP
-	asm("mov r0, #0 ");							// return NULL
-	__POPRET("r4,r5,");
-	}
-
-__NAKED__ void RHeap::DoFree(SCell* /*pC*/)
-//
-// Free a cell.
-//
-	{
-	asm("add r2, r0, #%a0" : : "i" _FOFF(RHeap,iFree));	// r2=pP=&iFree
-	asm("ldr r3, [r2, #4] ");					// r3=pE=pP->next
-	asm("stmfd sp!, {r4, r5} ");
-
-	asm("1: ");
-	asm("cmp r3, #0 ");						// check if pE=NULL
-	asm("cmphi r1, r3 ");					// if not, check if pC>pE
-	asm("movhi r2, r3 ");					// if so, pP=pE
-	asm("ldrhi r3, [r3, #4] ");				// and pE=pE->next
-#ifndef __CPU_ARMV6    // don't unroll on armv6
-	asm("cmphi r3, #0 ");					// check if pE=NULL
-	asm("cmphi r1, r3 ");					// if not, check if pC>pE
-	asm("movhi r2, r3 ");					// if so, pP=pE
-	asm("ldrhi r3, [r3, #4] ");				// and pE=pE->next
-#endif
-	asm("bhi 1b ");							// loop if free cell position not found
-
-	asm("ldr r4, [r1, #0] ");				// r4=pC->len
-	asm("cmp r3, #0 ");						// is there a following free cell ?
-	asm("streq r3, [r1, #4] ");				// if not, pC->next=NULL
-	asm("beq 2f ");							// and skip next section
-	asm("add r5, r1, r4 ");					// r5=pN=pC + pC->len (cell after pC)
-	asm("cmp r5, r3 ");						// compare pN with pE
-	asm("ldmeqia r3, {r5, r12} ");			// if pN==pE, r5=pE->len, r12=pE->next
-	asm("blhi " CSM_Z22RHeap_PanicBadNextCellv );	// if pN>pE, panic
-	asm("strne r3, [r1, #4] ");				// if pN<pE, pC->next=pE
-	asm("addeq r4, r4, r5 ");				// if pN==pE r4 = pC->len + pE->len
-	asm("stmeqia r1, {r4,r12} ");			// if pN==pE pC->len+=pE->len, pC->next=pE->next
-	asm("2: ");
-	asm("ldr r3, [r2, #0] ");				// r3=pP->len
-	asm("sub r5, r1, r2 ");					// r5=pC-pP (gap between preceding free cell and this one)
-	asm("cmp r5, r3 ");						// compare gap with predecessor length
-	asm("ldreq r12, [r1, #4] ");			// if predecessor is adjacent, r12=pC->next
-	asm("bllo RHeap_PanicBadPrevCell__Fv ");	// if predecessor overlaps, panic
-	asm("addeq r4, r4, r3 ");				// if predecessor is adjacent, r4=pC->len + pP->len
-	asm("stmeqia r2, {r4,r12} ");			// if predecessor is adjacent, pP->len+=pC->len, pP->next=pC->next
-	asm("strne r1, [r2, #4] ");				// else pP->next = pC
-	asm("moveq r1, r2 ");					// if predecessor is adjacent, pC=pP (final amalgamated free cell)
-	asm("3: ");
-	asm("ldr r12, [r0, #%a0]" : : "i" _FOFF(RHeap,iTop));	// r12=iTop
-	asm("add r3, r1, r4 ");					// end of amalgamated free cell
-	asm("cmp r3, r12 ");					// end of amalgamated free cell = iTop ?
-	asm("ldmneia sp!, {r4,r5} ");			// restore registers
-	__JUMP(ne,lr);							// if not, finished
-	asm("ldr r12, [r0, #%a0]" : : "i" _FOFF(RHeap,iFlags));	// r12=iFlags
-	asm("tst r12, #%a0" : : "i" ((TInt)RAllocator::EFixedSize));	// check fixed size flag
-	asm("ldmneia sp!, {r4,r5} ");			// restore registers
-	__JUMP(ne,lr);							// if set, finished
-	asm("ldr r2, [r0, #%a0]" : : "i" _FOFF(RHeap,iGrowBy));	// r2=iGrowBy
-	asm("mov r3, r2, LSR #8");				// r3=iGrowBy>>8
-	asm("ldr r2, const_addr");				// r2=&KHeapShrinkHysRatio
-	asm("ldr r5, [r2]");					// r5=KHeapShrinkHysRatio
-	asm("mul r2, r5, r3");					// r2=KHeapShrinkHysRatio*(iGrowBy>>8) - low order bits
-	asm("cmp r4, r2");						// compare len(r4) to (iGrowBy>>8)*KHeapShrinkHysRatio(r2)
-	asm("ldmia sp!, {r4,r5} ");				// restore registers
-	__JUMP(lo,lr);							// if less, finished
-	asm("b Reduce__5RHeapPQ25RHeap5SCell ");	// else reduce heap
-	
-	asm("const_addr:");
-	asm(".word %a0" : : "i" ((TInt)&KHeapShrinkHysRatio));	
-	}
-#endif
-
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/common/array.cpp
--- a/kernel/eka/common/array.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/common/array.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -663,6 +663,12 @@
 	return iCount;
 	}
 
+EXPORT_C void RArrayBase::SetKeyOffset(TInt aKeyOffset)
+	{
+	__ASSERT_ALWAYS(TUint(aKeyOffset)<TUint(iEntrySize) && (aKeyOffset&3)==0, Panic(EBadArrayKeyOffset));
+	iKeyOffset = aKeyOffset;
+	}
+
 #ifndef __ARRAY_MACHINE_CODED__
 EXPORT_C TAny* RArrayBase::At(TInt anIndex) const
 	{
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/common/common.h
--- a/kernel/eka/common/common.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/common/common.h	Thu Jun 10 11:48:01 2010 +0100
@@ -51,7 +51,7 @@
 #define __KERNEL_CHECK_RADIX(r)		__ASSERT_ALWAYS(((r)==EDecimal)||((r)==EHex),Panic(EInvalidRadix))
 #define	APPEND_BUF_SIZE				10
 #define	APPEND_BUF_SIZE_64			20
-#define	HEAP_PANIC(r)				RHeapK::Fault(r)
+#define	HEAP_PANIC(r)				Kern::Printf("HEAP CORRUPTED %s %d", __FILE__, __LINE__), RHeapK::Fault(r)
 #define	GET_PAGE_SIZE(x)			x = M::PageSizeInBytes()
 #define	DIVISION_BY_ZERO()			FAULT()
 
@@ -71,7 +71,7 @@
 #define __KERNEL_CHECK_RADIX(r)
 #define	APPEND_BUF_SIZE				32
 #define	APPEND_BUF_SIZE_64			64
-#define	HEAP_PANIC(r)				Panic(r)
+#define	HEAP_PANIC(r)				RDebug::Printf("HEAP CORRUPTED %s %d", __FILE__, __LINE__), Panic(r)
 #define	GET_PAGE_SIZE(x)			UserHal::PageSizeInBytes(x)
 #define	DIVISION_BY_ZERO()			User::RaiseException(EExcIntegerDivideByZero)
 #define	__CHECK_THREAD_STATE
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/common/debugfunction.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/common/debugfunction.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,1124 @@
+// Copyright (c) 1994-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// kernel\eka\common\debugfunction.cpp
+// 
+//
+
+#include "common.h"
+#ifdef __KERNEL_MODE__
+#include <kernel/kern_priv.h>
+#endif
+#include "dla.h"
+#ifndef __KERNEL_MODE__
+#include "slab.h"
+#include "page_alloc.h"
+#endif
+#include "heap_hybrid.h"
+
+#define GM  (&iGlobalMallocState)
+#define __HEAP_CORRUPTED_TRACE(t,p,l) BTraceContext12(BTrace::EHeap, BTrace::EHeapCorruption, (TUint32)t, (TUint32)p, (TUint32)l);
+#define __HEAP_CORRUPTED_TEST(c,x, p,l) if (!c) { if (iFlags & (EMonitorMemory+ETraceAllocs) )  __HEAP_CORRUPTED_TRACE(this,p,l)  HEAP_PANIC(x); }
+#define __HEAP_CORRUPTED_TEST_STATIC(c,t,x,p,l) if (!c) { if (t && (t->iFlags & (EMonitorMemory+ETraceAllocs) )) __HEAP_CORRUPTED_TRACE(t,p,l) HEAP_PANIC(x); }
+
+TInt RHybridHeap::DebugFunction(TInt aFunc, TAny* a1, TAny* a2)
+{
+    TInt r = KErrNone;
+    switch(aFunc)
+        {
+        
+        case RAllocator::ECount:
+            struct HeapInfo info;
+            Lock();
+            GetInfo(&info, NULL);
+            *(unsigned*)a1 = info.iFreeN;
+            r = info.iAllocN;
+            Unlock();
+            break;
+            
+        case RAllocator::EMarkStart:
+            __DEBUG_ONLY(DoMarkStart());
+            break;
+            
+        case RAllocator::EMarkEnd:
+            __DEBUG_ONLY( r = DoMarkEnd((TInt)a1) );
+            break;
+            
+        case RAllocator::ECheck:
+            r = DoCheckHeap((SCheckInfo*)a1);
+            break;
+            
+        case RAllocator::ESetFail:
+            __DEBUG_ONLY(DoSetAllocFail((TAllocFail)(TInt)a1, (TInt)a2));
+            break;
+
+        case RAllocator::EGetFail:
+            __DEBUG_ONLY(r = iFailType);
+            break;
+
+        case RAllocator::ESetBurstFail:
+#if _DEBUG
+            {
+            SRAllocatorBurstFail* fail = (SRAllocatorBurstFail*) a2;
+            DoSetAllocFail((TAllocFail)(TInt)a1, fail->iRate, fail->iBurst);
+            }
+#endif
+            break;
+            
+        case RAllocator::ECheckFailure:
+            // iRand will be incremented for each EFailNext, EBurstFailNext,
+            // EDeterministic and EBurstDeterministic failure.
+            r = iRand;
+            break;
+            
+        case RAllocator::ECopyDebugInfo:
+            {
+            TInt nestingLevel = ((SDebugCell*)a1)[-1].nestingLevel;
+            ((SDebugCell*)a2)[-1].nestingLevel = nestingLevel;
+            break;
+            }
+
+		case RAllocator::EGetSize:
+			{
+			r = iChunkSize - sizeof(RHybridHeap);
+			break;
+			}
+
+		case RAllocator::EGetMaxLength:
+			{
+			r = iMaxLength;
+			break;
+			}
+
+		case RAllocator::EGetBase:
+			{
+			*(TAny**)a1 = iBase;
+			break;
+			}
+
+		case RAllocator::EAlignInteger:
+			{
+			r = _ALIGN_UP((TInt)a1, iAlign);
+			break;
+			}
+
+		case RAllocator::EAlignAddr:
+			{
+            *(TAny**)a2 = (TAny*)_ALIGN_UP((TLinAddr)a1, iAlign);
+			break;
+			}
+
+        case RHybridHeap::EWalk:
+            struct HeapInfo hinfo;
+            SWalkInfo winfo;
+            Lock();
+            winfo.iFunction = (TWalkFunc)a1;
+            winfo.iParam    = a2;
+			winfo.iHeap     = (RHybridHeap*)this; 	
+            GetInfo(&hinfo, &winfo);
+            Unlock();
+            break;
+
+#ifndef __KERNEL_MODE__
+			
+        case RHybridHeap::EHybridHeap:
+            {
+			if ( !a1 )
+				return KErrGeneral;
+			STestCommand* cmd = (STestCommand*)a1;
+			switch ( cmd->iCommand )
+				{
+				case EGetConfig:
+					cmd->iConfig.iSlabBits = iSlabConfigBits;
+					cmd->iConfig.iDelayedSlabThreshold = iPageThreshold;
+					cmd->iConfig.iPagePower = iPageThreshold;
+					break;
+					
+				case ESetConfig:
+					//
+					// New configuration data for slab and page allocator.
+					// Reset heap to get data into use
+					//
+#if USE_HYBRID_HEAP
+					iSlabConfigBits  = cmd->iConfig.iSlabBits & 0x3fff;
+					iSlabInitThreshold = cmd->iConfig.iDelayedSlabThreshold;
+					iPageThreshold = (cmd->iConfig.iPagePower & 0x1f);
+					Reset();
+#endif
+					break;
+					
+				case EHeapMetaData:
+					cmd->iData = this;
+					break;
+					
+				case ETestData:
+					iTestData = cmd->iData;
+					break;
+
+				default:
+					return KErrNotSupported;
+					
+				}
+
+            break;
+			}
+#endif  // __KERNEL_MODE            
+            
+        default:
+            return KErrNotSupported;
+            
+        }
+    return r;
+}
+
+void RHybridHeap::Walk(SWalkInfo* aInfo, TAny* aBfr, TInt aLth, TCellType aBfrType, TAllocatorType aAllocatorType)
+{
+    //
+    // This function is always called from RHybridHeap::GetInfo.
+    // Actual walk function is called if SWalkInfo pointer is defined
+    // 
+    //
+    if ( aInfo )
+        {
+#ifdef __KERNEL_MODE__
+		(void)aAllocatorType;
+#if defined(_DEBUG)		
+		if ( aBfrType == EGoodAllocatedCell )
+			aInfo->iFunction(aInfo->iParam, aBfrType, ((TUint8*)aBfr+EDebugHdrSize), (aLth-EDebugHdrSize) );
+		else
+			aInfo->iFunction(aInfo->iParam, aBfrType,  aBfr, aLth );
+#else
+		aInfo->iFunction(aInfo->iParam, aBfrType, aBfr, aLth );
+#endif
+		
+#else  // __KERNEL_MODE__
+		
+        if ( aAllocatorType & (EFullSlab + EPartialFullSlab + EEmptySlab + ESlabSpare) )
+			{
+			if ( aInfo->iHeap )
+				{
+				TUint32 dummy;
+				TInt    npages;
+				aInfo->iHeap->DoCheckSlab((slab*)aBfr, aAllocatorType);
+				__HEAP_CORRUPTED_TEST_STATIC(aInfo->iHeap->CheckBitmap(Floor(aBfr, PAGESIZE), PAGESIZE, dummy, npages),
+											 aInfo->iHeap, ETHeapBadCellAddress, aBfr, aLth);
+				}
+			if ( aAllocatorType & EPartialFullSlab )
+				 WalkPartialFullSlab(aInfo, (slab*)aBfr, aBfrType, aLth);	
+            else if ( aAllocatorType & EFullSlab )
+					WalkFullSlab(aInfo, (slab*)aBfr, aBfrType, aLth);
+			}
+#if defined(_DEBUG)     
+        else  if ( aBfrType == EGoodAllocatedCell )
+            aInfo->iFunction(aInfo->iParam, aBfrType, ((TUint8*)aBfr+EDebugHdrSize), (aLth-EDebugHdrSize) );
+        else
+            aInfo->iFunction(aInfo->iParam, aBfrType,  aBfr, aLth );
+#else
+        else
+            aInfo->iFunction(aInfo->iParam, aBfrType, aBfr, aLth );
+#endif
+
+#endif // __KERNEL_MODE	
+        }
+}
+
+#ifndef __KERNEL_MODE__
+void RHybridHeap::WalkPartialFullSlab(SWalkInfo* aInfo, slab* aSlab, TCellType /*aBfrType*/, TInt /*aLth*/)
+{
+	if ( aInfo )
+		{
+		//
+		// Build bitmap of free buffers in the partial full slab
+		//
+		TUint32 bitmap[4];
+		__HEAP_CORRUPTED_TEST_STATIC( (aInfo->iHeap != NULL), aInfo->iHeap, ETHeapBadCellAddress, 0, aSlab);
+		aInfo->iHeap->BuildPartialSlabBitmap(bitmap, aSlab);
+		//
+		// Find used (allocated) buffers from iPartial full slab
+		//
+		TUint32 h = aSlab->iHeader;
+		TUint32 size = SlabHeaderSize(h);
+		TUint32 count = KMaxSlabPayload / size;  // Total buffer count in slab
+		TUint32 i = 0;
+		TUint32 ix = 0;
+		TUint32 bit = 1;				
+
+		while ( i < count )
+			{
+
+			if ( bitmap[ix] & bit )
+				{
+				aInfo->iFunction(aInfo->iParam, EGoodFreeCell, &aSlab->iPayload[i*size], size ); 
+				} 
+			else
+				{
+#if defined(_DEBUG)
+				aInfo->iFunction(aInfo->iParam, EGoodAllocatedCell, (&aSlab->iPayload[i*size]+EDebugHdrSize), (size-EDebugHdrSize) );
+#else				
+				aInfo->iFunction(aInfo->iParam, EGoodAllocatedCell, &aSlab->iPayload[i*size], size );
+#endif
+				}
+			bit <<= 1;
+			if ( bit == 0 )
+				{
+				bit = 1;
+				ix ++;
+				}
+
+			i ++;
+			}
+		}
+
+}
+
+void RHybridHeap::WalkFullSlab(SWalkInfo* aInfo, slab* aSlab, TCellType aBfrType, TInt /*aLth*/)
+{
+	if ( aInfo )
+		{
+		TUint32 h = aSlab->iHeader;
+		TUint32 size = SlabHeaderSize(h);
+		TUint32 count = (SlabHeaderUsedm4(h) + 4) / size;
+		TUint32 i = 0;
+		while ( i < count )
+			{
+#if defined(_DEBUG)
+			if ( aBfrType == EGoodAllocatedCell )
+				aInfo->iFunction(aInfo->iParam, aBfrType, (&aSlab->iPayload[i*size]+EDebugHdrSize), (size-EDebugHdrSize) );
+			else
+				aInfo->iFunction(aInfo->iParam, aBfrType, &aSlab->iPayload[i*size], size );
+#else
+			aInfo->iFunction(aInfo->iParam, aBfrType, &aSlab->iPayload[i*size], size );
+#endif      
+			i ++;
+			}
+		}
+}
+
+void RHybridHeap::BuildPartialSlabBitmap(TUint32* aBitmap, slab* aSlab, TAny* aBfr)
+{
+	//
+	// Build a bitmap of free buffers in a partial full slab
+	//
+	TInt i;
+	TUint32 bit = 0;
+	TUint32 index;  
+	TUint32 h = aSlab->iHeader;
+	TUint32 used = SlabHeaderUsedm4(h)+4;
+	TUint32 size = SlabHeaderSize(h);
+	TInt    count = (KMaxSlabPayload / size);
+	TInt    free_count = count -  (used / size); // Total free buffer count in slab
+	aBitmap[0] = 0, aBitmap[1] = 0,	aBitmap[2] = 0, aBitmap[3] = 0;
+	TUint32 offs = (h & 0xff) << 2;
+
+	//
+	// Process first buffer in partial slab free buffer chain
+	//
+	while ( offs )
+		{
+		unsigned char* p = (unsigned char*)Offset(aSlab, offs); 		
+		__HEAP_CORRUPTED_TEST( (sizeof(slabhdr) <= offs), ETHeapBadCellAddress, p, aSlab);
+		offs -= sizeof(slabhdr);
+		__HEAP_CORRUPTED_TEST( (offs % size == 0), ETHeapBadCellAddress, p, aSlab);
+		index = (offs / size);  // Bit index in bitmap
+		i = 0;
+		while ( i < 4 )
+			{
+			if ( index < 32 )
+				{
+				bit = (1 << index);
+				break;
+				}
+			index -= 32;
+			i ++;
+			}
+
+		__HEAP_CORRUPTED_TEST( ((aBitmap[i] & bit) == 0), ETHeapBadCellAddress, p, aSlab);  // Buffer already in chain
+
+		aBitmap[i] |= bit;
+		free_count --;
+		offs = ((unsigned)*p) << 2; // Next in free chain
+		}
+
+	__HEAP_CORRUPTED_TEST( (free_count >= 0), ETHeapBadCellAddress, aBfr, aSlab);  // free buffer count/size mismatch	
+	//
+	// Process next rest of the free buffers which are in the
+	// wilderness (at end of the slab)
+	//
+	index = count - 1;
+	i = index / 32;
+	index = index % 32;
+	while ( free_count && (i >= 0))
+		{
+		bit = (1 << index);
+		__HEAP_CORRUPTED_TEST( ((aBitmap[i] & bit) == 0), ETHeapBadCellAddress, aBfr, aSlab);  // Buffer already in chain
+		aBitmap[i] |= bit;
+		if ( index )
+			index --;
+		else
+			{
+			index = 31;
+			i --;
+			}
+		free_count --;
+		}
+
+	if ( aBfr )  // Assure that specified buffer does NOT exist in partial slab free buffer chain
+		{
+		offs = LowBits(aBfr, SLABSIZE);
+		__HEAP_CORRUPTED_TEST( (sizeof(slabhdr) <= offs), ETHeapBadCellAddress, aBfr, aSlab);
+		offs -= sizeof(slabhdr);
+		__HEAP_CORRUPTED_TEST( ((offs % size) == 0), ETHeapBadCellAddress, aBfr, aSlab);
+		index = (offs / size);  // Bit index in bitmap
+		i = 0;
+		while ( i < 4 )
+			{
+			if ( index < 32 )
+				{
+				bit = (1 << index);
+				break;
+				}
+			index -= 32;
+			i ++;
+			}
+		__HEAP_CORRUPTED_TEST( ((aBitmap[i] & bit) == 0), ETHeapBadCellAddress, aBfr, aSlab);  // Buffer already in chain
+		}
+}
+
+#endif	// __KERNEL_MODE__
+
+void RHybridHeap::WalkCheckCell(TAny* aPtr, TCellType aType, TAny* aCell, TInt aLen)
+{
+    (void)aCell;
+    SHeapCellInfo& info = *(SHeapCellInfo*)aPtr;
+    switch(aType)
+        {
+        case EGoodAllocatedCell:
+            {
+            ++info.iTotalAlloc;
+            info.iTotalAllocSize += aLen; 
+#if defined(_DEBUG)
+            RHybridHeap& h = *info.iHeap;
+            SDebugCell* DbgCell = (SDebugCell*)((TUint8*)aCell-EDebugHdrSize);
+            if ( DbgCell->nestingLevel == h.iNestingLevel )
+                {
+                if (++info.iLevelAlloc==1)
+                    info.iStranded = DbgCell;
+#ifdef __KERNEL_MODE__
+                if (KDebugNum(KSERVER) || KDebugNum(KTESTFAST))
+                    {
+                    Kern::Printf("LEAKED KERNEL HEAP CELL @ %08x : len=%d", aCell, aLen);
+                    TLinAddr base = ((TLinAddr)aCell)&~0x0f;
+                    TLinAddr end = ((TLinAddr)aCell)+(TLinAddr)aLen;
+                    while(base<end)
+                        {
+                        const TUint32* p = (const TUint32*)base;
+                        Kern::Printf("%08x: %08x %08x %08x %08x", p, p[0], p[1], p[2], p[3]);
+                        base += 16;
+                        }
+                    }
+#endif
+                }
+#endif  
+            break;
+            }
+        case EGoodFreeCell:
+            ++info.iTotalFree;
+            break;
+        case EBadAllocatedCellSize:
+            HEAP_PANIC(ETHeapBadAllocatedCellSize);
+        case EBadAllocatedCellAddress:
+            HEAP_PANIC(ETHeapBadAllocatedCellAddress);
+        case EBadFreeCellAddress:
+            HEAP_PANIC(ETHeapBadFreeCellAddress);
+        case EBadFreeCellSize:
+            HEAP_PANIC(ETHeapBadFreeCellSize);
+        default:
+            HEAP_PANIC(ETHeapWalkBadCellType);
+        }
+}
+
+
+TInt RHybridHeap::DoCheckHeap(SCheckInfo* aInfo)
+{
+    (void)aInfo;
+    SHeapCellInfo info;
+    memclr(&info, sizeof(info));
+    info.iHeap = this;
+    struct HeapInfo hinfo;
+    SWalkInfo winfo;
+    Lock();
+	DoCheckMallocState(GM);  // Check DL heap internal structure
+#ifndef __KERNEL_MODE__
+	TUint32 dummy;
+	TInt    npages;
+	__HEAP_CORRUPTED_TEST(CheckBitmap(NULL, 0, dummy, npages), ETHeapBadCellAddress, this, 0);  // Check page allocator buffers
+	DoCheckSlabTrees();	
+	DoCheckCommittedSize(npages, GM);
+#endif				   
+    winfo.iFunction = WalkCheckCell;
+    winfo.iParam    = &info;
+	winfo.iHeap     = (RHybridHeap*)this; 		
+    GetInfo(&hinfo, &winfo);
+    Unlock();
+    
+#if defined(_DEBUG)
+    if (!aInfo)
+        return KErrNone;
+    TInt expected = aInfo->iCount;
+    TInt actual = aInfo->iAll ? info.iTotalAlloc : info.iLevelAlloc;
+    if (actual!=expected && !iTestData)
+        {
+#ifdef __KERNEL_MODE__
+        Kern::Fault("KERN-ALLOC COUNT", (expected<<16)|actual );
+#else
+        User::Panic(_L("ALLOC COUNT"), (expected<<16)|actual );
+#endif
+        }
+#endif
+    return KErrNone;
+}
+
+#ifdef _DEBUG
+void RHybridHeap::DoMarkStart()
+{
+    if (iNestingLevel==0)
+        iAllocCount=0;
+    iNestingLevel++;
+}
+
+TUint32 RHybridHeap::DoMarkEnd(TInt aExpected)
+{
+    if (iNestingLevel==0)
+        return 0;
+    SHeapCellInfo info;
+    SHeapCellInfo* p = iTestData ? (SHeapCellInfo*)iTestData : &info;
+    memclr(p, sizeof(info));
+    p->iHeap = this;
+    struct HeapInfo hinfo;
+    SWalkInfo winfo;
+    Lock();
+    winfo.iFunction = WalkCheckCell;
+    winfo.iParam    = p;
+	winfo.iHeap     = (RHybridHeap*)this; 	
+    GetInfo(&hinfo, &winfo);
+    Unlock();
+    
+    if (p->iLevelAlloc != aExpected && !iTestData)
+        return (TUint32)(p->iStranded + 1);
+    if (--iNestingLevel == 0)
+        iAllocCount = 0;
+    return 0;
+}
+
+void RHybridHeap::DoSetAllocFail(TAllocFail aType, TInt aRate)
+{// Default to a burst mode of 1, as aType may be a burst type.
+    DoSetAllocFail(aType, aRate, 1);
+}
+
+void ResetAllocCellLevels(TAny* aPtr, RHybridHeap::TCellType aType, TAny* aCell, TInt aLen)
+{
+    (void)aPtr;
+    (void)aLen;
+    
+    if (aType == RHybridHeap::EGoodAllocatedCell)
+        {
+        RHybridHeap::SDebugCell* DbgCell = (RHybridHeap::SDebugCell*)((TUint8*)aCell-RHeap::EDebugHdrSize);
+        DbgCell->nestingLevel = 0;
+        }
+}
+
+// Don't change as the ETHeapBadDebugFailParameter check below and the API 
+// documentation rely on this being 16 for RHybridHeap.
+LOCAL_D const TInt KBurstFailRateShift = 16;
+LOCAL_D const TInt KBurstFailRateMask = (1 << KBurstFailRateShift) - 1;
+
+void RHybridHeap::DoSetAllocFail(TAllocFail aType, TInt aRate, TUint aBurst)
+{
+    if (aType==EReset)
+        {
+        // reset levels of all allocated cells to 0
+        // this should prevent subsequent tests failing unnecessarily
+        iFailed = EFalse;       // Reset for ECheckFailure relies on this.
+        struct HeapInfo hinfo;
+        SWalkInfo winfo;
+        Lock();
+        winfo.iFunction = (TWalkFunc)&ResetAllocCellLevels;
+        winfo.iParam    = NULL;
+		winfo.iHeap     = (RHybridHeap*)this; 	
+        GetInfo(&hinfo, &winfo);
+        Unlock();
+        // reset heap allocation mark as well
+        iNestingLevel=0;
+        iAllocCount=0;
+        aType=ENone;
+        }
+    
+    switch (aType)
+        {
+        case EBurstRandom:
+        case EBurstTrueRandom:
+        case EBurstDeterministic:
+        case EBurstFailNext:
+            // If the fail type is a burst type then iFailRate is split in 2:
+            // the 16 lsbs are the fail rate and the 16 msbs are the burst length.
+            if (TUint(aRate) > (TUint)KMaxTUint16 || aBurst > KMaxTUint16)
+                HEAP_PANIC(ETHeapBadDebugFailParameter);
+            
+            iFailed = EFalse;
+            iFailType = aType;
+            iFailRate = (aRate == 0) ? 1 : aRate;
+            iFailAllocCount = -iFailRate;
+            iFailRate = iFailRate | (aBurst << KBurstFailRateShift);
+            break;
+            
+        default:
+            iFailed = EFalse;
+            iFailType = aType;
+            iFailRate = (aRate == 0) ? 1 : aRate; // A rate of <1 is meaningless
+            iFailAllocCount = 0;
+            break;
+        }
+    
+    // Set up iRand for either:
+    //      - random seed value, or
+    //      - a count of the number of failures so far.
+    iRand = 0;
+#ifndef __KERNEL_MODE__
+    switch (iFailType)
+        {
+        case ETrueRandom:
+        case EBurstTrueRandom:
+            {
+            TTime time;
+            time.HomeTime();
+            TInt64 seed = time.Int64();
+            iRand = Math::Rand(seed);
+            break;
+            }
+        case ERandom:
+        case EBurstRandom:
+            {
+            TInt64 seed = 12345;
+            iRand = Math::Rand(seed);
+            break;
+            }
+        default:
+            break;
+        }
+#endif
+}
+
+TBool RHybridHeap::CheckForSimulatedAllocFail()
+//
+// Check to see if the user has requested simulated alloc failure, and if so possibly 
+// Return ETrue indicating a failure.
+//
+{
+    // For burst mode failures iFailRate is shared
+    TUint16 rate  = (TUint16)(iFailRate &  KBurstFailRateMask);
+    TUint16 burst = (TUint16)(iFailRate >> KBurstFailRateShift);
+    TBool r = EFalse;
+    switch (iFailType)
+        {
+#ifndef __KERNEL_MODE__
+        case ERandom:
+        case ETrueRandom:
+            if (++iFailAllocCount>=iFailRate) 
+                {   
+                iFailAllocCount=0;
+                if (!iFailed) // haven't failed yet after iFailRate allocations so fail now
+                    return(ETrue); 
+                iFailed=EFalse;
+                }
+            else   
+                {
+                if (!iFailed)
+                    {
+                    TInt64 seed=iRand;
+                    iRand=Math::Rand(seed);
+                    if (iRand%iFailRate==0)
+                        {
+                        iFailed=ETrue;
+                        return(ETrue);
+                        }
+                    }
+                }
+            break;
+            
+        case EBurstRandom:
+        case EBurstTrueRandom:
+            if (++iFailAllocCount < 0) 
+                {
+                // We haven't started failing yet so should we now?
+                TInt64 seed = iRand;
+                iRand = Math::Rand(seed);
+                if (iRand % rate == 0)
+                    {// Fail now.  Reset iFailAllocCount so we fail burst times
+                    iFailAllocCount = 0;
+                    r = ETrue;
+                    }
+                }
+            else
+                {
+                if (iFailAllocCount < burst)
+                    {// Keep failing for burst times
+                    r = ETrue;
+                    }
+                else
+                    {// We've now failed burst times so start again.
+                    iFailAllocCount = -(rate - 1);
+                    }
+                }
+            break;
+#endif
+        case EDeterministic:
+            if (++iFailAllocCount%iFailRate==0)
+                {
+                r=ETrue;
+                iRand++;    // Keep count of how many times we have failed
+                }
+            break;
+            
+        case EBurstDeterministic:
+            // This will fail burst number of times, every rate attempts.
+            if (++iFailAllocCount >= 0)
+                {
+                if (iFailAllocCount == burst - 1)
+                    {// This is the burst time we have failed so make it the last by
+                    // reseting counts so we next fail after rate attempts.
+                    iFailAllocCount = -rate;
+                    }
+                r = ETrue;
+                iRand++;    // Keep count of how many times we have failed
+                }
+            break;
+            
+        case EFailNext:
+            if ((++iFailAllocCount%iFailRate)==0)
+                {
+                iFailType=ENone;
+                r=ETrue;
+                iRand++;    // Keep count of how many times we have failed
+                }
+            break;
+            
+        case EBurstFailNext:
+            if (++iFailAllocCount >= 0)
+                {
+                if (iFailAllocCount == burst - 1)
+                    {// This is the burst time we have failed so make it the last.
+                    iFailType = ENone;
+                    }
+                r = ETrue;
+                iRand++;    // Keep count of how many times we have failed
+                }
+            break;
+            
+        default:
+            break;
+        }
+    return r;
+}
+
+#endif  // DEBUG
+
+//
+//  Methods for Doug Lea allocator detailed check
+//
+
+void RHybridHeap::DoCheckAnyChunk(mstate m, mchunkptr p)
+{
+    __HEAP_CORRUPTED_TEST(((IS_ALIGNED(CHUNK2MEM(p))) || (p->iHead == FENCEPOST_HEAD)), ETHeapBadCellAddress, p, 0);
+	(void)m;
+}
+
+/* Check properties of iTop chunk */
+void RHybridHeap::DoCheckTopChunk(mstate m, mchunkptr p)
+{
+    msegmentptr sp = &m->iSeg;
+    size_t  sz = CHUNKSIZE(p);
+    __HEAP_CORRUPTED_TEST((sp != 0), ETHeapBadCellAddress, p, 0);
+    __HEAP_CORRUPTED_TEST(((IS_ALIGNED(CHUNK2MEM(p))) || (p->iHead == FENCEPOST_HEAD)), ETHeapBadCellAddress, p,0);
+    __HEAP_CORRUPTED_TEST((sz == m->iTopSize), ETHeapBadCellAddress,p,0);
+    __HEAP_CORRUPTED_TEST((sz > 0), ETHeapBadCellAddress,p,0);
+    __HEAP_CORRUPTED_TEST((sz == ((sp->iBase + sp->iSize) - (TUint8*)p) - TOP_FOOT_SIZE), ETHeapBadCellAddress,p,0);
+    __HEAP_CORRUPTED_TEST((PINUSE(p)), ETHeapBadCellAddress,p,0);
+    __HEAP_CORRUPTED_TEST((!NEXT_PINUSE(p)), ETHeapBadCellAddress,p,0);
+}
+
+/* Check properties of inuse chunks */
+void RHybridHeap::DoCheckInuseChunk(mstate m, mchunkptr p)
+{
+    DoCheckAnyChunk(m, p);
+    __HEAP_CORRUPTED_TEST((CINUSE(p)), ETHeapBadCellAddress,p,0);
+    __HEAP_CORRUPTED_TEST((NEXT_PINUSE(p)), ETHeapBadCellAddress,p,0);
+    /* If not PINUSE and not mmapped, previous chunk has OK offset */
+    __HEAP_CORRUPTED_TEST((PINUSE(p) || NEXT_CHUNK(PREV_CHUNK(p)) == p), ETHeapBadCellAddress,p,0);
+}
+
+/* Check properties of free chunks */
+void RHybridHeap::DoCheckFreeChunk(mstate m, mchunkptr p)
+{
+    size_t sz = p->iHead & ~(PINUSE_BIT|CINUSE_BIT);
+    mchunkptr next = CHUNK_PLUS_OFFSET(p, sz);
+    DoCheckAnyChunk(m, p);
+    __HEAP_CORRUPTED_TEST((!CINUSE(p)), ETHeapBadCellAddress,p,0);
+    __HEAP_CORRUPTED_TEST((!NEXT_PINUSE(p)), ETHeapBadCellAddress,p,0);
+    if (p != m->iDv && p != m->iTop)
+        {
+        if (sz >= MIN_CHUNK_SIZE)
+            {
+            __HEAP_CORRUPTED_TEST(((sz & CHUNK_ALIGN_MASK) == 0), ETHeapBadCellAddress,p,0);
+            __HEAP_CORRUPTED_TEST((IS_ALIGNED(CHUNK2MEM(p))), ETHeapBadCellAddress,p,0);
+            __HEAP_CORRUPTED_TEST((next->iPrevFoot == sz), ETHeapBadCellAddress,p,0);
+            __HEAP_CORRUPTED_TEST((PINUSE(p)), ETHeapBadCellAddress,p,0);
+            __HEAP_CORRUPTED_TEST( (next == m->iTop || CINUSE(next)), ETHeapBadCellAddress,p,0);
+            __HEAP_CORRUPTED_TEST((p->iFd->iBk == p), ETHeapBadCellAddress,p,0);
+            __HEAP_CORRUPTED_TEST((p->iBk->iFd == p), ETHeapBadCellAddress,p,0);
+            }
+        else    /* markers are always of size SIZE_T_SIZE */
+            __HEAP_CORRUPTED_TEST((sz == SIZE_T_SIZE), ETHeapBadCellAddress,p,0);
+        }
+}
+
+/* Check properties of malloced chunks at the point they are malloced */
+void RHybridHeap::DoCheckMallocedChunk(mstate m, void* mem, size_t s)
+{
+    if (mem != 0)
+        {
+        mchunkptr p = MEM2CHUNK(mem);
+        size_t sz = p->iHead & ~(PINUSE_BIT|CINUSE_BIT);
+        DoCheckInuseChunk(m, p);
+        __HEAP_CORRUPTED_TEST(((sz & CHUNK_ALIGN_MASK) == 0), ETHeapBadCellAddress,p,0);
+        __HEAP_CORRUPTED_TEST((sz >= MIN_CHUNK_SIZE), ETHeapBadCellAddress,p,0);
+        __HEAP_CORRUPTED_TEST((sz >= s), ETHeapBadCellAddress,p,0);
+        /* unless mmapped, size is less than MIN_CHUNK_SIZE more than request */
+        __HEAP_CORRUPTED_TEST((sz < (s + MIN_CHUNK_SIZE)), ETHeapBadCellAddress,p,0);
+        }
+}
+
+/* Check a tree and its subtrees.   */
+void RHybridHeap::DoCheckTree(mstate m, tchunkptr t)
+{
+    tchunkptr head = 0;
+    tchunkptr u = t;
+    bindex_t tindex = t->iIndex;
+    size_t tsize = CHUNKSIZE(t);
+    bindex_t idx;
+    DoComputeTreeIndex(tsize, idx);
+    __HEAP_CORRUPTED_TEST((tindex == idx), ETHeapBadCellAddress,u,0);
+    __HEAP_CORRUPTED_TEST((tsize >= MIN_LARGE_SIZE), ETHeapBadCellAddress,u,0);
+    __HEAP_CORRUPTED_TEST((tsize >= MINSIZE_FOR_TREE_INDEX(idx)), ETHeapBadCellAddress,u,0);
+    __HEAP_CORRUPTED_TEST(((idx == NTREEBINS-1) || (tsize < MINSIZE_FOR_TREE_INDEX((idx+1)))), ETHeapBadCellAddress,u,0);
+    
+    do
+        { /* traverse through chain of same-sized nodes */
+        DoCheckAnyChunk(m, ((mchunkptr)u));
+        __HEAP_CORRUPTED_TEST((u->iIndex == tindex), ETHeapBadCellAddress,u,0);
+        __HEAP_CORRUPTED_TEST((CHUNKSIZE(u) == tsize), ETHeapBadCellAddress,u,0);
+        __HEAP_CORRUPTED_TEST((!CINUSE(u)), ETHeapBadCellAddress,u,0);
+        __HEAP_CORRUPTED_TEST((!NEXT_PINUSE(u)), ETHeapBadCellAddress,u,0);
+        __HEAP_CORRUPTED_TEST((u->iFd->iBk == u), ETHeapBadCellAddress,u,0);
+        __HEAP_CORRUPTED_TEST((u->iBk->iFd == u), ETHeapBadCellAddress,u,0);
+        if (u->iParent == 0)
+            {
+            __HEAP_CORRUPTED_TEST((u->iChild[0] == 0), ETHeapBadCellAddress,u,0);
+            __HEAP_CORRUPTED_TEST((u->iChild[1] == 0), ETHeapBadCellAddress,u,0);
+            }
+        else
+            {
+            __HEAP_CORRUPTED_TEST((head == 0), ETHeapBadCellAddress,u,0); /* only one node on chain has iParent */
+            head = u;
+            __HEAP_CORRUPTED_TEST((u->iParent != u), ETHeapBadCellAddress,u,0);
+            __HEAP_CORRUPTED_TEST( (u->iParent->iChild[0] == u ||
+                    u->iParent->iChild[1] == u ||
+                    *((tbinptr*)(u->iParent)) == u), ETHeapBadCellAddress,u,0);
+            if (u->iChild[0] != 0)
+                {
+                __HEAP_CORRUPTED_TEST((u->iChild[0]->iParent == u), ETHeapBadCellAddress,u,0);
+                __HEAP_CORRUPTED_TEST((u->iChild[0] != u), ETHeapBadCellAddress,u,0);
+                DoCheckTree(m, u->iChild[0]);
+                }
+            if (u->iChild[1] != 0)
+                {
+                __HEAP_CORRUPTED_TEST((u->iChild[1]->iParent == u), ETHeapBadCellAddress,u,0);
+                __HEAP_CORRUPTED_TEST((u->iChild[1] != u), ETHeapBadCellAddress,u,0);
+                DoCheckTree(m, u->iChild[1]);
+                }
+            if (u->iChild[0] != 0 && u->iChild[1] != 0)
+                {
+                __HEAP_CORRUPTED_TEST((CHUNKSIZE(u->iChild[0]) < CHUNKSIZE(u->iChild[1])), ETHeapBadCellAddress,u,0);
+                }
+            }
+        u = u->iFd;
+        }
+    while (u != t);
+    __HEAP_CORRUPTED_TEST((head != 0), ETHeapBadCellAddress,u,0);
+}
+
+/*  Check all the chunks in a treebin.  */
+void RHybridHeap::DoCheckTreebin(mstate m, bindex_t i)
+{
+    tbinptr* tb = TREEBIN_AT(m, i);
+    tchunkptr t = *tb;
+    int empty = (m->iTreeMap & (1U << i)) == 0;
+    if (t == 0)
+        __HEAP_CORRUPTED_TEST((empty), ETHeapBadCellAddress,t,0);
+    if (!empty)
+        DoCheckTree(m, t);
+}
+
+/*  Check all the chunks in a smallbin. */
+void RHybridHeap::DoCheckSmallbin(mstate m, bindex_t i)
+{
+    sbinptr b = SMALLBIN_AT(m, i);
+    mchunkptr p = b->iBk;
+    unsigned int empty = (m->iSmallMap & (1U << i)) == 0;
+    if (p == b)
+        __HEAP_CORRUPTED_TEST((empty), ETHeapBadCellAddress,p,0);
+    if (!empty)
+        {
+        for (; p != b; p = p->iBk)
+            {
+            size_t size = CHUNKSIZE(p);
+            mchunkptr q;
+            /* each chunk claims to be free */
+            DoCheckFreeChunk(m, p);
+            /* chunk belongs in bin */
+            __HEAP_CORRUPTED_TEST((SMALL_INDEX(size) == i), ETHeapBadCellAddress,p,0);
+            __HEAP_CORRUPTED_TEST((p->iBk == b || CHUNKSIZE(p->iBk) == CHUNKSIZE(p)), ETHeapBadCellAddress,p,0);
+            /* chunk is followed by an inuse chunk */
+            q = NEXT_CHUNK(p);
+            if (q->iHead != FENCEPOST_HEAD)
+                DoCheckInuseChunk(m, q);
+            }
+        }
+}
+
+/* Find x in a bin. Used in other check functions. */
+TInt RHybridHeap::BinFind(mstate m, mchunkptr x)
+{
+    size_t size = CHUNKSIZE(x);
+    if (IS_SMALL(size))
+        {
+        bindex_t sidx = SMALL_INDEX(size);
+        sbinptr b = SMALLBIN_AT(m, sidx);
+        if (SMALLMAP_IS_MARKED(m, sidx))
+            {
+            mchunkptr p = b;
+            do
+                {
+                if (p == x)
+                    return 1;
+                }
+            while ((p = p->iFd) != b);
+            }
+        }
+    else
+        {
+        bindex_t tidx;
+        DoComputeTreeIndex(size, tidx);
+        if (TREEMAP_IS_MARKED(m, tidx))
+            {
+            tchunkptr t = *TREEBIN_AT(m, tidx);
+            size_t sizebits = size << LEFTSHIFT_FOR_TREE_INDEX(tidx);
+            while (t != 0 && CHUNKSIZE(t) != size)
+                {
+                t = t->iChild[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1];
+                sizebits <<= 1;
+                }
+            if (t != 0)
+                {
+                tchunkptr u = t;
+                do
+                    {
+                    if (u == (tchunkptr)x)
+                        return 1;
+                    }
+                while ((u = u->iFd) != t);
+                }
+            }
+        }
+    return 0;
+}
+
+/* Traverse each chunk and check it; return total */
+size_t RHybridHeap::TraverseAndCheck(mstate m)
+{
+    size_t sum = 0;
+    msegmentptr s = &m->iSeg;
+    sum += m->iTopSize + TOP_FOOT_SIZE;
+    mchunkptr q = ALIGN_AS_CHUNK(s->iBase);
+    mchunkptr lastq = 0;
+    __HEAP_CORRUPTED_TEST((PINUSE(q)), ETHeapBadCellAddress,q,0);
+    while (q != m->iTop && q->iHead != FENCEPOST_HEAD)
+        {
+        sum += CHUNKSIZE(q);
+        if (CINUSE(q))
+            {
+            __HEAP_CORRUPTED_TEST((!BinFind(m, q)), ETHeapBadCellAddress,q,0);
+            DoCheckInuseChunk(m, q);
+            }
+        else
+            {
+            __HEAP_CORRUPTED_TEST((q == m->iDv || BinFind(m, q)), ETHeapBadCellAddress,q,0);
+            __HEAP_CORRUPTED_TEST((lastq == 0 || CINUSE(lastq)), ETHeapBadCellAddress,q,0); /* Not 2 consecutive free */
+            DoCheckFreeChunk(m, q);
+            }
+        lastq = q;
+        q = NEXT_CHUNK(q);
+        }
+    return sum;
+}
+
+/* Check all properties of malloc_state. */
+void RHybridHeap::DoCheckMallocState(mstate m)
+{
+    bindex_t i;
+//    size_t total;
+    /* check bins */
+    for (i = 0; i < NSMALLBINS; ++i)
+        DoCheckSmallbin(m, i);
+    for (i = 0; i < NTREEBINS; ++i)
+        DoCheckTreebin(m, i);
+    
+    if (m->iDvSize != 0)
+        { /* check iDv chunk */
+        DoCheckAnyChunk(m, m->iDv);
+        __HEAP_CORRUPTED_TEST((m->iDvSize == CHUNKSIZE(m->iDv)), ETHeapBadCellAddress,m->iDv,0);
+        __HEAP_CORRUPTED_TEST((m->iDvSize >= MIN_CHUNK_SIZE), ETHeapBadCellAddress,m->iDv,0);
+        __HEAP_CORRUPTED_TEST((BinFind(m, m->iDv) == 0), ETHeapBadCellAddress,m->iDv,0);
+        }
+    
+    if (m->iTop != 0)
+        {    /* check iTop chunk */
+        DoCheckTopChunk(m, m->iTop);
+        __HEAP_CORRUPTED_TEST((m->iTopSize == CHUNKSIZE(m->iTop)), ETHeapBadCellAddress,m->iTop,0);
+        __HEAP_CORRUPTED_TEST((m->iTopSize > 0), ETHeapBadCellAddress,m->iTop,0);
+        __HEAP_CORRUPTED_TEST((BinFind(m, m->iTop) == 0), ETHeapBadCellAddress,m->iTop,0);
+        }
+    
+//    total =
+    TraverseAndCheck(m);
+}
+
+#ifndef __KERNEL_MODE__
+//
+//  Methods for Slab allocator detailed check
+//
+void RHybridHeap::DoCheckSlabTree(slab** aS, TBool aPartialPage)
+{
+	slab* s = *aS;
+	if (!s)
+		return;
+
+	TUint size = SlabHeaderSize(s->iHeader);
+	slab** parent = aS;
+	slab** child2 = &s->iChild2;
+
+	while ( s )
+		{
+		__HEAP_CORRUPTED_TEST((s->iParent == parent), ETHeapBadCellAddress,s,SLABSIZE);
+		__HEAP_CORRUPTED_TEST((!s->iChild1 || s < s->iChild1), ETHeapBadCellAddress,s,SLABSIZE);
+		__HEAP_CORRUPTED_TEST((!s->iChild2 || s < s->iChild2), ETHeapBadCellAddress,s,SLABSIZE);
+
+		if ( aPartialPage )
+			{
+			if ( s->iChild1 )
+				size = SlabHeaderSize(s->iChild1->iHeader);
+			}
+		else
+			{
+			__HEAP_CORRUPTED_TEST((SlabHeaderSize(s->iHeader) == size), ETHeapBadCellAddress,s,SLABSIZE);
+			}
+		parent = &s->iChild1;
+		s = s->iChild1;
+
+		}
+
+	parent = child2;
+	s = *child2;
+
+	while ( s )
+		{
+		__HEAP_CORRUPTED_TEST((s->iParent == parent), ETHeapBadCellAddress,s,SLABSIZE);
+		__HEAP_CORRUPTED_TEST((!s->iChild1 || s < s->iChild1), ETHeapBadCellAddress,s,SLABSIZE);
+		__HEAP_CORRUPTED_TEST((!s->iChild2 || s < s->iChild2), ETHeapBadCellAddress,s,SLABSIZE);
+
+		if ( aPartialPage )
+			{
+			if ( s->iChild2 )
+				size = SlabHeaderSize(s->iChild2->iHeader);
+			}
+		else
+			{
+			__HEAP_CORRUPTED_TEST((SlabHeaderSize(s->iHeader) == size), ETHeapBadCellAddress,s,SLABSIZE);
+			}
+		parent = &s->iChild2;
+		s = s->iChild2;
+
+		}
+
+}
+
+void RHybridHeap::DoCheckSlabTrees()
+{
+	for (TInt i = 0; i < (MAXSLABSIZE>>2); ++i)
+		DoCheckSlabTree(&iSlabAlloc[i].iPartial, EFalse);
+	DoCheckSlabTree(&iPartialPage, ETrue);
+}
+
+void RHybridHeap::DoCheckSlab(slab* aSlab, TAllocatorType aSlabType, TAny* aBfr)
+{
+   if ( (aSlabType == ESlabSpare) || (aSlabType == EEmptySlab) )
+	  return;
+   
+   unsigned h = aSlab->iHeader;
+   __HEAP_CORRUPTED_TEST((ZEROBITS(h)), ETHeapBadCellAddress,aBfr,aSlab);   
+   unsigned used = SlabHeaderUsedm4(h)+4;
+   unsigned size = SlabHeaderSize(h);
+   __HEAP_CORRUPTED_TEST( (used < SLABSIZE),ETHeapBadCellAddress, aBfr, aSlab);
+   __HEAP_CORRUPTED_TEST( ((size > 3 ) && (size < MAXSLABSIZE)), ETHeapBadCellAddress,aBfr,aSlab);         
+	unsigned count = 0;
+
+	switch ( aSlabType )
+		{
+		case EFullSlab:
+			count = (KMaxSlabPayload / size );			
+  			__HEAP_CORRUPTED_TEST((used == count*size), ETHeapBadCellAddress,aBfr,aSlab);	
+			__HEAP_CORRUPTED_TEST((HeaderFloating(h)), ETHeapBadCellAddress,aBfr,aSlab);
+			break;
+
+		case EPartialFullSlab:
+			__HEAP_CORRUPTED_TEST(((used % size)==0),ETHeapBadCellAddress,aBfr,aSlab);
+			__HEAP_CORRUPTED_TEST(((SlabHeaderFree(h) == 0) || (((SlabHeaderFree(h)<<2)-sizeof(slabhdr)) % SlabHeaderSize(h) == 0)),
+								  ETHeapBadCellAddress,aBfr,aSlab);
+			break;
+
+		default:
+            break;
+			
+		}
+}
+
+//
+//  Check that committed size in heap equals number of pages in bitmap
+//  plus size of Doug Lea region
+//
+void RHybridHeap::DoCheckCommittedSize(TInt aNPages, mstate aM)
+{
+	TInt total_committed = (aNPages * iPageSize) + aM->iSeg.iSize + (iBase - (TUint8*)this);
+	__HEAP_CORRUPTED_TEST((total_committed == iChunkSize), ETHeapBadCellAddress,total_committed,iChunkSize);	
+}
+
+#endif  // __KERNEL_MODE__  
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/common/heap.cpp
--- a/kernel/eka/common/heap.cpp	Mon May 24 18:45:46 2010 +0100
+++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
@@ -1,1713 +0,0 @@
-// Copyright (c) 1994-2009 Nokia Corporation and/or its subsidiary(-ies).
-// All rights reserved.
-// This component and the accompanying materials are made available
-// under the terms of the License "Eclipse Public License v1.0"
-// which accompanies this distribution, and is available
-// at the URL "http://www.eclipse.org/legal/epl-v10.html".
-//
-// Initial Contributors:
-// Nokia Corporation - initial contribution.
-//
-// Contributors:
-//
-// Description:
-// e32\common\heap.cpp
-// 
-//
-
-#include "common.h"
-#ifdef __KERNEL_MODE__
-#include <kernel/kern_priv.h>
-#endif
-
-#ifdef _DEBUG
-#define __SIMULATE_ALLOC_FAIL(s)	if (CheckForSimulatedAllocFail()) {s}
-#define	__CHECK_CELL(p)				CheckCell(p)
-#define	__ZAP_CELL(p)				memset( ((TUint8*)p) + RHeap::EAllocCellSize, 0xde, p->len - RHeap::EAllocCellSize)
-#define __DEBUG_SAVE(p)				TInt dbgNestLevel = ((SDebugCell*)p)->nestingLevel
-#define __DEBUG_RESTORE(p)			((SDebugCell*)(((TUint8*)p)-EAllocCellSize))->nestingLevel = dbgNestLevel
-#else
-#define __SIMULATE_ALLOC_FAIL(s)
-#define	__CHECK_CELL(p)
-#define	__ZAP_CELL(p)
-#define __DEBUG_SAVE(p)
-#define __DEBUG_RESTORE(p)
-#endif
-
-#define __NEXT_CELL(p)				((SCell*)(((TUint8*)p)+p->len))
-
-#define __POWER_OF_2(x)				((TUint32)((x)^((x)-1))>=(TUint32)(x))
-
-#define __MEMORY_MONITOR_CHECK_CELL(p) \
-					{ \
-					TLinAddr m = TLinAddr(iAlign-1); \
-					SCell* c = (SCell*)(((TUint8*)p)-EAllocCellSize); \
-					if((c->len & m) || (c->len<iMinCell) || ((TUint8*)c<iBase) || ((TUint8*)__NEXT_CELL(c)>iTop)) \
-						BTraceContext12(BTrace::EHeap, BTrace::EHeapCorruption, (TUint32)this, (TUint32)p, (TUint32)c->len-EAllocCellSize); \
-					}
-					
-/**
-@SYMPatchable
-@publishedPartner
-@released
-
-Defines the minimum cell size of  a heap.
-
-The constant can be changed at ROM build time using patchdata OBY keyword.
-*/
-#ifdef __X86GCC__	// For X86GCC we dont use the proper data import attribute
-#undef IMPORT_D		// since the constant is not really imported. GCC doesn't 
-#define IMPORT_D	// allow imports from self.
-#endif
-IMPORT_D extern const TInt KHeapMinCellSize;
-
-/**
-@SYMPatchable
-@publishedPartner
-@released
-
-This constant defines the ratio that determines the amount of hysteresis between heap growing and heap
-shrinking.
-It is a 32-bit fixed point number where the radix point is defined to be
-between bits 7 and 8 (where the LSB is bit 0) i.e. using standard notation, a Q8 or a fx24.8
-fixed point number.  For example, for a ratio of 2.0, set KHeapShrinkHysRatio=0x200.
-
-The heap shrinking hysteresis value is calculated to be:
-@code
-KHeapShrinkHysRatio*(iGrowBy>>8)
-@endcode
-where iGrowBy is a page aligned value set by the argument, aGrowBy, to the RHeap constructor.
-The default hysteresis value is iGrowBy bytes i.e. KHeapShrinkHysRatio=2.0.
-
-Memory usage may be improved by reducing the heap shrinking hysteresis
-by setting 1.0 < KHeapShrinkHysRatio < 2.0.  Heap shrinking hysteresis is disabled/removed
-when KHeapShrinkHysRatio <= 1.0.
-
-The constant can be changed at ROM build time using patchdata OBY keyword.
-*/
-IMPORT_D extern const TInt KHeapShrinkHysRatio;
-
-#pragma warning( disable : 4705 )	// statement has no effect
-UEXPORT_C RHeap::RHeap(TInt aMaxLength, TInt aAlign, TBool aSingleThread)
-/**
-@internalComponent
-*/
-//
-// Constructor for fixed size heap
-//
-	:	iMinLength(aMaxLength), iMaxLength(aMaxLength), iOffset(0), iGrowBy(0), iChunkHandle(0),
-		iNestingLevel(0), iAllocCount(0), iFailType(ENone), iTestData(NULL)
-	{
-	iAlign = aAlign ? aAlign : ECellAlignment;
-	iPageSize = 0;
-	iFlags = aSingleThread ? (ESingleThreaded|EFixedSize) : EFixedSize;
-	Initialise();
-	}
-#pragma warning( default : 4705 )
-
-
-
-
-UEXPORT_C RHeap::RHeap(TInt aChunkHandle, TInt aOffset, TInt aMinLength, TInt aMaxLength, TInt aGrowBy, TInt aAlign, TBool aSingleThread)
-/**
-@internalComponent
-*/
-//
-// Constructor for chunk heaps.
-//
-	:	iOffset(aOffset), iChunkHandle(aChunkHandle),
-		iNestingLevel(0), iAllocCount(0), iFailType(ENone), iTestData(NULL)
-	{
-	TInt sz = iBase - ((TUint8*)this - iOffset);
-	GET_PAGE_SIZE(iPageSize);
-	__ASSERT_ALWAYS(iOffset>=0, HEAP_PANIC(ETHeapNewBadOffset));
-	iMinLength = Max(aMinLength, sz + EAllocCellSize);
-	iMinLength = _ALIGN_UP(iMinLength, iPageSize);
-	iMaxLength = Max(aMaxLength, iMinLength);
-	iMaxLength = _ALIGN_UP(iMaxLength, iPageSize);
-	iGrowBy = _ALIGN_UP(aGrowBy, iPageSize);
-	iFlags = aSingleThread ? ESingleThreaded : 0;
-	iAlign = aAlign ? aAlign : ECellAlignment;
-	Initialise();
-	}
-
-
-
-
-UEXPORT_C TAny* RHeap::operator new(TUint aSize, TAny* aBase) __NO_THROW
-/**
-@internalComponent
-*/
-	{
-	__ASSERT_ALWAYS(aSize>=sizeof(RHeap), HEAP_PANIC(ETHeapNewBadSize));
-	RHeap* h = (RHeap*)aBase;
-	h->iAlign = 0x80000000;	// garbage value
-	h->iBase = ((TUint8*)aBase) + aSize;
-	return aBase;
-	}
-
-void RHeap::Initialise()
-//
-// Initialise the heap.
-//
-	{
-
-	__ASSERT_ALWAYS((TUint32)iAlign>=sizeof(TAny*) && __POWER_OF_2(iAlign), HEAP_PANIC(ETHeapNewBadAlignment));
-	iCellCount = 0;
-	iTotalAllocSize = 0;
-	iBase = (TUint8*)Align(iBase + EAllocCellSize);
-	iBase -= EAllocCellSize;
-	TInt b = iBase - ((TUint8*)this - iOffset);
-	TInt len = _ALIGN_DOWN(iMinLength - b, iAlign);
-	iTop = iBase + len;
-	iMinLength = iTop - ((TUint8*)this - iOffset);
-	iMinCell = Align(KHeapMinCellSize + Max((TInt)EAllocCellSize, (TInt)EFreeCellSize));
-#ifdef _DEBUG
-	memset(iBase, 0xa5, len);
-#endif
-	SCell* pM=(SCell*)iBase; // First free cell
-	iFree.next=pM; // Free list points to first free cell
-	iFree.len=0; // Stop free from joining this with a free block
-	pM->next=NULL; // Terminate the free list
-	pM->len=len; // Set the size of the free cell
-	}
-
-#ifdef _DEBUG
-void RHeap::CheckCell(const SCell* aCell) const
-	{
-	TLinAddr m = TLinAddr(iAlign - 1);
-
-	__ASSERT_DEBUG(!(aCell->len & m), HEAP_PANIC(ETHeapBadCellAddress));
-	__ASSERT_DEBUG(aCell->len >= iMinCell, HEAP_PANIC(ETHeapBadCellAddress));
-	__ASSERT_DEBUG((TUint8*)aCell>=iBase, HEAP_PANIC(ETHeapBadCellAddress));
-	__ASSERT_DEBUG((TUint8*)__NEXT_CELL(aCell)<=iTop, HEAP_PANIC(ETHeapBadCellAddress));
-	}
-#endif
-
-UEXPORT_C RHeap::SCell* RHeap::GetAddress(const TAny* aCell) const
-//
-// As much as possible, check a cell address and backspace it
-// to point at the cell header.
-//
-	{
-
-	TLinAddr m = TLinAddr(iAlign - 1);
-	__ASSERT_ALWAYS(!(TLinAddr(aCell)&m), HEAP_PANIC(ETHeapBadCellAddress));
-
-	SCell* pC = (SCell*)(((TUint8*)aCell)-EAllocCellSize);
-	__CHECK_CELL(pC);
-
-	return pC;
-	}
-
-
-
-
-UEXPORT_C TInt RHeap::AllocLen(const TAny* aCell) const
-/**
-Gets the length of the available space in the specified allocated cell.
-
-@param aCell A pointer to the allocated cell.
-
-@return The length of the available space in the allocated cell.
-
-@panic USER 42 if aCell does not point to  a valid cell.
-*/
-	{
-
-	SCell* pC = GetAddress(aCell);
-	return pC->len - EAllocCellSize;
-	}
-
-
-
-
-
-#if !defined(__HEAP_MACHINE_CODED__) || defined(_DEBUG)
-RHeap::SCell* RHeap::DoAlloc(TInt aSize, SCell*& aLastFree)
-//
-// Allocate without growing. aSize includes cell header and alignment.
-// Lock already held.
-//
-	{
-	SCell* pP = &iFree;
-	SCell* pC = pP->next;
-	for (; pC; pP=pC, pC=pC->next) // Scan the free list
-		{
-		__CHECK_CELL(pC);
-		SCell* pE;
-		if (pC->len >= aSize)				// Block size bigger than request
-			{
-			if (pC->len - aSize < iMinCell)	// Leftover must be large enough to hold an SCell
-			   	{
-			   	aSize = pC->len;			// It isn't, so take it all
-			   	pE = pC->next;				// Set the next field
-			   	}
-			else
-			   	{
-			   	pE = (SCell*)(((TUint8*)pC)+aSize); // Take amount required
-			   	pE->len = pC->len - aSize;	// Initialize new free cell
-			   	pE->next = pC->next;
-			   	}
-			pP->next = pE;					// Update previous pointer
-			pC->len = aSize;				// Set control size word
-#if defined(_DEBUG)														
-			((SDebugCell*)pC)->nestingLevel = iNestingLevel;
-			((SDebugCell*)pC)->allocCount = ++iAllocCount;
-#endif
-			return pC;
-			}
-		}
-	aLastFree = pP;
-	return NULL;
-	}
-#endif
-
-
-
-
-UEXPORT_C TAny* RHeap::Alloc(TInt aSize)
-/**
-Allocates a cell of the specified size from the heap.
-
-If there is insufficient memory available on the heap from which to allocate
-a cell of the required size, the function returns NULL.
-
-The cell is aligned according to the alignment value specified at construction,
-or the default alignment value, if an explict value was not specified.
-
-The resulting size of the allocated cell may be rounded up to a
-value greater than aSize, but is guaranteed to be not less than aSize.
-
-@param aSize The 
-size of the cell to be allocated from the heap
-
-@return A pointer to the allocated cell. NULL if there is insufficient memory 
-        available.
-        
-@panic USER 47 if the maximum unsigned value of aSize is greater than or equal
-       to the value of KMaxTInt/2; for example, calling Alloc(-1) raises
-       this panic.
-       
-@see KMaxTInt        
-*/
-	{
-
-	__CHECK_THREAD_STATE;
-	__ASSERT_ALWAYS((TUint)aSize<(KMaxTInt/2),HEAP_PANIC(ETHeapBadAllocatedCellSize));
-	__SIMULATE_ALLOC_FAIL(return NULL;)
-	
-	TInt origSize = aSize;
-	aSize = Max(Align(aSize + EAllocCellSize), iMinCell);
-	SCell* pL = NULL;
-	Lock();
-	SCell* pC = (SCell*)DoAlloc(aSize, pL);
-	if (!pC && !(iFlags & EFixedSize))
-		{
-		// try to grow chunk heap
-		TInt r = TryToGrowHeap(aSize, pL);
-		if (r==KErrNone)
-			pC = DoAlloc(aSize, pL);
-		}
-	if (pC)
-		++iCellCount, iTotalAllocSize += (pC->len - EAllocCellSize);
-	Unlock();
-	if (pC)
-		{
-		TAny* result=((TUint8*)pC) + EAllocCellSize;
-		if (iFlags & ETraceAllocs)
-			{
-			TUint32 traceData[2];
-			traceData[0] = AllocLen(result);
-			traceData[1] = origSize;
-			BTraceContextN(BTrace::EHeap, BTrace::EHeapAlloc, (TUint32)this, (TUint32)result, traceData, sizeof(traceData));
-			}
-#ifdef __KERNEL_MODE__
-		memclr(result, pC->len - EAllocCellSize);
-#endif		
-		return result;
-		}
-	if (iFlags & ETraceAllocs)						
-			BTraceContext8(BTrace::EHeap, BTrace::EHeapAllocFail, (TUint32)this, (TUint32)origSize);
-	return NULL;
-	}
-
-
-
-
-TInt RHeap::TryToGrowHeap(TInt aSize, SCell* aLastFree)
-	{
-	TBool at_end = IsLastCell(aLastFree);
-	TInt extra = at_end ? aSize - aLastFree->len : aSize;
-	extra = (extra + iGrowBy - 1) / iGrowBy;
-	extra *= iGrowBy;
-	TInt cur_len = _ALIGN_UP(iTop - ((TUint8*)this - iOffset), iPageSize);
-	TInt new_len = cur_len + extra;
-	TInt r = KErrNoMemory;
-	if (new_len <= iMaxLength)
-		{
-		r = SetBrk(new_len);
-		if (r == KErrNone)
-			{
-			if (at_end)
-				aLastFree->len += extra;
-			else
-				{
-				SCell* pC = (SCell*)iTop;
-				pC->len = extra;
-				pC->next = NULL;
-				aLastFree->next = pC;
-				}
-			iTop += extra;
-			}
-		}
-	return r;
-	}
-
-
-
-
-#ifndef __KERNEL_MODE__
-EXPORT_C TInt RHeap::Compress()
-/**
-Compresses the heap.
-
-The function frees excess committed space from the top 
-of the heap. The size of the heap is never reduced below the minimum size 
-specified during creation of the heap.
-
-@return The space reclaimed. If no space can be reclaimed, then this value 
-        is zero.
-*/
-	{
-
-	if (iFlags & EFixedSize)
-		return 0;
-	TInt r = 0;
-	Lock();
-	SCell* pC = &iFree;
-	for (; pC->next; pC=pC->next) {}
-	if (pC!=&iFree)
-		{
-		__CHECK_CELL(pC);
-		if (IsLastCell(pC))
-			r = Reduce(pC);
-		}
-	Unlock();
-	return r;
-	}
-#endif
-
-
-
-
-#if !defined(__HEAP_MACHINE_CODED__) || defined(_DEBUG)
-void RHeap::DoFree(SCell* pC)
-	{
-	__ZAP_CELL(pC);
-
-	SCell* pP = &iFree;
-	SCell* pE = pP->next;
-	for (; pE && pE<pC; pP=pE, pE=pE->next) {}
-	if (pE)			// Is there a following free cell?
-		{
-		SCell* pN = __NEXT_CELL(pC);
-		__ASSERT_ALWAYS(pN<=pE, HEAP_PANIC(ETHeapFreeBadNextCell)); // Following cell overlaps
-		if (pN==pE) // Is it adjacent
-			{
-			pC->len += pE->len; // Yes - coalesce adjacent free cells
-			pC->next = pE->next;
-			}
-		else					// pN<pE, non-adjacent free cells
-			pC->next = pE;		// Otherwise just point to it
-		}
-	else
-		pC->next = NULL;		// No following free cell
-	SCell* pN = __NEXT_CELL(pP);	// pN=pP=&iFree if no preceding free cell
-	__ASSERT_ALWAYS(pN<=pC, HEAP_PANIC(ETHeapFreeBadPrevCell)); // Previous cell overlaps
-	if (pN==pC) // Is it adjacent
-		{
-		pP->len += pC->len;		// Yes - coalesce adjacent free cells
-		pP->next = pC->next;
-		pC = pP;				// for size reduction check
-		}
-	else						// pN<pC, non-adjacent free cells
-		pP->next = pC;			// point previous cell to the one being freed
-	pN = __NEXT_CELL(pC);		// End of amalgamated free cell
-	if ((TUint8*)pN==iTop && !(iFlags & EFixedSize) && 
-		pC->len >= KHeapShrinkHysRatio*(iGrowBy>>8))
-		Reduce(pC);
-	}
-#endif
-
-
-
-
-UEXPORT_C void RHeap::Free(TAny* aCell)
-/**
-Frees the specified cell and returns it to the heap.
-
-@param aCell A pointer to a valid cell; this pointer can also be NULL,
-             in which case the function does nothing and just returns.
-
-@panic USER 42 if aCell points to an invalid cell.
-*/
-	{
-	__CHECK_THREAD_STATE;
-	if (!aCell)
-		return;
-	Lock();
-	if (iFlags & EMonitorMemory)
-		__MEMORY_MONITOR_CHECK_CELL(aCell);
-	SCell* pC = GetAddress(aCell);
-	--iCellCount;
-	iTotalAllocSize -= (pC->len - EAllocCellSize);
-	DoFree(pC);
-	if (iFlags & ETraceAllocs)
-		BTraceContext8(BTrace::EHeap, BTrace::EHeapFree, (TUint32)this, (TUint32)aCell);
-	Unlock();
-	}
-
-
-
-
-TInt RHeap::Reduce(SCell* aCell)
-	{
-	TInt reduce=0;
-	TInt offset=((TUint8*)aCell)-((TUint8*)this - iOffset);
-	if (offset>=iMinLength)
-		reduce = aCell->len;						// length of entire free cell
-	else
-		reduce = offset + aCell->len - iMinLength;	// length of free cell past minimum heap size
-	reduce = _ALIGN_DOWN(reduce, iPageSize);		// round down to page multiple
-	if (reduce<=0)
-		return 0;									// can't reduce this heap
-	TInt new_cell_len = aCell->len - reduce;		// length of last free cell after reduction
-	if (new_cell_len == 0)
-		{
-		// the free cell can be entirely eliminated
-		SCell* pP = &iFree;
-		for (; pP->next!=aCell; pP=pP->next) {}
-		pP->next = NULL;
-		}
-	else
-		{
-		if (new_cell_len < iMinCell)
-			{
-			// max reduction would leave a cell too small
-			reduce -= iPageSize;
-			new_cell_len += iPageSize;
-			}
-		aCell->len = new_cell_len;	// reduce the cell length
-		}
-	iTop -= reduce;
-	TInt new_len = _ALIGN_UP(iTop - ((TUint8*)this - iOffset), iPageSize);
-	TInt r = SetBrk(new_len);
-	__ASSERT_ALWAYS(r==KErrNone, HEAP_PANIC(ETHeapReduceFailed));
-	return reduce;
-	}
-
-
-
-
-#ifndef __KERNEL_MODE__
-EXPORT_C void RHeap::Reset()
-/**
-Frees all allocated cells on this heap.
-*/
-	{
-
-	Lock();
-	if (!(iFlags & EFixedSize))
-		{
-		TInt r = SetBrk(iMinLength);
-		__ASSERT_ALWAYS(r==KErrNone, HEAP_PANIC(ETHeapResetFailed));
-		}
-	Initialise();
-	Unlock();
-	}
-#endif
-
-
-
-
-inline void RHeap::FindFollowingFreeCell(SCell* aCell, SCell*& aPrev, SCell*& aNext)
-//
-// Find the free cell that immediately follows aCell, if one exists
-// If found, aNext is set to point to it, else it is set to NULL.
-// aPrev is set to the free cell before aCell or the dummy free cell where there are no free cells before aCell.
-// Called with lock enabled.
-//
-	{
-	aPrev = &iFree;
-	aNext = aPrev->next;
-	for (; aNext && aNext<aCell; aPrev=aNext, aNext=aNext->next) {}	
-	
-	if (aNext) // If there is a following free cell, check its directly after aCell.
-		{
-			SCell* pNextCell = __NEXT_CELL(aCell);			// end of this cell
-			__ASSERT_ALWAYS(pNextCell<=aNext, (Unlock(), HEAP_PANIC(ETHeapReAllocBadNextCell)));	// Following free cell overlaps
-			if (pNextCell!=aNext) 
-				aNext=NULL;		
-		}
-	}
-
-
-
-
-TInt RHeap::TryToGrowCell(SCell* aCell,SCell* aPrev, SCell* aNext, TInt aSize)
-//
-// Try to grow the heap cell 'aCell' in place, to size 'aSize'.
-// Requires the free cell immediately after aCell (aNext), and the free cell prior to
-// that (aPrev), to be provided.  (As found by FindFollowingFreeCell)
-//
-
-	{
-	TInt extra = aSize - aCell->len;
-	if (aNext && (aNext->len>=extra)) // Is there a following free cell big enough?
-		{
-		if (aNext->len - extra >= iMinCell)	// take part of free cell ?
-			{
-			SCell* pX = (SCell*)((TUint8*)aNext + extra);	// remainder of free cell
-			pX->next = aNext->next;			// remainder->next = original free cell->next
-			pX->len = aNext->len - extra;		// remainder length = original free cell length - extra
-			aPrev->next = pX;					// put remainder into free chain
-			}
-		else
-			{
-			extra = aNext->len;					// Take whole free cell
-			aPrev->next = aNext->next;			// remove from free chain
-			}
-#ifdef __KERNEL_MODE__
-		memclr(((TUint8*)aCell) + aCell->len, extra);
-#endif		
-		aCell->len += extra;					// update reallocated cell length
-		iTotalAllocSize += extra;
-		return KErrNone;
-		}
-	return KErrGeneral;  // No space to grow cell
-	}
-
-
-
-
-// UEXPORT_C TAny* RHeap::ReAlloc(TAny* aCell, TInt aSize, TInt aMode)
-/**
-Increases or decreases the size of an existing cell in the heap.
-
-If the cell is being decreased in size, then it is guaranteed not to move,
-and the function returns the pointer originally passed in aCell. Note that the
-length of the cell will be the same if the difference between the old size
-and the new size is smaller than the minimum cell size.
-
-If the cell is being increased in size, i.e. aSize is bigger than its
-current size, then the function tries to grow the cell in place.
-If successful, then the function returns the pointer originally
-passed in aCell. If unsuccessful, then:
-
-1. if the cell cannot be moved, i.e. aMode has the ENeverMove bit set, then
-   the function returns NULL.
-2. if the cell can be moved, i.e. aMode does not have the ENeverMove bit set,
-   then the function tries to allocate a new replacement cell, and, if
-   successful, returns a pointer to the new cell; if unsuccessful, it
-   returns NULL.
-
-Note that in debug mode, the function returns NULL if the cell cannot be grown
-in place, regardless of whether the ENeverMove bit is set.
-
-If the reallocated cell is at a different location from the original cell, then
-the content of the original cell is copied to the reallocated cell.
-
-If the supplied pointer, aCell is NULL, then the function attempts to allocate
-a new cell, but only if the cell can be moved, i.e. aMode does not have
-the ENeverMove bit set.
-
-Note the following general points:
-
-1. If reallocation fails, the content of the original cell is preserved.
-
-2. The resulting size of the re-allocated cell may be rounded up to a value
-   greater than aSize, but is guaranteed to be not less than aSize.
- 
-@param aCell A pointer to the cell to be reallocated. This may be NULL.
-
-@param aSize The new size of the cell. This may be bigger or smaller than the
-             size of the original cell.
-             
-@param aMode Flags controlling the reallocation. The only bit which has any
-             effect on this function is that defined by the enumeration
-             ENeverMove of the enum RAllocator::TReAllocMode.
-             If this is set, then any successful reallocation guarantees not
-             to have changed the start address of the cell.
-             By default, this parameter is zero.
-
-@return A pointer to the reallocated cell. This may be the same as the original
-        pointer supplied through aCell. NULL if there is insufficient memory to
-        reallocate the cell, or to grow it in place.
-
-@panic USER 42, if aCell is not NULL, and does not point to a valid cell.
-@panic USER 47, if the maximum unsigned value of aSize is greater
-                than or equal to KMaxTInt/2. For example,
-                calling ReAlloc(someptr,-1) raises this panic.
-
-@see RAllocator::TReAllocMode
-*/
-UEXPORT_C TAny* RHeap::ReAlloc(TAny* aCell, TInt aSize, TInt aMode)
-	{
-	if (aCell && iFlags&EMonitorMemory)
-		__MEMORY_MONITOR_CHECK_CELL(aCell);
-	TAny* retval = ReAllocImpl(aCell, aSize, aMode);
-	if (iFlags & ETraceAllocs)
-		{
-		if (retval)
-			{
-			TUint32 traceData[3];
-			traceData[0] = AllocLen(retval);
-			traceData[1] = aSize;
-			traceData[2] = (TUint32)aCell;
-			BTraceContextN(BTrace::EHeap, BTrace::EHeapReAlloc,(TUint32)this, (TUint32)retval,traceData, sizeof(traceData));
-			}
-		else
-			BTraceContext12(BTrace::EHeap, BTrace::EHeapReAllocFail, (TUint32)this, (TUint32)aCell, (TUint32)aSize);
-		}
-	return retval;
-	}
-inline TAny* RHeap::ReAllocImpl(TAny* aCell, TInt aSize, TInt aMode)
-	{
-	__CHECK_THREAD_STATE;
-	if (!aCell)
-		return (aMode & ENeverMove) ? NULL : Alloc(aSize);
-	__ASSERT_ALWAYS((TUint)aSize<(KMaxTInt/2),HEAP_PANIC(ETHeapBadAllocatedCellSize));
-	Lock();
-	SCell* pC = GetAddress(aCell);
-	TInt old_len = pC->len;
-	__DEBUG_SAVE(pC);
-	aSize = Max(Align(aSize + EAllocCellSize), iMinCell);
-	if (aSize > old_len)	// Trying to grow cell
-		{
-		__SIMULATE_ALLOC_FAIL({	Unlock(); return NULL;})			
-		
-		// Try to grow cell in place, without reallocation
-		SCell* pPrev;
-		SCell* pNext;
-		FindFollowingFreeCell(pC,pPrev, pNext);
-		TInt r = TryToGrowCell(pC, pPrev, pNext, aSize);
-		
-		if (r==KErrNone) 
-			{
-			Unlock();
-			return aCell;
-			}
-
-		if (!(aMode & ENeverMove))
-		// If moving allowed, try re-alloc. 
-		// If we need to extend heap,and cell is at the end, try and grow in place
-			{
-			SCell* pLastFree;
-			SCell* pNewCell = (SCell*)DoAlloc(aSize, pLastFree);
-			if (!pNewCell && !(iFlags & EFixedSize))
-			// if we need to extend the heap to alloc
-				{
-				if (IsLastCell(pC) || (pNext && IsLastCell(pNext)))
-				// if last used Cell, try and extend heap and then cell 
-					{
-					TInt r = TryToGrowHeap(aSize - old_len, pLastFree);
-					if (r==KErrNone)
-						{
-						r = TryToGrowCell(pC, pPrev, pPrev->next, aSize);
-						Unlock();
-						__ASSERT_DEBUG(r == KErrNone, HEAP_PANIC(ETHeapCellDidntGrow));						
-						return aCell;
-						}
-					}
-				else
-				// try to grow chunk heap and Alloc on it
-					{
-					TInt r = TryToGrowHeap(aSize, pLastFree);
-					if (r==KErrNone)
-						pNewCell = DoAlloc(aSize, pLastFree);
-					}
-				}
-
-			if (pNewCell)
-			// if we created a new cell, adjust tellies, copy the contents and delete old cell.
-				{
-				iCellCount++;
-				iTotalAllocSize += (pNewCell->len - EAllocCellSize);
-
-				Unlock();
-				TUint8* raw = ((TUint8*) pNewCell);
-				
-				memcpy(raw + EAllocCellSize, aCell, old_len - EAllocCellSize);
-#ifdef __KERNEL_MODE__
-				memclr(raw + old_len, pNewCell->len - old_len);
-#endif		
-				Free(aCell);
-				__DEBUG_RESTORE(raw + EAllocCellSize);
-				return raw + EAllocCellSize;
-				}
-			}
-		else 
-		// No moving, but still posible to extend the heap (if heap extendable)
-			{
-			if (!(iFlags & EFixedSize) && (IsLastCell(pC) || (pNext && IsLastCell(pNext))))
-				{
-				SCell* pLastFree = pNext ? pNext : pPrev;
-				TInt r = TryToGrowHeap(aSize - old_len, pLastFree);
-				if (r==KErrNone)
-					{
-					r = TryToGrowCell(pC, pPrev, pPrev->next, aSize);
-					Unlock();
-					__ASSERT_DEBUG(r==KErrNone, HEAP_PANIC(ETHeapCellDidntGrow));					
-					return aCell;
-					}
-				}
-			}			
-		Unlock();
-		return NULL;
-		}
-	if (old_len - aSize >= iMinCell)
-		{
-		// cell shrinking, remainder big enough to form a new free cell
-		SCell* pX = (SCell*)((TUint8*)pC + aSize);	// pointer to new free cell
-		pC->len = aSize;			// update cell size
-		pX->len = old_len - aSize;	// size of remainder
-		iTotalAllocSize -= pX->len;
-		DoFree(pX);					// link new free cell into chain, shrink heap if necessary
-		}
-	Unlock();
-	return aCell;
-	}
-
-
-
-
-#ifndef __KERNEL_MODE__
-
-EXPORT_C TInt RHeap::Available(TInt& aBiggestBlock) const
-/**
-Gets the total free space currently available on the heap and the space 
-available in the largest free block.
-
-The space available represents the total space which can be allocated.
-
-Note that compressing the heap may reduce the total free space available and 
-the space available in the largest free block.
-
-@param aBiggestBlock On return, contains the space available 
-                     in the largest free block on the heap.
-                     
-@return The total free space currently available on the heap.
-*/
-	{
-
-	TInt total = 0;
-	TInt max = 0;
-	Lock();
-	SCell* pC = iFree.next;
-	for (; pC; pC=pC->next)
-		{
-		TInt l = pC->len - EAllocCellSize;
-		if (l > max)
-			max = l;
-		total += l;
-		}
-	Unlock();
-	aBiggestBlock = max;
-	return total;
-	}
-
-
-
-
-EXPORT_C TInt RHeap::AllocSize(TInt& aTotalAllocSize) const
-/**
-Gets the number of cells allocated on this heap, and the total space 
-allocated to them.
-
-@param aTotalAllocSize On return, contains the total space allocated
-                       to the cells.
-
-@return The number of cells allocated on this heap.
-*/
-	{
-	Lock();
-	TInt c = iCellCount;
-	aTotalAllocSize = iTotalAllocSize;
-	Unlock();
-	return c;
-	}
-
-
-
-
-EXPORT_C RHeap* UserHeap::FixedHeap(TAny* aBase, TInt aMaxLength, TInt aAlign, TBool aSingleThread)
-/**
-Creates a fixed length heap at a specified location.
-
-On successful return from this function, aMaxLength bytes are committed by the chunk.
-The heap cannot be extended.
-
-@param aBase         A pointer to the location where the heap is to be constructed.
-@param aMaxLength    The length of the heap. If the supplied value is less
-                     than KMinHeapSize, it is discarded and the value KMinHeapSize
-                     is used instead.
-@param aAlign        The alignment of heap cells.
-@param aSingleThread Indicates whether single threaded or not.
-
-@return A pointer to the new heap, or NULL if the heap could not be created.
-
-@panic USER 56 if aMaxLength is negative.
-@panic USER 172 if aAlign is not a power of 2 or is less than the size of a TAny*.
-*/
-//
-// Force construction of the fixed memory.
-//
-	{
-
-	__ASSERT_ALWAYS(aMaxLength>=0, ::Panic(ETHeapMaxLengthNegative));
-	if (aMaxLength<KMinHeapSize)
-		aMaxLength=KMinHeapSize;
-	RHeap* h = new(aBase) RHeap(aMaxLength, aAlign, aSingleThread);
-	if (!aSingleThread)
-		{
-		TInt r = h->iLock.CreateLocal();
-		if (r!=KErrNone)
-			return NULL;
-		h->iHandles = (TInt*)&h->iLock;
-		h->iHandleCount = 1;
-		}
-	return h;
-	}
-
-
-/**
-Constructor where minimum and maximum length of the heap can be defined.
-It defaults the chunk heap to be created to have use a new local chunk, 
-to have a grow by value of KMinHeapGrowBy, to be unaligned, not to be 
-single threaded and not to have any mode flags set.
-
-@param aMinLength    The minimum length of the heap to be created.
-@param aMaxLength    The maximum length to which the heap to be created can grow.
-                     If the supplied value is less than KMinHeapSize, then it
-                     is discarded and the value KMinHeapSize used instead.
-*/
-EXPORT_C TChunkHeapCreateInfo::TChunkHeapCreateInfo(TInt aMinLength, TInt aMaxLength) :
-	iVersionNumber(EVersion0), iMinLength(aMinLength), iMaxLength(aMaxLength),
-	iAlign(0), iGrowBy(1), iSingleThread(EFalse), 
-	iOffset(0), iPaging(EUnspecified), iMode(0), iName(NULL)
-	{
-	}
-
-
-/**
-Sets the chunk heap to create a new chunk with the specified name.
-
-This overriddes any previous call to TChunkHeapCreateInfo::SetNewChunkHeap() or
-TChunkHeapCreateInfo::SetExistingChunkHeap() for this TChunkHeapCreateInfo object.
-
-@param aName	The name to be given to the chunk heap to be created
-				If NULL, the function constructs a local chunk to host the heap.
-				If not NULL, a pointer to a descriptor containing the name to be 
-				assigned to the global chunk hosting the heap.
-*/
-EXPORT_C void TChunkHeapCreateInfo::SetCreateChunk(const TDesC* aName)
-	{
-	iName = (TDesC*)aName;
-	iChunk.SetHandle(KNullHandle);
-	}
-
-
-/**
-Sets the chunk heap to be created to use the chunk specified.
-
-This overriddes any previous call to TChunkHeapCreateInfo::SetNewChunkHeap() or
-TChunkHeapCreateInfo::SetExistingChunkHeap() for this TChunkHeapCreateInfo object.
-
-@param aChunk	A handle to the chunk to use for the heap.
-*/
-EXPORT_C void TChunkHeapCreateInfo::SetUseChunk(const RChunk aChunk)
-	{
-	iName = NULL;
-	iChunk = aChunk;
-	}
-
-
-/**
-Creates a chunk heap of the type specified by the parameter aCreateInfo.
-
-@param aCreateInfo	A reference to a TChunkHeapCreateInfo object specifying the
-					type of chunk heap to create.
-
-@return A pointer to the new heap or NULL if the heap could not be created.
-
-@panic USER 41 if the heap's specified minimum length is greater than the specified maximum length.
-@panic USER 55 if the heap's specified minimum length is negative.
-@panic USER 172 if the heap's specified alignment is not a power of 2 or is less than the size of a TAny*.
-*/
-EXPORT_C RHeap* UserHeap::ChunkHeap(const TChunkHeapCreateInfo& aCreateInfo)
-	{
-	// aCreateInfo must have been configured to use a new chunk or an exiting chunk.
-	__ASSERT_ALWAYS(!(aCreateInfo.iMode & (TUint32)~EChunkHeapMask), ::Panic(EHeapCreateInvalidMode));
-	RHeap* h = NULL;
-
-	if (aCreateInfo.iChunk.Handle() == KNullHandle)
-		{// A new chunk is to be created for this heap.
-		__ASSERT_ALWAYS(aCreateInfo.iMinLength >= 0, ::Panic(ETHeapMinLengthNegative));
-		__ASSERT_ALWAYS(aCreateInfo.iMaxLength >= aCreateInfo.iMinLength, ::Panic(ETHeapCreateMaxLessThanMin));
-
-		TInt maxLength = aCreateInfo.iMaxLength;
-		if (maxLength < KMinHeapSize)
-			maxLength = KMinHeapSize;
-
-		TChunkCreateInfo chunkInfo;
-		chunkInfo.SetNormal(0, maxLength);
-		chunkInfo.SetOwner((aCreateInfo.iSingleThread)? EOwnerThread : EOwnerProcess);
-		if (aCreateInfo.iName)
-			chunkInfo.SetGlobal(*aCreateInfo.iName);
-		// Set the paging attributes of the chunk.
-		if (aCreateInfo.iPaging == TChunkHeapCreateInfo::EPaged)
-			chunkInfo.SetPaging(TChunkCreateInfo::EPaged);
-		if (aCreateInfo.iPaging == TChunkHeapCreateInfo::EUnpaged)
-			chunkInfo.SetPaging(TChunkCreateInfo::EUnpaged);
-		// Create the chunk.
-		RChunk chunk;
-		if (chunk.Create(chunkInfo) != KErrNone)
-			return NULL;
-		// Create the heap using the new chunk.
-		TUint mode = aCreateInfo.iMode | EChunkHeapDuplicate;	// Must duplicate the handle.
-		h = OffsetChunkHeap(chunk, aCreateInfo.iMinLength, aCreateInfo.iOffset,
-							aCreateInfo.iGrowBy, maxLength, aCreateInfo.iAlign,
-							aCreateInfo.iSingleThread, mode);
-		chunk.Close();
-		}
-	else
-		{
-		h = OffsetChunkHeap(aCreateInfo.iChunk, aCreateInfo.iMinLength, aCreateInfo.iOffset,
-							aCreateInfo.iGrowBy, aCreateInfo.iMaxLength, aCreateInfo.iAlign,
-							aCreateInfo.iSingleThread, aCreateInfo.iMode);
-		}
-	return h;
-	}
-
-
-EXPORT_C RHeap* UserHeap::ChunkHeap(const TDesC* aName, TInt aMinLength, TInt aMaxLength, TInt aGrowBy, TInt aAlign, TBool aSingleThread)
-/**
-Creates a heap in a local or global chunk.
-
-The chunk hosting the heap can be local or global.
-
-A local chunk is one which is private to the process creating it and is not
-intended for access by other user processes.
-A global chunk is one which is visible to all processes.
-
-The hosting chunk is local, if the pointer aName is NULL, otherwise
-the hosting chunk is global and the descriptor *aName is assumed to contain
-the name to be assigned to it.
-
-Ownership of the host chunk is vested in the current process.
-
-A minimum and a maximum size for the heap can be specified. On successful
-return from this function, the size of the heap is at least aMinLength.
-If subsequent requests for allocation of memory from the heap cannot be
-satisfied by compressing the heap, the size of the heap is extended in
-increments of aGrowBy until the request can be satisfied. Attempts to extend
-the heap causes the size of the host chunk to be adjusted.
-
-Note that the size of the heap cannot be adjusted by more than aMaxLength.
-
-@param aName         If NULL, the function constructs a local chunk to host
-                     the heap.
-                     If not NULL, a pointer to a descriptor containing the name
-                     to be assigned to the global chunk hosting the heap.
-@param aMinLength    The minimum length of the heap.
-@param aMaxLength    The maximum length to which the heap can grow.
-                     If the supplied value is less than KMinHeapSize, then it
-                     is discarded and the value KMinHeapSize used instead.
-@param aGrowBy       The increments to the size of the host chunk. If a value is
-                     not explicitly specified, the value KMinHeapGrowBy is taken
-                     by default
-@param aAlign        The alignment of heap cells.
-@param aSingleThread Indicates whether single threaded or not.
-
-@return A pointer to the new heap or NULL if the heap could not be created.
-
-@panic USER 41 if aMinLength is greater than the supplied value of aMaxLength.
-@panic USER 55 if aMinLength is negative.
-@panic USER 172 if aAlign is not a power of 2 or is less than the size of a TAny*.
-*/
-//
-// Allocate a Chunk of the requested size and force construction.
-//
-	{
-	TChunkHeapCreateInfo createInfo(aMinLength, aMaxLength);
-	createInfo.SetCreateChunk(aName);
-	createInfo.SetGrowBy(aGrowBy);
-	createInfo.SetAlignment(aAlign);
-	createInfo.SetSingleThread(aSingleThread);
-	return ChunkHeap(createInfo);
-	}
-
-
-
-
-EXPORT_C RHeap* UserHeap::ChunkHeap(RChunk aChunk, TInt aMinLength, TInt aGrowBy, TInt aMaxLength, TInt aAlign, TBool aSingleThread, TUint32 aMode)
-/**
-Creates a heap in an existing chunk.
-
-This function is intended to be used to create a heap in a user writable code
-chunk as created by a call to RChunk::CreateLocalCode().
-This type of heap can be used to hold code fragments from a JIT compiler.
-
-The maximum length to which the heap can grow is the same as
-the maximum size of the chunk.
-
-@param aChunk        The chunk that will host the heap.
-@param aMinLength    The minimum length of the heap.
-@param aGrowBy       The increments to the size of the host chunk. 
-@param aMaxLength    The maximum length to which the heap can grow.
-@param aAlign        The alignment of heap cells.
-@param aSingleThread Indicates whether single threaded or not.
-@param aMode         Flags controlling the heap creation.  This should be set 
-					 from one or more of the values in TChunkHeapCreateMode.
-                     
-@return A pointer to the new heap or NULL if the heap could not be created.
-
-@panic USER 172 if aAlign is not a power of 2 or is less than the size of a TAny*.
-*/
-//
-// Construct a heap in an already existing chunk
-//
-	{
-	
-	return OffsetChunkHeap(aChunk, aMinLength, 0, aGrowBy, aMaxLength, aAlign, aSingleThread, aMode);
-	}
-
-
-
-
-EXPORT_C RHeap* UserHeap::OffsetChunkHeap(RChunk aChunk, TInt aMinLength, TInt aOffset, TInt aGrowBy, TInt aMaxLength, TInt aAlign, TBool aSingleThread, TUint32 aMode)
-/**
-Creates a heap in an existing chunk, offset from the beginning of the chunk.
-
-This function is intended to be used to create a heap where a fixed amount of
-additional data must be stored at a known location. The additional data can be
-placed at the base address of the chunk, allowing it to be located without
-depending on the internals of the heap structure.
-
-The maximum length to which the heap can grow is the maximum size of the chunk,
-minus the offset.
-
-@param aChunk        The chunk that will host the heap.
-@param aMinLength    The minimum length of the heap.
-@param aOffset       The offset from the start of the chunk, to the start of the heap.
-@param aGrowBy       The increments to the size of the host chunk. 
-@param aMaxLength    The maximum length to which the heap can grow.
-@param aAlign        The alignment of heap cells.
-@param aSingleThread Indicates whether single threaded or not.
-@param aMode         Flags controlling the heap creation.  This should be set 
-					 from one or more of the values in TChunkHeapCreateMode.
-                     
-@return A pointer to the new heap or NULL if the heap could not be created.
-
-@panic USER 172 if aAlign is not a power of 2 or is less than the size of a TAny*.
-*/
-//
-// Construct a heap in an already existing chunk
-//
-	{
-
-	TInt page_size;
-	UserHal::PageSizeInBytes(page_size);
-	if (!aAlign)
-		aAlign = RHeap::ECellAlignment;
-	TInt maxLength = aChunk.MaxSize();
-	TInt round_up = Max(aAlign, page_size);
-	TInt min_cell = _ALIGN_UP(Max((TInt)RHeap::EAllocCellSize, (TInt)RHeap::EFreeCellSize), aAlign);
-	aOffset = _ALIGN_UP(aOffset, 8);
-	if (aMaxLength && aMaxLength+aOffset<maxLength)
-		maxLength = _ALIGN_UP(aMaxLength+aOffset, round_up);
-	__ASSERT_ALWAYS(aMinLength>=0, ::Panic(ETHeapMinLengthNegative));
-	__ASSERT_ALWAYS(maxLength>=aMinLength, ::Panic(ETHeapCreateMaxLessThanMin));
-	aMinLength = _ALIGN_UP(Max(aMinLength, (TInt)sizeof(RHeap) + min_cell) + aOffset, round_up);
-	TInt r=aChunk.Adjust(aMinLength);
-	if (r!=KErrNone)
-		return NULL;
-
-	RHeap* h = new (aChunk.Base() + aOffset) RHeap(aChunk.Handle(), aOffset, aMinLength, maxLength, aGrowBy, aAlign, aSingleThread);
-
-	TBool duplicateLock = EFalse;
-	if (!aSingleThread)
-		{
-		duplicateLock = aMode & EChunkHeapSwitchTo;
-		if(h->iLock.CreateLocal(duplicateLock ? EOwnerThread : EOwnerProcess)!=KErrNone)
-			{
-			h->iChunkHandle = 0;
-			return NULL;
-			}
-		}
-
-	if (aMode & EChunkHeapSwitchTo)
-		User::SwitchHeap(h);
-
-	h->iHandles = &h->iChunkHandle;
-	if (!aSingleThread)
-		{
-		// now change the thread-relative chunk/semaphore handles into process-relative handles
-		h->iHandleCount = 2;
-		if(duplicateLock)
-			{
-			RHandleBase s = h->iLock;
-			r = h->iLock.Duplicate(RThread());
-			s.Close();
-			}
-		if (r==KErrNone && (aMode & EChunkHeapDuplicate))
-			{
-			r = ((RChunk*)&h->iChunkHandle)->Duplicate(RThread());
-			if (r!=KErrNone)
-				h->iLock.Close(), h->iChunkHandle=0;
-			}
-		}
-	else
-		{
-		h->iHandleCount = 1;
-		if (aMode & EChunkHeapDuplicate)
-			r = ((RChunk*)&h->iChunkHandle)->Duplicate(RThread(), EOwnerThread);
-		}
-
-	// return the heap address
-	return (r==KErrNone) ? h : NULL;
-	}
-
-
-
-#define UserTestDebugMaskBit(bit) (TBool)(UserSvr::DebugMask(bit>>5) & (1<<(bit&31)))
-
-_LIT(KLitDollarHeap,"$HEAP");
-EXPORT_C TInt UserHeap::CreateThreadHeap(SStdEpocThreadCreateInfo& aInfo, RHeap*& aHeap, TInt aAlign, TBool aSingleThread)
-/**
-@internalComponent
-*/
-//
-// Create a user-side heap
-//
-	{
-	TInt page_size;
-	UserHal::PageSizeInBytes(page_size);
-	TInt minLength = _ALIGN_UP(aInfo.iHeapInitialSize, page_size);
-	TInt maxLength = Max(aInfo.iHeapMaxSize, minLength);
-	if (UserTestDebugMaskBit(96)) // 96 == KUSERHEAPTRACE in nk_trace.h
-		aInfo.iFlags |= ETraceHeapAllocs;
-
-	// Create the thread's heap chunk.
-	RChunk c;
-	TChunkCreateInfo createInfo;
-	createInfo.SetThreadHeap(0, maxLength, KLitDollarHeap());	// Initialise with no memory committed.
-
-	// Set the paging policy of the heap chunk based on the thread's paging policy.
-	TUint pagingflags = aInfo.iFlags & EThreadCreateFlagPagingMask;
-	switch (pagingflags)
-		{
-		case EThreadCreateFlagPaged:
-			createInfo.SetPaging(TChunkCreateInfo::EPaged);
-			break;
-		case EThreadCreateFlagUnpaged:
-			createInfo.SetPaging(TChunkCreateInfo::EUnpaged);
-			break;
-		case EThreadCreateFlagPagingUnspec:
-			// Leave the chunk paging policy unspecified so the process's 
-			// paging policy is used.
-			break;
-		}
-
-	TInt r = c.Create(createInfo);
-	if (r!=KErrNone)
-		return r;
-
-	aHeap = ChunkHeap(c, minLength, page_size, maxLength, aAlign, aSingleThread, EChunkHeapSwitchTo|EChunkHeapDuplicate);
-	c.Close();
-	if (!aHeap)
-		return KErrNoMemory;
-	if (aInfo.iFlags & ETraceHeapAllocs)
-		{
-		aHeap->iFlags |= RHeap::ETraceAllocs;
-		BTraceContext8(BTrace::EHeap, BTrace::EHeapCreate,(TUint32)aHeap, RHeap::EAllocCellSize);
-		TInt handle = aHeap->ChunkHandle();
-		TInt chunkId = ((RHandleBase&)handle).BTraceId();
-		BTraceContext8(BTrace::EHeap, BTrace::EHeapChunkCreate, (TUint32)aHeap, chunkId);
-		}
-	if (aInfo.iFlags & EMonitorHeapMemory)
-		aHeap->iFlags |= RHeap::EMonitorMemory;
-	return KErrNone;
-	}
-
-#endif	// __KERNEL_MODE__
-
-void RHeap::WalkCheckCell(TAny* aPtr, TCellType aType, TAny* aCell, TInt aLen)
-	{
-	(void)aCell;
-	SHeapCellInfo& info = *(SHeapCellInfo*)aPtr;
-	switch(aType)
-		{
-		case EGoodAllocatedCell:
-			{
-			++info.iTotalAlloc;
-			info.iTotalAllocSize += (aLen-EAllocCellSize);
-#if defined(_DEBUG)
-			RHeap& h = *info.iHeap;
-			if ( ((SDebugCell*)aCell)->nestingLevel == h.iNestingLevel )
-				{
-				if (++info.iLevelAlloc==1)
-					info.iStranded = (SDebugCell*)aCell;
-#ifdef __KERNEL_MODE__
-				if (KDebugNum(KSERVER) || KDebugNum(KTESTFAST))
-					{
-//				__KTRACE_OPT(KSERVER,Kern::Printf("LEAKED KERNEL HEAP CELL @ %08x : len=%d", aCell, aLen));
-					Kern::Printf("LEAKED KERNEL HEAP CELL @ %08x : len=%d", aCell, aLen);
-					TLinAddr base = ((TLinAddr)aCell)&~0x0f;
-					TLinAddr end = ((TLinAddr)aCell)+(TLinAddr)aLen;
-					while(base<end)
-						{
-						const TUint32* p = (const TUint32*)base;
-						Kern::Printf("%08x: %08x %08x %08x %08x", p, p[0], p[1], p[2], p[3]);
-						base += 16;
-						}
-					}
-#endif
-				}
-#endif	
-			break;
-			}
-		case EGoodFreeCell:
-			++info.iTotalFree;
-			break;
-		case EBadAllocatedCellSize:
-			HEAP_PANIC(ETHeapBadAllocatedCellSize);
-		case EBadAllocatedCellAddress:
-			HEAP_PANIC(ETHeapBadAllocatedCellAddress);
-		case EBadFreeCellAddress:
-			HEAP_PANIC(ETHeapBadFreeCellAddress);
-		case EBadFreeCellSize:
-			HEAP_PANIC(ETHeapBadFreeCellSize);
-		default:
-			HEAP_PANIC(ETHeapWalkBadCellType);
-		}
-	}
-
-TInt RHeap::DoCountAllocFree(TInt& aFree)
-	{
-	SHeapCellInfo info;
-	memclr(&info, sizeof(info));
-	info.iHeap = this;
-	Walk(&WalkCheckCell, &info);
-	aFree = info.iTotalFree;
-	return info.iTotalAlloc;
-	}
-
-
-UEXPORT_C TInt RHeap::DebugFunction(TInt aFunc, TAny* a1, TAny* a2)
-/**
-@internalComponent
-*/
-	{
-	TInt r = KErrNone;
-	switch(aFunc)
-		{
-		case RAllocator::ECount:
-			r = DoCountAllocFree(*(TInt*)a1);
-			break;
-		case RAllocator::EMarkStart:
-			__DEBUG_ONLY(DoMarkStart());
-			break;
-		case RAllocator::EMarkEnd:
-			__DEBUG_ONLY( r = DoMarkEnd((TInt)a1) );
-			break;
-		case RAllocator::ECheck:
-			r = DoCheckHeap((SCheckInfo*)a1);
-			break;
-		case RAllocator::ESetFail:
-			__DEBUG_ONLY(DoSetAllocFail((TAllocFail)(TInt)a1, (TInt)a2));
-			break;
-		case RAllocator::ESetBurstFail:
-#if _DEBUG
-			{
-			SRAllocatorBurstFail* fail = (SRAllocatorBurstFail*) a2;
-			DoSetAllocFail((TAllocFail)(TInt)a1, fail->iRate, fail->iBurst);
-			}
-#endif
-			break;
-
-		case RAllocator::ECheckFailure:
-				// iRand will be incremented for each EFailNext, EBurstFailNext,
-				// EDeterministic and EBurstDeterministic failure.
-				r = iRand;
-				break;
-
-		case RAllocator::ECopyDebugInfo:
-			{
-			TInt nestingLevel = ((SDebugCell*)a1)[-1].nestingLevel;
-			((SDebugCell*)a2)[-1].nestingLevel = nestingLevel;
-			break;
-			}
-		case RHeap::EWalk:
-			Walk((TWalkFunc)a1, a2);
-			break;
-		default:
-			return KErrNotSupported;
-		}
-	return r;
-	}
-
-
-
-
-void RHeap::Walk(TWalkFunc aFunc, TAny* aPtr)
-//
-// Walk the heap calling the info function.
-//
-	{
-
-	Lock();
-	SCell* pC = (SCell*)iBase;		// allocated cells
-	SCell* pF = &iFree;				// free cells
-	FOREVER
-		{
-		pF = pF->next;				// next free cell
-		if (!pF)
-			pF = (SCell*)iTop;		// to make size checking work
-		else if ( (TUint8*)pF>=iTop || (pF->next && pF->next<=pF) )
-			{
-			if (iFlags & ETraceAllocs)
-				BTraceContext12(BTrace::EHeap, BTrace::EHeapCorruption, (TUint32)this, (TUint32)pF+EFreeCellSize, 0);
-			// free cell pointer off the end or going backwards
-			Unlock();
-			(*aFunc)(aPtr, EBadFreeCellAddress, pF, 0);
-			return;
-			}
-		else
-			{
-			TInt l = pF->len;
-			if (l<iMinCell || (l & (iAlign-1)))
-				{
-				if (iFlags & ETraceAllocs)
-					BTraceContext12(BTrace::EHeap, BTrace::EHeapCorruption, (TUint32)this, (TUint32)pF+EFreeCellSize, l-EFreeCellSize);
-				// free cell length invalid
-				Unlock();
-				(*aFunc)(aPtr, EBadFreeCellSize, pF, l);
-				return;
-				}
-			}
-		while (pC!=pF)				// walk allocated cells up to next free cell
-			{
-			TInt l = pC->len;
-			if (l<iMinCell || (l & (iAlign-1)))
-				{
-				if (iFlags & ETraceAllocs)
-					BTraceContext12(BTrace::EHeap, BTrace::EHeapCorruption, (TUint32)this, (TUint32)pC+EAllocCellSize, l-EAllocCellSize);
-				// allocated cell length invalid
-				Unlock();
-				(*aFunc)(aPtr, EBadAllocatedCellSize, pC, l);
-				return;
-				}
-			(*aFunc)(aPtr, EGoodAllocatedCell, pC, l);
-			SCell* pN = __NEXT_CELL(pC);
-			if (pN > pF)
-				{
-				if (iFlags & ETraceAllocs)
-					BTraceContext12(BTrace::EHeap, BTrace::EHeapCorruption, (TUint32)this, (TUint32)pC+EAllocCellSize, l-EAllocCellSize);			
-				// cell overlaps next free cell
-				Unlock();
-				(*aFunc)(aPtr, EBadAllocatedCellAddress, pC, l);
-				return;
-				}
-			pC = pN;
-			}
-		if ((TUint8*)pF == iTop)
-			break;		// reached end of heap
-		pC = __NEXT_CELL(pF);	// step to next allocated cell
-		(*aFunc)(aPtr, EGoodFreeCell, pF, pF->len);
-		}
-	Unlock();
-	}
-
-TInt RHeap::DoCheckHeap(SCheckInfo* aInfo)
-	{
-	(void)aInfo;
-	SHeapCellInfo info;
-	memclr(&info, sizeof(info));
-	info.iHeap = this;
-	Walk(&WalkCheckCell, &info);
-#if defined(_DEBUG)
-	if (!aInfo)
-		return KErrNone;
-	TInt expected = aInfo->iCount;
-	TInt actual = aInfo->iAll ? info.iTotalAlloc : info.iLevelAlloc;
-	if (actual!=expected && !iTestData)
-		{
-#ifdef __KERNEL_MODE__
-		Kern::Fault("KERN-ALLOC COUNT", (expected<<16)|actual );
-#else
-		User::Panic(_L("ALLOC COUNT"), (expected<<16)|actual );
-#endif
-		}
-#endif
-	return KErrNone;
-	}
-
-#ifdef _DEBUG
-void RHeap::DoMarkStart()
-	{
-	if (iNestingLevel==0)
-		iAllocCount=0;
-	iNestingLevel++;
-	}
-
-TUint32 RHeap::DoMarkEnd(TInt aExpected)
-	{
-	if (iNestingLevel==0)
-		return 0;
-	SHeapCellInfo info;
-	SHeapCellInfo* p = iTestData ? (SHeapCellInfo*)iTestData : &info;
-	memclr(p, sizeof(info));
-	p->iHeap = this;
-	Walk(&WalkCheckCell, p);
-	if (p->iLevelAlloc != aExpected && !iTestData)
-		return (TUint32)(p->iStranded + 1);
-	if (--iNestingLevel == 0)
-		iAllocCount = 0;
-	return 0;
-	}
-
-void ResetAllocCellLevels(TAny* aPtr, RHeap::TCellType aType, TAny* aCell, TInt aLen)
-	{
-	(void)aPtr;
-	(void)aLen;
-	RHeap::SDebugCell* cell = (RHeap::SDebugCell*)aCell;
-	if (aType == RHeap::EGoodAllocatedCell)
-		{
-		cell->nestingLevel = 0;
-		}
-	}
-
-void RHeap::DoSetAllocFail(TAllocFail aType, TInt aRate)
-	{// Default to a burst mode of 1, as aType may be a burst type.
-	DoSetAllocFail(aType, aRate, 1);
-	}
-
-// Don't change as the ETHeapBadDebugFailParameter check below and the API 
-// documentation rely on this being 16 for RHeap.
-LOCAL_D const TInt KBurstFailRateShift = 16;
-LOCAL_D const TInt KBurstFailRateMask = (1 << KBurstFailRateShift) - 1;
-
-void RHeap::DoSetAllocFail(TAllocFail aType, TInt aRate, TUint aBurst)
-	{
-	if (aType==EReset)
-		{
-		// reset levels of all allocated cells to 0
-		// this should prevent subsequent tests failing unnecessarily
-		iFailed = EFalse;		// Reset for ECheckFailure relies on this.
-		Walk(&ResetAllocCellLevels, NULL);
-		// reset heap allocation mark as well
-		iNestingLevel=0;
-		iAllocCount=0;
-		aType=ENone;
-		}
-
-	switch (aType)
-		{
-		case EBurstRandom:
-		case EBurstTrueRandom:
-		case EBurstDeterministic:
-		case EBurstFailNext:
-			// If the fail type is a burst type then iFailRate is split in 2:
-			// the 16 lsbs are the fail rate and the 16 msbs are the burst length.
-			if (TUint(aRate) > (TUint)KMaxTUint16 || aBurst > KMaxTUint16)
-				HEAP_PANIC(ETHeapBadDebugFailParameter);
-
-			iFailed = EFalse;
-			iFailType = aType;
-			iFailRate = (aRate == 0) ? 1 : aRate;
-			iFailAllocCount = -iFailRate;
-			iFailRate = iFailRate | (aBurst << KBurstFailRateShift);
-			break;
-
-		default:
-			iFailed = EFalse;
-			iFailType = aType;
-			iFailRate = (aRate == 0) ? 1 : aRate; // A rate of <1 is meaningless
-			iFailAllocCount = 0;
-			break;
-		}
-
-	// Set up iRand for either:
-	//		- random seed value, or
-	//		- a count of the number of failures so far.
-	iRand = 0;
-#ifndef __KERNEL_MODE__
-	switch (iFailType)
-		{
-		case ETrueRandom:
-		case EBurstTrueRandom:
-			{
-			TTime time;
-			time.HomeTime();
-			TInt64 seed = time.Int64();
-			iRand = Math::Rand(seed);
-			break;
-			}
-		case ERandom:
-		case EBurstRandom:
-	        {
-	        TInt64 seed = 12345;
-			iRand = Math::Rand(seed);
-			break;
-	        }
-		default:
-			break;
-		}
-#endif
-	}
-
-TBool RHeap::CheckForSimulatedAllocFail()
-//
-// Check to see if the user has requested simulated alloc failure, and if so possibly 
-// Return ETrue indicating a failure.
-//
-	{
-	// For burst mode failures iFailRate is shared
-	TUint16 rate  = (TUint16)(iFailRate &  KBurstFailRateMask);
-	TUint16 burst = (TUint16)(iFailRate >> KBurstFailRateShift);
-	TBool r = EFalse;
-	switch (iFailType)
-		{
-#ifndef __KERNEL_MODE__
-		case ERandom:
-		case ETrueRandom:
-			if (++iFailAllocCount>=iFailRate) 
-				{	
-				iFailAllocCount=0;
-				if (!iFailed) // haven't failed yet after iFailRate allocations so fail now
-					return(ETrue); 
-				iFailed=EFalse;
-				}
-			else   
-				{
-				if (!iFailed)
-					{
-	                TInt64 seed=iRand;
-					iRand=Math::Rand(seed);
-					if (iRand%iFailRate==0)
-						{
-						iFailed=ETrue;
-						return(ETrue);
-						}
-					}
-				}
-			break;
-
-		case EBurstRandom:
-		case EBurstTrueRandom:
-			if (++iFailAllocCount < 0) 
-				{
-				// We haven't started failing yet so should we now?
-				TInt64 seed = iRand;
-				iRand = Math::Rand(seed);
-				if (iRand % rate == 0)
-					{// Fail now.  Reset iFailAllocCount so we fail burst times
-					iFailAllocCount = 0;
-					r = ETrue;
-					}
-				}
-			else
-				{
-				if (iFailAllocCount < burst)
-					{// Keep failing for burst times
-					r = ETrue;
-					}
-				else
-					{// We've now failed burst times so start again.
-					iFailAllocCount = -(rate - 1);
-					}
-				}
-			break;
-#endif
-		case EDeterministic:
-			if (++iFailAllocCount%iFailRate==0)
-				{
-				r=ETrue;
-				iRand++;	// Keep count of how many times we have failed
-				}
-			break;
-
-		case EBurstDeterministic:
-			// This will fail burst number of times, every rate attempts.
-			if (++iFailAllocCount >= 0)
-				{
-				if (iFailAllocCount == burst - 1)
-					{// This is the burst time we have failed so make it the last by
-					// reseting counts so we next fail after rate attempts.
-					iFailAllocCount = -rate;
-					}
-				r = ETrue;
-				iRand++;	// Keep count of how many times we have failed
-				}
-			break;
-
-		case EFailNext:
-			if ((++iFailAllocCount%iFailRate)==0)
-				{
-				iFailType=ENone;
-				r=ETrue;
-				iRand++;	// Keep count of how many times we have failed
-				}
-			break;
-
-		case EBurstFailNext:
-			if (++iFailAllocCount >= 0)
-				{
-				if (iFailAllocCount == burst - 1)
-					{// This is the burst time we have failed so make it the last.
-					iFailType = ENone;
-					}
-				r = ETrue;
-				iRand++;	// Keep count of how many times we have failed
-				}
-			break;
-		default:
-			break;
-		}
-	return r;
-	}
-#endif	// ifdef _DEBUG
-
-UEXPORT_C TInt RHeap::Extension_(TUint aExtensionId, TAny*& a0, TAny* a1)
-	{
-	return RAllocator::Extension_(aExtensionId, a0, a1);
-	}
-
-#if defined(__HEAP_MACHINE_CODED__) && !defined(_DEBUG)
-GLDEF_C void RHeap_PanicBadAllocatedCellSize()
-	{
-	HEAP_PANIC(ETHeapBadAllocatedCellSize);
-	}
-
-GLDEF_C void RHeap_PanicBadNextCell()
-	{
-	HEAP_PANIC(ETHeapFreeBadNextCell);
-	}
-
-GLDEF_C void RHeap_PanicBadPrevCell()
-	{
-	HEAP_PANIC(ETHeapFreeBadPrevCell);
-	}
-
-GLDEF_C void RHeap_PanicBadCellAddress()
-	{
-	HEAP_PANIC(ETHeapBadCellAddress);
-	}
-#endif
-
-
-
-
-
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/common/heap_hybrid.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/common/heap_hybrid.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,3319 @@
+// Copyright (c) 1994-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// kernel\eka\common\heap_hybrid.cpp
+// 
+// Uses malloc (aka dlmalloc) written by Doug Lea version 2.8.4
+//
+
+#include "common.h"
+#ifdef __KERNEL_MODE__
+#include <kernel/kern_priv.h>
+#endif
+#include "dla.h"
+#ifndef __KERNEL_MODE__
+#include "slab.h"
+#include "page_alloc.h"
+#endif
+#include "heap_hybrid.h"
+
+// enables btrace code compiling into 
+#define ENABLE_BTRACE
+
+// if non zero this causes the iSlabs to be configured only when the chunk size exceeds this level
+#define DELAYED_SLAB_THRESHOLD (64*1024)		// 64KB seems about right based on trace data
+#define SLAB_CONFIG 0xabe						// Use slabs of size 48, 40, 32, 24, 20, 16, 12, and 8 bytes
+
+#ifdef _DEBUG
+#define __SIMULATE_ALLOC_FAIL(s)	if (CheckForSimulatedAllocFail()) {s}
+#define __ALLOC_DEBUG_HEADER(s)  	(s += EDebugHdrSize)
+#define __SET_DEBUG_DATA(p,n,c)   	(((SDebugCell*)(p))->nestingLevel = (n), ((SDebugCell*)(p))->allocCount = (c))
+#define __GET_USER_DATA_BFR(p)   	((p!=0) ? (TUint8*)(p) + EDebugHdrSize : NULL)
+#define __GET_DEBUG_DATA_BFR(p)   	((p!=0) ? (TUint8*)(p) - EDebugHdrSize : NULL)
+#define	__ZAP_CELL(p)				memset( (TUint8*)p, 0xde, (AllocLen(__GET_USER_DATA_BFR(p))+EDebugHdrSize))
+#define __DEBUG_SAVE(p)				TInt dbgNestLevel = ((SDebugCell*)p)->nestingLevel
+#define __DEBUG_RESTORE(p)			if (p) {((SDebugCell*)p)->nestingLevel = dbgNestLevel;}
+#define __DEBUG_HDR_SIZE			EDebugHdrSize
+#define __REMOVE_DBG_HDR(n) 		(n*EDebugHdrSize)
+#define __GET_AVAIL_BLOCK_SIZE(s)   ( (s<EDebugHdrSize) ? 0 : s-EDebugHdrSize )
+#define __UPDATE_ALLOC_COUNT(o,n,c)	if (o!=n && n) {((SDebugCell*)n)->allocCount = (c);}
+#define __INIT_COUNTERS(i)	        iCellCount=i,iTotalAllocSize=i
+#define __INCREMENT_COUNTERS(p)	    iCellCount++, iTotalAllocSize += AllocLen(p)
+#define __DECREMENT_COUNTERS(p)	    iCellCount--, iTotalAllocSize -= AllocLen(p)
+#define __UPDATE_TOTAL_ALLOC(p,s)	iTotalAllocSize += (AllocLen(__GET_USER_DATA_BFR(p)) - s)
+
+#else
+#define __SIMULATE_ALLOC_FAIL(s)
+#define __ALLOC_DEBUG_HEADER(s)
+#define __SET_DEBUG_DATA(p,n,c)
+#define __GET_USER_DATA_BFR(p)  (p)
+#define __GET_DEBUG_DATA_BFR(p) (p)
+#define	__ZAP_CELL(p)
+#define __DEBUG_SAVE(p)			
+#define __DEBUG_RESTORE(p)
+#define __DEBUG_HDR_SIZE		0
+#define __REMOVE_DBG_HDR(n) 	0
+#define __GET_AVAIL_BLOCK_SIZE(s)   (s)
+#define __UPDATE_ALLOC_COUNT(o,n,c)	
+#define __INIT_COUNTERS(i)	        iCellCount=i,iTotalAllocSize=i
+#define __INCREMENT_COUNTERS(p)
+#define __DECREMENT_COUNTERS(p)
+#define __UPDATE_TOTAL_ALLOC(p,s)
+
+#endif
+
+
+#define MEMORY_MONITORED  (iFlags & EMonitorMemory)
+#define GM  (&iGlobalMallocState)
+#define IS_FIXED_HEAP  (iFlags & EFixedSize)
+#define __INIT_COUNTERS(i)	iCellCount=i,iTotalAllocSize=i
+#define __POWER_OF_2(x)		(!((x)&((x)-1)))
+
+#define __DL_BFR_CHECK(M,P) \
+		  if ( MEMORY_MONITORED ) \
+             if ( !IS_ALIGNED(P) || ((TUint8*)(P)<M->iSeg.iBase) || ((TUint8*)(P)>(M->iSeg.iBase+M->iSeg.iSize))) \
+                  BTraceContext12(BTrace::EHeap, BTrace::EHeapCorruption, (TUint32)this, (TUint32)P, (TUint32)0), HEAP_PANIC(ETHeapBadCellAddress); \
+			 else DoCheckInuseChunk(M, MEM2CHUNK(P)) 
+
+#ifndef __KERNEL_MODE__
+
+#define __SLAB_BFR_CHECK(S,P,B) \
+	  if ( MEMORY_MONITORED ) \
+		  if ( ((TUint32)P & 0x3) || ((TUint8*)P<iMemBase) || ((TUint8*)(P)>(TUint8*)this))  \
+			   BTraceContext12(BTrace::EHeap, BTrace::EHeapCorruption, (TUint32)this, (TUint32)P, (TUint32)S), HEAP_PANIC(ETHeapBadCellAddress); \
+		  else DoCheckSlab(S, EPartialFullSlab, P), BuildPartialSlabBitmap(B,S,P) 					  
+#define __PAGE_BFR_CHECK(P) \
+		if ( MEMORY_MONITORED ) \
+			if ( ((TUint32)P &  ((1 << iPageSize)-1)) || ((TUint8*)P<iMemBase) || ((TUint8*)(P)>(TUint8*)this))  \
+				BTraceContext12(BTrace::EHeap, BTrace::EHeapCorruption, (TUint32)this, (TUint32)P, (TUint32)0), HEAP_PANIC(ETHeapBadCellAddress)
+
+#endif
+
+#ifdef _MSC_VER
+// This is required while we are still using VC6 to compile, so as to avoid warnings that cannot be fixed
+// without having to edit the original Doug Lea source.  The 4146 warnings are due to the original code having
+// a liking for negating unsigned numbers and the 4127 warnings are due to the original code using the RTCHECK
+// macro with values that are always defined as 1.  It is better to turn these warnings off than to introduce
+// diffs between the original Doug Lea implementation and our adaptation of it
+#pragma warning( disable : 4146 ) /* unary minus operator applied to unsigned type, result still unsigned */
+#pragma warning( disable : 4127 ) /* conditional expression is constant */
+#endif // _MSC_VER
+
+
+/**
+@SYMPatchable
+@publishedPartner
+@released
+
+Defines the minimum cell size of  a heap.
+
+The constant can be changed at ROM build time using patchdata OBY keyword.
+
+@deprecated Patching this constant no longer has any effect.
+*/
+#ifdef __X86GCC__	// For X86GCC we dont use the proper data import attribute
+#undef IMPORT_D		// since the constants are not really imported. GCC doesn't 
+#define IMPORT_D	// allow imports from self.
+#endif
+IMPORT_D extern const TInt KHeapMinCellSize;
+
+/**
+@SYMPatchable
+@publishedPartner
+@released
+
+This constant defines the ratio that determines the amount of hysteresis between heap growing and heap
+shrinking.
+It is a 32-bit fixed point number where the radix point is defined to be
+between bits 7 and 8 (where the LSB is bit 0) i.e. using standard notation, a Q8 or a fx24.8
+fixed point number.  For example, for a ratio of 2.0, set KHeapShrinkHysRatio=0x200.
+
+The heap shrinking hysteresis value is calculated to be:
+@code
+KHeapShrinkHysRatio*(iGrowBy>>8)
+@endcode
+where iGrowBy is a page aligned value set by the argument, aGrowBy, to the RHeap constructor.
+The default hysteresis value is iGrowBy bytes i.e. KHeapShrinkHysRatio=2.0.
+
+Memory usage may be improved by reducing the heap shrinking hysteresis
+by setting 1.0 < KHeapShrinkHysRatio < 2.0.  Heap shrinking hysteresis is disabled/removed
+when KHeapShrinkHysRatio <= 1.0.
+
+The constant can be changed at ROM build time using patchdata OBY keyword.
+*/
+IMPORT_D extern const TInt KHeapShrinkHysRatio;
+
+UEXPORT_C TInt RHeap::AllocLen(const TAny* aCell) const
+{
+	const MAllocator* m = this;
+	return m->AllocLen(aCell);
+}
+
+UEXPORT_C TAny* RHeap::Alloc(TInt aSize)
+{
+	const MAllocator* m = this;
+	return ((MAllocator*)m)->Alloc(aSize);
+}
+
+UEXPORT_C void RHeap::Free(TAny* aCell)
+{
+	const MAllocator* m = this;
+	((MAllocator*)m)->Free(aCell);
+}
+
+UEXPORT_C TAny* RHeap::ReAlloc(TAny* aCell, TInt aSize, TInt aMode)
+{
+	const MAllocator* m = this;
+	return ((MAllocator*)m)->ReAlloc(aCell, aSize, aMode);
+}
+
+UEXPORT_C TInt RHeap::DebugFunction(TInt aFunc, TAny* a1, TAny* a2)
+{
+	const MAllocator* m = this;
+	return ((MAllocator*)m)->DebugFunction(aFunc, a1, a2);
+}
+
+UEXPORT_C TInt RHeap::Extension_(TUint aExtensionId, TAny*& a0, TAny* a1)
+{
+	const MAllocator* m = this;
+	return ((MAllocator*)m)->Extension_(aExtensionId, a0, a1);
+}
+
+#ifndef __KERNEL_MODE__
+
+EXPORT_C TInt RHeap::AllocSize(TInt& aTotalAllocSize) const
+{
+	const MAllocator* m = this;
+	return m->AllocSize(aTotalAllocSize);
+}
+
+EXPORT_C TInt RHeap::Available(TInt& aBiggestBlock) const
+{
+	const MAllocator* m = this;
+	return m->Available(aBiggestBlock);
+}
+
+EXPORT_C void RHeap::Reset()
+{
+	const MAllocator* m = this;
+	((MAllocator*)m)->Reset();
+}
+
+EXPORT_C TInt RHeap::Compress()
+{
+	const MAllocator* m = this;
+	return ((MAllocator*)m)->Compress();
+}
+#endif
+
+RHybridHeap::RHybridHeap()
+	{
+	// This initialisation cannot be done in RHeap() for compatibility reasons
+	iMaxLength = iChunkHandle = iNestingLevel = 0;
+	iTop = NULL;
+	iFailType = ENone;
+	iTestData = NULL;
+	}
+
+void RHybridHeap::operator delete(TAny*, TAny*) 
+/**
+Called if constructor issued by operator new(TUint aSize, TAny* aBase) throws exception.
+This is dummy as corresponding new operator does not allocate memory.
+*/
+{}
+
+
+#ifndef __KERNEL_MODE__
+void RHybridHeap::Lock() const
+   /**
+   @internalComponent
+*/
+   {((RFastLock&)iLock).Wait();}
+
+
+void RHybridHeap::Unlock() const
+   /**
+   @internalComponent
+*/
+   {((RFastLock&)iLock).Signal();}
+
+
+TInt RHybridHeap::ChunkHandle() const
+   /**
+   @internalComponent
+*/
+{
+	return iChunkHandle;
+}
+
+#else
+//
+//  This method is implemented in kheap.cpp
+//
+//void RHybridHeap::Lock() const
+   /**
+   @internalComponent
+*/
+//   {;}
+
+
+
+//
+//  This method is implemented in kheap.cpp
+//
+//void RHybridHeap::Unlock() const
+   /**
+   @internalComponent
+*/
+//   {;}
+
+
+TInt RHybridHeap::ChunkHandle() const
+   /**
+   @internalComponent
+*/
+{
+	return 0;
+}
+#endif
+
+RHybridHeap::RHybridHeap(TInt aChunkHandle, TInt aOffset, TInt aMinLength, TInt aMaxLength, TInt aGrowBy, TInt aAlign, TBool aSingleThread, TBool aDLOnly, TBool aUseAdjust)
+/**
+Constructor for a non fixed heap.  Unlike the fixed heap, this heap is quite flexible in terms of its minimum and
+maximum lengths and in that it can use the hybrid allocator if all of its requirements are met.
+*/
+	: iOffset(aOffset), iChunkSize(aMinLength)
+	{
+	__ASSERT_ALWAYS(iOffset>=0, HEAP_PANIC(ETHeapNewBadOffset));	
+
+	iChunkHandle = aChunkHandle;
+	iMinLength = aMinLength;
+	iMaxLength = aMaxLength;
+
+	// If the user has explicitly specified 0 as the aGrowBy value, set it to 1 so that it will be rounded up to the nearst page size
+	if (aGrowBy == 0)
+		aGrowBy = 1;
+	GET_PAGE_SIZE(iPageSize);
+	iGrowBy = _ALIGN_UP(aGrowBy, iPageSize);
+
+	Construct(aSingleThread, aDLOnly, aUseAdjust, aAlign);
+	}
+
+RHybridHeap::RHybridHeap(TInt aMaxLength, TInt aAlign, TBool aSingleThread)
+/**
+Constructor for a fixed heap.  We have restrictions in that we have fixed minimum and maximum lengths and cannot grow
+and we only use DL allocator.
+*/
+	: iOffset(0), iChunkSize(aMaxLength)
+	{
+	iChunkHandle = NULL;
+	iMinLength = aMaxLength;
+	iMaxLength = aMaxLength;
+	iGrowBy = 0;
+
+	Construct(aSingleThread, ETrue, ETrue, aAlign);
+	}
+
+TAny* RHybridHeap::operator new(TUint aSize, TAny* aBase) __NO_THROW
+{
+	__ASSERT_ALWAYS(aSize>=sizeof(RHybridHeap), HEAP_PANIC(ETHeapNewBadSize));
+	RHybridHeap* h = (RHybridHeap*)aBase;
+	h->iBase = ((TUint8*)aBase) + aSize;
+	return aBase;
+}
+
+void RHybridHeap::Construct(TBool aSingleThread, TBool aDLOnly, TBool aUseAdjust, TInt aAlign)
+{
+	iAlign = aAlign ? aAlign : RHybridHeap::ECellAlignment;
+	__ASSERT_ALWAYS((TUint32)iAlign>=sizeof(TAny*) && __POWER_OF_2(iAlign), HEAP_PANIC(ETHeapNewBadAlignment));
+
+	// This initialisation cannot be done in RHeap() for compatibility reasons
+	iTop = NULL;
+	iFailType = ENone;
+	iNestingLevel = 0;
+	iTestData = NULL;
+
+	iHighWaterMark = iMinLength;
+	iAllocCount = 0;
+	iFlags = aSingleThread ? ESingleThreaded : 0;
+	iGrowBy = _ALIGN_UP(iGrowBy, iPageSize);
+	
+	if ( iMinLength == iMaxLength )
+		{
+		iFlags |= EFixedSize;
+		aDLOnly = ETrue;
+		}
+#ifndef __KERNEL_MODE__
+#ifdef DELAYED_SLAB_THRESHOLD
+	iSlabInitThreshold = DELAYED_SLAB_THRESHOLD;
+#else
+	iSlabInitThreshold = 0;
+#endif // DELAYED_SLAB_THRESHOLD
+	iUseAdjust = aUseAdjust;
+	iDLOnly    = aDLOnly;
+#else
+	(void)aUseAdjust;	
+#endif 
+	// Initialise suballocators
+	// if DL only is required then it cannot allocate slab or page memory
+	// so these sub-allocators should be disabled. Otherwise initialise with default values
+	if ( aDLOnly )
+		{
+		Init(0, 0);
+		}
+	else
+		{
+		Init(SLAB_CONFIG, 16);
+		}
+	
+#ifdef ENABLE_BTRACE
+	
+	TUint32 traceData[4];
+	traceData[0] = iMinLength;
+	traceData[1] = iMaxLength;
+	traceData[2] = iGrowBy;
+	traceData[3] = iAlign;
+	BTraceContextN(BTrace::ETest1, 90, (TUint32)this, 11, traceData, sizeof(traceData));
+#endif
+	
+}
+
+#ifndef __KERNEL_MODE__
+TInt RHybridHeap::ConstructLock(TUint32 aMode)
+{
+	TBool duplicateLock = EFalse;
+	TInt r = KErrNone;
+	if (!(iFlags & ESingleThreaded))
+		{
+		duplicateLock = aMode & UserHeap::EChunkHeapSwitchTo;
+		r = iLock.CreateLocal(duplicateLock ? EOwnerThread : EOwnerProcess);
+		if( r != KErrNone)
+			{
+			iChunkHandle = 0;
+			return r;
+			}
+		}
+	
+	if ( aMode & UserHeap::EChunkHeapSwitchTo )
+		User::SwitchHeap(this);
+	
+	iHandles = &iChunkHandle;
+	if (!(iFlags & ESingleThreaded))
+		{
+		// now change the thread-relative chunk/semaphore handles into process-relative handles
+		iHandleCount = 2;
+		if(duplicateLock)
+			{
+			RHandleBase s = iLock;
+			r = iLock.Duplicate(RThread());
+			s.Close();
+			}
+		if (r==KErrNone && (aMode & UserHeap::EChunkHeapDuplicate))
+			{
+			r = ((RChunk*)&iChunkHandle)->Duplicate(RThread());
+			if (r!=KErrNone)
+				iLock.Close(), iChunkHandle=0;
+			}
+		}
+	else
+		{
+		iHandleCount = 1;
+		if (aMode & UserHeap::EChunkHeapDuplicate)
+			r = ((RChunk*)&iChunkHandle)->Duplicate(RThread(), EOwnerThread);
+		}
+	
+	return r;
+}
+#endif
+
+void RHybridHeap::Init(TInt aBitmapSlab, TInt aPagePower)
+{
+	/*Moved code which does initilization */
+	iTop  = (TUint8*)this + iMinLength;
+	iBase = Ceiling(iBase, ECellAlignment);	// Align iBase address 
+	
+    __INIT_COUNTERS(0);
+	//	memset(&mparams,0,sizeof(mparams));
+	
+	InitDlMalloc(iTop - iBase, 0);
+	
+#ifndef __KERNEL_MODE__	
+	SlabInit();
+	iSlabConfigBits = aBitmapSlab;
+	if ( iChunkSize > iSlabInitThreshold )
+		{
+		iSlabInitThreshold = KMaxTInt32;
+		SlabConfig(aBitmapSlab);   // Delayed slab configuration done
+		}
+	if ( aPagePower )
+		{
+		RChunk chunk;
+		chunk.SetHandle(iChunkHandle);
+		iMemBase = chunk.Base();    // Store base address for paged allocator
+		}
+
+	/*10-1K,11-2K,12-4k,13-8K,14-16K,15-32K,16-64K*/
+	PagedInit(aPagePower);
+
+#ifdef ENABLE_BTRACE
+	TUint32 traceData[3];
+	traceData[0] = aBitmapSlab;
+	traceData[1] = aPagePower;
+	traceData[2] = GM->iTrimCheck;
+	BTraceContextN(BTrace::ETest1, 90, (TUint32)this, 0, traceData, sizeof(traceData));
+#endif
+#else
+	(void)aBitmapSlab;
+	(void)aPagePower;
+#endif	// __KERNEL_MODE__
+	
+}
+
+
+TInt RHybridHeap::AllocLen(const TAny* aCell) const
+{
+	aCell = __GET_DEBUG_DATA_BFR(aCell);
+	
+	if (PtrDiff(aCell, this) >= 0)
+		{
+		mchunkptr m = MEM2CHUNK(aCell);
+		return CHUNKSIZE(m) - OVERHEAD_FOR(m) - __DEBUG_HDR_SIZE;
+		}
+#ifndef __KERNEL_MODE__		
+	if ( aCell )
+		{
+		if (LowBits(aCell, iPageSize) )
+			return SlabHeaderSize(slab::SlabFor(aCell)->iHeader) - __DEBUG_HDR_SIZE;
+		
+		return PagedSize((void*)aCell) - __DEBUG_HDR_SIZE;
+		}
+#endif	
+	return 0; // NULL pointer situation, should PANIC !!
+}
+
+#ifdef __KERNEL_MODE__
+TAny* RHybridHeap::Alloc(TInt aSize)
+{
+	__CHECK_THREAD_STATE;
+	__ASSERT_ALWAYS((TUint)aSize<(KMaxTInt/2),HEAP_PANIC(ETHeapBadAllocatedCellSize));
+	__SIMULATE_ALLOC_FAIL(return NULL;)
+	Lock();
+	__ALLOC_DEBUG_HEADER(aSize);
+	TAny* addr = DlMalloc(aSize);
+	if ( addr )
+		{
+//		iCellCount++;
+		__SET_DEBUG_DATA(addr, iNestingLevel, ++iAllocCount);
+		addr = __GET_USER_DATA_BFR(addr);
+		__INCREMENT_COUNTERS(addr);
+		memclr(addr, AllocLen(addr));
+		}
+	Unlock();
+#ifdef ENABLE_BTRACE
+	if (iFlags & ETraceAllocs)
+		{
+		if ( addr )
+			{
+			TUint32 traceData[3];
+			traceData[0] = AllocLen(addr);
+			traceData[1] = aSize - __DEBUG_HDR_SIZE;
+			traceData[2] = 0;
+			BTraceContextN(BTrace::EHeap, BTrace::EHeapAlloc, (TUint32)this, (TUint32)addr, traceData, sizeof(traceData));
+			}
+		else
+			BTraceContext8(BTrace::EHeap, BTrace::EHeapAllocFail, (TUint32)this, (TUint32)(aSize - __DEBUG_HDR_SIZE));			
+		}
+#endif
+	return addr;
+}
+#else
+
+TAny* RHybridHeap::Alloc(TInt aSize)
+{
+	__ASSERT_ALWAYS((TUint)aSize<(KMaxTInt/2),HEAP_PANIC(ETHeapBadAllocatedCellSize));
+	__SIMULATE_ALLOC_FAIL(return NULL;)
+			
+	TAny* addr;
+#ifdef ENABLE_BTRACE
+	TInt aSubAllocator=0;
+#endif
+	
+	Lock();
+	
+	__ALLOC_DEBUG_HEADER(aSize);
+	
+	if (aSize < iSlabThreshold)
+		{
+		TInt ix = iSizeMap[(aSize+3)>>2];
+		HEAP_ASSERT(ix != 0xff);
+		addr = SlabAllocate(iSlabAlloc[ix]);
+		if ( !addr )
+			{ // Slab allocation has failed, try to allocate from DL
+			addr = DlMalloc(aSize);
+			}
+#ifdef ENABLE_BTRACE
+		else
+			aSubAllocator=1;
+#endif
+		}else if((aSize >> iPageThreshold)==0)
+			{
+			addr = DlMalloc(aSize);
+			}
+		else
+			{
+			addr = PagedAllocate(aSize);
+			if ( !addr )
+				{ // Page allocation has failed, try to allocate from DL
+				addr = DlMalloc(aSize);
+				}
+#ifdef ENABLE_BTRACE
+			else
+	      		aSubAllocator=2;
+#endif
+			}
+	
+	if ( addr )
+		{
+//		iCellCount++;
+		__SET_DEBUG_DATA(addr, iNestingLevel, ++iAllocCount);
+		addr = __GET_USER_DATA_BFR(addr);
+		__INCREMENT_COUNTERS(addr);
+		}
+	Unlock();
+	
+#ifdef ENABLE_BTRACE
+	if (iFlags & ETraceAllocs)
+		{
+		if ( addr )
+			{
+		    TUint32 traceData[3];
+		    traceData[0] = AllocLen(addr);
+		    traceData[1] = aSize - __DEBUG_HDR_SIZE;
+			traceData[2] = aSubAllocator;
+		    BTraceContextN(BTrace::EHeap, BTrace::EHeapAlloc, (TUint32)this, (TUint32)addr, traceData, sizeof(traceData));
+			}
+		else
+			BTraceContext8(BTrace::EHeap, BTrace::EHeapAllocFail, (TUint32)this, (TUint32)(aSize - __DEBUG_HDR_SIZE));			
+		}
+#endif
+	
+	return addr;
+}
+#endif // __KERNEL_MODE__
+
+#ifndef __KERNEL_MODE__
+TInt RHybridHeap::Compress()
+{
+	if ( IS_FIXED_HEAP )
+		return 0;
+	
+	Lock();
+	TInt Reduced = SysTrim(GM, 0);
+	if (iSparePage)
+		{
+		Unmap(iSparePage, iPageSize);
+		iSparePage = 0;
+		Reduced += iPageSize;
+		}
+	Unlock();
+	return Reduced;
+}
+#endif
+
+void RHybridHeap::Free(TAny* aPtr)
+{
+	__CHECK_THREAD_STATE;
+	if ( !aPtr )
+		return;
+#ifdef ENABLE_BTRACE
+	TInt aSubAllocator=0;
+#endif
+	Lock();
+	
+	aPtr = __GET_DEBUG_DATA_BFR(aPtr);
+
+#ifndef __KERNEL_MODE__				
+	if (PtrDiff(aPtr, this) >= 0)
+		{
+#endif
+		__DL_BFR_CHECK(GM, aPtr);
+		__DECREMENT_COUNTERS(__GET_USER_DATA_BFR(aPtr));
+		__ZAP_CELL(aPtr);		
+		DlFree( aPtr);
+#ifndef __KERNEL_MODE__			
+		}
+
+	else if ( LowBits(aPtr, iPageSize) == 0 )
+		{
+#ifdef ENABLE_BTRACE
+		aSubAllocator = 2;
+#endif
+		__PAGE_BFR_CHECK(aPtr);	
+		__DECREMENT_COUNTERS(__GET_USER_DATA_BFR(aPtr));
+		PagedFree(aPtr);
+		}
+	else
+		{
+#ifdef ENABLE_BTRACE
+		aSubAllocator = 1;
+#endif
+		TUint32 bm[4];   		
+		__SLAB_BFR_CHECK(slab::SlabFor(aPtr),aPtr,bm);
+		__DECREMENT_COUNTERS(__GET_USER_DATA_BFR(aPtr));  
+		__ZAP_CELL(aPtr);		
+		SlabFree(aPtr);
+		}
+#endif  // __KERNEL_MODE__	
+//	iCellCount--;
+	Unlock();
+#ifdef ENABLE_BTRACE
+	if (iFlags & ETraceAllocs)
+		{
+		TUint32 traceData;
+		traceData = aSubAllocator;
+		BTraceContextN(BTrace::EHeap, BTrace::EHeapFree, (TUint32)this, (TUint32)__GET_USER_DATA_BFR(aPtr), &traceData, sizeof(traceData));
+		}
+#endif
+}
+
+#ifndef __KERNEL_MODE__
+void RHybridHeap::Reset()
+/**
+Frees all allocated cells on this heap.
+*/
+{
+	Lock();
+	if ( !IS_FIXED_HEAP )
+		{
+		if ( GM->iSeg.iSize > (iMinLength - sizeof(*this)) )
+			Unmap(GM->iSeg.iBase + (iMinLength - sizeof(*this)), (GM->iSeg.iSize - (iMinLength - sizeof(*this))));
+		ResetBitmap();
+		if ( !iDLOnly )
+			Init(iSlabConfigBits, iPageThreshold);
+		else
+			Init(0,0);		
+		}
+	else Init(0,0);
+	Unlock();	
+}
+#endif
+
+TAny* RHybridHeap::ReAllocImpl(TAny* aPtr, TInt aSize, TInt aMode)
+{
+	// First handle special case of calling reallocate with NULL aPtr
+	if (!aPtr)
+		{
+		if (( aMode & ENeverMove ) == 0 )
+			{
+			aPtr = Alloc(aSize - __DEBUG_HDR_SIZE);
+			aPtr = __GET_DEBUG_DATA_BFR(aPtr);
+			}
+		return aPtr;
+		}
+	
+	TInt oldsize = AllocLen(__GET_USER_DATA_BFR(aPtr)) + __DEBUG_HDR_SIZE;
+	
+	// Insist on geometric growth when reallocating memory, this reduces copying and fragmentation
+	// generated during arithmetic growth of buffer/array/vector memory
+	// Experiments have shown that 25% is a good threshold for this policy
+	if (aSize <= oldsize)
+		{
+		if (aSize >= oldsize - (oldsize>>2))
+			return aPtr;		// don't change if >75% original size
+		}
+	else
+		{
+		__SIMULATE_ALLOC_FAIL(return NULL;)
+		if (aSize < oldsize + (oldsize>>2))
+			{
+			aSize = _ALIGN_UP(oldsize + (oldsize>>2), 4);	// grow to at least 125% original size
+			}
+		}
+	__DEBUG_SAVE(aPtr);		
+	
+	TAny* newp;
+#ifdef __KERNEL_MODE__
+	Lock();
+	__DL_BFR_CHECK(GM, aPtr);				
+	newp = DlRealloc(aPtr, aSize, aMode);
+	Unlock();
+	if ( newp )
+		{
+	    if ( aSize > oldsize )
+			memclr(((TUint8*)newp) + oldsize, (aSize-oldsize)); // Buffer has grown in place, clear extra
+		__DEBUG_RESTORE(newp);
+		__UPDATE_ALLOC_COUNT(aPtr, newp, ++iAllocCount);
+		__UPDATE_TOTAL_ALLOC(newp, oldsize);
+		}
+#else
+	// Decide how to reallocate based on (a) the current cell location, (b) the mode requested and (c) the new size
+	if ( PtrDiff(aPtr, this) >= 0 )
+		{	// current cell in Doug Lea iArena
+		if ( (aMode & ENeverMove) 
+			 ||
+			 (!(aMode & EAllowMoveOnShrink) && (aSize < oldsize))
+			 ||
+			 ((aSize >= iSlabThreshold) && ((aSize >> iPageThreshold) == 0)) )
+			{
+			Lock();
+			__DL_BFR_CHECK(GM, aPtr);			
+			newp = DlRealloc(aPtr, aSize, aMode);			// old and new in DL allocator
+			Unlock();
+			__DEBUG_RESTORE(newp);
+			__UPDATE_ALLOC_COUNT(aPtr,newp, ++iAllocCount);
+			__UPDATE_TOTAL_ALLOC(newp, oldsize);
+			return newp;
+			}
+		}
+	else if (LowBits(aPtr, iPageSize) == 0)
+		{	// current cell in paged iArena
+		if ( (aMode & ENeverMove)     
+			 ||
+			 (!(aMode & EAllowMoveOnShrink) && (aSize < oldsize)) 
+			 ||
+			 ((aSize >> iPageThreshold) != 0) )
+			{
+			Lock();
+			__PAGE_BFR_CHECK(aPtr);			
+			newp = PagedReallocate(aPtr, aSize, aMode);		// old and new in paged allocator
+			Unlock();
+			__DEBUG_RESTORE(newp);
+			__UPDATE_ALLOC_COUNT(aPtr,newp, ++iAllocCount);
+			__UPDATE_TOTAL_ALLOC(newp, oldsize);
+			return newp;
+			}
+		}
+	else
+		{	// current cell in slab iArena
+		TUint32 bm[4];
+		Lock();
+		__SLAB_BFR_CHECK(slab::SlabFor(aPtr), aPtr, bm);
+		Unlock();
+		if ( aSize <= oldsize)
+			return aPtr;
+		if (aMode & ENeverMove)
+			return NULL;		// cannot grow in slab iArena
+		// just use alloc/copy/free...
+		}
+	
+	// fallback to allocate and copy
+	// shouldn't get here if we cannot move the cell
+	//  	__ASSERT(mode == emobile || (mode==efixshrink && size>oldsize));
+	
+	newp = Alloc(aSize - __DEBUG_HDR_SIZE);
+	newp = __GET_DEBUG_DATA_BFR(newp);
+	if (newp)
+		{
+		memcpy(newp, aPtr, oldsize<aSize ? oldsize : aSize);
+		__DEBUG_RESTORE(newp);
+		Free(__GET_USER_DATA_BFR(aPtr));
+		}
+	
+#endif	// __KERNEL_MODE__
+	return newp;
+}
+
+
+TAny* RHybridHeap::ReAlloc(TAny* aPtr, TInt aSize, TInt aMode )
+{
+	
+	aPtr = __GET_DEBUG_DATA_BFR(aPtr);
+	__ALLOC_DEBUG_HEADER(aSize);
+	
+	TAny* retval = ReAllocImpl(aPtr, aSize, aMode);
+	
+	retval = __GET_USER_DATA_BFR(retval);
+	
+#ifdef ENABLE_BTRACE
+	if (iFlags & ETraceAllocs)
+		{
+		if ( retval )
+			{
+			TUint32 traceData[3];
+			traceData[0] = AllocLen(retval);
+			traceData[1] = aSize - __DEBUG_HDR_SIZE;
+			traceData[2] = (TUint32)aPtr;
+			BTraceContextN(BTrace::EHeap, BTrace::EHeapReAlloc,(TUint32)this, (TUint32)retval, traceData, sizeof(traceData));
+			}
+  		else
+  		    BTraceContext12(BTrace::EHeap, BTrace::EHeapReAllocFail, (TUint32)this, (TUint32)aPtr, (TUint32)(aSize - __DEBUG_HDR_SIZE));
+		}
+#endif
+	return retval;
+}
+
+#ifndef __KERNEL_MODE__
+TInt RHybridHeap::Available(TInt& aBiggestBlock) const
+/**
+Gets the total free space currently available on the heap and the space
+available in the largest free block.
+
+Note that this function exists mainly for compatibility reasons.  In a modern
+heap implementation such as that present in Symbian it is not appropriate to
+concern oneself with details such as the amount of free memory available on a
+heap and its largeset free block, because the way that a modern heap implmentation
+works is not simple.  The amount of available virtual memory != physical memory
+and there are multiple allocation strategies used internally, which makes all
+memory usage figures "fuzzy" at best.
+
+In short, if you want to see if there is enough memory available to allocate a
+block of memory, call Alloc() and if it succeeds then there is enough memory!
+Messing around with functions like this is somewhat pointless with modern heap
+allocators.
+
+@param aBiggestBlock On return, contains the space available in the largest
+                     free block on the heap.  Due to the internals of modern
+                     heap implementations, you can probably still allocate a
+                     block larger than this!
+
+@return The total free space currently available on the heap.  Again, you can
+        probably still allocate more than this!
+*/
+{
+	struct HeapInfo info;
+	Lock();
+	TInt Biggest  = GetInfo(&info);
+	aBiggestBlock = __GET_AVAIL_BLOCK_SIZE(Biggest);
+	Unlock();
+	return __GET_AVAIL_BLOCK_SIZE(info.iFreeBytes);
+	
+}
+
+TInt RHybridHeap::AllocSize(TInt& aTotalAllocSize) const
+   /**
+   Gets the number of cells allocated on this heap, and the total space 
+   allocated to them.
+   
+   @param aTotalAllocSize On return, contains the total space allocated
+   to the cells.
+   
+   @return The number of cells allocated on this heap.
+*/   
+{
+	struct HeapInfo info;
+	Lock();
+	GetInfo(&info);
+	aTotalAllocSize = info.iAllocBytes - __REMOVE_DBG_HDR(info.iAllocN);
+	Unlock();
+	return info.iAllocN;
+}
+
+#endif
+
+TInt RHybridHeap::Extension_(TUint /* aExtensionId */, TAny*& /* a0 */, TAny* /* a1 */)
+{
+	return KErrNotSupported;
+}
+
+
+
+///////////////////////////////////////////////////////////////////////////////
+// imported from dla.cpp
+///////////////////////////////////////////////////////////////////////////////
+
+//#include <unistd.h>
+//#define DEBUG_REALLOC
+#ifdef DEBUG_REALLOC
+#include <e32debug.h>
+#endif
+
+inline void RHybridHeap::InitBins(mstate m)
+{
+	/* Establish circular links for iSmallBins */
+	bindex_t i;
+	for (i = 0; i < NSMALLBINS; ++i) {
+		sbinptr bin = SMALLBIN_AT(m,i);
+		bin->iFd = bin->iBk = bin;
+		}
+	}
+/* ---------------------------- malloc support --------------------------- */
+
+/* allocate a large request from the best fitting chunk in a treebin */
+void* RHybridHeap::TmallocLarge(mstate m, size_t nb) {
+	tchunkptr v = 0;
+	size_t rsize = -nb; /* Unsigned negation */
+	tchunkptr t;
+	bindex_t idx;
+	ComputeTreeIndex(nb, idx);
+	
+	if ((t = *TREEBIN_AT(m, idx)) != 0)
+		{
+		/* Traverse tree for this bin looking for node with size == nb */
+		size_t sizebits = nb << LEFTSHIFT_FOR_TREE_INDEX(idx);
+		tchunkptr rst = 0;  /* The deepest untaken right subtree */
+		for (;;)
+			{
+			tchunkptr rt;
+			size_t trem = CHUNKSIZE(t) - nb;
+			if (trem < rsize)
+				{
+				v = t;
+				if ((rsize = trem) == 0)
+					break;
+				}
+			rt = t->iChild[1];
+			t = t->iChild[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1];
+			if (rt != 0 && rt != t)
+				rst = rt;
+			if (t == 0)
+				{
+				t = rst; /* set t to least subtree holding sizes > nb */
+				break;
+				}
+			sizebits <<= 1;
+			}
+		}
+	if (t == 0 && v == 0)
+		{ /* set t to root of next non-empty treebin */
+		binmap_t leftbits = LEFT_BITS(IDX2BIT(idx)) & m->iTreeMap;
+		if (leftbits != 0)
+			{
+			bindex_t i;
+			binmap_t leastbit = LEAST_BIT(leftbits);
+			ComputeBit2idx(leastbit, i);
+			t = *TREEBIN_AT(m, i);
+			}
+		}
+	while (t != 0)
+		{ /* Find smallest of tree or subtree */
+		size_t trem = CHUNKSIZE(t) - nb;
+		if (trem < rsize) {
+			rsize = trem;
+			v = t;
+			}
+		t = LEFTMOST_CHILD(t);
+		}
+	/*  If iDv is a better fit, return 0 so malloc will use it */
+	if (v != 0 && rsize < (size_t)(m->iDvSize - nb))
+		{
+		if (RTCHECK(OK_ADDRESS(m, v)))
+			{ /* split */
+			mchunkptr r = CHUNK_PLUS_OFFSET(v, nb);
+			HEAP_ASSERT(CHUNKSIZE(v) == rsize + nb);
+			if (RTCHECK(OK_NEXT(v, r)))
+				{
+				UnlinkLargeChunk(m, v);
+				if (rsize < MIN_CHUNK_SIZE)
+					SET_INUSE_AND_PINUSE(m, v, (rsize + nb));
+				else
+					{
+					SET_SIZE_AND_PINUSE_OF_INUSE_CHUNK(m, v, nb);
+					SET_SIZE_AND_PINUSE_OF_FREE_CHUNK(r, rsize);
+					InsertChunk(m, r, rsize);
+					}
+				return CHUNK2MEM(v);
+				}
+			}
+		//    CORRUPTION_ERROR_ACTION(m);
+		}
+	return 0;
+	}
+
+/* allocate a small request from the best fitting chunk in a treebin */
+void* RHybridHeap::TmallocSmall(mstate m, size_t nb)
+{
+	tchunkptr t, v;
+	size_t rsize;
+	bindex_t i;
+	binmap_t leastbit = LEAST_BIT(m->iTreeMap);
+	ComputeBit2idx(leastbit, i);
+	
+	v = t = *TREEBIN_AT(m, i);
+	rsize = CHUNKSIZE(t) - nb;
+	
+	while ((t = LEFTMOST_CHILD(t)) != 0)
+		{
+		size_t trem = CHUNKSIZE(t) - nb;
+		if (trem < rsize)
+			{
+			rsize = trem;
+			v = t;
+			}
+		}
+	
+	if (RTCHECK(OK_ADDRESS(m, v)))
+		{
+		mchunkptr r = CHUNK_PLUS_OFFSET(v, nb);
+		HEAP_ASSERT(CHUNKSIZE(v) == rsize + nb);
+		if (RTCHECK(OK_NEXT(v, r)))
+			{
+			UnlinkLargeChunk(m, v);
+			if (rsize < MIN_CHUNK_SIZE)
+				SET_INUSE_AND_PINUSE(m, v, (rsize + nb));
+			else
+				{
+				SET_SIZE_AND_PINUSE_OF_INUSE_CHUNK(m, v, nb);
+				SET_SIZE_AND_PINUSE_OF_FREE_CHUNK(r, rsize);
+				ReplaceDv(m, r, rsize);
+				}
+			return CHUNK2MEM(v);
+			}
+		}
+	//  CORRUPTION_ERROR_ACTION(m);
+	//  return 0;
+	}
+
+inline void RHybridHeap::InitTop(mstate m, mchunkptr p, size_t psize)
+{
+	/* Ensure alignment */
+	size_t offset = ALIGN_OFFSET(CHUNK2MEM(p));
+	p = (mchunkptr)((TUint8*)p + offset);
+	psize -= offset;
+	m->iTop = p;
+	m->iTopSize = psize;
+	p->iHead = psize | PINUSE_BIT;
+	/* set size of fake trailing chunk holding overhead space only once */
+	mchunkptr chunkPlusOff = CHUNK_PLUS_OFFSET(p, psize);
+	chunkPlusOff->iHead = TOP_FOOT_SIZE;
+	m->iTrimCheck = KHeapShrinkHysRatio*(iGrowBy>>8);
+}
+
+
+/* Unlink the first chunk from a smallbin */
+inline void RHybridHeap::UnlinkFirstSmallChunk(mstate M,mchunkptr B,mchunkptr P,bindex_t& I)
+{
+	mchunkptr F = P->iFd;
+	HEAP_ASSERT(P != B);
+	HEAP_ASSERT(P != F);
+	HEAP_ASSERT(CHUNKSIZE(P) == SMALL_INDEX2SIZE(I));
+	if (B == F)
+		CLEAR_SMALLMAP(M, I);
+	else if (RTCHECK(OK_ADDRESS(M, F)))
+		{
+		B->iFd = F;
+		F->iBk = B;
+		}
+	else
+		{
+		CORRUPTION_ERROR_ACTION(M);
+		}
+}
+/* Link a free chunk into a smallbin  */
+inline void RHybridHeap::InsertSmallChunk(mstate M,mchunkptr P, size_t S)
+{
+	bindex_t I  = SMALL_INDEX(S);
+	mchunkptr B = SMALLBIN_AT(M, I);
+	mchunkptr F = B;
+	HEAP_ASSERT(S >= MIN_CHUNK_SIZE);
+	if (!SMALLMAP_IS_MARKED(M, I))
+		MARK_SMALLMAP(M, I);
+	else if (RTCHECK(OK_ADDRESS(M, B->iFd)))
+		F = B->iFd;
+	else
+		{
+		CORRUPTION_ERROR_ACTION(M);
+		}
+	B->iFd = P;
+	F->iBk = P;
+	P->iFd = F;
+	P->iBk = B;
+}
+
+
+inline void RHybridHeap::InsertChunk(mstate M,mchunkptr P,size_t S)
+{
+	if (IS_SMALL(S))
+		InsertSmallChunk(M, P, S);
+	else
+		{
+		tchunkptr TP = (tchunkptr)(P); InsertLargeChunk(M, TP, S);
+		}
+}
+
+inline void RHybridHeap::UnlinkLargeChunk(mstate M,tchunkptr X)
+{
+	tchunkptr XP = X->iParent;
+	tchunkptr R;
+	if (X->iBk != X)
+		{
+		tchunkptr F = X->iFd;
+		R = X->iBk;
+		if (RTCHECK(OK_ADDRESS(M, F)))
+			{
+			F->iBk = R;
+			R->iFd = F;
+			}
+		else
+			{
+			CORRUPTION_ERROR_ACTION(M);
+			}
+		}
+	else
+		{
+		tchunkptr* RP;
+		if (((R = *(RP = &(X->iChild[1]))) != 0) ||
+			  ((R = *(RP = &(X->iChild[0]))) != 0))
+			{
+			tchunkptr* CP;
+			while ((*(CP = &(R->iChild[1])) != 0) ||
+				   (*(CP = &(R->iChild[0])) != 0))
+				{
+				R = *(RP = CP);
+				}
+			if (RTCHECK(OK_ADDRESS(M, RP)))
+				*RP = 0;
+			else
+				{
+				CORRUPTION_ERROR_ACTION(M);
+				}
+			}
+		}
+	if (XP != 0)
+		{
+		tbinptr* H = TREEBIN_AT(M, X->iIndex);
+		if (X == *H)
+			{
+			if ((*H = R) == 0)
+				CLEAR_TREEMAP(M, X->iIndex);
+			}
+		else if (RTCHECK(OK_ADDRESS(M, XP)))
+			{
+			if (XP->iChild[0] == X)
+				XP->iChild[0] = R;
+			else
+				XP->iChild[1] = R;
+			}
+		else
+			CORRUPTION_ERROR_ACTION(M);
+		if (R != 0)
+			{
+			if (RTCHECK(OK_ADDRESS(M, R)))
+				{
+				tchunkptr C0, C1;
+				R->iParent = XP;
+				if ((C0 = X->iChild[0]) != 0)
+					{
+					if (RTCHECK(OK_ADDRESS(M, C0)))
+						{
+						R->iChild[0] = C0;
+						C0->iParent = R;
+						}
+					else
+						CORRUPTION_ERROR_ACTION(M);
+					}
+				if ((C1 = X->iChild[1]) != 0)
+					{
+					if (RTCHECK(OK_ADDRESS(M, C1)))
+						{
+						R->iChild[1] = C1;
+						C1->iParent = R;
+						}
+					else
+						CORRUPTION_ERROR_ACTION(M);
+					}
+				}
+			else
+				CORRUPTION_ERROR_ACTION(M);
+			}
+		}
+}
+
+/* Unlink a chunk from a smallbin  */
+inline void RHybridHeap::UnlinkSmallChunk(mstate M, mchunkptr P,size_t S)
+{
+	mchunkptr F = P->iFd;
+	mchunkptr B = P->iBk;
+	bindex_t I = SMALL_INDEX(S);
+	HEAP_ASSERT(P != B);
+	HEAP_ASSERT(P != F);
+	HEAP_ASSERT(CHUNKSIZE(P) == SMALL_INDEX2SIZE(I));
+	if (F == B)
+		CLEAR_SMALLMAP(M, I);
+	else if (RTCHECK((F == SMALLBIN_AT(M,I) || OK_ADDRESS(M, F)) &&
+					 (B == SMALLBIN_AT(M,I) || OK_ADDRESS(M, B))))
+		{
+		F->iBk = B;
+		B->iFd = F;
+		}
+	else
+		{
+		CORRUPTION_ERROR_ACTION(M);
+		}
+}
+
+inline void RHybridHeap::UnlinkChunk(mstate M, mchunkptr P, size_t S)
+{
+	if (IS_SMALL(S))
+		UnlinkSmallChunk(M, P, S);
+	else
+		{
+		tchunkptr TP = (tchunkptr)(P); UnlinkLargeChunk(M, TP);
+		}
+}
+
+// For DL debug functions
+void RHybridHeap::DoComputeTreeIndex(size_t S, bindex_t& I)
+{
+	ComputeTreeIndex(S, I);
+}	
+
+inline void RHybridHeap::ComputeTreeIndex(size_t S, bindex_t& I)
+{
+	size_t X = S >> TREEBIN_SHIFT;
+	if (X == 0)
+		I = 0;
+	else if (X > 0xFFFF)
+		I = NTREEBINS-1;
+	else
+		{
+		unsigned int Y = (unsigned int)X;
+		unsigned int N = ((Y - 0x100) >> 16) & 8;
+		unsigned int K = (((Y <<= N) - 0x1000) >> 16) & 4;
+		N += K;
+		N += K = (((Y <<= K) - 0x4000) >> 16) & 2;
+		K = 14 - N + ((Y <<= K) >> 15);
+		I = (K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1));
+		}
+}
+
+/* ------------------------- Operations on trees ------------------------- */
+
+/* Insert chunk into tree */
+inline void RHybridHeap::InsertLargeChunk(mstate M,tchunkptr X,size_t S)
+{
+	tbinptr* H;
+	bindex_t I;
+	ComputeTreeIndex(S, I);
+	H = TREEBIN_AT(M, I);
+	X->iIndex = I;
+	X->iChild[0] = X->iChild[1] = 0;
+	if (!TREEMAP_IS_MARKED(M, I))
+		{
+		MARK_TREEMAP(M, I);
+		*H = X;
+		X->iParent = (tchunkptr)H;
+		X->iFd = X->iBk = X;
+		}
+	else
+		{
+		tchunkptr T = *H;
+		size_t K = S << LEFTSHIFT_FOR_TREE_INDEX(I);
+		for (;;)
+			{
+			if (CHUNKSIZE(T) != S) {
+				tchunkptr* C = &(T->iChild[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);
+				K <<= 1;
+				if (*C != 0)
+					T = *C;
+				else if (RTCHECK(OK_ADDRESS(M, C)))
+					{
+					*C = X;
+					X->iParent = T;
+					X->iFd = X->iBk = X;
+					break;
+					}
+				else
+					{
+					CORRUPTION_ERROR_ACTION(M);
+					break;
+					}
+				}
+			else
+				{
+				tchunkptr F = T->iFd;
+				if (RTCHECK(OK_ADDRESS(M, T) && OK_ADDRESS(M, F)))
+					{
+					T->iFd = F->iBk = X;
+					X->iFd = F;
+					X->iBk = T;
+					X->iParent = 0;
+					break;
+					}
+				else
+					{
+					CORRUPTION_ERROR_ACTION(M);
+					break;
+					}
+				}
+			}
+		}
+}
+
+/*
+Unlink steps:
+
+1. If x is a chained node, unlink it from its same-sized iFd/iBk links
+and choose its iBk node as its replacement.
+2. If x was the last node of its size, but not a leaf node, it must
+be replaced with a leaf node (not merely one with an open left or
+right), to make sure that lefts and rights of descendents
+correspond properly to bit masks.  We use the rightmost descendent
+of x.  We could use any other leaf, but this is easy to locate and
+tends to counteract removal of leftmosts elsewhere, and so keeps
+paths shorter than minimally guaranteed.  This doesn't loop much
+because on average a node in a tree is near the bottom.
+3. If x is the base of a chain (i.e., has iParent links) relink
+x's iParent and children to x's replacement (or null if none).
+*/
+
+/* Replace iDv node, binning the old one */
+/* Used only when iDvSize known to be small */
+inline void RHybridHeap::ReplaceDv(mstate M, mchunkptr P, size_t S)
+{
+	size_t DVS = M->iDvSize;
+	if (DVS != 0)
+		{
+		mchunkptr DV = M->iDv;
+		HEAP_ASSERT(IS_SMALL(DVS));
+		InsertSmallChunk(M, DV, DVS);
+		}
+	M->iDvSize = S;
+	M->iDv = P;
+}
+
+
+inline void RHybridHeap::ComputeBit2idx(binmap_t X,bindex_t& I)
+{
+	unsigned int Y = X - 1;
+	unsigned int K = Y >> (16-4) & 16;
+	unsigned int N = K;        Y >>= K;
+	N += K = Y >> (8-3) &  8;  Y >>= K;
+	N += K = Y >> (4-2) &  4;  Y >>= K;
+	N += K = Y >> (2-1) &  2;  Y >>= K;
+	N += K = Y >> (1-0) &  1;  Y >>= K;
+	I = (bindex_t)(N + Y);
+}
+
+
+
+int RHybridHeap::SysTrim(mstate m, size_t pad)
+{
+	size_t extra = 0;
+	
+	if ( IS_INITIALIZED(m) )
+		{
+		pad += TOP_FOOT_SIZE; /* ensure enough room for segment overhead */
+		
+		if (m->iTopSize > pad)
+			{
+			extra = Floor(m->iTopSize - pad, iPageSize);
+			if ( (m->iSeg.iSize - extra) < (iMinLength - sizeof(*this)) )			  
+				{
+				if ( m->iSeg.iSize > (iMinLength - sizeof(*this)) )				  
+					extra = Floor(m->iSeg.iSize - (iMinLength - sizeof(*this)), iPageSize); /* do not shrink heap below min length */
+				else extra = 0;
+				}
+			
+			if ( extra )
+				{
+				Unmap(m->iSeg.iBase + m->iSeg.iSize - extra, extra);
+				
+				m->iSeg.iSize -= extra;
+				InitTop(m, m->iTop, m->iTopSize - extra);
+				CHECK_TOP_CHUNK(m, m->iTop);
+				}
+			}
+		
+		}
+	
+	return extra;
+}
+
+/* Get memory from system using MORECORE */
+
+void* RHybridHeap::SysAlloc(mstate m, size_t nb)
+{
+	HEAP_ASSERT(m->iTop);
+	/* Subtract out existing available iTop space from MORECORE request. */
+//	size_t asize = _ALIGN_UP(nb - m->iTopSize + TOP_FOOT_SIZE + SIZE_T_ONE, iGrowBy);  
+  	TInt asize = _ALIGN_UP(nb - m->iTopSize + SYS_ALLOC_PADDING, iGrowBy);  // From DLA version 2.8.4
+	
+	char* br = (char*)Map(m->iSeg.iBase+m->iSeg.iSize, asize);
+	if (!br)
+		return 0;
+	HEAP_ASSERT(br == (char*)m->iSeg.iBase+m->iSeg.iSize);
+	
+	/* Merge with an existing segment */
+	m->iSeg.iSize += asize;
+	InitTop(m, m->iTop, m->iTopSize + asize);
+	
+	if (nb < m->iTopSize)
+		{ /* Allocate from new or extended iTop space */
+		size_t rsize = m->iTopSize -= nb;
+		mchunkptr p = m->iTop;
+		mchunkptr r = m->iTop = CHUNK_PLUS_OFFSET(p, nb);
+		r->iHead = rsize | PINUSE_BIT;
+		SET_SIZE_AND_PINUSE_OF_INUSE_CHUNK(m, p, nb);
+		CHECK_TOP_CHUNK(m, m->iTop);
+		CHECK_MALLOCED_CHUNK(m, CHUNK2MEM(p), nb);
+		return CHUNK2MEM(p);
+		}
+	
+	return 0;
+}	
+
+
+void RHybridHeap::InitDlMalloc(size_t capacity, int /*locked*/)
+{
+	memset(GM,0,sizeof(malloc_state));
+	// The maximum amount that can be allocated can be calculated as:-
+	// 2^sizeof(size_t) - sizeof(malloc_state) - TOP_FOOT_SIZE - page Size(all accordingly padded)
+	// If the capacity exceeds this, no allocation will be done.
+	GM->iSeg.iBase = iBase;
+	GM->iSeg.iSize = capacity;
+	InitBins(GM);
+	InitTop(GM, (mchunkptr)iBase, capacity - TOP_FOOT_SIZE);
+}
+
+void* RHybridHeap::DlMalloc(size_t bytes) 
+{
+	/*
+	Basic algorithm:
+	If a small request (< 256 bytes minus per-chunk overhead):
+	1. If one exists, use a remainderless chunk in associated smallbin.
+	(Remainderless means that there are too few excess bytes to
+	represent as a chunk.)
+	2. If it is big enough, use the iDv chunk, which is normally the
+	chunk adjacent to the one used for the most recent small request.
+	3. If one exists, split the smallest available chunk in a bin,
+	saving remainder in iDv.
+	4. If it is big enough, use the iTop chunk.
+	5. If available, get memory from system and use it
+	Otherwise, for a large request:
+	1. Find the smallest available binned chunk that fits, and use it
+	if it is better fitting than iDv chunk, splitting if necessary.
+	2. If better fitting than any binned chunk, use the iDv chunk.
+	3. If it is big enough, use the iTop chunk.
+	4. If request size >= mmap threshold, try to directly mmap this chunk.
+	5. If available, get memory from system and use it
+*/
+	void* mem;
+	size_t nb;
+	if (bytes <= MAX_SMALL_REQUEST)
+		{
+		bindex_t idx;
+		binmap_t smallbits;
+		nb = (bytes < MIN_REQUEST)? MIN_CHUNK_SIZE : PAD_REQUEST(bytes);
+		idx = SMALL_INDEX(nb);
+		smallbits = GM->iSmallMap >> idx;
+		
+		if ((smallbits & 0x3U) != 0)
+			{ /* Remainderless fit to a smallbin. */
+			mchunkptr b, p;
+			idx += ~smallbits & 1;			 /* Uses next bin if idx empty */
+			b = SMALLBIN_AT(GM, idx);
+			p = b->iFd;
+			HEAP_ASSERT(CHUNKSIZE(p) == SMALL_INDEX2SIZE(idx));
+			UnlinkFirstSmallChunk(GM, b, p, idx);
+			SET_INUSE_AND_PINUSE(GM, p, SMALL_INDEX2SIZE(idx));
+			mem = CHUNK2MEM(p);
+			CHECK_MALLOCED_CHUNK(GM, mem, nb);
+			return mem;
+			}
+		
+		else if (nb > GM->iDvSize)
+			{
+			if (smallbits != 0)
+				{ /* Use chunk in next nonempty smallbin */
+				mchunkptr b, p, r;
+				size_t rsize;
+				bindex_t i;
+				binmap_t leftbits = (smallbits << idx) & LEFT_BITS(IDX2BIT(idx));
+				binmap_t leastbit = LEAST_BIT(leftbits);
+				ComputeBit2idx(leastbit, i);
+				b = SMALLBIN_AT(GM, i);
+				p = b->iFd;
+				HEAP_ASSERT(CHUNKSIZE(p) == SMALL_INDEX2SIZE(i));
+				UnlinkFirstSmallChunk(GM, b, p, i);
+				rsize = SMALL_INDEX2SIZE(i) - nb;
+				/* Fit here cannot be remainderless if 4byte sizes */
+				if (SIZE_T_SIZE != 4 && rsize < MIN_CHUNK_SIZE)
+					SET_INUSE_AND_PINUSE(GM, p, SMALL_INDEX2SIZE(i));
+				else
+					{
+					SET_SIZE_AND_PINUSE_OF_INUSE_CHUNK(GM, p, nb);
+					r = CHUNK_PLUS_OFFSET(p, nb);
+					SET_SIZE_AND_PINUSE_OF_FREE_CHUNK(r, rsize);
+					ReplaceDv(GM, r, rsize);
+					}
+				mem = CHUNK2MEM(p);
+				CHECK_MALLOCED_CHUNK(GM, mem, nb);
+				return mem;
+				}
+			
+			else if (GM->iTreeMap != 0 && (mem = TmallocSmall(GM, nb)) != 0)
+				{
+				CHECK_MALLOCED_CHUNK(GM, mem, nb);
+				return mem;
+				}
+			}
+		}
+	else if (bytes >= MAX_REQUEST)
+		nb = MAX_SIZE_T; /* Too big to allocate. Force failure (in sys alloc) */
+	else
+		{
+		nb = PAD_REQUEST(bytes);
+		if (GM->iTreeMap != 0 && (mem = TmallocLarge(GM, nb)) != 0)
+			{
+			CHECK_MALLOCED_CHUNK(GM, mem, nb);
+			return mem;
+			}
+		}
+	
+	if (nb <= GM->iDvSize)
+		{
+		size_t rsize = GM->iDvSize - nb;
+		mchunkptr p = GM->iDv;
+		if (rsize >= MIN_CHUNK_SIZE)
+			{ /* split iDv */
+			mchunkptr r = GM->iDv = CHUNK_PLUS_OFFSET(p, nb);
+			GM->iDvSize = rsize;
+			SET_SIZE_AND_PINUSE_OF_FREE_CHUNK(r, rsize);
+			SET_SIZE_AND_PINUSE_OF_INUSE_CHUNK(GM, p, nb);
+			}
+		else
+			{ /* exhaust iDv */
+			size_t dvs = GM->iDvSize;
+			GM->iDvSize = 0;
+			GM->iDv = 0;
+			SET_INUSE_AND_PINUSE(GM, p, dvs);
+			}
+		mem = CHUNK2MEM(p);
+		CHECK_MALLOCED_CHUNK(GM, mem, nb);
+		return mem;
+		}
+	
+	else if (nb < GM->iTopSize)
+		{ /* Split iTop */
+		size_t rsize = GM->iTopSize -= nb;
+		mchunkptr p = GM->iTop;
+		mchunkptr r = GM->iTop = CHUNK_PLUS_OFFSET(p, nb);
+		r->iHead = rsize | PINUSE_BIT;
+		SET_SIZE_AND_PINUSE_OF_INUSE_CHUNK(GM, p, nb);
+		mem = CHUNK2MEM(p);
+		CHECK_TOP_CHUNK(GM, GM->iTop);
+		CHECK_MALLOCED_CHUNK(GM, mem, nb);
+		return mem;
+		}
+	
+	return SysAlloc(GM, nb);
+}
+
+
+void RHybridHeap::DlFree(void* mem)
+{
+	/*
+	Consolidate freed chunks with preceeding or succeeding bordering
+	free chunks, if they exist, and then place in a bin.	Intermixed
+	with special cases for iTop, iDv, mmapped chunks, and usage errors.
+*/
+	mchunkptr p	= MEM2CHUNK(mem);
+	CHECK_INUSE_CHUNK(GM, p);
+	if (RTCHECK(OK_ADDRESS(GM, p) && OK_CINUSE(p)))
+		{
+		size_t psize = CHUNKSIZE(p);
+		mchunkptr next = CHUNK_PLUS_OFFSET(p, psize);
+		if (!PINUSE(p))
+			{
+			size_t prevsize = p->iPrevFoot;
+			mchunkptr prev = CHUNK_MINUS_OFFSET(p, prevsize);
+			psize += prevsize;
+			p = prev;
+			if (RTCHECK(OK_ADDRESS(GM, prev)))
+				{ /* consolidate backward */
+				if (p != GM->iDv)
+					{
+					UnlinkChunk(GM, p, prevsize);
+					}
+				else if ((next->iHead & INUSE_BITS) == INUSE_BITS)
+					{
+					GM->iDvSize = psize;
+					SET_FREE_WITH_PINUSE(p, psize, next);
+					return;
+					}
+				}
+			else
+				{
+				USAGE_ERROR_ACTION(GM, p);
+				return;
+				}
+			}
+		
+		if (RTCHECK(OK_NEXT(p, next) && OK_PINUSE(next)))
+			{
+			if (!CINUSE(next))
+				{	/* consolidate forward */
+				if (next == GM->iTop)
+					{
+					size_t tsize = GM->iTopSize += psize;
+					GM->iTop = p;
+					p->iHead = tsize | PINUSE_BIT;
+					if (p == GM->iDv)
+						{
+						GM->iDv = 0;
+						GM->iDvSize = 0;
+						}
+					if ( !IS_FIXED_HEAP && SHOULD_TRIM(GM, tsize)  )					
+						SysTrim(GM, 0);
+					return;
+					}
+				else if (next == GM->iDv)
+					{
+					size_t dsize = GM->iDvSize += psize;
+					GM->iDv = p;
+					SET_SIZE_AND_PINUSE_OF_FREE_CHUNK(p, dsize);
+					return;
+					}
+				else
+					{
+					size_t nsize = CHUNKSIZE(next);
+					psize += nsize;
+					UnlinkChunk(GM, next, nsize);
+					SET_SIZE_AND_PINUSE_OF_FREE_CHUNK(p, psize);
+					if (p == GM->iDv)
+						{
+						GM->iDvSize = psize;
+						return;
+						}
+					}
+				}
+			else
+				SET_FREE_WITH_PINUSE(p, psize, next);
+			InsertChunk(GM, p, psize);
+			CHECK_FREE_CHUNK(GM, p);
+			return;
+			}
+		}
+}
+
+
+void* RHybridHeap::DlRealloc(void* oldmem, size_t bytes, TInt mode)
+{
+	mchunkptr oldp = MEM2CHUNK(oldmem);
+	size_t oldsize = CHUNKSIZE(oldp);
+	mchunkptr next = CHUNK_PLUS_OFFSET(oldp, oldsize);
+	mchunkptr newp = 0;
+	void* extra = 0;
+	
+	/* Try to either shrink or extend into iTop. Else malloc-copy-free */
+	
+	if (RTCHECK(OK_ADDRESS(GM, oldp) && OK_CINUSE(oldp) &&
+				OK_NEXT(oldp, next) && OK_PINUSE(next)))
+		{
+		size_t nb = REQUEST2SIZE(bytes);
+		if (oldsize >= nb) { /* already big enough */
+			size_t rsize = oldsize - nb;
+			newp = oldp;
+			if (rsize >= MIN_CHUNK_SIZE)
+				{     
+				mchunkptr remainder = CHUNK_PLUS_OFFSET(newp, nb);
+				SET_INUSE(GM, newp, nb);
+//				SET_INUSE(GM, remainder, rsize);
+ 				SET_INUSE_AND_PINUSE(GM, remainder, rsize);  // corrected in original DLA version V2.8.4
+				extra = CHUNK2MEM(remainder);
+				}
+			}
+		else if (next == GM->iTop && oldsize + GM->iTopSize > nb)
+			{
+			/* Expand into iTop */
+			size_t newsize = oldsize + GM->iTopSize;
+			size_t newtopsize = newsize - nb;
+			mchunkptr newtop = CHUNK_PLUS_OFFSET(oldp, nb);
+			SET_INUSE(GM, oldp, nb);
+			newtop->iHead = newtopsize |PINUSE_BIT;
+			GM->iTop = newtop;
+			GM->iTopSize = newtopsize;
+			newp = oldp;
+			}
+		}
+	else
+		{
+		USAGE_ERROR_ACTION(GM, oldmem);
+		}
+	
+	if (newp != 0)
+		{
+		if (extra != 0)
+			{
+			DlFree(extra);
+			}
+		CHECK_INUSE_CHUNK(GM, newp);
+		return CHUNK2MEM(newp);
+		}
+	else
+		{
+		if ( mode & ENeverMove )
+			return 0;		// cannot move
+		void* newmem = DlMalloc(bytes);
+		if (newmem != 0)
+			{
+			size_t oc = oldsize - OVERHEAD_FOR(oldp);
+			memcpy(newmem, oldmem, (oc < bytes)? oc : bytes);
+			DlFree(oldmem);
+			}
+		return newmem;
+		}
+	//	return 0;
+}
+
+size_t RHybridHeap::DlInfo(struct HeapInfo* i, SWalkInfo* wi) const
+{
+	TInt max = ((GM->iTopSize-1) & ~CHUNK_ALIGN_MASK) - CHUNK_OVERHEAD;
+	if ( max < 0 )
+		max = 0;
+	else ++i->iFreeN;			// iTop always free
+	i->iFreeBytes += max;
+	
+	Walk(wi, GM->iTop, max, EGoodFreeCell, EDougLeaAllocator); // Introduce DL iTop buffer to the walk function 
+	
+	for (mchunkptr q = ALIGN_AS_CHUNK(GM->iSeg.iBase); q != GM->iTop; q = NEXT_CHUNK(q))
+		{
+		TInt sz = CHUNKSIZE(q);
+		if (!CINUSE(q))
+			{
+			if ( sz > max )
+				max = sz;
+			i->iFreeBytes += sz;
+			++i->iFreeN;
+			Walk(wi, CHUNK2MEM(q), sz, EGoodFreeCell, EDougLeaAllocator); // Introduce DL free buffer to the walk function 
+			}
+		else
+			{
+			i->iAllocBytes += sz - CHUNK_OVERHEAD;
+			++i->iAllocN;
+			Walk(wi, CHUNK2MEM(q), (sz- CHUNK_OVERHEAD), EGoodAllocatedCell, EDougLeaAllocator); // Introduce DL allocated buffer to the walk function 
+			}
+		}
+	return max;  // return largest available chunk size
+}
+
+//
+// get statistics about the state of the allocator
+//
+TInt RHybridHeap::GetInfo(struct HeapInfo* i, SWalkInfo* wi) const
+{
+	memset(i,0,sizeof(HeapInfo));
+	i->iFootprint = iChunkSize;
+	i->iMaxSize = iMaxLength;
+#ifndef __KERNEL_MODE__		
+	PagedInfo(i, wi);
+	SlabInfo(i, wi);
+#endif	
+	return DlInfo(i,wi);
+}
+
+//
+// Methods to commit/decommit memory pages from chunk
+//
+
+
+void* RHybridHeap::Map(void* p, TInt sz)
+//
+// allocate pages in the chunk
+// if p is NULL, Find an allocate the required number of pages (which must lie in the lower half)
+// otherwise commit the pages specified
+//
+{
+	HEAP_ASSERT(sz > 0);
+
+	if ( iChunkSize + sz > iMaxLength)
+		return 0;
+
+#ifdef __KERNEL_MODE__
+
+	TInt r = ((DChunk*)iChunkHandle)->Adjust(iChunkSize + iOffset + sz);
+	if (r < 0)
+		return 0;
+
+	iChunkSize += sz;
+	
+#else	
+
+	RChunk chunk;
+	chunk.SetHandle(iChunkHandle);
+	if ( p )
+		{
+		TInt r;
+		if ( iUseAdjust )
+			r = chunk.Adjust(iChunkSize + sz);
+		else
+			{
+			HEAP_ASSERT(sz == Ceiling(sz, iPageSize));
+			HEAP_ASSERT(p == Floor(p, iPageSize));
+			r = chunk.Commit(iOffset + PtrDiff(p, this),sz);
+			}			
+		if (r < 0)
+			return 0;
+		}
+	else
+		{
+		TInt r = chunk.Allocate(sz);
+		if (r < 0)
+			return 0;
+		if (r > iOffset)
+			{
+			// can't allow page allocations in DL zone
+			chunk.Decommit(r, sz);
+			return 0;
+			}
+		p = Offset(this, r - iOffset);
+		}
+	iChunkSize += sz;
+	
+	if (iChunkSize >= iSlabInitThreshold)
+		{	// set up slab system now that heap is large enough
+		SlabConfig(iSlabConfigBits);
+		iSlabInitThreshold = KMaxTInt32;
+		}
+
+#endif //	__KERNEL_MODE__
+	
+#ifdef ENABLE_BTRACE
+	if(iChunkSize > iHighWaterMark)
+		{
+		iHighWaterMark = Ceiling(iChunkSize,16*iPageSize);
+		TUint32 traceData[6];
+		traceData[0] = iChunkHandle;
+		traceData[1] = iMinLength;
+		traceData[2] = iMaxLength;
+		traceData[3] = sz;
+		traceData[4] = iChunkSize;
+		traceData[5] = iHighWaterMark;
+		BTraceContextN(BTrace::ETest1, 90, (TUint32)this, 33, traceData, sizeof(traceData));
+		}
+#endif
+
+	return p;
+}
+
+void RHybridHeap::Unmap(void* p, TInt sz)
+{
+	HEAP_ASSERT(sz > 0);
+	
+#ifdef __KERNEL_MODE__
+	
+	(void)p;
+	HEAP_ASSERT(sz == Ceiling(sz, iPageSize));
+#if defined(_DEBUG)		
+	TInt r =
+#endif				
+   ((DChunk*)iChunkHandle)->Adjust(iChunkSize + iOffset - sz);
+	HEAP_ASSERT(r >= 0);
+	
+#else
+
+	RChunk chunk;
+	chunk.SetHandle(iChunkHandle);
+	if ( iUseAdjust )
+		{
+		HEAP_ASSERT(sz == Ceiling(sz, iPageSize));
+#if defined(_DEBUG)		
+		TInt r =
+#endif				
+		chunk.Adjust(iChunkSize - sz);
+		HEAP_ASSERT(r >= 0);		
+		}
+	else
+		{
+		HEAP_ASSERT(sz == Ceiling(sz, iPageSize));
+		HEAP_ASSERT(p == Floor(p, iPageSize));
+#if defined(_DEBUG)		
+		TInt r =
+#endif
+		chunk.Decommit(PtrDiff(p, Offset(this,-iOffset)), sz);
+		HEAP_ASSERT(r >= 0);				
+		}			
+#endif  // __KERNEL_MODE__
+	
+	iChunkSize -= sz;
+}
+
+
+#ifndef __KERNEL_MODE__
+//
+// Slab allocator code
+//
+
+//inline slab* slab::SlabFor(void* p)
+slab* slab::SlabFor( const void* p)
+{
+	return (slab*)(Floor(p, SLABSIZE));
+}
+
+//
+// Remove slab s from its tree/heap (not necessarily the root), preserving the address order
+// invariant of the heap
+//
+void RHybridHeap::TreeRemove(slab* s)
+{
+	slab** r = s->iParent;
+	slab* c1 = s->iChild1;
+	slab* c2 = s->iChild2;
+	for (;;)
+		{
+		if (!c2)
+			{
+			*r = c1;
+			if (c1)
+				c1->iParent = r;
+			return;
+			}
+		if (!c1)
+			{
+			*r = c2;
+			c2->iParent = r;
+			return;
+			}
+		if (c1 > c2)
+			{
+			slab* c3 = c1;
+			c1 = c2;
+			c2 = c3;
+			}
+		slab* newc2 = c1->iChild2;
+		*r = c1;
+		c1->iParent = r;
+		c1->iChild2 = c2;
+		c2->iParent = &c1->iChild2;
+		s = c1;
+		c1 = s->iChild1;
+		c2 = newc2;
+		r = &s->iChild1;
+		}
+}
+//
+// Insert slab s into the tree/heap rooted at r, preserving the address ordering
+// invariant of the heap
+//
+void RHybridHeap::TreeInsert(slab* s,slab** r)
+{
+	slab* n = *r;
+	for (;;)
+		{
+		if (!n)
+			{	// tree empty
+			*r = s;
+			s->iParent = r;
+			s->iChild1 = s->iChild2 = 0;
+			break;
+			}
+		if (s < n)
+			{	// insert between iParent and n
+			*r = s;
+			s->iParent = r;
+			s->iChild1 = n;
+			s->iChild2 = 0;
+			n->iParent = &s->iChild1;
+			break;
+			}
+		slab* c1 = n->iChild1;
+		slab* c2 = n->iChild2;
+		if ((c1 - 1) > (c2 - 1))
+			{
+			r = &n->iChild1;
+			n = c1;
+			}
+		else
+			{
+			r = &n->iChild2;
+			n = c2;
+			}
+		}
+}
+
+void* RHybridHeap::AllocNewSlab(slabset& allocator)
+//
+// Acquire and initialise a new slab, returning a cell from the slab
+// The strategy is:
+// 1. Use the lowest address free slab, if available. This is done by using the lowest slab
+//    in the page at the root of the iPartialPage heap (which is address ordered). If the
+//    is now fully used, remove it from the iPartialPage heap.
+// 2. Allocate a new page for iSlabs if no empty iSlabs are available
+//
+{
+	page* p = page::PageFor(iPartialPage);
+	if (!p)
+		return AllocNewPage(allocator);
+	
+	unsigned h = p->iSlabs[0].iHeader;
+	unsigned pagemap = SlabHeaderPagemap(h);
+	HEAP_ASSERT(&p->iSlabs[HIBIT(pagemap)] == iPartialPage);
+	
+	unsigned slabix = LOWBIT(pagemap);
+	p->iSlabs[0].iHeader = h &~ (0x100<<slabix);
+	if (!(pagemap &~ (1<<slabix)))
+		{
+		TreeRemove(iPartialPage);	// last free slab in page
+		}
+	
+	return InitNewSlab(allocator, &p->iSlabs[slabix]);
+}
+
+/**Defination of this functionis not there in proto code***/
+#if 0
+void RHybridHeap::partial_insert(slab* s)
+{
+	// slab has had first cell freed and needs to be linked back into iPartial tree
+	slabset& ss = iSlabAlloc[iSizeMap[s->clz]];
+	
+	HEAP_ASSERT(s->used == slabfull);
+	s->used = ss.fulluse - s->clz;		// full-1 loading
+	TreeInsert(s,&ss.iPartial);
+	CHECKTREE(&ss.iPartial);
+}
+/**Defination of this functionis not there in proto code***/
+#endif
+
+void* RHybridHeap::AllocNewPage(slabset& allocator)
+//
+// Acquire and initialise a new page, returning a cell from a new slab
+// The iPartialPage tree is empty (otherwise we'd have used a slab from there)
+// The iPartialPage link is put in the highest addressed slab in the page, and the
+// lowest addressed slab is used to fulfill the allocation request
+//
+{
+	page* p	 = iSparePage;
+	if (p)
+		iSparePage = 0;
+	else
+		{
+		p = static_cast<page*>(Map(0, iPageSize));
+		if (!p)
+			return 0;
+		}
+	HEAP_ASSERT(p == Floor(p, iPageSize));
+	// Store page allocated for slab into paged_bitmap (for RHybridHeap::Reset())
+	if (!PagedSetSize(p, iPageSize))
+		{
+		Unmap(p, iPageSize);
+		return 0;
+		}
+	p->iSlabs[0].iHeader = ((1<<3) + (1<<2) + (1<<1))<<8;		// set pagemap
+	p->iSlabs[3].iParent = &iPartialPage;
+	p->iSlabs[3].iChild1 = p->iSlabs[3].iChild2 = 0;
+	iPartialPage = &p->iSlabs[3];
+	return InitNewSlab(allocator,&p->iSlabs[0]);
+}
+
+void RHybridHeap::FreePage(page* p)
+//
+// Release an unused page to the OS
+// A single page is cached for reuse to reduce thrashing
+// the OS allocator.
+//
+{
+	HEAP_ASSERT(Ceiling(p, iPageSize) == p);
+	if (!iSparePage)
+		{
+		iSparePage = p;
+		return;
+		}
+	
+	// unmapped slab page must be cleared from paged_bitmap, too
+	PagedZapSize(p, iPageSize);		// clear page map
+	
+	Unmap(p, iPageSize);
+}
+
+void RHybridHeap::FreeSlab(slab* s)
+//
+// Release an empty slab to the slab manager
+// The strategy is:
+// 1. The page containing the slab is checked to see the state of the other iSlabs in the page by
+//    inspecting the pagemap field in the iHeader of the first slab in the page.
+// 2. The pagemap is updated to indicate the new unused slab
+// 3. If this is the only unused slab in the page then the slab iHeader is used to add the page to
+//    the iPartialPage tree/heap
+// 4. If all the iSlabs in the page are now unused the page is release back to the OS
+// 5. If this slab has a higher address than the one currently used to track this page in
+//    the iPartialPage heap, the linkage is moved to the new unused slab
+//
+{
+	TreeRemove(s);
+	CHECKTREE(s->iParent);
+	HEAP_ASSERT(SlabHeaderUsedm4(s->iHeader) == SlabHeaderSize(s->iHeader)-4);
+
+	page* p = page::PageFor(s);
+	unsigned h = p->iSlabs[0].iHeader;
+	int slabix = s - &p->iSlabs[0];
+	unsigned pagemap = SlabHeaderPagemap(h);
+	p->iSlabs[0].iHeader = h | (0x100<<slabix);
+	if (pagemap == 0)
+		{	// page was full before, use this slab as link in empty heap
+		TreeInsert(s, &iPartialPage);
+		}
+	else
+		{	// Find the current empty-link slab
+		slab* sl = &p->iSlabs[HIBIT(pagemap)];
+		pagemap ^= (1<<slabix);
+		if (pagemap == 0xf)
+			{	// page is now empty so recycle page to os
+			TreeRemove(sl);
+			FreePage(p);
+			return;
+			}
+		// ensure the free list link is in highest address slab in page
+		if (s > sl)
+			{	// replace current link with new one. Address-order tree so position stays the same
+			slab** r = sl->iParent;
+			slab* c1 = sl->iChild1;
+			slab* c2 = sl->iChild2;
+			s->iParent = r;
+			s->iChild1 = c1;
+			s->iChild2 = c2;
+			*r = s;
+			if (c1)
+				c1->iParent = &s->iChild1;
+			if (c2)
+				c2->iParent = &s->iChild2;
+			}
+		CHECK(if (s < sl) s=sl);
+		}
+	HEAP_ASSERT(SlabHeaderPagemap(p->iSlabs[0].iHeader) != 0);
+	HEAP_ASSERT(HIBIT(SlabHeaderPagemap(p->iSlabs[0].iHeader)) == unsigned(s - &p->iSlabs[0]));
+}
+
+
+void RHybridHeap::SlabInit()
+{
+	iSlabThreshold=0;
+	iPartialPage = 0;
+	iFullSlab = 0;
+	iSparePage = 0;
+	memset(&iSizeMap[0],0xff,sizeof(iSizeMap));
+	memset(&iSlabAlloc[0],0,sizeof(iSlabAlloc));
+}
+
+void RHybridHeap::SlabConfig(unsigned slabbitmap)
+{
+	HEAP_ASSERT((slabbitmap & ~EOkBits) == 0);
+	HEAP_ASSERT(MAXSLABSIZE <= 60);
+	
+	unsigned int ix = 0xff;
+	unsigned int bit = 1<<((MAXSLABSIZE>>2)-1);
+	for (int sz = MAXSLABSIZE; sz >= 0; sz -= 4, bit >>= 1)
+		{
+		if (slabbitmap & bit)
+			{
+			if (ix == 0xff)
+				iSlabThreshold=sz+1;
+			ix = (sz>>2)-1;
+			}
+		iSizeMap[sz>>2] = (TUint8) ix;
+		}
+}
+
+
+void* RHybridHeap::SlabAllocate(slabset& ss)
+//
+// Allocate a cell from the given slabset
+// Strategy:
+// 1. Take the partially full slab at the iTop of the heap (lowest address).
+// 2. If there is no such slab, allocate from a new slab
+// 3. If the slab has a non-empty freelist, pop the cell from the front of the list and update the slab
+// 4. Otherwise, if the slab is not full, return the cell at the end of the currently used region of
+//    the slab, updating the slab
+// 5. Otherwise, release the slab from the iPartial tree/heap, marking it as 'floating' and go back to
+//    step 1
+//
+{
+	for (;;)
+		{
+		slab *s = ss.iPartial;
+		if (!s)
+			break;
+		unsigned h = s->iHeader;
+		unsigned free = h & 0xff;		// extract free cell positioning
+		if (free)
+			{
+			HEAP_ASSERT(((free<<2)-sizeof(slabhdr))%SlabHeaderSize(h) == 0);
+			void* p = Offset(s,free<<2);
+			free = *(unsigned char*)p;	// get next pos in free list
+			h += (h&0x3C000)<<6;		// update usedm4
+			h &= ~0xff;
+			h |= free;					// update freelist
+			s->iHeader = h;
+			HEAP_ASSERT(SlabHeaderFree(h) == 0 || ((SlabHeaderFree(h)<<2)-sizeof(slabhdr))%SlabHeaderSize(h) == 0);
+			HEAP_ASSERT(SlabHeaderUsedm4(h) <= 0x3F8u);
+			HEAP_ASSERT((SlabHeaderUsedm4(h)+4)%SlabHeaderSize(h) == 0);
+			return p;
+			}
+		unsigned h2 = h + ((h&0x3C000)<<6);
+//		if (h2 < 0xfc00000)
+  		if (h2 < MAXUSEDM4BITS)		
+			{
+			HEAP_ASSERT((SlabHeaderUsedm4(h2)+4)%SlabHeaderSize(h2) == 0);
+			s->iHeader = h2;
+			return Offset(s,(h>>18) + sizeof(unsigned) + sizeof(slabhdr));
+			}
+		h |= FLOATING_BIT;				// mark the slab as full-floating
+		s->iHeader = h;
+		TreeRemove(s);
+		slab* c = iFullSlab;			// add to full list
+		iFullSlab = s;
+		s->iParent = &iFullSlab;
+		s->iChild1 = c;
+		s->iChild2 = 0;
+		if (c)
+			c->iParent = &s->iChild1;
+		
+		CHECKTREE(&ss.iPartial);
+		// go back and try the next slab...
+		}
+	// no iPartial iSlabs found, so allocate from a new slab
+	return AllocNewSlab(ss);
+}
+
+void RHybridHeap::SlabFree(void* p)
+//
+// Free a cell from the slab allocator
+// Strategy:
+// 1. Find the containing slab (round down to nearest 1KB boundary)
+// 2. Push the cell into the slab's freelist, and update the slab usage count
+// 3. If this is the last allocated cell, free the slab to the main slab manager
+// 4. If the slab was full-floating then insert the slab in it's respective iPartial tree
+//
+{
+	HEAP_ASSERT(LowBits(p,3)==0);
+	slab* s = slab::SlabFor(p);
+	CHECKSLAB(s,ESlabAllocator,p);
+	CHECKSLABBFR(s,p);	
+
+	unsigned pos = LowBits(p, SLABSIZE);
+	unsigned h = s->iHeader;
+	HEAP_ASSERT(SlabHeaderUsedm4(h) != 0x3fC);		// slab is empty already
+	HEAP_ASSERT((pos-sizeof(slabhdr))%SlabHeaderSize(h) == 0);
+	*(unsigned char*)p = (unsigned char)h;
+	h &= ~0xFF;
+	h |= (pos>>2);
+	unsigned size = h & 0x3C000;
+	if (int(h) >= 0)
+		{
+		h -= size<<6;
+		if (int(h)>=0)
+			{
+			s->iHeader = h;
+			return;
+			}
+		FreeSlab(s);
+		return;
+		}
+	h -= size<<6;
+    h &= ~FLOATING_BIT;	
+	s->iHeader = h;
+	slab** full = s->iParent;		// remove from full list
+	slab* c = s->iChild1;
+	*full = c;
+	if (c)
+		c->iParent = full;
+	
+	slabset& ss = iSlabAlloc[iSizeMap[size>>14]];
+	TreeInsert(s,&ss.iPartial);
+	CHECKTREE(&ss.iPartial);
+}
+
+void* RHybridHeap::InitNewSlab(slabset& allocator, slab* s)
+//
+// initialise an empty slab for this allocator and return the fist cell
+// pre-condition: the slabset has no iPartial iSlabs for allocation
+//
+{
+	HEAP_ASSERT(allocator.iPartial==0);
+	TInt size = 4 + ((&allocator-&iSlabAlloc[0])<<2);	// infer size from slab allocator address
+	unsigned h = s->iHeader & 0xF00;	// preserve pagemap only
+	h |= (size<<12);					// set size
+	h |= (size-4)<<18;					// set usedminus4 to one object minus 4
+	s->iHeader = h;
+	allocator.iPartial = s;
+	s->iParent = &allocator.iPartial;
+	s->iChild1 = s->iChild2 = 0;
+	return Offset(s,sizeof(slabhdr));
+}
+
+const unsigned char slab_bitcount[16] = {0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4};
+
+const unsigned char slab_ext_frag[16] =
+{
+	0,
+	16 + (1008 % 4),
+	16 + (1008 % 8),
+	16 + (1008 % 12),
+	16 + (1008 % 16),
+	16 + (1008 % 20),
+	16 + (1008 % 24),
+	16 + (1008 % 28),
+	16 + (1008 % 32),
+	16 + (1008 % 36),
+	16 + (1008 % 40),
+	16 + (1008 % 44),
+	16 + (1008 % 48),
+	16 + (1008 % 52),
+	16 + (1008 % 56),
+	16 + (1008 % 60)
+};
+
+void RHybridHeap::TreeWalk(slab* const* root, void (*f)(slab*, struct HeapInfo*, SWalkInfo*), struct HeapInfo* i, SWalkInfo* wi)
+{
+	// iterative walk around the tree at root
+	
+	slab* s = *root;
+	if (!s)
+		return;
+	
+	for (;;)
+		{
+		slab* c;
+		while ((c = s->iChild1) != 0)
+			s = c;		// walk down left side to end
+		for (;;)
+			{
+			f(s, i, wi);
+			c = s->iChild2;
+			if (c)
+				{	// one step down right side, now try and walk down left
+				s = c;
+				break;
+				}
+			for (;;)
+				{	// loop to walk up right side
+				slab** pp = s->iParent;
+				if (pp == root)
+					return;
+				s = slab::SlabFor(pp);
+				if (pp == &s->iChild1)
+					break;
+				}
+			}
+		}
+}
+
+void RHybridHeap::SlabEmptyInfo(slab* s, struct HeapInfo* i, SWalkInfo* wi)
+{
+	Walk(wi, s, SLABSIZE, EGoodFreeCell, EEmptySlab); // Introduce an empty slab to the walk function 
+	int nslab = slab_bitcount[SlabHeaderPagemap(page::PageFor(s)->iSlabs[0].iHeader)];
+	i->iFreeN += nslab;
+	i->iFreeBytes += nslab << SLABSHIFT;
+}
+
+void RHybridHeap::SlabPartialInfo(slab* s, struct HeapInfo* i, SWalkInfo* wi)
+{
+	Walk(wi, s, SLABSIZE, EGoodAllocatedCell, EPartialFullSlab); // Introduce a full slab to the walk function 
+	unsigned h = s->iHeader;
+	unsigned used = SlabHeaderUsedm4(h)+4;
+	unsigned size = SlabHeaderSize(h);
+	unsigned free = 1024 - slab_ext_frag[size>>2] - used;
+	i->iFreeN += (free/size);
+	i->iFreeBytes += free;
+	i->iAllocN += (used/size);
+	i->iAllocBytes += used;
+}
+
+void RHybridHeap::SlabFullInfo(slab* s, struct HeapInfo* i, SWalkInfo* wi)
+{
+	Walk(wi, s, SLABSIZE, EGoodAllocatedCell, EFullSlab); // Introduce a full slab to the walk function 
+	unsigned h = s->iHeader;
+	unsigned used = SlabHeaderUsedm4(h)+4;
+	unsigned size = SlabHeaderSize(h);
+	HEAP_ASSERT(1024 - slab_ext_frag[size>>2] - used == 0);
+	i->iAllocN += (used/size);
+	i->iAllocBytes += used;
+}
+
+void RHybridHeap::SlabInfo(struct HeapInfo* i, SWalkInfo* wi) const
+{
+	if (iSparePage)
+		{
+		i->iFreeBytes += iPageSize;
+		i->iFreeN = 4;
+		Walk(wi, iSparePage, iPageSize, EGoodFreeCell, ESlabSpare); // Introduce Slab spare page to the walk function 
+		}
+	TreeWalk(&iFullSlab, &SlabFullInfo, i, wi);
+	for (int ix = 0; ix < (MAXSLABSIZE>>2); ++ix)
+		TreeWalk(&iSlabAlloc[ix].iPartial, &SlabPartialInfo, i, wi);
+	TreeWalk(&iPartialPage, &SlabEmptyInfo, i, wi);
+}
+
+
+//
+// Bitmap class implementation for large page allocator 
+//
+inline unsigned char* paged_bitmap::Addr() const {return iBase;}
+inline unsigned paged_bitmap::Size() const {return iNbits;}
+//
+
+void paged_bitmap::Init(unsigned char* p, unsigned size, unsigned bit)
+{
+	iBase = p;
+	iNbits=size;
+	int bytes=Ceiling(size,8)>>3;
+	memset(p,bit?0xff:0,bytes);
+}
+
+inline void paged_bitmap::Set(unsigned ix, unsigned bit)
+{
+	if (bit)
+		iBase[ix>>3] |= (1<<(ix&7));
+	else
+		iBase[ix>>3] &= ~(1<<(ix&7));
+}
+
+inline unsigned paged_bitmap::operator[](unsigned ix) const
+{
+	return 1U&(iBase[ix>>3] >> (ix&7));
+}
+
+void paged_bitmap::Setn(unsigned ix, unsigned len, unsigned bit)
+{
+	int l=len;
+	while (--l>=0)
+		Set(ix++,bit);
+}
+
+void paged_bitmap::Set(unsigned ix, unsigned len, unsigned val)
+{
+	int l=len;
+	while (--l>=0)
+		{
+		Set(ix++,val&1);
+		val>>=1;
+		}
+}
+
+unsigned paged_bitmap::Bits(unsigned ix, unsigned len) const
+{
+	int l=len;
+	unsigned val=0;
+	unsigned bit=0;
+	while (--l>=0)
+		val |= (*this)[ix++]<<bit++;
+	return val;
+}
+
+bool paged_bitmap::Is(unsigned ix, unsigned len, unsigned bit) const
+{
+	unsigned i2 = ix+len;
+	if (i2 > iNbits)
+		return false;
+	for (;;)
+		{
+		if ((*this)[ix] != bit)
+			return false;
+		if (++ix==i2)
+			return true;
+		}
+}
+
+int paged_bitmap::Find(unsigned start, unsigned bit) const
+{
+	if (start<iNbits) do
+		{
+		if ((*this)[start]==bit)
+			return start;
+		} while (++start<iNbits);
+	return -1;
+}
+
+
+//
+// Page allocator code
+//
+void RHybridHeap::PagedInit(TInt aPagePower)
+{
+	if (aPagePower > 0)
+		{
+		if (aPagePower < MINPAGEPOWER)
+			aPagePower = MINPAGEPOWER;
+		}
+	else aPagePower = 31;
+
+	iPageThreshold = aPagePower;
+	/*-------------------------------------------------------------
+	 * Initialize page bitmap
+	 *-------------------------------------------------------------*/
+	iPageMap.Init((unsigned char*)&iBitMapBuffer, MAXSMALLPAGEBITS, 0);
+}
+
+void* RHybridHeap::PagedAllocate(unsigned size)
+{
+	TInt nbytes = Ceiling(size, iPageSize);
+	void* p = Map(0, nbytes);
+	if (!p)
+		return 0;
+	if (!PagedSetSize(p, nbytes))
+		{
+		Unmap(p, nbytes);
+		return 0;
+		}
+	return p;
+}
+
+void* RHybridHeap::PagedReallocate(void* p, unsigned size, TInt mode)
+{
+	
+	HEAP_ASSERT(Ceiling(p, iPageSize) == p);
+	unsigned nbytes = Ceiling(size, iPageSize);
+	
+	unsigned osize = PagedSize(p);
+	if ( nbytes == 0 )  // Special case to handle shrinking below min page threshold 
+		nbytes = Min((1 << MINPAGEPOWER), osize);
+	
+	if (osize == nbytes)
+		return p;
+	
+	if (nbytes < osize)
+		{	// shrink in place, unmap final pages and rewrite the pagemap
+		Unmap(Offset(p, nbytes), osize-nbytes);
+		// zap old code and then write new code (will not fail)
+		PagedZapSize(p, osize);
+
+		TBool check = PagedSetSize(p, nbytes);
+        __ASSERT_ALWAYS(check, HEAP_PANIC(ETHeapBadCellAddress));
+		
+		return p;
+		}
+	
+	// nbytes > osize
+	// try and extend current region first
+			
+	void* newp = Map(Offset(p, osize), nbytes-osize);
+	if (newp)
+		{	// In place growth. Possibility that pagemap may have to grow AND then fails
+		if (!PagedSetSize(p, nbytes))
+			{	// must release extra mapping
+			Unmap(Offset(p, osize), nbytes-osize);
+			return 0;
+			}
+		// if successful, the new length code will have overwritten the old one (it is at least as long)
+		return p;
+		}
+	
+	// fallback to  allocate/copy/free
+	if (mode & ENeverMove)
+		return 0;		// not allowed to move cell
+	
+	newp = PagedAllocate(nbytes);
+	if (!newp)
+		return 0;
+	memcpy(newp, p, osize);
+	PagedFree(p);
+	return newp;
+}
+
+void RHybridHeap::PagedFree(void* p)
+{
+	HEAP_ASSERT(Ceiling(p, iPageSize) == p);
+
+	
+	unsigned size = PagedSize(p);
+	
+	PagedZapSize(p, size);		// clear page map
+	Unmap(p, size);
+}
+
+void RHybridHeap::PagedInfo(struct HeapInfo* i, SWalkInfo* wi) const
+{
+	for (int ix = 0;(ix = iPageMap.Find(ix,1)) >= 0;)
+		{
+		int npage = PagedDecode(ix);
+		// Introduce paged buffer to the walk function 
+		TAny* bfr = Bitmap2addr(ix);
+		int len = npage << PAGESHIFT;
+		if ( len > iPageSize )
+			{ // If buffer is not larger than one page it must be a slab page mapped into bitmap
+			i->iAllocBytes += len;
+			++i->iAllocN;
+			Walk(wi, bfr, len, EGoodAllocatedCell, EPageAllocator);
+			}
+		ix += (npage<<1);
+		}
+}
+
+void RHybridHeap::ResetBitmap()
+/*---------------------------------------------------------
+ * Go through paged_bitmap and unmap all buffers to system
+ * This method is called from RHybridHeap::Reset() to unmap all page
+ * allocated - and slab pages which are stored in bitmap, too
+ *---------------------------------------------------------*/ 
+{
+	unsigned iNbits = iPageMap.Size();
+	if ( iNbits )
+		{
+		for (int ix = 0;(ix = iPageMap.Find(ix,1)) >= 0;)
+			{
+			int npage = PagedDecode(ix);
+			void* p = Bitmap2addr(ix);
+			unsigned size = PagedSize(p);
+			PagedZapSize(p, size);		// clear page map
+			Unmap(p, size);
+			ix += (npage<<1);
+			}
+		if ( (TInt)iNbits > MAXSMALLPAGEBITS )
+			{
+			// unmap page reserved for enlarged bitmap
+			Unmap(iPageMap.Addr(), (iNbits >> 3) );
+			}
+		}
+}
+
+TBool RHybridHeap::CheckBitmap(void* aBfr, TInt aSize, TUint32& aDummy, TInt& aNPages)
+/*---------------------------------------------------------
+ * If aBfr = NULL
+ *   Go through paged_bitmap and unmap all buffers to system
+ *   and assure that by reading the first word of each page of aBfr
+ *   that aBfr is still accessible
+ * else  
+ *   Assure that specified buffer is mapped with correct length in
+ *   page map
+ *---------------------------------------------------------*/ 
+{
+	TBool ret;
+	if ( aBfr )
+		{
+		__ASSERT_ALWAYS((Ceiling(aBfr, iPageSize) == aBfr), HEAP_PANIC(ETHeapBadCellAddress));		
+        ret = ( aSize == (TInt)PagedSize(aBfr));
+		}
+	else
+		{
+		ret = ETrue;
+		unsigned iNbits = iPageMap.Size();
+		if ( iNbits )
+			{
+			TInt npage;
+			aNPages = 0;
+			for (int ix = 0;(ix = iPageMap.Find(ix,1)) >= 0;)
+				{
+				npage = PagedDecode(ix);
+				aNPages += npage;
+				void* p = Bitmap2addr(ix);
+				__ASSERT_ALWAYS((Ceiling(p, iPageSize) == p), HEAP_PANIC(ETHeapBadCellAddress));						
+				unsigned s = PagedSize(p);
+				__ASSERT_ALWAYS((Ceiling(s, iPageSize) == s), HEAP_PANIC(ETHeapBadCellAddress));	
+				while ( s )
+					{
+					aDummy += *(TUint32*)((TUint8*)p + (s-iPageSize));
+					s -= iPageSize;
+					}
+				ix += (npage<<1);
+				}
+			if ( (TInt)iNbits > MAXSMALLPAGEBITS )
+				{
+				// add enlarged bitmap page(s) to total page count
+                npage = (iNbits >> 3); 
+				__ASSERT_ALWAYS((Ceiling(npage, iPageSize) == npage), HEAP_PANIC(ETHeapBadCellAddress));
+				aNPages += (npage / iPageSize);
+				}
+			}
+		}
+	
+	return ret;
+}
+
+
+// The paged allocations are tracked in a bitmap which has 2 bits per page
+// this allows us to store allocations as small as 4KB
+// The presence and size of an allocation is encoded as follows:
+// let N = number of pages in the allocation, then
+// 10            : N = 1			// 4KB
+// 110n			 : N = 2 + n		// 8-12KB
+// 1110nnnn      : N = nnnn			// 16-60KB
+// 1111n[18]	 : N = n[18]		// 64KB-1GB
+
+const struct etab { unsigned char offset, len, codelen, code;} encode_table[] =
+{
+	{1,2,2,0x1},
+	{2,4,3,0x3},
+	{0,8,4,0x7},
+	{0,22,4,0xf}
+};
+
+// Return code length for specified allocation Size(assumed to be aligned to pages)
+inline unsigned paged_codelen(unsigned size, unsigned pagesz)
+{
+	HEAP_ASSERT(size == Ceiling(size, pagesz));
+	
+	if (size == pagesz)
+		return 2;
+	else if (size < 4*pagesz)
+		return 4;
+	else if (size < 16*pagesz)
+		return 8;
+	else
+		return 22;
+}
+
+inline const etab& paged_coding(unsigned npage)
+{
+	if (npage < 4)
+		return encode_table[npage>>1];
+	else if (npage < 16)
+		return encode_table[2];
+	else
+		return encode_table[3];
+}
+
+bool RHybridHeap::PagedEncode(unsigned pos, unsigned npage)
+{
+	const etab& e = paged_coding(npage);
+	if (pos + e.len > iPageMap.Size())
+		{
+		// need to grow the page bitmap to fit the cell length into the map
+		// if we outgrow original bitmap buffer in RHybridHeap metadata, then just get enough pages to cover the full space:
+		// * initial 68 byte bitmap mapped (68*8*4kB):2 = 1,1MB
+		// * 4KB can Map(4096*8*4kB):2 = 64MB
+		unsigned maxsize = Ceiling(iMaxLength, iPageSize);
+		unsigned mapbits = maxsize >> (PAGESHIFT-1);
+		maxsize = Ceiling(mapbits>>3, iPageSize);
+		void* newb = Map(0, maxsize);
+		if (!newb)
+			return false;
+		
+		unsigned char* oldb = iPageMap.Addr();
+		iPageMap.Init((unsigned char*)newb, (maxsize<<3), 0);
+		memcpy(newb, oldb, Ceiling(MAXSMALLPAGEBITS,8)>>3);
+		}
+	// encode the allocation block size into the bitmap, starting at the bit for the start page
+	unsigned bits = e.code;
+	bits |= (npage - e.offset) << e.codelen;
+	iPageMap.Set(pos, e.len, bits);
+	return true;
+}
+
+unsigned RHybridHeap::PagedDecode(unsigned pos) const
+{
+	__ASSERT_ALWAYS(pos + 2 <= iPageMap.Size(), HEAP_PANIC(ETHeapBadCellAddress));
+	
+	unsigned bits = iPageMap.Bits(pos,2);
+	__ASSERT_ALWAYS(bits & 1, HEAP_PANIC(ETHeapBadCellAddress));
+	bits >>= 1;
+	if (bits == 0)
+		return 1;
+	__ASSERT_ALWAYS(pos + 4 <= iPageMap.Size(), HEAP_PANIC(ETHeapBadCellAddress));
+	bits = iPageMap.Bits(pos+2,2);
+	if ((bits & 1) == 0)
+		return 2 + (bits>>1);
+	else if ((bits>>1) == 0)
+		{
+		__ASSERT_ALWAYS(pos + 8 <= iPageMap.Size(), HEAP_PANIC(ETHeapBadCellAddress));
+		return iPageMap.Bits(pos+4, 4);
+		}
+	else
+		{
+		__ASSERT_ALWAYS(pos + 22 <= iPageMap.Size(), HEAP_PANIC(ETHeapBadCellAddress));
+		return iPageMap.Bits(pos+4, 18);
+		}
+}
+
+inline void RHybridHeap::PagedZapSize(void* p, unsigned size)
+{iPageMap.Setn(PtrDiff(p, iMemBase) >> (PAGESHIFT-1), paged_codelen(size, iPageSize) ,0);}
+
+inline unsigned RHybridHeap::PagedSize(void* p) const
+   { return PagedDecode(PtrDiff(p, iMemBase) >> (PAGESHIFT-1)) << PAGESHIFT; }
+
+inline bool RHybridHeap::PagedSetSize(void* p, unsigned size)
+{ return PagedEncode(PtrDiff(p, iMemBase) >> (PAGESHIFT-1), size >> PAGESHIFT); }
+
+inline void* RHybridHeap::Bitmap2addr(unsigned pos) const
+   { return iMemBase + (1 << (PAGESHIFT-1))*pos; }
+
+
+//////////////////////////////////////////////////////////////////////////
+//////////////////////////////////////////////////////////////////////////
+//////////////////////////////////////////////////////////////////////////
+/**
+Constructor where minimum and maximum length of the heap can be defined.
+It defaults the chunk heap to be created to have use a new local chunk, 
+to have a grow by value of KMinHeapGrowBy, to be unaligned, not to be 
+single threaded and not to have any mode flags set.
+
+@param aMinLength    The minimum length of the heap to be created.
+@param aMaxLength    The maximum length to which the heap to be created can grow.
+                     If the supplied value is less than a page size, then it
+                     is discarded and the page size is used instead.
+*/
+EXPORT_C TChunkHeapCreateInfo::TChunkHeapCreateInfo(TInt aMinLength, TInt aMaxLength) :
+   iVersionNumber(EVersion0), iMinLength(aMinLength), iMaxLength(aMaxLength),
+iAlign(0), iGrowBy(1), iSingleThread(EFalse), 
+iOffset(0), iPaging(EUnspecified), iMode(0), iName(NULL)
+{
+}
+
+
+/**
+Sets the chunk heap to create a new chunk with the specified name.
+
+This overriddes any previous call to TChunkHeapCreateInfo::SetNewChunkHeap() or
+TChunkHeapCreateInfo::SetExistingChunkHeap() for this TChunkHeapCreateInfo object.
+
+@param aName	The name to be given to the chunk heap to be created
+If NULL, the function constructs a local chunk to host the heap.
+If not NULL, a pointer to a descriptor containing the name to be 
+assigned to the global chunk hosting the heap.
+*/
+EXPORT_C void TChunkHeapCreateInfo::SetCreateChunk(const TDesC* aName)
+{
+	iName = (TDesC*)aName;
+	iChunk.SetHandle(KNullHandle);
+}
+
+
+/**
+Sets the chunk heap to be created to use the chunk specified.
+
+This overriddes any previous call to TChunkHeapCreateInfo::SetNewChunkHeap() or
+TChunkHeapCreateInfo::SetExistingChunkHeap() for this TChunkHeapCreateInfo object.
+
+@param aChunk	A handle to the chunk to use for the heap.
+*/
+EXPORT_C void TChunkHeapCreateInfo::SetUseChunk(const RChunk aChunk)
+{
+	iName = NULL;
+	iChunk = aChunk;
+}
+
+EXPORT_C RHeap* UserHeap::FixedHeap(TAny* aBase, TInt aMaxLength, TInt aAlign, TBool aSingleThread)
+/**
+Creates a fixed length heap at a specified location.
+
+On successful return from this function, the heap is ready to use.  This assumes that
+the memory pointed to by aBase is mapped and able to be used.  You must ensure that you
+pass in a large enough value for aMaxLength.  Passing in a value that is too small to
+hold the metadata for the heap (~1 KB) will result in the size being rounded up and the
+heap thereby running over the end of the memory assigned to it.  But then if you were to
+pass in such as small value then you would not be able to do any allocations from the
+heap anyway.  Moral of the story: Use a sensible value for aMaxLength!
+
+@param aBase         A pointer to the location where the heap is to be constructed.
+@param aMaxLength    The maximum length in bytes to which the heap can grow.  If the
+                     supplied value is too small to hold the heap's metadata, it
+                     will be increased.
+@param aAlign        From Symbian^4 onwards, this value is ignored but EABI 8
+                     byte alignment is guaranteed for all allocations 8 bytes or
+                     more in size.  4 byte allocations will be aligned to a 4
+                     byte boundary.  Best to pass in zero.
+@param aSingleThread ETrue if the heap is to be accessed from multiple threads.
+                     This will cause internal locks to be created, guaranteeing
+                     thread safety.
+
+@return A pointer to the new heap, or NULL if the heap could not be created.
+
+@panic USER 56 if aMaxLength is negative.
+*/
+{
+	__ASSERT_ALWAYS( aMaxLength>=0, ::Panic(ETHeapMaxLengthNegative));
+	if ( aMaxLength < (TInt)sizeof(RHybridHeap) )
+		aMaxLength = sizeof(RHybridHeap);
+	
+	RHybridHeap* h = new(aBase) RHybridHeap(aMaxLength, aAlign, aSingleThread);
+	
+	if (!aSingleThread)
+		{
+		TInt r = h->iLock.CreateLocal();
+		if (r!=KErrNone)
+			return NULL; // No need to delete the RHybridHeap instance as the new above is only a placement new
+		h->iHandles = (TInt*)&h->iLock;
+		h->iHandleCount = 1;
+		}
+	return h;
+}
+
+/**
+Creates a chunk heap of the type specified by the parameter aCreateInfo.
+
+@param aCreateInfo	A reference to a TChunkHeapCreateInfo object specifying the
+type of chunk heap to create.
+
+@return A pointer to the new heap or NULL if the heap could not be created.
+
+@panic USER 41 if the heap's specified minimum length is greater than the specified maximum length.
+@panic USER 55 if the heap's specified minimum length is negative.
+@panic USER 172 if the heap's specified alignment is not a power of 2 or is less than the size of a TAny*.
+*/
+EXPORT_C RHeap* UserHeap::ChunkHeap(const TChunkHeapCreateInfo& aCreateInfo)
+{
+	// aCreateInfo must have been configured to use a new chunk or an exiting chunk.
+	__ASSERT_ALWAYS(!(aCreateInfo.iMode & (TUint32)~EChunkHeapMask), ::Panic(EHeapCreateInvalidMode));
+	RHeap* h = NULL;
+	
+	if (aCreateInfo.iChunk.Handle() == KNullHandle)
+		{
+		// A new chunk is to be created for this heap.
+		
+		__ASSERT_ALWAYS(aCreateInfo.iMinLength >= 0, ::Panic(ETHeapMinLengthNegative));
+		__ASSERT_ALWAYS(aCreateInfo.iMaxLength >= aCreateInfo.iMinLength, ::Panic(ETHeapCreateMaxLessThanMin));
+
+		TInt maxLength = aCreateInfo.iMaxLength;
+		TInt page_size;
+		GET_PAGE_SIZE(page_size);
+
+		if (maxLength < page_size)
+			maxLength = page_size;
+		
+		TChunkCreateInfo chunkInfo;
+#if USE_HYBRID_HEAP
+		if ( aCreateInfo.iOffset )
+			chunkInfo.SetNormal(0, maxLength);  // Create DL only heap
+		else
+			{
+			maxLength = 2*maxLength;
+			chunkInfo.SetDisconnected(0, 0, maxLength); // Create hybrid heap
+			}
+#else
+		chunkInfo.SetNormal(0, maxLength);  // Create DL only heap		
+#endif			
+		chunkInfo.SetOwner((aCreateInfo.iSingleThread)? EOwnerThread : EOwnerProcess);
+		if (aCreateInfo.iName)
+			chunkInfo.SetGlobal(*aCreateInfo.iName);
+		// Set the paging attributes of the chunk.
+		if (aCreateInfo.iPaging == TChunkHeapCreateInfo::EPaged)
+			chunkInfo.SetPaging(TChunkCreateInfo::EPaged);
+		if (aCreateInfo.iPaging == TChunkHeapCreateInfo::EUnpaged)
+			chunkInfo.SetPaging(TChunkCreateInfo::EUnpaged);
+		// Create the chunk.
+		RChunk chunk;
+		if (chunk.Create(chunkInfo) != KErrNone)
+			return NULL;
+		// Create the heap using the new chunk.
+		TUint mode = aCreateInfo.iMode | EChunkHeapDuplicate;	// Must duplicate the handle.
+		h = OffsetChunkHeap(chunk, aCreateInfo.iMinLength, aCreateInfo.iOffset,
+							aCreateInfo.iGrowBy, maxLength, aCreateInfo.iAlign,
+							aCreateInfo.iSingleThread, mode);
+		chunk.Close();
+		}
+	else
+		{
+		h = OffsetChunkHeap(aCreateInfo.iChunk, aCreateInfo.iMinLength, aCreateInfo.iOffset,
+							aCreateInfo.iGrowBy, aCreateInfo.iMaxLength, aCreateInfo.iAlign,
+							aCreateInfo.iSingleThread, aCreateInfo.iMode);
+		}
+	return h;
+}
+
+
+
+EXPORT_C RHeap* UserHeap::ChunkHeap(const TDesC* aName, TInt aMinLength, TInt aMaxLength, TInt aGrowBy, TInt aAlign, TBool aSingleThread)
+/**
+Creates a heap in a local or global chunk.
+
+The chunk hosting the heap can be local or global.
+
+A local chunk is one which is private to the process creating it and is not
+intended for access by other user processes.  A global chunk is one which is
+visible to all processes.
+
+The hosting chunk is local, if the pointer aName is NULL, otherwise the
+hosting chunk is global and the descriptor *aName is assumed to contain
+the name to be assigned to it.
+
+Ownership of the host chunk is vested in the current process.
+
+A minimum and a maximum size for the heap can be specified. On successful
+return from this function, the size of the heap is at least aMinLength.
+If subsequent requests for allocation of memory from the heap cannot be
+satisfied by compressing the heap, the size of the heap is extended in
+increments of aGrowBy until the request can be satisfied.  Attempts to extend
+the heap causes the size of the host chunk to be adjusted.
+
+Note that the size of the heap cannot be adjusted by more than aMaxLength.
+
+@param aName         If NULL, the function constructs a local chunk to host
+                     the heap.  If not NULL, a pointer to a descriptor containing
+                     the name to be assigned to the global chunk hosting the heap.
+@param aMinLength    The minimum length of the heap in bytes.  This will be
+                     rounded up to the nearest page size by the allocator.
+@param aMaxLength    The maximum length in bytes to which the heap can grow.  This
+                     will be rounded up to the nearest page size by the allocator.
+@param aGrowBy       The number of bytes by which the heap will grow when more
+                     memory is required.  This will be rounded up to the nearest
+                     page size by the allocator.  If a value is not explicitly
+                     specified, the page size is taken by default.
+@param aAlign        From Symbian^4 onwards, this value is ignored but EABI 8
+                     byte alignment is guaranteed for all allocations 8 bytes or
+                     more in size.  4 byte allocations will be aligned to a 4
+                     byte boundary.  Best to pass in zero.
+@param aSingleThread ETrue if the heap is to be accessed from multiple threads.
+                     This will cause internal locks to be created, guaranteeing
+                     thread safety.
+
+@return A pointer to the new heap or NULL if the heap could not be created.
+
+@panic USER 41 if aMaxLength is < aMinLength.
+@panic USER 55 if aMinLength is negative.
+@panic USER 56 if aMaxLength is negative.
+*/
+	{
+	TInt page_size;
+	GET_PAGE_SIZE(page_size);
+	TInt minLength = _ALIGN_UP(aMinLength, page_size);
+	TInt maxLength = Max(aMaxLength, minLength);
+
+	TChunkHeapCreateInfo createInfo(minLength, maxLength);
+	createInfo.SetCreateChunk(aName);
+	createInfo.SetGrowBy(aGrowBy);
+	createInfo.SetAlignment(aAlign);
+	createInfo.SetSingleThread(aSingleThread);
+
+	return ChunkHeap(createInfo);
+	}
+
+EXPORT_C RHeap* UserHeap::ChunkHeap(RChunk aChunk, TInt aMinLength, TInt aGrowBy, TInt aMaxLength, TInt aAlign, TBool aSingleThread, TUint32 aMode)
+/**
+Creates a heap in an existing chunk.
+
+This function is intended to be used to create a heap in a user writable code
+chunk as created by a call to RChunk::CreateLocalCode().  This type of heap can
+be used to hold code fragments from a JIT compiler.
+
+@param aChunk        The chunk that will host the heap.
+@param aMinLength    The minimum length of the heap in bytes.  This will be
+                     rounded up to the nearest page size by the allocator.
+@param aGrowBy       The number of bytes by which the heap will grow when more
+                     memory is required.  This will be rounded up to the nearest
+                     page size by the allocator.  If a value is not explicitly
+                     specified, the page size is taken by default.
+@param aMaxLength    The maximum length in bytes to which the heap can grow.  This
+                     will be rounded up to the nearest page size by the allocator.
+                     If 0 is passed in, the maximum lengt of the chunk is used.
+@param aAlign        From Symbian^4 onwards, this value is ignored but EABI 8
+                     byte alignment is guaranteed for all allocations 8 bytes or
+                     more in size.  4 byte allocations will be aligned to a 4
+                     byte boundary.  Best to pass in zero.
+@param aSingleThread ETrue if the heap is to be accessed from multiple threads.
+                     This will cause internal locks to be created, guaranteeing
+                     thread safety.
+@param aMode         Flags controlling the heap creation.  See RAllocator::TFlags.
+
+@return A pointer to the new heap or NULL if the heap could not be created.
+
+@see UserHeap::OffsetChunkHeap()
+*/
+	{
+	return OffsetChunkHeap(aChunk, aMinLength, 0, aGrowBy, aMaxLength, aAlign, aSingleThread, aMode);
+	}
+
+EXPORT_C RHeap* UserHeap::OffsetChunkHeap(RChunk aChunk, TInt aMinLength, TInt aOffset, TInt aGrowBy, TInt aMaxLength, TInt aAlign, TBool aSingleThread, TUint32 aMode)
+/**
+Creates a heap in an existing chunk, offset from the beginning of the chunk.
+
+This function is intended to be used to create a heap using a chunk which has
+some of its memory already used, at the start of that that chunk.  The maximum
+length to which the heap can grow is the maximum size of the chunk, minus the
+data at the start of the chunk.
+
+The offset at which to create the heap is passed in as the aOffset parameter.
+Legacy heap implementations always respected the aOffset value, however more
+modern heap implementations are more sophisticated and cannot necessarily respect
+this value.  Therefore, if possible, you should always use an aOffset of 0 unless
+you have a very explicit requirement for using a non zero value.  Using a non zero
+value will result in a less efficient heap algorithm being used in order to respect
+the offset.
+
+Another issue to consider when using this function is the type of the chunk passed
+in.  In order for the most efficient heap algorithms to be used, the chunk passed
+in should always be a disconnected chunk.  Passing in a non disconnected chunk will
+again result in a less efficient heap algorithm being used.
+
+Finally, another requirement for the most efficient heap algorithms to be used is
+for the heap to be able to expand.  Therefore, unless you have a specific reason to
+do so, always specify aMaxLength > aMinLength.
+
+So, if possible, use aOffset == zero, aMaxLength > aMinLength and a disconnected
+chunk for best results!
+
+@param aChunk        The chunk that will host the heap.
+@param aMinLength    The minimum length of the heap in bytes.  This will be
+                     rounded up to the nearest page size by the allocator.
+@param aOffset       The offset in bytes from the start of the chunk at which to
+                     create the heap.  If used (and it shouldn't really be!)
+                     then it will be rounded up to a multiple of 8, to respect
+                     EABI 8 byte alignment requirements.
+@param aGrowBy       The number of bytes by which the heap will grow when more
+                     memory is required.  This will be rounded up to the nearest
+                     page size by the allocator.  If a value is not explicitly
+                     specified, the page size is taken by default.
+@param aMaxLength    The maximum length in bytes to which the heap can grow.  This
+                     will be rounded up to the nearest page size by the allocator.
+                     If 0 is passed in, the maximum length of the chunk is used.
+@param aAlign        From Symbian^4 onwards, this value is ignored but EABI 8
+                     byte alignment is guaranteed for all allocations 8 bytes or
+                     more in size.  4 byte allocations will be aligned to a 4
+                     byte boundary.  Best to pass in zero.
+@param aSingleThread ETrue if the heap is to be accessed from multiple threads.
+                     This will cause internal locks to be created, guaranteeing
+                     thread safety.
+@param aMode         Flags controlling the heap creation.  See RAllocator::TFlags.
+
+@return A pointer to the new heap or NULL if the heap could not be created.
+
+@panic USER 41 if aMaxLength is < aMinLength.
+@panic USER 55 if aMinLength is negative.
+@panic USER 56 if aMaxLength is negative.
+@panic USER 168 if aOffset is negative.
+*/
+	{
+	TBool dlOnly = EFalse;
+	TInt pageSize;
+	GET_PAGE_SIZE(pageSize);
+	TInt align = RHybridHeap::ECellAlignment; // Always use EABI 8 byte alignment
+
+	__ASSERT_ALWAYS(aMinLength>=0, ::Panic(ETHeapMinLengthNegative));
+	__ASSERT_ALWAYS(aMaxLength>=0, ::Panic(ETHeapMaxLengthNegative));
+
+	if ( aMaxLength > 0 ) 
+		__ASSERT_ALWAYS(aMaxLength>=aMinLength, ::Panic(ETHeapCreateMaxLessThanMin));
+
+	// Stick to EABI alignment for the start offset, if any
+	aOffset = _ALIGN_UP(aOffset, align);
+
+	// Using an aOffset > 0 means that we can't use the hybrid allocator and have to revert to Doug Lea only
+	if (aOffset > 0)
+		dlOnly = ETrue;
+
+	// Ensure that the minimum length is enough to hold the RHybridHeap object itself
+	TInt minCell = _ALIGN_UP(Max((TInt)RHybridHeap::EAllocCellSize, (TInt)RHybridHeap::EFreeCellSize), align);
+	TInt hybridHeapSize = (sizeof(RHybridHeap) + minCell);
+	if (aMinLength < hybridHeapSize)
+		aMinLength = hybridHeapSize;
+
+	// Round the minimum length up to a multiple of the page size, taking into account that the
+	// offset takes up a part of the chunk's memory
+	aMinLength = _ALIGN_UP((aMinLength + aOffset), pageSize);
+
+	// If aMaxLength is 0 then use the entire chunk
+	TInt chunkSize = aChunk.MaxSize();
+	if (aMaxLength == 0)
+		{
+		aMaxLength = chunkSize;
+		}
+	// Otherwise round the maximum length up to a multiple of the page size, taking into account that
+	// the offset takes up a part of the chunk's memory.  We also clip the maximum length to the chunk
+	// size, so the user may get a little less than requested if the chunk size is not large enough
+	else
+		{
+		aMaxLength = _ALIGN_UP((aMaxLength + aOffset), pageSize);
+		if (aMaxLength > chunkSize)
+			aMaxLength = chunkSize;
+		}
+	
+	// If the rounded up values don't make sense then a crazy aMinLength or aOffset must have been passed
+	// in, so fail the heap creation
+	if (aMinLength > aMaxLength)
+		return NULL;
+
+	// Adding the offset into the minimum and maximum length was only necessary for ensuring a good fit of
+	// the heap into the chunk.  Re-adjust them now back to non offset relative sizes
+	aMinLength -= aOffset;
+	aMaxLength -= aOffset;
+
+	// If we are still creating the hybrid allocator (call parameter
+	// aOffset is 0 and aMaxLength > aMinLength), we must reduce heap
+	// aMaxLength size to the value aMaxLength/2 and set the aOffset to point in the middle of chunk.
+	TInt offset = aOffset;
+	TInt maxLength = aMaxLength;
+	if (!dlOnly && (aMaxLength > aMinLength))
+		maxLength = offset = _ALIGN_UP(aMaxLength >> 1, pageSize);
+
+	// Try to use commit to map aMinLength physical memory for the heap, taking into account the offset.  If
+	// the operation fails, suppose that the chunk is not a disconnected heap and try to map physical memory
+	// with adjust.  In this case, we also can't use the hybrid allocator and have to revert to Doug Lea only
+	TBool useAdjust = EFalse;
+	TInt r = aChunk.Commit(offset, aMinLength);
+	if (r == KErrGeneral)
+		{
+		dlOnly = useAdjust = ETrue;
+		r = aChunk.Adjust(aMinLength);
+		if (r != KErrNone)
+			return NULL;
+		}
+	else if (r == KErrNone)
+		{
+		// We have a disconnected chunk reset aOffset and aMaxlength
+		aOffset = offset;
+		aMaxLength = maxLength;
+		}
+
+	else
+		return NULL;
+
+	// Parameters have been mostly verified and we know whether to use the hybrid allocator or Doug Lea only.  The
+	// constructor for the hybrid heap will automatically drop back to Doug Lea if it determines that aMinLength
+	// == aMaxLength, so no need to worry about that requirement here.  The user specified alignment is not used but
+	// is passed in so that it can be sanity checked in case the user is doing something totally crazy with it
+	RHybridHeap* h = new (aChunk.Base() + aOffset) RHybridHeap(aChunk.Handle(), aOffset, aMinLength, aMaxLength,
+		aGrowBy, aAlign, aSingleThread, dlOnly, useAdjust);
+
+	if (h->ConstructLock(aMode) != KErrNone)
+		return NULL;
+
+	// Return the heap address
+	return h;
+	}
+
+#define UserTestDebugMaskBit(bit) (TBool)(UserSvr::DebugMask(bit>>5) & (1<<(bit&31)))
+
+_LIT(KLitDollarHeap,"$HEAP");
+EXPORT_C TInt UserHeap::CreateThreadHeap(SStdEpocThreadCreateInfo& aInfo, RHeap*& aHeap, TInt aAlign, TBool aSingleThread)
+/**
+@internalComponent
+*/
+//
+// Create a user-side heap
+//
+{
+	TInt page_size;
+	GET_PAGE_SIZE(page_size);
+	TInt minLength = _ALIGN_UP(aInfo.iHeapInitialSize, page_size);
+	TInt maxLength = Max(aInfo.iHeapMaxSize, minLength);
+	if (UserTestDebugMaskBit(96)) // 96 == KUSERHEAPTRACE in nk_trace.h
+		aInfo.iFlags |= ETraceHeapAllocs;
+	// Create the thread's heap chunk.
+	RChunk c;
+	TChunkCreateInfo createInfo;
+
+	createInfo.SetThreadHeap(0, maxLength, KLitDollarHeap());	// Initialise with no memory committed.	
+#if USE_HYBRID_HEAP
+	//
+	// Create disconnected chunk for hybrid heap with double max length value
+	//
+	maxLength = 2*maxLength;
+	createInfo.SetDisconnected(0, 0, maxLength);
+#endif	
+	// Set the paging policy of the heap chunk based on the thread's paging policy.
+	TUint pagingflags = aInfo.iFlags & EThreadCreateFlagPagingMask;
+	switch (pagingflags)
+		{
+		case EThreadCreateFlagPaged:
+			createInfo.SetPaging(TChunkCreateInfo::EPaged);
+			break;
+		case EThreadCreateFlagUnpaged:
+			createInfo.SetPaging(TChunkCreateInfo::EUnpaged);
+			break;
+		case EThreadCreateFlagPagingUnspec:
+			// Leave the chunk paging policy unspecified so the process's 
+			// paging policy is used.
+			break;
+		}
+	
+	TInt r = c.Create(createInfo);
+	if (r!=KErrNone)
+		return r;
+	
+	aHeap = ChunkHeap(c, minLength, page_size, maxLength, aAlign, aSingleThread, EChunkHeapSwitchTo|EChunkHeapDuplicate);
+	c.Close();
+	
+	if ( !aHeap )
+		return KErrNoMemory;
+	
+	if (aInfo.iFlags & ETraceHeapAllocs)
+		{
+		aHeap->iFlags |= RHeap::ETraceAllocs;
+    	BTraceContext8(BTrace::EHeap, BTrace::EHeapCreate,(TUint32)aHeap, RHybridHeap::EAllocCellSize);
+		TInt chunkId = ((RHandleBase&)((RHybridHeap*)aHeap)->iChunkHandle).BTraceId();
+		BTraceContext8(BTrace::EHeap, BTrace::EHeapChunkCreate, (TUint32)aHeap, chunkId);
+		}
+	if (aInfo.iFlags & EMonitorHeapMemory)
+		aHeap->iFlags |= RHeap::EMonitorMemory;
+	
+	return KErrNone;
+}
+
+#endif  // __KERNEL_MODE__
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/debug/crashMonitor/inc/scmdatasave.h
--- a/kernel/eka/debug/crashMonitor/inc/scmdatasave.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/debug/crashMonitor/inc/scmdatasave.h	Thu Jun 10 11:48:01 2010 +0100
@@ -43,6 +43,7 @@
 
 
 _LIT8(KKernelHeapChunkName, "ekern.exe::SvHeap");
+_LIT8(KKernelProcessName, "ekern.exe");
 
 
 /**
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/debug/crashMonitor/src/scmdatasave.cpp
--- a/kernel/eka/debug/crashMonitor/src/scmdatasave.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/debug/crashMonitor/src/scmdatasave.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -978,11 +978,11 @@
 	{
 	LOG_CONTEXT
 	
-	//Get Chunk object container
-	DObjectCon* objectContainer = Kern::Containers()[EChunk];
+	//Get process object container
+	DObjectCon* objectContainer = Kern::Containers()[EProcess];
 	if(objectContainer == NULL)
 		{		
-		CLTRACE("\tFailed to get object container for the chunks");
+		CLTRACE("\tFailed to get object container for the processes");
 		return KErrNotFound;
 		}
 	
@@ -995,7 +995,39 @@
 	
 	TInt numObjects = objectContainer->Count();	
 	
-	for(TInt cnt = 0; cnt< numObjects; cnt ++)
+	DProcess* kernelProcess = NULL;
+	for(TInt cnt = 0; cnt < numObjects; cnt ++)
+		{		
+		DProcess* candidateProcess = (DProcess*)(*objectContainer)[cnt];
+		
+		//Get the objects name
+		TBuf8<KMaxKernelName> name;
+		candidateProcess->TraceAppendFullName(name,EFalse);		
+		if(name == KKernelProcessName)
+			{
+			kernelProcess = candidateProcess;
+			}
+		}
+	if (!kernelProcess)
+		return KErrNotFound;
+
+	//Get chunk object container
+	objectContainer = Kern::Containers()[EChunk];
+	if(objectContainer == NULL)
+		{		
+		CLTRACE("\tFailed to get object container for the chunks");
+		return KErrNotFound;
+		}
+	
+	//Must check the mutex on this is ok otherwise the data will be in an inconsistent state
+	if(objectContainer->Lock()->iHoldCount)
+		{
+		CLTRACE("\tChunk Container is in an inconsistant state");
+		return KErrCorrupt;
+		}	
+	
+	numObjects = objectContainer->Count();
+	for(TInt cnt = 0; cnt < numObjects; cnt ++)
 		{		
 		DChunk* candidateHeapChunk = (DChunk*)(*objectContainer)[cnt];
 		
@@ -1005,14 +1037,8 @@
 		
 		if(name == KKernelHeapChunkName)
 			{
-			#ifndef __MEMMODEL_FLEXIBLE__
-				aHeapLocation = (TInt32)candidateHeapChunk->iBase;
-			#else
-				aHeapLocation = (TInt32)candidateHeapChunk->iFixedBase;
-			#endif
-				
-				aHeapSize = candidateHeapChunk->iSize;
-				
+			aHeapLocation = (TInt32)candidateHeapChunk->Base(kernelProcess);
+			aHeapSize = candidateHeapChunk->iSize;
 			return KErrNone;
 			}
 		}
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/debug/securityServer/group/rm_debug_svr.mmp
--- a/kernel/eka/debug/securityServer/group/rm_debug_svr.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/debug/securityServer/group/rm_debug_svr.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -46,3 +46,5 @@
 
 //TCB is added for the RLocalDrive methods.
 CAPABILITY AllFiles TCB
+
+SMPSAFE
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/adc/base_e32_drivers_adc.mrp
--- a/kernel/eka/drivers/adc/base_e32_drivers_adc.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/adc/base_e32_drivers_adc.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "ADC controller"
 
 component	base_e32_drivers_adc
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/bsp/base_e32_drivers_bsp.mrp
--- a/kernel/eka/drivers/bsp/base_e32_drivers_bsp.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/bsp/base_e32_drivers_bsp.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Generic Board Support Packages"
 
 component	base_e32_drivers_bsp
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/camerasc/base_drivers_camerasc.mrp
--- a/kernel/eka/drivers/camerasc/base_drivers_camerasc.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/camerasc/base_drivers_camerasc.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Camera Driver - Shared Chunk"
 
 component	base_drivers_camerasc
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/debug/group/base_e32_drivers_debug.mrp
--- a/kernel/eka/drivers/debug/group/base_e32_drivers_debug.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/debug/group/base_e32_drivers_debug.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Run mode debugger"
 
 component	base_e32_drivers_debug
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/debug/group/rm_debug_kerneldriver.mmh
--- a/kernel/eka/drivers/debug/group/rm_debug_kerneldriver.mmh	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/debug/group/rm_debug_kerneldriver.mmh	Thu Jun 10 11:48:01 2010 +0100
@@ -51,3 +51,5 @@
 EPOCALLOWDLLDATA
 
 capability			all
+
+SMPSAFE
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/display/base_e32_drivers_display.mrp
--- a/kernel/eka/drivers/display/base_e32_drivers_display.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/display/base_e32_drivers_display.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Graphics GCE Driver"
 
 component	base_e32_drivers_display
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/eabi/rm_debug_extu.def
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/eabi/rm_debug_extu.def	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,22 @@
+EXPORTS
+	_Z19CreateLogicalDevicev @ 1 NONAME
+	_ZN5Debug7GetListEPKNS_9TListItemEi @ 2 NONAME
+	_ZTI11DDebugAgent @ 3 NONAME
+	_ZTI12DRMDStepping @ 4 NONAME
+	_ZTI14DBufferManager @ 5 NONAME
+	_ZTI14DTargetProcess @ 6 NONAME
+	_ZTI15DProcessTracker @ 7 NONAME
+	_ZTI16DRM_DebugChannel @ 8 NONAME
+	_ZTI17D_RMD_Breakpoints @ 9 NONAME
+	_ZTI21DRM_DebugEventHandler @ 10 NONAME
+	_ZTI22DRM_DebugDriverFactory @ 11 NONAME
+	_ZTV11DDebugAgent @ 12 NONAME
+	_ZTV12DRMDStepping @ 13 NONAME
+	_ZTV14DBufferManager @ 14 NONAME
+	_ZTV14DTargetProcess @ 15 NONAME
+	_ZTV15DProcessTracker @ 16 NONAME
+	_ZTV16DRM_DebugChannel @ 17 NONAME
+	_ZTV17D_RMD_Breakpoints @ 18 NONAME
+	_ZTV21DRM_DebugEventHandler @ 19 NONAME
+	_ZTV22DRM_DebugDriverFactory @ 20 NONAME
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/ecomm/base_e32_drivers_ecomm.mrp
--- a/kernel/eka/drivers/ecomm/base_e32_drivers_ecomm.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/ecomm/base_e32_drivers_ecomm.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Serial Port Driver"
 
 component	base_e32_drivers_ecomm
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/ethernet/base_e32_drivers_ethernet.mrp
--- a/kernel/eka/drivers/ethernet/base_e32_drivers_ethernet.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/ethernet/base_e32_drivers_ethernet.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Ethernet Driver"
 
 component	base_e32_drivers_ethernet
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/locmedia/base_e32_drivers_locmedia.mrp
--- a/kernel/eka/drivers/locmedia/base_e32_drivers_locmedia.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/locmedia/base_e32_drivers_locmedia.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Local Media Subsystem"
 
 component	base_e32_drivers_locmedia
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/locmedia/locmedia.cpp
--- a/kernel/eka/drivers/locmedia/locmedia.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/locmedia/locmedia.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -29,7 +29,6 @@
 #include "locmediaTraces.h"
 #endif
 
-
 #if defined(_DEBUG) && defined(__DEMAND_PAGING__)
 //#define __DEBUG_DEMAND_PAGING__
 #endif
@@ -586,10 +585,12 @@
 			if (r==KErrNone)
 				{
 				__TRACE_TIMING(2);
-				OstTraceDefExt4( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DLOCALDRIVE_REQUEST_READ, "ERead iDriveNumber=%d; length=0x%x; position=0x%x; TLocDrvRequest Object=0x%x", (TInt) iDrive->iDriveNumber, (TUint) m.Length(), (TUint) m.Pos(), (TUint) &m);
+				OstTraceDefExt2( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DLOCALDRIVE_REQUEST_READ, "ERead iDriveNumber=%d; TLocDrvRequest Object=0x%x", (TInt) iDrive->iDriveNumber, (TUint) &m);
+				OstTraceDefExt4( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DLOCALDRIVE_REQUEST_READ2, "ERead length=%x:%x, pos=%x:%x", (TUint) I64HIGH(m.Length()), (TUint) I64LOW(m.Length()), (TUint) I64HIGH(m.Pos()), (TUint) I64LOW(m.Pos()));
 				r=iDrive->Request(m);
 				__TRACE_TIMING(3);
-				OstTraceDefExt4( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DLOCALDRIVE_REQUEST_READ_RETURN, "ERead Return iDriveNumber=%d; length=0x%x; position=0x%x; TLocDrvRequest Object=0x%x", (TInt) iDrive->iDriveNumber, (TUint) m.Length(), (TUint) m.Pos(), (TUint) &m );
+				OstTraceDefExt2( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DLOCALDRIVE_REQUEST_READ_RETURN, "ERead Return iDriveNumber=%d; TLocDrvRequest Object=0x%x", (TInt) iDrive->iDriveNumber, (TUint) &m );
+				OstTraceDefExt4( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DLOCALDRIVE_REQUEST_READ_RETURN2, "ERead Return length=%x:%x, pos=%x:%x", (TUint) I64HIGH(m.Length()), (TUint) I64LOW(m.Length()), (TUint) I64HIGH(m.Pos()), (TUint) I64LOW(m.Pos()));
 				}
 			m.CloseRemoteThread();
 			break;
@@ -600,9 +601,11 @@
 			r=m.ProcessMessageData(a1);
 			if (r==KErrNone)
 				{
-				OstTraceDefExt4( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DLOCALDRIVE_REQUEST_WRITE, "EWrite iDriveNumber=%d; length=0x%x; position=0x%x; TLocDrvRequest Object=0x%x", (TInt) iDrive->iDriveNumber, (TUint) m.Length(), (TUint) m.Pos(), (TUint) &m );
+				OstTraceDefExt2( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DLOCALDRIVE_REQUEST_WRITE, "EWrite iDriveNumber=%d; TLocDrvRequest Object=0x%x", (TInt) iDrive->iDriveNumber, (TUint) &m );
+				OstTraceDefExt4( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DLOCALDRIVE_REQUEST_WRITE2, "EWrite length=%x:%x, pos=%x:%x", (TUint) I64HIGH(m.Length()), (TUint) I64LOW(m.Length()), (TUint) I64HIGH(m.Pos()), (TUint) I64LOW(m.Pos()));
 				r=iDrive->Request(m);
-				OstTraceDefExt4( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DLOCALDRIVE_REQUEST_WRITE_RETURN, "EWrite Return iDriveNumber=%d; length=0x%x; position=0x%x; TLocDrvRequest Object=0x%x", (TInt) iDrive->iDriveNumber, (TUint) m.Length(), (TUint) m.Pos(), (TUint) &m );
+				OstTraceDefExt2( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DLOCALDRIVE_REQUEST_WRITE_RETURN, "EWrite Return iDriveNumber=%d; TLocDrvRequest Object=0x%x", (TInt) iDrive->iDriveNumber, (TUint) &m );
+				OstTraceDefExt4( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DLOCALDRIVE_REQUEST_WRITE_RETURN2, "EWrite Return length=%x:%x, pos=%x:%x", (TUint) I64HIGH(m.Length()), (TUint) I64LOW(m.Length()), (TUint) I64HIGH(m.Pos()), (TUint) I64LOW(m.Pos()));
 				}
 			m.CloseRemoteThread();
 			break;
@@ -1557,7 +1560,7 @@
 	OstTraceFunctionEntry1( TLOCDRVREQUEST_CHECKANDADJUSTFORPARTITION_ENTRY, this );
 	TLocDrv& d=*Drive();
 	__KTRACE_OPT(KLOCDRV,Kern::Printf("CheckAndAdjustForPartition drive %d partition len %lx",d.iDriveNumber,d.iPartitionLen));
-	OstTraceExt2( TRACE_INTERNALS, TLOCDRVREQUEST_CHECKANDADJUSTFORPARTITION1, "iDriveNumber=%d; partition length=0x%lx", d.iDriveNumber, (TInt) d.iPartitionLen );
+	OstTraceExt3( TRACE_INTERNALS, TLOCDRVREQUEST_CHECKANDADJUSTFORPARTITION1, "iDriveNumber=%d; partition length=%x:%x", d.iDriveNumber, (TInt) I64HIGH (d.iPartitionLen), (TInt) I64LOW (d.iPartitionLen));
 	Flags() |= EAdjusted;
 	TInt r;
 	switch (Id())
@@ -1578,7 +1581,7 @@
 		    }
 		case DLocalDrive::EEnlarge:
 			__KTRACE_OPT(KLOCDRV,Kern::Printf("Enlarge request %lx",Length()));
-			OstTrace1( TRACE_INTERNALS, TLOCDRVREQUEST_CHECKANDADJUSTFORPARTITION2, "Enlarge request=0x%lx", Length() );
+			OstTraceExt2( TRACE_INTERNALS, TLOCDRVREQUEST_CHECKANDADJUSTFORPARTITION2, "Enlarge request=%x:%x", (TInt) I64HIGH(Length()), (TInt) I64LOW(Length()) );
 			if (Length()>KMaxTInt)
 				r = KErrArgument;
 			else
@@ -1586,7 +1589,7 @@
 			break;
 		case DLocalDrive::EReduce:
 			__KTRACE_OPT(KLOCDRV,Kern::Printf("Reduce request %lx@%lx",Length(),Pos()));
-			OstTraceExt2( TRACE_INTERNALS, TLOCDRVREQUEST_CHECKANDADJUSTFORPARTITION3, "Reduce request length=0x%lx; position=0x%lx", (TUint) Length(), (TUint) Pos() );
+			OstTraceExt4( TRACE_INTERNALS, TLOCDRVREQUEST_CHECKANDADJUSTFORPARTITION3, "Reduce request length=%x:%x; position=%x:%x", (TUint) I64HIGH(Length()), (TUint) I64LOW(Length()), (TUint) I64HIGH (Pos()), (TUint) I64LOW (Pos()) );
 			if (Pos()+Length()>d.iPartitionLen)
 				r = KErrArgument;
 			else
@@ -1594,7 +1597,7 @@
 			break;
 		case DLocalDrive::EFormat:
 			__KTRACE_OPT(KLOCDRV,Kern::Printf("Format request %lx@%lx",Length(),Pos()));
-			OstTraceExt2( TRACE_INTERNALS, TLOCDRVREQUEST_CHECKANDADJUSTFORPARTITION4, "Format request length=0x%lx; position=0x%lx", (TUint) Length(), (TUint) Pos() );
+			OstTraceExt4( TRACE_INTERNALS, TLOCDRVREQUEST_CHECKANDADJUSTFORPARTITION4, "Format request length=%x:%x; position=%x:%x", (TUint) I64HIGH(Length()),(TUint) I64LOW(Length()), (TUint) I64HIGH (Pos()), (TUint) I64LOW (Pos()) );
 			if (!(DriverFlags() & RLocalDrive::ELocDrvWholeMedia))
 				{
 				if (Pos()>d.iPartitionLen)
@@ -1622,7 +1625,7 @@
 //		    Otherwise the media driver adjust it internally
 		case DMediaPagingDevice::ECodePageInRequest:
 			__KTRACE_OPT(KLOCDPAGING,Kern::Printf("Adjusted Paging read request %lx@%lx",Length(),Pos()));
-			OstTraceDefExt2(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, TLOCDRVREQUESTCHECKANDADJUSTFORPARTITION5, "Adjusted Paging read request length=0x%lx; position=0x%lx", (TUint) Length(),  (TUint) Pos());
+			OstTraceDefExt4(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, TLOCDRVREQUESTCHECKANDADJUSTFORPARTITION5, "Adjusted Paging read request length=%x:%x; position=%x%:%x", (TUint) I64HIGH(Length()), (TUint) I64LOW(Length()),  (TUint) I64HIGH (Pos()), (TUint) I64LOW (Pos()));
 			if (Pos()+Length()>d.iPartitionLen)
 			    {
 				r = KErrArgument;
@@ -1635,7 +1638,7 @@
 		
 		default:	// read or write or fragment
 			__KTRACE_OPT(KLOCDRV,Kern::Printf("R/W request %lx@%lx",Length(),Pos()));
-			OstTraceExt2( TRACE_INTERNALS, TLOCDRVREQUEST_CHECKANDADJUSTFORPARTITION6, "Read/Write request length=0x%x; position=0x%x", (TUint) Length(), (TUint) Pos() );
+			OstTraceExt4( TRACE_INTERNALS, TLOCDRVREQUEST_CHECKANDADJUSTFORPARTITION6, "Read/Write request length=%x:%x; position=%x:%x", (TUint)I64HIGH (Length()), (TUint)I64LOW (Length()), (TUint) I64HIGH (Pos()), (TUint) I64LOW (Pos()));
 			if (DriverFlags() & RLocalDrive::ELocDrvWholeMedia)
 				{
 				if (d.iMedia && d.iMedia->iDriver && Pos()+Length() > d.iMedia->iPartitionInfo.iMediaSizeInBytes)
@@ -2021,7 +2024,8 @@
 	__KTRACE_OPT(KLOCDRV,Kern::Printf("DPrimaryMediaBase(%d)::Request(%08x)",iMediaId,&aReq));
 	__KTRACE_OPT(KLOCDRV,Kern::Printf("this=%x, ReqId=%d, Pos=%lx, Len=%lx, remote thread %O",this,aReq.Id(),aReq.Pos(),aReq.Length(),aReq.RemoteThread()));
 
-	OstTraceDefExt4(OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DPRIMARYMEDIABASE_REQUEST, "reqId=%d; length=0x%lx; position=0x%lx; remote thread=0x%x", (TInt) aReq.Id(), (TUint) aReq.Length(),  (TUint) aReq.Pos(), (TUint) aReq.RemoteThread());
+	OstTraceDefExt2(OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DPRIMARYMEDIABASE_REQUEST, "reqId=%d; remote thread=0x%x", (TInt) aReq.Id(), (TUint) aReq.RemoteThread());
+	OstTraceDefExt4(OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DPRIMARYMEDIABASE_REQUEST2, "length=%x:%x; position=%x:%x", (TUint) I64HIGH(aReq.Length()), (TUint) I64LOW(aReq.Length()), (TUint) I64HIGH(aReq.Pos()), (TUint) I64LOW(aReq.Pos()));
 	
 	TInt reqId = aReq.Id();
 
@@ -2309,7 +2313,8 @@
 		fragment.Flags() = aReq.Flags();
 
 		__KTRACE_OPT2(KLOCDPAGING,KLOCDRV,Kern::Printf("Send fragment (0x%08x) type(%d), length(0x%x), offset within original req(0x%x), pos in media(0x%lx)",&fragment,fragment.Id(), pinnedLen, pos, fragment.Pos()));
-		OstTraceDefExt5(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, DPRIMARYMEDIABASE_PINFRAGMENTSENDRECEIVE3, "Send fragment 0x%08x; type=%d; length=0x%x; offset within original req=0x%x; position in media=0x%lx", (TUint) &fragment, (TInt) fragment.Id(), (TUint) pinnedLen, (TUint) pos, (TUint) fragment.Pos());
+		OstTraceDefExt4(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, DPRIMARYMEDIABASE_PINFRAGMENTSENDRECEIVE3, "Send fragment 0x%08x; type=%d; length=0x%x; offset within original req=0x%x", (TUint) &fragment, (TInt) fragment.Id(), (TUint) pinnedLen, (TUint) pos);
+		OstTraceDefExt3(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, DPRIMARYMEDIABASE_PINFRAGMENTSENDRECEIVE4, "Send fragment 0x%08x; position in media=%x:%x",(TUint) &fragment, (TUint) I64HIGH(fragment.Pos()), (TUint) I64LOW(fragment.Pos()));
 		
 #ifdef BTRACE_PAGING_MEDIA
 		TInt buf[4];
@@ -2748,7 +2753,7 @@
 	DMedia* media=pL->iMedia;
 	TInt r=KErrNone;
 	
-	OstTraceDefExt3( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DPRIMARYMEDIABASE_DOREQUEST, "req Id=%d; length=0x%x; position=0x%x", (TInt) m.Id(), (TInt) m.Length(), (TInt) m.Pos());
+	OstTraceDefExt5( OST_TRACE_CATEGORY_RND, TRACE_REQUEST, DPRIMARYMEDIABASE_DOREQUEST, "req Id=%d; length=%x:%x; position=%x:%x", (TInt) m.Id(), (TUint) I64HIGH(m.Length()), (TUint) I64LOW(m.Length()), (TUint) I64HIGH(m.Pos()), (TUint) I64LOW(m.Pos()) );
 	
 	// re-open this drive's media driver ?
 	if (m.iValue == DLocalDrive::EForceMediaChange)
@@ -4284,7 +4289,8 @@
 		m.RemoteDesOffset()=0;		// pre-aligned
 		m.DriverFlags()=0;
 		__KTRACE_OPT2(KLOCDRV,KLOCDPAGING,Kern::Printf("ReqId=%d, Pos=0x%lx, Len=0x%lx, remote Des 0x%x",m.Id(),m.Pos(),m.Length(),m.RemoteDes()));
-		OstTraceDefExt4(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, DMEDIAPAGINGDEVICE_READ2, "reqId=%d; position=0x%lx; length=0x%x; remote Des=0x%x", (TInt) m.Id(), (TUint) m.Pos(), (TUint) m.Length(), (TUint) m.RemoteDes());
+		OstTraceDefExt2(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, DMEDIAPAGINGDEVICE_READ2, "reqId=%d; remote Des=0x%x", (TInt) m.Id(), (TUint) m.RemoteDes());
+		OstTraceDefExt4(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, DMEDIAPAGINGDEVICE_READ3, "length=%x:%x, pos=%x:%x", (TUint) I64HIGH(m.Length()), (TUint) I64LOW(m.Length()), (TUint) I64HIGH(m.Pos()), (TUint) I64LOW(m.Pos()));
 		
 		__ASSERT_DEBUG(iPrimaryMedia->iBody, LOCM_FAULT());
 		TInt mediaChanges = iPrimaryMedia->iBody->iMediaChanges;
@@ -4402,7 +4408,8 @@
 		m.RemoteDesOffset()=0;		// pre-aligned
 		m.DriverFlags()=0;
 		__KTRACE_OPT2(KLOCDRV,KLOCDPAGING,Kern::Printf("ReqId=%d, Pos=0x%lx, Len=0x%lx, remote Des 0x%x",m.Id(),m.Pos(),m.Length(),m.RemoteDes()));
-		OstTraceDefExt4(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, DMEDIAPAGINGDEVICE_WRITE2, "reqId=%d; position=0x%lx; length=0x%lx; remote Des=0x%x", (TInt) m.Id(), (TUint) m.Pos(), (TUint) m.Length(), (TUint) m.RemoteDes());
+		OstTraceDefExt2(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, DMEDIAPAGINGDEVICE_WRITE2, "reqId=%d; remote Des=0x%x", (TInt) m.Id(), (TUint) m.RemoteDes());
+		OstTraceDefExt4(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, DMEDIAPAGINGDEVICE_WRITE3, "length=%x:%x, pos=%x:%x", (TUint) I64HIGH(m.Length()), (TUint) I64LOW(m.Length()),  (TUint) I64HIGH(m.Pos()), (TUint) I64LOW(m.Pos()));
 		
 		__ASSERT_DEBUG(iPrimaryMedia->iBody, LOCM_FAULT());
 		TInt mediaChanges = iPrimaryMedia->iBody->iMediaChanges;
@@ -4497,8 +4504,8 @@
 	m.RemoteDesOffset() = 0;		// pre-aligned
 	m.DriverFlags()=0;
 	__KTRACE_OPT2(KLOCDRV,KLOCDPAGING,Kern::Printf("ReqId=%d, Pos=0x%lx, Len=0x%lx, remote Des 0x%x",m.Id(),m.Pos(),m.Length(),m.RemoteDes()));
-	OstTraceDefExt4(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, DMEDIAPAGINGDEVICE_DELETENOTIFY2 , "reqId=%d; position=0x%lx; length=0x%lx; remote Des=0x%x", m.Id(), m.Pos(), m.Length(), (TUint) m.RemoteDes());
-
+	OstTraceDefExt2(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, DMEDIAPAGINGDEVICE_DELETENOTIFY2 , "reqId=%d; remote Des=0x%x", m.Id(),(TUint) m.RemoteDes());
+	OstTraceDefExt4(OST_TRACE_CATEGORY_RND, TRACE_DEMANDPAGING, DMEDIAPAGINGDEVICE_DELETENOTIFY3 , "length=%x:%x, pos=%x:%x", (TUint) I64HIGH(m.Length()), (TUint) I64LOW(m.Length()), (TUint) I64HIGH(m.Pos()), (TUint) I64LOW(m.Pos()));
 	// send request aynchronously as we don't particularly care about the result 
 	// and waiting would slow down the thread taking the page fault
 	iPrimaryMedia->RequestCountInc();
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/media/base_e32_drivers_media.mrp
--- a/kernel/eka/drivers/media/base_e32_drivers_media.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/media/base_e32_drivers_media.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Media Drivers"
 
 component	base_e32_drivers_media
@@ -25,6 +10,7 @@
 source	\sf\os\kernelhwsrv\kernel\eka\drivers\medlfs
 source	\sf\os\kernelhwsrv\kernel\eka\drivers\medmmc
 source	\sf\os\kernelhwsrv\kernel\eka\drivers\mednand
+source	\sf\os\kernelhwsrv\kernel\eka\drivers\sdapc
 source	\sf\os\kernelhwsrv\kernel\eka\drivers\pbus\pbusmedia.cpp
 source	\sf\os\kernelhwsrv\kernel\eka\drivers\pbus\spbus.cpp
 source	\sf\os\kernelhwsrv\kernel\eka\drivers\pbus\distribution.policy.s60
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/media/bld.inf
--- a/kernel/eka/drivers/media/bld.inf	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/media/bld.inf	Thu Jun 10 11:48:01 2010 +0100
@@ -42,6 +42,7 @@
 ../pbus/mmc/sdcard/sdcard3c/sdio/dummyexp.h     SYMBIAN_OS_LAYER_PLATFORM_EXPORT_PATH(drivers/sdio/)
 ../pbus/mmc/sdcard/sdcard3c/sdio/sdiocard.h     SYMBIAN_OS_LAYER_PLATFORM_EXPORT_PATH(drivers/sdio/)
 ../pbus/mmc/sdcard/sdcard3c/sdio/sdiocard.inl     SYMBIAN_OS_LAYER_PLATFORM_EXPORT_PATH(drivers/sdio/)
+../sdapc/d_sdapc.h				SYMBIAN_OS_LAYER_PUBLIC_EXPORT_PATH(drivers/)
 
 PRJ_MMPFILES
 
@@ -59,6 +60,7 @@
 #if !defined(WINS) && !defined(GENERIC_X86)
 ../../drivers/pbus/mmc/sdcard/sdcard3c/epbussd
 ../../drivers/pbus/mmc/sdcard/sdcard3c/sdio/epbussdio
+../../drivers/sdapc/d_sdapc
 #endif
 
 // Build the folowing from variant if required.
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/medmmc/medmmc.cpp
--- a/kernel/eka/drivers/medmmc/medmmc.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/medmmc/medmmc.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -759,7 +759,7 @@
 	TUint32 length(I64LOW(iCurrentReq->Length()));
 
 	__KTRACE_OPT(KPBUSDRV, Kern::Printf(">mmd:dr:0x%lx,0x%x", pos, length));
-	OstTraceExt2( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_DO_READ, "Position=0x%lx; Length=0x%x", (TUint) pos, (TUint) length);
+	OstTraceExt3( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_DO_READ, "Position=%x:%x; Length=0x%x", (TUint) I64HIGH(pos), (TUint) I64LOW(pos), (TUint) length);
 	__ASSERT_DEBUG(CurrentRequest() == EMReqIdle, Panic(EDRInUse));
 	__ASSERT_DEBUG(pos < TotalSizeInBytes(), Panic(EDRStart));
 	__ASSERT_DEBUG(iCurrentReq->Length() >= 0, Panic(EDRNotPositive));
@@ -821,7 +821,7 @@
 //
 	{
 	OstTraceFunctionEntryExt( DMMCMEDIADRIVERFLASH_LAUNCHREAD_ENTRY, this );
-	OstTraceExt2( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_LAUNCHREAD, "position=0x%lx; length=0x%x", (TUint) iCurrentReq->Pos(), (TUint) I64LOW(iCurrentReq->Length()));
+	OstTraceExt3( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_LAUNCHREAD, "position=%x:%x; length=0x%x", (TUint) I64HIGH(iCurrentReq->Pos()), (TUint) I64LOW(iCurrentReq->Pos()) ,(TUint) I64LOW(iCurrentReq->Length()));
 	__KTRACE_OPT(KPBUSDRV, Kern::Printf(">mmd:lr:0x%lx,0x%x", aStart, aLength));
 	__ASSERT_DEBUG(TotalSizeInBytes() > aStart, Panic(ELRStart));
 	__ASSERT_DEBUG(aLength > 0, Panic(ELRNotPositive));
@@ -887,7 +887,7 @@
 	{
 	OstTraceFunctionEntry1( DMMCMEDIADRIVERFLASH_LAUNCHDBREAD_ENTRY, this );
 	__KTRACE_OPT(KPBUSDRV, Kern::Printf(">mmd:ldbr:0x%lx,0x%x", iReqCur, I64LOW(iReqEnd - iReqCur)));
-	OstTraceExt2( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_LAUNCHDBREAD, "position=0x%lx; length=0x%x", (TInt) iReqCur, (TInt) I64LOW(iReqEnd - iReqCur));
+	OstTraceExt3( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_LAUNCHDBREAD, "position=%x:%x; length=0x%x", (TInt) I64HIGH(iReqCur), (TInt) I64LOW(iReqCur), (TInt) I64LOW(iReqEnd - iReqCur));
 	__ASSERT_DEBUG(TotalSizeInBytes() > iReqCur, Panic(ELRStart));
 	__ASSERT_DEBUG(I64LOW(iReqEnd - iReqCur) > 0, Panic(ELRNotPositive));
 	__ASSERT_DEBUG(TotalSizeInBytes() >= iReqEnd, Panic(ELREnd));
@@ -948,7 +948,7 @@
 //
 	{
 	OstTraceFunctionEntryExt( DMMCMEDIADRIVERFLASH_LAUNCHPHYSREAD_ENTRY, this );
-	OstTraceExt2( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_LAUNCHPHYSREAD, "position=0x%lx; length=0x%x", (TInt) iReqCur, (TInt) I64LOW(iReqEnd - iReqCur));
+	OstTraceExt3( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_LAUNCHPHYSREAD, "position=%x:%x; length=0x%x", (TInt) I64HIGH(iReqCur), (TInt) I64LOW(iReqCur), (TInt) I64LOW(iReqEnd - iReqCur));
 	__KTRACE_OPT(KPBUSDRV, Kern::Printf(">mmd:physr:0x%lx,0x%x", aStart, aLength));
 	__ASSERT_DEBUG(TotalSizeInBytes() > aStart, Panic(ELRStart));
 	__ASSERT_DEBUG(aLength > 0, Panic(ELRNotPositive));
@@ -1040,7 +1040,7 @@
 	const TUint32 length = I64LOW(iCurrentReq->Length());
 
 	__KTRACE_OPT(KPBUSDRV, Kern::Printf(">mmd:dw:0x%lx,0x%x", pos, length));
-	OstTraceExt2( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_DOWRITE, "position=0x%lx; length=0x%x", (TUint) pos, (TUint) length);
+	OstTraceExt3( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_DOWRITE, "position=%x:%x; length=0x%x", (TUint) I64HIGH(pos), (TUint) I64LOW(pos), (TUint) length);
 	__ASSERT_DEBUG(CurrentRequest() == EMReqIdle, Panic(EDWInUse));
 	__ASSERT_DEBUG(pos < TotalSizeInBytes(), Panic(EDWStart));
 	__ASSERT_DEBUG(length > 0, Panic(EDWNotPositive));
@@ -1075,7 +1075,7 @@
 	const TUint32 length = I64LOW(iCurrentReq->Length());
 
 	__KTRACE_OPT(KPBUSDRV, Kern::Printf(">mmd:df:0x%lx,0x%x", pos, length));
-	OstTraceExt2( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_DOFORMAT, "position=0x%lx; length=0x%x", (TUint) pos, (TUint) length);
+	OstTraceExt3( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_DOFORMAT, "position=%x:%x; length=0x%x", (TUint) I64HIGH(pos), (TUint) I64LOW(pos), (TUint) length);
 	__ASSERT_DEBUG(CurrentRequest() == EMReqIdle, Panic(EDFInUse));
 	__ASSERT_DEBUG(pos < TotalSizeInBytes(), Panic(EDFStart));
 	__ASSERT_DEBUG(length > 0, Panic(EDFNotPositive));
@@ -1116,7 +1116,7 @@
 //
 	{
 	OstTraceFunctionEntryExt( DMMCMEDIADRIVERFLASH_LAUNCHFORMAT_ENTRY, this );
-	OstTraceExt2( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_LAUNCHFORMAT, "position=0x%lx; length=0x%x", (TInt) iReqCur, (TInt) I64LOW(iReqEnd - iReqCur));
+	OstTraceExt3( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_LAUNCHFORMAT, "position=%x:%x; length=0x%x", (TInt) I64HIGH(iReqCur), (TInt) I64LOW(iReqCur), (TInt) I64LOW(iReqEnd - iReqCur));
 	__KTRACE_OPT(KPBUSDRV, Kern::Printf(">mmd:lf:0x%lx,0x%x", aStart, aLength));
 	__ASSERT_DEBUG(TotalSizeInBytes() > aStart, Panic(ELFStart));
 	__ASSERT_DEBUG((aStart & iBlkMsk) == 0, Panic(ELWFmtStAlign));
@@ -1132,8 +1132,8 @@
 		iPhysStart = aStart & ~iBlkMsk;
 
 		// formats are always block-aligned, and the buffer is initialized to 0xff
-		//  Check whether erase commands are supported by this card
-		if (iCard->CSD().CCC() & KMMCCmdClassErase)
+		//  Check whether erase commands are supported by this card		
+		if ( (iCard->CSD().CCC() & KMMCCmdClassErase) && iEraseInfo.iEraseFlags) 		       
 			{
 			// Determine the erase end point for the next command. We don't erase past the preferred erase unit
 			// size. Therefore, check which is lower, the preferred erase unit size or the end of the requested range.
@@ -1215,7 +1215,7 @@
 //
 	{
 	OstTraceExt4(TRACE_FLOW, DMMCMEDIADRIVERFLASH_LAUNCHWRITE_ENTRY, "DMmcMediaDriverFlash::LaunchWrite;aStart=%Ld;aLength=%x;aMedReq=%d;this=%x", aStart, (TUint) aLength, (TInt) aMedReq, (TUint) this);
-	OstTraceExt2( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_LAUNCHWRITE, "position=0x%lx; length=0x%x", (TInt) iReqCur, (TInt) I64LOW(iReqEnd - iReqCur));
+	OstTraceExt3( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_LAUNCHWRITE, "position=%x:%x; length=0x%x", (TInt) I64HIGH(iReqCur), (TInt) I64LOW(iReqCur),(TInt) I64LOW(iReqEnd - iReqCur));
 	__KTRACE_OPT(KPBUSDRV, Kern::Printf("\n>mmd:lw:0x%lx,%d,%d", aStart, aLength, aMedReq));
 	__ASSERT_DEBUG(aMedReq == EMReqWrite || aMedReq == EMReqFormat, Panic(ELWRequest));
 	__ASSERT_DEBUG(TotalSizeInBytes() > aStart, Panic(ELWStart));
@@ -2887,9 +2887,9 @@
 	{
 	OstTraceFunctionEntryExt( DMMCMEDIADRIVERFLASH_READDATAUNTILCACHEEXHAUSTED_ENTRY, this );
 	__KTRACE_OPT(KPBUSDRV, Kern::Printf(">mmd:rdc:%x,%x", iReqCur, iReqEnd));
-	OstTraceExt2( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_READDATAUNTILCACHEEXHAUSTED, "iReqCur=0x%x; iReqEnd=0x%x", (TUint) iReqCur, (TUint) iReqEnd );
+	OstTraceExt3( TRACE_INTERNALS, DMMCMEDIADRIVERFLASH_READDATAUNTILCACHEEXHAUSTED, "iReqCur=%x:%x; iReqEnd=0x%x", (TUint) I64HIGH(iReqCur), (TUint) I64LOW(iReqCur), (TUint) iReqEnd );
 	
-	if ( iCurrentReq->IsPhysicalAddress()
+	if ( (iCurrentReq->DriverFlags() & RLocalDrive::ELocDrvDirectIO) || iCurrentReq->IsPhysicalAddress()
 #if defined(__DEMAND_PAGING__) && !defined(__WINS__)
 	     || DMediaPagingDevice::PageInRequest(*iCurrentReq)
 #endif //DEMAND_PAGING 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/pbus/mmc/sdcard/sdcard3c/sdcard.cpp
--- a/kernel/eka/drivers/pbus/mmc/sdcard/sdcard3c/sdcard.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/pbus/mmc/sdcard/sdcard3c/sdcard.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 1999-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 1999-2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
@@ -27,7 +27,7 @@
 // ======== TSDCard ========
 
 TSDCard::TSDCard()
-:	iProtectedAreaSize(0), iPARootDirEnd(KPARootDirEndUnknown)
+:	iProtectedAreaSize(0), iPARootDirEnd(KPARootDirEndUnknown), iClientCountSD(0)
 	{
 	// empty
 	}
@@ -481,6 +481,12 @@
 		// Before issueing commands, see if there's actually a card present
 		if (!CardDetect(iCxCardCount))
 			SMF_GOTOS(EStMoreCardsCheck)
+		
+		// Card Previously Marked as Corrupt do not re-initialise	
+		if ((CardArray().CardP(iCxCardCount)->iFlags)& KSDCardIsCorrupt)
+		    {
+            SMF_GOTOS(EStMoreCardsCheck)
+		    }
 
 		m.SetTraps(KMMCErrResponseTimeOut);
 		SMF_INVOKES(InitialiseMemoryCardSMST, EStSendCIDIssued)
@@ -814,6 +820,7 @@
 					{
 					__KTRACE_OPT2(KPBUS1, KPANIC, Kern::Printf("-sd:ocr busy timed out"));
 					OstTraceFunctionExitExt( DSDSTACK_INITIALISEMEMORYCARDSM_EXIT2, this, (TInt) KMMCErrBusTimeOut );
+					(CardArray().CardP(iCxCardCount)->iFlags)|=KSDCardIsCorrupt;
 					return KMMCErrBusTimeOut;
 					}
 					
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/power/smppower/idlehelper.cia
--- a/kernel/eka/drivers/power/smppower/idlehelper.cia	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/power/smppower/idlehelper.cia	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 2008-2010 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/power/smppower/idlehelper.cpp
--- a/kernel/eka/drivers/power/smppower/idlehelper.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/power/smppower/idlehelper.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 2008-2010 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/power/smppower/idlehelper_lib.mmp
--- a/kernel/eka/drivers/power/smppower/idlehelper_lib.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/power/smppower/idlehelper_lib.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 2007-2010 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
@@ -11,13 +11,13 @@
 // Contributors:
 //
 // Description:
-// e32\drivers\power\smppower\smpidlehelper_lib.mmp
+// \drivers\power\smppower\smpidlehelper_lib.mmp
 // Helper library required to implement CPU idle
 // functionality in a SMP BSP.
 
 
 #define NO_EKERN_LIB
-#include "../../kernel/kern_ext.mmh"
+#include "kernel/kern_ext.mmh"
 
 target				idlehelper.lib
 targettype			klib
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/power/smppower/sample_idlehandler/smpidlehandler.cpp
--- a/kernel/eka/drivers/power/smppower/sample_idlehandler/smpidlehandler.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/power/smppower/sample_idlehandler/smpidlehandler.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 2008-2010 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
@@ -11,7 +11,7 @@
 // Contributors:
 //
 // Description:
-// os\kernelhwsrv\kernel\eka\drivers\power\smppower\sample_idlehandler\smpidlehandler.cpp
+// eka\drivers\power\smppower\sample_idlehandler\smpidlehandler.cpp
 // implements a basic smp idle handler generic layer that can be derived from 
 // to create platform specific SMP idle handlers
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/power/smppower/sample_idlehandler/smpidlehandler_lib.mmp
--- a/kernel/eka/drivers/power/smppower/sample_idlehandler/smpidlehandler_lib.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/power/smppower/sample_idlehandler/smpidlehandler_lib.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
@@ -17,7 +17,7 @@
 
 
 #define NO_EKERN_LIB
-#include "../../kernel/kern_ext.mmh"
+#include "kernel/kern_ext.mmh"
 
 target				sample_smpidlehandler.lib
 targettype			klib
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/sdapc/d_sdapc.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/sdapc/d_sdapc.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,307 @@
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL " http://www.eclipse.org/legal/epl-v10.html ".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+
+
+#include <kernel/kernel.h>
+#include <drivers/mmc.h>
+#include <drivers/sdcard.h>
+#include <drivers/sdio/sdio.h>
+#include <drivers/d_sdapc.h>
+
+#include "OstTraceDefinitions.h"
+#ifdef OST_TRACE_COMPILER_IN_USE
+#include "locmedia_ost.h"
+#ifdef __VC32__
+#pragma warning(disable: 4127) // disabling warning "conditional expression is constant"
+#endif
+#include "d_sdapcTraces.h"
+#endif
+
+_LIT(KLddName,"D_SDAPC");
+
+const TInt KMajorVersionNumber=1;
+const TInt KMinorVersionNumber=0;
+const TInt KBuildVersionNumber=1;
+
+const TInt KSocketNumber = 0;
+const TInt KStackNumber  = 0;
+const TInt KCardNumber   = 0;
+
+// global Dfc Que
+TDynamicDfcQue* gDfcQ;
+
+class DSDAuxiliaryPowerControlFactory : public DLogicalDevice
+//
+// LDD factory
+//
+	{
+public:
+	DSDAuxiliaryPowerControlFactory();
+	~DSDAuxiliaryPowerControlFactory();
+	virtual TInt Install(); 					//overriding pure virtual
+	virtual void GetCaps(TDes8& aDes) const;	//overriding pure virtual
+	virtual TInt Create(DLogicalChannelBase*& aChannel); 	//overriding pure virtual
+	};
+
+
+class DSDAuxiliaryPowerControl : public DLogicalChannel
+//
+// Logical channel
+//
+	{
+public:
+	DSDAuxiliaryPowerControl();
+	virtual ~DSDAuxiliaryPowerControl();
+
+protected:
+	virtual TInt DoCreate(TInt aUnit, const TDesC8* anInfo, const TVersion& aVer);
+	virtual void HandleMsg(class TMessageBase *);
+
+private:
+	static void BusCallBack(TAny* aPtr, TInt aReason, TAny* a1, TAny* a2);
+	TInt PowerUpStack();
+
+private:
+	DMMCSocket* iSocketP;
+	DMMCStack*  iStackP;
+	TSDCard*  iCardP;
+    
+	DThread* iClient;
+	
+	TPBusCallBack iBusCallBack;		
+	DSemaphore* iPowerUpSemaphore;
+	TBool iInitialised;
+	};
+
+
+DECLARE_STANDARD_LDD()
+	{
+	return new DSDAuxiliaryPowerControlFactory;
+	}
+
+DSDAuxiliaryPowerControlFactory::DSDAuxiliaryPowerControlFactory()
+//
+// Constructor
+//
+	{
+    OstTrace0( TRACE_FLOW, DSDAUXILIARYPOWERCONTROLFACTORY_DSDAUXILIARYPOWERCONTROLFACTORY, "DSDAuxiliaryPowerControlFactory::DSDAuxiliaryPowerControlFactory");
+	__KTRACE_OPT(KPBUS1, Kern::Printf(">DSDAuxiliaryPowerControlFactory::DSDAuxiliaryPowerControlFactory"));
+    iParseMask=KDeviceAllowUnit;
+	iUnitsMask=0xffffffff;
+	iVersion=TVersion(KMajorVersionNumber,KMinorVersionNumber,KBuildVersionNumber);
+	}
+
+TInt DSDAuxiliaryPowerControlFactory::Create(DLogicalChannelBase*& aChannel)
+//
+// Create a new DSDAuxiliaryPowerControl on this logical device
+//
+	{
+    OstTrace0( TRACE_FLOW, DSDAUXILIARYPOWERCONTROLFACTORY_CREATE, "DSDAuxiliaryPowerControlFactory::Create");
+	__KTRACE_OPT(KPBUS1, Kern::Printf(">DSDAuxiliaryPowerControlFactory::Create"));
+	aChannel=new DSDAuxiliaryPowerControl;
+	return aChannel ? KErrNone : KErrNoMemory;
+	}
+
+const TInt KDSDAuxiliaryPowerControlApiThreadPriority = 27;
+_LIT(KDSDAuxiliaryPowerControlApiThread,"DSDAuxiliaryPowerControlApiThread");
+
+TInt DSDAuxiliaryPowerControlFactory::Install()
+//
+// Install the LDD - overriding pure virtual
+//
+	{
+	// Allocate a kernel thread to run the DFC 
+	TInt r = Kern::DynamicDfcQCreate(gDfcQ, KDSDAuxiliaryPowerControlApiThreadPriority, KDSDAuxiliaryPowerControlApiThread);
+
+	if (r != KErrNone)
+		return r; 	
+
+	return SetName(&KLddName);
+	}
+
+void DSDAuxiliaryPowerControlFactory::GetCaps(TDes8& aDes) const
+//
+// Get capabilities - overriding pure virtual
+//
+	{
+	TCapsTestV01 b;
+	b.iVersion=TVersion(KMajorVersionNumber,KMinorVersionNumber,KBuildVersionNumber);
+    Kern::InfoCopy(aDes,(TUint8*)&b,sizeof(b));
+	}
+
+/**
+  Destructor
+*/
+DSDAuxiliaryPowerControlFactory::~DSDAuxiliaryPowerControlFactory()
+	{
+    OstTrace0( TRACE_FLOW, DSDAUXILIARYPOWERCONTROLFACTORY_DSDAUXILIARYPOWERCONTROLFACTORY_DTOR, "DSDAuxiliaryPowerControlFactory::~DSDAuxiliaryPowerControlFactory");
+	__KTRACE_OPT(KPBUS1, Kern::Printf(">DSDAuxiliaryPowerControlFactory::~DSDAuxiliaryPowerControlFactory"));
+	if (gDfcQ)
+		gDfcQ->Destroy();
+	}
+
+void DSDAuxiliaryPowerControl::BusCallBack(TAny* aPtr, TInt aReason, TAny* a1, TAny* a2)
+	{
+	DSDAuxiliaryPowerControl* pTest = (DSDAuxiliaryPowerControl*)aPtr;
+	TPBusState busState = (TPBusState) (TInt) a1;
+	switch (aReason)
+		{
+		case TPBusCallBack::EPBusStateChange:
+			if (busState != EPBusPoweringUp)
+				Kern::SemaphoreSignal(*(pTest->iPowerUpSemaphore));
+			break;
+		}
+	}
+
+TInt DSDAuxiliaryPowerControl::PowerUpStack()
+	{
+	iBusCallBack.iFunction = BusCallBack;
+	iBusCallBack.iPtr=this;
+	iBusCallBack.SetSocket(iSocketP->iSocketNumber);
+	iBusCallBack.Add();
+	TInt r = Kern::SemaphoreCreate(iPowerUpSemaphore, _L("SDPowerUpSem"), 0);
+	if (r == KErrNone)
+		{
+		r = iSocketP->PowerUp();
+		if (r == KErrNone)
+			Kern::SemaphoreWait(*iPowerUpSemaphore);
+		}
+	return r;
+	}
+
+TInt DSDAuxiliaryPowerControl::DoCreate(TInt /*aUnit*/, const TDesC8* /*aInfo*/, const TVersion& aVer)
+//
+// Create channel
+//
+	{
+    OstTrace0( TRACE_FLOW, DSDAUXILIARYPOWERCONTROL_DOCREATE_1, "DSDAuxiliaryPowerControl::DoCreate()");
+	__KTRACE_OPT(KPBUS1, Kern::Printf(">DSDAuxiliaryPowerControl::DoCreate()"));
+
+	if (!Kern::QueryVersionSupported(TVersion(KMajorVersionNumber,KMinorVersionNumber,KBuildVersionNumber),aVer))
+		return KErrNotSupported;
+
+	//
+	// Obtain the appropriate card from the socket/stack
+	//
+	iSocketP = static_cast<DMMCSocket*>(DPBusSocket::SocketFromId(KSocketNumber));
+	if(iSocketP == NULL)
+		{
+        OstTrace0( TRACE_FLOW, DSDAUXILIARYPOWERCONTROL_DOCREATE_2, "DSDAuxiliaryPowerControl::DoCreate() : Didn't obtain socket");
+		__KTRACE_OPT(KPBUS1, Kern::Printf("DSDAuxiliaryPowerControl::DoCreate() : Didn't obtain socket"));
+		return KErrNoMemory;
+		}
+
+	iStackP = static_cast<DSDStack*>(iSocketP->Stack(KStackNumber));
+	if(iStackP == NULL)
+		{
+        OstTrace0( TRACE_FLOW, DSDAUXILIARYPOWERCONTROL_DOCREATE_3, "DSDAuxiliaryPowerControl::DoCreate() : Didn't obtain stack");
+		__KTRACE_OPT(KPBUS1, Kern::Printf("DSDAuxiliaryPowerControl::DoCreate() : Didn't obtain stack"));
+		return KErrNoMemory;
+		}
+
+	iCardP = static_cast<TSDCard*>(iStackP->CardP(KCardNumber));
+	if(iCardP == NULL)
+		{
+        OstTrace0( TRACE_FLOW, DSDAUXILIARYPOWERCONTROL_DOCREATE_4, "DSDAuxiliaryPowerControl::DoCreate() : Didn't obtain card");
+		__KTRACE_OPT(KPBUS1, Kern::Printf("DSDAuxiliaryPowerControl::DoCreate() : Didn't obtain card"));
+		return KErrNoMemory;
+		}
+
+	SetDfcQ(gDfcQ);
+	iMsgQ.Receive();
+
+	// Make sure stack is powered up
+	TInt r = PowerUpStack();
+	if (r != KErrNone && r != KErrCompletion)
+		{
+        OstTrace1( TRACE_FLOW, DSDAUXILIARYPOWERCONTROL_DOCREATE_5, "DSDAuxiliaryPowerControl::DoCreate() : Failed To Power up stack, r = %d", r);
+		__KTRACE_OPT(KPBUS1, Kern::Printf("DSDAuxiliaryPowerControl::DoCreate() : Failed To Power up stack, r = %d", r));
+		return r;
+		}
+		
+	if(!iCardP->IsReady())
+		{
+        OstTrace0( TRACE_FLOW, DSDAUXILIARYPOWERCONTROL_DOCREATE_6, "DSDAuxiliaryPowerControl::DoCreate() : Card not ready");
+		__KTRACE_OPT(KPBUS1, Kern::Printf("DSDAuxiliaryPowerControl::DoCreate() : Card not ready"));
+		return KErrNotReady;
+		}
+    	
+	if(!iCardP->ClientsRegistered())
+		{		
+		iCardP->RegisterClient();
+		((DSDIOPsu*)(iSocketP->iVcc))->Lock();
+		TBool locked = ((DSDIOPsu*)(iSocketP->iVcc))->IsLocked();
+		OstTrace1( TRACE_FLOW, DSDAUXILIARYPOWERCONTROL_DOCREATE_7, "DSDAuxiliaryPowerControl::DoCreate() : PSU IsLocked(), locked = %d", locked);
+		__KTRACE_OPT(KPBUS1, Kern::Printf("DSDAuxiliaryPowerControl::DoCreate() : PSU IsLocked(), locked = %d", locked));
+		if(!locked)
+			return KErrNotReady;
+		}
+		
+	return KErrNone;
+	}
+
+DSDAuxiliaryPowerControl::DSDAuxiliaryPowerControl()
+//
+// Constructor
+//
+	{
+	iClient=&Kern::CurrentThread();
+	((DObject*)iClient)->Open();
+	}
+
+
+DSDAuxiliaryPowerControl::~DSDAuxiliaryPowerControl()
+//
+// Destructor
+//
+	{
+    OstTrace0( TRACE_FLOW, DSDAUXILIARYPOWERCONTROL_DSDAUXILIARYPOWERCONTROL_DTOR, "DSDAuxiliaryPowerControl::~DSDAuxiliaryPowerControl");
+	__KTRACE_OPT(KPBUS1, Kern::Printf("DSDAuxiliaryPowerControl::~DSDAuxiliaryPowerControl"));
+	iBusCallBack.Remove();
+
+	if (iSocketP)
+		iSocketP->ControlIO(DPBusSocket::EControlMediaState, (TAny*)DPBusSocket::EPeriphBusMediaNormal, NULL);
+
+	
+	if(iCardP->ClientsRegistered())
+		{		
+		iCardP->DeregisterClient();
+		((DSDIOPsu*)(iSocketP->iVcc))->Unlock();
+		}
+
+	iPowerUpSemaphore->Close(NULL);
+
+	Kern::SafeClose((DObject*&)iClient,NULL);
+	}
+
+void DSDAuxiliaryPowerControl::HandleMsg(TMessageBase* aMsg)
+    {
+    TThreadMessage& m=*(TThreadMessage*)aMsg;
+    TInt id=m.iValue;
+    
+	if (id==(TInt)ECloseMsg)
+		{
+		if (iSocketP)
+			iSocketP->ControlIO(DPBusSocket::EControlMediaState, (TAny*)DPBusSocket::EPeriphBusMediaNormal, NULL);
+
+		m.Complete(KErrNone, EFalse);
+		return;
+		}
+    else if (id==KMaxTInt)
+		{
+		// DoCancel
+		m.Complete(KErrNone,ETrue);
+		return;
+		}
+	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/sdapc/d_sdapc.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/sdapc/d_sdapc.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,55 @@
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL " http://www.eclipse.org/legal/epl-v10.html ".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+
+
+#ifndef __D_SDAPC_H__
+#define __D_SDAPC_H__
+#include <e32cmn.h>
+
+
+
+
+class TCapsTestV01
+	{
+public:
+	TVersion	iVersion;
+	};
+
+/**
+
+A user-side interface to the SD PSU auxiliary-control driver.
+
+*/
+class RSDAuxiliaryPowerControlAPI : public RBusLogicalChannel
+	{
+public:
+	enum
+		{
+		EMajorVersionNumber=1,
+		EMinorVersionNumber=0,
+		EBuildVersionNumber=1
+		};
+
+public:
+	inline void Cancel();
+	
+	inline TInt Open(TInt aSocket,const TVersion& aVer)
+		{return(DoCreate(_L("D_SDAPC"),aVer,(TInt)aSocket,NULL,NULL));}
+	
+	inline TVersion VersionRequired() const
+		{return(TVersion(EMajorVersionNumber,EMinorVersionNumber,EBuildVersionNumber));}
+	
+	};
+
+#endif
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/sdapc/d_sdapc.mmp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/sdapc/d_sdapc.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,32 @@
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL " http://www.eclipse.org/legal/epl-v10.html ".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+
+#include "kernel/kern_ext.mmh"
+
+TARGET         d_sdapc.ldd
+TARGETTYPE     LDD
+
+SOURCEPATH		.
+SOURCE		d_sdapc.cpp
+LIBRARY		epbussd.lib
+epocallowdlldata
+
+USERINCLUDE		traces
+USERINCLUDE		../../include/drivers
+OS_LAYER_SYSTEMINCLUDE_SYMBIAN
+
+capability	all
+
+SMPSAFE
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/sdapc/traces/OstTraceDefinitions.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/sdapc/traces/OstTraceDefinitions.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,21 @@
+// Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+
+#ifndef __OSTTRACEDEFINITIONS_H__
+#define __OSTTRACEDEFINITIONS_H__
+// OST_TRACE_COMPILER_IN_USE flag has been added by Trace Compiler
+// REMOVE BEFORE CHECK-IN TO VERSION CONTROL
+//#define OST_TRACE_COMPILER_IN_USE
+#include <OpenSystemTrace.h>
+#endif
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/soundsc/base_e32_drivers_sound.mrp
--- a/kernel/eka/drivers/soundsc/base_e32_drivers_sound.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/soundsc/base_e32_drivers_sound.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Audio Driver"
 
 component	base_e32_drivers_sound
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/trace/base_e32_drivers_trace.mrp
--- a/kernel/eka/drivers/trace/base_e32_drivers_trace.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/trace/base_e32_drivers_trace.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Kernel Trace Tool"
 
 component	base_e32_drivers_trace
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbc/base_e32_drivers_usbcli.mrp
--- a/kernel/eka/drivers/usbc/base_e32_drivers_usbcli.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/usbc/base_e32_drivers_usbcli.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "USB Client Driver"
 
 component	base_e32_drivers_usbcli
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbc/usbdma.cpp
--- a/kernel/eka/drivers/usbc/usbdma.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/usbc/usbdma.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -619,7 +619,14 @@
 			{
 			if (iEndpointType == KUsbEpTypeBulk)
 				{
-				isShortPacket = (size < iMaxPacketSize) || (size & maxPacketSizeMask);
+                if(iExtractOffset & maxPacketSizeMask)
+                	{
+                    isShortPacket = ((size+iExtractOffset) < iMaxPacketSize) || ((size+iExtractOffset) & maxPacketSizeMask);
+                	}
+                else
+                	{
+                    isShortPacket = (size < iMaxPacketSize) || (size & maxPacketSizeMask);
+                	}
 				}
 			else
 				{
@@ -830,17 +837,7 @@
 		if (iEndpointType == KUsbEpTypeBulk)
 			{
 			const TInt mask = iMaxPacketSize - 1;
-			if (iTotalRxBytesAvail & mask)
-				return ETrue;
 
-			// residue==0; this can be because
-			// zlps exist, or short packets combine to n * max_packet_size
-			// This means spadework
-			const TInt s = iCurrentPacketSizeArray[iCurrentPacket] - iExtractOffset;
-			if ((s == 0) || (s & mask))
-				{
-				return ETrue;
-				}
 
 			for (TInt i = 0; i < iNumberofBuffers; i++)
 				{
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbcc/descriptors.cpp
--- a/kernel/eka/drivers/usbcc/descriptors.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/drivers/usbcc/descriptors.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -2093,8 +2093,8 @@
 		}
 	return iDescriptors[aIndex]->GetDescriptorData(iEp0_TxBuf, KUsbcBufSz_Ep0Tx);
 	}
-
-
+	
+	
 //
 // Put the current Configuration or Other_Speed_Configuration descriptor + all the following
 // descriptors in the Ep0 Tx buffer.
@@ -2112,22 +2112,46 @@
 		__KTRACE_OPT(KPANIC, Kern::Printf("  Warning: Descriptor %d requested but not available", aIndex));
 		return 0;
 		}
-	const TInt count = iDescriptors.Count();
+		
+	const TInt count = iDescriptors.Count();	
 	TInt copied = 0;
 	TUint8* buf = iEp0_TxBuf;
-	for (TInt i = aIndex; i < count; i++)
+	// pos == count is used so that otg descriptor is added to the end of returned descriptors
+	for (TInt pos = aIndex; pos < count + 1; pos++)
 		{
-		TUsbcDescriptorBase* const ptr = iDescriptors[i];
-		if ((aIndex == KDescPosition_OtherSpeedConfig) && (i == KDescPosition_Config))
+			
+		if ((aIndex == KDescPosition_OtherSpeedConfig) && (pos == KDescPosition_Config))
 			{
 			// Skip Config descriptor when returning Other_Speed_Config
 			continue;
 			}
-		if ((i == KDescPosition_Otg) && (iDescriptors[i] == NULL))
+			
+		if (pos == KDescPosition_Otg) 
 			{
-			__KTRACE_OPT(KUSB, Kern::Printf("  no OTG descriptor -> next"));
+			// Skip otg descriptor just now. add it when pos is count, so that OTG are added at the end
 			continue;
 			}
+						
+		TUsbcDescriptorBase* ptr = NULL;	
+		if (pos == count)
+			{
+				if (iDescriptors[KDescPosition_Otg] == NULL)
+					{
+					// Skip since there is no otg descriptor
+					__KTRACE_OPT(KUSB, Kern::Printf("  no otg descriptor"));
+					continue;				
+					}
+				else
+					{
+					// add otg to the end of returned descriptors
+					ptr = iDescriptors[KDescPosition_Otg];
+					}
+			}
+		else
+			{
+			ptr = iDescriptors[pos];
+			}
+
 		// We need to edit endpoint descriptors on the fly because we have only one copy
 		// of each and that copy has to contain different information, depending on the
 		// current speed and the type of descriptor requested.
@@ -2143,11 +2167,13 @@
 				ptr->UpdateFs();
 				}
 			}
+
 		__KTRACE_OPT(KUSB, Kern::Printf("  desc[%02d]: type = 0x%02x size = %d ",
-										i, ptr->Type(), ptr->Size()));
+										pos, ptr->Type(), ptr->Size()));				
 		const TInt size = ptr->GetDescriptorData(buf, KUsbcBufSz_Ep0Tx - copied);
 		if (size == 0)
 			{
+			
 			__KTRACE_OPT(KPANIC,
 						 Kern::Printf("  Error: No Tx buffer space to copy this descriptor -> exiting"));
 			break;
@@ -2161,6 +2187,8 @@
 			}
 		buf += size;
 		}
+		
+		
 	__KTRACE_OPT(KUSB, Kern::Printf("  copied %d bytes", copied));
 	return copied;
 	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdescriptors/base_drivers_usbdescriptors.mrp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdescriptors/base_drivers_usbdescriptors.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,12 @@
+# component name "USB Descriptors"
+
+component	base_drivers_usbdescriptors
+
+source	\sf\os\kernelhwsrv\kernel\eka\drivers\usbho\usbdescriptors
+
+binary	\sf\os\kernelhwsrv\kernel\eka\drivers\usbho\usbdescriptors all
+
+notes_source	\component_defs\release.src
+
+ipr E
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdescriptors/bld.inf
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdescriptors/bld.inf	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,46 @@
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32/drivers/usbho/usbdescriptors/bld.inf
+// 
+//
+
+/**
+ @file
+*/
+
+
+PRJ_PLATFORMS
+
+ARMV5 ARMV5SMP
+
+
+PRJ_MMPFILES
+
+#ifndef GCCXML
+#if defined(GENERIC_MARM) || !defined(WINS) || defined(GENERIC_X86)
+#if !defined(MARM_THUMB) && !defined(MARM_ARMI)
+
+#if !defined(WINS) 
+#if !defined(X86)
+#if defined(SYMBIAN_ENABLE_USB_OTG_HOST)
+
+usbdescriptors
+
+#endif
+#endif
+#endif
+
+#endif
+#endif
+#endif
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdescriptors/usbdescparser.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdescriptors/usbdescparser.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,379 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Description:
+// Symbian USBDI Descriptor Parsing Framework.
+// 
+//
+
+/**
+ @file
+ @internalComponent
+*/
+
+#include <d32usbdescriptors.h>
+#include "usbdescutils.h"
+
+
+// ---------------------
+// UsbDescriptorParser
+// ---------------------
+
+/**
+The main parsing function of the USB descriptor parsing framework.
+
+This will perform a best effort parse of a USB descriptor tree.  It is best effort in the
+fact that upon encountering a form of syntatic corruption in the source data it will error
+the parse attempt, but also return the incomplete descriptor tree up to the parsing error.
+
+@param aUsbDes The source data that will be parsed.
+@param aDesc The pointer that will be updated to the top-level descriptor.
+
+@return KErrNone if successful, a system-wide error code otherwise.
+
+@publishedPartner
+@prototype
+*/
+EXPORT_C /*static*/ TInt UsbDescriptorParser::Parse(const TDesC8& aUsbDes, TUsbGenericDescriptor*& aDesc)
+	{
+	TInt ret = KErrNone;
+	aDesc = NULL;
+	TPtrC8 des(aUsbDes);
+
+	// First we must find the top level descriptor (the one we will return to the caller).
+	TRAP(ret, aDesc = FindParserAndParseAndCheckL(des, NULL));
+	if(ret == KErrNone)
+		{
+		if(!aDesc)
+			{
+			ret = KErrNotFound;
+			}
+		else
+			{
+			// Now we have a top level descriptor - we now try to build up the descriptor
+			// tree if there are more descriptors available.
+			TRAP(ret, ParseDescriptorTreeL(des, *aDesc));
+			}
+		}
+
+	// Ensure that all the data has been parsed if successful.
+	if(ret == KErrNone && des.Length() > 0)
+		{
+		// If no parser was found for some data then we should have been errored with KErrNotFound.
+		__ASSERT_DEBUG(EFalse, UsbDescFault(UsbdiFaults::EUsbDescSuccessButDataLeftUnparsed));
+		ret = KErrUnknown;
+		}
+
+	// release the allocated descriptor if there was an error
+	if(ret != KErrNone && aDesc)
+		{
+		delete aDesc;
+		aDesc = NULL;
+		}
+
+	return ret;
+	}
+
+/**
+The function to register a custom parsing routine in the USB descriptor parser framework.
+
+The routine is registered locally to the current thread, and so if an application wishes
+to perform the same custom parsing in multiple threads, it must call this function with
+the appropriate routine in each thread context.
+
+If the custom routine becomes unapplicable after being registered, the application may 
+unregister it using the UsbDescriptorParser::UnregisterCustomParser function.
+@see UsbDescriptorParser::UnregisterCustomParser
+
+@param aParserFunc The routine which will be added to the USB descriptor parsing framework.
+
+@publishedPartner
+@prototype
+*/
+EXPORT_C /*static*/ void UsbDescriptorParser::RegisterCustomParserL(TUsbDescriptorParserL aParserFunc)
+	{
+	TBool newlyCreatedList = EFalse;
+	CUsbCustomDescriptorParserList* parserList = static_cast<CUsbCustomDescriptorParserList*>(Dll::Tls());
+	if(!parserList)
+		{
+		parserList = CUsbCustomDescriptorParserList::NewL();
+		newlyCreatedList = ETrue;
+		CleanupStack::PushL(parserList);
+		}
+	
+	parserList->RegisterParserL(aParserFunc);
+
+	if(newlyCreatedList)
+		{
+		Dll::SetTls(parserList);
+		CleanupStack::Pop(parserList);
+		}
+	}
+
+/**
+The function to unregister a custom parsing routine in the USB descriptor parser framework.
+
+This routine will only unregister the routine from the current thread context.  If the routine
+is registered in multiple threads and it is no longer wanted in any thread, an application 
+must call this function in each thread context that the routine is registered.
+
+It is safe to call this function even if RegisterCustomParserL has never been called successfully.
+
+@see UsbDescriptorParser::RegisterCustomParserL
+
+@param aParserFunc The routine which will be removed from the USB descriptor parsing framework.
+
+@publishedPartner
+@prototype
+*/
+EXPORT_C /*static*/ void UsbDescriptorParser::UnregisterCustomParser(TUsbDescriptorParserL aParserFunc)
+	{
+	CUsbCustomDescriptorParserList* parserList = static_cast<CUsbCustomDescriptorParserList*>(Dll::Tls());
+	if(parserList)
+		{
+		parserList->UnregisterParser(aParserFunc);
+		if(parserList->NumOfRegisteredParsers() <= 0)
+			{
+			Dll::FreeTls();
+			delete parserList;
+			}
+		}
+	}
+
+/*static*/ TUsbGenericDescriptor* UsbDescriptorParser::FindParserAndParseAndCheckL(TPtrC8& aUsbDes, TUsbGenericDescriptor* aPreviousDesc)
+	{
+	TUsbGenericDescriptor* ret = FindParserAndParseL(aUsbDes, aPreviousDesc);
+	// We need to ensure that the parsers have correctly initialised the USB descriptor objects.
+	// It is important that we check as it is possible that a custom parser did the parsing.
+	__ASSERT_ALWAYS(!ret || (!ret->iParent && !ret->iFirstChild && !ret->iNextPeer),
+		UsbDescPanic(UsbdiPanics::EUsbDescNonNullPointersAfterParsing));
+	return ret;
+	}
+
+// Utility macro to tidy up the parsing routine.
+#define RETURN_IF_PARSEDL(aRet, aParserL, aUsbDes, aPreviousDesc)\
+	{\
+	aRet = aParserL(aUsbDes, aPreviousDesc);\
+	if(aRet)\
+		{\
+		return aRet;\
+		}\
+	}
+
+/*static*/ TUsbGenericDescriptor* UsbDescriptorParser::FindParserAndParseL(TPtrC8& aUsbDes, TUsbGenericDescriptor* aPreviousDesc)
+	{
+	// Special termination case.
+	if(aUsbDes.Length() == 0)
+		{
+		return NULL;
+		}
+
+	TUsbGenericDescriptor* des;
+
+	// Try the default parsing routines.
+	RETURN_IF_PARSEDL(des, TUsbDeviceDescriptor::ParseL, aUsbDes, aPreviousDesc);
+	RETURN_IF_PARSEDL(des, TUsbDeviceQualifierDescriptor::ParseL, aUsbDes, aPreviousDesc);
+	RETURN_IF_PARSEDL(des, TUsbConfigurationDescriptor::ParseL, aUsbDes, aPreviousDesc);
+	RETURN_IF_PARSEDL(des, TUsbOtherSpeedDescriptor::ParseL, aUsbDes, aPreviousDesc);
+	RETURN_IF_PARSEDL(des, TUsbInterfaceAssociationDescriptor::ParseL, aUsbDes, aPreviousDesc);
+	RETURN_IF_PARSEDL(des, TUsbInterfaceDescriptor::ParseL, aUsbDes, aPreviousDesc);
+	RETURN_IF_PARSEDL(des, TUsbEndpointDescriptor::ParseL, aUsbDes, aPreviousDesc);
+	RETURN_IF_PARSEDL(des, TUsbOTGDescriptor::ParseL, aUsbDes, aPreviousDesc);
+	RETURN_IF_PARSEDL(des, TUsbStringDescriptor::ParseL, aUsbDes, aPreviousDesc);
+
+	// Then we try the custom parsers that have been registered.
+	const CUsbCustomDescriptorParserList* parserList = static_cast<const CUsbCustomDescriptorParserList*>(Dll::Tls());
+	if(parserList)
+		{
+		TInt numOfParsers = parserList->NumOfRegisteredParsers()-1;
+		for(TInt index=0; index<numOfParsers; ++index)
+			{
+			TUsbDescriptorParserL parserL = parserList->RegisteredParser(index);
+			RETURN_IF_PARSEDL(des, parserL, aUsbDes, aPreviousDesc);
+			}
+		}
+
+	// Then we try the unknown descriptor parser.
+	RETURN_IF_PARSEDL(des, UnknownUsbDescriptorParserL, aUsbDes, aPreviousDesc);
+
+	// Otherwise we haven't found anybody to parse the binary data.
+	User::Leave(KErrNotFound); // inform caller that there is no parser for the data.
+	return NULL;
+	}
+	
+/*static*/ void UsbDescriptorParser::ParseDescriptorTreeL(TPtrC8& aUsbDes, TUsbGenericDescriptor& aPreviousDesc)
+	{
+	TUsbGenericDescriptor* desc = &aPreviousDesc;
+	while(desc)
+		{
+		TUsbGenericDescriptor* preDesc = desc;
+		desc = FindParserAndParseAndCheckL(aUsbDes, desc);
+		if(desc)
+			{
+			CleanupStack::PushL(desc);
+			BuildTreeL(*desc, *preDesc);
+			CleanupStack::Pop(desc);
+			}
+		}
+	}
+
+/*static*/ void UsbDescriptorParser::BuildTreeL(TUsbGenericDescriptor& aNewDesc, TUsbGenericDescriptor& aPreviousDesc)
+	{
+	// We assume that the new descriptor has been properly initialised with NULL pointers.
+	__ASSERT_DEBUG(!aNewDesc.iFirstChild && !aNewDesc.iNextPeer && !aNewDesc.iParent,
+		UsbDescFault(UsbdiFaults::EUsbDescTreePointersAlreadySet));
+
+	// Find first "top" parent claiming this new descriptor as a child.
+	TUsbGenericDescriptor* parent = &aPreviousDesc;
+	TUsbGenericDescriptor* topLevel = &aPreviousDesc;
+	while(parent)
+		{
+		if(aNewDesc.IsParent(*parent) || parent->IsChild(aNewDesc))
+			{
+			break; // we have found a parent.
+			}
+		topLevel = parent; // Save the current one for use if we cannot find a parent
+		parent = parent->iParent; // Scroll back up the tree.
+		}
+	__ASSERT_DEBUG(topLevel, UsbDescFault(UsbdiFaults::EUsbDescNoTopLevelDescriptorFound));
+
+	if(parent)
+		{
+		// We should be able to place the descriptor directly as a child of this descriptor,
+		// however it is not that simple because of IADs (Interface Association Descriptors).
+		// The ECN states "All of the interface numbers in the set of associated interfaces must be
+		// contiguous" meaning that if an IAD has two interfaces starting at 1 then the configuration
+		// bundle may have interface descriptors in '1 then 3 then 2' order. As such we need to be able
+		// to go backwards to find the most suitable binding.  The general way for doing this is to
+		// find the right-most, lowest descriptor that descriptor considers a parent.
+        // Where the tree is arranged with peers horizontally linked left to
+        // right, with children linked vertically top to bottom.
+		TUsbGenericDescriptor& suitableParent = FindSuitableParentL(aNewDesc, *parent);
+
+		TUsbGenericDescriptor* peer = suitableParent.iFirstChild;
+		if(peer)
+			{
+			TUsbGenericDescriptor* lastPeer;
+			do
+				{
+				lastPeer = peer;
+				peer = peer->iNextPeer;
+				}
+			while(peer);
+			lastPeer->iNextPeer = &aNewDesc;
+			}
+		else
+			{
+			// we are the first child so just update.
+			suitableParent.iFirstChild = &aNewDesc;
+			}
+		aNewDesc.iParent = &suitableParent;
+		}
+	else if(aNewDesc.IsPeer(*topLevel) || topLevel->IsPeer(aNewDesc))
+		{
+		// There is no explicit parent in the tree so, we may just have a group of top-level peers
+		// in the bundle.  If the previous descriptor is a peer then we shall just tag on its tier.
+		TUsbGenericDescriptor* lastPeer;
+		TUsbGenericDescriptor* peer = topLevel;
+		do
+			{
+			lastPeer = peer;
+			peer = peer->iNextPeer;
+			}
+		while(peer);
+		lastPeer->iNextPeer = &aNewDesc;
+		}
+	else
+		{
+		// The descriptor could not be bound into the tree, indicating that the bundle of descriptors
+		// is unvalid.
+		User::Leave(KErrUsbBadDescriptorTopology);
+		}
+	}
+	
+/*static*/ TUsbGenericDescriptor& UsbDescriptorParser::FindSuitableParentL(TUsbGenericDescriptor& aNewDesc, TUsbGenericDescriptor& aTopParent)
+	{
+	// This implements the algorithm to search down from the top parent found in the tree to the right most, lowest descriptor
+	// that will accept the new descriptor as a child.
+
+	TUsbGenericDescriptor* bestMatch = &aTopParent;
+
+	TUsbGenericDescriptor* desc = aTopParent.iFirstChild;
+	if(desc)
+		{
+		// Do a depth first search.
+		FOREVER
+			{
+			// First see if the descriptor is suitable.
+			__ASSERT_DEBUG(desc, UsbDescFault(UsbdiFaults::EUsbDescRunOffTree));
+			if(aNewDesc.IsParent(*desc) || desc->IsChild(aNewDesc))
+				{
+				bestMatch = desc;
+				}
+			// Now walk to the next point in the tree.
+			if(desc->iFirstChild)
+				{
+				desc = desc->iFirstChild;
+				}
+			else if(desc->iNextPeer)
+				{
+				desc = desc->iNextPeer;
+				}
+			else
+				{
+				// We've run to the end of a bottom tier, so go back up.
+				do
+					{
+					__ASSERT_DEBUG(desc->iParent, UsbDescFault(UsbdiFaults::EUsbDescTreeMemberHasNoParent));
+					desc = desc->iParent;
+					}
+				while(!desc->iNextPeer && desc != &aTopParent);
+				if(desc == &aTopParent)
+					{
+					// This means that we must have got back to the original
+					// parent.  So we don't do any more.
+					break;
+					}
+				desc = desc->iNextPeer;
+				}
+			}
+		}
+	return *bestMatch;
+	}
+
+/*static*/ TUsbGenericDescriptor* UsbDescriptorParser::UnknownUsbDescriptorParserL(TPtrC8& aUsbDes, TUsbGenericDescriptor* /*aPreviousDesc*/)
+	{
+	TUsbGenericDescriptor* unknownDes = NULL;
+
+	const TInt KMinUnknownDesLength = 2; // Length and type fields
+	if(	aUsbDes.Length() >= KMinUnknownDesLength)
+		{
+		// We require unknown descriptors to have at least the length and type fields.
+		// Any more exotic descriptors should have a custom parser for the framework to use.
+		TUint8 unknownDesLen = aUsbDes[TUsbGenericDescriptor::KbLengthOffset];
+
+		// Robustness check - check the length field is valid.
+		if(aUsbDes.Length() < unknownDesLen || unknownDesLen < KMinUnknownDesLength)
+			{
+			User::Leave(KErrCorrupt);
+			}
+
+		unknownDes = new(ELeave) TUsbGenericDescriptor;
+		// Set the standard fields
+		unknownDes->ibLength = unknownDesLen;
+		unknownDes->ibDescriptorType = aUsbDes[TUsbGenericDescriptor::KbDescriptorTypeOffset] ;
+		// Set the blob appropriately
+		unknownDes->iBlob.Set(aUsbDes.Left(unknownDesLen));
+		// Update the data-left-to-parse Symbian descriptor
+		aUsbDes.Set(aUsbDes.Mid(unknownDesLen));
+		}
+
+	return unknownDes;
+	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdescriptors/usbdescriptors.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdescriptors/usbdescriptors.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,1356 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Description:
+// Symbian USBDI Descriptors Parsing Routines.
+// 
+//
+
+/**
+ @file
+ @publishedPartner
+*/
+
+#include <d32usbdescriptors.h>
+#include "usbdescutils.h"
+
+
+// ----------------
+// TUsbGenericDescriptor
+// ----------------
+
+EXPORT_C TUsbGenericDescriptor::TUsbGenericDescriptor()
+	: iRecognisedAndParsed(EUnrecognised)
+	, iNextPeer(NULL)
+	, iFirstChild(NULL)
+	, iParent(NULL)
+	{
+	}
+
+/**
+Deletes all child and peer descriptors.  Does not delete this descriptor, the caller is responsible for
+doing this separately.
+*/
+EXPORT_C void TUsbGenericDescriptor::DestroyTree()
+	{
+	// Store the tree pointers
+	TUsbGenericDescriptor* child = this->iFirstChild;
+	TUsbGenericDescriptor* peer = this->iNextPeer;
+
+	// Now we chop off the tree from the root node, by doing this
+	// we don't need to NULL pointers as we go down (which makes
+	// the iterative algorithm more efficient).
+	this->iFirstChild = NULL;
+	this->iNextPeer = NULL;
+
+	// Now we walk and destroy the tree from the two pointers
+	// we have
+	WalkAndDelete(child);
+	WalkAndDelete(peer);
+	}
+	
+void TUsbGenericDescriptor::WalkAndDelete(TUsbGenericDescriptor* aDesc)
+	{
+	if(!aDesc)
+		{
+		return;
+		}
+
+	TUsbGenericDescriptor* topLevel = aDesc->iParent;
+	do
+		{
+		if(aDesc->iFirstChild)
+			{
+			// walk down the tree depth first.
+			aDesc = aDesc->iFirstChild;
+			}
+		else if(aDesc->iNextPeer)
+			{
+			// Walk along each peer at the "bottom"
+			TUsbGenericDescriptor* peer = aDesc->iNextPeer;
+			delete aDesc;
+			aDesc = peer;
+			}
+		else
+			{
+			// End of bottom tier, so we go back up to the parent
+			// and null the first child pointer so we don't go back
+			// down again.
+			TUsbGenericDescriptor* parent = aDesc->iParent;
+			delete aDesc;
+			aDesc = parent;
+			if(aDesc)
+				{
+				aDesc->iFirstChild = NULL;
+				}
+			
+			// if we have gone up to the top level for destruction then we don't
+			// do anymore.
+			if(aDesc == topLevel)
+				{
+				break;
+				}
+			}
+		}
+	while(aDesc);
+	}
+
+/**
+Utility method to retrieve a TUint8 value from a given offset in the descriptor.
+@param aOffset The offset in the binary blob at which to retrieve the value.
+@return The value from the descriptor.
+*/
+EXPORT_C TUint8 TUsbGenericDescriptor::TUint8At(TInt aOffset) const
+	{
+	return ParseTUint8(iBlob, aOffset);
+	}
+
+/**
+Utility method to retrieve a TUint16 value from a given offset in the descriptor.
+@param aOffset The offset in the binary blob at which to retrieve the value.
+@return The value from the descriptor.
+*/
+EXPORT_C TUint16 TUsbGenericDescriptor::TUint16At(TInt aOffset) const
+	{
+	return ParseTUint16(iBlob, aOffset);
+	}
+
+/**
+Utility method to retrieve a TUint32 value from a given offset in the descriptor.
+@param aOffset The offset in the binary blob at which to retrieve the value.
+@return The value from the descriptor.
+*/
+EXPORT_C TUint32 TUsbGenericDescriptor::TUint32At(TInt aOffset) const
+	{
+	return ParseTUint32(iBlob, aOffset);
+	}
+
+/**
+Assignment operator to fill in the TUsbGenericDescriptor fields from a TUsbGenericDescriptor.
+Note that if a TUsbGenericDescriptor derived class has additional member fields then
+they should define a specialised assignment overload for that type.
+*/
+EXPORT_C TUsbGenericDescriptor& TUsbGenericDescriptor::operator=(const TUsbGenericDescriptor& aDescriptor)
+	{
+	ibLength = aDescriptor.ibLength;
+	ibDescriptorType = aDescriptor.ibDescriptorType;
+	iRecognisedAndParsed = aDescriptor.iRecognisedAndParsed;
+	iNextPeer = aDescriptor.iNextPeer;
+	iFirstChild = aDescriptor.iFirstChild;
+	iParent = aDescriptor.iParent;
+	iBlob.Set(aDescriptor.iBlob);
+	return *this;
+	}
+
+/**
+This function determines whether the given USB descriptor is a parent
+of the descriptor the method is called on.  The implementation may be
+specialised for each type of descriptor to ensure the tree is correctly
+built up.
+@param aPotentialRelative The USB descriptor that is being queried to see if it is a parent or peer.
+@return TBool Efalse if the given USB descriptor is a parent of this USB descriptor, ETrue if a peer of this descriptor
+*/
+/*virtual*/ TBool TUsbGenericDescriptor::IsParent(TUsbGenericDescriptor& aPotentialParent)
+	{
+	// As generic descriptors we consider all other "unknown" descriptors as peers, and
+	// all "known" descriptors as parents of the descriptor.
+	switch(aPotentialParent.ibDescriptorType)
+		{
+	case EDevice:
+	case EConfiguration:
+	case EString:
+	case EInterface:
+	case EEndpoint:
+	case EDeviceQualifier:
+	case EOtherSpeedConfiguration:
+	case EInterfacePower:
+	case EOTG:
+	case EDebug:
+	case EInterfaceAssociation:
+		return ETrue;
+	default:
+		return EFalse;
+		}
+	}
+
+/**
+This function determines whether the given USB descriptor is a peer
+of the descriptor the method is called on.  The implementation may be
+specialised for each type of descriptor to ensure the tree is correctly
+built up.
+@param aPotentialPeer The USB descriptor that is being queried to see if it is a peer.
+@return TBool EFalse if the given USB descriptor is a parent of this USB descriptor, ETrue if a peer of this descriptor
+*/
+/*virtual*/ TBool TUsbGenericDescriptor::IsPeer(TUsbGenericDescriptor& /*aPotentialPeer*/)
+	{
+	// As generic descriptors we are very permissive in binding peers.
+	return ETrue;
+	}
+
+/**
+This function determines whether the given USB descriptor is a child
+of the descriptor the method is called on.  The implementation may be
+specialised for each type of descriptor to ensure the tree is correctly
+built up.
+@param aPotentialChild The USB descriptor that is being queried to see if it is a child.
+@return TBool ETrue if the given USB descriptor is a child of this USB descriptor, ETrue if a peer of this descriptor
+*/
+/*virtual*/ TBool TUsbGenericDescriptor::IsChild(TUsbGenericDescriptor& /*aPotentialChild*/)
+	{
+	// We just use the logic in the IsParent.
+	return EFalse;
+	}
+
+/**
+Ensures no memory is leaked if an owned TUsbGenericDescriptor is no longer needed.
+@param aPtr The TUsbGenericDescriptor that is to be cleaned up.
+@internalComponent
+*/
+EXPORT_C /*static*/ void TUsbGenericDescriptor::Cleanup(TAny* aPtr)
+	{
+	TUsbGenericDescriptor* ptr = static_cast<TUsbGenericDescriptor*>(aPtr);
+	ptr->DestroyTree(); // belt and braces really.
+	delete ptr;
+	}
+
+
+// ----------------------
+// TUsbDeviceDescriptor
+// See section 9.6.1 of the USB 2.0 specification.
+// ----------------------
+
+EXPORT_C TUsbDeviceDescriptor::TUsbDeviceDescriptor()
+	{
+	}
+
+EXPORT_C /*static*/ TUsbDeviceDescriptor* TUsbDeviceDescriptor::Cast(TUsbGenericDescriptor* aOriginal)
+	{
+	TUsbDeviceDescriptor* ret = NULL;
+	// Only cast if correctly indentified as device descriptor
+	if(	aOriginal &&
+		aOriginal->ibDescriptorType == EDevice &&
+		aOriginal->ibLength == TUsbDeviceDescriptor::KSizeInOctets &&
+		aOriginal->iRecognisedAndParsed == ERecognised)
+		{
+		ret = static_cast<TUsbDeviceDescriptor*>(aOriginal);
+		}
+	return ret;
+	}
+
+EXPORT_C TUint16 TUsbDeviceDescriptor::USBBcd() const
+	{
+    return ParseTUint16(iBlob, EbcdUSB);
+	}
+	
+EXPORT_C TUint8 TUsbDeviceDescriptor::DeviceClass() const
+	{
+	return ParseTUint8(iBlob, EbDeviceClass);
+	}
+
+EXPORT_C TUint8 TUsbDeviceDescriptor::DeviceSubClass() const
+	{
+	return ParseTUint8(iBlob, EbDeviceSubClass);
+	}
+
+EXPORT_C TUint8 TUsbDeviceDescriptor::DeviceProtocol() const
+	{
+	return ParseTUint8(iBlob, EbDeviceProtocol);
+	}
+
+EXPORT_C TUint8 TUsbDeviceDescriptor::MaxPacketSize0() const
+	{
+	return ParseTUint8(iBlob, EbMaxPacketSize0);
+	}
+
+EXPORT_C TUint16 TUsbDeviceDescriptor::VendorId() const
+	{
+	return ParseTUint16(iBlob, EidVendor);
+	}
+
+EXPORT_C TUint16 TUsbDeviceDescriptor::ProductId() const
+	{
+	return ParseTUint16(iBlob, EidProduct);
+	}
+
+EXPORT_C TUint16 TUsbDeviceDescriptor::DeviceBcd() const
+	{
+	return ParseTUint16(iBlob, EbcdDevice);
+	}
+
+EXPORT_C TUint8 TUsbDeviceDescriptor::ManufacturerIndex() const
+	{
+	return ParseTUint8(iBlob, EiManufacturer);
+	}
+
+EXPORT_C TUint8 TUsbDeviceDescriptor::ProductIndex() const
+	{
+	return ParseTUint8(iBlob, EiProduct);
+	}
+
+EXPORT_C TUint8 TUsbDeviceDescriptor::SerialNumberIndex() const
+	{
+	return ParseTUint8(iBlob, EiSerialNumber);
+	}
+
+EXPORT_C TUint8 TUsbDeviceDescriptor::NumConfigurations() const
+	{
+	return ParseTUint8(iBlob, EbNumConfigurations);
+	}
+
+/**
+The parsing routine for device descriptors.
+Here the previous descriptor parameter is ignored - because logically a device descriptor can be neither a peer
+nor a child.
+
+@internalComponent
+*/
+/*static*/ TUsbDeviceDescriptor* TUsbDeviceDescriptor::ParseL(TPtrC8& aUsbDes, TUsbGenericDescriptor* aPreviousDesc)
+	{
+	TUsbDeviceDescriptor* devDes = NULL;
+
+	const TInt KMinDeviceDesDecisionLength = 2;
+	if(	aUsbDes.Length() >= KMinDeviceDesDecisionLength &&
+		aUsbDes[KbDescriptorTypeOffset] == EDevice &&
+		aUsbDes[KbLengthOffset] == TUsbDeviceDescriptor::KSizeInOctets)
+		{
+		// Robustness check - check the length field is valid, and that we have enough data.
+		if(aUsbDes.Length() < TUsbDeviceDescriptor::KSizeInOctets)
+			{
+			User::Leave(KErrCorrupt);
+			}
+			
+		// Robustness check - check that the device descriptor is the first to be parsed.
+		if(aPreviousDesc)
+			{
+			User::Leave(KErrCorrupt);
+			}
+
+		// Looks ok to be a device descriptor.
+		devDes = new(ELeave) TUsbDeviceDescriptor;
+		// Set the standard fields
+		devDes->ibLength = TUsbDeviceDescriptor::KSizeInOctets;
+		devDes->ibDescriptorType = EDevice;
+		// Set the blob appropriately
+		devDes->iBlob.Set(aUsbDes.Left(TUsbDeviceDescriptor::KSizeInOctets));
+		
+		devDes->iRecognisedAndParsed = ERecognised;
+
+		// Update the data-left-to-parse Symbian descriptor
+		aUsbDes.Set(aUsbDes.Mid(TUsbDeviceDescriptor::KSizeInOctets));
+		}
+
+	return devDes;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbDeviceDescriptor::IsParent(TUsbGenericDescriptor& /*aPotentialParent*/)
+	{
+	// The device descriptor should only come by itself in a bundle, so must be top-level.
+	return EFalse;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbDeviceDescriptor::IsPeer(TUsbGenericDescriptor& /*aPotentialPeer*/)
+	{
+	// The device descriptor should only come by itself in a bundle, so no other peers.
+	return EFalse;
+	}
+
+
+// ------------------------------
+// TUsbDeviceQualifierDescriptor
+// See section 9.6.2 of the USB 2.0 specification.
+// ------------------------------
+
+EXPORT_C TUsbDeviceQualifierDescriptor::TUsbDeviceQualifierDescriptor()
+	{
+	}
+	
+EXPORT_C /*static*/ TUsbDeviceQualifierDescriptor* TUsbDeviceQualifierDescriptor::Cast(TUsbGenericDescriptor* aOriginal)
+	{
+	TUsbDeviceQualifierDescriptor* ret = NULL;
+	// Only cast if correctly indentified as device qualifier descriptor
+	if(	aOriginal &&
+		aOriginal->ibDescriptorType == EDeviceQualifier &&
+		aOriginal->ibLength == TUsbDeviceQualifierDescriptor::KSizeInOctets &&
+		aOriginal->iRecognisedAndParsed == ERecognised)
+		{
+		ret = static_cast<TUsbDeviceQualifierDescriptor*>(aOriginal);
+		}
+	return ret;
+	}
+
+EXPORT_C TUint16 TUsbDeviceQualifierDescriptor::USBBcd() const
+	{
+	return ParseTUint16(iBlob, EbcdUSB);
+	}
+
+EXPORT_C TUint8 TUsbDeviceQualifierDescriptor::DeviceClass() const
+	{
+	return ParseTUint8(iBlob, EbDeviceClass);
+	}
+
+EXPORT_C TUint8 TUsbDeviceQualifierDescriptor::DeviceSubClass() const
+	{
+	return ParseTUint8(iBlob, EbDeviceSubClass);
+	}
+
+EXPORT_C TUint8 TUsbDeviceQualifierDescriptor::DeviceProtocol() const
+	{
+	return ParseTUint8(iBlob, EbDeviceProtocol);
+	}
+
+EXPORT_C TUint8 TUsbDeviceQualifierDescriptor::MaxPacketSize0() const
+	{
+	return ParseTUint8(iBlob, EbMaxPacketSize0);
+	}
+
+EXPORT_C TUint8 TUsbDeviceQualifierDescriptor::NumConfigurations() const
+	{
+	return ParseTUint8(iBlob, EbNumConfigurations);
+	}
+
+EXPORT_C TUint8 TUsbDeviceQualifierDescriptor::Reserved() const
+	{
+	return ParseTUint8(iBlob, EbReserved);
+	}
+	
+/**
+The parsing routine for device qualifier descriptors.
+
+@internalComponent
+*/
+/*static*/ TUsbDeviceQualifierDescriptor* TUsbDeviceQualifierDescriptor::ParseL(TPtrC8& aUsbDes, TUsbGenericDescriptor* /*aPreviousDesc*/)
+	{
+	TUsbDeviceQualifierDescriptor* devQualDes = NULL;
+
+	const TInt KMinDevQualDesDecisionLength = 2;
+	if(	aUsbDes.Length() >= KMinDevQualDesDecisionLength &&
+		aUsbDes[KbDescriptorTypeOffset] == EDeviceQualifier &&
+		aUsbDes[KbLengthOffset] == TUsbDeviceQualifierDescriptor::KSizeInOctets)
+		{
+		// Robustness check - check the length field is valid, and that we have enough data.
+		if(aUsbDes.Length() < TUsbDeviceQualifierDescriptor::KSizeInOctets)
+			{
+			User::Leave(KErrCorrupt);
+			}
+
+		// Looks ok to be a device quialifier descriptor.
+		devQualDes = new(ELeave) TUsbDeviceQualifierDescriptor;
+		// Set the standard fields
+		devQualDes->ibLength = TUsbDeviceQualifierDescriptor::KSizeInOctets;
+		devQualDes->ibDescriptorType = EDeviceQualifier;
+		// Set the blob appropriately
+		devQualDes->iBlob.Set(aUsbDes.Left(TUsbDeviceQualifierDescriptor::KSizeInOctets));
+
+		devQualDes->iRecognisedAndParsed = ERecognised;
+
+		// Update the data-left-to-parse Symbian descriptor
+		aUsbDes.Set(aUsbDes.Mid(TUsbDeviceQualifierDescriptor::KSizeInOctets));
+		}
+
+	return devQualDes;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbDeviceQualifierDescriptor::IsParent(TUsbGenericDescriptor& /*aPotentialParent*/)
+	{
+	// Like a device descriptor, they should be top-level.
+	return EFalse;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbDeviceQualifierDescriptor::IsPeer(TUsbGenericDescriptor& /*aPotentialPeer*/)
+	{
+	// Like a device descriptor, they should come by themselves.
+	return EFalse;
+	}
+
+
+// ----------------------------
+// TUsbConfigurationDescriptor
+// See section 9.6.3 of the USB 2.0 specification.
+// ----------------------------
+
+EXPORT_C TUsbConfigurationDescriptor::TUsbConfigurationDescriptor()
+	{
+	}
+	
+EXPORT_C /*static*/ TUsbConfigurationDescriptor* TUsbConfigurationDescriptor::Cast(TUsbGenericDescriptor* aOriginal)
+	{
+	TUsbConfigurationDescriptor* ret = NULL;
+	// Only cast if correctly indentified as configuration descriptor
+	if(	aOriginal &&
+		aOriginal->ibDescriptorType == EConfiguration &&
+		aOriginal->ibLength == TUsbConfigurationDescriptor::KSizeInOctets &&
+		aOriginal->iRecognisedAndParsed == ERecognised)
+		{
+		ret = static_cast<TUsbConfigurationDescriptor*>(aOriginal);
+		}
+	return ret;
+	}
+
+EXPORT_C TUint16 TUsbConfigurationDescriptor::TotalLength() const
+	{
+	return ParseTUint16(iBlob, EwTotalLength);
+	}
+
+EXPORT_C TUint8 TUsbConfigurationDescriptor::NumInterfaces() const
+	{
+	return ParseTUint8(iBlob, EbNumInterfaces);
+	}
+
+EXPORT_C TUint8 TUsbConfigurationDescriptor::ConfigurationValue() const
+	{
+	return ParseTUint8(iBlob, EbConfigurationValue);
+	}
+
+EXPORT_C TUint8 TUsbConfigurationDescriptor::ConfigurationIndex() const
+	{
+	return ParseTUint8(iBlob, EiConfiguration);
+	}
+
+EXPORT_C TUint8 TUsbConfigurationDescriptor::Attributes() const
+	{
+	return ParseTUint8(iBlob, EbmAttributes);
+	}
+
+EXPORT_C TUint8 TUsbConfigurationDescriptor::MaxPower() const
+	{
+	return ParseTUint8(iBlob, EbMaxPower);
+	}
+
+/**
+The parsing routine for configuration descriptors.
+
+@internalComponent
+*/
+/*static*/ TUsbConfigurationDescriptor* TUsbConfigurationDescriptor::ParseL(TPtrC8& aUsbDes, TUsbGenericDescriptor* /*aPreviousDesc*/)
+	{
+	TUsbConfigurationDescriptor* configDes = NULL;
+
+	const TInt KMinConfigDesDecisionLength = 2;
+	if(	aUsbDes.Length() >= KMinConfigDesDecisionLength &&
+		aUsbDes[KbDescriptorTypeOffset] == EConfiguration &&
+		aUsbDes[KbLengthOffset] == TUsbConfigurationDescriptor::KSizeInOctets)
+		{
+		// Robustness check - check the length field is valid, and that we have enough data.
+		if(aUsbDes.Length() < TUsbConfigurationDescriptor::KSizeInOctets)
+			{
+			User::Leave(KErrCorrupt);
+			}
+			
+		// Robustness check - check that there is sufficient data for whole bundle (wTotalLength)
+		const TInt KwTotalLengthOffset = 2;
+		if(aUsbDes.Length() < ParseTUint16(aUsbDes, KwTotalLengthOffset))
+			{
+			User::Leave(KErrCorrupt);
+			}
+
+		// Looks ok to be a configuration descriptor.
+		configDes = new(ELeave) TUsbConfigurationDescriptor;
+		// Set the standard fields
+		configDes->ibLength = TUsbConfigurationDescriptor::KSizeInOctets;
+		configDes->ibDescriptorType = EConfiguration;
+		// Set the blob appropriately
+		configDes->iBlob.Set(aUsbDes.Left(TUsbConfigurationDescriptor::KSizeInOctets));
+
+		configDes->iRecognisedAndParsed = ERecognised;
+
+		// Update the data-left-to-parse Symbian descriptor
+		aUsbDes.Set(aUsbDes.Mid(TUsbConfigurationDescriptor::KSizeInOctets));
+		}
+
+	return configDes;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbConfigurationDescriptor::IsParent(TUsbGenericDescriptor& /*aPotentialParent*/)
+	{
+	// A configuration descriptor should always be the top-level descriptor in a configuration
+	// bundle.
+	return EFalse;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbConfigurationDescriptor::IsPeer(TUsbGenericDescriptor& /*aPotentialPeer*/)
+	{
+	// There should only ever be one configuration descriptor in a bundle.
+	return EFalse;
+	}
+
+
+// --------------------------
+// TUsbOtherSpeedDescriptor
+// See section 9.6.4 of the USB 2.0 specification.
+// --------------------------
+
+EXPORT_C TUsbOtherSpeedDescriptor::TUsbOtherSpeedDescriptor()
+	{
+	}
+	
+EXPORT_C /*static*/ TUsbOtherSpeedDescriptor* TUsbOtherSpeedDescriptor::Cast(TUsbGenericDescriptor* aOriginal)
+	{
+	TUsbOtherSpeedDescriptor* ret = NULL;
+	// Only cast if correctly indentified as other speed descriptor
+	if(	aOriginal &&
+		aOriginal->ibDescriptorType == EOtherSpeedConfiguration &&
+		aOriginal->ibLength == TUsbOtherSpeedDescriptor::KSizeInOctets &&
+		aOriginal->iRecognisedAndParsed == ERecognised)
+		{
+		ret = static_cast<TUsbOtherSpeedDescriptor*>(aOriginal);
+		}
+	return ret;
+	}
+
+EXPORT_C TUint16 TUsbOtherSpeedDescriptor::TotalLength() const
+	{
+	return ParseTUint16(iBlob, EwTotalLength);
+	}
+
+EXPORT_C TUint8 TUsbOtherSpeedDescriptor::NumInterfaces() const
+	{
+	return ParseTUint8(iBlob, EbNumInterfaces);
+	}
+
+EXPORT_C TUint8 TUsbOtherSpeedDescriptor::ConfigurationValue() const
+	{
+	return ParseTUint8(iBlob, EbConfigurationValue);
+	}
+
+EXPORT_C TUint8 TUsbOtherSpeedDescriptor::ConfigurationIndex() const
+	{
+	return ParseTUint8(iBlob, EiConfiguration);
+	}
+
+EXPORT_C TUint8 TUsbOtherSpeedDescriptor::Attributes() const
+	{
+	return ParseTUint8(iBlob, EbmAttributes);
+	}
+
+EXPORT_C TUint8 TUsbOtherSpeedDescriptor::MaxPower() const
+	{
+	return ParseTUint8(iBlob, EbMaxPower);
+	}
+	
+/**
+The parsing routine for other speed descriptors.
+
+@internalComponent
+*/
+/*static*/ TUsbOtherSpeedDescriptor* TUsbOtherSpeedDescriptor::ParseL(TPtrC8& aUsbDes, TUsbGenericDescriptor* /*aPreviousDesc*/)
+	{
+	TUsbOtherSpeedDescriptor* oSpeedDes = NULL;
+
+	const TInt KMinOtherSpeedDesDecisionLength = 2;
+	if(	aUsbDes.Length() >= KMinOtherSpeedDesDecisionLength &&
+		aUsbDes[KbDescriptorTypeOffset] == EOtherSpeedConfiguration &&
+		aUsbDes[KbLengthOffset] == TUsbOtherSpeedDescriptor::KSizeInOctets)
+		{
+		// Robustness check - check the length field is valid, and that we have enough data.
+		if(aUsbDes.Length() < TUsbOtherSpeedDescriptor::KSizeInOctets)
+			{
+			User::Leave(KErrCorrupt);
+			}
+	
+		// Robustness check - check that there is sufficient data for whole bundle (wTotalLength)
+		const TInt KwTotalLengthOffset = 2;
+		if(aUsbDes.Length() < ParseTUint16(aUsbDes, KwTotalLengthOffset))
+			{
+			User::Leave(KErrCorrupt);
+			}
+
+		// Looks ok to be an other speed descriptor.
+		oSpeedDes = new(ELeave) TUsbOtherSpeedDescriptor;
+		// Set the standard fields
+		oSpeedDes->ibLength = TUsbOtherSpeedDescriptor::KSizeInOctets;
+		oSpeedDes->ibDescriptorType = EOtherSpeedConfiguration;
+		// Set the blob appropriately
+		oSpeedDes->iBlob.Set(aUsbDes.Left(TUsbOtherSpeedDescriptor::KSizeInOctets));
+
+		oSpeedDes->iRecognisedAndParsed = ERecognised;
+
+		// Update the data-left-to-parse Symbian descriptor
+		aUsbDes.Set(aUsbDes.Mid(TUsbOtherSpeedDescriptor::KSizeInOctets));
+		}
+
+	return oSpeedDes;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbOtherSpeedDescriptor::IsParent(TUsbGenericDescriptor& /*aPotentialParent*/)
+	{
+	// Other speed descriptor is like a configuration descriptor, in that it should
+	// not have any parents in a bundle.
+	return EFalse;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbOtherSpeedDescriptor::IsPeer(TUsbGenericDescriptor& /*aPotentialPeer*/)
+	{
+	// There should only ever be one other speed descriptor in a bundle.
+	return EFalse;
+	}
+
+
+// ------------------------------------
+// TUsbInterfaceAssociationDescriptor
+// See the USB IAD ECN.
+// ------------------------------------
+
+EXPORT_C TUsbInterfaceAssociationDescriptor::TUsbInterfaceAssociationDescriptor()
+	{
+	}
+	
+EXPORT_C /*static*/ TUsbInterfaceAssociationDescriptor* TUsbInterfaceAssociationDescriptor::Cast(TUsbGenericDescriptor* aOriginal)
+	{
+	TUsbInterfaceAssociationDescriptor* ret = NULL;
+	// Only cast if correctly indentified as interface association descriptor
+	if(	aOriginal &&
+		aOriginal->ibDescriptorType == EInterfaceAssociation &&
+		aOriginal->ibLength == TUsbInterfaceAssociationDescriptor::KSizeInOctets &&
+		aOriginal->iRecognisedAndParsed == ERecognised)
+		{
+		ret = static_cast<TUsbInterfaceAssociationDescriptor*>(aOriginal);
+		}
+	return ret;
+	}
+
+EXPORT_C TUint8 TUsbInterfaceAssociationDescriptor::FirstInterface() const
+	{
+	return ParseTUint8(iBlob, EbFirstInterface);
+	}
+
+EXPORT_C TUint8 TUsbInterfaceAssociationDescriptor::InterfaceCount() const
+	{
+	return ParseTUint8(iBlob, EbInterfaceCount);
+	}
+
+EXPORT_C TUint8 TUsbInterfaceAssociationDescriptor::FunctionClass() const
+	{
+	return ParseTUint8(iBlob, EbFunctionClass);
+	}
+
+EXPORT_C TUint8 TUsbInterfaceAssociationDescriptor::FunctionSubClass() const
+	{
+	return ParseTUint8(iBlob, EbFunctionSubClass);
+	}
+
+EXPORT_C TUint8 TUsbInterfaceAssociationDescriptor::FunctionProtocol() const
+	{
+	return ParseTUint8(iBlob, EbFunctionProtocol);
+	}
+
+EXPORT_C TUint8 TUsbInterfaceAssociationDescriptor::FunctionIndex() const
+	{
+	return ParseTUint8(iBlob, EiFunction);
+	}
+	
+/*static*/ TUsbInterfaceAssociationDescriptor* TUsbInterfaceAssociationDescriptor::ParseL(TPtrC8& aUsbDes, TUsbGenericDescriptor* /*aPreviousDesc*/)
+	{
+	TUsbInterfaceAssociationDescriptor* intAssocDes = NULL;
+
+	const TInt KMinIntAssocDesDecisionLength = 2;
+	if(	aUsbDes.Length() >= KMinIntAssocDesDecisionLength &&
+		aUsbDes[KbDescriptorTypeOffset] == EInterfaceAssociation &&
+		aUsbDes[KbLengthOffset] == TUsbInterfaceAssociationDescriptor::KSizeInOctets)
+		{
+		// Robustness check - check the length field is valid, and that we have enough data.
+		if(aUsbDes.Length() < TUsbInterfaceAssociationDescriptor::KSizeInOctets)
+			{
+			User::Leave(KErrCorrupt);
+			}
+
+		// Looks ok to be a interface association descriptor.
+		intAssocDes = new(ELeave) TUsbInterfaceAssociationDescriptor;
+		// Set the standard fields
+		intAssocDes->ibLength = TUsbInterfaceAssociationDescriptor::KSizeInOctets;
+		intAssocDes->ibDescriptorType = EInterfaceAssociation;
+		// Set the blob appropriately
+		intAssocDes->iBlob.Set(aUsbDes.Left(TUsbInterfaceAssociationDescriptor::KSizeInOctets));
+	
+		intAssocDes->iRecognisedAndParsed = ERecognised;
+
+		// Update the data-left-to-parse Symbian descriptor
+		aUsbDes.Set(aUsbDes.Mid(TUsbInterfaceAssociationDescriptor::KSizeInOctets));
+		}
+
+	return intAssocDes;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbInterfaceAssociationDescriptor::IsParent(TUsbGenericDescriptor& aPotentialParent)
+	{
+	switch(aPotentialParent.ibDescriptorType)
+		{
+	case EConfiguration:
+		return ETrue;
+	case EOtherSpeedConfiguration:
+		return ETrue;	// I think this should be EFalse by my reading of the USB spec - however
+						// it is not explicitly clear, so play it safe.
+	default:
+		return EFalse;
+		}
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbInterfaceAssociationDescriptor::IsPeer(TUsbGenericDescriptor& aPotentialPeer)
+	{
+	switch(aPotentialPeer.ibDescriptorType)
+		{
+	case EInterfaceAssociation:
+		return ETrue;
+	case EInterface:
+		// Only interfaces are peers of IADs.
+			{
+			TUsbInterfaceDescriptor* intDesc = TUsbInterfaceDescriptor::Cast(&aPotentialPeer);
+			if(intDesc)
+				{
+				TInt intNum = intDesc->InterfaceNumber();
+				intNum -= FirstInterface();
+				if(intNum < 0 || intNum >= InterfaceCount())
+					{
+					// The interface number is outside the IAD region.
+					return ETrue;
+					}
+				}
+			return EFalse;
+			}
+	default:
+		return EFalse;
+		}
+	}
+	
+/*virtual*/ TBool TUsbInterfaceAssociationDescriptor::IsChild(TUsbGenericDescriptor& aPotentialChild)
+	{
+	switch(aPotentialChild.ibDescriptorType)
+		{
+	case EInterface:
+		// Only interfaces are children of IADs. And only if they are special.
+			{
+			TUsbInterfaceDescriptor* intDesc = TUsbInterfaceDescriptor::Cast(&aPotentialChild);
+			if(intDesc)
+				{
+				TInt intNum = intDesc->InterfaceNumber();
+				intNum -= FirstInterface();
+				if(intNum >= 0 && intNum < InterfaceCount())
+					{
+					// The interface number is within the IAD region required.
+					return ETrue;
+					}
+				}
+			return EFalse;
+			}
+	default:
+		return EFalse;
+		}
+	}
+
+
+// -------------------------
+// TUsbInterfaceDescriptor
+// See section 9.6.5 of the USB 2.0 specification.
+// -------------------------
+
+EXPORT_C TUsbInterfaceDescriptor::TUsbInterfaceDescriptor()
+	{
+	}
+
+EXPORT_C /*static*/ TUsbInterfaceDescriptor* TUsbInterfaceDescriptor::Cast(TUsbGenericDescriptor* aOriginal)
+	{
+	TUsbInterfaceDescriptor* ret = NULL;
+	// Only cast if correctly indentified as interface descriptor
+	if(	aOriginal &&
+		aOriginal->ibDescriptorType == EInterface &&
+		aOriginal->ibLength == TUsbInterfaceDescriptor::KSizeInOctets &&
+		aOriginal->iRecognisedAndParsed == ERecognised)
+		{
+		ret = static_cast<TUsbInterfaceDescriptor*>(aOriginal);
+		}
+	return ret;
+	}
+
+EXPORT_C TUint8 TUsbInterfaceDescriptor::InterfaceNumber() const
+	{
+	return ParseTUint8(iBlob, EbInterfaceNumber);
+	}
+
+EXPORT_C TUint8 TUsbInterfaceDescriptor::AlternateSetting() const
+	{
+	return ParseTUint8(iBlob, EbAlternateSetting);
+	}
+
+EXPORT_C TUint8 TUsbInterfaceDescriptor::NumEndpoints() const
+	{
+	return ParseTUint8(iBlob, EbNumEndpoints);
+	}
+
+EXPORT_C TUint8 TUsbInterfaceDescriptor::InterfaceClass() const
+	{
+	return ParseTUint8(iBlob, EbInterfaceClass);
+	}
+
+EXPORT_C TUint8 TUsbInterfaceDescriptor::InterfaceSubClass() const
+	{
+	return ParseTUint8(iBlob, EbInterfaceSubClass);
+	}
+
+EXPORT_C TUint8 TUsbInterfaceDescriptor::InterfaceProtocol() const
+	{
+	return ParseTUint8(iBlob, EbInterfaceProtocol);
+	}
+
+EXPORT_C TUint8 TUsbInterfaceDescriptor::Interface() const
+	{
+	return ParseTUint8(iBlob, EiInterface);
+	}
+	
+/**
+The parsing routine for interface descriptors.
+
+@internalComponent
+*/
+/*static*/ TUsbInterfaceDescriptor* TUsbInterfaceDescriptor::ParseL(TPtrC8& aUsbDes, TUsbGenericDescriptor* /*aPreviousDesc*/)
+	{
+	TUsbInterfaceDescriptor* intDes = NULL;
+
+	const TInt KMinInterfaceDesDecisionLength = 2;
+	if(	aUsbDes.Length() >= KMinInterfaceDesDecisionLength &&
+		aUsbDes[KbDescriptorTypeOffset] == EInterface &&
+		aUsbDes[KbLengthOffset] == TUsbInterfaceDescriptor::KSizeInOctets)
+		{
+		// Robustness check - check the length field is valid, and that we have enough data.
+		if(aUsbDes.Length() < TUsbInterfaceDescriptor::KSizeInOctets)
+			{
+			User::Leave(KErrCorrupt);
+			}
+
+		// Looks ok to be an interface descriptor.
+		intDes = new(ELeave) TUsbInterfaceDescriptor;
+		// Set the standard fields
+		intDes->ibLength = TUsbInterfaceDescriptor::KSizeInOctets;
+		intDes->ibDescriptorType = EInterface;
+		// Set the blob appropriately
+		intDes->iBlob.Set(aUsbDes.Left(TUsbInterfaceDescriptor::KSizeInOctets));
+
+		intDes->iRecognisedAndParsed = ERecognised;
+
+		// Update the data-left-to-parse Symbian descriptor
+		aUsbDes.Set(aUsbDes.Mid(TUsbInterfaceDescriptor::KSizeInOctets));
+		}
+
+	return intDes;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbInterfaceDescriptor::IsParent(TUsbGenericDescriptor& aPotentialParent)
+	{
+	switch(aPotentialParent.ibDescriptorType)
+		{
+	case EConfiguration:
+		return ETrue;
+	case EOtherSpeedConfiguration:
+		return ETrue;	// I think this should be EFalse by my reading of the USB spec - however
+						// it is not explicitly clear, so play it safe.
+	// case EInterfaceAssociation:
+	// 		We let the IAD descriptor handle the logic of how we bind to it.
+	default:
+		return EFalse;
+		}
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbInterfaceDescriptor::IsPeer(TUsbGenericDescriptor& aPotentialPeer)
+	{
+	switch(aPotentialPeer.ibDescriptorType)
+		{
+	//case EInterfaceAssociation:
+	//		We let the IAD descriptor handle the logic of how we bind to it.
+	case EInterface:
+		// If another interface descriptor then it is a peer not child.
+		return ETrue;
+	default:
+		// Any other descriptors are ignored.
+		return EFalse;
+		}
+	}
+
+
+// ------------------------
+// TUsbEndpointDescriptor
+// See section 9.6.6 of the USB 2.0 specification.
+// ------------------------
+
+EXPORT_C TUsbEndpointDescriptor::TUsbEndpointDescriptor()
+	{
+	}
+	
+EXPORT_C /*static*/ TUsbEndpointDescriptor* TUsbEndpointDescriptor::Cast(TUsbGenericDescriptor* aOriginal)
+	{
+	TUsbEndpointDescriptor* ret = NULL;
+	// Only cast if correctly indentified as endpoint descriptor
+	if(	aOriginal &&
+		aOriginal->ibDescriptorType == EEndpoint &&
+		aOriginal->ibLength == TUsbEndpointDescriptor::KSizeInOctets &&
+		aOriginal->iRecognisedAndParsed == ERecognised)
+		{
+		ret = static_cast<TUsbEndpointDescriptor*>(aOriginal);
+		}
+	return ret;
+	}
+
+EXPORT_C TUint8 TUsbEndpointDescriptor::EndpointAddress() const
+	{
+	return ParseTUint8(iBlob, EbEndpointAddress);
+	}
+
+EXPORT_C TUint8 TUsbEndpointDescriptor::Attributes() const
+	{
+	return ParseTUint8(iBlob, EbmAttributes);
+	}
+
+EXPORT_C TUint16 TUsbEndpointDescriptor::MaxPacketSize() const
+	{
+	return ParseTUint16(iBlob, EwMaxPacketSize);
+	}
+
+EXPORT_C TUint8 TUsbEndpointDescriptor::Interval() const
+	{
+	return ParseTUint8(iBlob, EbInterval);
+	}
+	
+/**
+The parsing routine for endpoint descriptors.
+
+@internalComponent
+*/
+/*static*/ TUsbEndpointDescriptor* TUsbEndpointDescriptor::ParseL(TPtrC8& aUsbDes, TUsbGenericDescriptor* /*aPreviousDesc*/)
+	{
+	TUsbEndpointDescriptor* endDes = NULL;
+
+	const TInt KMinEndpointDesDecisionLength = 2;
+	if(	aUsbDes.Length() >= KMinEndpointDesDecisionLength &&
+		aUsbDes[KbDescriptorTypeOffset] == EEndpoint &&
+		aUsbDes[KbLengthOffset] == TUsbEndpointDescriptor::KSizeInOctets)
+		{
+		// Robustness check - check the length field is valid, and that we have enough data.
+		if(aUsbDes.Length() < TUsbEndpointDescriptor::KSizeInOctets)
+			{
+			User::Leave(KErrCorrupt);
+			}
+
+		// Looks ok to be an endpoint descriptor.
+		endDes = new(ELeave) TUsbEndpointDescriptor;
+		// Set the standard fields
+		endDes->ibLength = TUsbEndpointDescriptor::KSizeInOctets;
+		endDes->ibDescriptorType = EEndpoint;
+		// Set the blob appropriately
+		endDes->iBlob.Set(aUsbDes.Left(TUsbEndpointDescriptor::KSizeInOctets));
+
+		endDes->iRecognisedAndParsed = ERecognised;
+
+		// Update the data-left-to-parse Symbian descriptor
+		aUsbDes.Set(aUsbDes.Mid(TUsbEndpointDescriptor::KSizeInOctets));
+		}
+
+	return endDes;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbEndpointDescriptor::IsParent(TUsbGenericDescriptor& aPotentialParent)
+	{
+	switch(aPotentialParent.ibDescriptorType)
+		{
+	case EInterface:
+		return ETrue;
+	default:
+		return EFalse;
+		}
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbEndpointDescriptor::IsPeer(TUsbGenericDescriptor& aPotentialPeer)
+	{
+	switch(aPotentialPeer.ibDescriptorType)
+		{
+	case EEndpoint:
+		return ETrue;
+	default:
+		return EFalse;
+		}
+	}
+
+// ------------------------
+// TUsbOTGDescriptor
+// See section 6.4 of the USB 2.0 On-The-Go Supplement Revision 1.3
+// ------------------------
+
+EXPORT_C TUsbOTGDescriptor::TUsbOTGDescriptor()
+	{
+	}
+	
+EXPORT_C /*static*/ TUsbOTGDescriptor* TUsbOTGDescriptor::Cast(TUsbGenericDescriptor* aOriginal)
+	{
+	TUsbOTGDescriptor* ret = NULL;
+	// Only cast if correctly indentified as otg descriptor
+	if(	aOriginal &&
+		aOriginal->ibDescriptorType == EOTG &&
+		aOriginal->ibLength == TUsbOTGDescriptor::KSizeInOctets &&
+		aOriginal->iRecognisedAndParsed == ERecognised)
+		{
+		ret = static_cast<TUsbOTGDescriptor*>(aOriginal);
+		}
+	return ret;
+	}
+
+EXPORT_C TUint8 TUsbOTGDescriptor::Attributes() const
+	{
+	return ParseTUint8(iBlob, EbmAttributes);
+	}
+
+EXPORT_C TBool TUsbOTGDescriptor::HNPSupported() const
+    {
+    return (ParseTUint8(iBlob, EbmAttributes) & 0x02) == 0x02;
+    }
+
+EXPORT_C TBool TUsbOTGDescriptor::SRPSupported() const
+    {
+    // Note: an illegal device (see 6.4.2 of the OTG specification) could
+    // incorrectly return False for SRP and True for HNP
+    // However this function just extracts the bit rather than attempting to
+    // fix up a broken device.  Devices broken in this way wouldn't be expected on
+    // the TPL.
+    return (ParseTUint8(iBlob, EbmAttributes) & 0x01) == 0x01;
+    }
+	
+/**
+The parsing routine for OTG descriptors.
+
+@internalComponent
+*/
+/*static*/ TUsbOTGDescriptor* TUsbOTGDescriptor::ParseL(TPtrC8& aUsbDes, TUsbGenericDescriptor* /*aPreviousDesc*/)
+	{
+	TUsbOTGDescriptor* endDes = NULL;
+
+	const TInt KMinOTGDesDecisionLength = 2;
+	if(	aUsbDes.Length() >= KMinOTGDesDecisionLength &&
+		aUsbDes[KbDescriptorTypeOffset] == EOTG &&
+		aUsbDes[KbLengthOffset] == TUsbOTGDescriptor::KSizeInOctets)
+		{
+		// Robustness check - check the length field is valid, and that we have enough data.
+		if(aUsbDes.Length() < TUsbOTGDescriptor::KSizeInOctets)
+			{
+			User::Leave(KErrCorrupt);
+			}
+
+		// Looks ok to be an OTG descriptor.
+		endDes = new(ELeave) TUsbOTGDescriptor;
+		// Set the standard fields
+		endDes->ibLength = TUsbOTGDescriptor::KSizeInOctets;
+		endDes->ibDescriptorType = EOTG;
+		// Set the blob appropriately
+		endDes->iBlob.Set(aUsbDes.Left(TUsbOTGDescriptor::KSizeInOctets));
+
+		// Null the pointers
+		endDes->iFirstChild = NULL;
+		endDes->iNextPeer = NULL;
+		endDes->iParent = NULL;
+		
+		endDes->iRecognisedAndParsed = ERecognised;
+
+		// Update the data-left-to-parse Symbian descriptor
+		aUsbDes.Set(aUsbDes.Mid(TUsbOTGDescriptor::KSizeInOctets));
+		}
+
+	return endDes;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbOTGDescriptor::IsParent(TUsbGenericDescriptor& aPotentialParent)
+	{
+	switch(aPotentialParent.ibDescriptorType)
+		{
+	case EConfiguration:    // we are part of a configuration descriptor, or standalone
+		return ETrue;
+	default:
+		return EFalse;
+		}
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbOTGDescriptor::IsPeer(TUsbGenericDescriptor& aPotentialPeer)
+	{
+    switch(aPotentialPeer.ibDescriptorType)
+		{
+	//case EInterfaceAssociation:
+	//		We let the IAD descriptor handle the logic of how we bind to it.
+	case EInterface:
+		// If another interface descriptor then it is a peer not child.
+		return ETrue;
+	default:
+		// Any other descriptors are ignored.
+		return EFalse;
+		}
+	}
+
+
+// ----------------------
+// TUsbStringDescriptor
+// See section 9.6.7 of the USB 2.0 specification.
+// ----------------------
+
+// The length of the header in a string descriptor (i.e. the same as every other standard USB descriptor).
+static const TInt KStringDescriptorHeaderFieldLength = 2;
+
+EXPORT_C TUsbStringDescriptor::TUsbStringDescriptor()
+	{
+	}
+	
+EXPORT_C /*static*/ TUsbStringDescriptor* TUsbStringDescriptor::Cast(TUsbGenericDescriptor* aOriginal)
+	{
+	TUsbStringDescriptor* ret = NULL;
+	// Only cast if correctly indentified as string descriptor
+	if(	aOriginal &&
+		aOriginal->ibDescriptorType == EString &&
+		aOriginal->ibLength >= KStringDescriptorHeaderFieldLength &&
+		aOriginal->iRecognisedAndParsed == ERecognised)
+		{
+		ret = static_cast<TUsbStringDescriptor*>(aOriginal);
+		}
+	return ret;
+	}
+
+/**
+For string descriptor zero, this function allows a means to iterate through the list of supported languages
+for strings on this device.
+
+@param aIndex Index into language ID table.
+@return The language ID at the requested index, or KErrNotFound if the end of the list has been reached.
+Note that the language IDs are unsigned 16-bit numbers, while the return from this function is signed 32-bit.
+*/
+EXPORT_C TInt TUsbStringDescriptor::GetLangId(TInt aIndex) const
+	{
+	__ASSERT_ALWAYS(aIndex >= 0, UsbDescPanic(UsbdiPanics::EUsbDescNegativeIndexToLangId));
+	const TUint8 KSizeOfLangIdField = 2;
+
+	TInt offset = KStringDescriptorHeaderFieldLength + KSizeOfLangIdField * aIndex;
+	if(offset >= ibLength)
+		{
+		return KErrNotFound;
+		}
+	return ParseTUint16(iBlob, offset);
+	}
+
+/**
+Writes the string data into a Symbian descriptor of sufficient size.
+
+@param aString The Symbian descriptor that will have the string data written into it.
+*/
+EXPORT_C void TUsbStringDescriptor::StringData(TDes16& aString) const
+	{
+	const TUint8 KUnicodeCharacterWidth = 2;
+	aString.Zero();
+
+	TInt index = KStringDescriptorHeaderFieldLength;
+	while(index+KUnicodeCharacterWidth <= ibLength)
+		{
+		aString.Append(ParseTUint16(iBlob, index));
+		index += KUnicodeCharacterWidth;
+		}
+	}
+
+
+/*static*/ TUsbStringDescriptor* TUsbStringDescriptor::ParseL(TPtrC8& aUsbDes, TUsbGenericDescriptor* /*aPreviousDesc*/)
+	{
+	TUsbStringDescriptor* stringDes = NULL;
+
+	if(	aUsbDes.Length() >= KStringDescriptorHeaderFieldLength &&
+		aUsbDes[KbDescriptorTypeOffset] == EString)
+		{
+		TUint8 stringDesLen = aUsbDes[KbLengthOffset];
+
+		// Robustness check - check the length field is valid
+		if(aUsbDes.Length() < stringDesLen || stringDesLen < KStringDescriptorHeaderFieldLength)
+			{
+			User::Leave(KErrCorrupt);
+			}
+		// Robustness check - check the length is a multiple of two.
+		if(stringDesLen % 2 != 0)
+			{
+			User::Leave(KErrCorrupt);
+			}
+
+		// Looks ok to be a string descriptor.
+		stringDes = new(ELeave) TUsbStringDescriptor;
+		// Set the standard fields
+		stringDes->ibLength = stringDesLen;
+		stringDes->ibDescriptorType = EString;
+		// Set the blob appropriately
+		stringDes->iBlob.Set(aUsbDes.Left(stringDesLen));
+
+		stringDes->iRecognisedAndParsed = ERecognised;
+
+		// Update the data-left-to-parse Symbian descriptor
+		aUsbDes.Set(aUsbDes.Mid(stringDesLen));
+		}
+
+	return stringDes;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbStringDescriptor::IsParent(TUsbGenericDescriptor& /*aPotentialParent*/)
+	{
+	// String descriptors have no parents - they are standalone.
+	return EFalse;
+	}
+
+/**
+@internalComponent
+*/
+/*virtual*/ TBool TUsbStringDescriptor::IsPeer(TUsbGenericDescriptor& /*aPotentialPeer*/)
+	{
+	// String descriptors have no peers - they are standalone.
+	return EFalse;
+	}
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdescriptors/usbdescriptors.mmp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdescriptors/usbdescriptors.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,31 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Description:
+//
+
+TARGET				usbdescriptors.dll
+TARGETTYPE			dll
+CAPABILITY			All -Tcb
+VENDORID			0x70000001
+
+DEFFILE				../../../~/usbdescriptors.def
+
+OS_LAYER_SYSTEMINCLUDE_SYMBIAN
+USERINCLUDE			.
+
+SOURCEPATH			.
+SOURCE				usbdescriptors.cpp
+SOURCE				usbdescparser.cpp
+SOURCE				usbdescutils.cpp
+
+LIBRARY				euser.lib
+
+SMPSAFE
\ No newline at end of file
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdescriptors/usbdescutils.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdescriptors/usbdescutils.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,55 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Description:
+//
+
+#include "usbdescutils.h"
+
+/**
+@file
+@internalComponent
+*/
+
+/*static*/ CUsbCustomDescriptorParserList* CUsbCustomDescriptorParserList::NewL()
+	{
+    CUsbCustomDescriptorParserList* self = new(ELeave) CUsbCustomDescriptorParserList;
+    return self;
+	}
+
+CUsbCustomDescriptorParserList::~CUsbCustomDescriptorParserList()
+	{
+	iParserList.Close();
+	}
+
+void CUsbCustomDescriptorParserList::RegisterParserL(UsbDescriptorParser::TUsbDescriptorParserL aParserFunc)
+	{
+	iParserList.AppendL(aParserFunc);
+	}
+
+void CUsbCustomDescriptorParserList::UnregisterParser(UsbDescriptorParser::TUsbDescriptorParserL aParserFunc)
+	{
+	TInt res = iParserList.Find(aParserFunc);
+	if(res != KErrNotFound)
+		{
+		iParserList.Remove(res);
+		}
+	}
+
+TInt CUsbCustomDescriptorParserList::NumOfRegisteredParsers() const
+	{
+	return iParserList.Count();
+	}
+	
+UsbDescriptorParser::TUsbDescriptorParserL CUsbCustomDescriptorParserList::RegisteredParser(TInt aIndex) const
+	{
+	return iParserList[aIndex];
+	}
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdescriptors/usbdescutils.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdescriptors/usbdescutils.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,94 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Description:
+//
+
+/**
+ @file
+ @internalComponent
+*/
+
+#ifndef USBDESCUTILS_H
+#define USBDESCUTILS_H
+
+#include <d32usbdescriptors.h>
+#include <d32usbdi_errors.h>
+
+inline void UsbDescFault(UsbdiFaults::TUsbDescFaults aFault)
+	{
+	User::Panic(UsbdiFaults::KUsbDescFaultCat, aFault);
+	}
+
+inline void UsbDescPanic(UsbdiPanics::TUsbDescPanics aPanic)
+	{
+	User::Panic(UsbdiPanics::KUsbDescPanicCat, aPanic);
+	}
+
+/**
+Utility function for retrieving a TUint8 from a Little Endian USB descriptor.
+@param aDes The descriptor to parse.
+@param aOffset The offset in the descriptor where to parse.
+@return The TUint8 value parsed.
+*/
+inline TUint8 ParseTUint8(TPtrC8 aDes, TInt aOffset)
+	{
+	return aDes[aOffset];
+	}
+
+/**
+Utility function for retrieving a TUint16 from a Little Endian USB descriptor.
+@param aDes The descriptor to parse.
+@param aOffset The offset in the descriptor where to parse.
+@return The TUint16 value parsed.
+*/
+inline TUint16 ParseTUint16(TPtrC8 aDes, TInt aOffset)
+	{
+	return ((TUint16)aDes[aOffset]) | ( ((TUint16)aDes[aOffset+1]) << 8 );
+	}
+	
+/**
+Utility function for retrieving a TUint32 from a Little Endian USB descriptor.
+@param aDes The descriptor to parse.
+@param aOffset The offset in the descriptor where to parse.
+@return The TUint32 value parsed.
+*/
+inline TUint32 ParseTUint32(TPtrC8 aDes, TInt aOffset)
+	{
+	// Put enough brackets to ensure that all casting is correct
+	// and the expression looks symmetrical
+	return 	( ((TUint32)(aDes[aOffset])) ) | 
+			( ((TUint32)(aDes[aOffset + 1])) << 8 ) | 
+			( ((TUint32)(aDes[aOffset + 2])) << 16 ) | 
+			( ((TUint32)(aDes[aOffset + 3])) << 24 );
+	}
+
+/**
+A utility class to store the custom descriptor parsers.
+The USBDI descriptor parsing framework creates and stores an instance
+of this class in TLS when a custom parse is registered.
+*/
+NONSHARABLE_CLASS(CUsbCustomDescriptorParserList) : public CBase
+	{
+public:
+	static CUsbCustomDescriptorParserList* NewL();
+	~CUsbCustomDescriptorParserList();
+
+	void RegisterParserL(UsbDescriptorParser::TUsbDescriptorParserL aParserFunc);
+	void UnregisterParser(UsbDescriptorParser::TUsbDescriptorParserL aParserFunc);
+	TInt NumOfRegisteredParsers() const;
+	UsbDescriptorParser::TUsbDescriptorParserL RegisteredParser(TInt aIndex) const;
+
+private:
+	RArray<UsbDescriptorParser::TUsbDescriptorParserL> iParserList;
+	};
+
+
+#endif // USBDESCUTILS_H
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/base_drivers_usbdi_utils.mrp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/base_drivers_usbdi_utils.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,12 @@
+# component name "USB DI Utils"
+
+component	base_drivers_usbdi_utils
+
+source	\sf\os\kernelhwsrv\kernel\eka\drivers\usbho\usbdi_utils
+
+binary	\sf\os\kernelhwsrv\kernel\eka\drivers\usbho\usbdi_utils all
+
+notes_source	\component_defs\release.src
+
+ipr E
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/bld.inf
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/bld.inf	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,46 @@
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32/drivers/usbho/usbdi_utils/bld.inf
+// 
+//
+
+/**
+ @file
+*/
+
+
+PRJ_PLATFORMS
+
+ARMV5 ARMV5SMP
+
+
+PRJ_MMPFILES
+
+#ifndef GCCXML
+#if defined(GENERIC_MARM) || !defined(WINS) || defined(GENERIC_X86)
+#if !defined(MARM_THUMB) && !defined(MARM_ARMI)
+
+#if !defined(WINS) 
+#if !defined(X86)
+#if defined(SYMBIAN_ENABLE_USB_OTG_HOST)
+
+usbdi_utils
+
+#endif
+#endif
+#endif
+
+#endif
+#endif
+#endif
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/usbdi_utils.mmp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/usbdi_utils.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,37 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+//
+
+target			usbdi_utils.dll
+targettype		dll
+capability		All -Tcb
+vendorid		0x70000001
+
+deffile			../../../~/usbdi_utils.def
+
+OS_LAYER_SYSTEMINCLUDE_SYMBIAN
+userinclude		.
+
+sourcepath		.
+source			usbtransfers.cpp
+source			usbtransferstrategy.cpp
+source			usbinterface.cpp
+source			usbpipe.cpp
+source			usbdiutils.cpp
+source			zerocopytransferstrategy.cpp
+
+library			euser.lib
+library			usbdescriptors.lib
+
+SMPSAFE
\ No newline at end of file
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/usbdiutils.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/usbdiutils.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,28 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+//
+
+#include "usbdiutils.h"
+
+
+void UsbdiUtils::Panic(UsbdiPanics::TUsbdiPanics aPanic)
+	{
+	User::Panic(UsbdiPanics::KUsbdiPanicCat, aPanic);
+	}
+
+
+void UsbdiUtils::Fault(UsbdiFaults::TUsbdiFaults aFault)
+	{
+	User::Panic(UsbdiFaults::KUsbdiFaultCat, aFault);
+	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/usbdiutils.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/usbdiutils.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,34 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+//
+
+/**
+ @file
+ @internalComponent
+*/
+
+#ifndef USBDIUTILS_H
+#define USBDIUTILS_H
+
+#include <d32usbdi_errors.h>
+
+
+NONSHARABLE_CLASS(UsbdiUtils)
+	{
+public:
+	static void Panic(UsbdiPanics::TUsbdiPanics aPanic);
+	static void Fault(UsbdiFaults::TUsbdiFaults aFault);
+	};
+
+#endif // USBDIUTILS_H
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/usbinterface.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/usbinterface.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,154 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+//
+
+#include <d32usbdi.h>
+
+#include <d32usbtransfers.h>
+#include "usbtransferstrategy.h"
+#include "zerocopytransferstrategy.h"
+
+
+/**
+Opens an interface identified by a token.  When the hub driver loads a driver (via function driver
+framework), this token is generated to allow the driver to open the interface.
+
+This also causes the interface's descriptors to be parsed for future reference.
+
+@param[in] aToken The token for the interface to open.
+@return System-wide error code.
+*/
+EXPORT_C TInt RUsbInterface::Open(TUint32 aToken, TOwnerType aType)
+	{
+	TPckgC<TUint32> token(aToken);
+	TInt err = DoCreate(Name(), VersionRequired(), KNullUnit, NULL, &token, aType);
+	if(err == KErrNone)
+		{
+		// Create a transfer strategy
+		iTransferStrategy = new RUsbZeroCopyTransferStrategy;
+		if(!iTransferStrategy)
+			{
+			Close();
+			return KErrNoMemory;
+			}
+
+		// Get descriptor size
+		TInt interfaceDescSize = 0;
+		err = DoControl(EGetInterfaceDescriptorSize, &interfaceDescSize);
+		if(err != KErrNone)
+			{
+			Close();
+			return err;
+			}
+		iInterfaceDescriptorData = HBufC8::New(interfaceDescSize);
+
+		if(!iInterfaceDescriptorData)
+			{
+			Close();
+			return KErrNoMemory;
+			}
+
+		// Get descriptor data
+		TPtr8 interfaceDesc = iInterfaceDescriptorData->Des();
+		err = DoControl(EGetInterfaceDescriptor, &interfaceDesc);
+		if(err != KErrNone)
+			{
+			Close();
+			return err;
+			}
+
+		// Parse descriptor
+		TUsbGenericDescriptor* parsed = NULL;
+		err = UsbDescriptorParser::Parse(*iInterfaceDescriptorData, parsed);
+		if(err != KErrNone)
+			{
+			if(parsed)
+				{
+				parsed->DestroyTree(); //or however much has been completed
+				delete parsed;
+				}
+			Close();
+			return err;
+			}
+
+		iHeadInterfaceDescriptor = TUsbInterfaceDescriptor::Cast(parsed);
+		if(!iHeadInterfaceDescriptor)
+			{
+			if(parsed)
+				{
+				parsed->DestroyTree();
+				delete parsed;
+				}
+			Close();
+			return KErrCorrupt;
+			}
+		}
+
+	return err;
+	}
+	
+/**
+Close handle to interface.
+
+Closes any pipe handles still open.
+*/
+EXPORT_C void RUsbInterface::Close()
+	{
+	iAlternateSetting = 0;
+	if(iHeadInterfaceDescriptor)
+		{
+		iHeadInterfaceDescriptor->DestroyTree();
+		delete iHeadInterfaceDescriptor;
+		iHeadInterfaceDescriptor = NULL;
+		}
+	if(iInterfaceDescriptorData)
+		{
+		delete iInterfaceDescriptorData;
+		iInterfaceDescriptorData = NULL;
+		}
+	if(iTransferStrategy)
+		{
+		iTransferStrategy->Close();
+		delete iTransferStrategy;
+		iTransferStrategy = NULL;
+		}
+	RBusLogicalChannel::Close();
+	}
+
+
+EXPORT_C TInt RUsbInterface::RegisterTransferDescriptor(RUsbTransferDescriptor& aTransfer)
+	{
+	TTransferMemoryDetails details;
+	details.iType		= aTransfer.iType;
+	details.iSize		= aTransfer.iMaxSize;
+	details.iMaxPackets	= aTransfer.iMaxNumPackets;
+	TInt err = DoControl(EGetSizeAndAlignment, &details);
+	if(err != KErrNone)
+		{
+		return err;
+		}
+	return iTransferStrategy->RegisterTransferDescriptor(aTransfer, details.iSize, details.iAlignment, details.iMaxPackets);
+	}
+	
+EXPORT_C void RUsbInterface::ResetTransferDescriptors()
+	{
+	iTransferStrategy->ResetTransferDescriptors();
+	}
+
+EXPORT_C TInt RUsbInterface::InitialiseTransferDescriptors()
+	{
+	return iTransferStrategy->InitialiseTransferDescriptors(*this);
+	}
+
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/usbpipe.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/usbpipe.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,31 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+//
+
+#include <d32usbdi.h>
+#include <d32usbtransfers.h>
+
+#include "usbtransferstrategy.h"
+
+
+/**
+Queue a transfer.
+@param[in] aTransfer The transfer descriptor to execute.
+@param[out] aRequest Holds completion status of the transfer.
+*/
+EXPORT_C void RUsbPipe::Transfer(RUsbTransferDescriptor& aTransfer, TRequestStatus& aRequest)
+	{
+	IssueTransfer(aTransfer.iHandle, aRequest);
+	}
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/usbtransfers.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/usbtransfers.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,205 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+//
+
+#include <d32usbtransfers.h>
+
+#include <d32usbdi_errors.h>
+#include "usbtransferstrategy.h"
+#include "usbdiutils.h"
+
+
+// ========================
+// RUsbTransferDescriptor
+// ========================
+
+/**
+Constructor protected to as this class is only intended as a base class.
+*/
+RUsbTransferDescriptor::RUsbTransferDescriptor(TTransferType aType, TInt aMaxSize, TInt aMaxNumPackets)
+	: iHandle(KInvalidHandle)
+	, iType(aType)
+	, iMaxSize(aMaxSize)
+	, iMaxNumPackets(aMaxNumPackets)
+	{
+	}
+
+/**
+Releases resources allocated to this transfer descriptor.
+*/
+EXPORT_C void RUsbTransferDescriptor::Close()
+	{
+	// Do nothing - the buffer is owned by the {R,D}UsbInterface.
+	// This is provided in case the descriptor owns resources in future.
+	}
+
+
+// ============================
+// RUsbIsocTransferDescriptor
+// ============================
+
+EXPORT_C RUsbIsocTransferDescriptor::RUsbIsocTransferDescriptor(TInt aMaxSize, TInt aMaxNumPackets)
+	: RUsbTransferDescriptor(EIsochronous, aMaxSize, aMaxNumPackets)
+	, iWriteHandle(KInvalidHandle)
+	{
+	}
+
+EXPORT_C void RUsbIsocTransferDescriptor::Reset()
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIsocTransferDescriptorHandle));
+	iWriteHandle = iHandle;
+	iTransferStrategy->IsocReset(iHandle);
+	}
+
+EXPORT_C TPacketLengths RUsbIsocTransferDescriptor::Lengths()
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIsocTransferDescriptorHandle));
+	return iTransferStrategy->IsocLengths(iHandle);
+	}
+	
+EXPORT_C TPacketResults RUsbIsocTransferDescriptor::Results()
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIsocTransferDescriptorHandle));
+	return iTransferStrategy->IsocResults(iHandle);
+	}
+	
+EXPORT_C TInt RUsbIsocTransferDescriptor::MaxPacketSize()
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIsocTransferDescriptorHandle));
+	return iTransferStrategy->IsocMaxPacketSize(iHandle);
+	}
+
+EXPORT_C TPtr8 RUsbIsocTransferDescriptor::WritablePackets(TInt aNumPacketsRequested, TInt& aMaxNumOfPacketsAbleToWrite)
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIsocTransferDescriptorHandle));
+	if(iWriteHandle == KInvalidHandle)
+		{
+		return TPtr8(NULL, 0);
+		}
+	return iTransferStrategy->IsocWritablePackets(iHandle, iWriteHandle, aNumPacketsRequested, aMaxNumOfPacketsAbleToWrite);
+	}
+
+EXPORT_C void RUsbIsocTransferDescriptor::SaveMultiple(TInt aNumOfPackets)
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIsocTransferDescriptorHandle));
+	__ASSERT_ALWAYS(iWriteHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIsocTransferDescriptorWriteHandle));
+	TInt writeHandle = iTransferStrategy->IsocSaveMultiple(iHandle, iWriteHandle, aNumOfPackets);
+	iWriteHandle = (writeHandle < 0) ? KInvalidHandle : writeHandle;
+	}
+
+EXPORT_C TPtrC8 RUsbIsocTransferDescriptor::Packets(TInt aFirstPacketIndex, TInt aNumPacketsRequested, TInt& aNumOfPacketsReturned) const
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIsocTransferDescriptorHandle));
+	return iTransferStrategy->IsocPackets(iHandle, aFirstPacketIndex, aNumPacketsRequested, aNumOfPacketsReturned);
+	}
+
+EXPORT_C void RUsbIsocTransferDescriptor::ReceivePackets(TInt aNumOfPackets)
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIsocTransferDescriptorHandle));
+	iTransferStrategy->IsocReceivePackets(iHandle, aNumOfPackets);
+	}
+
+
+// ============================
+// RUsbBulkTransferDescriptor
+// ============================
+
+EXPORT_C RUsbBulkTransferDescriptor::RUsbBulkTransferDescriptor(TInt aMaxSize)
+	: RUsbTransferDescriptor(EBulk, aMaxSize, 0)
+	{
+	}
+
+/**
+@return A modifiable pointer to the entire data buffer.
+*/
+EXPORT_C TPtr8 RUsbBulkTransferDescriptor::WritableBuffer()
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadBulkTransferDescriptorHandle));
+	return iTransferStrategy->BulkWritableBuffer(iHandle);
+	}
+
+/**
+Update the transfer descriptor given the length of data supplied.
+@param[in] aLength Length of data to write or expect.
+*/
+EXPORT_C void RUsbBulkTransferDescriptor::SaveData(TInt aLength)
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadBulkTransferDescriptorHandle));
+	iTransferStrategy->BulkSaveData(iHandle, aLength);
+	}
+
+/**
+@return A non-modifiable pointer to the entire data buffer.
+*/
+EXPORT_C TPtrC8 RUsbBulkTransferDescriptor::Buffer() const
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadBulkTransferDescriptorHandle));
+	return iTransferStrategy->BulkBuffer(iHandle);
+	}
+	
+/**
+@param aZlpStatus the ZLP type to use for the transfer
+*/
+EXPORT_C void RUsbBulkTransferDescriptor::SetZlpStatus(TZlpStatus aZlpStatus)
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadBulkTransferDescriptorHandle));
+	iTransferStrategy->BulkSetZlpStatus(iHandle, aZlpStatus);
+	}
+
+
+// ============================
+// RUsbIntrTransferDescriptor
+// ============================
+
+EXPORT_C RUsbIntrTransferDescriptor::RUsbIntrTransferDescriptor(TInt aMaxSize)
+	: RUsbTransferDescriptor(EInterrupt, aMaxSize, 0)
+	{
+	}
+
+/**
+@return A modifiable pointer to the entire data buffer.
+*/
+EXPORT_C TPtr8 RUsbIntrTransferDescriptor::WritableBuffer()
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIntrTransferDescriptorHandle));
+	return iTransferStrategy->IntrWritableBuffer(iHandle);
+	}
+
+/**
+Update the transfer descriptor given the length of data supplied.
+@param[in] aLength Length of data to write or expect.
+*/
+EXPORT_C void RUsbIntrTransferDescriptor::SaveData(TInt aLength)
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIntrTransferDescriptorHandle));
+	iTransferStrategy->IntrSaveData(iHandle, aLength);
+	}
+
+/**
+@return A non-modifiable pointer to the entire data buffer.
+*/
+EXPORT_C TPtrC8 RUsbIntrTransferDescriptor::Buffer() const
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIntrTransferDescriptorHandle));
+	return iTransferStrategy->IntrBuffer(iHandle);
+	}
+	
+/**
+@param aZlpStatus the ZLP type to use for the transfer
+*/
+EXPORT_C void RUsbIntrTransferDescriptor::SetZlpStatus(TZlpStatus aZlpStatus)
+	{
+	__ASSERT_ALWAYS(iHandle != KInvalidHandle, UsbdiUtils::Panic(UsbdiPanics::EBadIntrTransferDescriptorHandle));
+	return iTransferStrategy->IntrSetZlpStatus(iHandle, aZlpStatus);
+	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/usbtransferstrategy.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/usbtransferstrategy.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,114 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+//
+
+#include "usbtransferstrategy.h"
+
+#include <d32usbtransfers.h>
+#include <d32usbdi_errors.h>
+#include "usbdiutils.h"
+
+
+TPacketLengths::TPacketLengths(TUint16* aRecvPtr, TUint16* aReqPtr, TInt& aMaxNumPackets)
+	: iRecvPtr(aRecvPtr)
+	, iReqPtr(aReqPtr)
+	, iMaxNumPackets(aMaxNumPackets)
+	{}
+
+EXPORT_C TPacketLengths::TLength TPacketLengths::At(TInt aIndex)
+	{
+	__ASSERT_ALWAYS(aIndex >= 0 && aIndex < iMaxNumPackets, UsbdiUtils::Panic(UsbdiPanics::EOutOfBoundsOfLengthArray));
+	return TPacketLengths::TLength(*(iRecvPtr + aIndex), *(iReqPtr + aIndex));
+	}
+
+EXPORT_C const TPacketLengths::TLength TPacketLengths::At(TInt aIndex) const
+	{
+	__ASSERT_ALWAYS(aIndex >= 0 && aIndex < iMaxNumPackets, UsbdiUtils::Panic(UsbdiPanics::EOutOfBoundsOfLengthArray));
+	return TPacketLengths::TLength(*(iRecvPtr + aIndex), *(iReqPtr + aIndex));
+	}
+
+EXPORT_C TPacketLengths::TLength TPacketLengths::operator[](TInt aIndex)
+	{
+	return At(aIndex);
+	}
+
+EXPORT_C const TPacketLengths::TLength TPacketLengths::operator[](TInt aIndex) const
+	{
+	return At(aIndex);
+	}
+
+EXPORT_C TInt TPacketLengths::MaxNumPackets()
+	{
+	return iMaxNumPackets;
+	}
+	
+EXPORT_C TUint16 TPacketLengths::TLength::operator=(TUint16 aValue)
+	{
+	iRecv = aValue;
+	iReq = aValue;
+	return aValue;
+	}
+
+EXPORT_C TPacketLengths::TLength::operator TUint16() const
+	{
+	return iRecv;
+	}
+
+TPacketLengths::TLength::TLength(TUint16& aRecv, TUint16& aReq)
+	: iRecv(aRecv)
+	, iReq(aReq)
+	{
+	}
+	
+	
+TPacketResults::TPacketResults(TInt* aResPtr, TInt& aMaxNumPackets)
+	: iResPtr(aResPtr)
+	, iMaxNumPackets(aMaxNumPackets)
+	{
+    }
+
+EXPORT_C TInt TPacketResults::At(TInt aIndex) const
+	{
+	__ASSERT_ALWAYS(aIndex >= 0 && aIndex < iMaxNumPackets, UsbdiUtils::Panic(UsbdiPanics::EOutOfBoundsOfResultArray));
+	return *(iResPtr + aIndex);
+	}
+
+EXPORT_C TInt TPacketResults::operator[](TInt aIndex) const
+	{
+	return At(aIndex);
+	}
+
+EXPORT_C TInt TPacketResults::MaxNumPackets()
+	{
+	return iMaxNumPackets;
+	}
+
+
+
+void RUsbTransferStrategy::Close()
+	{
+	// Doesn't currently own any resources.
+	}
+	
+void RUsbTransferStrategy::SetTransferHandle(RUsbTransferDescriptor& aTransfer, TInt aHandle) const
+	{
+	aTransfer.iHandle = aHandle;
+	aTransfer.iTransferStrategy = const_cast<RUsbTransferStrategy*>(this);
+	if(aTransfer.iType == RUsbTransferDescriptor::EIsochronous)
+		{
+		static_cast<RUsbIsocTransferDescriptor&>(aTransfer).iWriteHandle = aHandle;
+		}
+	}
+
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/usbtransferstrategy.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/usbtransferstrategy.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,64 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+//
+
+/**
+ @file
+ @internalComponent
+*/
+
+#ifndef USBTRANSFERSTRATEGY_H
+#define USBTRANSFERSTRATEGY_H
+
+#include <e32std.h>
+#include <d32usbtransfers.h>
+
+
+NONSHARABLE_CLASS(RUsbTransferStrategy)
+	{
+public:
+	virtual void Close();
+
+	virtual TInt RegisterTransferDescriptor(RUsbTransferDescriptor& aTransferDesc, TInt aRequiredSize, TUint aStartAlignment, TInt aRequiredMaxPackets) =0;
+	virtual void ResetTransferDescriptors() =0;
+	virtual TInt InitialiseTransferDescriptors(RUsbInterface& aInterface) =0;
+
+public: // Interrupt transfer descriptor methods
+	virtual TPtr8	IntrWritableBuffer(TInt aHandle) =0;
+	virtual void	IntrSaveData(TInt aHandle, TInt aLength) =0;
+	virtual void	IntrSetZlpStatus(TInt aHandle, RUsbTransferDescriptor::TZlpStatus aZlpStatus) =0;
+	virtual TPtrC8	IntrBuffer(TInt aHandle) const =0;
+
+public: // Bulk transfer descriptor methods
+	virtual TPtr8	BulkWritableBuffer(TInt aHandle) =0;
+	virtual void	BulkSaveData(TInt aHandle, TInt aLength) =0;
+	virtual void	BulkSetZlpStatus(TInt aHandle, RUsbTransferDescriptor::TZlpStatus aZlpStatus) =0;
+	virtual TPtrC8	BulkBuffer(TInt aHandle) const =0;
+
+public: // Isochronous transfer descriptor methods
+	virtual void	IsocReset(TInt aHandle) =0;
+	virtual TPacketLengths IsocLengths(TInt aHandle) =0;
+	virtual TPacketResults IsocResults(TInt aHandle) =0;
+	virtual TInt	IsocMaxPacketSize(TInt aHandle) =0;
+	virtual TPtr8	IsocWritablePackets(TInt aHandle, TInt aWriteHandle, TInt aNumPacketsRequested, TInt& aMaxNumPacketsAbleToWrite) =0;
+	virtual TInt	IsocSaveMultiple(TInt aHandle, TInt aWriteHandle, TInt aNumOfPackets) =0;
+	virtual TPtrC8	IsocPackets(TInt aHandle, TInt aFirstPacketIndex, TInt aNumPacketsRequested, TInt& aNumPacketsReturned) const =0;
+	virtual void	IsocReceivePackets(TInt aHandle, TInt aNumOfPackets) =0;
+
+protected:
+	void SetTransferHandle(RUsbTransferDescriptor& aTransfer, TInt aHandle) const;
+	};
+
+
+#endif // USBTRANSFERSTRATEGY_H
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/zerocopymetadata.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/zerocopymetadata.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,152 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Description:
+//
+
+/**
+ @file
+ @internalComponent
+*/
+
+#ifndef ZEROCOPYMETADATA_H
+#define ZEROCOPYMETADATA_H
+
+#include <e32def.h>
+
+// The type used to represent an address various betwen user and kernel
+// mode.  To aid us we use a macro to produce only one definition.
+#ifndef __KERNEL_MODE__
+#define TAddrType TUint8*
+#else // __KERNEL_MODE__
+#define TAddrType TLinAddr
+#endif // __KERNEL_MODE__
+
+
+NONSHARABLE_CLASS(UsbZeroCopyChunkHeaderBase)
+	{
+public:
+	static inline RUsbTransferDescriptor::TTransferType& TransferType(TAddrType aBase, TInt aHeaderOffset);
+protected:
+	enum THeaderBaseSizes
+		{
+		ETransferTypeSize = sizeof(RUsbTransferDescriptor::TTransferType)
+		};
+	enum THeaderBaseLayout
+		{
+		ETransferType	= 0,
+		// End of fields
+		EHeaderBaseSize	= ETransferType + ETransferTypeSize
+		};
+	};
+
+
+NONSHARABLE_CLASS(UsbZeroCopyBulkIntrChunkHeader) : public UsbZeroCopyChunkHeaderBase
+	{
+public:
+	static inline TInt HeaderSize();
+	
+	static inline TInt& DataOffset(TAddrType aBase, TInt aHeaderOffset);
+	static inline TInt& DataLength(TAddrType aBase, TInt aHeaderOffset);
+	static inline TInt& DataMaxLength(TAddrType aBase, TInt aHeaderOffset);
+	static inline RUsbTransferDescriptor::TZlpStatus& ZlpStatus(TAddrType aBase, TInt aHeaderOffset);
+private:
+	enum THeaderSizes
+		{
+		EDataOffsetSize		= sizeof(TInt),
+		EDataLengthSize		= sizeof(TInt),
+		EDataMaxLengthSize	= sizeof(TInt),
+		EZlpStatusSize		= sizeof(RUsbTransferDescriptor::TZlpStatus)
+		};
+	enum THeaderLayout
+		{
+		EDataOffset		= EHeaderBaseSize,
+		EDataLength		= EDataOffset + EDataOffsetSize,
+		EDataMaxLength	= EDataLength + EDataLengthSize,
+		EZlpStatus		= EDataMaxLength + EDataMaxLengthSize,
+		// End of fields
+		EHeaderSize		= EZlpStatus + EZlpStatusSize
+		};
+	};
+
+
+NONSHARABLE_CLASS(UsbZeroCopyIsocChunkHeader) : public UsbZeroCopyChunkHeaderBase
+	{
+public: // Lengths Array constants
+	static const TInt KLengthsElementSize = sizeof(TUint16);
+	static const TInt KResultsElementSize = sizeof(TInt);
+public:
+	static inline TInt HeaderSize();
+	
+	static inline TInt& FirstElementOffset(TAddrType aBase, TInt aHeaderOffset);
+	static inline TInt& MaxNumPackets(TAddrType aBase, TInt aHeaderOffset);
+	static inline TInt& MaxPacketSize(TAddrType aBase, TInt aHeaderOffset);
+	static inline TInt& LengthsOffset(TAddrType aBase, TInt aHeaderOffset);
+	static inline TInt& ReqLenOffset(TAddrType aBase, TInt aHeaderOffset);
+	static inline TInt& ResultsOffset(TAddrType aBase, TInt aHeaderOffset);
+private:
+	enum THeaderSizes
+		{
+		EFirstElementOffsetSize	= sizeof(TInt),
+		EMaxNumPacketsSize		= sizeof(TInt),
+		EMaxPacketSizeSize		= sizeof(TInt),
+		ELengthsOffsetSize		= sizeof(TInt),
+		EReqLenOffsetSize		= sizeof(TInt),
+		EResultsOffsetSize		= sizeof(TInt)
+		};
+	enum THeaderLayout
+		{
+		EFirstElementOffset	= EHeaderBaseSize,
+		EMaxNumPackets		= EFirstElementOffset + EFirstElementOffsetSize,
+		EMaxPacketSize		= EMaxNumPackets + EMaxNumPacketsSize,
+		ELengthsOffset		= EMaxPacketSize + EMaxPacketSizeSize,
+		EReqLenOffset		= ELengthsOffset + ELengthsOffsetSize,
+		EResultsOffset		= EReqLenOffset + EReqLenOffsetSize,
+		// End of fields
+		EHeaderSize			= EResultsOffset + EResultsOffsetSize
+		};
+	};
+
+
+NONSHARABLE_CLASS(UsbZeroCopyIsocChunkElement)
+	{
+public: 
+	// NumOfPackets constants
+	static const TInt KInvalidElement = -1;
+	// NextElementOffset constants
+	static const TInt KEndOfList = -1;
+public:
+	static inline TInt ElementSize();
+	
+	static inline TInt& DataOffset(TAddrType aBase, TInt aHeaderOffset);
+	static inline TInt& NumPackets(TAddrType aBase, TInt aHeaderOffset);
+	static inline TInt& NextElementOffset(TAddrType aBase, TInt aHeaderOffset);
+private:
+	enum THeaderSizes
+		{
+		EDataOffsetSize			= sizeof(TInt),
+		ENumPacketsSize			= sizeof(TInt),
+		ENextElementOffsetSize	= sizeof(TInt),
+		};
+	enum THeaderLayout
+		{
+		EDataOffset			= 0,
+		ENumPackets			= EDataOffset + EDataOffsetSize,
+		ENextElementOffset	= ENumPackets + ENumPacketsSize,
+		// End of fields
+		EElementSize		= ENextElementOffset + ENextElementOffsetSize
+		};
+	};
+
+#include "zerocopymetadata.inl"
+
+#undef TAddrType // Prevent the macro from leaking outside this header
+
+#endif // ZEROCOPYMETADATA_H
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/zerocopymetadata.inl
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/zerocopymetadata.inl	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,141 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Description:
+//
+
+/**
+ @file
+ @internalComponent
+*/
+
+
+template<typename XReturnType, TInt XFieldOffset>
+inline XReturnType& Field(TAddrType aBase, TInt aHeaderOffset)
+	{
+	TInt offset = aHeaderOffset + XFieldOffset;
+	return *reinterpret_cast<XReturnType*>(aBase + offset);
+	}
+
+
+//
+// UsbZeroCopyChunkHeaderBase
+//
+
+inline RUsbTransferDescriptor::TTransferType& UsbZeroCopyChunkHeaderBase::TransferType(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<RUsbTransferDescriptor::TTransferType, ETransferType>(aBase, aHeaderOffset);
+	}
+
+
+
+//
+// UsbZeroCopyBulkIntrChunkHeader
+//
+
+inline TInt UsbZeroCopyBulkIntrChunkHeader::HeaderSize()
+	{
+	__ASSERT_COMPILE(EHeaderSize % sizeof(TInt) == 0);
+	return EHeaderSize;
+	}
+
+
+inline TInt& UsbZeroCopyBulkIntrChunkHeader::DataOffset(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<TInt, EDataOffset>(aBase, aHeaderOffset);
+	}
+
+inline TInt& UsbZeroCopyBulkIntrChunkHeader::DataLength(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<TInt, EDataLength>(aBase, aHeaderOffset);
+	}
+
+inline TInt& UsbZeroCopyBulkIntrChunkHeader::DataMaxLength(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<TInt, EDataMaxLength>(aBase, aHeaderOffset);
+	}
+	
+inline RUsbTransferDescriptor::TZlpStatus& UsbZeroCopyBulkIntrChunkHeader::ZlpStatus(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<RUsbTransferDescriptor::TZlpStatus, EZlpStatus>(aBase, aHeaderOffset);
+	}
+
+
+
+//
+// UsbZeroCopyIsocChunkHeader
+//
+
+inline TInt UsbZeroCopyIsocChunkHeader::HeaderSize()
+	{
+	__ASSERT_COMPILE(EHeaderSize % sizeof(TInt) == 0);
+	return EHeaderSize;
+	}
+
+
+inline TInt& UsbZeroCopyIsocChunkHeader::FirstElementOffset(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<TInt, EFirstElementOffset>(aBase, aHeaderOffset);
+	}
+
+inline TInt& UsbZeroCopyIsocChunkHeader::MaxNumPackets(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<TInt, EMaxNumPackets>(aBase, aHeaderOffset);
+	}
+
+inline TInt& UsbZeroCopyIsocChunkHeader::MaxPacketSize(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<TInt, EMaxPacketSize>(aBase, aHeaderOffset);
+	}
+
+inline TInt& UsbZeroCopyIsocChunkHeader::LengthsOffset(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<TInt, ELengthsOffset>(aBase, aHeaderOffset);
+	}
+	
+inline TInt& UsbZeroCopyIsocChunkHeader::ReqLenOffset(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<TInt, EReqLenOffset>(aBase, aHeaderOffset);
+	}
+	
+inline TInt& UsbZeroCopyIsocChunkHeader::ResultsOffset(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<TInt, EResultsOffset>(aBase, aHeaderOffset);
+	}
+
+
+
+//
+// UsbZeroCopyIsocChunkHeader
+//
+
+inline TInt UsbZeroCopyIsocChunkElement::ElementSize()
+	{
+	__ASSERT_COMPILE(EElementSize % sizeof(TInt) == 0);
+	return EElementSize;
+	}
+
+
+inline TInt& UsbZeroCopyIsocChunkElement::DataOffset(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<TInt, EDataOffset>(aBase, aHeaderOffset);
+	}
+
+inline TInt& UsbZeroCopyIsocChunkElement::NumPackets(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<TInt, ENumPackets>(aBase, aHeaderOffset);
+	}
+
+inline TInt& UsbZeroCopyIsocChunkElement::NextElementOffset(TAddrType aBase, TInt aHeaderOffset)
+	{
+	return Field<TInt, ENextElementOffset>(aBase, aHeaderOffset);
+	}
+	
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/zerocopytransferstrategy.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/zerocopytransferstrategy.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,982 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+//
+
+#include "zerocopytransferstrategy.h"
+
+#include <d32usbtransfers.h>
+#include <d32usbdi.h>
+#include <d32usbdi_errors.h>
+#include "zerocopymetadata.h"
+#include "usbdiutils.h"
+
+
+RUsbZeroCopyTransferStrategy::TUsbTransferDescriptorDetails::TUsbTransferDescriptorDetails(RUsbTransferDescriptor& aTransferDesc, TInt aRequiredSize, TUint aRequiredAlignment, TInt aRequiredMaxPackets)
+	: iTransferDesc(aTransferDesc)
+	, iRequiredSize(aRequiredSize)
+	, iRequiredAlignment(aRequiredAlignment)
+	, iRequiredMaxPackets(aRequiredMaxPackets)
+	{
+	}
+	
+RUsbZeroCopyTransferStrategy::RUsbZeroCopyTransferStrategy()
+	: iInterfaceHandle(NULL)
+	{
+	}
+
+
+void RUsbZeroCopyTransferStrategy::Close()
+	{
+	iInterfaceHandle = NULL;
+	iChunk.Close();
+	iRegisteredTransfers.Close();
+	RUsbTransferStrategy::Close();
+	}
+
+
+TInt RUsbZeroCopyTransferStrategy::RegisterTransferDescriptor(RUsbTransferDescriptor& aTransferDesc, TInt aRequiredSize, TUint aStartAlignment, TInt aRequiredMaxPackets)
+	{
+	__ASSERT_ALWAYS(!iInterfaceHandle, UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorsAlreadyRegistered));
+	if (iRegisteredTransfers.Find(aTransferDesc, CompareTransferDescriptor) != KErrNotFound)
+		{
+		return KErrAlreadyExists;
+		}
+	return iRegisteredTransfers.Append(TUsbTransferDescriptorDetails(aTransferDesc, aRequiredSize, aStartAlignment, aRequiredMaxPackets));
+	}
+
+TBool RUsbZeroCopyTransferStrategy::CompareTransferDescriptor(const RUsbTransferDescriptor* aTransferDesc, const TUsbTransferDescriptorDetails& aDetails)
+	{
+	return aTransferDesc == &aDetails.iTransferDesc;
+	}
+
+
+void RUsbZeroCopyTransferStrategy::ResetTransferDescriptors()
+	{
+	__ASSERT_ALWAYS(!iInterfaceHandle, UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorsAlreadyRegistered));
+	iRegisteredTransfers.Reset();
+	}
+
+
+TInt RUsbZeroCopyTransferStrategy::InitialiseTransferDescriptors(RUsbInterface& aInterface)
+	{
+	__ASSERT_ALWAYS(!iInterfaceHandle, UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorsAlreadyRegistered));
+
+	// This is the equivilent of a standard R-class Open() method, so initialise the references
+	// we are going to use.
+	iInterfaceHandle = &aInterface;
+
+	// First get the page-size as we will need this for isoc transfer calculations.
+	TInt hcdPageSize = 0;
+	TInt err = aInterface.GetHcdPageSize(hcdPageSize);
+	if (err != KErrNone)
+		{
+		Close(); // roll back
+		return err;
+		}
+	iPageSize = hcdPageSize;
+
+	TInt currentOffset = 0;
+	TInt numStandardTransfers = 0;
+	TInt numIsocTransfers = 0;
+	TInt numIsocElements = 0;
+	err = CalculateDataLayout(currentOffset, numStandardTransfers, numIsocTransfers, numIsocElements);
+	if (err != KErrNone)
+		{
+		Close(); // roll back
+		return err;
+		}
+
+	TInt metaDataStart = 0;
+	CalculateMetaDataLayout(currentOffset, metaDataStart, numStandardTransfers, numIsocTransfers, numIsocElements);
+
+	// currentOffset should now be just past the region required for all the data and meta data.
+	// Therefore it equals the total size of the buffer we need to hold them all.
+	err = iInterfaceHandle->AllocateSharedChunk(iChunk, currentOffset, iBaseOffset);
+	if (err != KErrNone)
+		{
+		Close(); // roll back
+		return err;
+		}
+
+	InitialiseMetaData(metaDataStart, numStandardTransfers, numIsocTransfers, numIsocElements);
+
+	return KErrNone;
+	}
+
+TInt RUsbZeroCopyTransferStrategy::CalculateDataLayout(TInt& aCurrentOffset, TInt& aNumStandardTransfers, TInt& aNumIsocTransfers, TInt& aNumIsocElements)
+	{
+	const TUint32 pageAddrBits = iPageSize-1;
+	const TUint32 pageTableMask = ~pageAddrBits;
+
+	//Get the maximum wMaxPacketSize of the associated interface for Bulk/Interrupt EPs
+	TInt maxMaxBulk = 0;
+	TInt maxMaxInterrupt = 0;
+	TInt err = GetMaximumMaxPacketSize(maxMaxBulk, maxMaxInterrupt);
+	if (err != KErrNone)
+		{
+		return err;
+		}
+	
+	// Work out where to place the transfers, and how much space is needed.
+	TInt numTransfers = iRegisteredTransfers.Count();
+	for (TInt i=0; i < numTransfers; ++i)
+		{
+		TUsbTransferDescriptorDetails& details = iRegisteredTransfers[i];
+		
+		err = CaculateAdditionalAlignment(aCurrentOffset, maxMaxBulk, maxMaxInterrupt, details);
+		if (err != KErrNone)
+			{
+			return err;
+			}
+		
+		// only allow intra-page alignment requests that are powers of 2 (so offset agnostic).
+		__ASSERT_ALWAYS(details.iRequiredAlignment <= iPageSize, UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorAlignmentOverPageBoundary));
+		__ASSERT_ALWAYS(IsPowerOfTwo(details.iRequiredAlignment), UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorAlignmentNotPowerOfTwo));
+
+		TInt alignPad = IncNeededToAlign(aCurrentOffset, details.iRequiredAlignment);
+		__ASSERT_DEBUG(alignPad < iPageSize, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadAlignment)); // just re-asserting what should be guarded above
+		aCurrentOffset += alignPad; // Align to the start of transfer buffer
+
+		// There are stark differences between isoc transfers and transfer of other types.
+		if (details.iTransferDesc.iType == RUsbTransferDescriptor::EIsochronous)
+			{
+			// First do some Isoc specific checks
+			__ASSERT_ALWAYS(details.iRequiredMaxPackets > 0, UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorNoPacketsRequested));
+
+			// For the allocation we have to consider the worse case - that is that the max
+			// number of packets at the max packet size.
+			// We are constrained by the USB stack to not allow transfers across page boundaries.
+
+			// As such we calculate how many packets we can fit into a page to determine the
+			// number of pages for data we need.
+			const TInt packetsPerPage = iPageSize/details.iRequiredSize;
+
+			// Assign the start to an appropriate point.
+			details.iAssignedOffset = aCurrentOffset;
+			TInt packetsToStore = details.iRequiredMaxPackets;
+			TInt numElements = 0; // for counting up the number of pages we need meta-data for.
+			
+			// The size requried to hold a length array for the descriptor
+			const TInt lengthsArrayLength = UsbZeroCopyIsocChunkHeader::KLengthsElementSize * details.iRequiredMaxPackets;
+			// The size required to hold a result array for the descriptor
+			const TInt resultsArrayLength = UsbZeroCopyIsocChunkHeader::KResultsElementSize * details.iRequiredMaxPackets;
+
+			// Determine how much we can fit into the remaining space of the current page.
+			TBool samePage = (pageTableMask & aCurrentOffset) == (pageTableMask & (aCurrentOffset - alignPad));
+			if (samePage)
+				{
+				TInt remainingSpace = iPageSize - (pageAddrBits & aCurrentOffset);
+				TInt packetsThatFit = remainingSpace / details.iRequiredSize;
+				if (packetsThatFit >= packetsToStore)
+					{
+					// We can fit it in this page so we finish here - this is the special case.
+					aCurrentOffset += packetsToStore * details.iRequiredSize;
+					++aNumIsocElements;
+					++aNumIsocTransfers;
+					details.iNumElements = 1;
+					// Do the lengths array
+					aCurrentOffset += IncNeededToAlign(aCurrentOffset, UsbZeroCopyIsocChunkHeader::KLengthsElementSize);
+					details.iLengthsOffset = aCurrentOffset;
+					aCurrentOffset += lengthsArrayLength;
+					// The dual lengths array should be implicitly alligned
+					details.iReqLenOffset = aCurrentOffset;
+					aCurrentOffset += lengthsArrayLength;
+					// Now handle the results array
+					aCurrentOffset += IncNeededToAlign(aCurrentOffset, UsbZeroCopyIsocChunkHeader::KResultsElementSize);
+					details.iResultsOffset = aCurrentOffset;
+					aCurrentOffset += resultsArrayLength;
+					continue;
+					}
+				aCurrentOffset = (pageTableMask & aCurrentOffset) + iPageSize; // Advance to next page
+				packetsToStore -= packetsThatFit;
+				++numElements;
+				}
+			__ASSERT_DEBUG(packetsToStore > 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorNoPacketsLeftToStore));
+
+			// Determine the number of pages extra that are needed (minus one)
+			TInt pagesRequired = packetsToStore / packetsPerPage;
+
+			// Determine how much of the last page is actually needed.
+			TInt trailingPackets = packetsToStore % packetsPerPage;
+			TInt usedSpace = trailingPackets * details.iRequiredSize;
+
+			// Commit the amount for the buffers.
+			aCurrentOffset += usedSpace + pagesRequired*iPageSize;
+			numElements += pagesRequired + /*the final page*/1; // We have already included the first page (if already partially used)
+			aNumIsocElements += numElements;
+			++aNumIsocTransfers;
+
+			// Used to ensure only allocate an appropriate number per-descriptor.
+			details.iNumElements = numElements;
+
+			// We also need an array of lengths for each packet that we use (need to align to even bytes).
+			aCurrentOffset += IncNeededToAlign(aCurrentOffset, UsbZeroCopyIsocChunkHeader::KLengthsElementSize);
+			details.iLengthsOffset = aCurrentOffset;
+			aCurrentOffset += lengthsArrayLength;
+			// Dual length array should be implicitly aligned
+			details.iReqLenOffset = aCurrentOffset;
+			aCurrentOffset += lengthsArrayLength;
+			// Now handle the results array
+			aCurrentOffset += IncNeededToAlign(aCurrentOffset, UsbZeroCopyIsocChunkHeader::KResultsElementSize);
+			details.iResultsOffset = aCurrentOffset;
+			aCurrentOffset += resultsArrayLength;
+			}
+		else
+			{
+			details.iAssignedOffset = aCurrentOffset;
+			aCurrentOffset += details.iRequiredSize;
+			++aNumStandardTransfers;
+			}
+		}
+	
+	return KErrNone;
+	}
+
+
+void RUsbZeroCopyTransferStrategy::CalculateMetaDataLayout(TInt& aCurrentOffset, TInt& aMetaDataStart, TInt aNumStandardTransfers, TInt aNumIsocTransfers, TInt aNumIsocElements)
+	{
+	// Round up to 4 byte alignment for handling the meta-data correctly.
+	aCurrentOffset += IncNeededToAlign(aCurrentOffset, sizeof(TInt));
+
+	aMetaDataStart = aCurrentOffset;
+
+	// Now calculate the size required for the transfer meta-data.
+	aCurrentOffset += aNumStandardTransfers * UsbZeroCopyBulkIntrChunkHeader::HeaderSize();
+	aCurrentOffset += aNumIsocTransfers * UsbZeroCopyIsocChunkHeader::HeaderSize();
+	aCurrentOffset += aNumIsocElements * UsbZeroCopyIsocChunkElement::ElementSize();
+	}
+	
+void RUsbZeroCopyTransferStrategy::InitialiseMetaData(TInt aMetaDataOffset, TInt aNumStandardTransfers, TInt aNumIsocTransfers, TInt aNumIsocElements)
+	{
+	const TUint32 pageAddrBits = iPageSize-1;
+	const TUint32 pageTableMask = ~pageAddrBits;
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+
+	TInt numTransfers = iRegisteredTransfers.Count();
+	for (TInt i=0; i < numTransfers; ++i)
+		{
+		TUsbTransferDescriptorDetails details = iRegisteredTransfers[i];
+
+		if (details.iTransferDesc.iType == RUsbTransferDescriptor::EIsochronous)
+			{
+			// Initialise Meta-data (minus elements).
+			UsbZeroCopyIsocChunkHeader::TransferType(chunkBase, aMetaDataOffset) = details.iTransferDesc.iType;
+			UsbZeroCopyIsocChunkHeader::MaxNumPackets(chunkBase, aMetaDataOffset) = details.iRequiredMaxPackets;
+			UsbZeroCopyIsocChunkHeader::MaxPacketSize(chunkBase, aMetaDataOffset) = details.iRequiredSize;
+			// Double check that the length array is aligned correctly.
+			__ASSERT_DEBUG(details.iLengthsOffset % UsbZeroCopyIsocChunkHeader::KLengthsElementSize == 0,
+				UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorLengthsArrayBadAlignment));
+			UsbZeroCopyIsocChunkHeader::LengthsOffset(chunkBase, aMetaDataOffset) = details.iLengthsOffset;
+			UsbZeroCopyIsocChunkHeader::ReqLenOffset(chunkBase, aMetaDataOffset) = details.iReqLenOffset;
+			// Double check that the result array is aligned correctly.
+			__ASSERT_DEBUG(details.iResultsOffset % UsbZeroCopyIsocChunkHeader::KResultsElementSize == 0,
+				UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorResultsArrayBadAlignment));
+			UsbZeroCopyIsocChunkHeader::ResultsOffset(chunkBase, aMetaDataOffset) = details.iResultsOffset;
+			// Initialise transfer descriptor
+			SetTransferHandle(details.iTransferDesc, aMetaDataOffset);
+			// Move on to next meta-data slot
+			TInt prevMetaOffset = aMetaDataOffset;
+			aMetaDataOffset += UsbZeroCopyIsocChunkHeader::HeaderSize();
+
+			// Initialise elements for transfers
+			UsbZeroCopyIsocChunkHeader::FirstElementOffset(chunkBase, prevMetaOffset) = aMetaDataOffset;
+			
+			TInt isocElementsUnmapped = details.iNumElements;
+			// First element could be anywhere, the others are at the start of (virtually) contiguous pages
+			TInt offset = details.iAssignedOffset;
+			while (isocElementsUnmapped > 0)
+				{
+				// Update the data references
+				UsbZeroCopyIsocChunkElement::DataOffset(chunkBase, aMetaDataOffset) = offset;
+				UsbZeroCopyIsocChunkElement::NumPackets(chunkBase, aMetaDataOffset) = 0; // Default value.
+				// Move on to the next element and bind it to the chain.
+				prevMetaOffset = aMetaDataOffset;
+				aMetaDataOffset += UsbZeroCopyIsocChunkElement::ElementSize();
+				UsbZeroCopyIsocChunkElement::NextElementOffset(chunkBase, prevMetaOffset) = aMetaDataOffset;
+				// Move to the next page
+				offset = (pageTableMask&offset)+iPageSize;
+				--isocElementsUnmapped;
+				--aNumIsocElements;
+				}
+			// We have reached the end of the list so we should update the next element offset for the
+			// last element to indicate that it is the terminator.
+			UsbZeroCopyIsocChunkElement::NextElementOffset(chunkBase, prevMetaOffset) = UsbZeroCopyIsocChunkElement::KEndOfList;
+			--aNumIsocTransfers;
+			}
+		else
+			{
+			// Initialise Meta-data.
+			UsbZeroCopyBulkIntrChunkHeader::TransferType(chunkBase, aMetaDataOffset) = details.iTransferDesc.iType;
+			UsbZeroCopyBulkIntrChunkHeader::DataOffset(chunkBase, aMetaDataOffset) = details.iAssignedOffset;
+			UsbZeroCopyBulkIntrChunkHeader::DataLength(chunkBase, aMetaDataOffset) = 0;
+			UsbZeroCopyBulkIntrChunkHeader::DataMaxLength(chunkBase, aMetaDataOffset) = details.iRequiredSize;
+			UsbZeroCopyBulkIntrChunkHeader::ZlpStatus(chunkBase, aMetaDataOffset) = RUsbTransferDescriptor::ESendZlpIfRequired;
+			// Initialise transfer descriptor
+			SetTransferHandle(details.iTransferDesc, aMetaDataOffset);
+			// Move on to next meta-data slot
+			aMetaDataOffset += UsbZeroCopyBulkIntrChunkHeader::HeaderSize();
+			--aNumStandardTransfers;
+			}
+		}
+
+	__ASSERT_DEBUG(aNumStandardTransfers == 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorIncompleteInitialisation));
+	__ASSERT_DEBUG(aNumIsocTransfers == 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorIncompleteInitialisation));
+	__ASSERT_DEBUG(aNumIsocElements == 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorIncompleteInitialisation));
+	}
+
+
+TBool RUsbZeroCopyTransferStrategy::IsPowerOfTwo(TUint aNumber)
+	{
+    return aNumber && !(aNumber & (aNumber - 1)); //this returns true if the integer is a power of two
+    }
+
+
+TInt RUsbZeroCopyTransferStrategy::IncNeededToAlign(TInt aOffset, TUint aAlignment)
+	{
+	if (aAlignment == 0)
+		{
+		return 0;
+		}
+	TInt remain = aOffset % aAlignment;
+	return (aAlignment - remain) % aAlignment;
+	}
+
+
+// Standard Methods
+
+TPtr8 RUsbZeroCopyTransferStrategy::WritableBuffer(TInt aHandle)
+	{
+	__ASSERT_DEBUG(aHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadHandle));
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+	
+	TUint8* dataPtr = chunkBase + UsbZeroCopyBulkIntrChunkHeader::DataOffset(chunkBase, aHandle);
+	TInt maxLength = UsbZeroCopyBulkIntrChunkHeader::DataMaxLength(chunkBase, aHandle);
+
+	return TPtr8(dataPtr, 0, maxLength);
+	}
+
+void RUsbZeroCopyTransferStrategy::SaveData(TInt aHandle, TInt aLength)
+	{
+	__ASSERT_DEBUG(aHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadHandle));
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+
+	TInt maxLength = UsbZeroCopyBulkIntrChunkHeader::DataMaxLength(chunkBase, aHandle);
+	__ASSERT_ALWAYS(aLength <= maxLength, UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorSavedToMuchData));
+
+	UsbZeroCopyBulkIntrChunkHeader::DataLength(chunkBase, aHandle) = aLength;
+	}
+	
+void RUsbZeroCopyTransferStrategy::SetZlpStatus(TInt aHandle, RUsbTransferDescriptor::TZlpStatus aZlpStatus)
+	{
+	__ASSERT_DEBUG(aHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadHandle));
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+
+	UsbZeroCopyBulkIntrChunkHeader::ZlpStatus(chunkBase, aHandle) = aZlpStatus;
+	}
+
+TPtrC8 RUsbZeroCopyTransferStrategy::Buffer(TInt aHandle) const
+	{
+	__ASSERT_DEBUG(aHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadHandle));
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+	
+	TUint8* dataPtr = chunkBase + UsbZeroCopyBulkIntrChunkHeader::DataOffset(chunkBase, aHandle);
+	TInt length = UsbZeroCopyBulkIntrChunkHeader::DataLength(chunkBase, aHandle);
+
+	return TPtrC8(dataPtr, length);
+	}
+	
+
+
+
+// Isochronous Methods
+	
+void RUsbZeroCopyTransferStrategy::Reset(TInt aHandle)
+	{
+	__ASSERT_DEBUG(aHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadHandle));
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+
+	// Loop through and reset number of packets in each element as 0
+	TInt elementOffset = UsbZeroCopyIsocChunkHeader::FirstElementOffset(chunkBase, aHandle);
+	while (elementOffset != UsbZeroCopyIsocChunkElement::KEndOfList)
+		{
+		UsbZeroCopyIsocChunkElement::NumPackets(chunkBase, elementOffset) = 0;
+		elementOffset = UsbZeroCopyIsocChunkElement::NextElementOffset(chunkBase, elementOffset);
+		}
+	}
+
+TPacketLengths RUsbZeroCopyTransferStrategy::Lengths(TInt aHandle)
+	{
+	__ASSERT_DEBUG(aHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadHandle));
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+
+	TInt lengthsOffset = UsbZeroCopyIsocChunkHeader::LengthsOffset(chunkBase, aHandle);
+	TUint16* lengthsPtr = reinterpret_cast<TUint16*>(chunkBase + lengthsOffset);
+	
+	TInt reqLenOffset = UsbZeroCopyIsocChunkHeader::ReqLenOffset(chunkBase, aHandle);
+	TUint16* reqLenPtr = reinterpret_cast<TUint16*>(chunkBase + reqLenOffset);
+
+	TInt& maxNumPackets = UsbZeroCopyIsocChunkHeader::MaxNumPackets(chunkBase, aHandle);
+
+	return TPacketLengths(lengthsPtr, reqLenPtr, maxNumPackets);
+	}
+	
+TPacketResults RUsbZeroCopyTransferStrategy::Results(TInt aHandle)
+	{
+	__ASSERT_DEBUG(aHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadHandle));
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+
+	TInt resultsOffset = UsbZeroCopyIsocChunkHeader::ResultsOffset(chunkBase, aHandle);
+	TInt* resultsPtr = reinterpret_cast<TInt*>(chunkBase + resultsOffset);
+
+	TInt& maxNumPackets = UsbZeroCopyIsocChunkHeader::MaxNumPackets(chunkBase, aHandle);
+
+	return TPacketResults(resultsPtr, maxNumPackets);
+	}
+
+TInt RUsbZeroCopyTransferStrategy::MaxPacketSize(TInt aHandle)
+	{
+	__ASSERT_DEBUG(aHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadHandle));
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+
+	TInt maxPacketSize = UsbZeroCopyIsocChunkHeader::MaxPacketSize(chunkBase, aHandle);
+	
+	return maxPacketSize;
+	}
+
+TPtr8 RUsbZeroCopyTransferStrategy::WritablePackets(TInt aHandle, TInt aWriteHandle, TInt aNumPacketsRequested, TInt& aMaxNumPacketsAbleToWrite)
+	{
+	__ASSERT_DEBUG(aHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadHandle));
+	__ASSERT_DEBUG(aWriteHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadWriteHandle));
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+	
+	const TUint32 pageAddrBits = iPageSize-1;
+	const TUint32 pageTableMask = ~pageAddrBits;
+	
+	if (aHandle == aWriteHandle)
+		{
+		// The initial write handle will be the same as the standard handle so we need to find the actual 
+		// element to work correctly.
+		aWriteHandle = UsbZeroCopyIsocChunkHeader::FirstElementOffset(chunkBase, aHandle);
+		}
+
+	// Now we have two cases - the number of packets requested is contained in one page, or it crosses the page.
+	// 1) If we cross the page then we get the buffer for upto the end of the page, and inform the user of the number
+	// of packets they are able to write into it (normally this will be quite high as we can consider 0 length
+	// packets.)
+	// 2) If we are on one page then we provide a buffer to the end of the page and return the number of packets
+	// the requested as the max they can write.  However we also now mark it so that an attempt to get a subsequent
+	// writable buffer will return a 0 max length TPtr8 and 0 max number of packets to write.  If they want write
+	// more they need to reset the descriptor and start again.
+
+	if (UsbZeroCopyIsocChunkElement::NumPackets(chunkBase, aWriteHandle) == UsbZeroCopyIsocChunkElement::KInvalidElement)
+		{
+		// Here we are testing the second case, if we previously marked an element as invalid then we must not
+		// return a valid buffer.
+		aMaxNumPacketsAbleToWrite = 0;
+		return TPtr8(NULL, 0);
+		}
+
+	TInt dataOffset = UsbZeroCopyIsocChunkElement::DataOffset(chunkBase, aWriteHandle);
+	
+	TUint8* dataPtr = chunkBase + dataOffset;
+	TInt totalMaxSize = aNumPacketsRequested * UsbZeroCopyIsocChunkHeader::MaxPacketSize(chunkBase, aHandle);
+	// The USB stack requires isoc transfer to be limited to a page (not allowed to cross the boundary).
+	TUint32 dataAddr = reinterpret_cast<TUint32>(dataPtr);
+	TBool samePage = (pageTableMask & dataAddr) == (pageTableMask & (dataAddr + totalMaxSize));
+	TInt allowableSize = samePage ? totalMaxSize : iPageSize - (pageAddrBits & dataAddr);
+
+	TInt numPacketsRemaining = UsbZeroCopyIsocChunkHeader::MaxNumPackets(chunkBase, aHandle) - UsedPackets(aHandle);
+
+	if (aNumPacketsRequested < numPacketsRemaining)
+		{
+		// This is the 2nd case as documented in the comment.  So we mark the next packet as invalid.
+		aMaxNumPacketsAbleToWrite = aNumPacketsRequested;
+		TInt nextElement = UsbZeroCopyIsocChunkElement::NextElementOffset(chunkBase, aWriteHandle);
+		if (nextElement != UsbZeroCopyIsocChunkElement::KEndOfList)
+			{
+			UsbZeroCopyIsocChunkElement::NumPackets(chunkBase, nextElement) = UsbZeroCopyIsocChunkElement::KInvalidElement; // Mark as invalid.
+			}
+		// else we are at the end of the list anyway
+		}
+	else
+		{
+		aMaxNumPacketsAbleToWrite = numPacketsRemaining;
+		}
+
+	return TPtr8(dataPtr, allowableSize);
+	}
+
+TInt RUsbZeroCopyTransferStrategy::SaveMultiple(TInt aHandle, TInt aWriteHandle, TInt aNumPackets)
+	{
+	__ASSERT_DEBUG(aHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadHandle));
+	__ASSERT_DEBUG(aWriteHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadWriteHandle));
+	__ASSERT_ALWAYS(aNumPackets > 0, UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorNoPacketsToSave));
+	
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+
+	if (aHandle == aWriteHandle)
+		{
+		aWriteHandle = UsbZeroCopyIsocChunkHeader::FirstElementOffset(chunkBase, aHandle);
+		}
+
+	// if marked invalid then they shouldn't try to save it (they haven't been able to write anything into the data anyway).
+	__ASSERT_ALWAYS(UsbZeroCopyIsocChunkElement::NumPackets(chunkBase, aWriteHandle) != UsbZeroCopyIsocChunkElement::KInvalidElement,
+		UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorInvalidSaveCall));
+
+	// Ensure they've not tried to write in too many packets
+	TInt usedPackets = UsedPackets(aHandle);
+	__ASSERT_ALWAYS(aNumPackets + usedPackets <= UsbZeroCopyIsocChunkHeader::MaxNumPackets(chunkBase, aHandle),
+		UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorSavedTooManyPackets));
+
+	// Check that the length values have not exceeded the maximum.
+	TInt maxPacketSize = UsbZeroCopyIsocChunkHeader::MaxPacketSize(chunkBase, aHandle);
+	TInt lengthsOffset = UsbZeroCopyIsocChunkHeader::LengthsOffset(chunkBase, aHandle);
+	TUint16* lengthsPtr = reinterpret_cast<TUint16*>(chunkBase + lengthsOffset);
+#ifdef _DEBUG
+	// The requested length is only functionally needed for IN transfers, but it provides an
+	// extra check that the length values that were requested by the user are those that are
+	// been requested on the USB stack.
+	TInt reqLenOffset = UsbZeroCopyIsocChunkHeader::ReqLenOffset(chunkBase, aHandle);
+	TUint16* reqLenPtr = reinterpret_cast<TUint16*>(chunkBase + reqLenOffset);
+#endif // _DEBUG
+	for (TInt i=0; i < aNumPackets; ++i)
+		{
+		__ASSERT_ALWAYS(lengthsPtr[usedPackets + i] <= maxPacketSize, UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorSavingTooLargeAPacket));
+		__ASSERT_DEBUG(lengthsPtr[usedPackets + i] == reqLenPtr[usedPackets + i], UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorRequestedLengthDiffers)); // Belt 'n' Braces
+		}
+
+	// Commit the packets to the transfer descriptor.
+	UsbZeroCopyIsocChunkElement::NumPackets(chunkBase, aWriteHandle) = aNumPackets;
+	TInt headerOffset = UsbZeroCopyIsocChunkElement::NextElementOffset(chunkBase, aWriteHandle);
+	
+	// Return the handle to the next region for writing.
+	return (headerOffset == UsbZeroCopyIsocChunkElement::KEndOfList) ? KErrEof : headerOffset;
+	}
+
+/**
+Used to walk the elements to total up the number of packets that have been saved in the transfer descriptor.
+*/
+TInt RUsbZeroCopyTransferStrategy::UsedPackets(TInt aHeaderOffset)
+	{
+	__ASSERT_DEBUG(aHeaderOffset >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorInvalidHeaderOffset));
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+	TInt elementOffset = UsbZeroCopyIsocChunkHeader::FirstElementOffset(chunkBase, aHeaderOffset);
+	TInt totalNumPackets = 0;
+	while (elementOffset != UsbZeroCopyIsocChunkElement::KEndOfList)
+		{
+		TInt numPackets = UsbZeroCopyIsocChunkElement::NumPackets(chunkBase, elementOffset);
+		if (numPackets == 0 || numPackets == UsbZeroCopyIsocChunkElement::KInvalidElement)
+			{
+			break;
+			}
+		totalNumPackets += numPackets;
+		elementOffset = UsbZeroCopyIsocChunkElement::NextElementOffset(chunkBase, elementOffset);
+		}
+	return totalNumPackets;
+	}
+
+/**
+Used to read packets out from the transfer descriptor.
+Note that some of the panics are belt'n'braces, and are used to sanity test result that has been
+provided.  These should be correct (as the results are set by the kernel), however because the user
+has access to length array (for writing out packets) it is possible for them to 'corrupt' the result.
+We panic explicitly in UDEB builds, in UREL the guards are not present and the user may get returned
+a bad descriptor.
+*/
+TPtrC8 RUsbZeroCopyTransferStrategy::Packets(TInt aHandle, TInt aFirstPacketIndex, TInt aNumPacketsRequested, TInt& aNumPacketsReturned) const
+	{
+	__ASSERT_DEBUG(aHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadHandle));
+	__ASSERT_ALWAYS(aFirstPacketIndex >= 0, UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorPacketNotInBounds));
+	__ASSERT_ALWAYS(aNumPacketsRequested > 0, UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorTooFewPacketsRequested));
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+
+	__ASSERT_ALWAYS(aNumPacketsRequested <= UsbZeroCopyIsocChunkHeader::MaxNumPackets(chunkBase, aHandle),
+		UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorTooManyPacketsRequested));
+
+#ifdef _DEBUG
+	const TUint32 pageAddrBits = iPageSize-1;
+	const TUint32 pageTableMask = ~pageAddrBits;
+#endif // _DEBUG
+	const TInt maxPacketSize = UsbZeroCopyIsocChunkHeader::MaxPacketSize(chunkBase, aHandle);
+
+	TInt elementOffset = UsbZeroCopyIsocChunkHeader::FirstElementOffset(chunkBase, aHandle);
+	TInt packetCount = 0;
+	while (elementOffset != UsbZeroCopyIsocChunkElement::KEndOfList)
+		{
+		TInt numPackets = UsbZeroCopyIsocChunkElement::NumPackets(chunkBase, elementOffset);
+		if (numPackets == 0 || numPackets == UsbZeroCopyIsocChunkElement::KInvalidElement)
+			{
+			// We've got to the end of the elements and not found the packets we are after.
+			break;
+			}
+		TInt previousPacketCount = packetCount;
+		packetCount += numPackets;
+		if (aFirstPacketIndex < packetCount) // If true then start packet must be in this element
+			{
+			TInt intraElementIndex = aFirstPacketIndex - previousPacketCount;
+			TInt maxPacketsForReturn = packetCount - aFirstPacketIndex;
+
+			TInt lengthsOffset = UsbZeroCopyIsocChunkHeader::LengthsOffset(chunkBase, aHandle);
+			TUint16* lengthsPtr = reinterpret_cast<TUint16*>(chunkBase + lengthsOffset + previousPacketCount * sizeof(TUint16));
+			TInt reqLenOffset = UsbZeroCopyIsocChunkHeader::ReqLenOffset(chunkBase, aHandle);
+			TUint16* reqLenPtr = reinterpret_cast<TUint16*>(chunkBase + reqLenOffset + previousPacketCount * sizeof(TUint16));
+
+			aNumPacketsReturned = (aNumPacketsRequested < maxPacketsForReturn) ? aNumPacketsRequested : maxPacketsForReturn;
+
+			TInt distanceToReqPacket = 0;
+			for (TInt i=0; i < intraElementIndex; ++i)
+				{
+				TUint16 reqLen = reqLenPtr[i];
+				__ASSERT_DEBUG(reqLen <= maxPacketSize,
+					UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorReceivedTooLargeAPacket)); // Belt'n'Braces
+				distanceToReqPacket += reqLen;
+				}
+			TInt dataOffset = UsbZeroCopyIsocChunkElement::DataOffset(chunkBase, elementOffset);
+			TUint8* dataPtr = chunkBase + dataOffset + distanceToReqPacket;
+
+			TInt totalLengthPackets = 0;
+			for (TInt i=0; i < aNumPacketsReturned; ++i)
+				{
+				TUint16 len = lengthsPtr[intraElementIndex + i];
+				TUint16 reqLen = reqLenPtr[intraElementIndex + i];
+				__ASSERT_DEBUG(len <= maxPacketSize,
+					UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorReceivedTooLargeAPacket)); // Belt'n'Braces
+
+				totalLengthPackets += len;
+				
+				// Here we handle the potential gaps that may appear in the data stream if a short
+				// packet is received.
+				if (len < reqLen)
+					{
+					// if here then we received a short packet, as such we can only return up to here
+					aNumPacketsReturned = i+1;
+					break;
+					}
+				// Otherwise we expect them to be equal (if we got more than requested then something odd has happened.
+				__ASSERT_DEBUG(len == reqLen, UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorRequestedLengthDiffers)); // Belt 'n' Braces
+				}
+
+			// The USB stack requires isoc transfer to be limited to a page (not allowed to cross the boundary).
+			// Therefore one of our elements must have data only on one page.
+#ifdef _DEBUG
+			TUint32 dataAddr = reinterpret_cast<TUint32>(dataPtr);
+			TBool samePage = (totalLengthPackets == 0) || (pageTableMask & dataAddr) == (pageTableMask & (dataAddr + totalLengthPackets - 1));
+			__ASSERT_DEBUG(samePage, UsbdiUtils::Panic(UsbdiPanics::EIsocTransferResultCrossesPageBoundary)); // Belt'n'Braces
+#endif // _DEBUG
+
+			return TPtrC8(dataPtr, totalLengthPackets);
+			}
+		
+		// No luck so far, move on to try the next element
+		elementOffset = UsbZeroCopyIsocChunkElement::NextElementOffset(chunkBase, elementOffset);
+		}
+
+	// No suitable packet range found.
+	aNumPacketsReturned = 0;
+	return TPtrC8(NULL, 0);
+	}
+
+void RUsbZeroCopyTransferStrategy::ReceivePackets(TInt aHandle, TInt aNumPackets)
+	{
+	__ASSERT_DEBUG(aHandle >= 0, UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorBadHandle));
+	__ASSERT_ALWAYS(aNumPackets > 0, UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorTooFewPacketsRequested));
+
+	TUint8* chunkBase = iChunk.Base() + iBaseOffset;
+	
+	__ASSERT_ALWAYS(aNumPackets <= UsbZeroCopyIsocChunkHeader::MaxNumPackets(chunkBase, aHandle),
+		UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorTooManyPacketsRequested));
+
+	const TUint32 pageAddrBits = iPageSize-1;
+	const TUint32 pageTableMask = ~pageAddrBits;
+	const TInt maxPacketSize = UsbZeroCopyIsocChunkHeader::MaxPacketSize(chunkBase, aHandle);
+
+#ifdef _DEBUG
+	// Here we make the best check we can that the user has set-up the requested lengths they require.
+	// If there is a difference, they have either a corrupted metadata chunk, or they are reusing a 
+	// previous buffer without setting the lengths requested.
+	TInt lengthsOffset = UsbZeroCopyIsocChunkHeader::LengthsOffset(chunkBase, aHandle);
+	TUint16* lengthsPtr = reinterpret_cast<TUint16*>(chunkBase + lengthsOffset);
+	TInt reqLenOffset = UsbZeroCopyIsocChunkHeader::ReqLenOffset(chunkBase, aHandle);
+	TUint16* reqLenPtr = reinterpret_cast<TUint16*>(chunkBase + reqLenOffset);
+	for (TInt i=0; i < aNumPackets; ++i)
+		{
+		__ASSERT_DEBUG(lengthsPtr[i] == reqLenPtr[i],
+			UsbdiUtils::Panic(UsbdiPanics::ETransferDescriptorRequestedLengthDiffers)); // Belt 'n' Braces
+		}
+#endif // _DEBUG
+
+	TInt elementOffset = UsbZeroCopyIsocChunkHeader::FirstElementOffset(chunkBase, aHandle);
+	while (aNumPackets)
+		{
+		__ASSERT_DEBUG(elementOffset != UsbZeroCopyIsocChunkElement::KEndOfList,
+			UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorUnexpectedEndOfIsocList));
+
+		TInt totalMaxSize = aNumPackets * maxPacketSize;
+
+		TInt dataOffset = UsbZeroCopyIsocChunkElement::DataOffset(chunkBase, elementOffset);
+		TUint8* dataPtr = chunkBase + dataOffset;
+		TUint32 dataAddr = reinterpret_cast<TUint32>(dataPtr);
+		TBool samePage = (pageTableMask & dataAddr) == (pageTableMask & (dataAddr + totalMaxSize));
+		TInt allowableSize = samePage ? totalMaxSize : iPageSize - (pageAddrBits & dataAddr);
+		TInt numPackets = allowableSize / maxPacketSize;
+
+		// TODO We could assert here in debug as a double check using UsedPackets()
+
+		__ASSERT_DEBUG(numPackets > 0,
+			UsbdiUtils::Fault(UsbdiFaults::EUsbTransferDescriptorUnfillableElement));
+
+		UsbZeroCopyIsocChunkElement::NumPackets(chunkBase, elementOffset) = numPackets;
+		aNumPackets -= numPackets;
+
+		elementOffset = UsbZeroCopyIsocChunkElement::NextElementOffset(chunkBase, elementOffset);
+		}
+
+	if (elementOffset != UsbZeroCopyIsocChunkElement::KEndOfList)
+		{
+		UsbZeroCopyIsocChunkElement::NumPackets(chunkBase, elementOffset) = UsbZeroCopyIsocChunkElement::KInvalidElement; // Mark as invalid.
+		}
+	}
+	
+	
+
+
+
+TPtr8 RUsbZeroCopyTransferStrategy::IntrWritableBuffer(TInt aHandle)
+	{
+	return WritableBuffer(aHandle);
+	}
+
+void RUsbZeroCopyTransferStrategy::IntrSaveData(TInt aHandle, TInt aLength)
+	{
+	SaveData(aHandle, aLength);
+	}
+
+void RUsbZeroCopyTransferStrategy::IntrSetZlpStatus(TInt aHandle, RUsbTransferDescriptor::TZlpStatus aZlpStatus)
+	{
+	SetZlpStatus(aHandle, aZlpStatus);
+	}
+
+TPtrC8 RUsbZeroCopyTransferStrategy::IntrBuffer(TInt aHandle) const
+	{
+	return Buffer(aHandle);
+	}
+
+TPtr8 RUsbZeroCopyTransferStrategy::BulkWritableBuffer(TInt aHandle)
+	{
+	return WritableBuffer(aHandle);
+	}
+
+void RUsbZeroCopyTransferStrategy::BulkSaveData(TInt aHandle, TInt aLength)
+	{
+	SaveData(aHandle, aLength);
+	}
+
+void RUsbZeroCopyTransferStrategy::BulkSetZlpStatus(TInt aHandle, RUsbTransferDescriptor::TZlpStatus aZlpStatus)
+	{
+	SetZlpStatus(aHandle, aZlpStatus);
+	}
+
+TPtrC8 RUsbZeroCopyTransferStrategy::BulkBuffer(TInt aHandle) const
+	{
+	return Buffer(aHandle);
+	}
+
+void RUsbZeroCopyTransferStrategy::IsocReset(TInt aHandle)
+	{
+	Reset(aHandle);
+	}
+
+TPacketLengths RUsbZeroCopyTransferStrategy::IsocLengths(TInt aHandle)
+	{
+	return Lengths(aHandle);
+	}
+	
+TPacketResults RUsbZeroCopyTransferStrategy::IsocResults(TInt aHandle)
+	{
+	return Results(aHandle);
+	}
+
+TInt RUsbZeroCopyTransferStrategy::IsocMaxPacketSize(TInt aHandle)
+	{
+	return MaxPacketSize(aHandle);
+	}
+
+TPtr8 RUsbZeroCopyTransferStrategy::IsocWritablePackets(TInt aHandle, TInt aWriteHandle, TInt aNumPacketsRequested, TInt& aMaxNumPacketsAbleToWrite)
+	{
+	return WritablePackets(aHandle, aWriteHandle, aNumPacketsRequested, aMaxNumPacketsAbleToWrite);
+	}
+
+TInt RUsbZeroCopyTransferStrategy::IsocSaveMultiple(TInt aHandle, TInt aWriteHandle, TInt aNumOfPackets)
+	{
+	return SaveMultiple(aHandle, aWriteHandle, aNumOfPackets);
+	}
+
+TPtrC8 RUsbZeroCopyTransferStrategy::IsocPackets(TInt aHandle, TInt aFirstPacketIndex, TInt aNumPacketsRequested, TInt& aNumPacketsReturned) const
+	{
+	return Packets(aHandle, aFirstPacketIndex, aNumPacketsRequested, aNumPacketsReturned);
+	}
+
+void RUsbZeroCopyTransferStrategy::IsocReceivePackets(TInt aHandle, TInt aNumOfPackets)
+	{
+	ReceivePackets(aHandle, aNumOfPackets);
+	}
+
+
+//Calculate-alignment related methods
+
+/**
+ Scan through all the bulk/interrupt endpoints associated with the particular interface
+ (and all its alternate settings) to find the maximum bMaxPacketSize across all of these.
+ For Interrupt, if there is EP of which the maxPacketSize is not power of 2,
+ the maxmaxpaceketsize will be assigned the first maxPacketSize which is not power of 2.  
+*/
+TInt RUsbZeroCopyTransferStrategy::GetMaximumMaxPacketSize(TInt& aMaxMaxBulk, TInt& aMaxMaxInterrupt)
+	{
+	TUsbInterfaceDescriptor interfaceDesc;
+	TInt err = iInterfaceHandle->GetInterfaceDescriptor(interfaceDesc);
+	if (KErrNone != err)
+		{
+		return err;
+		}
+
+	const TUint8 KEPTransferTypeBulk = 0x02;
+	const TUint8 KEPTransferTypeInterrupt = 0x03;
+	const TUint8 KEPTransferTypeMask = 0x03;
+	
+	TBool ignoreInterruptEP = EFalse;
+	//Traverse all related interface alternate settings
+	TUsbGenericDescriptor* descriptor = &interfaceDesc;
+	while (descriptor)
+		{
+		TUsbInterfaceDescriptor* interface = TUsbInterfaceDescriptor::Cast(descriptor);
+		
+		if (interface)
+			{
+			//Traverse all endpoint descriptor in the interface
+			TUsbGenericDescriptor* subDescriptor = interface->iFirstChild;
+			
+			while (subDescriptor)
+				{
+				TUsbEndpointDescriptor* endpoint = TUsbEndpointDescriptor::Cast(subDescriptor);
+				
+				if (endpoint)
+					{
+					TBool isBulkEP = ((endpoint->Attributes() & KEPTransferTypeMask) == KEPTransferTypeBulk);
+					TBool isInterruptEP = ((endpoint->Attributes() & KEPTransferTypeMask) == KEPTransferTypeInterrupt);
+					TUint maxPacketSize = endpoint->MaxPacketSize();
+
+					//Caculate the maximum maxPacketSize
+					if (isBulkEP)
+						{
+						if (maxPacketSize > aMaxMaxBulk)
+							{
+							aMaxMaxBulk = maxPacketSize;
+							}
+						}
+					else if(isInterruptEP && !ignoreInterruptEP)
+						{
+						if (!IsPowerOfTwo(maxPacketSize))
+							{
+							aMaxMaxInterrupt = maxPacketSize;
+							ignoreInterruptEP = ETrue;
+							}
+						
+						if (maxPacketSize > aMaxMaxInterrupt)
+							{
+							aMaxMaxInterrupt = maxPacketSize;
+							}
+						}
+					}
+
+				subDescriptor = subDescriptor->iNextPeer;
+				}				
+			}
+		
+		descriptor = descriptor->iNextPeer;
+		}
+	
+	return KErrNone;	
+	}
+
+/**
+Calculate the additional alignment requirement on bulk and interrupt transfer.
+For Bulk transfer,
+	Scan through all the bulk/interrupt endpoints associated with the particular interface
+	to find the maximum wMaxPacketSize across all of these. The new alignment for the transfer
+	is the maximum between the maximum bMaxPacketSize and the original alignment
+For Interrupt transfer,
+	Check if there is endpoints of which the wMaxPacketSize is not power of 2,
+	if no, do the same as bulk;
+	if yes, the size of transfer data is limited to one page size, and the additional alignment 
+            calcualted to make the transfer data not to span page boundary
+
+*/
+TInt RUsbZeroCopyTransferStrategy::CaculateAdditionalAlignment(TInt aCurrentOffset, TInt aMaxMaxBulk, TInt aMaxMaxInterrupt, TUsbTransferDescriptorDetails& aTransferDetails)
+	{
+	RUsbTransferDescriptor::TTransferType transferType = aTransferDetails.iTransferDesc.iType;
+	TBool isBulkTransfer = (transferType == RUsbTransferDescriptor::EBulk);
+	TBool isInterruptTransfer = (transferType == RUsbTransferDescriptor::EInterrupt);
+
+	if (isBulkTransfer)
+		{
+		if (aMaxMaxBulk > aTransferDetails.iRequiredAlignment)
+			{
+			aTransferDetails.iRequiredAlignment = aMaxMaxBulk;
+			}
+		}
+	else if (isInterruptTransfer)
+		{
+		if (IsPowerOfTwo(aMaxMaxInterrupt))
+			{
+			if (aMaxMaxInterrupt > aTransferDetails.iRequiredAlignment)
+				{
+				aTransferDetails.iRequiredAlignment = aMaxMaxInterrupt;
+				}
+			}
+		else
+			{
+			if (aTransferDetails.iRequiredSize > iPageSize)
+				{
+				//The transfer data can not span the page boundary
+				//if there is EP of which wMaxPacketSize is not power-of-2,
+				return KErrNotSupported;
+				}
+			else
+				{
+				TInt sizeLeftOfCurrentPage = IncNeededToAlign(aCurrentOffset,iPageSize);
+				TInt alignPad = IncNeededToAlign(aCurrentOffset, aTransferDetails.iRequiredAlignment);
+				
+				//The transfer data can't fit into the current page
+				//Align the trasfer data to the next page
+				if ( sizeLeftOfCurrentPage < (alignPad + aTransferDetails.iRequiredSize) )
+					{
+					aTransferDetails.iRequiredAlignment = iPageSize;
+					}
+				}
+			}
+		}
+	return KErrNone;
+	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/drivers/usbho/usbdi_utils/zerocopytransferstrategy.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/drivers/usbho/usbdi_utils/zerocopytransferstrategy.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,112 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+//
+
+/**
+ @file
+ @internalComponent
+*/
+
+#ifndef ZEROCOPYTRANSFERSTRATEGY_H
+#define ZEROCOPYTRANSFERSTRATEGY_H
+
+#include "usbtransferstrategy.h"
+
+
+NONSHARABLE_CLASS(RUsbZeroCopyTransferStrategy) : public RUsbTransferStrategy
+	{
+public:
+	RUsbZeroCopyTransferStrategy();
+	virtual TInt RegisterTransferDescriptor(RUsbTransferDescriptor& aTransferDesc, TInt aRequiredSize, TUint aStartAlignment, TInt aRequiredMaxPackets);
+	virtual void ResetTransferDescriptors();
+	virtual TInt InitialiseTransferDescriptors(RUsbInterface& aInterface);
+
+	virtual void Close();
+
+public: // Interrupt transfer descriptor methods
+	virtual TPtr8	IntrWritableBuffer(TInt aHandle);
+	virtual void	IntrSaveData(TInt aHandle, TInt aLength);
+	virtual void	IntrSetZlpStatus(TInt aHandle, RUsbTransferDescriptor::TZlpStatus aZlpStatus);
+	virtual TPtrC8	IntrBuffer(TInt aHandle) const;
+public: // Bulk transfer descriptor methods
+	virtual TPtr8	BulkWritableBuffer(TInt aHandle);
+	virtual void	BulkSaveData(TInt aHandle, TInt aLength);
+	virtual void	BulkSetZlpStatus(TInt aHandle, RUsbTransferDescriptor::TZlpStatus aZlpStatus);
+	virtual TPtrC8	BulkBuffer(TInt aHandle) const;
+public: // Isochronous transfer descriptor methods
+	virtual void	IsocReset(TInt aHandle);
+	virtual TPacketLengths IsocLengths(TInt aHandle);
+	virtual TPacketResults IsocResults(TInt aHandle);
+	virtual TInt	IsocMaxPacketSize(TInt aHandle);
+	virtual TPtr8	IsocWritablePackets(TInt aHandle, TInt aWriteHandle, TInt aNumPacketsRequested, TInt& aMaxNumPacketsAbleToWrite);
+	virtual TInt	IsocSaveMultiple(TInt aHandle, TInt aWriteHandle, TInt aNumOfPackets);
+	virtual TPtrC8	IsocPackets(TInt aHandle, TInt aFirstPacketIndex, TInt aNumPacketsRequested, TInt& aNumPacketsReturned) const;
+	virtual void	IsocReceivePackets(TInt aHandle, TInt aNumOfPackets);
+
+
+private: // Standard (Bulk, Ctrl and Intr) Buffer methods
+	TPtr8	WritableBuffer(TInt aHandle);
+	void	SaveData(TInt aHandle, TInt aLength);
+	void	SetZlpStatus(TInt aHandle, RUsbTransferDescriptor::TZlpStatus aZlpStatus);
+	TPtrC8	Buffer(TInt aHandle) const;
+
+private: // Isoc Buffer methods
+	void	Reset(TInt aHandle);
+	TPacketLengths Lengths(TInt aHandle);
+	TPacketResults Results(TInt aHandle);
+	TInt	MaxPacketSize(TInt aHandle);
+	TPtr8	WritablePackets(TInt aHandle, TInt aWriteHandle, TInt aNumPacketsRequested, TInt& aMaxNumPacketsAbleToWrite);
+	TInt	SaveMultiple(TInt aHandle, TInt aWriteHandle, TInt aNumOfPackets);
+	TPtrC8	Packets(TInt aHandle, TInt aFirstPacketIndex, TInt aNumPacketsRequested, TInt& aNumPacketsReturned) const;
+	void	ReceivePackets(TInt aHandle, TInt aNumOfPackets);
+	
+private:
+	NONSHARABLE_STRUCT(TUsbTransferDescriptorDetails)
+		{
+        TUsbTransferDescriptorDetails(RUsbTransferDescriptor&, TInt, TUint, TInt);
+		RUsbTransferDescriptor& iTransferDesc;
+		const TInt iRequiredSize;
+		TUint iRequiredAlignment;
+		const TInt iRequiredMaxPackets;
+		// Members to aid internal logic
+		TInt iAssignedOffset;
+		TInt iLengthsOffset; // Only applicable to isoc
+		TInt iReqLenOffset; // Only applicable to isoc
+		TInt iResultsOffset; // Only applicable to isoc
+		TInt iNumElements; // Only applicable to isoc
+		};
+
+private:
+	TInt CalculateDataLayout(TInt& aCurrentOffset, TInt& aNumStandardTransfers, TInt& aNumIsocTransfers, TInt& aNumIsocElements);
+	void CalculateMetaDataLayout(TInt& aCurrentOffset, TInt& aMetaDataStart, TInt aNumStandardTransfers, TInt aNumIsocTransfers, TInt aNumIsocElements);
+	void InitialiseMetaData(TInt aMetaDataOffset, TInt aNumStandardTransfers, TInt aNumIsocTransfers, TInt aNumIsocElements);
+	TInt UsedPackets(TInt aHeaderOffset);
+	TBool IsPowerOfTwo(TUint aNumber);
+	TInt IncNeededToAlign(TInt aOffset, TUint aAlignment);
+	static TBool CompareTransferDescriptor(const RUsbTransferDescriptor* aTransferDesc, const TUsbTransferDescriptorDetails& aDetails);
+
+private: //Calculate additional alignment related methods
+	TInt GetMaximumMaxPacketSize(TInt& aMaxMaxBulk, TInt& aMaxMaxInterrupt);
+	TInt CaculateAdditionalAlignment(TInt aCurrentOffset, TInt aMaxMaxBulk, TInt aMaxMaxInterrupt, TUsbTransferDescriptorDetails& aTransferDetails);
+private:
+	RArray<TUsbTransferDescriptorDetails> iRegisteredTransfers;
+
+private:
+	RUsbInterface* iInterfaceHandle;
+	RChunk iChunk;
+	TInt iBaseOffset;
+	TInt iPageSize;
+	};
+
+#endif // ZEROCOPYTRANSFERSTRATEGY_H
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/eabi/ekernsmp.def
--- a/kernel/eka/eabi/ekernsmp.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/eabi/ekernsmp.def	Thu Jun 10 11:48:01 2010 +0100
@@ -1189,4 +1189,7 @@
 	_ZN3Arm14SetIdleHandlerEPFvPvmPVvES0_ @ 1188 NONAME
 	_ZN4Epoc11FreeRamZoneEj @ 1189 NONAME
 	_ZN16TBitMapAllocator14SelectiveAllocEii @ 1190 NONAME
+	_ZN10RArrayBase12SetKeyOffsetEi @ 1191 NONAME
+	_ZN5Cache10CpuRetiresEv @ 1192 NONAME
+	_ZN5Cache13KernelRetiresEv @ 1193 NONAME
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/eabi/ekernu.def
--- a/kernel/eka/eabi/ekernu.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/eabi/ekernu.def	Thu Jun 10 11:48:01 2010 +0100
@@ -1181,4 +1181,7 @@
 	_ZN3Arm14SetIdleHandlerEPFvPvmES0_ @ 1180 NONAME
 	_ZN4Epoc11FreeRamZoneEj @ 1181 NONAME
 	_ZN16TBitMapAllocator14SelectiveAllocEii @ 1182 NONAME
+	_ZN10RArrayBase12SetKeyOffsetEi @ 1183 NONAME
+	_ZN5Cache10CpuRetiresEv @ 1184 NONAME
+	_ZN5Cache13KernelRetiresEv @ 1185 NONAME
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/eabi/euseru.def
--- a/kernel/eka/eabi/euseru.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/eabi/euseru.def	Thu Jun 10 11:48:01 2010 +0100
@@ -697,11 +697,11 @@
 	_ZN5RHeap5ResetEv @ 696 NONAME ; RHeap::Reset()
 	_ZN5RHeap7ReAllocEPvii @ 697 NONAME ; RHeap::ReAlloc(void*, int, int)
 	_ZN5RHeap8CompressEv @ 698 NONAME ; RHeap::Compress()
-	_ZN5RHeapC1Eiii @ 699 NONAME ; RHeap::RHeap(int, int, int)
-	_ZN5RHeapC1Eiiiiiii @ 700 NONAME ; RHeap::RHeap(int, int, int, int, int, int, int)
-	_ZN5RHeapC2Eiii @ 701 NONAME ; RHeap::RHeap(int, int, int)
-	_ZN5RHeapC2Eiiiiiii @ 702 NONAME ; RHeap::RHeap(int, int, int, int, int, int, int)
-	_ZN5RHeapnwEjPv @ 703 NONAME ; RHeap::operator new(unsigned int, void*)
+	_ZN5RHeapC1Eiii @ 699 NONAME ABSENT ; RHeap::RHeap(int, int, int)
+	_ZN5RHeapC1Eiiiiiii @ 700 NONAME ABSENT ; RHeap::RHeap(int, int, int, int, int, int, int)
+	_ZN5RHeapC2Eiii @ 701 NONAME ABSENT ; RHeap::RHeap(int, int, int)
+	_ZN5RHeapC2Eiiiiiii @ 702 NONAME ABSENT ; RHeap::RHeap(int, int, int, int, int, int, int)
+	_ZN5RHeapnwEjPv @ 703 NONAME ABSENT ; RHeap::operator new(unsigned int, void*)
 	_ZN5RTest3EndEv @ 704 NONAME ; RTest::End()
 	_ZN5RTest4NextERK7TDesC16 @ 705 NONAME ; RTest::Next(TDesC16 const&)
 	_ZN5RTest5CloseEv @ 706 NONAME ; RTest::Close()
@@ -1601,7 +1601,7 @@
 	_ZNK4TUid4NameEv @ 1600 NONAME ; TUid::Name() const
 	_ZNK4TUideqERKS_ @ 1601 NONAME ; TUid::operator==(TUid const&) const
 	_ZNK4TUidneERKS_ @ 1602 NONAME ; TUid::operator!=(TUid const&) const
-	_ZNK5RHeap10GetAddressEPKv @ 1603 NONAME ; RHeap::GetAddress(void const*) const
+	_ZNK5RHeap10GetAddressEPKv @ 1603 NONAME ABSENT ; RHeap::GetAddress(void const*) const
 	_ZNK5RHeap8AllocLenEPKv @ 1604 NONAME ; RHeap::AllocLen(void const*) const
 	_ZNK5RHeap9AllocSizeERi @ 1605 NONAME ; RHeap::AllocSize(int&) const
 	_ZNK5RHeap9AvailableERi @ 1606 NONAME ; RHeap::Available(int&) const
@@ -2530,4 +2530,12 @@
 	_ZNK7TDesC167Locate2E5TChar @ 2529 NONAME
 	_ZNK7TDesC168LocateF2E5TChar @ 2530 NONAME
 	_ZN6RTimer12AgainHighResER14TRequestStatus27TTimeIntervalMicroSeconds32 @ 2531 NONAME ; RTimer::AgainHighRes(TRequestStatus&, TTimeIntervalMicroSeconds32)
+	_ZNK10RAllocator4BaseEv @ 2532 NONAME
+	_ZNK10RAllocator4SizeEv @ 2533 NONAME
+	_ZNK10RAllocator5AlignEPv @ 2534 NONAME
+	_ZNK10RAllocator5AlignEi @ 2535 NONAME
+	_ZNK10RAllocator9MaxLengthEv @ 2536 NONAME
+	_ZN10RAllocator17__DbgGetAllocFailEv @ 2537 NONAME
+	_ZN4User17__DbgGetAllocFailEi @ 2538 NONAME
+	_ZN10RArrayBase12SetKeyOffsetEi @ 2539 NONAME
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/eabi/usbdi_utilsu.def
--- a/kernel/eka/eabi/usbdi_utilsu.def	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/eabi/usbdi_utilsu.def	Thu Jun 10 11:48:01 2010 +0100
@@ -37,4 +37,5 @@
 	_ZN26RUsbIsocTransferDescriptor7ResultsEv @ 36 NONAME
 	_ZNK14TPacketResults2AtEi @ 37 NONAME
 	_ZNK14TPacketResultsixEi @ 38 NONAME
+	_ZN22RUsbTransferDescriptor5CloseEv @ 39 NONAME
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/euser/base_e32_euser.mrp
--- a/kernel/eka/euser/base_e32_euser.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/euser/base_e32_euser.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "User Library"
 
 component	base_e32_euser
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/euser/euser.mmh
--- a/kernel/eka/euser/euser.mmh	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/euser/euser.mmh	Thu Jun 10 11:48:01 2010 +0100
@@ -47,7 +47,8 @@
 #endif
 
 sourcepath		../common
-source			array.cpp des8.cpp des16.cpp alloc.cpp heap.cpp
+source			array.cpp des8.cpp des16.cpp alloc.cpp 
+source			heap_hybrid.cpp debugfunction.cpp
 source			mem.cpp secure.cpp
 macro			__EXPORT_MEMCPY__
 #ifdef GCC32
@@ -81,7 +82,7 @@
 source			 uc_i64.cia uc_realx.cpp uc_realx.cia uc_huffman.cia
 source			 uc_trp.cpp uc_trp.cia uc_utl.cia uc_exec.cia uc_data.cpp
 sourcepath		../common/arm
-source			carray.cia cdes8.cia cdes16.cia cheap.cia cmem.cia atomics.cia
+source			carray.cia cdes8.cia cdes16.cia cmem.cia atomics.cia
 #if defined(GCC32)
 source			cgcchelp.cpp cgcchelp.cia
 #endif
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/euser/unicode/perl/Unicode, Inc License Agreement - Data Files and Software.txt
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/euser/unicode/perl/Unicode, Inc License Agreement - Data Files and Software.txt	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,21 @@
+                          EXHIBIT 1
+UNICODE, INC. LICENSE AGREEMENT - DATA FILES AND SOFTWARE
+
+Unicode Data Files include all data files under the directories http://www.unicode.org/Public/, http://www.unicode.org/reports/, and http://www.unicode.org/cldr/data/ . Unicode Software includes any source code published in the Unicode Standard or under the directories http://www.unicode.org/Public/, http://www.unicode.org/reports/, and http://www.unicode.org/cldr/data/.
+
+NOTICE TO USER: Carefully read the following legal agreement. BY DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING UNICODE INC.'S DATA FILES ("DATA FILES"), AND/OR SOFTWARE ("SOFTWARE"), YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE TERMS AND CONDITIONS OF THIS AGREEMENT. IF YOU DO NOT AGREE, DO NOT DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE THE DATA FILES OR SOFTWARE.
+
+COPYRIGHT AND PERMISSION NOTICE
+
+Copyright © 1991-2009 Unicode, Inc. All rights reserved. Distributed under the Terms of Use in http://www.unicode.org/copyright.html.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of the Unicode data files and any associated documentation (the "Data Files") or Unicode software and any associated documentation (the "Software") to deal in the Data Files or Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, and/or sell copies of the Data Files or Software, and to permit persons to whom the Data Files or Software are furnished to do so, provided that (a) the above copyright notice(s) and this permission notice appear with all copies of the Data Files or Software, (b) both the above copyright notice(s) and this permission notice appear in associated documentation, and (c) there is clear notice in each modified Data File or in the Software as well as in the documentation associated with the Data File(s) or Software that the data or software has been modified.
+
+THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA FILES OR SOFTWARE.
+
+Except as contained in this notice, the name of a copyright holder shall not be used in advertising or otherwise to promote the sale, use or other dealings in these Data Files or Software without prior written authorization of the copyright holder.
+
+
+--------------------------------------------------------------------------------
+
+Unicode and the Unicode logo are trademarks of Unicode, Inc., and may be registered in some jurisdictions. All other trademarks and registered trademarks mentioned herein are the property of their respective owners.
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/euser/us_ksvr.cpp
--- a/kernel/eka/euser/us_ksvr.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/euser/us_ksvr.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -505,10 +505,10 @@
 */
 void TChunkCreateInfo::SetThreadHeap(TInt aInitialSize, TInt aMaxSize, const TDesC& aName)
 	{
-	iType = TChunkCreate::ENormal | TChunkCreate::EData;
+    iType = TChunkCreate::ENormal | TChunkCreate::EData;
+   	iMaxSize = aMaxSize;
 	iInitialBottom = 0;
 	iInitialTop = aInitialSize;
-	iMaxSize = aMaxSize;
 	iAttributes |= TChunkCreate::ELocalNamed;
 	iName = &aName;
 	iOwnerType = EOwnerThread;
@@ -3469,16 +3469,17 @@
 be invoked on this TThreadCreateInfo to set the type of the thread to be created
 before being passed as a paramter to RThread::Create().
 
-@param aName        The name to be assigned to the thread.
+@param aName		The name to be assigned to the thread.
 					KNullDesC, to create an anonymous thread.
-@param aFunction    A pointer to a function. Control passes to this function
-                    when the thread is first resumed, i.e. when the thread
-                    is initially scheduled to run.
-@param aStackSize   The size of the new thread's stack.
-@param aPtr         A pointer to data to be passed as a parameter to
-                    the thread function when the thread is initially scheduled
-                    to run. If the thread function does not need any data then
-                    this pointer can be NULL.
+@param aFunction	A pointer to a function. Control passes to this function
+					when the thread is first resumed, i.e. when the thread
+					is initially scheduled to run.
+@param aStackSize	The size of the new thread's stack.  This must be at least
+					512 bytes, otherwise RThread::Create() will fail with KErrArgument.
+@param aPtr			A pointer to data to be passed as a parameter to
+					the thread function when the thread is initially scheduled
+					to run. If the thread function does not need any data then
+					this pointer can be NULL.
 */
 EXPORT_C TThreadCreateInfo::TThreadCreateInfo(const TDesC &aName, TThreadFunction aFunction, 
 											TInt aStackSize, TAny* aPtr) :
@@ -3604,25 +3605,27 @@
 If KNullDesC is specified for the name, then an anonymous thread will be created.
 Anonymous threads are not global, and cannot be opened by other processes.
 
-@param aName        The name to be assigned to this thread.
+@param aName		The name to be assigned to this thread.
 					KNullDesC, to create an anonymous thread.
-@param aFunction    A pointer to a function.. Control passes to this function
-                    when the thread is first resumed, i.e. when the thread
-                    is initially scheduled to run.
-@param aStackSize   The size of the new thread's stack.
+@param aFunction	A pointer to a function.. Control passes to this function
+					when the thread is first resumed, i.e. when the thread
+					is initially scheduled to run.
+@param aStackSize	The size of the new thread's stack.  This must be at least
+					512 bytes, otherwise this method will fail with KErrArgument.
 @param aHeapMinSize The minimum size for the new thread's heap.
 @param aHeapMaxSize The maximum size for the new thread's heap.
-@param aPtr         A pointer to data to be passed as a parameter to
-                    the thread function when the thread is initially scheduled
-                    to run. If the thread function does not need any data then
-                    this pointer can be NULL. It must be ensured that the memory 
-                    pointed to by this pointer is still valid when accessed by 
-                    the new thread, e.g. if aPtr points to data on the stack.
-@param aType        An enumeration whose enumerators define the ownership of
-                    this thread handle. If not explicitly specified,
-                    EOwnerProcess is taken as default.
+@param aPtr			A pointer to data to be passed as a parameter to
+					the thread function when the thread is initially scheduled
+					to run. If the thread function does not need any data then
+					this pointer can be NULL. It must be ensured that the memory 
+					pointed to by this pointer is still valid when accessed by 
+					the new thread, e.g. if aPtr points to data on the stack.
+@param aType		An enumeration whose enumerators define the ownership of
+					this thread handle. If not explicitly specified,
+					EOwnerProcess is taken as default.
 
 @return KErrNone if successful, otherwise one of the other system-wide error codes.
+		KErrArgument if aStackSize is less than 512 bytes.
         KErrAlreadyExists will be returned if there is another thread in this process with the
         specified name.
 
@@ -3630,7 +3633,10 @@
 @panic USER 110 if aHeapMinSize is less than KMinHeapSize.
 @panic USER 111 if aHeapMaxSize is less than aHeapMinSize.
 */
-	{
+	{// This must be true otherwise the comment on aStackSize will be incorrect and BC 
+	// break will occur.  See ExecHandler::ThreadCreate() for details.
+	__ASSERT_COMPILE(KMaxThreadCreateInfo == 256);
+
 	TThreadCreateInfo createInfo(aName, aFunction, aStackSize, aPtr);
 	createInfo.SetOwner(aType);
 	createInfo.SetCreateHeap(aHeapMinSize, aHeapMaxSize);
@@ -3655,25 +3661,27 @@
 If KNullDesC is specified for the name, then an anonymous thread will be created.
 Anonymous threads are not global, and cannot be opened by other processes.
 
-@param aName      The name to be assigned to this thread.
-				  KNullDesC, to create an anonymous thread.
-@param aFunction  A pointer to a function. Control passes to this function when 
-	              the thread is first resumed, i.e. when the thread is
-	              initially scheduled to run.
-@param aStackSize The size of the new thread's stack.
-@param aAllocator A pointer to the handle of the heap belonging to another thread 
-                  which this thread is to use.
-@param aPtr       A pointer to data to be passed as a parameter to the thread
-                  function when the thread is initially scheduled to run.
-                  If the thread function does not need any data,
-                  then this pointer can be NULL. It must be ensured that the 
-                  memory pointed to by this pointer is still valid when accessed 
-                  by the new thread, e.g. if aPtr points to data on the stack.
-@param aType      An enumeration whose enumerators define the ownership of this 
-                  thread handle. If not explicitly specified, EOwnerProcess is
-                  taken as default.
+@param aName		The name to be assigned to this thread.
+					KNullDesC, to create an anonymous thread.
+@param aFunction	A pointer to a function. Control passes to this function when 
+					the thread is first resumed, i.e. when the thread is
+					initially scheduled to run.
+@param aStackSize	The size of the new thread's stack.  This must be at least
+					512 bytes, otherwise this method will fail with KErrArgument.
+@param aAllocator	A pointer to the handle of the heap belonging to another thread 
+					which this thread is to use.
+@param aPtr			A pointer to data to be passed as a parameter to the thread
+					function when the thread is initially scheduled to run.
+					If the thread function does not need any data,
+					then this pointer can be NULL. It must be ensured that the 
+					memory pointed to by this pointer is still valid when accessed 
+					by the new thread, e.g. if aPtr points to data on the stack.
+@param aType		An enumeration whose enumerators define the ownership of this 
+					thread handle. If not explicitly specified, EOwnerProcess is
+					taken as default.
 
 @return KErrNone if successful otherwise one of the other system-wide error codes.
+		KErrArgument if aStackSize is less than 512 bytes.
         KErrAlreadyExists will be returned if there is another thread in this process with the
         specified name.
 
@@ -4764,6 +4772,33 @@
 		GetHeap()->__DbgSetAllocFail(aType,aRate);
 	}
 
+UEXPORT_C RAllocator::TAllocFail User::__DbgGetAllocFail(TBool aKernel)
+//
+// Obtains the current heap failure simulation type.
+//
+/**
+After calling __DbgSetAllocFail(), this function may be called to retrieve the
+value set.  This is useful primarily for test code that doesn't know if a heap
+has been set to fail and needs to check.
+
+@param aKernel   ETrue, if checking is being done for the kernel heap;
+                 EFalse, if checking is being done for the current thread's
+                 default heap.
+
+@return RAllocator::ENone if heap is not in failure simulation mode;
+		Otherwise one of the other RAllocator::TAllocFail enumerations
+*/
+	{
+	if (aKernel)
+		{
+		RAllocator::TAllocFail allocFail;
+		Exec::KernelHeapDebug(EDbgGetAllocFail, 0, &allocFail);
+		return(allocFail);
+		}
+	else
+		return(GetHeap()->__DbgGetAllocFail());
+	}
+
 /**
 Simulates a heap allocation failure for the current thread's default heap,
 or the kernel heap.
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/euser/v7_0/euser-7_0.cia
--- a/kernel/eka/euser/v7_0/euser-7_0.cia	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/euser/v7_0/euser-7_0.cia	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,18 @@
-//
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32/euser/v7_0/euser-7_0.cia
+// 
 // EUSER-7_0.CIA - generated by GENSHIMSRC.BAT
 //
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/ewsrv/base_e32_ewsrv.mrp
--- a/kernel/eka/ewsrv/base_e32_ewsrv.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/ewsrv/base_e32_ewsrv.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Text Window Server"
 
 component	base_e32_ewsrv
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/DLA.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/include/DLA.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,946 @@
+// Copyright (c) 1994-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// kernel\eka\include\dla.h
+// 
+// Uses malloc (aka dlmalloc) written by Doug Lea version 2.8.4
+//
+
+#ifndef __DLA__
+#define __DLA__
+
+#define DEFAULT_TRIM_THRESHOLD ((size_t)4U * (size_t)1024U)
+
+#define MSPACES 0
+#define HAVE_MORECORE 1
+#define	MORECORE_CONTIGUOUS 1
+#define	HAVE_MMAP 0
+#define HAVE_MREMAP 0
+#define DEFAULT_GRANULARITY (4096U)
+#define FOOTERS 0
+#define USE_LOCKS 0
+#define INSECURE 1
+#define NO_MALLINFO 0
+
+#define LACKS_SYS_TYPES_H
+#ifndef LACKS_SYS_TYPES_H
+#include <sys/types.h>  /* For size_t */
+#else
+#ifndef _SIZE_T_DECLARED
+typedef unsigned int size_t;
+#define	_SIZE_T_DECLARED
+#endif
+#endif  /* LACKS_SYS_TYPES_H */
+
+/* The maximum possible size_t value has all bits set */
+#define MAX_SIZE_T           (~(size_t)0)
+
+#ifndef ONLY_MSPACES
+	#define ONLY_MSPACES 0
+#endif  /* ONLY_MSPACES */
+
+#ifndef MSPACES
+	#if ONLY_MSPACES
+		#define MSPACES 1
+	#else   /* ONLY_MSPACES */
+		#define MSPACES 0
+	#endif  /* ONLY_MSPACES */
+#endif  /* MSPACES */
+
+//#ifndef MALLOC_ALIGNMENT
+//	#define MALLOC_ALIGNMENT ((size_t)8U)
+//#endif  /* MALLOC_ALIGNMENT */
+
+#ifndef FOOTERS
+	#define FOOTERS 0
+#endif  /* FOOTERS */
+
+#ifndef ABORT
+//	#define ABORT  abort()
+//	#define ABORT  User::Invariant()// redefined so euser isn't dependant on oe
+  	#define ABORT  HEAP_PANIC(ETHeapBadCellAddress)
+#endif  /* ABORT */
+
+#ifndef PROCEED_ON_ERROR
+	#define PROCEED_ON_ERROR 0
+#endif  /* PROCEED_ON_ERROR */
+
+#ifndef USE_LOCKS
+	#define USE_LOCKS 0
+#endif  /* USE_LOCKS */
+
+#ifndef INSECURE
+	#define INSECURE 0
+#endif  /* INSECURE */
+
+#ifndef HAVE_MMAP
+	#define HAVE_MMAP 1
+#endif  /* HAVE_MMAP */
+
+#ifndef MMAP_CLEARS
+	#define MMAP_CLEARS 1
+#endif  /* MMAP_CLEARS */
+
+#ifndef HAVE_MREMAP
+	#ifdef linux
+		#define HAVE_MREMAP 1
+	#else   /* linux */
+		#define HAVE_MREMAP 0
+	#endif  /* linux */
+#endif  /* HAVE_MREMAP */
+
+#ifndef MALLOC_FAILURE_ACTION
+	//#define MALLOC_FAILURE_ACTION  errno = ENOMEM;
+	#define MALLOC_FAILURE_ACTION ;
+#endif  /* MALLOC_FAILURE_ACTION */
+
+#ifndef HAVE_MORECORE
+	#if ONLY_MSPACES
+		#define HAVE_MORECORE 1 /*AMOD: has changed */
+	#else   /* ONLY_MSPACES */
+		#define HAVE_MORECORE 1
+	#endif  /* ONLY_MSPACES */
+#endif  /* HAVE_MORECORE */
+
+#if !HAVE_MORECORE
+	#define MORECORE_CONTIGUOUS 0
+#else   /* !HAVE_MORECORE */
+	#ifndef MORECORE
+		#define MORECORE DLAdjust
+	#endif  /* MORECORE */
+	#ifndef MORECORE_CONTIGUOUS
+		#define MORECORE_CONTIGUOUS 0
+	#endif  /* MORECORE_CONTIGUOUS */
+#endif  /* !HAVE_MORECORE */
+
+#ifndef DEFAULT_GRANULARITY
+	#if MORECORE_CONTIGUOUS
+		#define DEFAULT_GRANULARITY 4096  /* 0 means to compute in init_mparams */
+	#else   /* MORECORE_CONTIGUOUS */
+		#define DEFAULT_GRANULARITY ((size_t)64U * (size_t)1024U)
+	#endif  /* MORECORE_CONTIGUOUS */
+#endif  /* DEFAULT_GRANULARITY */
+
+#ifndef DEFAULT_TRIM_THRESHOLD
+	#ifndef MORECORE_CANNOT_TRIM
+		#define DEFAULT_TRIM_THRESHOLD ((size_t)2U * (size_t)1024U * (size_t)1024U)
+	#else   /* MORECORE_CANNOT_TRIM */
+		#define DEFAULT_TRIM_THRESHOLD MAX_SIZE_T
+	#endif  /* MORECORE_CANNOT_TRIM */	
+#endif  /* DEFAULT_TRIM_THRESHOLD */
+
+#ifndef DEFAULT_MMAP_THRESHOLD
+	#if HAVE_MMAP
+		#define DEFAULT_MMAP_THRESHOLD ((size_t)256U * (size_t)1024U)
+	#else   /* HAVE_MMAP */
+		#define DEFAULT_MMAP_THRESHOLD MAX_SIZE_T
+	#endif  /* HAVE_MMAP */
+#endif  /* DEFAULT_MMAP_THRESHOLD */
+
+#ifndef USE_BUILTIN_FFS
+	#define USE_BUILTIN_FFS 0
+#endif  /* USE_BUILTIN_FFS */
+
+#ifndef USE_DEV_RANDOM
+	#define USE_DEV_RANDOM 0
+#endif  /* USE_DEV_RANDOM */
+
+#ifndef NO_MALLINFO
+	#define NO_MALLINFO 0
+#endif  /* NO_MALLINFO */
+#ifndef MALLINFO_FIELD_TYPE
+	#define MALLINFO_FIELD_TYPE size_t
+#endif  /* MALLINFO_FIELD_TYPE */
+
+/*
+  mallopt tuning options.  SVID/XPG defines four standard parameter
+  numbers for mallopt, normally defined in malloc.h.  None of these
+  are used in this malloc, so setting them has no effect. But this
+  malloc does support the following options.
+*/
+
+#define M_TRIM_THRESHOLD     (-1)
+#define M_GRANULARITY        (-2)
+#define M_MMAP_THRESHOLD     (-3)
+
+#if !NO_MALLINFO
+/*
+  This version of malloc supports the standard SVID/XPG mallinfo
+  routine that returns a struct containing usage properties and
+  statistics. It should work on any system that has a
+  /usr/include/malloc.h defining struct mallinfo.  The main
+  declaration needed is the mallinfo struct that is returned (by-copy)
+  by mallinfo().  The malloinfo struct contains a bunch of fields that
+  are not even meaningful in this version of malloc.  These fields are
+  are instead filled by mallinfo() with other numbers that might be of
+  interest.
+
+  HAVE_USR_INCLUDE_MALLOC_H should be set if you have a
+  /usr/include/malloc.h file that includes a declaration of struct
+  mallinfo.  If so, it is included; else a compliant version is
+  declared below.  These must be precisely the same for mallinfo() to
+  work.  The original SVID version of this struct, defined on most
+  systems with mallinfo, declares all fields as ints. But some others
+  define as unsigned long. If your system defines the fields using a
+  type of different width than listed here, you MUST #include your
+  system version and #define HAVE_USR_INCLUDE_MALLOC_H.
+*/
+
+/* #define HAVE_USR_INCLUDE_MALLOC_H */
+
+#ifdef HAVE_USR_INCLUDE_MALLOC_H
+#include "/usr/include/malloc.h"
+#else /* HAVE_USR_INCLUDE_MALLOC_H */
+
+struct mallinfo {
+  MALLINFO_FIELD_TYPE iArena;    /* non-mmapped space allocated from system */
+  MALLINFO_FIELD_TYPE iOrdblks;  /* number of free chunks */
+  MALLINFO_FIELD_TYPE iSmblks;   /* always 0 */
+  MALLINFO_FIELD_TYPE iHblks;    /* always 0 */
+  MALLINFO_FIELD_TYPE iHblkhd;   /* space in mmapped regions */
+  MALLINFO_FIELD_TYPE iUsmblks;  /* maximum total allocated space */
+  MALLINFO_FIELD_TYPE iFsmblks;  /* always 0 */
+  MALLINFO_FIELD_TYPE iUordblks; /* total allocated space */
+  MALLINFO_FIELD_TYPE iFordblks; /* total free space */
+  MALLINFO_FIELD_TYPE iKeepcost; /* releasable (via malloc_trim) space */
+  MALLINFO_FIELD_TYPE iCellCount;/* Number of chunks allocated*/
+};
+
+#endif /* HAVE_USR_INCLUDE_MALLOC_H */
+#endif /* NO_MALLINFO */
+
+#if MSPACES
+	typedef void* mspace;
+#endif /* MSPACES */
+
+#if 0
+
+#include <stdio.h>/* for printing in malloc_stats */
+
+#ifndef LACKS_ERRNO_H
+	#include <errno.h>       /* for MALLOC_FAILURE_ACTION */
+#endif /* LACKS_ERRNO_H */
+
+#if FOOTERS
+	#include <time.h>        /* for iMagic initialization */
+#endif /* FOOTERS */
+
+#ifndef LACKS_STDLIB_H
+	#include <stdlib.h>      /* for abort() */
+#endif /* LACKS_STDLIB_H */
+
+#if !defined(ASSERT)
+#define ASSERT(x) __ASSERT_DEBUG(x, HEAP_PANIC(ETHeapBadCellAddress))
+#endif
+	
+#ifndef LACKS_STRING_H
+	#include <string.h>      /* for memset etc */
+#endif  /* LACKS_STRING_H */
+
+#if USE_BUILTIN_FFS
+	#ifndef LACKS_STRINGS_H
+		#include <strings.h>     /* for ffs */
+	#endif /* LACKS_STRINGS_H */
+#endif /* USE_BUILTIN_FFS */
+
+#if HAVE_MMAP
+	#ifndef LACKS_SYS_MMAN_H
+		#include <sys/mman.h>    /* for mmap */
+	#endif /* LACKS_SYS_MMAN_H */
+	#ifndef LACKS_FCNTL_H
+		#include <fcntl.h>
+	#endif /* LACKS_FCNTL_H */
+#endif /* HAVE_MMAP */
+
+#if HAVE_MORECORE
+	#ifndef LACKS_UNISTD_H
+		#include <unistd.h>     /* for sbrk */
+	extern void*     sbrk(size_t);
+	#else /* LACKS_UNISTD_H */
+		#if !defined(__FreeBSD__) && !defined(__OpenBSD__) && !defined(__NetBSD__)
+			extern void*     sbrk(ptrdiff_t);			
+			/*Amod sbrk is not defined in WIN32 need to check in symbian*/
+		#endif /* FreeBSD etc */
+	#endif /* LACKS_UNISTD_H */
+#endif /* HAVE_MORECORE */
+
+#endif
+
+/*AMOD: For MALLOC_GETPAGESIZE*/
+#if 0	// replaced with GET_PAGE_SIZE() defined in heap.cpp
+#ifndef WIN32
+	#ifndef MALLOC_GETPAGESIZE
+		#ifdef _SC_PAGESIZE         /* some SVR4 systems omit an underscore */
+			#ifndef _SC_PAGE_SIZE
+				#define _SC_PAGE_SIZE _SC_PAGESIZE
+			#endif
+		#endif
+		#ifdef _SC_PAGE_SIZE
+			#define MALLOC_GETPAGESIZE sysconf(_SC_PAGE_SIZE)
+		#else
+			#if defined(BSD) || defined(DGUX) || defined(HAVE_GETPAGESIZE)
+				extern size_t getpagesize();
+				#define MALLOC_GETPAGESIZE getpagesize()
+			#else
+				#ifdef WIN32 /* use supplied emulation of getpagesize */
+					#define MALLOC_GETPAGESIZE getpagesize()
+				#else
+					#ifndef LACKS_SYS_PARAM_H
+						#include <sys/param.h>
+					#endif
+					#ifdef EXEC_PAGESIZE
+						#define MALLOC_GETPAGESIZE EXEC_PAGESIZE
+					#else
+						#ifdef NBPG
+							#ifndef CLSIZE
+								#define MALLOC_GETPAGESIZE NBPG
+							#else
+								#define MALLOC_GETPAGESIZE (NBPG * CLSIZE)
+							#endif
+						#else
+							#ifdef NBPC
+								#define MALLOC_GETPAGESIZE NBPC
+							#else
+								#ifdef PAGESIZE
+									#define MALLOC_GETPAGESIZE PAGESIZE
+								#else /* just guess */
+									#define MALLOC_GETPAGESIZE ((size_t)4096U)
+								#endif
+							#endif
+						#endif
+					#endif
+				#endif
+			#endif
+		#endif
+	#endif
+#endif
+#endif
+/*AMOD: For MALLOC_GETPAGESIZE*/
+
+/* ------------------- size_t and alignment properties -------------------- */
+
+/* The byte and bit size of a size_t */
+#define SIZE_T_SIZE         (sizeof(size_t))
+#define SIZE_T_BITSIZE      (sizeof(size_t) << 3)
+
+/* Some constants coerced to size_t */
+/* Annoying but necessary to avoid errors on some plaftorms */
+#define SIZE_T_ZERO         ((size_t)0)
+#define SIZE_T_ONE          ((size_t)1)
+#define SIZE_T_TWO          ((size_t)2)
+#define TWO_SIZE_T_SIZES    (SIZE_T_SIZE<<1)
+#define FOUR_SIZE_T_SIZES   (SIZE_T_SIZE<<2)
+#define SIX_SIZE_T_SIZES    (FOUR_SIZE_T_SIZES+TWO_SIZE_T_SIZES)
+#define HALF_MAX_SIZE_T     (MAX_SIZE_T / 2U)
+
+/* The bit mask value corresponding to MALLOC_ALIGNMENT */
+#define CHUNK_ALIGN_MASK    (MALLOC_ALIGNMENT - SIZE_T_ONE)
+
+/* True if address a has acceptable alignment */
+//#define IS_ALIGNED(A)       (((size_t)((A)) & (CHUNK_ALIGN_MASK)) == 0)
+#define IS_ALIGNED(A)       (((unsigned int)((A)) & (CHUNK_ALIGN_MASK)) == 0)
+
+/* the number of bytes to offset an address to align it */
+#define ALIGN_OFFSET(A)\
+	((((size_t)(A) & CHUNK_ALIGN_MASK) == 0)? 0 :\
+	((MALLOC_ALIGNMENT - ((size_t)(A) & CHUNK_ALIGN_MASK)) & CHUNK_ALIGN_MASK))
+				
+/* -------------------------- MMAP preliminaries ------------------------- */
+
+/*
+   If HAVE_MORECORE or HAVE_MMAP are false, we just define calls and
+   checks to fail so compiler optimizer can delete code rather than
+   using so many "#if"s.
+*/
+
+
+/* MORECORE and MMAP must return MFAIL on failure */
+#define MFAIL                ((void*)(MAX_SIZE_T))
+#define CMFAIL               ((TUint8*)(MFAIL)) /* defined for convenience */
+
+#if !HAVE_MMAP
+	#define IS_MMAPPED_BIT       (SIZE_T_ZERO)
+	#define USE_MMAP_BIT         (SIZE_T_ZERO)
+	#define CALL_MMAP(s)         MFAIL
+	#define CALL_MUNMAP(a, s)    (-1)
+	#define DIRECT_MMAP(s)       MFAIL
+#else /* !HAVE_MMAP */
+	#define IS_MMAPPED_BIT       (SIZE_T_ONE)
+	#define USE_MMAP_BIT         (SIZE_T_ONE)
+		#ifndef WIN32
+			#define CALL_MUNMAP(a, s)    DLUMMAP((a),(s)) /*munmap((a), (s))*/
+			#define MMAP_PROT            (PROT_READ|PROT_WRITE)
+			#if !defined(MAP_ANONYMOUS) && defined(MAP_ANON)
+				#define MAP_ANONYMOUS        MAP_ANON
+			#endif /* MAP_ANON */
+			#ifdef MAP_ANONYMOUS       
+				#define MMAP_FLAGS           (MAP_PRIVATE|MAP_ANONYMOUS)
+				#define CALL_MMAP(s)         mmap(0, (s), MMAP_PROT, (int)MMAP_FLAGS, -1, 0)
+			#else /* MAP_ANONYMOUS */
+				/*
+				   Nearly all versions of mmap support MAP_ANONYMOUS, so the following
+				   is unlikely to be needed, but is supplied just in case.
+				*/
+				#define MMAP_FLAGS           (MAP_PRIVATE)
+				//static int dev_zero_fd = -1; /* Cached file descriptor for /dev/zero. */
+				#define CALL_MMAP(s) DLMMAP(s)
+				/*#define CALL_MMAP(s) ((dev_zero_fd < 0) ? \
+			           (dev_zero_fd = open("/dev/zero", O_RDWR), \
+			            mmap(0, (s), MMAP_PROT, MMAP_FLAGS, dev_zero_fd, 0)) : \
+			            mmap(0, (s), MMAP_PROT, MMAP_FLAGS, dev_zero_fd, 0))
+			            */
+				#define CALL_REMAP(a, s, d)    DLREMAP((a),(s),(d))
+			#endif /* MAP_ANONYMOUS */
+			#define DIRECT_MMAP(s)       CALL_MMAP(s)
+		#else /* WIN32 */
+			#define CALL_MMAP(s)         win32mmap(s)
+			#define CALL_MUNMAP(a, s)    win32munmap((a), (s))
+			#define DIRECT_MMAP(s)       win32direct_mmap(s)
+		#endif /* WIN32 */
+#endif /* HAVE_MMAP */
+
+#if HAVE_MMAP && HAVE_MREMAP
+	#define CALL_MREMAP(addr, osz, nsz, mv) mremap((addr), (osz), (nsz), (mv))
+#else  /* HAVE_MMAP && HAVE_MREMAP */
+	#define CALL_MREMAP(addr, osz, nsz, mv) MFAIL
+#endif /* HAVE_MMAP && HAVE_MREMAP */
+
+#if HAVE_MORECORE
+	#define CALL_MORECORE(S)     SetBrk(S)
+#else  /* HAVE_MORECORE */
+	#define CALL_MORECORE(S)     MFAIL
+#endif /* HAVE_MORECORE */
+
+/* mstate bit set if continguous morecore disabled or failed */
+#define USE_NONCONTIGUOUS_BIT (4U)
+
+/* segment bit set in create_mspace_with_base */
+#define EXTERN_BIT            (8U)
+
+
+#if USE_LOCKS
+/*
+  When locks are defined, there are up to two global locks:
+  * If HAVE_MORECORE, iMorecoreMutex protects sequences of calls to
+    MORECORE.  In many cases sys_alloc requires two calls, that should
+    not be interleaved with calls by other threads.  This does not
+    protect against direct calls to MORECORE by other threads not
+    using this lock, so there is still code to cope the best we can on
+    interference.
+  * iMagicInitMutex ensures that mparams.iMagic and other
+    unique mparams values are initialized only once.
+*/
+	#ifndef WIN32
+		/* By default use posix locks */
+		#include <pthread.h>
+		#define MLOCK_T pthread_mutex_t
+		#define INITIAL_LOCK(l)      pthread_mutex_init(l, NULL)
+		#define ACQUIRE_LOCK(l)      pthread_mutex_lock(l)
+		#define RELEASE_LOCK(l)      pthread_mutex_unlock(l)
+		
+		#if HAVE_MORECORE
+			//static MLOCK_T iMorecoreMutex = PTHREAD_MUTEX_INITIALIZER;
+		#endif /* HAVE_MORECORE */
+			//static MLOCK_T iMagicInitMutex = PTHREAD_MUTEX_INITIALIZER;
+	#else /* WIN32 */
+		#define MLOCK_T long
+		#define INITIAL_LOCK(l)      *(l)=0
+		#define ACQUIRE_LOCK(l)      win32_acquire_lock(l)
+		#define RELEASE_LOCK(l)      win32_release_lock(l)
+		#if HAVE_MORECORE
+			static MLOCK_T iMorecoreMutex;
+		#endif /* HAVE_MORECORE */
+		static MLOCK_T iMagicInitMutex;
+	#endif /* WIN32 */
+	#define USE_LOCK_BIT               (2U)
+#else  /* USE_LOCKS */
+	#define USE_LOCK_BIT               (0U)
+	#define INITIAL_LOCK(l)
+#endif /* USE_LOCKS */
+
+#if USE_LOCKS && HAVE_MORECORE
+	#define ACQUIRE_MORECORE_LOCK(M)    ACQUIRE_LOCK((M->iMorecoreMutex)/*&iMorecoreMutex*/);
+	#define RELEASE_MORECORE_LOCK(M)    RELEASE_LOCK((M->iMorecoreMutex)/*&iMorecoreMutex*/);
+#else /* USE_LOCKS && HAVE_MORECORE */
+	#define ACQUIRE_MORECORE_LOCK(M)
+	#define RELEASE_MORECORE_LOCK(M)
+#endif /* USE_LOCKS && HAVE_MORECORE */
+
+#if USE_LOCKS
+		/*Currently not suporting this*/				
+	#define ACQUIRE_MAGIC_INIT_LOCK(M)  ACQUIRE_LOCK(((M)->iMagicInitMutex));
+	//AMOD: changed #define ACQUIRE_MAGIC_INIT_LOCK()
+	//#define RELEASE_MAGIC_INIT_LOCK()
+	#define RELEASE_MAGIC_INIT_LOCK(M)  RELEASE_LOCK(((M)->iMagicInitMutex));
+#else  /* USE_LOCKS */
+	#define ACQUIRE_MAGIC_INIT_LOCK(M)
+	#define RELEASE_MAGIC_INIT_LOCK(M)
+#endif /* USE_LOCKS */
+
+/*CHUNK representation*/
+struct malloc_chunk {
+  size_t               iPrevFoot;  /* Size of previous chunk (if free).  */
+  size_t               iHead;       /* Size and inuse bits. */
+  struct malloc_chunk* iFd;         /* double links -- used only if free. */
+  struct malloc_chunk* iBk;
+};
+
+typedef struct malloc_chunk  mchunk;
+typedef struct malloc_chunk* mchunkptr;
+typedef struct malloc_chunk* sbinptr;  /* The type of bins of chunks */
+typedef unsigned int bindex_t;         /* Described below */
+typedef unsigned int binmap_t;         /* Described below */
+typedef unsigned int flag_t;           /* The type of various bit flag sets */
+
+
+/* ------------------- Chunks sizes and alignments ----------------------- */
+#define MCHUNK_SIZE         (sizeof(mchunk))
+
+//#if FOOTERS
+//	#define CHUNK_OVERHEAD      (TWO_SIZE_T_SIZES)
+//#else /* FOOTERS */
+//	#define CHUNK_OVERHEAD      (SIZE_T_SIZE)
+//#endif /* FOOTERS */
+
+/* MMapped chunks need a second word of overhead ... */
+#define MMAP_CHUNK_OVERHEAD (TWO_SIZE_T_SIZES)
+/* ... and additional padding for fake next-chunk at foot */
+#define MMAP_FOOT_PAD       (FOUR_SIZE_T_SIZES)
+
+/* The smallest size we can malloc is an aligned minimal chunk */
+#define MIN_CHUNK_SIZE ((MCHUNK_SIZE + CHUNK_ALIGN_MASK) & ~CHUNK_ALIGN_MASK)
+
+/* conversion from malloc headers to user pointers, and back */
+#define CHUNK2MEM(p)        ((void*)((TUint8*)(p)       + TWO_SIZE_T_SIZES))
+#define MEM2CHUNK(mem)      ((mchunkptr)((TUint8*)(mem) - TWO_SIZE_T_SIZES))
+/* chunk associated with aligned address A */
+#define ALIGN_AS_CHUNK(A)   (mchunkptr)((A) + ALIGN_OFFSET(CHUNK2MEM(A)))
+
+/* Bounds on request (not chunk) sizes. */
+#define MAX_REQUEST         ((-MIN_CHUNK_SIZE) << 2)
+#define MIN_REQUEST         (MIN_CHUNK_SIZE - CHUNK_OVERHEAD - SIZE_T_ONE)
+
+/* pad request bytes into a usable size */
+#define PAD_REQUEST(req) (((req) + CHUNK_OVERHEAD + CHUNK_ALIGN_MASK) & ~CHUNK_ALIGN_MASK)
+
+/* pad request, checking for minimum (but not maximum) */
+#define REQUEST2SIZE(req) (((req) < MIN_REQUEST)? MIN_CHUNK_SIZE : PAD_REQUEST(req))
+
+/* ------------------ Operations on iHead and foot fields ----------------- */
+
+/*
+  The iHead field of a chunk is or'ed with PINUSE_BIT when previous
+  adjacent chunk in use, and or'ed with CINUSE_BIT if this chunk is in
+  use. If the chunk was obtained with mmap, the iPrevFoot field has
+  IS_MMAPPED_BIT set, otherwise holding the offset of the base of the
+  mmapped region to the base of the chunk.
+*/
+#define PINUSE_BIT          (SIZE_T_ONE)
+#define CINUSE_BIT          (SIZE_T_TWO)
+#define INUSE_BITS          (PINUSE_BIT|CINUSE_BIT)
+
+/* Head value for fenceposts */
+#define FENCEPOST_HEAD      (INUSE_BITS|SIZE_T_SIZE)
+
+/* extraction of fields from iHead words */
+#define CINUSE(p)           ((p)->iHead & CINUSE_BIT)
+#define PINUSE(p)           ((p)->iHead & PINUSE_BIT)
+#define CHUNKSIZE(p)        ((p)->iHead & ~(INUSE_BITS))
+
+#define CLEAR_PINUSE(p)     ((p)->iHead &= ~PINUSE_BIT)
+#define CLEAR_CINUSE(p)     ((p)->iHead &= ~CINUSE_BIT)
+
+/* Treat space at ptr +/- offset as a chunk */
+#define CHUNK_PLUS_OFFSET(p, s)  ((mchunkptr)(((TUint8*)(p)) + (s)))
+#define CHUNK_MINUS_OFFSET(p, s) ((mchunkptr)(((TUint8*)(p)) - (s)))
+
+/* Ptr to next or previous physical malloc_chunk. */
+#define NEXT_CHUNK(p) ((mchunkptr)( ((TUint8*)(p)) + ((p)->iHead & ~INUSE_BITS)))
+#define PREV_CHUNK(p) ((mchunkptr)( ((TUint8*)(p)) - ((p)->iPrevFoot) ))
+
+/* extract next chunk's PINUSE bit */
+#define NEXT_PINUSE(p)  ((NEXT_CHUNK(p)->iHead) & PINUSE_BIT)
+
+/* Get/set size at footer */
+#define GET_FOOT(p, s)  (((mchunkptr)((TUint8*)(p) + (s)))->iPrevFoot)
+#define SET_FOOT(p, s)  (((mchunkptr)((TUint8*)(p) + (s)))->iPrevFoot = (s))
+
+/* Set size, PINUSE bit, and foot */
+#define SET_SIZE_AND_PINUSE_OF_FREE_CHUNK(p, s) ((p)->iHead = (s|PINUSE_BIT), SET_FOOT(p, s))
+
+/* Set size, PINUSE bit, foot, and clear next PINUSE */
+#define SET_FREE_WITH_PINUSE(p, s, n) (CLEAR_PINUSE(n), SET_SIZE_AND_PINUSE_OF_FREE_CHUNK(p, s))
+
+#define IS_MMAPPED(p) (!((p)->iHead & PINUSE_BIT) && ((p)->iPrevFoot & IS_MMAPPED_BIT))
+
+/* Get the internal overhead associated with chunk p */
+#define OVERHEAD_FOR(p) (IS_MMAPPED(p)? MMAP_CHUNK_OVERHEAD : CHUNK_OVERHEAD)
+
+/* Return true if malloced space is not necessarily cleared */
+#if MMAP_CLEARS
+	#define CALLOC_MUST_CLEAR(p) (!IS_MMAPPED(p))
+#else /* MMAP_CLEARS */
+	#define CALLOC_MUST_CLEAR(p) (1)
+#endif /* MMAP_CLEARS */
+
+/* ---------------------- Overlaid data structures ----------------------- */
+struct malloc_tree_chunk {
+  /* The first four fields must be compatible with malloc_chunk */
+  size_t                    				iPrevFoot;
+  size_t                    				iHead;
+  struct malloc_tree_chunk*	iFd;
+  struct malloc_tree_chunk*	iBk;
+
+  struct malloc_tree_chunk* iChild[2];
+  struct malloc_tree_chunk* iParent;
+  bindex_t                  iIndex;
+};
+
+typedef struct malloc_tree_chunk  tchunk;
+typedef struct malloc_tree_chunk* tchunkptr;
+typedef struct malloc_tree_chunk* tbinptr; /* The type of bins of trees */
+
+/* A little helper macro for trees */
+#define LEFTMOST_CHILD(t) ((t)->iChild[0] != 0? (t)->iChild[0] : (t)->iChild[1])
+/*Segment structur*/
+//struct malloc_segment {
+//  TUint8*        iBase;             /* base address */
+//  size_t       iSize;             /* allocated size */
+//};
+
+#define IS_MMAPPED_SEGMENT(S)  ((S)->iSflags & IS_MMAPPED_BIT)
+#define IS_EXTERN_SEGMENT(S)   ((S)->iSflags & EXTERN_BIT)
+
+typedef struct malloc_segment  msegment;
+typedef struct malloc_segment* msegmentptr;
+
+/*Malloc State data structur*/
+
+//#define NSMALLBINS        (32U)
+//#define NTREEBINS         (32U)
+#define SMALLBIN_SHIFT    (3U)
+#define SMALLBIN_WIDTH    (SIZE_T_ONE << SMALLBIN_SHIFT)
+#define TREEBIN_SHIFT     (8U)
+#define MIN_LARGE_SIZE    (SIZE_T_ONE << TREEBIN_SHIFT)
+#define MAX_SMALL_SIZE    (MIN_LARGE_SIZE - SIZE_T_ONE)
+#define MAX_SMALL_REQUEST (MAX_SMALL_SIZE - CHUNK_ALIGN_MASK - CHUNK_OVERHEAD)
+
+/*struct malloc_state {
+	binmap_t	 iSmallMap;
+	binmap_t	 iTreeMap;
+	size_t		 iDvSize;
+	size_t		 iTopSize;
+	mchunkptr	iDv;
+	mchunkptr	iTop;
+	size_t		 iTrimCheck;
+	mchunkptr	iSmallBins[(NSMALLBINS+1)*2];
+	tbinptr		iTreeBins[NTREEBINS];
+	msegment	iSeg;
+	};*/
+/*
+struct malloc_state {
+  binmap_t   iSmallMap;
+  binmap_t   iTreeMap;
+  size_t     iDvSize;
+  size_t     iTopSize;
+  TUint8*      iLeastAddr;
+  mchunkptr  iDv;
+  mchunkptr  iTop;
+  size_t     iTrimCheck;
+  size_t     iMagic;
+  mchunkptr  iSmallBins[(NSMALLBINS+1)*2];
+  tbinptr    iTreeBins[NTREEBINS];
+  size_t     iFootprint;
+  size_t     iMaxFootprint;
+  flag_t     iMflags;
+#if USE_LOCKS
+  MLOCK_T    iMutex;
+  MLOCK_T	iMagicInitMutex;  
+  MLOCK_T	iMorecoreMutex;
+#endif 
+  msegment   iSeg;
+};
+*/
+typedef struct malloc_state*    mstate;
+
+/* ------------- Global malloc_state and malloc_params ------------------- */
+
+/*
+  malloc_params holds global properties, including those that can be
+  dynamically set using mallopt. There is a single instance, mparams,
+  initialized in init_mparams.
+*/
+
+struct malloc_params {
+  size_t iMagic;
+  size_t iPageSize;
+  size_t iGranularity;
+  size_t iMmapThreshold;
+  size_t iTrimThreshold;
+  flag_t iDefaultMflags;
+#if USE_LOCKS
+  MLOCK_T	iMagicInitMutex;  
+#endif /* USE_LOCKS */
+};
+
+/* The global malloc_state used for all non-"mspace" calls */
+/*AMOD: Need to check this as this will be the member of the class*/
+
+//static struct malloc_state _gm_;
+//#define GM                 (&_gm_)
+ 
+//#define IS_GLOBAL(M)       ((M) == &_gm_)
+/*AMOD: has changed*/
+#define IS_GLOBAL(M)       ((M) == GM)
+#define IS_INITIALIZED(M)  ((M)->iTop != 0)
+
+/* -------------------------- system alloc setup ------------------------- */
+
+/* Operations on iMflags */
+
+#define USE_LOCK(M)           ((M)->iMflags &   USE_LOCK_BIT)
+#define ENABLE_LOCK(M)        ((M)->iMflags |=  USE_LOCK_BIT)
+#define DISABLE_LOCK(M)       ((M)->iMflags &= ~USE_LOCK_BIT)
+
+#define USE_MMAP(M)           ((M)->iMflags &   USE_MMAP_BIT)
+#define ENABLE_MMAP(M)        ((M)->iMflags |=  USE_MMAP_BIT)
+#define DISABLE_MMAP(M)       ((M)->iMflags &= ~USE_MMAP_BIT)
+
+#define USE_NONCONTIGUOUS(M)  ((M)->iMflags &   USE_NONCONTIGUOUS_BIT)
+#define DISABLE_CONTIGUOUS(M) ((M)->iMflags |=  USE_NONCONTIGUOUS_BIT)
+
+#define SET_LOCK(M,L) ((M)->iMflags = (L)? ((M)->iMflags | USE_LOCK_BIT) :  ((M)->iMflags & ~USE_LOCK_BIT))
+
+/* page-align a size */
+#define PAGE_ALIGN(S) (((S) + (mparams.iPageSize)) & ~(mparams.iPageSize - SIZE_T_ONE))
+
+/* iGranularity-align a size */
+#define GRANULARITY_ALIGN(S)  (((S) + (mparams.iGranularity)) & ~(mparams.iGranularity - SIZE_T_ONE))
+
+#define IS_PAGE_ALIGNED(S)   (((size_t)(S) & (mparams.iPageSize - SIZE_T_ONE)) == 0)
+#define IS_GRANULARITY_ALIGNED(S)   (((size_t)(S) & (mparams.iGranularity - SIZE_T_ONE)) == 0)
+
+/*  True if segment S holds address A */
+#define SEGMENT_HOLDS(S, A)  ((TUint8*)(A) >= S->iBase && (TUint8*)(A) < S->iBase + S->iSize)
+
+#ifndef MORECORE_CANNOT_TRIM
+	#define SHOULD_TRIM(M,s)  ((s) > (M)->iTrimCheck)
+#else  /* MORECORE_CANNOT_TRIM */
+	#define SHOULD_TRIM(M,s)  (0)
+#endif /* MORECORE_CANNOT_TRIM */
+
+/*
+  TOP_FOOT_SIZE is padding at the end of a segment, including space
+  that may be needed to place segment records and fenceposts when new
+  noncontiguous segments are added.
+*/
+#define TOP_FOOT_SIZE  (ALIGN_OFFSET(CHUNK2MEM(0))+PAD_REQUEST(sizeof(struct malloc_segment))+MIN_CHUNK_SIZE)
+
+#define SYS_ALLOC_PADDING (TOP_FOOT_SIZE + MALLOC_ALIGNMENT)
+/* -------------------------------  Hooks -------------------------------- */
+
+/*
+  PREACTION should be defined to return 0 on success, and nonzero on
+  failure. If you are not using locking, you can redefine these to do
+  anything you like.
+*/
+
+#if USE_LOCKS
+	/* Ensure locks are initialized */
+	#define GLOBALLY_INITIALIZE() (mparams.iPageSize == 0 && init_mparams())
+	#define PREACTION(M) (USE_LOCK((M))?(ACQUIRE_LOCK((M)->iMutex),0):0) /*Action to take like lock before alloc*/
+	#define POSTACTION(M) { if (USE_LOCK(M)) RELEASE_LOCK((M)->iMutex); }
+
+#else /* USE_LOCKS */
+	#ifndef PREACTION
+		#define PREACTION(M) (0)
+	#endif  /* PREACTION */
+	#ifndef POSTACTION
+		#define POSTACTION(M)
+	#endif  /* POSTACTION */
+#endif /* USE_LOCKS */
+
+/*
+  CORRUPTION_ERROR_ACTION is triggered upon detected bad addresses.
+  USAGE_ERROR_ACTION is triggered on detected bad frees and
+  reallocs. The argument p is an address that might have triggered the
+  fault. It is ignored by the two predefined actions, but might be
+  useful in custom actions that try to help diagnose errors.
+*/
+
+#if PROCEED_ON_ERROR
+	/* A count of the number of corruption errors causing resets */
+	int malloc_corruption_error_count;
+	/* default corruption action */
+	static void ResetOnError(mstate m);
+	#define CORRUPTION_ERROR_ACTION(m)  ResetOnError(m)
+	#define USAGE_ERROR_ACTION(m, p)
+#else /* PROCEED_ON_ERROR */
+	#ifndef CORRUPTION_ERROR_ACTION
+		#define CORRUPTION_ERROR_ACTION(m) ABORT
+	#endif /* CORRUPTION_ERROR_ACTION */
+	#ifndef USAGE_ERROR_ACTION
+		#define USAGE_ERROR_ACTION(m,p) ABORT
+	#endif /* USAGE_ERROR_ACTION */
+#endif /* PROCEED_ON_ERROR */
+
+
+#ifdef _DEBUG
+	#define CHECK_FREE_CHUNK(M,P)       DoCheckFreeChunk(M,P)
+	#define CHECK_INUSE_CHUNK(M,P)      DoCheckInuseChunk(M,P)
+	#define CHECK_TOP_CHUNK(M,P)        DoCheckTopChunk(M,P)
+	#define CHECK_MALLOCED_CHUNK(M,P,N) DoCheckMallocedChunk(M,P,N)
+	#define CHECK_MMAPPED_CHUNK(M,P)    DoCheckMmappedChunk(M,P)
+	#define CHECK_MALLOC_STATE(M)       DoCheckMallocState(M)
+#else /* DEBUG */
+	#define CHECK_FREE_CHUNK(M,P)
+	#define CHECK_INUSE_CHUNK(M,P)
+	#define CHECK_MALLOCED_CHUNK(M,P,N)
+	#define CHECK_MMAPPED_CHUNK(M,P)
+	#define CHECK_MALLOC_STATE(M)
+	#define CHECK_TOP_CHUNK(M,P)
+#endif /* DEBUG */
+
+/* ---------------------------- Indexing Bins ---------------------------- */
+
+#define IS_SMALL(s)         (((s) >> SMALLBIN_SHIFT) < NSMALLBINS)
+#define SMALL_INDEX(s)      ((s)  >> SMALLBIN_SHIFT)
+#define SMALL_INDEX2SIZE(i) ((i)  << SMALLBIN_SHIFT)
+#define MIN_SMALL_INDEX     (SMALL_INDEX(MIN_CHUNK_SIZE))
+
+/* addressing by index. See above about smallbin repositioning */
+#define SMALLBIN_AT(M, i)   ((sbinptr)((TUint8*)&((M)->iSmallBins[(i)<<1])))
+#define TREEBIN_AT(M,i)     (&((M)->iTreeBins[i]))
+
+
+/* Bit representing maximum resolved size in a treebin at i */
+#define BIT_FOR_TREE_INDEX(i) (i == NTREEBINS-1)? (SIZE_T_BITSIZE-1) : (((i) >> 1) + TREEBIN_SHIFT - 2)
+
+/* Shift placing maximum resolved bit in a treebin at i as sign bit */
+#define LEFTSHIFT_FOR_TREE_INDEX(i) ((i == NTREEBINS-1)? 0 : ((SIZE_T_BITSIZE-SIZE_T_ONE) - (((i) >> 1) + TREEBIN_SHIFT - 2)))
+
+/* The size of the smallest chunk held in bin with index i */
+#define MINSIZE_FOR_TREE_INDEX(i) ((SIZE_T_ONE << (((i) >> 1) + TREEBIN_SHIFT)) |  (((size_t)((i) & SIZE_T_ONE)) << (((i) >> 1) + TREEBIN_SHIFT - 1)))
+
+
+/* ------------------------ Operations on bin maps ----------------------- */
+/* bit corresponding to given index */
+#define IDX2BIT(i)              ((binmap_t)(1) << (i))
+/* Mark/Clear bits with given index */
+#define MARK_SMALLMAP(M,i)      ((M)->iSmallMap |=  IDX2BIT(i))
+#define CLEAR_SMALLMAP(M,i)     ((M)->iSmallMap &= ~IDX2BIT(i))
+#define SMALLMAP_IS_MARKED(M,i) ((M)->iSmallMap &   IDX2BIT(i))
+#define MARK_TREEMAP(M,i)       ((M)->iTreeMap  |=  IDX2BIT(i))
+#define CLEAR_TREEMAP(M,i)      ((M)->iTreeMap  &= ~IDX2BIT(i))
+#define TREEMAP_IS_MARKED(M,i)  ((M)->iTreeMap  &   IDX2BIT(i))
+
+	/* isolate the least set bit of a bitmap */
+#define LEAST_BIT(x)         ((x) & -(x))
+
+/* mask with all bits to left of least bit of x on */
+#define LEFT_BITS(x)         ((x<<1) | -(x<<1))
+
+/* mask with all bits to left of or equal to least bit of x on */
+#define SAME_OR_LEFT_BITS(x) ((x) | -(x))
+
+#if !INSECURE
+	/* Check if address a is at least as high as any from MORECORE or MMAP */
+	#define OK_ADDRESS(M, a) ((TUint8*)(a) >= (M)->iLeastAddr)
+	/* Check if address of next chunk n is higher than base chunk p */
+	#define OK_NEXT(p, n)    ((TUint8*)(p) < (TUint8*)(n))
+	/* Check if p has its CINUSE bit on */
+	#define OK_CINUSE(p)     CINUSE(p)
+	/* Check if p has its PINUSE bit on */
+	#define OK_PINUSE(p)     PINUSE(p)
+#else /* !INSECURE */
+	#define OK_ADDRESS(M, a) (1)
+	#define OK_NEXT(b, n)    (1)
+	#define OK_CINUSE(p)     (1)
+	#define OK_PINUSE(p)     (1)
+#endif /* !INSECURE */
+
+#if (FOOTERS && !INSECURE)
+	/* Check if (alleged) mstate m has expected iMagic field */
+	#define OK_MAGIC(M)      ((M)->iMagic == mparams.iMagic)
+#else  /* (FOOTERS && !INSECURE) */
+	#define OK_MAGIC(M)      (1)
+#endif /* (FOOTERS && !INSECURE) */
+
+/* In gcc, use __builtin_expect to minimize impact of checks */
+#if !INSECURE
+	#if defined(__GNUC__) && __GNUC__ >= 3
+		#define RTCHECK(e)  __builtin_expect(e, 1)
+	#else /* GNUC */
+		#define RTCHECK(e)  (e)
+	#endif /* GNUC */
+
+#else /* !INSECURE */
+	#define RTCHECK(e)  (1)
+#endif /* !INSECURE */
+/* macros to set up inuse chunks with or without footers */
+#if !FOOTERS
+	#define MARK_INUSE_FOOT(M,p,s)
+	/* Set CINUSE bit and PINUSE bit of next chunk */
+	#define SET_INUSE(M,p,s)  ((p)->iHead = (((p)->iHead & PINUSE_BIT)|s|CINUSE_BIT),((mchunkptr)(((TUint8*)(p)) + (s)))->iHead |= PINUSE_BIT)
+	/* Set CINUSE and PINUSE of this chunk and PINUSE of next chunk */
+	#define SET_INUSE_AND_PINUSE(M,p,s) ((p)->iHead = (s|PINUSE_BIT|CINUSE_BIT),((mchunkptr)(((TUint8*)(p)) + (s)))->iHead |= PINUSE_BIT)
+	/* Set size, CINUSE and PINUSE bit of this chunk */
+	#define SET_SIZE_AND_PINUSE_OF_INUSE_CHUNK(M, p, s) ((p)->iHead = (s|PINUSE_BIT|CINUSE_BIT))
+#else /* FOOTERS */
+	/* Set foot of inuse chunk to be xor of mstate and seed */
+	#define MARK_INUSE_FOOT(M,p,s) (((mchunkptr)((TUint8*)(p) + (s)))->iPrevFoot = ((size_t)(M) ^ mparams.iMagic))
+	#define GET_MSTATE_FOR(p) ((mstate)(((mchunkptr)((TUint8*)(p)+(CHUNKSIZE(p))))->iPrevFoot ^ mparams.iMagic))
+	#define SET_INUSE(M,p,s)\
+		((p)->iHead = (((p)->iHead & PINUSE_BIT)|s|CINUSE_BIT),\
+		(((mchunkptr)(((TUint8*)(p)) + (s)))->iHead |= PINUSE_BIT), \
+		MARK_INUSE_FOOT(M,p,s))
+	#define SET_INUSE_AND_PINUSE(M,p,s)\
+	((p)->iHead = (s|PINUSE_BIT|CINUSE_BIT),\
+	(((mchunkptr)(((TUint8*)(p)) + (s)))->iHead |= PINUSE_BIT),\
+	MARK_INUSE_FOOT(M,p,s))
+	#define SET_SIZE_AND_PINUSE_OF_INUSE_CHUNK(M, p, s)\
+	((p)->iHead = (s|PINUSE_BIT|CINUSE_BIT),\
+	MARK_INUSE_FOOT(M, p, s))
+#endif /* !FOOTERS */
+
+
+#if ONLY_MSPACES
+#define INTERNAL_MALLOC(m, b) mspace_malloc(m, b)
+#define INTERNAL_FREE(m, mem) mspace_free(m,mem);
+#else /* ONLY_MSPACES */
+	#if MSPACES
+		#define INTERNAL_MALLOC(m, b) (m == GM)? dlmalloc(b) : mspace_malloc(m, b)
+		#define INTERNAL_FREE(m, mem) if (m == GM) dlfree(mem); else mspace_free(m,mem);
+	#else /* MSPACES */
+		#define INTERNAL_MALLOC(m, b) dlmalloc(b)
+		#define INTERNAL_FREE(m, mem) dlfree(mem)
+	#endif /* MSPACES */
+#endif /* ONLY_MSPACES */
+	
+	#ifndef NDEBUG
+	#define CHECKING 1
+	#endif
+//  #define HYSTERESIS 4
+    #define HYSTERESIS 1	
+	#define HYSTERESIS_BYTES (2*PAGESIZE)
+    #define HYSTERESIS_GROW (HYSTERESIS*PAGESIZE)	
+	
+	#if CHECKING
+	#define CHECK(x) x
+	#else
+	#undef ASSERT
+	#define ASSERT(x) (void)0
+	#define CHECK(x) (void)0
+	#endif
+	
+#endif/*__DLA__*/
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/d32locd.h
--- a/kernel/eka/include/d32locd.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/d32locd.h	Thu Jun 10 11:48:01 2010 +0100
@@ -565,7 +565,8 @@
 	enum TReadWriteFlags
 		{
 		ELocDrvMetaData					= 0x80000000,	/**< Set if read/write request is for metadata */
-		ELocDrvWholeMedia				= 0x40000000	/**< Set to access whole media, rather than partition */
+		ELocDrvWholeMedia				= 0x40000000,	/**< Set to access whole media, rather than partition */
+		ELocDrvDirectIO					= 0x20000000
 		};
 
 	// @see TBusLocalDrive::QueryDevice()
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/d32otgdi.h
--- a/kernel/eka/include/d32otgdi.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/d32otgdi.h	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2007-2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
@@ -348,7 +348,13 @@
 		EMessageVbusPowerDownNotPermitted	= KErrUsbOtgVbusPowerDownNotPermitted,
 		EMessageVbusClearErrorNotPermitted	= KErrUsbOtgVbusClearErrorNotPermitted,
 		EMessageHnpNotResponding			= KErrUsbOtgHnpNotResponding,
-		EMessageHnpBusDrop					= KErrUsbOtgHnpBusDrop
+		EMessageHnpBusDrop					= KErrUsbOtgHnpBusDrop,
+		
+		/**
+		Bad device attach/detach message
+		*/
+		EMessageBadDeviceAttached 			= KErrUsbOtgBadDeviceAttached,
+		EMessageBadDeviceDetached 			= KEventUsbOtgBadDeviceDetached
 		};
 
 public:
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/d32otgdi_errors.h
--- a/kernel/eka/include/d32otgdi_errors.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/d32otgdi_errors.h	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2007-2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
@@ -36,8 +36,13 @@
 const TInt KErrUsbOtgStateQueueOverflow			= -6671;
 const TInt KErrUsbOtgMessageQueueOverflow		= -6672;
 
+const TInt KErrUsbOtgBadDeviceAttached 			= -6673;
+const TInt KEventUsbOtgBadDeviceDetached 		= -6674;
+
 const TInt KErrUsbOtgBadState					= -6675;
 
+const TInt KErrUsbOtgInOPTTestingMode              = -6676;
+
 const TInt KErrUsbOtgStackNotStarted			= -6680;
 const TInt KErrUsbOtgVbusAlreadyRaised			= -6681;
 const TInt KErrUsbOtgSrpForbidden				= -6682;
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/d32usbdi.h
--- a/kernel/eka/include/d32usbdi.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/d32usbdi.h	Thu Jun 10 11:48:01 2010 +0100
@@ -180,7 +180,7 @@
 	// Some utility functions
 	//
 	inline TInt GetBusId(TUsbBusId& aBusId);
-	inline TInt HcdPageSize();
+	inline TInt GetHcdPageSize(TInt& aHcdPageSize);
 	inline TInt GetDeviceSpeed(TDeviceSpeed& aDeviceSpeed);
 
 private:
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/d32usbdi.inl
--- a/kernel/eka/include/d32usbdi.inl	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/d32usbdi.inl	Thu Jun 10 11:48:01 2010 +0100
@@ -414,11 +414,12 @@
 /**
 Returns the size of pages used by the HCD.
 @internalComponent
-@return The HCD's page size.
+@param aHcdPageSize on success provides the HCD's page size.
+@return KErrNone on success, otherwise a system-wide error code.
 */
-TInt RUsbInterface::HcdPageSize()
+TInt RUsbInterface::GetHcdPageSize(TInt& aHcdPageSize)
 	{
-	return DoControl(EHcdPageSize);
+	return DoControl(EHcdPageSize, &aHcdPageSize);
 	}
 
 /**
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/d32usbtransfers.h
--- a/kernel/eka/include/d32usbtransfers.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/d32usbtransfers.h	Thu Jun 10 11:48:01 2010 +0100
@@ -54,7 +54,7 @@
 friend class RUsbTransferStrategy;
 
 public:
-	virtual void Close();
+	IMPORT_C virtual void Close();
 
 protected:
 	RUsbTransferDescriptor(TTransferType aType, TInt aMaxSize, TInt aMaxNumPackets);
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/drivers/sdcard.h
--- a/kernel/eka/include/drivers/sdcard.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/drivers/sdcard.h	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 1999-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 1999-2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
@@ -44,6 +44,7 @@
 const TUint32 KSDSwitchFunctionHighSpeed = 0x80FFFF01;
 
 const TUint32 KSDCardIsSDCard			 = KBit16;	// KMMCardFirstCustomFlag
+const TUint32 KSDCardIsCorrupt           = KBit17;
 const TUint32 KSDCardFirstCustomFlag	 = KBit24;
 
 const TUint   KSDDTClk25MHz				 = 25000; //25000KHz
@@ -81,12 +82,16 @@
 	inline TUint32 PARootDirEnd() const;
 	inline void SetPARootDirEnd(TUint32 aPARootDirEnd);
 	virtual TUint MaxTranSpeedInKilohertz() const;
+	inline void RegisterClient();
+	inline void DeregisterClient();
+	inline TBool ClientsRegistered();
 private:
 	TUint32 iProtectedAreaSize;
 	TUint32 iPARootDirEnd;
 	TUint8	iAUSize;
 	TUint8 iPad[3];
-	TUint32 iSpare[4];
+	TUint32 iClientCountSD;
+	TUint32 iSpare[3];
 	};
 
 class TSDCardArray : public TMMCardArray
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/drivers/sdcard.inl
--- a/kernel/eka/include/drivers/sdcard.inl	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/drivers/sdcard.inl	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 1999-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 1999-2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
@@ -44,6 +44,34 @@
 inline TUint32 TSDCard::PARootDirEnd() const			{return iPARootDirEnd;}
 inline void TSDCard::SetPARootDirEnd(TUint32 aPARootDirEnd)	{iPARootDirEnd=aPARootDirEnd;}
 
+/**
+Called when a client registers with the SD card.
+*/
+inline void TSDCard::RegisterClient()
+	{
+	__e32_atomic_add_ord32(&iClientCountSD, 1);
+	}
+
+/**
+Called when a client de-registers with the SD card.
+*/	
+inline void TSDCard::DeregisterClient()
+
+	{ 
+	__e32_atomic_add_ord32(&iClientCountSD, TUint32(-1));
+	}
+
+/**
+Returned value indicates whether or not clients have registered with the SD card.
+*/
+inline TBool TSDCard::ClientsRegistered()
+	{
+	if(iClientCountSD)
+		return ETrue;
+
+	return EFalse;
+	}
+
 // ======== TSDCardArray ========
 
 inline TSDCardArray::TSDCardArray(DSDStack* aOwningStack) : TMMCardArray(aOwningStack)
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/drivers/smppower/idlehelper.h
--- a/kernel/eka/include/drivers/smppower/idlehelper.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/drivers/smppower/idlehelper.h	Thu Jun 10 11:48:01 2010 +0100
@@ -1,25 +1,20 @@
-/*
-* Copyright (c) 2008-2009 Nokia Corporation and/or its subsidiary(-ies).
-* All rights reserved.
-* This material, including documentation and any related computer
-* programs, is protected by copyright controlled by Nokia. All
-* rights are reserved. Copying, including reproducing, storing
-* adapting or translating, any or all of this material requires the
-* prior written consent of Nokia. This material also contains
-* confidential information which may not be disclosed to others
-* without the prior written consent of Nokia.
-*
-* Initial Contributors:
-* Nokia Corporation - initial contribution.
-*
-* Contributors:
-*
-* Description: 
-* os\kernelhwsrv\kernel\eka\include\drivers\smpidlehelper.h
-* Helper classes required to implement CPU idle
-* functionality in a SMP BSP.
-*
-*/
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL " http://www.eclipse.org/legal/epl-v10.html ".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// os\kernelhwsrv\kernel\eka\include\drivers\smppower\idlehelper.h
+// Helper classes required to implement CPU idle
+// functionality in a SMP BSP.
+
 
 /**
  @file
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/drivers/smppower/sample_idlehandler/smpidlehandler.h
--- a/kernel/eka/include/drivers/smppower/sample_idlehandler/smpidlehandler.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/drivers/smppower/sample_idlehandler/smpidlehandler.h	Thu Jun 10 11:48:01 2010 +0100
@@ -1,24 +1,18 @@
-/*
-* Copyright (c) 2008-2009 Nokia Corporation and/or its subsidiary(-ies).
-* All rights reserved.
-* This material, including documentation and any related computer
-* programs, is protected by copyright controlled by Nokia. All
-* rights are reserved. Copying, including reproducing, storing
-* adapting or translating, any or all of this material requires the
-* prior written consent of Nokia. This material also contains
-* confidential information which may not be disclosed to others
-* without the prior written consent of Nokia.
-*
-* Initial Contributors:
-* Nokia Corporation - initial contribution.
-*
-* Contributors:
-*
-* Description: 
-* os/kernelhwsrv/kernel/eka/include/drivers/smppower/sample_idlehandler/smpidlehandler.h
-* Example of a generic idle handler layer
-*
-*/
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL " http://www.eclipse.org/legal/epl-v10.html ".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// eka/drivers/smppower/sample_idlehandler/smpidlehandler.h
+// Example of a generic idle handler layer
 
 
 #ifndef __SMPIDLEHANDLER_H__
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/e32cmn.h
--- a/kernel/eka/include/e32cmn.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/e32cmn.h	Thu Jun 10 11:48:01 2010 +0100
@@ -5398,6 +5398,7 @@
 	IMPORT_C RArrayBase(TInt anEntrySize, TInt aMinGrowBy, TInt aKeyOffset, TInt aFactor);
 	IMPORT_C RArrayBase(TInt aEntrySize,TAny* aEntries, TInt aCount);
 	IMPORT_C void Close();
+	IMPORT_C void SetKeyOffset(TInt aKeyOffset);
 	IMPORT_C TInt Count() const;
 	IMPORT_C TAny* At(TInt anIndex) const;
 	IMPORT_C TInt Append(const TAny* anEntry);
@@ -5496,6 +5497,7 @@
 	inline RArray(TInt aMinGrowBy, TInt aKeyOffset, TInt aFactor);
 	inline RArray(TInt aEntrySize,T* aEntries, TInt aCount);
 	inline void Close();
+	inline void SetKeyOffset(TInt aKeyOffset);
 	inline TInt Count() const;
 	inline const T& operator[](TInt anIndex) const;
 	inline T& operator[](TInt anIndex);
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/e32cmn.inl
--- a/kernel/eka/include/e32cmn.inl	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/e32cmn.inl	Thu Jun 10 11:48:01 2010 +0100
@@ -51,120 +51,6 @@
 inline void RAllocator::__DbgMarkCheck(TBool aCountAll, TInt aCount, const TUint8* aFileName, TInt aLineNum)
 	{__DbgMarkCheck(aCountAll, aCount, TPtrC8(aFileName), aLineNum);}
 
-// Class RHeap
-inline RHeap::RHeap()
-	{}
-
-/**
-@return The maximum length to which the heap can grow.
-
-@publishedAll
-@released
-*/
-inline TInt RHeap::MaxLength() const
-	{return iMaxLength;}
-
-inline void RHeap::operator delete(TAny*, TAny*) 
-/**
-Called if constructor issued by operator new(TUint aSize, TAny* aBase) throws exception.
-This is dummy as corresponding new operator does not allocate memory.
-*/
-	{}
-
-
-inline TUint8* RHeap::Base() const
-/**
-Gets a pointer to the start of the heap.
-	
-Note that because of the small space overhead incurred by all allocated cells, 
-no cell will have the same address as that returned by this function.
-	
-@return A pointer to the base of the heap.
-*/
-	{return iBase;}
-
-
-
-
-inline TInt RHeap::Size() const
-/**
-Gets the current size of the heap.
-
-This is the total number of bytes committed by the host chunk. 
-It is the requested size rounded up by page size minus the size of RHeap object(116 bytes)
-minus the cell alignment overhead as shown:
-
-Size = (Rounded committed size - Size of RHeap - Cell Alignment Overhead).
-
-The cell alignment overhead varies between release builds and debug builds.
-
-Note that this value is always greater than the total space available across all allocated cells.
-	
-@return The size of the heap.
-
-@see Rheap::Available( )
-*/
-	{return iTop-iBase;}
-
-
-
-
-inline TInt RHeap::Align(TInt a) const
-/**
-@internalComponent
-*/
-	{return _ALIGN_UP(a, iAlign);}
-
-
-
-
-inline const TAny* RHeap::Align(const TAny* a) const
-/**
-@internalComponent
-*/
-	{return (const TAny*)_ALIGN_UP((TLinAddr)a, iAlign);}
-
-
-
-
-inline TBool RHeap::IsLastCell(const SCell* aCell) const
-/**
-@internalComponent
-*/
-	{return (((TUint8*)aCell) + aCell->len) == iTop;}
-
-
-
-
-#ifndef __KERNEL_MODE__
-inline void RHeap::Lock() const
-/**
-@internalComponent
-*/
-	{((RFastLock&)iLock).Wait();}
-
-
-
-
-inline void RHeap::Unlock() const
-/**
-@internalComponent
-*/
-	{((RFastLock&)iLock).Signal();}
-
-
-inline TInt RHeap::ChunkHandle() const
-/**
-@internalComponent
-*/
-	{
-	return iChunkHandle;
-	}
-#endif
-
-
-
-
 // Class TRefByValue
 template <class T>
 inline TRefByValue<T>::TRefByValue(T &aRef)
@@ -4980,6 +4866,21 @@
 
 
 template <class T>
+inline void RArray<T>::SetKeyOffset(TInt aOffset)
+/**
+Sets the offset of the ordering key within each array entry.
+
+@param aKeyOffset   The key offset.
+
+@panic USER 128, if aKeyOffset is not positive, or is not less than the 
+       size of class T, or is not a multiple of 4.
+*/
+	{RArrayBase::SetKeyOffset(aOffset);}
+
+
+
+
+template <class T>
 inline TInt RArray<T>::Count() const
 /**
 Gets the number of objects in the array.
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/e32keys.h
--- a/kernel/eka/include/e32keys.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/e32keys.h	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 1995-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 1995-2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
@@ -101,8 +101,10 @@
 	EModifierPointer3DButton1=0x02000000,/**< 3D pointer device specific modifier (button 1). */
 	EModifierPointer3DButton2=0x04000000,/**< 3D pointer device specific modifier (button 2). */
 	EModifierPointer3DButton3=0x08000000,/**< 3D pointer device specific modifier (button 3). */
-	EModifierAdvancedPointerEvent=0x10000000, /**< TPointerEvent is a TAdvancedPointerEvent.*/
-	EAllModifiers=0x1fffffff            /**< A combination of all event modifiers.*/
+	EModifierAdvancedPointerEvent=0x10000000, /**< TPointerEvent is a TAdvancedPointerEvent.*/	
+	EModifierLongKey = 0x20000000,		/**< Long key press event */
+	EModifierExternalKey = 0x40000000,	/**< Accessory key event.*/
+	EAllModifiers=0xffffffff            /**< A combination of all event modifiers.*/	
 	};
 
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/e32std.h
--- a/kernel/eka/include/e32std.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/e32std.h	Thu Jun 10 11:48:01 2010 +0100
@@ -4770,6 +4770,7 @@
     IMPORT_C static void __DbgMarkCheck(TBool aKernel, TBool aCountAll, TInt aCount, const TUint8* aFileName, TInt aLineNum);
     IMPORT_C static TUint32 __DbgMarkEnd(TBool aKernel, TInt aCount);
     IMPORT_C static void __DbgSetAllocFail(TBool aKernel, RAllocator::TAllocFail aFail, TInt aRate);
+    IMPORT_C static RAllocator::TAllocFail __DbgGetAllocFail(TBool aKernel);
     IMPORT_C static void __DbgSetBurstAllocFail(TBool aKernel, RAllocator::TAllocFail aFail, TUint aRate, TUint aBurst);
 	IMPORT_C static TUint __DbgCheckFailure(TBool aKernel);
 	IMPORT_C static void PanicUnexpectedLeave(); /**< @internalComponent */
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/e32std.inl
--- a/kernel/eka/include/e32std.inl	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/e32std.inl	Thu Jun 10 11:48:01 2010 +0100
@@ -155,13 +155,6 @@
 
 
 
-// class RHeap
-inline TInt RHeap::SetBrk(TInt aBrk)
-	{ return ((RChunk*)&iChunkHandle)->Adjust(aBrk); }
-
-
-
-
 // class TChar
 #ifndef __KERNEL_MODE__
 inline void TChar::SetChar(TUint aChar)
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/e32ver.h
--- a/kernel/eka/include/e32ver.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/e32ver.h	Thu Jun 10 11:48:01 2010 +0100
@@ -28,7 +28,7 @@
 
 const TInt KE32MajorVersionNumber=2;
 const TInt KE32MinorVersionNumber=0;
-const TInt KE32BuildVersionNumber=3085;
+const TInt KE32BuildVersionNumber=3090;
 
 const TInt KMachineConfigurationMajorVersionNumber=1;
 const TInt KMachineConfigurationMinorVersionNumber=0;
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/heap_hybrid.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/include/heap_hybrid.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,365 @@
+// Copyright (c) 1994-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// kernel\eka\include\heap_hybrid.h
+// 
+// Uses malloc (aka dlmalloc) written by Doug Lea version 2.8.4
+//
+
+#ifndef __HEAP_HYBRID_H__
+#define __HEAP_HYBRID_H__
+
+#include <e32cmn.h>
+
+#ifdef __WINS__
+#define USE_HYBRID_HEAP 0
+#else
+#define USE_HYBRID_HEAP 1
+#endif
+
+// This stuff is all temporary in order to prevent having to include dla.h from heap_hybrid.h, which causes
+// problems due to its definition of size_t (and possibly other types).  This is unfortunate but we cannot
+// pollute the namespace with these types or it will cause problems with Open C and other POSIX compatibility
+// efforts in Symbian
+
+#define NSMALLBINS        (32U)
+#define NTREEBINS         (32U)
+
+#ifndef MALLOC_ALIGNMENT
+	#define MALLOC_ALIGNMENT ((TUint)8U)
+#endif  /* MALLOC_ALIGNMENT */
+
+#define CHUNK_OVERHEAD      (sizeof(TUint))
+
+typedef unsigned int bindex_t;
+typedef unsigned int binmap_t;
+typedef struct malloc_chunk* mchunkptr;
+typedef struct malloc_segment msegment;
+typedef struct malloc_state* mstate;
+typedef struct malloc_tree_chunk* tbinptr;
+typedef struct malloc_tree_chunk* tchunkptr;
+
+struct malloc_segment {
+  TUint8*        iBase;             /* base address */
+  TUint       iSize;             /* allocated size */
+};
+
+struct malloc_state {
+	binmap_t	 iSmallMap;
+	binmap_t	 iTreeMap;
+	TUint		 iDvSize;
+	TUint		 iTopSize;
+	mchunkptr	iDv;
+	mchunkptr	iTop;
+	TUint		 iTrimCheck;
+	mchunkptr	iSmallBins[(NSMALLBINS+1)*2];
+	tbinptr		iTreeBins[NTREEBINS];
+	msegment	iSeg;
+	};
+
+class RHybridHeap : public RHeap
+	{
+
+public:
+
+	struct HeapInfo
+		{
+	    unsigned iFootprint;
+	    unsigned iMaxSize;
+	    unsigned iAllocBytes;
+	    unsigned iAllocN;
+	    unsigned iFreeBytes;
+	    unsigned iFreeN;
+		};
+
+	struct SHeapCellInfo { RHybridHeap* iHeap; TInt iTotalAlloc;	TInt iTotalAllocSize; TInt iTotalFree; TInt iLevelAlloc; SDebugCell* iStranded; };
+
+
+	/**
+    @internalComponent
+    */
+	enum TAllocatorType
+			{ESlabAllocator, EDougLeaAllocator, EPageAllocator, EFullSlab=0x80, EPartialFullSlab=0x40, EEmptySlab=0x20, ESlabSpare=0x10, ESlabMask=0xf0};
+
+
+	/**
+    @internalComponent
+    */
+	struct SWalkInfo {
+					  /**
+	                  Walk function address shall be called
+	                  */
+		TWalkFunc iFunction;
+
+					  /**
+	                  The first parameter for callback function
+	                  */
+		TAny*        iParam;
+					  /**
+	                  Pointer to RHybridHeap object
+	                  */
+		RHybridHeap* iHeap;
+		};
+
+	/**
+    @internalComponent
+    */
+	struct SConfig {
+					  /**
+	                  Required slab configuration ( bit 0=4, bit 1=8 ..
+	                  bit 13 = 56)
+	                  */
+		TUint32 iSlabBits;
+					  /**
+	                  Delayed slab threshold in bytes (0 = no threshold)
+	                  */
+		TInt   iDelayedSlabThreshold;
+					  /**
+	                  2^n is smallest size allocated in paged allocator (14-31 = 16 Kb --> )
+	                  */
+		TInt   iPagePower;
+
+		};
+
+	/**
+	@internalComponent
+
+	This structure is used by test code for configuring the allocators and obtaining information
+	from them in order to ensure they are behaving as required.  This is internal test specific
+	code and is liable to be changed without warning at any time.  You should under no circumstances
+	be using it!
+	*/
+	struct STestCommand
+		{
+		TInt	iCommand;			// The test related command to be executed
+
+		union
+			{
+			SConfig		iConfig;	// Configuration used by test code only
+			TAny*		iData;		// Extra supporting data for the test command
+			};
+		};
+
+	/**
+	@internalComponent
+
+	Commands used by test code for configuring the allocators and obtaining information them them
+	*/
+	enum TTestCommand { EGetConfig, ESetConfig, EHeapMetaData, ETestData };
+
+	virtual TAny* Alloc(TInt aSize);
+	virtual void Free(TAny* aPtr);
+	virtual TAny* ReAlloc(TAny* aPtr, TInt aSize, TInt aMode=0);
+	virtual TInt AllocLen(const TAny* aCell) const;
+#ifndef __KERNEL_MODE__	
+	virtual TInt Compress();
+	virtual void Reset();
+	virtual TInt AllocSize(TInt& aTotalAllocSize) const;
+	virtual TInt Available(TInt& aBiggestBlock) const;
+#endif	
+	virtual TInt DebugFunction(TInt aFunc, TAny* a1=NULL, TAny* a2=NULL);
+protected:
+	virtual TInt Extension_(TUint aExtensionId, TAny*& a0, TAny* a1);
+
+public:
+	TAny* operator new(TUint aSize, TAny* aBase) __NO_THROW;
+	void operator delete(TAny*, TAny*);
+	
+private:
+	TInt DoCountAllocFree(TInt& aFree);
+	TInt DoCheckHeap(SCheckInfo* aInfo);
+	void DoMarkStart();
+	TUint32 DoMarkEnd(TInt aExpected);
+	void DoSetAllocFail(TAllocFail aType, TInt aRate);
+	TBool CheckForSimulatedAllocFail();
+	void DoSetAllocFail(TAllocFail aType, TInt aRate, TUint aBurst);
+	
+	void Lock() const;
+	void Unlock() const;
+	TInt ChunkHandle() const;
+
+	RHybridHeap(TInt aChunkHandle, TInt aOffset, TInt aMinLength, TInt aMaxLength, TInt aGrowBy, TInt aAlign, TBool aSingleThread, TBool aDlOnly, TBool aUseAdjust);	
+	RHybridHeap(TInt aMaxLength, TInt aAlign=0, TBool aSingleThread=ETrue);
+	RHybridHeap();
+	
+	void Init(TInt aBitmapSlab, TInt aPagePower);
+	inline void InitBins(mstate m);
+	inline void InitTop(mstate m, mchunkptr p, TUint psize);
+    void* SysAlloc(mstate m, TUint nb);
+	int SysTrim(mstate m, TUint pad);
+	void* TmallocLarge(mstate m, TUint nb);
+	void* TmallocSmall(mstate m, TUint nb);
+	/*MACROS converted functions*/
+	static inline void UnlinkFirstSmallChunk(mstate M,mchunkptr B,mchunkptr P,bindex_t& I);
+	static inline void InsertSmallChunk(mstate M,mchunkptr P, TUint S);
+	static inline void InsertChunk(mstate M,mchunkptr P,TUint S);
+	static inline void UnlinkLargeChunk(mstate M,tchunkptr X);
+	static inline void UnlinkSmallChunk(mstate M, mchunkptr P,TUint S);
+	static inline void UnlinkChunk(mstate M, mchunkptr P, TUint S);
+	static inline void ComputeTreeIndex(TUint S, bindex_t& I);
+	static inline void InsertLargeChunk(mstate M,tchunkptr X,TUint S);
+	static inline void ReplaceDv(mstate M, mchunkptr P, TUint S);
+	static inline void ComputeBit2idx(binmap_t X,bindex_t& I);
+
+	void DoComputeTreeIndex(TUint S, bindex_t& I);	
+	void DoCheckAnyChunk(mstate m, mchunkptr p);
+	void DoCheckTopChunk(mstate m, mchunkptr p);
+	void DoCheckInuseChunk(mstate m, mchunkptr p);
+	void DoCheckFreeChunk(mstate m, mchunkptr p);
+	void DoCheckMallocedChunk(mstate m, void* mem, TUint s);
+	void DoCheckTree(mstate m, tchunkptr t);
+	void DoCheckTreebin(mstate m, bindex_t i);
+	void DoCheckSmallbin(mstate m, bindex_t i);
+	TInt BinFind(mstate m, mchunkptr x);
+	TUint TraverseAndCheck(mstate m);
+	void DoCheckMallocState(mstate m);	
+	
+	TInt GetInfo(struct HeapInfo* i, SWalkInfo* wi=NULL) const;	
+	void InitDlMalloc(TUint capacity, int locked);
+	void* DlMalloc(TUint);
+	void  DlFree(void*);
+	void* DlRealloc(void*, TUint, TInt);
+	TUint DlInfo(struct HeapInfo* i, SWalkInfo* wi) const;
+	void DoCheckCommittedSize(TInt aNPages, mstate aM);	
+	
+	TAny* ReAllocImpl(TAny* aPtr, TInt aSize, TInt aMode);
+	void Construct(TBool aSingleThread, TBool aDLOnly, TBool aUseAdjust, TInt aAlign);
+#ifndef __KERNEL_MODE__	
+	TInt ConstructLock(TUint32 aMode);
+#endif	
+	static void Walk(SWalkInfo* aInfo, TAny* aBfr, TInt aLth, TCellType aBfrType, TAllocatorType aAlloctorType);
+	static void WalkCheckCell(TAny* aPtr, TCellType aType, TAny* aCell, TInt aLen);
+	void* Map(void* p, TInt sz);
+	void Unmap(void* p,TInt sz);
+
+private:
+	TInt iMinLength;
+	TInt iOffset;				// offset of RHeap object from chunk base
+	TInt iGrowBy;
+	TInt iMinCell;
+	TInt iPageSize;
+
+	// Temporarily commented out and exported from RHeap to prevent source breaks from req417-52840.
+	// This will be moved with another REQ after submission and subsequent fixing of bad code
+	//TInt iNestingLevel;
+	TInt iAllocCount;
+	// Temporarily commented out.  See comment above regarding req417-52840 source breaks
+	//TAllocFail iFailType;
+	TInt iFailRate;
+	TBool iFailed;
+	TInt iFailAllocCount;
+	TInt iRand;
+	// Temporarily commented out.  See comment above regarding req417-52840 source breaks
+	//TAny* iTestData;
+
+	TInt iChunkSize;				
+	TInt iHighWaterMark;
+	TBool iUseAdjust;
+	TBool iDLOnly;
+
+	malloc_state iGlobalMallocState;
+	
+#ifdef __KERNEL_MODE__
+	
+	friend class RHeapK;
+	
+#else
+	
+	friend class UserHeap;
+	friend class HybridHeap;
+	friend class TestHybridHeap;
+	
+private:
+
+	static void TreeRemove(slab* s);
+	static void TreeInsert(slab* s,slab** r);
+
+	enum {EOkBits = (1<<(MAXSLABSIZE>>2))-1};
+	
+	void SlabInit();
+	void SlabConfig(unsigned slabbitmap);
+	void* SlabAllocate(slabset& allocator);
+	void SlabFree(void* p);
+	void* AllocNewSlab(slabset& allocator);
+	void* AllocNewPage(slabset& allocator);
+	void* InitNewSlab(slabset& allocator, slab* s);
+	void FreeSlab(slab* s);
+	void FreePage(page* p);
+	void SlabInfo(struct HeapInfo* i, SWalkInfo* wi) const;
+	static void SlabFullInfo(slab* s, struct HeapInfo* i, SWalkInfo* wi);
+	static void SlabPartialInfo(slab* s, struct HeapInfo* i, SWalkInfo* wi);
+	static void SlabEmptyInfo(slab* s, struct HeapInfo* i, SWalkInfo* wi);
+	static void TreeWalk(slab* const* root, void (*f)(slab*, struct HeapInfo*, SWalkInfo*), struct HeapInfo* i, SWalkInfo* wi);
+
+	static void WalkPartialFullSlab(SWalkInfo* aInfo, slab* aSlab, TCellType aBfrType, TInt aLth);
+	static void WalkFullSlab(SWalkInfo* aInfo, slab* aSlab, TCellType aBfrType, TInt aLth);
+	void DoCheckSlab(slab* aSlab, TAllocatorType aSlabType, TAny* aBfr=NULL);
+	void DoCheckSlabTrees();	
+	void DoCheckSlabTree(slab** aS, TBool aPartialPage);
+	void BuildPartialSlabBitmap(TUint32* aBitmap, slab* aSlab, TAny* aBfr=NULL);
+	
+	static inline unsigned SlabHeaderFree(unsigned h) 
+	{return (h&0x000000ff);}
+	static inline unsigned SlabHeaderPagemap(unsigned h) 
+	{return (h&0x00000f00)>>8;}
+	static inline unsigned SlabHeaderSize(unsigned h) 
+	{return (h&0x0003f000)>>12;}
+	static inline unsigned SlabHeaderUsedm4(unsigned h) 
+	{return (h&0x0ffc0000)>>18;}
+	/***paged allocator code***/
+	void PagedInit(TInt aPagePower);
+	void* PagedAllocate(unsigned size);
+	void PagedFree(void* p);	
+	void* PagedReallocate(void* p, unsigned size, TInt mode);
+	
+	bool PagedEncode(unsigned pos, unsigned npage);
+	unsigned PagedDecode(unsigned pos) const;
+	inline unsigned PagedSize(void* p) const;
+	inline bool PagedSetSize(void* p, unsigned size);
+	inline void PagedZapSize(void* p, unsigned size);
+	inline void* Bitmap2addr(unsigned pos) const;
+	void PagedInfo(struct HeapInfo* i, SWalkInfo* wi) const;
+	void ResetBitmap();
+	TBool CheckBitmap(void* aBfr, TInt aSize, TUint32& aDummy, TInt& aNPages);	
+	
+private:
+	paged_bitmap iPageMap;							// bitmap representing page allocator's pages
+	TUint8*		iMemBase;							// bottom of paged/slab memory (chunk base)
+	TUint8		iBitMapBuffer[MAXSMALLPAGEBITS>>3];	// buffer for initial page bitmap
+	TInt		iSlabThreshold;						// allocations < than this are done by the slab allocator
+	TInt		iPageThreshold;						// 2^n is smallest cell size allocated in paged allocator
+	TInt		iSlabInitThreshold;					// slab allocator will be used after chunk reaches this size
+	TUint32		iSlabConfigBits;					// set of bits that specify which slab sizes to use
+	slab*		iPartialPage;						// partial-use page tree
+	slab*		iFullSlab;							// full slabs list (so we can find them when walking)
+	page*		iSparePage;							// cached, to avoid kernel exec calls for unmapping/remapping
+	TUint8		iSizeMap[(MAXSLABSIZE>>2)+1];		// index of slabset indexes based on size class
+	slabset		iSlabAlloc[MAXSLABSIZE>>2];			// array of pointers to slabsets
+
+#endif // __KERNEL_MODE__	
+};
+
+#define HEAP_ASSERT(x) __ASSERT_DEBUG(x, HEAP_PANIC(ETHeapBadCellAddress))
+
+template <class T> inline T Floor(const T addr, unsigned aln)
+{return T((unsigned(addr))&~(aln-1));}
+template <class T> inline T Ceiling(T addr, unsigned aln)
+{return T((unsigned(addr)+(aln-1))&~(aln-1));}
+template <class T> inline unsigned LowBits(T addr, unsigned aln)
+{return unsigned(addr)&(aln-1);}
+template <class T1, class T2> inline int PtrDiff(const T1* a1, const T2* a2)
+{return reinterpret_cast<const unsigned char*>(a1) - reinterpret_cast<const unsigned char*>(a2);}
+template <class T> inline T Offset(T addr, unsigned ofs)
+{return T(unsigned(addr)+ofs);}
+
+#endif //__HEAP_HYBRID_H__
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/kernel/cache.h
--- a/kernel/eka/include/kernel/cache.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/kernel/cache.h	Thu Jun 10 11:48:01 2010 +0100
@@ -126,10 +126,40 @@
 	On SMP platforms, it only maintains internal cache of the CPU that executes the call.
 	Cache memory common to the all cores (like external cache controllers) are also synchronised.
 	@pre Interrupts must be disabled.
+	@deprecated in TB 10.1 Use Cache::CpuRetires and Cache::KernelRetires
 	*/
 	IMPORT_C static void AtomicSyncMemory();
 
 	/**
+	Synchronises cache(s) of the current CPU with the next memory level (which may also be cache)
+	prior to power off or reboot. Caches in other CPUs and those that are shared among them are not affected.
+
+	Shut down or reboot sequence should ensure that the context of cache memories is copied down to the main
+	memory prior CPU/cache power off. In order to achieve this goal, the following should be obeyed:
+	 - On SMP H/W, any CPU that is about to shut down or reboot should call this method. The very last
+	   running CPU should call both this method and Cache::KernelRetires method.
+	 - On non-SMP H/W. CPU that is about to shut down or reboot should call this method. Call to
+	   Cache::KernelRetires is not required.
+
+	Both Cache::CpuRetires and Cache::KernelRetires assume that Kernel may not be in stable state (as reboot may
+	be caused by crash), so no attampt will be made to acquire spin lock or call any other Kernel interface.
+
+	@see Cache::KernelRetires
+	@pre Interrupts must be disabled.
+	@pre Kernel may not be in stable state.
+	*/
+	IMPORT_C static void CpuRetires();
+
+	/*
+	Synchronises cache(s) that are shared among CPUs with the main memory prior to power off or reboot.
+	@see Cache::CpuRetires
+	@pre Interrupts must be disabled.
+	@pre Kernel may not be in stable state.
+	@pre All CPUs other than the current CPU are powered down or their reboot sequence is completed.
+	*/
+	IMPORT_C static void KernelRetires();
+	
+	/**
 	Synchronises cache(s) prior to a DMA write (memory to HW DMA transfer) operation.
 
 	The purpose of SyncMemoryBeforeDmaWrite is to make sure that the main memory is synchronised 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/kernel/cache_maintenance.h
--- a/kernel/eka/include/kernel/cache_maintenance.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/kernel/cache_maintenance.h	Thu Jun 10 11:48:01 2010 +0100
@@ -301,7 +301,9 @@
 /*
  * Cleans and invalidates the entire content of data and unified cache(s) and drains
  * write buffers (DSB barrier)..
- * On SMP, only the running core is maintained. 
+ * On SMP, only the running core is maintained.
+ * This methos is called during reboot or power down sequence and therefore is not allowed
+ * to do Kernel calls that may hold spin lock - such as Kern::Print or precondition checkings.
  */
 	static void CleanAndInvalidate_DCache_All();
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/kernel/kerncorestats.h
--- a/kernel/eka/include/kernel/kerncorestats.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/kernel/kerncorestats.h	Thu Jun 10 11:48:01 2010 +0100
@@ -1,7 +1,7 @@
 // Copyright (c) 1994-2009 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
-// under the terms of "Eclipse Public License v1.0"
+// under the terms of the License "Eclipse Public License v1.0"
 // which accompanies this distribution, and is available
 // at the URL "http://www.eclipse.org/legal/epl-v10.html".
 //
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/memmodel/epoc/platform.h
--- a/kernel/eka/include/memmodel/epoc/platform.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/memmodel/epoc/platform.h	Thu Jun 10 11:48:01 2010 +0100
@@ -382,6 +382,7 @@
 	IMPORT_C static TInt ZoneAllocPhysicalRam(TUint* aZoneIdList, TUint aZoneIdCount, TInt aNumPages, TPhysAddr* aPageList);
 	IMPORT_C static TInt FreePhysicalRam(TPhysAddr aPhysAddr, TInt aSize);
 	IMPORT_C static TInt FreePhysicalRam(TInt aNumPages, TPhysAddr* aPageList);
+	IMPORT_C static TInt FreeRamZone(TUint aZoneId);
 	IMPORT_C static TInt ClaimPhysicalRam(TPhysAddr aPhysAddr, TInt aSize);
 	IMPORT_C static TPhysAddr LinearToPhysical(TLinAddr aLinAddr);
 	IMPORT_C static void RomProcessInfo(TProcessCreateInfo& aInfo, const TRomImageHeader& aRomImageHeader);	/**< @internalComponent */
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/page_alloc.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/include/page_alloc.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,44 @@
+// Copyright (c) 1994-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// kernel\eka\include\page_alloc.h
+// 
+//
+
+#ifndef __KERNEL_MODE__ 
+
+const int MAXSMALLPAGEBITS = 68<<3;
+#define MINPAGEPOWER	PAGESHIFT+2
+
+struct paged_bitmap
+{
+	public:
+		inline paged_bitmap() : iBase(0), iNbits(0) {}
+		void Init(unsigned char* p, unsigned size, unsigned bit);
+//
+		inline unsigned char* Addr() const;
+		inline unsigned Size() const;
+//
+		inline void Set(unsigned ix, unsigned bit);
+		inline unsigned operator[](unsigned ix) const;
+		bool Is(unsigned ix, unsigned len, unsigned bit) const;
+		void Set(unsigned ix, unsigned len, unsigned val);
+		void Setn(unsigned ix, unsigned len, unsigned bit);
+		unsigned Bits(unsigned ix, unsigned len) const;	// little endian
+		int Find(unsigned start, unsigned bit) const;
+	private:
+		unsigned char* iBase;
+		unsigned iNbits;
+};
+
+#endif  // __KERNEL_MODE__
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/slab.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernel/eka/include/slab.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,101 @@
+// Copyright (c) 1994-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// kernel\eka\include\slab.h
+// 
+//
+
+#ifndef __KERNEL_MODE__
+
+class slab;
+class slabhdr;
+#define MAXSLABSIZE		56
+#define	PAGESHIFT		12
+#define PAGESIZE		(1<<PAGESHIFT)
+#define	SLABSHIFT		10
+#define	SLABSIZE		(1 << SLABSHIFT)
+#define CELLALIGN		8
+
+
+const unsigned slabfull  = 0;
+const TInt	slabsperpage = (int)(PAGESIZE/SLABSIZE);
+#define HIBIT(bits) (((unsigned)bits & 0xc) ? 2 + ((unsigned)bits>>3) : ((unsigned) bits>>1))
+
+#define LOWBIT(bits)	(((unsigned) bits&3) ? 1 - ((unsigned)bits&1) : 3 - (((unsigned)bits>>2)&1))
+
+#define ZEROBITS(header)	(((unsigned)header & 0x70000000) ? 0 : 1)
+
+class slabhdr
+{
+	public:
+		unsigned iHeader;
+		// made up of
+		// bits   |    31    | 30..28 | 27..18 | 17..12 |  11..8  |   7..0   |
+		//        +----------+--------+--------+--------+---------+----------+
+		// field  | floating |  zero  | used-4 |  size  | pagemap | free pos |
+		//
+		slab** iParent;		// reference to iParent's pointer to this slab in tree
+		slab* iChild1;		// 1st iChild in tree
+		slab* iChild2;		// 2nd iChild in tree
+};
+
+const TInt KMaxSlabPayload = SLABSIZE - sizeof(slabhdr);
+#define MAXUSEDM4BITS   0x0fc00000
+#define FLOATING_BIT    0x80000000
+
+inline unsigned HeaderFloating(unsigned h)
+{return (h&0x80000000);}
+const unsigned maxuse = (SLABSIZE - sizeof(slabhdr))>>2;
+const unsigned firstpos = sizeof(slabhdr)>>2;
+
+#ifdef _DEBUG
+#define CHECKTREE(x) DoCheckSlabTree(x,EFalse)
+#define CHECKSLAB(s,t,p) DoCheckSlab(s,t,p)
+#define CHECKSLABBFR(s,p) {TUint32 b[4]; BuildPartialSlabBitmap(b,s,p);}
+#else
+#define CHECKTREE(x) (void)0
+#define CHECKSLAB(s,t,p) (void)0
+#define CHECKSLABBFR(s,p) (void)0
+#endif
+
+class slabset
+{
+	public:
+		slab* iPartial;
+};
+
+class slab : public slabhdr
+{
+	public:
+		void Init(unsigned clz);
+		//static slab* SlabFor( void* p);
+		static slab* SlabFor(const void* p) ;
+		unsigned char iPayload[SLABSIZE-sizeof(slabhdr)];
+};
+
+class page
+{
+	public:
+		inline static page* PageFor(slab* s);
+		//slab iSlabs;
+		slab iSlabs[slabsperpage];
+};
+
+
+inline page* page::PageFor(slab* s)
+{
+	return reinterpret_cast<page*>((unsigned(s))&~(PAGESIZE-1));
+}
+
+
+#endif   // __KERNEL_MODE__
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/include/u32std.h
--- a/kernel/eka/include/u32std.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/include/u32std.h	Thu Jun 10 11:48:01 2010 +0100
@@ -401,7 +401,7 @@
 	};
 
 /** @test */
-enum TKernelHeapDebugFunction {EDbgMarkStart,EDbgMarkCheck,EDbgMarkEnd,EDbgSetAllocFail,EDbgSetBurstAllocFail,EDbgCheckFailure};
+enum TKernelHeapDebugFunction {EDbgMarkStart,EDbgMarkCheck,EDbgMarkEnd,EDbgSetAllocFail,EDbgSetBurstAllocFail,EDbgCheckFailure,EDbgGetAllocFail};
 
 /** @test */
 class TKernelHeapMarkCheckInfo
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/kernel/arm/cache.cpp
--- a/kernel/eka/kernel/arm/cache.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/kernel/arm/cache.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -70,8 +70,10 @@
 
 EXPORT_C void Cache::AtomicSyncMemory()
 	{
-	CHECK_PRECONDITIONS(MASK_INTERRUPTS_DISABLED,"Cache::AtomicSyncMemory");				
-	__KTRACE_OPT(KMMU,Kern::Printf("Cache::AtomicSyncMemory"));
+	// This methos is called during reboot or power down sequence and therefore is not allowed
+	// to do Kernel calls that may hold spin lock - such as Kern::Print or precondition checkings.
+	// CHECK_PRECONDITIONS(MASK_INTERRUPTS_DISABLED,"Cache::AtomicSyncMemory");				
+	// __KTRACE_OPT(KMMU,Kern::Printf("Cache::AtomicSyncMemory"));
 
 	InternalCache::CleanAndInvalidate_DCache_All();
 
@@ -80,6 +82,29 @@
 #endif //__HAS_EXTERNAL_CACHE__
 	}
 
+EXPORT_C void Cache::CpuRetires()
+	{
+	// This methos is called during reboot or power down sequence and therefore is not allowed
+	// to do Kernel calls that may hold spin lock - such as Kern::Print or precondition checkings.
+	// CHECK_PRECONDITIONS(MASK_INTERRUPTS_DISABLED,"Cache::CpuRetires");				
+
+	InternalCache::CleanAndInvalidate_DCache_All();
+
+#if  !defined(__SMP__) & defined(__HAS_EXTERNAL_CACHE__)
+	ExternalCache::AtomicSync();
+#endif	
+	}
+
+EXPORT_C void Cache::KernelRetires()
+	{
+	// This methos is called during reboot or power down sequence and therefore is not allowed
+	// to do Kernel calls that may hold spin lock - such as Kern::Print or precondition checkings.
+	// CHECK_PRECONDITIONS(MASK_INTERRUPTS_DISABLED,"Cache::KernelRetires");				
+
+#if  defined(__SMP__) & defined(__HAS_EXTERNAL_CACHE__)
+	ExternalCache::AtomicSync();
+#endif
+	}
 
 EXPORT_C TInt Cache::GetThresholds(TCacheThresholds& aThresholds, TUint aCacheType)
 	{
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/kernel/arm/cache_external.cpp
--- a/kernel/eka/kernel/arm/cache_external.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/kernel/arm/cache_external.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -313,21 +313,24 @@
 
 void ExternalCache::AtomicSync()
 	{
-	CHECK_PRECONDITIONS(MASK_INTERRUPTS_DISABLED,"ExternalCache::AtomicSync");
-	__KTRACE_OPT(KMMU,Kern::Printf("ExternalCache::AtomicSync"));
-
+	// This methos is called during reboot or power down sequence and therefore is not allowed
+	// to do Kernel calls that may hold spin lock - such as Kern::Print or precondition checkings.
+	// CHECK_PRECONDITIONS(MASK_INTERRUPTS_DISABLED,"ExternalCache::AtomicSync");
+	// __KTRACE_OPT(KMMU,Kern::Printf("ExternalCache::AtomicSync"));
 #if defined(__ARM_PL310_CACHE__)
-	// On Pl310, we hold the lock while maintaining cache. Therefore, we cannot
-	// do that on a way basis as it takes too long to complete.
-	// This will also ensure that PL310 erratum 727915 is sorted out.
-
-#if defined(__ARM_PL310_ERRATUM_588369_FIXED)
-	Maintain_All((TInt*)(Base+ARML2C_CleanInvalidateByIndexWay));
-#else //defined(__ARM_PL310_ERRATUM_588369_FIXED)
-	//CleanAndInvalidate is broken. Just clean it.
-	Maintain_All((TInt*)(Base+ARML2C_CleanByIndexWay));
-#endif //else defined(__ARM_PL310_ERRATUM_588369_FIXED)
-	
+    // Do not use maintain-by-way operations on PL310 (due to erratum 727915 for example)
+    // Also, do not use ARML2C_CleanInvalidateByIndexWay (erratum 588369)
+    // Do not hold spin lock as it is assumed this is the only running CPU.
+    TInt indexNo = Info.iSize>>3; // This is the number of cache lines in each way. Assoc is always 8 in this cache
+    volatile TInt* ctrlReg = (volatile TInt*)(Base+ARML2C_CleanByIndexWay);
+    TInt way,index;
+    for (way = 0 ; way <Info.iAssoc ; way++)
+        {
+        for (index = 0 ; index <indexNo ; index++)
+            {
+            *ctrlReg = (way<<ARML2C_WayShift) | (index<<ARML2C_IndexShift); //This will maintain a single cache line
+            }
+        }
 #else //defined(__ARM_PL310_CACHE__)
 
 	#if defined (__ARM_L210_CACHE__)
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/kernel/arm/cutils.cpp
--- a/kernel/eka/kernel/arm/cutils.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/kernel/arm/cutils.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -153,9 +153,10 @@
 	{
 	if (aPhase==0)
 		{
-		Cache::AtomicSyncMemory();
+		Cache::CpuRetires();
 		return;
 		}
+	Cache::KernelRetires();
 #ifdef __SMP__
 	SFullArmRegSet* regs = SubScheduler().iSSX.iRegs;
 #else
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/kernel/kerncorestats.cpp
--- a/kernel/eka/kernel/kerncorestats.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/kernel/kerncorestats.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,7 +1,7 @@
 // Copyright (c) 1994-2009 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
-// under the terms of "Eclipse Public License v1.0"
+// under the terms of the License "Eclipse Public License v1.0"
 // which accompanies this distribution, and is available
 // at the URL "http://www.eclipse.org/legal/epl-v10.html".
 //
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/kernel/win32/cache.cpp
--- a/kernel/eka/kernel/win32/cache.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/kernel/win32/cache.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -38,6 +38,14 @@
 	{
 	}
 
+EXPORT_C void Cache::CpuRetires()
+	{
+	}
+
+EXPORT_C void Cache::KernelRetires()
+	{
+	}
+
 EXPORT_C void Cache::SyncMemoryBeforeDmaWrite(TLinAddr, TUint, TUint32)
 	{
 	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/kernel/x86/bootutil.asm
--- a/kernel/eka/kernel/x86/bootutil.asm	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/kernel/x86/bootutil.asm	Thu Jun 10 11:48:01 2010 +0100
@@ -11,7 +11,7 @@
 ;
 ; Contributors:
 ;
-; Description: General subroutines for bootstrap
+; Description: General subroutines for bootstrap
 ;
 
 LOCALS
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/kernel/x86/cache.cpp
--- a/kernel/eka/kernel/x86/cache.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/kernel/x86/cache.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -48,6 +48,14 @@
 	{
 	}
 
+EXPORT_C void Cache::CpuRetires()
+	{
+	}
+
+EXPORT_C void Cache::KernelRetires()
+	{
+	}
+
 EXPORT_C void Cache::SyncMemoryBeforeDmaWrite(TLinAddr, TUint, TUint32)
 	{
 	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/kernel/x86/cutils.cpp
--- a/kernel/eka/kernel/x86/cutils.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/kernel/x86/cutils.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -102,9 +102,10 @@
 	{
 	if (aPhase==0)
 		{
-		Cache::AtomicSyncMemory();
+		Cache::CpuRetires();
 		return;
 		}
+	Cache::KernelRetires();
 #ifdef __SMP__
 	SFullX86RegSet* regs = &(((SCpuData*)SubScheduler().iSSX.iTss)->iRegs);
 #else
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/klib/kheap.cpp
--- a/kernel/eka/klib/kheap.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/klib/kheap.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -20,7 +20,7 @@
 _LIT(KLitKernHeap,"KernHeap");
 
 RHeapK::RHeapK(TInt aInitialSize)
-	: RHeap(aInitialSize, 0, EFalse)
+	: RHybridHeap(aInitialSize, 0, EFalse)			
 	{
 	}
 
@@ -59,8 +59,7 @@
 // Create a kernel fixed heap.
 //
 	{
-
-	__ASSERT_ALWAYS(aInitialSize>KMinHeapSize, K::Fault(K::ETHeapMaxLengthNegative));
+	__ASSERT_ALWAYS(aInitialSize>(TInt)sizeof(RHeapK), K::Fault(K::ETHeapMaxLengthNegative));
 	return new(aBase) RHeapK(aInitialSize);
 	}
 
@@ -76,6 +75,20 @@
 	__ASSERT_CRITICAL;
 	}
 
+void RHybridHeap::Lock() const   
+	{
+	DMutex* m = *(DMutex**)&iLock;
+	if (m)
+		Kern::MutexWait(*m);
+	}
+
+void RHybridHeap::Unlock() const   
+	{
+	DMutex* m = *(DMutex**)&iLock;
+	if (m)
+		Kern::MutexSignal(*m);
+	}
+
 void RHeapK::Fault(TInt aFault)
 	{
 	Kern::Fault("KERN-HEAP", aFault);
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/memmodel/epoc/direct/mutils.cpp
--- a/kernel/eka/memmodel/epoc/direct/mutils.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/memmodel/epoc/direct/mutils.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -474,6 +474,32 @@
 
 
 /**
+Free a RAM zone which was previously allocated by one of these methods:
+Epoc::AllocPhysicalRam(), Epoc::ZoneAllocPhysicalRam() or 
+TRamDefragRequest::ClaimRamZone().
+
+All of the pages in the RAM zone must be allocated and only via one of the methods 
+listed above, otherwise a system panic will occur.
+
+@param	aZoneId			The ID of the RAM zone to free.
+@return	KErrNone 		If the operation was successful.
+		KErrArgument 	If a RAM zone with ID aZoneId was not found.
+
+@pre Calling thread must be in a critical section.
+@pre Interrupts must be enabled.
+@pre Kernel must be unlocked.
+@pre No fast mutex can be held.
+@pre Call in a thread context.
+@pre Can be used in a device driver.
+*/
+EXPORT_C TInt Epoc::FreeRamZone(TUint aZoneId)
+	{
+	CHECK_PRECONDITIONS(MASK_THREAD_CRITICAL,"Epoc::FreeRamZone");
+	return KErrNotSupported;
+	}
+
+
+/**
 	@pre	Call in a thread context.
 	@pre	Interrupts must be enabled.
 	@pre	Kernel must be unlocked.
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/memmodel/epoc/flexible/mmu/mcodepaging.h
--- a/kernel/eka/memmodel/epoc/flexible/mmu/mcodepaging.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/memmodel/epoc/flexible/mmu/mcodepaging.h	Thu Jun 10 11:48:01 2010 +0100
@@ -21,6 +21,6 @@
 #ifndef MCODEPAGING_H
 #define MCODEPAGING_H
 
-extern DPagingDevice* CodePagingDevice(TInt aDiveNum);
+extern DPagingDevice* CodePagingDevice(TInt aDriveNum);
 
 #endif
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/memmodel/epoc/flexible/mmu/mexport.cpp
--- a/kernel/eka/memmodel/epoc/flexible/mmu/mexport.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/memmodel/epoc/flexible/mmu/mexport.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -16,7 +16,7 @@
 #include "memmodel.h"
 #include "mm.h"
 #include "mmu.h"
-
+#include "mpager.h"
 #include "mrom.h"
 
 /**	Returns the amount of free RAM currently available.
@@ -510,6 +510,35 @@
 
 
 /**
+Free a RAM zone which was previously allocated by one of these methods:
+Epoc::AllocPhysicalRam(), Epoc::ZoneAllocPhysicalRam() or 
+TRamDefragRequest::ClaimRamZone().
+
+All of the pages in the RAM zone must be allocated and only via one of the methods 
+listed above, otherwise a system panic will occur.
+
+@param	aZoneId			The ID of the RAM zone to free.
+@return	KErrNone 		If the operation was successful.
+		KErrArgument 	If a RAM zone with ID aZoneId was not found.
+
+@pre Calling thread must be in a critical section.
+@pre Interrupts must be enabled.
+@pre Kernel must be unlocked.
+@pre No fast mutex can be held.
+@pre Call in a thread context.
+@pre Can be used in a device driver.
+*/
+EXPORT_C TInt Epoc::FreeRamZone(TUint aZoneId)
+	{
+	CHECK_PRECONDITIONS(MASK_THREAD_CRITICAL,"Epoc::FreeRamZone");
+	RamAllocLock::Lock();
+	TInt r = TheMmu.FreeRamZone(aZoneId);
+	RamAllocLock::Unlock();
+	return r;
+	}
+
+
+/**
 Allocate a specific block of physically contiguous RAM, specified by physical
 base address and size.
 If and when the RAM is no longer required it should be freed using
@@ -607,13 +636,29 @@
 	}
 
 
-#ifdef BTRACE_KERNEL_MEMORY
 void M::BTracePrime(TUint aCategory)
 	{
-	// TODO:
+	(void)aCategory;
+
+#ifdef BTRACE_KERNEL_MEMORY
+	// Must check for -1 as that is the default value of aCategory for
+	// BTrace::Prime() which is intended to prime all categories that are 
+	// currently enabled via a single invocation of BTrace::Prime().
+	if(aCategory == BTrace::EKernelMemory || (TInt)aCategory == -1)
+		{
+		NKern::ThreadEnterCS();
+		RamAllocLock::Lock();
+		BTrace4(BTrace::EKernelMemory, BTrace::EKernelMemoryInitialFree, TheSuperPage().iTotalRamSize);
+		BTrace4(BTrace::EKernelMemory, BTrace::EKernelMemoryCurrentFree, Kern::FreeRamInBytes());
+		BTrace4(BTrace::EKernelMemory, BTrace::EKernelMemoryMiscAlloc, Epoc::KernelMiscPages << KPageShift);
+		BTrace4(BTrace::EKernelMemory, BTrace::EKernelMemoryDemandPagingCache, ThePager.MinimumPageCount() << KPageShift);
+		BTrace8(BTrace::EKernelMemory, BTrace::EKernelMemoryDrvPhysAlloc, Epoc::DriverAllocdPhysRam, -1);
+		RamAllocLock::Unlock();
+		NKern::ThreadLeaveCS();
+		}
+#endif
+	TheMmu.BTracePrime(aCategory);
 	}
-#endif
-
 
 
 //
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/memmodel/epoc/flexible/mmu/mmappinglist.cpp
--- a/kernel/eka/memmodel/epoc/flexible/mmu/mmappinglist.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/memmodel/epoc/flexible/mmu/mmappinglist.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -153,6 +153,7 @@
 			iPrev = prev;
 			// flash lock...
 			__SPIN_FLASH_IRQ(iSpinLock);
+			flash = 0;
 			// remove iterator again...
 			next = iNext;
 			prev = iPrev;
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/memmodel/epoc/flexible/mmu/mmappinglist.h
--- a/kernel/eka/memmodel/epoc/flexible/mmu/mmappinglist.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/memmodel/epoc/flexible/mmu/mmappinglist.h	Thu Jun 10 11:48:01 2010 +0100
@@ -206,23 +206,15 @@
 	/**
 	Update the page table entry for a specified page in all mappings in the list that contain it.
 
-	@param aPages				The page array entry of the page in a memory object. 
+	@param aPageArray			The page array entry of the page in a memory object. 
 								Only array entries which have a target state of 
 								RPageArray::ECommitted should be mapped into the 
 								mapping's page tables.
-
 	@param aIndex				The index of the page in the memory object.
-
-	@param aMapInstanceCount	The instance of this mapping which is to be updated.
-								Whenever this no longer matches the current #MapInstanceCount
-								the function must not update any more of the mapping's
-								page table entries, (but must still return KErrNone).
-
-	@param	aInvalidateTLB		Set to ETrue when the TLB entries associated with this page
+	@param aInvalidateTLB		Set to ETrue when the TLB entries associated with this page
 								should be invalidated.  This must be done when there is 
 								already a valid pte for this page, i.e. if the page is still 
 								mapped.
-
 	@see #DMemoryMappingBase::RemapPage
 	*/
 	void RemapPage(TPhysAddr& aPageArray, TUint aIndex, TBool aInvalidateTLB);	
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/memmodel/epoc/flexible/mmu/mpagearray.cpp
--- a/kernel/eka/memmodel/epoc/flexible/mmu/mpagearray.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/memmodel/epoc/flexible/mmu/mpagearray.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -258,7 +258,7 @@
 	}
 
 
-void RPageArray::TIter::Add(TUint aCount, TPhysAddr* aPages)
+void RPageArray::TIter::Add(TUint aCount, const TPhysAddr* aPages)
 	{
 	// MmuLock NOT required because...
 	// 1. AddStart has ensured all segments are allocated and locked (so they can't be deleted)
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/memmodel/epoc/flexible/mmu/mpagearray.h
--- a/kernel/eka/memmodel/epoc/flexible/mmu/mpagearray.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/memmodel/epoc/flexible/mmu/mpagearray.h	Thu Jun 10 11:48:01 2010 +0100
@@ -543,7 +543,7 @@
 		@param aCount		The number of pages to add.
 		@param aPages		Pointer to list of \a aCount physical page addresses to add.
 		*/
-		void Add(TUint aCount, TPhysAddr* aPages);
+		void Add(TUint aCount, const TPhysAddr* aPages);
 
 		/**
 		Add contiguous pages to the array, setting each entry state as ECommitted.
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/memmodel/epoc/flexible/mmu/mpagecleaner.cpp
--- a/kernel/eka/memmodel/epoc/flexible/mmu/mpagecleaner.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/memmodel/epoc/flexible/mmu/mpagecleaner.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,7 +1,7 @@
-// Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
-// under the terms of "Eclipse Public License v1.0"
+// under the terms of the License "Eclipse Public License v1.0"
 // which accompanies this distribution, and is available
 // at the URL "http://www.eclipse.org/legal/epl-v10.html".
 //
@@ -30,8 +30,8 @@
 
 const TInt KThreadPriority = 25;
 
-// The length of time the paging device is idle before we decide to use it for cleaning dirty
-// pages, in milliseconds.
+/// The length of time the paging device is idle before we decide to use it for cleaning dirty
+/// pages, in milliseconds.
 const TInt KIdleDelayInMillis = 2;
 
 class DPageCleaner
@@ -63,13 +63,13 @@
 
 	// All state below is accessed with the MmuLock held.
 
-	// Whether the paging device is currently idle.
+	/// Whether the paging device is currently idle.
 	TBool iPagingDeviceIdle;
 
-	// Whether the paging device has been idle for longer than the wait period.
+	/// Whether the paging device has been idle for longer than the wait period.
 	TBool iIdleForAWhile;
 	
-	// Whether the page cleaner is currently running.
+	/// Whether the page cleaner is currently running.
 	TBool iCleaningInProgress;	
 	};
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/memmodel/epoc/flexible/mmu/mpagecleaner.h
--- a/kernel/eka/memmodel/epoc/flexible/mmu/mpagecleaner.h	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/memmodel/epoc/flexible/mmu/mpagecleaner.h	Thu Jun 10 11:48:01 2010 +0100
@@ -1,7 +1,7 @@
-// Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
-// under the terms of "Eclipse Public License v1.0"
+// under the terms of the License "Eclipse Public License v1.0"
 // which accompanies this distribution, and is available
 // at the URL "http://www.eclipse.org/legal/epl-v10.html".
 //
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/memmodel/epoc/flexible/mmu/mpdalloc.cpp
--- a/kernel/eka/memmodel/epoc/flexible/mmu/mpdalloc.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/memmodel/epoc/flexible/mmu/mpdalloc.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -134,7 +134,14 @@
 	RamAllocLock::Lock();
 	TInt r = m.AllocContiguousRam(pdPhys, KLocalPdPages, KLocalPdShift-KPageShift, iPageDirectoryMemory->RamAllocFlags());
 	if(r==KErrNone)
+		{
 		AssignPages(offset>>KPageShift,KLocalPdPages,pdPhys);
+
+#ifdef BTRACE_KERNEL_MEMORY
+		BTrace4(BTrace::EKernelMemory, BTrace::EKernelMemoryMiscAlloc, KLocalPdPages << KPageShift);
+		Epoc::KernelMiscPages += KLocalPdPages;
+#endif
+		}
 	RamAllocLock::Unlock();
 
 	if(r==KErrNone)
@@ -147,6 +154,11 @@
 			{
 			RamAllocLock::Lock();
 			m.FreeContiguousRam(pdPhys,KLocalPdPages);
+
+#ifdef BTRACE_KERNEL_MEMORY
+			BTrace4(BTrace::EKernelMemory, BTrace::EKernelMemoryMiscFree, KLocalPdPages << KPageShift);
+			Epoc::KernelMiscPages -= KLocalPdPages;
+#endif
 			RamAllocLock::Unlock();
 			}
 		else
@@ -206,6 +218,11 @@
 	Mmu& m = TheMmu;
 	// Page directories are fixed.
 	m.FreeRam(pages, KLocalPdPages, EPageFixed);
+
+#ifdef BTRACE_KERNEL_MEMORY
+	BTrace4(BTrace::EKernelMemory, BTrace::EKernelMemoryMiscFree, KLocalPdPages << KPageShift);
+	Epoc::KernelMiscPages -= KLocalPdPages;
+#endif
 	RamAllocLock::Unlock();
 	}
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/memmodel/epoc/flexible/mmu/mvalloc.cpp
--- a/kernel/eka/memmodel/epoc/flexible/mmu/mvalloc.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/memmodel/epoc/flexible/mmu/mvalloc.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -688,7 +688,7 @@
 
 RVirtualAllocSlabSet* RVirtualAllocSlabSet::New(RVirtualAllocator* aAllocator, TUint aNumSlabTypes, DMutex*& aWriteLock)
 	{
-	TUint size = sizeof(RVirtualAllocSlabSet)+sizeof(((RVirtualAllocSlabSet*)0x100)->iSlabs)*(aNumSlabTypes-1);
+	TUint size = sizeof(RVirtualAllocSlabSet) + sizeof(SDblQue) * (aNumSlabTypes - 1);
 	RVirtualAllocSlabSet* set = (RVirtualAllocSlabSet*)Kern::AllocZ(size);
 	if(set)
 		new (set) RVirtualAllocSlabSet(aAllocator,aNumSlabTypes,aWriteLock);
@@ -764,8 +764,9 @@
 		if(!slab)
 			return KErrNoMemory;
 		TLinAddr addr = slab->Alloc(aSizeShift);
-		if(!addr)
-			return KErrNoMemory;
+		// Shouldn't ever fail as we've just allocated an empty slab and we can't 
+		// attempt to allocate more than a whole slab.
+		__NK_ASSERT_DEBUG(addr);
 		aAddr = addr;
 		return KErrNone;
 		}
@@ -830,8 +831,8 @@
 RVirtualAllocator::~RVirtualAllocator()
 	{
 	__NK_ASSERT_DEBUG(iAllocator==0 || iAllocator->iAvail==iAllocator->iSize); // should be empty
-	Kern::Free(iAllocator);
-	Kern::Free(iSlabSet);
+	delete iAllocator;
+	delete iSlabSet;
 	}
 
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/memmodel/epoc/mmubase/defragbase.cpp
--- a/kernel/eka/memmodel/epoc/mmubase/defragbase.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/memmodel/epoc/mmubase/defragbase.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -405,7 +405,7 @@
 		BTrace4(BTrace::ERamAllocator, BTrace::ERamAllocClaimZone, zone->iId);
 #endif
 
-#ifdef BTRACE_KERNEL_MEMORY
+#if defined(BTRACE_KERNEL_MEMORY) && !defined(__MEMMODEL_FLEXIBLE__)
 		TUint size = zone->iPhysPages << M::PageShift();
 		BTrace8(BTrace::EKernelMemory, BTrace::EKernelMemoryDrvPhysAlloc, size, zone->iPhysBase);
 		Epoc::DriverAllocdPhysRam += size;
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/nkern/x86/ncutils.cpp
--- a/kernel/eka/nkern/x86/ncutils.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/nkern/x86/ncutils.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -259,7 +259,7 @@
 EXPORT_C TUint32 NKern::CpuTimeMeasFreq()
 	{
 #ifdef MONITOR_THREAD_CPU_TIME
-	return 1862000000;	// FIXME!!!!
+	return NKern::FastCounterFrequency();
 #else
 	return 0;
 #endif
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/nkernsmp/nkerns.cpp
--- a/kernel/eka/nkernsmp/nkerns.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/nkernsmp/nkerns.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -242,8 +242,8 @@
 		iCurrent = iReady;
 		iCpuAffinity = iLastCpu;
 		iEventState = (iLastCpu<<EEventCpuShift) | (iLastCpu<<EThreadCpuShift);
-		ss.SSAddEntry(this);
-		i_NThread_Initial = TRUE;
+		i_NThread_Initial = TRUE; // must set as initial before 
+		ss.SSAddEntry(this);      // adding to subsched list
 		iACount = 1;
 		ss.iInitialThread = (NThread*)this;
 		NKern::Unlock();		// now that current thread is defined
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/release.txt
--- a/kernel/eka/release.txt	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/release.txt	Thu Jun 10 11:48:01 2010 +0100
@@ -1,3 +1,60 @@
+Version 2.00.3090
+=================
+(Made by vfebvre 03/06/2010)
+
+1.	jimhofe
+	1.	MINOR_CHANGE Documentation formatting tweaks
+
+
+Version 2.00.3089
+=================
+(Made by vfebvre 01/06/2010)
+
+1.	lanerobe
+	1.	ou1cimx1#397118 Use build-in uint32 sort function
+
+
+Version 2.00.3088
+=================
+(Made by vfebvre 28/05/2010)
+
+1.	necliffo
+	1.	ou1cimx1#407499 modify medmmc to ensure format
+
+2.	lanerobe
+	1.	ou1cimx1#402843 Fix smppower .mmp files
+
+
+Version 2.00.3086
+=================
+(Made by vfebvre 27/05/2010)
+
+1.	atvamos
+	1.	ou1cimx1#376123 h2.arm4.udeb.f32test.page ROFSBUILD failed on dev-cedar build
+
+2.	vfebvre
+	1.	ou1cimx1#400806 Warnings reported by the Symbian Foundation license checker
+
+3.	garciato
+	1.	ou1cimx1#379971 Incorrect Copyright Headers in e32test\timestamp
+
+4.	djkovace
+	1.	ou1cimx1#367370 Bridge platform neither reboots nor runs crash debugger when crashed
+
+5.	martai
+	1.	ou1cimx1#399892 E32TEST T_CHUNK test failure investigation (t_chunk.cpp:885)
+
+6.	elzou
+	1.	ou1cimx1#393943 Phone reset if connect/disconnect USB mouse few times fast
+
+7.	lanerobe
+	1.	ou1cimx1#399642 Build HCR test roms in its own folder
+	2.	ou1cimx1#353110 BM_SUITE does not run on NaviEngine
+
+8.	hengrant
+	1.	ou1cimx1#377057 Trace outputs truncated data for length and position
+
+
 Version 2.00.3085
 =================
 (Made by vfebvre 18/05/2010)
diff -r 5e441a173c63 -r d9f1e5bfe28c kernel/eka/rombuild/nandtest_test_f32tests.oby
--- a/kernel/eka/rombuild/nandtest_test_f32tests.oby	Mon May 24 18:45:46 2010 +0100
+++ b/kernel/eka/rombuild/nandtest_test_f32tests.oby	Thu Jun 10 11:48:01 2010 +0100
@@ -100,7 +100,7 @@
 #else
 rofsname = dir.rofs
 #endif	//MULTIPLEROFS
-rofssize = 0x520000
+rofssize = 0x550000
 
 #ifdef PAGED_ROM
 PAGINGOVERRIDE DEFAULTPAGED
diff -r 5e441a173c63 -r d9f1e5bfe28c kernelhwsrv_info/doc_pub/kernelhwsrv_doc_pub.mrp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kernelhwsrv_info/doc_pub/kernelhwsrv_doc_pub.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,11 @@
+# component name "Kernel and Hardware Services Documentation"
+
+component	kernelhwsrv_doc_pub
+
+source	\sf\os\kernelhwsrv\kernelhwsrv_info\doc_pub\
+
+notes_source	\component_defs\release.src
+
+
+ipr E 
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kernelhwsrv_info/kernelhwsrv_metadata/kernelhwsrv_metadata.mrp
--- a/kernelhwsrv_info/kernelhwsrv_metadata/kernelhwsrv_metadata.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kernelhwsrv_info/kernelhwsrv_metadata/kernelhwsrv_metadata.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,19 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
-
 component           kernelhwsrv_metadata
 source   \sf\os\kernelhwsrv\kernelhwsrv_info\kernelhwsrv_metadata 
 source   \sf\os\kernelhwsrv\package_definition.xml
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/benchmark/bm_ldd.cpp
--- a/kerneltest/e32test/benchmark/bm_ldd.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/benchmark/bm_ldd.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -70,7 +70,7 @@
 	TInt StartTimerStampOverhead();
 	TInt RequestTimerStampOverhead();			// iRequestInterrupt() implementation
 
-	TInt SetAbsPrioirty(TInt aThreadHandle, TInt aNewPrio, TInt* aOldPrio);
+	TInt SetAbsPriority(TInt aThreadHandle, TInt aNewPrio, TInt* aOldPrio);
 
 	DMutex*			iLock;	// Shall be acquired by anyone who access the object's writable state.
 
@@ -533,9 +533,9 @@
 //
 
 //
-// The implmentation of RBMDriver::SetAbsPrioirty() call.
+// The implementation of RBMDriver::SetAbsPriority() call.
 //
-TInt DBMLChannel::SetAbsPrioirty(TInt aThreadHandle, TInt aNewPrio, TInt* aOldPrio)
+TInt DBMLChannel::SetAbsPriority(TInt aThreadHandle, TInt aNewPrio, TInt* aOldPrio)
 	{
 	NKern::LockSystem();
 	//
@@ -690,7 +690,7 @@
 			TInt newPrio;
 			TInt oldPrio;
 			umemget(&newPrio, a2, sizeof(newPrio));
-			r = SetAbsPrioirty((TInt) a1, newPrio, &oldPrio);
+			r = SetAbsPriority((TInt) a1, newPrio, &oldPrio);
 			umemput(a2, &oldPrio, sizeof(oldPrio));
 			break;
 			}
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/benchmark/bm_main.cpp
--- a/kerneltest/e32test/benchmark/bm_main.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/benchmark/bm_main.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -78,8 +78,6 @@
 #include <e32svr.h>
 #include <u32hal.h>
 
-RTest test(_L("Benchmark Suite"));
-
 //
 // The default value of the time allocated for one benchmark program.  
 //
@@ -300,7 +298,7 @@
 	User::WaitForRequest(iExitStatus);
 	CLOSE_AND_WAIT(iChild);
 	//
-	// Lower the parent thread prioirty and then restore the current one 
+	// Lower the parent thread priority and then restore the current one 
 	// to make sure that the kernel-side thread destruction DFC had a chance to complete.
 	//
 	TInt prio = BMProgram::SetAbsPriority(RThread(), iProg->iOrigAbsPriority);
@@ -362,7 +360,7 @@
 	User::WaitForRequest(iExitStatus);
 	CLOSE_AND_WAIT(iChild);
 	//
-	// Lower the parent thread prioirty and then restore the current one 
+	// Lower the parent thread priority and then restore the current one 
 	// to make sure that the kernel-side thread destruction DFC had a chance to complete.
 	//
 	TInt prio = BMProgram::SetAbsPriority(RThread(), iProg->iOrigAbsPriority);
@@ -418,15 +416,9 @@
 //
 GLDEF_C TInt E32Main()
 	{
+	RTest test(_L("Benchmark Suite"));
 	test.Title();
 
-	TInt r = UserSvr::HalFunction(EHalGroupKernel, EKernelHalNumLogicalCpus, 0, 0);
-	if (r != 1)
-		{
-		test.Printf(_L("%d CPUs detected ... test not run\n"), r);
-		return r;
-		}
-	
 	AddProperty();
 	AddThread();
 	AddIpc();
@@ -434,7 +426,7 @@
 	AddOverhead();
 	AddrtLatency();
 
-	r = User::LoadPhysicalDevice(KBMPddFileName);
+	TInt r = User::LoadPhysicalDevice(KBMPddFileName);
 	BM_ERROR(r, (r == KErrNone) || (r == KErrAlreadyExists));
 
 	r = User::LoadLogicalDevice(KBMLddFileName);
@@ -545,7 +537,7 @@
 		//
 		TBMResult* results = prog->Run(iter, &count);
 
-			// Restore the original prioirty
+			// Restore the original priority
 		BMProgram::SetAbsPriority(RThread(), prog->iOrigAbsPriority);
 
 		//
@@ -617,6 +609,9 @@
 
 void bm_assert_failed(char* aCond, char* aFile, TInt aLine)
 	{
+	RTest test(_L("Benchmark Suite Assert Failed"));
+	test.Title();
+
 	TPtrC8 fd((TUint8*)aFile);
 	TPtrC8 cd((TUint8*)aCond);
 
@@ -634,6 +629,9 @@
 
 void bm_error_detected(TInt aError, char* aCond, char* aFile, TInt aLine)
 	{
+	RTest test(_L("Benchmark Suite Error Detected"));
+	test.Title();
+
 	TPtrC8 fd((TUint8*)aFile);
 	TPtrC8 cd((TUint8*)aCond);
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/benchmark/bm_suite.h
--- a/kerneltest/e32test/benchmark/bm_suite.h	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/benchmark/bm_suite.h	Thu Jun 10 11:48:01 2010 +0100
@@ -226,7 +226,7 @@
 	KBMPriorityHigh = 60, // 60 is above all DFC 26 is below timer DFC
 	/**
 	 * Absolute priority to be used for middle-priority threads.
-	 * This is also the default prioirty - performance benchmarks are started at this prioirty.
+	 * This is also the default priority - performance benchmarks are started at this prioirty.
 	 */	
 	KBMPriorityMid = KBMPriorityHigh - 1,
 	/**
@@ -274,7 +274,7 @@
 	 */
 	TThreadFunction iChildFunc;
 	/**
-	 * The child thread absolute prioirty.
+	 * The child thread absolute priority.
 	 * Intialized by constructor.
 	 */
 	TInt			iChildPrio;
@@ -293,7 +293,7 @@
 	 * Construct a new <code>TBMSpawnArgs</code> object.
 	 *
 	 * @param aChildFunc the child entry point
-	 * @param aChildPrio the child thread absolute prioirty
+	 * @param aChildPrio the child thread absolute priority
 	 * @param aRemote if <code>ETrue</code> the child thread must be created in a separate process; 
 	 *		otherwise, the child thread must be created within the parent's process.
 	 */
@@ -343,7 +343,7 @@
 	 * 
 	 * @param aThread a handle ro the target thread.
 	 * @param aNewPrio a new absolute priority for the target thread
-	 * @return the old absolute prioirty of the target thread 
+	 * @return the old absolute priority of the target thread 
 	 */
 	static TInt SetAbsPriority(RThread aThread, TInt aNewPrio);	
 	
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/benchmark/d32bm.h
--- a/kerneltest/e32test/benchmark/d32bm.h	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/benchmark/d32bm.h	Thu Jun 10 11:48:01 2010 +0100
@@ -227,7 +227,7 @@
  * The operations are implmented as <code>KBMLdName</code> logical device by <code>KBMLddFileName</code>
  * logical device driver DLL.
  *
- * The API enables to change the absolute prioirty of a thread. 
+ * The API enables to change the absolute priority of a thread. 
  */
 class RBMDriver : public RBusLogicalChannel
 	{
@@ -243,7 +243,7 @@
 		return DoCreate(KBMLdName, TVersion(1,0,1), KNullUnit, &KBMPdName, NULL);
 		}
 	/**
-	 * Change the absolute prioirty of a thread.
+	 * Change the absolute priority of a thread.
 	 *
 	 * @param aThread a handle to the target thread
 	 * @param aNewPrio a new absolute priority for the target thread
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/benchmark/ipc.cpp
--- a/kerneltest/e32test/benchmark/ipc.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/benchmark/ipc.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -212,11 +212,11 @@
 		BMProgram(
 			aRemote 
 				? ((aPriority == KBMPriorityHigh) 
-					? _L("Client-server Framework[Remote High Prioirty Server]")
-					: _L("Client-server Framework[Remote Low Prioirty Server]"))
+					? _L("Client-server Framework[Remote High Priority Server]")
+					: _L("Client-server Framework[Remote Low Priority Server]"))
 				: ((aPriority == KBMPriorityHigh) 
-					? _L("Client-server Framework[Local High Prioirty Server]")
-					: _L("Client-server Framework[Local Low Prioirty Server]")))
+					? _L("Client-server Framework[Local High Priority Server]")
+					: _L("Client-server Framework[Local Low Priority Server]")))
 		{
 		iPriority = aPriority;
 		iRemote = aRemote;
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/benchmark/property.cpp
--- a/kerneltest/e32test/benchmark/property.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/benchmark/property.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -205,25 +205,36 @@
 
 void Property::NotificationLatencyParent(TBMResult* aResult, TBMUInt64 aIter, struct Measurement* aM)
 	{
+	TRequestStatus st1, st2;
+
 	RProperty time;
 	TInt r = time.Define(KPropBenchmarkCategory, 0, RProperty::EByteArray, KPassPolicy, KPassPolicy);
 	BM_ERROR(r, r == KErrNone);	
 	r = time.Attach(KPropBenchmarkCategory, 0);
 	BM_ERROR(r, r == KErrNone);	
+	time.Subscribe(st2);
 
 	RProperty prop;	
 	r = prop.Define(KPropBenchmarkCategory, 1, aM->iType, KPassPolicy, KPassPolicy);
 	BM_ERROR(r, r == KErrNone);	
 	r = prop.Attach(KPropBenchmarkCategory, 1);
 	BM_ERROR(r, r == KErrNone);	
+	prop.Subscribe(st1);
+
+	RSemaphore sync;
+	r = sync.CreateGlobal(_L("sync"), 0);
+	BM_ERROR(r, r == KErrNone);	
 
 	NotificationLatencyArgs sl(aM->iType, aM->iSize, aM->iRemote, aIter, aM->iSetGetType);
 	MBMChild* child = property.SpawnChild(&sl);
+
 	for (TBMUInt64 i = 0; i < aIter; ++i)
 		{
-		TRequestStatus st;
-		prop.Subscribe(st);
-		User::WaitForRequest(st);
+		sync.Signal();
+		User::WaitForRequest(st1);
+		BM_ERROR(st1.Int(), st1.Int() == KErrNone);
+		prop.Subscribe(st1);
+
 		switch(aM->iSetGetType)
 			{
 		case EOneArg:
@@ -258,12 +269,11 @@
 
 		TBMTicks now;
 		::bmTimer.Stamp(&now);
-		BM_ERROR(st.Int(), st.Int() == KErrNone);
 
-		// subscribe for the time just before Set()
-		time.Subscribe(st);
-		User::WaitForRequest(st);
-		BM_ERROR(st.Int(), st.Int() == KErrNone);
+		User::WaitForRequest(st2);
+		BM_ERROR(st2.Int(), st2.Int() == KErrNone);
+		time.Subscribe(st2);
+
 		// get the time just before Set()
 		TBMTicks propSetTime;
 		TPtr8 ptr((TUint8*) &propSetTime, sizeof(propSetTime), sizeof(propSetTime));
@@ -272,9 +282,19 @@
 
 		aResult->Cumulate(TBMTicksDelta(propSetTime, now));
 		}
+
+	prop.Cancel();
+	User::WaitForRequest(st1);
+	BM_ERROR(st1.Int(), st1.Int() == KErrCancel);
+	time.Cancel();
+	User::WaitForRequest(st2);
+	BM_ERROR(st2.Int(), st2.Int() == KErrCancel);
+
 	prop.Close();
 	time.Close();
+	sync.Close();
 	child->WaitChildExit();
+
 	r = prop.Delete(KPropBenchmarkCategory, 1);
 	BM_ERROR(r, r == KErrNone);	
 	r = time.Delete(KPropBenchmarkCategory, 0);
@@ -290,14 +310,25 @@
 		{
 		iOutBuf[j] = (TUint8)(j + 1);
 		}
+
 	RProperty time;
+	TInt r = time.Attach(KPropBenchmarkCategory, 0);
+	BM_ERROR(r, r == KErrNone);	
+
 	RProperty prop;
-	TInt r = prop.Attach(KPropBenchmarkCategory, 1);
+	r = prop.Attach(KPropBenchmarkCategory, 1);
+	BM_ERROR(r, r == KErrNone);
+
+	RSemaphore sync;
+	r = sync.OpenGlobal(_L("sync"));
 	BM_ERROR(r, r == KErrNone);	
+
 	for (TBMUInt64 i = 0; i < sl->iIterationCount; ++i)
 		{
+		sync.Wait();
 		TBMTicks propSetTime;
 		::bmTimer.Stamp(&propSetTime);
+
 		switch(sl->iSetGetType)
 			{
 		case EOneArg:
@@ -336,13 +367,16 @@
 			}
 			break;
 			}
+
 		// publish the time just before Set()
 		TPtr8 ptr((TUint8*) &propSetTime, sizeof(propSetTime), sizeof(propSetTime));
-		r = time.Set(KPropBenchmarkCategory, 0, ptr);
+		r = time.Set(ptr);
 		BM_ERROR(r, r == KErrNone);
 		}
+
 	prop.Close();
 	time.Close();
+	sync.Close();
 
 	BMProgram::SetAbsPriority(RThread(), prio);
 	return KErrNone;
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/benchmark/sync.cpp
--- a/kerneltest/e32test/benchmark/sync.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/benchmark/sync.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -272,10 +272,15 @@
 
 void Sync::SemaphoreLatencyParent(TBMResult* aResult, TBMUInt64 aIter, TBool aRemote)
 	{
+	RSemaphore slSync;
+	TInt r = slSync.CreateGlobal(_L("slSync"), 0);
+	BM_ERROR(r, r == KErrNone);	
+
 	SemaphoreLatencyArgs sl(aRemote, aIter);
 	MBMChild* child = sync.SpawnChild(&sl);
 	for (TBMUInt64 i = 0; i < aIter; ++i)
 		{
+		slSync.Signal();
 		sl.iSem.Wait();
 		TBMTicks now;
 		::bmTimer.Stamp(&now);
@@ -283,20 +288,27 @@
 		}
 	child->WaitChildExit();
 	sl.Close();
+	slSync.Close();
 	}
 
 TInt Sync::SemaphoreLatencyChild(TAny* ptr)
 	{
+	RSemaphore slSync;
+	TInt r = slSync.OpenGlobal(_L("slSync"));
+	BM_ERROR(r, r == KErrNone);	
+
 	SemaphoreLatencyArgs* sl = (SemaphoreLatencyArgs*) ptr;
 	sl->ChildOpen();
 	for (TBMUInt64 i = 0; i < sl->iIterationCount; ++i)
 		{
+		slSync.Wait();
 		TBMTicks sigTime;
 		::bmTimer.Stamp(&sigTime);		
 		sl->iSem.Signal();
 		sl->ChildSignalTime(sigTime);
 		}
 	sl->ChildClose();
+	slSync.Close();
 	return KErrNone;
 	}
 
@@ -368,11 +380,16 @@
 
 void Sync::ThreadSemaphoreLatencyParent(TBMResult* aResult, TBMUInt64 aIter, TBool aRemote)
 	{
+	RSemaphore tslSync;
+	TInt r = tslSync.CreateGlobal(_L("tslSync"), 0);
+	BM_ERROR(r, r == KErrNone);	
+
 	ThreadSemaphoreLatencyArgs sl(aRemote, aIter);
 	MBMChild* child = sync.SpawnChild(&sl);
 	for (TBMUInt64 i = 0; i < aIter; ++i)
 		{
 		sl.iStatus = KRequestPending;
+		tslSync.Signal();
 		User::WaitForRequest(sl.iStatus);
 		BM_ASSERT(sl.iStatus == KErrNone);
 		TBMTicks now;
@@ -381,14 +398,20 @@
 		}
 	child->WaitChildExit();
 	sl.Close();
+	tslSync.Close();
 	}
 
 TInt Sync::ThreadSemaphoreLatencyChild(TAny* ptr)
 	{
+	RSemaphore tslSync;
+	TInt r = tslSync.OpenGlobal(_L("tslSync"));
+	BM_ERROR(r, r == KErrNone);	
+
 	ThreadSemaphoreLatencyArgs* sl = (ThreadSemaphoreLatencyArgs*) ptr;
 	sl->ChildOpen();
 	for (TBMUInt64 i = 0; i < sl->iIterationCount; ++i)
 		{
+		tslSync.Wait();
 		TRequestStatus* sptr = sl->iStatusPtr;
 		TBMTicks sigTime;
 		::bmTimer.Stamp(&sigTime);		
@@ -396,6 +419,7 @@
 		sl->ChildSignalTime(sigTime);
 		}
 	sl->ChildClose();
+	tslSync.Close();
 	return KErrNone;
 	}
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/benchmark/thread.cpp
--- a/kerneltest/e32test/benchmark/thread.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/benchmark/thread.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -164,8 +164,10 @@
 		TInt r = child.Create(KNullDesC, Thread::KillingChild, 0x2000, NULL, NULL);
 		BM_ERROR(r, r == KErrNone);
 		child.Logon(st);
+		BMProgram::SetAbsPriority(RThread(), KBMPriorityLow);
+		child.Resume();
+		User::After(1000); // Give the child thread a chance to run - killing it too earlier can leave the heap locked
 		BMProgram::SetAbsPriority(RThread(), KBMPriorityHigh);
-		child.Resume();
 		TBMTicks t1;
 		::bmTimer.Stamp(&t1);
 		child.Kill(KErrCancel);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/buffer/Unicode, Inc License Agreement - Data Files and Software.txt
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/buffer/Unicode, Inc License Agreement - Data Files and Software.txt	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,21 @@
+                          EXHIBIT 1
+UNICODE, INC. LICENSE AGREEMENT - DATA FILES AND SOFTWARE
+
+Unicode Data Files include all data files under the directories http://www.unicode.org/Public/, http://www.unicode.org/reports/, and http://www.unicode.org/cldr/data/ . Unicode Software includes any source code published in the Unicode Standard or under the directories http://www.unicode.org/Public/, http://www.unicode.org/reports/, and http://www.unicode.org/cldr/data/.
+
+NOTICE TO USER: Carefully read the following legal agreement. BY DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING UNICODE INC.'S DATA FILES ("DATA FILES"), AND/OR SOFTWARE ("SOFTWARE"), YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE TERMS AND CONDITIONS OF THIS AGREEMENT. IF YOU DO NOT AGREE, DO NOT DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE THE DATA FILES OR SOFTWARE.
+
+COPYRIGHT AND PERMISSION NOTICE
+
+Copyright © 1991-2009 Unicode, Inc. All rights reserved. Distributed under the Terms of Use in http://www.unicode.org/copyright.html.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of the Unicode data files and any associated documentation (the "Data Files") or Unicode software and any associated documentation (the "Software") to deal in the Data Files or Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, and/or sell copies of the Data Files or Software, and to permit persons to whom the Data Files or Software are furnished to do so, provided that (a) the above copyright notice(s) and this permission notice appear with all copies of the Data Files or Software, (b) both the above copyright notice(s) and this permission notice appear in associated documentation, and (c) there is clear notice in each modified Data File or in the Software as well as in the documentation associated with the Data File(s) or Software that the data or software has been modified.
+
+THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA FILES OR SOFTWARE.
+
+Except as contained in this notice, the name of a copyright holder shall not be used in advertising or otherwise to promote the sale, use or other dealings in these Data Files or Software without prior written authorization of the copyright holder.
+
+
+--------------------------------------------------------------------------------
+
+Unicode and the Unicode logo are trademarks of Unicode, Inc., and may be registered in some jurisdictions. All other trademarks and registered trademarks mentioned herein are the property of their respective owners.
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/buffer/t_char.cpp
--- a/kerneltest/e32test/buffer/t_char.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/buffer/t_char.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,7 +1,7 @@
 // Copyright (c) 2008-2009 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
-// under the terms of "Eclipse Public License v1.0"
+// under the terms of the License "Eclipse Public License v1.0"
 // which accompanies this distribution, and is available
 // at the URL "http://www.eclipse.org/legal/epl-v10.html".
 //
@@ -370,9 +370,9 @@
 	}
 
 
-//
+//////////////////////////////////////////////
 // Test Fold, Fold(TChar::EFoldAccents), Collate, LowerCase, UpperCase
-//
+////////////////////////////////////////////
 template<class TCharType>
 GLDEF_C void TestTChar<TCharType>::Test4(TCharTypes CharType)
 	{
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/debug/t_btrace.cpp
--- a/kerneltest/e32test/debug/t_btrace.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/debug/t_btrace.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -2535,8 +2535,8 @@
 				if(Body(data)[1]==(TUint)threadtest.alloc_addr)
 					{
 					found_heap_alloc=1;
-					test_Equal(4, Body(data)[2]);
-					test_Compare(Body(data)[3], >= ,4);
+					test_Compare(Body(data)[2], >= ,4);
+					test_Equal(4, Body(data)[3]);
 					}
 				}
 			if(data[BTrace::ESubCategoryIndex]==BTrace::EHeapFree)
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/debug/t_context.cpp
--- a/kerneltest/e32test/debug/t_context.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/debug/t_context.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -408,6 +408,7 @@
 	// run again only after it is blocked on its request semaphore.
 	t.SetPriority(EPriorityMore);
 	t.Resume();
+	User::After(500000);
 
 	if (aCallback != ENoCallback)
 		{
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/debug/t_heapcorruption.cpp
--- a/kerneltest/e32test/debug/t_heapcorruption.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/debug/t_heapcorruption.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -23,116 +23,150 @@
 #include <e32base_private.h>
 #include <e32cmn.h>
 #include <e32cmn_private.h>
+#include "dla.h"
+#include "slab.h"
+#include "page_alloc.h"
+#include "heap_hybrid.h"
+
+TBool gEnableMemoryMonitor = EFalse;
+
+#ifdef _DEBUG
+const TInt KDbgHeaderSize = (TInt)RHeap::EDebugHdrSize;
+#else
+const TInt KDbgHeaderSize = 0;
+#endif
+
+/**
+Friend class of RHeapHybrid to access to hybrid heap metadata
+*/
+class TestHybridHeap
+{
+	public:
+		TBool Init();
+		TBool Check();
+		TInt  AllocLen(TAny* aBfr);
+		void  EnableHeavyMemoryMonitoring();
+		void  CorruptFreeDLBfr(TAny* aBfr);
+		void  CorruptFreeDLBfrLth(TAny* aBfr);
+		void  CorruptAllocatedDLBfrSize(TAny* aBfr);
+		TAny* CorruptAllocatedDLMemoryAddress(TAny* aBfr);		
+
+	private:
+		RHybridHeap* iHybridHeap;
+};
+
 
 
-#define __NEXT_CELL(p)				((SCell*)(((TUint8*)p)+p->len))
+TBool TestHybridHeap::Init()
+{
+	RHybridHeap::STestCommand cmd;
+	cmd.iCommand = RHybridHeap::EHeapMetaData;
+	RAllocator& heap = User::Allocator();
+	TInt ret = heap.DebugFunction(RHeap::EHybridHeap, &cmd, 0);
+	if (ret != KErrNone)
+		return EFalse;
+	iHybridHeap = (RHybridHeap*) cmd.iData;
+
+	return ETrue;
+}
+
+TBool TestHybridHeap::Check()
+{
+	if ( iHybridHeap )
+		{
+		iHybridHeap->Check();  
+		}
+
+	return EFalse;
+}
+
+TInt TestHybridHeap::AllocLen(TAny* aBfr)
+{
+	if ( iHybridHeap )
+		{
+		return iHybridHeap->AllocLen(aBfr);  
+		}
+	return 0;
+}
+
+void TestHybridHeap::EnableHeavyMemoryMonitoring()
+{
+	if ( iHybridHeap )
+		{
+		iHybridHeap->iFlags |= RAllocator::EMonitorMemory;
+		}
+
+}
+
 
-TBool gEnableMemoryMonitor = EFalse;
+void TestHybridHeap::CorruptFreeDLBfr(TAny* aBfr)
+{
+
+	if ( aBfr )
+		{
+		mchunkptr p	= MEM2CHUNK((TUint8*)aBfr-KDbgHeaderSize);
+		p->iHead |= CINUSE_BIT;
+		}
+}
+
+void TestHybridHeap::CorruptFreeDLBfrLth(TAny* aBfr)
+{
+
+	if ( aBfr )
+		{
+		mchunkptr p	= MEM2CHUNK((TUint8*)aBfr-KDbgHeaderSize);
+		p->iHead &= INUSE_BITS; // Set zero length
+		}
+}
+
+void TestHybridHeap::CorruptAllocatedDLBfrSize(TAny* aBfr)
+{
+
+	if ( aBfr )
+		{
+		mchunkptr p	= MEM2CHUNK((TUint8*)aBfr-KDbgHeaderSize);
+		TInt size = CHUNKSIZE(p);
+		size  >>= 1;  // Set double length
+		p->iHead = size | INUSE_BITS; 
+		}
+}
+
+TAny* TestHybridHeap::CorruptAllocatedDLMemoryAddress(TAny* aBfr)
+{
+
+	if ( aBfr )
+		{
+		TUint8* p = (TUint8*)aBfr;
+		p += 3;
+		aBfr = (TAny*)p;
+		}
+	return aBfr;
+}
 
 
 /**
-Test heap that will corrupt some cells to generate BTrace events.
+Heap corruption 0:
+- Allocate (DL) buffer, corrupt it and free
 */
-class RMyDummyHeap : public RHeap
-{
-public:
-	//EBadFreeCellAddress
-	void CorruptFreeMemory1()
-		{
-		SCell* f = (SCell*)&iFree;
-		f->next = (SCell*)iTop;
-		f->next += sizeof(TUint8);
-		}
-	
-	//EBadFreeCellSize
-	void CorruptFreeMemory2()
-		{
-		SCell* p = (SCell*)&iFree;
-		SCell* n = p->next; 
-		n->len = iMinCell-1;
-		}
-	
-	//EBadAllocatedCellAddress
-	void CorruptAllocatedMemory1()
-		{
-		SCell* c = (SCell*)iBase;
-		SCell* f = (SCell*)&iFree;
-		
-		f = f->next;
-		f = f->next;
-		c->len = (TInt)f->next - (TInt)c;
-		}
-	
-	//additional utilities
-	void CorruptAllocatedMemorySize(void* aAddress)
-		{
-		SCell* addres = GetAddress(aAddress);
-		SCell* c = (SCell*)iBase;
-		for(;;)
-			{
-			if(c == addres)
-				{
-				c->len = iMinCell-1;
-				break;
-				}
-			c = __NEXT_CELL(c);
-			}
-		}
-		
-	void CorruptAllocatedMemoryAddress(void* aAddress)
-		{
-		SCell* pF = &iFree;				// free cells
-		pF = pF->next;				// next free cell
-		if (!pF)
-			pF = (SCell*)iTop;	
-		SCell* addres = GetAddress(aAddress);
-		SCell* c = (SCell*)iBase;
-		for(;;)
-			{
-			if(c == addres)
-				{
-				c->len = (TInt)pF->next - (TInt)c;
-				break;
-				}
-			c = __NEXT_CELL(c);
-			}
-		}
-	
-	void EnableHeavyMemoryMonitoring()
-		{
-		iFlags |= EMonitorMemory;
-		}
-};
-
-
-/**
-Heap corruption 2:
-- Overrunning an array using memset 
-(EHeapCorruption - EBadAllocatedCellSize)
-*/
-void Memory_Corruption2()
+void Memory_Corruption0(TestHybridHeap& aHeap)
 	{
 	if(gEnableMemoryMonitor)
-		{
-		RMyDummyHeap* h = (RMyDummyHeap*)&User::Heap();
-		h->EnableHeavyMemoryMonitoring();	
-		}
+		aHeap.EnableHeavyMemoryMonitoring();	
 	
 	char* buf = new char[10];  //will be aligned to 12
 	char* buf2 = new char[10]; //will be aligned to 12
-	TInt a = User::Heap().AllocLen(buf);
-	memset(buf, 255, a+1); //memory corruption
+	TInt a = aHeap.AllocLen(buf);
+	memset(buf, 0xfc, a+a); //memory corruption
 	
 	if(!gEnableMemoryMonitor)
-			User::Heap().Check(); //force 'heap walker' to check the heap
+		aHeap.Check(); //force 'heap walker' to check the heap
 	
 	delete buf2;
-	delete buf; //when heavy monitoring is ON should send trace
+	delete buf; //when heavy monitoring is ON should send trace and panic
 	}
 
-
-//causes EBadFreeCellAddress corruption type
-void Memory_Corruption3()
+//Corrupt free DL memory and Check()
+void Memory_Corruption1(TestHybridHeap& aHeap)
 	{
 	TInt* p1 = new TInt();
 	TInt* p2 = new TInt();
@@ -144,9 +178,8 @@
 	delete p4;
 	delete p6;
 	
-	RMyDummyHeap* h = (RMyDummyHeap*)&User::Heap();
-	h->CorruptFreeMemory1();
-	User::Heap().Check();
+	aHeap.CorruptFreeDLBfr(p4);
+	aHeap.Check();  // Should panic here
 	
 	delete p5;
 	delete p3;
@@ -154,17 +187,16 @@
 	}
 
 
-//causes EBadFreeCellSize RHeap corruption type
-void Memory_Corruption4()
+//corrupt free DL buffer length 
+void Memory_Corruption2(TestHybridHeap& aHeap)
 	{
 	TInt* p1 = new TInt();
 	TInt* p2 = new TInt();
 	TInt* p3 = new TInt();
 	delete p2;
 	
-	RMyDummyHeap* h = (RMyDummyHeap*)&User::Heap();
-	h->CorruptFreeMemory2();
-	User::Heap().Check();
+	aHeap.CorruptFreeDLBfrLth(p2);
+	aHeap.Check(); // Should panic here
 	
 	delete p3;
 	
@@ -172,8 +204,8 @@
 	}
 
 
-//causes EBadAllocatedCellAddress corruption type
-void Memory_Corruption5()
+//Corrupt allocated DL buffer size
+void Memory_Corruption3(TestHybridHeap& aHeap)
 	{
 	TInt* p1 = new TInt;
 	TInt* p2 = new TInt;
@@ -186,10 +218,8 @@
 	delete p4;
 	delete p6;
 	
-	RMyDummyHeap* h = (RMyDummyHeap*)&User::Heap();
-	//h->CorruptAllocatedMemory1();
-	h->CorruptAllocatedMemoryAddress((void*)p7);
-	User::Heap().Check();
+	aHeap.CorruptAllocatedDLBfrSize(p7);
+	aHeap.Check();
 	
 	delete p7;
 	delete p5;
@@ -198,12 +228,11 @@
 	}
 
 
-void Memory_Corruption_Special1()
+void Memory_Corruption4(TestHybridHeap& aHeap)
 	{
 	char* buf = new char;
-	RMyDummyHeap* h = (RMyDummyHeap*)&User::Heap();
-	h->EnableHeavyMemoryMonitoring();
-	h->CorruptAllocatedMemoryAddress((void*)buf);
+	aHeap.EnableHeavyMemoryMonitoring();
+	buf = (char*)aHeap.CorruptAllocatedDLMemoryAddress((TAny*)buf);
 	delete buf;// should output EHeapCorruption trace
 	}
 
@@ -212,23 +241,26 @@
 //  Local Functions
 LOCAL_D TInt threadTraceHeapCorruptionTestThread(TAny* param)
 	{
+	TestHybridHeap heap;
+	heap.Init();
+	
 	TInt t = *((TInt*)param);
 	switch(t)
 		{
-		case RHeap::EBadAllocatedCellSize:
-			Memory_Corruption2();
+		case 0:  // Corrupt allocated buffer and free it
+			Memory_Corruption0(heap);
 			break;
-		case RHeap::EBadFreeCellAddress:
-			Memory_Corruption3();
+		case 1:
+			Memory_Corruption1(heap);
 			break;
-		case RHeap::EBadFreeCellSize:
-			Memory_Corruption4();
+		case 2:
+			Memory_Corruption2(heap);
 			break;
-		case RHeap::EBadAllocatedCellAddress:
-			Memory_Corruption5();
+		case 3:
+			Memory_Corruption3(heap);
 			break;
 		case 1000:
-			Memory_Corruption_Special1();
+			Memory_Corruption4(heap);
 			break;
 		default:
 			User::Invariant();
@@ -249,8 +281,8 @@
 	
 	switch(aTestType)
 		{
-		case 0: ////RHeap::EBadAllocatedCellSize with heavy monitoring enabled
-			type = RHeap::EBadAllocatedCellSize;
+		case 0: ////Corrupt allocated DL buffer and free it with heavy monitoring enabled
+			type = 0;
 			gEnableMemoryMonitor = ETrue;
 			r = thread.Create(_L("t_tbrace_heapcorruption"), threadTraceHeapCorruptionTestThread, 
 					               KDefaultStackSize, 0x2000, 0x2000, &type);
@@ -261,7 +293,7 @@
 			break;
 			
 		case 1: //RHeap::EBadFreeCellAddress:
-			type = RHeap::EBadFreeCellAddress;
+			type = 1;
 			r = thread.Create(_L("t_tbrace_heapcorruption"), threadTraceHeapCorruptionTestThread, 
 					               KDefaultStackSize, 0x2000, 0x2000, &type);
 			thread.Logon(stat);
@@ -271,7 +303,7 @@
 		break;
 		
 		case 2: //RHeap::EBadFreeCellSize:
-			type = RHeap::EBadFreeCellSize;
+			type = 2;
 			r = thread.Create(_L("t_tbrace_heapcorruption"), threadTraceHeapCorruptionTestThread, 
 			                KDefaultStackSize, 0x2000, 0x2000, &type);
 			thread.Logon(stat);
@@ -281,7 +313,7 @@
 		break;
 		
 		case 3: //RHeap::EBadAllocatedCellSize:
-			type = RHeap::EBadAllocatedCellSize;
+			type = 0;    // Without memory monitorin this time
 			r = thread.Create(_L("t_tbrace_heapcorruption"), threadTraceHeapCorruptionTestThread, 
 						               KDefaultStackSize, 0x2000, 0x2000, &type);
 			thread.Logon(stat);
@@ -291,7 +323,7 @@
 		break;
 		
 		case 4: //RHeap::EBadAllocatedCellAddress:
-			type = RHeap::EBadAllocatedCellAddress;
+			type = 3;
 			r = thread.Create(_L("t_tbrace_heapcorruption"), threadTraceHeapCorruptionTestThread, 
 						               KDefaultStackSize, 0x2000, 0x2000, &type);
 			thread.Logon(stat);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/defrag/d_ramdefrag.cpp
--- a/kerneltest/e32test/defrag/d_ramdefrag.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/defrag/d_ramdefrag.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -72,6 +72,7 @@
 	TInt ZoneAllocToMany2(TInt aZoneIndex, TInt aNumPages);
 	TInt AllocContiguous(TUint aNumBytes);
 	TInt FreeZone(TInt aNumPages);
+	TInt FreeZoneId(TUint aZoneId);
 	TInt FreeFromAllZones();
 	TInt FreeFromAddr(TInt aNumPages, TUint32 aAddr);
 	TInt PageCount(TUint aId, STestUserSidePageCount* aPageData);
@@ -389,6 +390,10 @@
 			retVal = DRamDefragFuncTestChannel::FreeZone((TInt)a1);
 			break;
 
+		case RRamDefragFuncTestLdd::EFreeZoneId:
+			retVal = DRamDefragFuncTestChannel::FreeZoneId((TUint)a1);
+			break;
+
 		case RRamDefragFuncTestLdd::EFreeFromAllZones:
 			retVal = DRamDefragFuncTestChannel::FreeFromAllZones();	
 			break;
@@ -1512,6 +1517,30 @@
 	}
 
 //
+// FreeZoneId
+//
+// Call Epoc::FreeRamZone()
+//
+TInt DRamDefragFuncTestChannel::FreeZoneId(TUint aZoneId)
+	{
+	NKern::ThreadEnterCS();
+	
+	TInt r = Epoc::FreeRamZone(aZoneId);
+	if (r == KErrNone)
+		{
+		if (iContigAddr == KPhysAddrInvalid)
+			{
+			Kern::Printf("Error some how freed a RAM zone that wasn't previously claimed");
+			NKern::ThreadLeaveCS();
+			return KErrGeneral;
+			}
+		iContigAddr = KPhysAddrInvalid;
+		}
+	NKern::ThreadLeaveCS();
+	return r;
+	}
+
+//
 // FreeFromAllZones
 //
 // Call the overloaded Epoc::FreePhysicalRam function
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/defrag/t_ramdefrag.h
--- a/kerneltest/e32test/defrag/t_ramdefrag.h	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/defrag/t_ramdefrag.h	Thu Jun 10 11:48:01 2010 +0100
@@ -139,6 +139,7 @@
 		EZoneAllocToMany2,
 		EAllocContiguous,
 		EFreeZone,
+		EFreeZoneId,
 		EFreeFromAllZones,
 		EFreeFromAddr, 
 		ECheckCancel,
@@ -224,6 +225,8 @@
 	inline TInt FreeFromAllZones()
 		{ return DoControl(EFreeFromAllZones,(TAny*)NULL, (TAny*)NULL); }
 
+	inline TInt FreeZoneId(TUint aZoneId)
+		{ return DoControl(EFreeZoneId, (TAny*)aZoneId); }
 
 	inline TInt CheckCancel(TInt aDefragType, TUint aID = 0)
 		{ 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/demandpaging/t_chunkheapcreate.cpp
--- a/kerneltest/e32test/demandpaging/t_chunkheapcreate.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/demandpaging/t_chunkheapcreate.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -64,10 +64,9 @@
 	UpdatePaged(aPaged);
 	
 	RHeap* heap = UserHeap::ChunkHeap(aCreateInfo);
-
 	test_NotNull(heap);
 	RChunk chunk;
-	chunk.SetHandle(heap->ChunkHandle());
+	chunk.SetHandle(((TestHybridHeap*) heap)->ChunkHandle());
 	TBool paged = chunk.IsPaged();
 	chunk.Close();
 	return (aPaged == paged);
@@ -215,8 +214,8 @@
 			{
 			test.Printf(_L("RHeap not created\n"));
 			}
-		test.Printf(_L("chunkHandle = %d heapHandle = %d\n"),chunky.Handle(), heap->ChunkHandle());
-		test_Equal(chunky.Handle(), heap->ChunkHandle());
+		test.Printf(_L("chunkHandle = %d heapHandle = %d\n"),chunky.Handle(), ((TestHybridHeap*) heap)->ChunkHandle());
+		test_Equal(chunky.Handle(), ((TestHybridHeap*) heap)->ChunkHandle());
 		heap->Close();
 		}
 
@@ -238,9 +237,9 @@
 			{
 			test.Printf(_L("RHeap not created\n"));
 			}
-		test.Printf(_L("chunkHandle = %d heapHandle = %d\n"),chunky.Handle(), heap->ChunkHandle());
+		test.Printf(_L("chunkHandle = %d heapHandle = %d\n"),chunky.Handle(), ((TestHybridHeap*) heap)->ChunkHandle());
 		TBool isSame = EFalse;
-		if (chunky.Handle() == heap->ChunkHandle())
+		if (chunky.Handle() == ((TestHybridHeap*) heap)->ChunkHandle())
 			isSame = ETrue;
 		test_Equal(EFalse, isSame);
 		heap->Close();
@@ -304,7 +303,7 @@
 		heap = (RHeap*)UserHeap::ChunkHeap(createInfo);
 		test_NotNull(heap);
 		RChunk chunk;
-		chunk.SetHandle(heap->ChunkHandle());
+		chunk.SetHandle(((TestHybridHeap*) heap)->ChunkHandle());
 		TInt* numBuf = new TInt[gPageSize];
 		test_NotNull(numBuf);
 		test.Printf(_L("chunkSize = %d\n"), chunk.Size());
@@ -323,7 +322,7 @@
 		heap = (RHeap*)UserHeap::ChunkHeap(createInfo);
 		test_NotNull(heap);
 		RChunk chunk;
-		chunk.SetHandle(heap->ChunkHandle());
+		chunk.SetHandle(((TestHybridHeap*) heap)->ChunkHandle());
 		TInt* numBuf = new TInt[gPageSize];
 		test_Equal(NULL, numBuf);
 
@@ -342,7 +341,7 @@
 		heap = (RHeap*)UserHeap::ChunkHeap(createInfo);
 		TInt heapAddr = (TInt)heap;
 		RChunk chunk;
-		chunk.SetHandle(heap->ChunkHandle());
+		chunk.SetHandle(((TestHybridHeap*) heap)->ChunkHandle());
 		test_Equal((TInt)chunk.Base() + 8, heapAddr);
 		test_NotNull(heap);
 		heap->Close();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/demandpaging/t_dpcmn.h
--- a/kerneltest/e32test/demandpaging/t_dpcmn.h	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/demandpaging/t_dpcmn.h	Thu Jun 10 11:48:01 2010 +0100
@@ -41,3 +41,7 @@
 void UpdatePaged(TBool& aPaged);
 TInt TestThreadExit(RThread& aThread, TExitType aExitType, TInt aExitReason);
 
+class TestHybridHeap : public RHeap
+	{
+public: TInt ChunkHandle() { return iChunkHandle; };
+	};
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/demandpaging/t_tbus_datapaging.cpp
--- a/kerneltest/e32test/demandpaging/t_tbus_datapaging.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/demandpaging/t_tbus_datapaging.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -79,6 +79,7 @@
 
 LOCAL_D RFs TheFs;
 TInt gFsDriveNumber	= -1;
+TBool gMediaIsRam = EFalse;
 	
 RTest test(_L("T_TBUS_DATAPAGING"));
 _LIT(KChunkName, "t_datapaging chunk");
@@ -698,6 +699,9 @@
 			continue;
 
 		TPtrC mediaType = GetMediaType(di.iType);
+		if (di.iType == EMediaRam)
+			gMediaIsRam = ETrue;
+
 		test.Printf(_L("Drive %C Type %S DriveAtt 0x%x MediaAtt 0x%x FileSysId %S SerialNum %S\n"), 
 			'A' + n, &mediaType, di.iDriveAtt, di.iMediaAtt, &fsName, &GetSerialNumber(serialNum));
 
@@ -794,11 +798,13 @@
 	__DECLARE_VAR_IN_CHUNK(TBusLocalDrive, &drive)
 	TInt driveSize = TestDriveConnectAndCaps(drive, fatDriveNumber);
 	
-	TestDriveSizeRelatedMethods(drive, 0x00001000, driveSize);
+	if (!gMediaIsRam) // If media is RAM then the tests are invalid
+		TestDriveSizeRelatedMethods(drive, 0x00001000, driveSize);
 	
 	TestWriteReadRelatedMethods(drive);
 	
-	TestFormatRelatedMethods(drive, driveSize);
+	if (!gMediaIsRam)
+		TestFormatRelatedMethods(drive, driveSize);
 	
 	if(callPasswordRelated)
 		{
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/demandpaging/t_threadcreate.cpp
--- a/kerneltest/e32test/demandpaging/t_threadcreate.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/demandpaging/t_threadcreate.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -126,7 +126,7 @@
 	SThreadPagedInfo& info = *(SThreadPagedInfo*)aThreadInfo;
 	RHeap& heap = User::Heap();
 	RChunk chunk;
-	chunk.SetHandle(heap.ChunkHandle());
+	chunk.SetHandle(((TestHybridHeap&) heap).ChunkHandle());
 	info.iHeapPaged = chunk.IsPaged();
 	gStackPtr = (TUint8*)&chunk;
 	RDebug::Printf("&chunk %x",&chunk);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/base_e32test.mrp
--- a/kerneltest/e32test/group/base_e32test.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/group/base_e32test.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "E32 Tests"
 
 component	base_e32test
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/d_kerncorestats.mmp
--- a/kerneltest/e32test/group/d_kerncorestats.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/group/d_kerncorestats.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,7 +1,7 @@
-// Copyright (c) 2006-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2008-2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
-// under the terms of "Eclipse Public License v1.0"
+// under the terms of the License "Eclipse Public License v1.0"
 // which accompanies this distribution, and is available
 // at the URL "http://www.eclipse.org/legal/epl-v10.html".
 //
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/e32test.bld
--- a/kerneltest/e32test/group/e32test.bld	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/group/e32test.bld	Thu Jun 10 11:48:01 2010 +0100
@@ -1,5 +1,5 @@
-
-!EXPLICIT
-!INCREMENTAL
-
-e32test		e32test\group
+
+!EXPLICIT
+!INCREMENTAL
+
+e32test		e32test\group
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_chunk.mmp
--- a/kerneltest/e32test/group/t_chunk.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/group/t_chunk.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -19,7 +19,7 @@
 TARGETTYPE     EXE
 SOURCEPATH	../mmu
 SOURCE         t_chunk.cpp
-LIBRARY        euser.lib
+LIBRARY        euser.lib hal.lib
 OS_LAYER_SYSTEMINCLUDE_SYMBIAN
 
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_heap.mmp
--- a/kerneltest/e32test/group/t_heap.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/group/t_heap.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -21,7 +21,7 @@
 SOURCE         t_heap.cpp
 LIBRARY        euser.lib
 OS_LAYER_SYSTEMINCLUDE_SYMBIAN
-
+userinclude    ..\..\..\kernel\eka\include
 
 capability		all
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_heap2.mmp
--- a/kerneltest/e32test/group/t_heap2.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/group/t_heap2.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -21,8 +21,7 @@
 source			t_heap2.cpp
 library			euser.lib
 OS_LAYER_SYSTEMINCLUDE_SYMBIAN
-
-
+userinclude		..\..\..\kernel\eka\include
 
 capability		all
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_heapcheck.mmp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/group/t_heapcheck.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,34 @@
+// Copyright (c) 1995-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test/group/t_heapcheck.mmp
+// 
+//
+
+userinclude    ..\..\..\kernel\eka\include
+systeminclude    ..\..\..\kernel\eka\include
+TARGET         t_heapcheck.exe
+TARGETTYPE     EXE
+SOURCEPATH  ../heap
+SOURCE         t_heapcheck.cpp
+LIBRARY        euser.lib
+OS_LAYER_SYSTEMINCLUDE_SYMBIAN
+
+
+capability      all -TCB
+
+VENDORID 0x70000001
+
+SMPSAFE
+
+//EPOCSTACKSIZE 70000
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_heapcorruption.mmp
--- a/kerneltest/e32test/group/t_heapcorruption.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/group/t_heapcorruption.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -21,6 +21,7 @@
 
 userinclude	 	../debug
 OS_LAYER_SYSTEMINCLUDE_SYMBIAN
+userinclude		..\..\..\kernel\eka\include
 
 sourcepath	  	../debug
 source		  	t_heapcorruption.cpp
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_heapdb.mmp
--- a/kerneltest/e32test/group/t_heapdb.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/group/t_heapdb.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -21,7 +21,7 @@
 SOURCE         t_heapdb.cpp
 LIBRARY        euser.lib
 OS_LAYER_SYSTEMINCLUDE_SYMBIAN
-
+userinclude    ..\..\..\kernel\eka\include
 
 capability		all
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_heapdl.mmp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/group/t_heapdl.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,33 @@
+// Copyright (c) 1995-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test/group/t_heapdl.mmp
+// 
+//
+
+userinclude    ..\..\..\kernel\eka\include
+systeminclude    ..\..\..\kernel\eka\include
+TARGET         t_heapdl.exe
+TARGETTYPE     EXE
+SOURCEPATH	../heap
+SOURCE         t_heapdl.cpp
+LIBRARY        euser.lib
+OS_LAYER_SYSTEMINCLUDE_SYMBIAN
+
+
+capability		all -TCB
+
+VENDORID 0x70000001
+
+SMPSAFE
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_heappagealloc.mmp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/group/t_heappagealloc.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,33 @@
+// Copyright (c) 1995-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test/group/t_heappagealloc.mmp
+// 
+//
+
+userinclude    ..\..\..\kernel\eka\include
+systeminclude    ..\..\..\kernel\eka\include
+TARGET         t_heappagealloc.exe
+TARGETTYPE     EXE
+SOURCEPATH	../heap
+SOURCE         t_heappagealloc.cpp
+LIBRARY        euser.lib
+OS_LAYER_SYSTEMINCLUDE_SYMBIAN
+
+
+capability		all -TCB
+
+VENDORID 0x70000001
+
+SMPSAFE
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_heapslab.mmp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/group/t_heapslab.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,34 @@
+// Copyright (c) 1995-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test/group/t_heapslab.mmp
+// 
+//
+
+userinclude    ..\..\..\kernel\eka\include
+systeminclude    ..\..\..\kernel\eka\include
+TARGET         t_heapslab.exe
+TARGETTYPE     EXE
+SOURCEPATH  ../heap
+SOURCE         t_heapslab.cpp
+LIBRARY        euser.lib
+OS_LAYER_SYSTEMINCLUDE_SYMBIAN
+
+
+capability      all -TCB
+
+VENDORID 0x70000001
+
+SMPSAFE
+
+//EPOCSTACKSIZE 70000
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_heapstress.mmp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/group/t_heapstress.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,33 @@
+
+// Copyright (c) 1995-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test/group/t_heapstress.mmp
+// 
+//
+
+userinclude    ..\..\..\kernel\eka\include
+systeminclude    ..\..\..\kernel\eka\include
+target          t_heapstress.exe
+targettype      exe
+sourcepath      ../heap
+source          t_heapstress.cpp
+library         euser.lib
+OS_LAYER_SYSTEMINCLUDE_SYMBIAN
+
+capability      all -TCB
+
+VENDORID 0x70000001
+
+SMPSAFE
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_kerncorestats.mmp
--- a/kerneltest/e32test/group/t_kerncorestats.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/group/t_kerncorestats.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,7 +1,7 @@
-// Copyright (c) 2005-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2008-2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
-// under the terms of "Eclipse Public License v1.0"
+// under the terms of the License "Eclipse Public License v1.0"
 // which accompanies this distribution, and is available
 // at the URL "http://www.eclipse.org/legal/epl-v10.html".
 //
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_smpsoakspin.mmp
--- a/kerneltest/e32test/group/t_smpsoakspin.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/group/t_smpsoakspin.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,20 +1,18 @@
-/*
-* Copyright (c) 2005 Nokia Corporation and/or its subsidiary(-ies).
-* All rights reserved.
-* This component and the accompanying materials are made available
-* under the terms of "Eclipse Public License v1.0"
-* which accompanies this distribution, and is available
-* at the URL "http://www.eclipse.org/legal/epl-v10.html".
-*
-* Initial Contributors:
-* Nokia Corporation - initial contribution.
-*
-* Contributors:
-*
-* Description: 
-*
-*/
-
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test/group/t_smpsoakspin.mmp
+//
 
 target			t_smpsoakspin.exe        
 targettype		exe
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/group/t_timestamp.mmp
--- a/kerneltest/e32test/group/t_timestamp.mmp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/group/t_timestamp.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 1996-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/hcr/hcr.inf
--- a/kerneltest/e32test/hcr/hcr.inf	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/hcr/hcr.inf	Thu Jun 10 11:48:01 2010 +0100
@@ -29,8 +29,6 @@
 PRJ_TESTEXPORTS
 
 hcr_tests.iby			/epoc32/rom/include/hcr_tests.iby
-tshell_hcrtest.oby		../../../kernel/eka/rombuild/tshell_hcrtest.oby
-nandloader_hcrtest.oby	../../../kernel/eka/rombuild/nandloader_hcrtest.oby
 
 hcrtest.auto.bat	/epoc32/rom/include/hcrtest.auto.bat
 hcr_autoexec.bat	/epoc32/rom/include/hcr_autoexec.bat
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/hcr/hcrtest_h4roms.mbc
--- a/kerneltest/e32test/hcr/hcrtest_h4roms.mbc	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/hcr/hcrtest_h4roms.mbc	Thu Jun 10 11:48:01 2010 +0100
@@ -17,57 +17,57 @@
 #ifndef BUILD_NO_UREL
 	// Multiple Memory Model
 	//
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL.IMG         --type=tshell_hcrtest
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-BOOTLDR.IMG        --type=ubootldr
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-BOOTLDR-FAT32.IMG  --type=ubootldr -D WITH_FAT32
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL.IMG         --type=tshell_hcrtest
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-BOOTLDR.IMG        --type=ubootldr
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-BOOTLDR-FAT32.IMG  --type=ubootldr -D WITH_FAT32
 	
 	// Small block NAND support
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-NAND2LDR.IMG        --type=nandloader -D _NAND2
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL_NAND2.IMG    --type=tshell_hcrtest -D _NAND2
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-NAND2LDR.IMG        --type=nandloader -D _NAND2
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL_NAND2.IMG    --type=tshell_hcrtest -D _NAND2
 	
 	// OneNAND support
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-NANDLDR.IMG        --type=nandloader -D _ONENAND
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL_NAND.IMG    --type=tshell_hcrtest -D _ONENAND
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-NANDLDR.IMG        --type=nandloader -D _ONENAND
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b urel -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL_NAND.IMG    --type=tshell_hcrtest -D _ONENAND
 	
 	
 	// Direct/Single Memory model - not supported I think
 	//
-	// oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v sh4hrp -b urel -i armv5 --zip --symbol --name=SH4_TBARMV5D-TSHELL.IMG   --type=tshell_hcrtest
+	// oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v sh4hrp -b urel -i armv5 --zip --symbol --name=SH4_TBARMV5D-TSHELL.IMG   --type=tshell_hcrtest
 	
 	// Flexible Memory model
 	//
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fh4hrp -b urel -i armv5 --zip --symbol --name=FH4_TBARMV5D-TSHELL.IMG   --type=tshell_hcrtest
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fh4hrp -b urel -i armv5 --zip --symbol --name=FH4_TBARMV5D-TSHELL.IMG   --type=tshell_hcrtest
 	
 #endif
 
 // Direct/Single Memory model - not supported I think
 //
-// oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v sh4hrp -b udeb -i armv5 --zip --symbol --name=SH4_TBARMV5D-TSHELL-D.IMG   --type=tshell_hcrtest
+// oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v sh4hrp -b udeb -i armv5 --zip --symbol --name=SH4_TBARMV5D-TSHELL-D.IMG   --type=tshell_hcrtest
 
 // Multiple Memory Model
 //
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL-D.IMG         --type=tshell_hcrtest
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-BOOTLDR-D.IMG        --type=ubootldr
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-BOOTLDR-FAT32-D.IMG  --type=ubootldr -D WITH_FAT32
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL-D.IMG         --type=tshell_hcrtest
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-BOOTLDR-D.IMG        --type=ubootldr
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-BOOTLDR-FAT32-D.IMG  --type=ubootldr -D WITH_FAT32
 // Small block NAND support
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-NAND2LDR-D.IMG        --type=nandloader -D _NAND2
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL_NAND2-D.IMG    --type=tshell_hcrtest -D _NAND2
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL_PAGED_NAND2B-D.IMG  	--type=tshell_hcrtest -D USE_SDIO_SD_MMC,WITH_FAT32,_NAND2,PAGED_ROM,PAGED_CODE
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-NAND2LDR-D.IMG        --type=nandloader -D _NAND2
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL_NAND2-D.IMG    --type=tshell_hcrtest -D _NAND2
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL_PAGED_NAND2B-D.IMG  	--type=tshell_hcrtest -D USE_SDIO_SD_MMC,WITH_FAT32,_NAND2,PAGED_ROM,PAGED_CODE
 // OneNAND support
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-NANDLDR-D.IMG        --type=nandloader -D _ONENAND
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL_NAND-D.IMG    --type=tshell_hcrtest -D _ONENAND
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-NANDLDR-D.IMG        --type=nandloader -D _ONENAND
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v h4hrp -b udeb -i armv5 --zip --symbol --name=H4_TBARMV5D-TSHELL_NAND-D.IMG    --type=tshell_hcrtest -D _ONENAND
 
 
 // Flexible Memory model
 //
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fh4hrp -b udeb -i armv5 --zip --symbol --name=FH4_TBARMV5D-TSHELL-D.IMG   		--type=tshell_hcrtest
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fh4hrp -b udeb -i armv5 --zip --symbol --name=FH4_TBARMV5D-TSHELL-D.IMG   		--type=tshell_hcrtest
 // Small block NAND support
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fh4hrp -b udeb -i armv5 --zip --symbol --name=FH4_TBARMV5D-NAND2LDR-D.IMG     	--type=nandloader -D _NAND2
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fh4hrp -b udeb -i armv5 --zip --symbol --name=FH4_TBARMV5D-TSHELL_NAND2-D.IMG  	--type=tshell_hcrtest -D _NAND2
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fh4hrp -b udeb -i armv5 --zip --symbol --name=FH4_TBARMV5D-TSHELL_PAGED_NAND2B-D.IMG  	--type=tshell_hcrtest -D USE_SDIO_SD_MMC,WITH_FAT32,_NAND2,PAGED_ROM,PAGED_CODE
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fh4hrp -b udeb -i armv5 --zip --symbol --name=FH4_TBARMV5D-NAND2LDR-D.IMG     	--type=nandloader -D _NAND2
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fh4hrp -b udeb -i armv5 --zip --symbol --name=FH4_TBARMV5D-TSHELL_NAND2-D.IMG  	--type=tshell_hcrtest -D _NAND2
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fh4hrp -b udeb -i armv5 --zip --symbol --name=FH4_TBARMV5D-TSHELL_PAGED_NAND2B-D.IMG  	--type=tshell_hcrtest -D USE_SDIO_SD_MMC,WITH_FAT32,_NAND2,PAGED_ROM,PAGED_CODE
 // OneNAND support
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fh4hrp -b udeb -i armv5 --zip --symbol --name=FH4_TBARMV5D-NANDLDR-D.IMG      	--type=nandloader -D _ONENAND
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fh4hrp -b udeb -i armv5 --zip --symbol --name=FH4_TBARMV5D-TSHELL_NAND-D.IMG   	--type=tshell_hcrtest -D _ONENAND
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fh4hrp -b udeb -i armv5 --zip --symbol --name=FH4_TBARMV5D-NANDLDR-D.IMG      	--type=nandloader -D _ONENAND
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fh4hrp -b udeb -i armv5 --zip --symbol --name=FH4_TBARMV5D-TSHELL_NAND-D.IMG   	--type=tshell_hcrtest -D _ONENAND
 
 
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/hcr/hcrtest_ne1roms.mbc
--- a/kerneltest/e32test/hcr/hcrtest_ne1roms.mbc	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/hcr/hcrtest_ne1roms.mbc	Thu Jun 10 11:48:01 2010 +0100
@@ -29,64 +29,64 @@
 #ifndef BUILD_NO_UREL
 	// Direct/Single Memory model - unicore - udeb
 	//
-	// oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v sne1_tb -b urel -i armv5 --zip --symbol --name=SNE1_TBARMV5D-TSHELL.IMG   --type=tshell_hcrtest
+	// oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v sne1_tb -b urel -i armv5 --zip --symbol --name=SNE1_TBARMV5D-TSHELL.IMG   --type=tshell_hcrtest
 	
 	// Multiple Memory Model - unicore - udeb
 	//
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v ne1_tb -b urel -i armv5 --zip --symbol --name=NE1_TBARMV5D-TSHELL.IMG        --type=tshell_hcrtest -D HCR_INCLUDE_VARIANT_TEST_DRIVERS
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v ne1_tb -b urel -i armv5 --zip --symbol --name=NE1_TBARMV5D-BOOTLDR.IMG       --type=ubootldr
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v ne1_tb -b urel -i armv5 --zip --symbol --name=NE1_TBARMV5D-BOOTLDR-FAT32.IMG --type=ubootldr -D WITH_FAT32
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v ne1_tb -b urel -i armv5 --zip --symbol --name=NE1_TBARMV5D-TSHELL.IMG        --type=tshell_hcrtest -D HCR_INCLUDE_VARIANT_TEST_DRIVERS
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v ne1_tb -b urel -i armv5 --zip --symbol --name=NE1_TBARMV5D-BOOTLDR.IMG       --type=ubootldr
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v ne1_tb -b urel -i armv5 --zip --symbol --name=NE1_TBARMV5D-BOOTLDR-FAT32.IMG --type=ubootldr -D WITH_FAT32
 	
 	// Large block NAND support
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v ne1_tb -b urel -i armv5 --zip --symbol --name=NE1_TBARMV5D-NAND2LDR.IMG        --type=nandloader_hcrtest -D _NAND2
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v ne1_tb -b urel -i armv5 --zip --symbol --name=NE1_TBARMV5D-TSHELL_NAND2.IMG    --type=tshell_hcrtest -D _NAND2,HCR_INCLUDE_VARIANT_TEST_DRIVERS
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v ne1_tb -b urel -i armv5 --zip --symbol --name=NE1_TBARMV5D-NAND2LDR.IMG        --type=nandloader_hcrtest -D _NAND2
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v ne1_tb -b urel -i armv5 --zip --symbol --name=NE1_TBARMV5D-TSHELL_NAND2.IMG    --type=tshell_hcrtest -D _NAND2,HCR_INCLUDE_VARIANT_TEST_DRIVERS
 	// OneNAND support -- -D _ONENANDE not supported on NE1
 	
 	
 	// Flexible Memory model - unicore & SMP - udeb
 	//
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b urel -i armv5 --zip --symbol --name=FNE1_TBARMV5D-TSHELL.IMG   --type=tshell_hcrtest -D HCR_INCLUDE_VARIANT_TEST_DRIVERS
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b urel -i armv5 -x armv5smp --zip --symbol --name=FNE1_TBARMV5SMPD-TSHELL.IMG   --type=tshell_hcrtest -D HCR_INCLUDE_VARIANT_TEST_DRIVERS
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b urel -i armv5 --zip --symbol --name=FNE1_TBARMV5D-TSHELL.IMG   --type=tshell_hcrtest -D HCR_INCLUDE_VARIANT_TEST_DRIVERS
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b urel -i armv5 -x armv5smp --zip --symbol --name=FNE1_TBARMV5SMPD-TSHELL.IMG   --type=tshell_hcrtest -D HCR_INCLUDE_VARIANT_TEST_DRIVERS
 	
 	// Large block NAND support
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b urel -i armv5 --zip --symbol --name=FNE1_TBARMV5D-NAND2LDR.IMG        --type=nandloader_hcrtest -D _NAND2
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b urel -i armv5 --zip --symbol --name=FNE1_TBARMV5D-TSHELL_NAND2.IMG    --type=tshell_hcrtest -D _NAND2,HCR_INCLUDE_VARIANT_TEST_DRIVERS
-	oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b urel -i armv5 -x armv5smp --zip --symbol --name=FNE1_TBARMV5SMPD-TSHELL_NAND2.IMG    --type=tshell_hcrtest -D _NAND2,HCR_INCLUDE_VARIANT_TEST_DRIVERS
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b urel -i armv5 --zip --symbol --name=FNE1_TBARMV5D-NAND2LDR.IMG        --type=nandloader_hcrtest -D _NAND2
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b urel -i armv5 --zip --symbol --name=FNE1_TBARMV5D-TSHELL_NAND2.IMG    --type=tshell_hcrtest -D _NAND2,HCR_INCLUDE_VARIANT_TEST_DRIVERS
+	oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b urel -i armv5 -x armv5smp --zip --symbol --name=FNE1_TBARMV5SMPD-TSHELL_NAND2.IMG    --type=tshell_hcrtest -D _NAND2,HCR_INCLUDE_VARIANT_TEST_DRIVERS
 	// OneNAND support -- -D _ONENANDE not supported on NE1
 #endif
 
 
 // Direct/Single Memory model - unicore - udeb
 //
-// oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v sne1_tb -b udeb -i armv5 --zip --symbol --name=SNE1_TBARMV5D-TSHELL-D.IMG   --type=tshell_hcrtest
+// oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v sne1_tb -b udeb -i armv5 --zip --symbol --name=SNE1_TBARMV5D-TSHELL-D.IMG   --type=tshell_hcrtest
 
 // Multiple Memory Model - unicore - udeb
 //
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v ne1_tb -b udeb -i armv5 --zip --symbol --name=NE1_TBARMV5D-TSHELL-D.IMG        --type=tshell_hcrtest -D HCR_INCLUDE_VARIANT_TEST_DRIVERS
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v ne1_tb -b udeb -i armv5 --zip --symbol --name=NE1_TBARMV5D-BOOTLDR-D.IMG       --type=ubootldr
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v ne1_tb -b udeb -i armv5 --zip --symbol --name=NE1_TBARMV5D-BOOTLDR-FAT32-D.IMG --type=ubootldr -D WITH_FAT32
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v ne1_tb -b udeb -i armv5 --zip --symbol --name=NE1_TBARMV5D-TSHELL-D.IMG        --type=tshell_hcrtest -D HCR_INCLUDE_VARIANT_TEST_DRIVERS
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v ne1_tb -b udeb -i armv5 --zip --symbol --name=NE1_TBARMV5D-BOOTLDR-D.IMG       --type=ubootldr
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v ne1_tb -b udeb -i armv5 --zip --symbol --name=NE1_TBARMV5D-BOOTLDR-FAT32-D.IMG --type=ubootldr -D WITH_FAT32
 // Large block NAND support
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v ne1_tb -b udeb -i armv5 --zip --symbol --name=NE1_TBARMV5D-NAND2LDR-D.IMG        --type=nandloader_hcrtest -D _NAND2
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v ne1_tb -b udeb -i armv5 --zip --symbol --name=NE1_TBARMV5D-TSHELL_NAND2-D.IMG    --type=tshell_hcrtest -D _NAND2,HCR_INCLUDE_VARIANT_TEST_DRIVERS
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v ne1_tb -b udeb -i armv5 --zip --symbol --name=NE1_TBARMV5D-NAND2LDR-D.IMG        --type=nandloader_hcrtest -D _NAND2
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v ne1_tb -b udeb -i armv5 --zip --symbol --name=NE1_TBARMV5D-TSHELL_NAND2-D.IMG    --type=tshell_hcrtest -D _NAND2,HCR_INCLUDE_VARIANT_TEST_DRIVERS
 
 // OneNAND support -- -D _ONENANDE not supported on NE1
 
 
 // Flexible Memory model - unicore & SMP - udeb
 //
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b udeb -i armv5 --zip --symbol --name=FNE1_TBARMV5D-TSHELL-D.IMG   --type=tshell_hcrtest -D HCR_INCLUDE_VARIANT_TEST_DRIVERS
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b udeb -i armv5 -x armv5smp --zip --symbol --name=FNE1_TBARMV5SMPD-TSHELL-D.IMG   --type=tshell_hcrtest -D HCR_INCLUDE_VARIANT_TEST_DRIVERS
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b udeb -i armv5 --zip --symbol --name=FNE1_TBARMV5D-TSHELL-D.IMG   --type=tshell_hcrtest -D HCR_INCLUDE_VARIANT_TEST_DRIVERS
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b udeb -i armv5 -x armv5smp --zip --symbol --name=FNE1_TBARMV5SMPD-TSHELL-D.IMG   --type=tshell_hcrtest -D HCR_INCLUDE_VARIANT_TEST_DRIVERS
 
 // Large block NAND support
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b udeb -i armv5 --zip --symbol --name=FNE1_TBARMV5D-NAND2LDR-D.IMG        --type=nandloader_hcrtest -D _NAND2
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b udeb -i armv5 --zip --symbol --name=FNE1_TBARMV5D-TSHELL_NAND2-D.IMG    --type=tshell_hcrtest -D _NAND2,HCR_INCLUDE_VARIANT_TEST_DRIVERS
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b udeb -i armv5 -x armv5smp --zip --symbol --name=FNE1_TBARMV5SMPD-TSHELL_NAND2-D.IMG    --type=tshell_hcrtest -D _NAND2,HCR_INCLUDE_VARIANT_TEST_DRIVERS
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b udeb -i armv5 --zip --symbol --name=FNE1_TBARMV5D-NAND2LDR-D.IMG        --type=nandloader_hcrtest -D _NAND2
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b udeb -i armv5 --zip --symbol --name=FNE1_TBARMV5D-TSHELL_NAND2-D.IMG    --type=tshell_hcrtest -D _NAND2,HCR_INCLUDE_VARIANT_TEST_DRIVERS
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b udeb -i armv5 -x armv5smp --zip --symbol --name=FNE1_TBARMV5SMPD-TSHELL_NAND2-D.IMG    --type=tshell_hcrtest -D _NAND2,HCR_INCLUDE_VARIANT_TEST_DRIVERS
 // OneNAND support -- -D _ONENANDE not supported on NE1
 
 // Large block NAND support + WDP
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b udeb -i armv5 --zip --symbol --name=FNE1_TBARMV5D-TSHELL_NAND2-WDP-D.IMG    --type=tshell_hcrtest -D _NAND2,PAGED_ROM,PAGED_CODE,PAGED_DATA,DATAPAGINGWARNINGS,WITH_FAT32,FULL_NAND_TEST,HCR_INCLUDE_VARIANT_TEST_DRIVERS
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b udeb -i armv5 --zip --symbol --name=FNE1_TBARMV5D-NAND2LDR-WDP-D.IMG        --type=nandloader_hcrtest -D _NAND2,_CREATE_NE1_TB_NAND_SWAP 
-oneoff \os\kernelhwsrv\kernel\eka\rombuild rom -v fne1_tb -b udeb -i armv5 -x armv5smp --zip --symbol --name=FNE1_TBARMV5SMPD-TSHELL_NAND2-WDP-D.IMG    --type=tshell_hcrtest -D  _NAND2,PAGED_ROM,PAGED_CODE,PAGED_DATA,DATAPAGINGWARNINGS,WITH_FAT32,FULL_NAND_TEST,HCR_INCLUDE_VARIANT_TEST_DRIVERS
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b udeb -i armv5 --zip --symbol --name=FNE1_TBARMV5D-TSHELL_NAND2-WDP-D.IMG    --type=tshell_hcrtest -D _NAND2,PAGED_ROM,PAGED_CODE,PAGED_DATA,DATAPAGINGWARNINGS,WITH_FAT32,FULL_NAND_TEST,HCR_INCLUDE_VARIANT_TEST_DRIVERS
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b udeb -i armv5 --zip --symbol --name=FNE1_TBARMV5D-NAND2LDR-WDP-D.IMG        --type=nandloader_hcrtest -D _NAND2,_CREATE_NE1_TB_NAND_SWAP 
+oneoff . \os\kernelhwsrv\kernel\eka\rombuild\rom -v fne1_tb -b udeb -i armv5 -x armv5smp --zip --symbol --name=FNE1_TBARMV5SMPD-TSHELL_NAND2-WDP-D.IMG    --type=tshell_hcrtest -D  _NAND2,PAGED_ROM,PAGED_CODE,PAGED_DATA,DATAPAGINGWARNINGS,WITH_FAT32,FULL_NAND_TEST,HCR_INCLUDE_VARIANT_TEST_DRIVERS
 
 
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/heap/t_fail.cpp
--- a/kerneltest/e32test/heap/t_fail.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/heap/t_fail.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -227,6 +227,18 @@
 	__UHEAP_RESET;
 	__UHEAP_MARK;
 
+	// Make sure that we can retrieve the failure type set with __UHEAP_SETFAIL
+	test.Next(_L("Set and get user heap failure simulation mode"));
+	__UHEAP_SETFAIL(RHeap::EFailNext, 1);
+	test(User::__DbgGetAllocFail(EFalse) == RHeap::EFailNext);
+	__UHEAP_SETFAIL(RHeap::ENone, 0);
+
+	// Make sure that we can retrieve the failure type set with __KHEAP_SETFAIL
+	test.Next(_L("Set and get kernel heap failure simulation mode"));
+	__KHEAP_SETFAIL(RHeap::EFailNext, 1);
+	test(User::__DbgGetAllocFail(ETrue) == RHeap::EFailNext);
+	__KHEAP_SETFAIL(RHeap::ENone, 0);
+
 	// Prepare for __RHEAP tests
 	TInt pageSize;
 	test_KErrNone(HAL::Get(HAL::EMemoryPageSize, pageSize));
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/heap/t_heap.cpp
--- a/kerneltest/e32test/heap/t_heap.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/heap/t_heap.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -66,6 +66,10 @@
 #include <e32hal.h>
 #include <e32def.h>
 #include <e32def_private.h>
+#include "dla.h"
+#include "slab.h"
+#include "page_alloc.h"
+#include "heap_hybrid.h"
 
 // Sets data for Test6
 #define SetData(size)	pHeap->Reset();\
@@ -90,7 +94,8 @@
 #endif
 
 const TInt KHeadSize = (TInt)RHeap::EAllocCellSize;
-const TInt KAlign = _FOFF(RHeap::_s_align, d);
+
+const TInt KAlign = RHeap::ECellAlignment;
 const TInt KMinCellLength = _ALIGN_UP((KHeapMinCellSize + Max(TInt(RHeap::EFreeCellSize),TInt(RHeap::EAllocCellSize))),KAlign) - RHeap::EAllocCellSize;
 const TInt KMinFreeSize = _ALIGN_UP((KHeapMinCellSize + Max(TInt(RHeap::EFreeCellSize),TInt(RHeap::EAllocCellSize))),KAlign);
 
@@ -108,7 +113,7 @@
 	RChunk				iChunk;
 	TUint8				*iBase;
 	TUint8				*iTop;
-	RHeap::SCell		iFree;
+	//RHeap::SCell		iFree;
 	};
 
 #pragma warning ( disable :4705 ) // statement has no effect
@@ -118,12 +123,15 @@
 #if defined(_DEBUG)
 void RTestHeap::__DbgTest(void* aPtr) const
 	{
+	(void) aPtr;
+/*	
 	RHeapDump& d = *(RHeapDump*)aPtr;
 	d.iMinLength=iMinLength;
 	d.iChunk.SetHandle(iChunkHandle);
 	d.iBase=iBase;
 	d.iTop=iTop;
 	d.iFree=iFree;
+*/	
 	}
 #endif
 
@@ -131,6 +139,8 @@
 #if defined(_DEBUG)
 TBool Invariant(RHeap* aHeap)
 	{
+	(void) aHeap;
+/*	
 	RHeapDump dump;
 	((RTestHeap*)aHeap)->__DbgTest(&dump);
 	if(dump.iMinLength!=OrigDump.iMinLength) 		return(EFalse);
@@ -141,6 +151,7 @@
 	if(dump.iTop[-1]!=OrigDump.iTop[-1])	return(EFalse);	
 	if(dump.iFree.len!=OrigDump.iFree.len)	return(EFalse);
 	// iFree.Next changes during allocation/freeing etc.
+*/
 	return(ETrue);
 	}
 #define INV(x) x;
@@ -153,6 +164,23 @@
 LOCAL_D RHeap *gHeapPtr;
 LOCAL_D RHeap *gHeapPtr2;
 
+/*
+Friend class of RHeapHybrid to access to hybrid heap metadata
+*/
+class TestHybridHeap
+{
+public:
+    static TBool IsHybrid(const RHybridHeap * aHybridHeap);
+};
+
+TBool TestHybridHeap::IsHybrid(const RHybridHeap * aHybridHeap)
+  {
+  if (aHybridHeap->iDLOnly)
+      return EFalse;
+  else
+      return ETrue;
+  }
+
 class TestRHeap
 	{
 public:
@@ -216,8 +244,9 @@
 
 	((RTestHeap*)pHeap)->__DbgTest(&OrigDump);
 	((RTestHeap*)pHeap)->__DbgTest(&dump);
-	test(dump.iBase==pHeap->Base());
-	test((dump.iTop-dump.iBase)==pHeap->Size());
+	
+//	test(dump.iBase==pHeap->Base());
+//	test((dump.iTop-dump.iBase)==pHeap->Size());
 	pHeap->Check();
 	test(Invariant(pHeap));
 	pHeap->Close();
@@ -510,33 +539,12 @@
 	// Resize positively
 	for(TInt aSize=0; aSize<=BiggestBlock; aSize++, pHeap->Available(BiggestBlock))
 		{
-		test(pHeap->ReAlloc(aCell, aSize)!=NULL); 
+		aCell = pHeap->ReAlloc(aCell, aSize); 
+		test(aCell!=NULL); 
 		CellSize=pHeap->AllocLen(aCell);
 		test(CellSize>=aSize);
-		if (aSize<KMinCellLength)
-			test(CellSize==KMinCellLength);
-		else
-			test(CellSize<aSize+KAlign);
 		}
 
-	// Note: when increasing a cell size the size is rounded up to the nearest 4 but when 
-	// decreasing a cell the size is rounded down to the nearest 8 - this is due to the fact
-	// that when memory is released its size must be big enough to hold a free cell header which
-	// is greater(8) than an allocated header(4)
-	// i.e. size = 16, resize to 17 => result  is 20. But resize to 15 stays as 16, resize to 9
-	// stays as 16 but resize as 8 will resize to 8
-
-	for(TInt aSize2=(TInt)pHeap->AllocLen(aCell); aSize2>=0; aSize2--)
-		{
-		test(pHeap->ReAlloc(aCell, aSize2)!=NULL);
-
-		test((TInt)pHeap->AllocLen(aCell)>=aSize2);		
-
-		TInt aTmpSize2 = Max(_ALIGN_UP(aSize2 + RHeap::EAllocCellSize, KAlign), KMinFreeSize);
-
-		test((TInt)pHeap->AllocLen(aCell)<=aTmpSize2+KMinFreeSize);		
-		}
-  
 	pHeap->Check();
 	pHeap->Reset();
 	// Allocate a block, fill with data, allocate another block or two then resize the original
@@ -738,6 +746,18 @@
 	RMyHeap* myHeap=(RMyHeap*)User::ChunkHeap(&myHeapName,0x100,0x2000);
 const TInt KnormHeapGrowBy = 0x2000;
 	RHeap* normHeap=User::ChunkHeap(NULL,0x100,0x20000,KnormHeapGrowBy);
+	//
+	// Configure paged heap threshold 128 Kb (pagepower 17)
+	//
+	RHybridHeap::STestCommand conf;
+	conf.iCommand = RHybridHeap::EGetConfig;
+	if ( normHeap->DebugFunction(RHeap::EHybridHeap, (TAny*)&conf ) == KErrNone )
+		{
+		test.Printf(_L("New allocator detected, configuring paged threshold to 128 kb\r\n"));
+		conf.iCommand = RHybridHeap::ESetConfig;
+		conf.iConfig.iPagePower = 17;
+		test( normHeap->DebugFunction(RHeap::EHybridHeap, (TAny*)&conf ) == KErrNone);
+		}
 
 	TAny* ptrMy1=myHeap->Alloc(0x102);
 	test(ptrMy1!=NULL);
@@ -784,8 +804,8 @@
 	// Calc the amount, if any, the overall size of normHeap will have been shrunk by
 	// will depend on value of KHeapShrinkHysRatio.
 	// 1st calc current total size of the allocated cells
-	TInt normAllocdSize = 	normHeap->AllocLen(ptrNorm1)+RHeap::EAllocCellSize +
-							normHeap->AllocLen(ptrNorm2)+RHeap::EAllocCellSize;
+	TInt normAllocdSize = 	normHeap->AllocLen(ptrNorm1)+KHeadSize +
+							normHeap->AllocLen(ptrNorm2)+KHeadSize;
 	TInt normReduce = RHeapCalcReduce(oldNormHeapSize-normAllocdSize,KnormHeapGrowBy);
 	oldNormHeapSize -= normReduce;
 	test(r==oldNormHeapSize);
@@ -797,7 +817,7 @@
 	r=myHeap->Size();
 
 	// Calc the current total size of the allocated cells
-	TInt myAllocdSize = myHeap->AllocLen(ptrMy1)+RHeap::EAllocCellSize;
+	TInt myAllocdSize = myHeap->AllocLen(ptrMy1)+KHeadSize;
 	TInt myReduce=RHeapCalcReduce(oldMyHeapSize-myAllocdSize,1);
 	oldMyHeapSize -= myReduce;
 	test(r==oldMyHeapSize);
@@ -864,7 +884,6 @@
 		test(last+space <= chunk.Base()+size);
 		// but that it is within the alignment requirement, as less than this
 		// would be short of the end
-		test(last+space > chunk.Base()+size-RHeap::ECellAlignment);
 		}
 	else
 		{
@@ -1126,6 +1145,7 @@
 	test.Start(_L("Create chunk to"));
 	TPtrC autoHeap=_L("AutoHeap");
 	gHeapPtr=User::ChunkHeap(&autoHeap,0x1800,0x6000);
+	
 	test(gHeapPtr!=NULL);
 	TInt biggest;
 	TInt avail=gHeapPtr->Available(biggest);
@@ -1160,13 +1180,133 @@
 	test(comp==0);
 	TInt biggest1;
 	TInt avail1=gHeapPtr->Available(biggest1);
-	test(avail1==avail1);
+	test(avail==avail1);
 	test(biggest==biggest1);
 	test(gHeapPtr->Count()==0);
 	gHeapPtr->Close();
 	test.End();
 	}
 
+LOCAL_C TInt NormalChunk(RChunk& aChunk, TInt aInitialSize, TInt aMaxSize)
+    {
+    TChunkCreateInfo createInfo;
+    createInfo.SetNormal(aInitialSize, aMaxSize);
+    TInt r=aChunk.Create(createInfo);
+    return r;
+    }    
+
+LOCAL_C TInt DisconnectedChunk(RChunk& aChunk, TInt aInitialBottom, TInt aInitialTop, TInt aMaxSize)
+    {
+    TChunkCreateInfo createInfo;
+    createInfo.SetDisconnected(aInitialBottom, aInitialTop, aMaxSize);
+    TInt r=aChunk.Create(createInfo);
+    return r;  
+    }
+
+LOCAL_C TBool TestIsHybridHeap(RHeap* aHeap)
+    {
+    RHybridHeap::STestCommand cmd;
+    cmd.iCommand = RHybridHeap::EHeapMetaData;
+    aHeap->DebugFunction(RHeap::EHybridHeap, (TAny*)&cmd, 0);
+               
+    RHybridHeap* hybridHeap = (RHybridHeap*) cmd.iData;
+    return (TestHybridHeap::IsHybrid(hybridHeap));  
+    }
+
+LOCAL_C void TestHeapType()
+    {
+    TBool onlyDL = EFalse;
+    _LIT(KHeap, "NamedHeap");
+    // 1: Create a heap in a local chunk
+    RHeap* heap;
+    heap = UserHeap::ChunkHeap(NULL,0x100,0x2000);
+    TBool hybrid = TestIsHybridHeap(heap);
+    if (hybrid==0)
+        {
+        test.Printf(_L("Only DL allocator is in use \n"));
+        onlyDL = ETrue;;
+        }
+    else
+        test(hybrid==1); 
+    heap->Close();
+    
+    // 2: Create a heap in a global chunk
+    heap = UserHeap::ChunkHeap(&KHeap,0,0x1800,0x6000);
+    hybrid = TestIsHybridHeap(heap);
+    if(!onlyDL)
+        test(hybrid==1); 
+    heap->Close();
+    
+    // 3: Create a heap in an existing normal chunk
+    RChunk chunk;
+    TInt r = NormalChunk(chunk,0,0x1000);
+    heap = UserHeap::ChunkHeap(chunk,0);
+    hybrid = TestIsHybridHeap(heap);
+    test(hybrid==0);
+    heap->Close();
+                   
+    // 4: Create a heap in an existing disconnected chunk
+    // when offset = 0.  Minimum heap size for a hybrid heap is 12KB
+    r = DisconnectedChunk(chunk,0,0,0x3000);
+    heap = UserHeap::ChunkHeap(chunk,0);
+    hybrid = TestIsHybridHeap(heap);
+    if(!onlyDL)
+        test(hybrid==1);
+    heap->Close();
+        
+    // 5: Create a heap in an existing disconnected chunk
+    // when offset > 0
+    r = DisconnectedChunk(chunk,0,0x1800,0x6000); 
+    heap = UserHeap::OffsetChunkHeap(chunk,0,0x2800);
+    hybrid = TestIsHybridHeap(heap);
+    test(hybrid==0);
+    heap->Close();
+    
+    // 6: Create a fixed length heap at a normal chunk's base address 
+    r = NormalChunk(chunk,0x1000,0x1000);
+    heap = UserHeap::FixedHeap(chunk.Base(), 0x1000);
+    hybrid = TestIsHybridHeap(heap);
+    test(hybrid==0);
+    heap->Close();
+    chunk.Close();
+    
+    // 7: Create a fixed length heap at a disconnected chunk's base address
+    // when bottom = 0
+    r = DisconnectedChunk(chunk,0,0x2000,0x2000); 
+    heap = UserHeap::FixedHeap(chunk.Base(), 0x2000);
+    hybrid = TestIsHybridHeap(heap);
+    test(hybrid==0);
+    heap->Close();
+    chunk.Close();
+        
+    // 8: Create a fixed length heap at a disconnected chunk's base address
+    // when bottom > 0
+    r = DisconnectedChunk(chunk,0x6000,0x7000,0x13000); 
+    heap = UserHeap::FixedHeap(chunk.Base()+ 0x6000, 0x1000); 
+    hybrid = TestIsHybridHeap(heap);
+    test(hybrid==0);
+    heap->Close();
+    chunk.Close();
+    
+    // 9: Create a fixed length heap for allocated buffer
+    heap = UserHeap::ChunkHeap(&KNullDesC(), 4096, (4096 * 1024));
+    test(heap != NULL);
+    TAny* buffer = heap->Alloc(1024 * 1024);    
+    test(buffer != NULL);
+    TInt lth = heap->AllocLen(buffer);
+    test.Printf(_L("Fixed heap buffer: %x, length: %x \n"), buffer, lth);  
+
+    RHeap* heapf = UserHeap::FixedHeap(buffer, (1024 * 1024));
+    test(heapf != NULL);
+    test.Printf(_L("Fixed heap: %x \n"), heapf);
+    hybrid = TestIsHybridHeap(heapf);
+    test(hybrid==0);
+
+    heapf->Close();
+    heap->Free(buffer);
+
+    heap->Close();
+    }
 
 GLDEF_C TInt E32Main(void)
 	{
@@ -1178,6 +1318,7 @@
 	test.Start(_L("Test 1"));
 	UserHal::PageSizeInBytes(PageSize);
         TestRHeap T;
+
 	T.Test1();
 	test.Next(_L("Test auto expand and compress"));
 	TestAuto();
@@ -1204,10 +1345,12 @@
 	test.Next(_L("Shared heap test 3"));
 	SharedHeapTest3();
 	sem.Close();
+	test.Next(_L("Test HeapType()"));    
+	TestHeapType();
 
 	__KHEAP_CHECK(0);
 	__KHEAP_MARKEND;
-//
+
 	test.End();
 	return(0);
     }
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/heap/t_heap2.cpp
--- a/kerneltest/e32test/heap/t_heap2.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/heap/t_heap2.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -44,6 +44,10 @@
 #include <e32hal.h>
 #include <e32def.h>
 #include <e32def_private.h>
+#include "dla.h"
+#include "slab.h"
+#include "page_alloc.h"
+#include "heap_hybrid.h"
 
 // Needed for KHeapShrinkHysRatio which is now ROM 'patchdata'
 #include "TestRHeapShrink.h"
@@ -58,6 +62,10 @@
        const TInt KHeapMinCellSize = 0;
 #endif
 
+	   const TInt KAllocCellSize = (TInt)RHeap::EAllocCellSize;
+	   const TInt KSizeOfHeap = (TInt)sizeof(RHybridHeap);	   
+	   
+	   
 RTest test(_L("T_HEAP2"));
 
 #define	TEST_ALIGN(p,a)		test((TLinAddr(p)&((a)-1))==0)
@@ -78,7 +86,6 @@
 	{
 	TInt i;
 	TUint32 x = (TUint32)this ^ (TUint32)aLength ^ (TUint32)EMagic;
-	aLength -= RHeap::EAllocCellSize;
 	if (aLength==0)
 		return;
 	iLength = x;
@@ -100,8 +107,7 @@
 	{
 	TInt i;
 	TUint32 x = (TUint32)aInitPtr ^ (TUint32)aInitLength ^ (TUint32)EMagic;
-	aLength -= RHeap::EAllocCellSize;
-	if (aLength==0)
+	if ( aLength < (TInt) sizeof(*this) )
 		return;
 	test(iLength == x);
 	aLength /= sizeof(TUint32);
@@ -113,26 +119,11 @@
 		}
 	}
 
+
+	
 class RTestHeap : public RHeap
 	{
 public:
-	DECL_GET(TInt,AccessCount)
-	DECL_GET(TInt,HandleCount)
-	DECL_GET(TInt*,Handles)
-	DECL_GET(TUint32,Flags)
-	DECL_GET(TInt,CellCount)
-	DECL_GET(TInt,TotalAllocSize)
-	DECL_GET(TInt,MinLength)
-	DECL_GET(TInt,Offset)
-	DECL_GET(TInt,GrowBy)
-	DECL_GET(TInt,ChunkHandle)
-	DECL_GET2(const RFastLock&,Lock,LockRef)
-	DECL_GET(TUint8*,Top)
-	DECL_GET(TInt,Align)
-	DECL_GET(TInt,MinCell)
-	DECL_GET(TInt,PageSize)
-	DECL_GET2(const SCell&,Free,FreeRef)
-public:
 	TInt CheckAllocatedCell(const TAny* aCell) const;
 	void FullCheckAllocatedCell(const TAny* aCell) const;
 	TAny* TestAlloc(TInt aSize);
@@ -140,23 +131,11 @@
 	TAny* TestReAlloc(TAny* aPtr, TInt aSize, TInt aMode=0);
 	void FullCheck();
 	static void WalkFullCheckCell(TAny* aPtr, TCellType aType, TAny* aCell, TInt aLen);
-	TInt FreeCellLen(const TAny* aPtr) const;
-	static RTestHeap* FixedHeap(TInt aMaxLength, TInt aAlign=0, TBool aSingleThread=ETrue);
-	void TakeChunkOwnership(RChunk aChunk);
-	TInt LastFreeCellLen(void) const;
-	TInt CalcComp(TInt aCompSize);
-	void ForceCompress(TInt aFreed);
 	};
 
 TInt RTestHeap::CheckAllocatedCell(const TAny* aCell) const
 	{
-	SCell* pC = GetAddress(aCell);
-	TInt len = pC->len;
-	TUint8* pEnd = (TUint8*)pC + len;
-	TEST_ALIGN(aCell, iAlign);
-	TEST_ALIGN(len, iAlign);
-	test(len >= iMinCell);
-	test((TUint8*)pC>=iBase && pEnd<=iTop);
+	TInt len = AllocLen(aCell);
 	return len;
 	}
 
@@ -171,7 +150,7 @@
 	if (p)
 		{
 		TInt len = CheckAllocatedCell(p);
-		test((len-RHeap::EAllocCellSize)>=aSize);
+		test(len>=aSize);		
 		((STestCell*)p)->Set(len);
 		}
 	return p;
@@ -196,7 +175,7 @@
 		return p;
 		}
 	TInt new_len = CheckAllocatedCell(p);
-	test((new_len-RHeap::EAllocCellSize)>=aSize);
+	test(new_len>=aSize);		
 	if (p == aPtr)
 		{
 		((STestCell*)p)->Verify(p, old_len, Min(old_len, new_len));
@@ -207,9 +186,8 @@
 	test(!(aMode & ENeverMove));
 	test((new_len > old_len) || (aMode & EAllowMoveOnShrink));
 	if (old_len)
-		((STestCell*)p)->Verify(aPtr, old_len, Min(old_len, new_len));
-	if (new_len != old_len)
-		((STestCell*)p)->Set(new_len);
+		((STestCell*)p)->Verify(aPtr, old_len, Min(old_len, aSize));		
+    ((STestCell*)p)->Set(new_len);
 	return p;
 	}
 
@@ -230,22 +208,15 @@
 		{
 		case EGoodAllocatedCell:
 			{
-			test(aCell == info.iNextCell);
-			TInt len = ((SCell*)aCell)->len;
-			test(len == aLen);
-			info.iNextCell += len;
+			TInt len = aLen;
+			info.iTotalAllocSize += len;
+			STestCell* pT = (STestCell*)aCell;
 			++info.iTotalAlloc;
-			info.iTotalAllocSize += (aLen-EAllocCellSize);
-			STestCell* pT = (STestCell*)((TUint8*)aCell + EAllocCellSize);
 			pT->Verify(len);
 			break;
 			}
 		case EGoodFreeCell:
 			{
-			test(aCell == info.iNextCell);
-			TInt len = ((SCell*)aCell)->len;
-			test(len == aLen);
-			info.iNextCell += len;
 			++info.iTotalFree;
 			break;
 			}
@@ -261,877 +232,13 @@
 	::SHeapCellInfo info;
 	Mem::FillZ(&info, sizeof(info));
 	info.iHeap = this;
-	info.iNextCell = iBase;
 	DebugFunction(EWalk, (TAny*)&WalkFullCheckCell, &info);
-	test(info.iNextCell == iTop);
-	test(info.iTotalAlloc == iCellCount);
+	TInt count = AllocSize(iTotalAllocSize);
+	test(info.iTotalAlloc == count);
 	test(info.iTotalAllocSize == iTotalAllocSize);
-	}
-
-TInt RTestHeap::FreeCellLen(const TAny* aPtr) const
-	{
-	SCell* p = iFree.next;
-	SCell* q = (SCell*)((TUint8*)aPtr - EAllocCellSize);
-	for (; p && p!=q; p = p->next) {}
-	if (p == q)
-		return p->len - EAllocCellSize;
-	return -1;
-	}
 
-TInt RTestHeap::LastFreeCellLen(void) const
-	{
-	SCell* p = iFree.next;
-	if (p==NULL)
-		return -1;	
-	for (; p->next; p=p->next){}
-	return p->len;
-	}
-
-
-/** Checks whether a call to Compress() will actually perform a reduction 
-	of the heap.
-	Relies on the free last cell on the heap being cell that has just been freed
-	plus any extra.
-	Intended for use by t_heap2.cpp - DoTest4().  
-	@param aFreedSize The size in bytes of the cell that was freed
-*/
-TInt RTestHeap::CalcComp(TInt aFreedSize)
-	{	
-	TInt largestCell=0;
-	largestCell = LastFreeCellLen();
-	// if the largest cell is too small or it would have been compressed by the
-	// free operation then return 0.
-	if (largestCell < iPageSize || aFreedSize >= KHeapShrinkHysRatio*(iGrowBy>>8))
-		{
-		return 0;			
-		}
-		else
-		{
-		return _ALIGN_DOWN(aFreedSize,iPageSize);
-		}	
 	}
 	
-/** compress the heap if the KHeapShrinkRatio is too large for what we are
-	expecting in DoTest4().
-*/
-void RTestHeap::ForceCompress(TInt aFreed)
-	{	
-	if (aFreed < KHeapShrinkHysRatio*(iGrowBy>>8))
-		{
-		Compress();
-		}
-	}
-RTestHeap* RTestHeap::FixedHeap(TInt aMaxLength, TInt aAlign, TBool aSingleThread)
-	{
-	RChunk c;
-	TInt bottom = 0x40000;
-	TInt top = bottom + aMaxLength;
-	TInt r = c.CreateDisconnectedLocal(bottom, top, top + bottom, EOwnerThread);
-	if (r!=KErrNone)
-		return NULL;
-	TUint8* base = c.Base() + bottom;
-	RTestHeap* h = (RTestHeap*)UserHeap::FixedHeap(base, aMaxLength, aAlign, aSingleThread);
-	if (!aAlign)
-		aAlign = RHeap::ECellAlignment;
-	test((TUint8*)h == base);
-	test(h->AccessCount() == 1);
-	test(h->HandleCount() == (aSingleThread ? 0 : 1));
-	test(h->Handles() == (aSingleThread ? NULL : (TInt*)&h->LockRef()));
-	test(h->Flags() == TUint32(RAllocator::EFixedSize | (aSingleThread ? RAllocator::ESingleThreaded : 0)));
-	test(h->CellCount() == 0);
-	test(h->TotalAllocSize() == 0);
-	test(h->MaxLength() == aMaxLength);
-	test(h->MinLength() == h->Top() - (TUint8*)h);
-	test(h->Offset() == 0);
-	test(h->GrowBy() == 0);
-	test(h->ChunkHandle() == 0);
-	test(h->Align() == aAlign);
-	TInt min_cell = _ALIGN_UP((KHeapMinCellSize + Max((TInt)RHeap::EAllocCellSize, (TInt)RHeap::EFreeCellSize)), aAlign);
-	TInt hdr_len = _ALIGN_UP(sizeof(RHeap) + RHeap::EAllocCellSize, aAlign) - RHeap::EAllocCellSize;
-	TInt user_len = _ALIGN_DOWN(aMaxLength - hdr_len, aAlign);
-	test(h->Base() == base + hdr_len);
-	test(h->MinCell() == min_cell);
-	test(h->Top() - h->Base() == user_len);
-	test(h->FreeRef().next == (RHeap::SCell*)h->Base());
-	h->TakeChunkOwnership(c);
-	return h;
-	}
-
-void RTestHeap::TakeChunkOwnership(RChunk aChunk)
-	{
-	iChunkHandle = aChunk.Handle();
-	++iHandleCount;
-	iHandles = &iChunkHandle;
-	}
-
-
-#define	ACCESS_COUNT(h)		(((RTestHeap*)h)->AccessCount())
-#define	HANDLE_COUNT(h)		(((RTestHeap*)h)->HandleCount())
-#define	HANDLES(h)			(((RTestHeap*)h)->Handles())
-#define	FLAGS(h)			(((RTestHeap*)h)->Flags())
-#define	CELL_COUNT(h)		(((RTestHeap*)h)->CellCount())
-#define	TOTAL_ALLOC_SIZE(h)	(((RTestHeap*)h)->TotalAllocSize())
-#define	MIN_LENGTH(h)		(((RTestHeap*)h)->MinLength())
-#define	OFFSET(h)			(((RTestHeap*)h)->Offset())
-#define	GROW_BY(h)			(((RTestHeap*)h)->GrowBy())
-#define	CHUNK_HANDLE(h)		(((RTestHeap*)h)->ChunkHandle())
-#define	LOCK_REF(h)			(((RTestHeap*)h)->LockRef())
-#define	TOP(h)				(((RTestHeap*)h)->Top())
-#define	ALIGN(h)			(((RTestHeap*)h)->Align())
-#define	MIN_CELL(h)			(((RTestHeap*)h)->MinCell())
-#define	PAGE_SIZE(h)		(((RTestHeap*)h)->PageSize())
-#define	FREE_REF(h)			(((RTestHeap*)h)->FreeRef())
-
-void DoTest1(RHeap* aH)
-	{
-	RTestHeap* h = (RTestHeap*)aH;
-	test.Printf(_L("Test Alloc: min=%x max=%x align=%d growby=%d\n"),
-						h->MinLength(), h->MaxLength(), h->Align(), h->GrowBy());
-	TInt l;
-	TAny* p = NULL;
-	TUint8* next = h->Base();
-	TUint8* top = h->Top();
-	TUint8* limit = (TUint8*)h + h->MaxLength();
-	TBool fixed = h->Flags() & RAllocator::EFixedSize;
-	for (l=1; l<=1024; ++l)
-		{
-		TInt remain1 = top - next;
-		TInt xl1 = _ALIGN_UP(Max((l+RHeap::EAllocCellSize), h->MinCell()), h->Align());
-		p = h->TestAlloc(l);
-		if ( (fixed && remain1 < xl1) || (next + xl1 > limit) )
-			{
-			test(p == NULL);
-			test(top == h->Top());
-			test.Printf(_L("Alloc failed at l=%d next=%08x\n"), l, next);
-			break;
-			}
-		test(p == next + RHeap::EAllocCellSize);
-		if (xl1 > remain1)
-			{
-			// no room for this cell
-			TInt g = h->GrowBy();
-			while (xl1 > remain1)
-				{
-				top += g;
-				remain1 += g;
-				}
-			}
-		test(top == h->Top());
-		if (xl1 + h->MinCell() > remain1)
-			{
-			// this cell fits but remainder is too small or nonexistent
-			xl1 = top - next;
-			next = top;
-			test(h->FreeRef().next == NULL);
-			}
-		else
-			{
-			// this cell fits and remainder can be reused
-			next += xl1;
-			}
-		test(aH->AllocLen(p) == xl1 - RHeap::EAllocCellSize);
-		}
-	h->FullCheck();
-	}
-
-void DoTest2(RHeap* aH)
-	{
-	RTestHeap* h = (RTestHeap*)aH;
-	test.Printf(_L("Test Free: min=%x max=%x align=%d growby=%d\n"),
-						h->MinLength(), h->MaxLength(), h->Align(), h->GrowBy());
-	TInt al;
-	TInt min = h->MinCell();
-	TBool pad = EFalse;
-	for (al=1; al<256; (void)((pad=!pad)!=0 || (al+=al+1)) )
-		{
-		TAny* p[32];
-		TInt last_len = 0;
-		TAny* last = NULL;
-		TInt i;
-		test.Printf(_L("al=%d pad=%d\n"), al, pad);
-		TUint8* top=0;
-		TAny* spare=0;
-		TBool heapReduced = EFalse;
-		for (i=0; i<32; ++i)
-			{
-			// Check whether the cell created for the allocation of al would end up
-			// including extra bytes from the last free cell that aren't enough
-			// to create a new free cell.
-			top = h->Top();
-			TInt freeLen=h->LastFreeCellLen();
-			TInt actualAllocBytes = Max(_ALIGN_UP(al + RHeap::EAllocCellSize, h->Align()), min);
-			TInt remainingBytes = freeLen - actualAllocBytes;
-			if (remainingBytes < min)
-				{
-				// Force the heap to grow so that once this allocation is freed
-				// the free cell left will be large enough to include the al allocation
-				// and to create a new free cell if necessary.
-				actualAllocBytes = _ALIGN_UP(actualAllocBytes + min, h->Align());
-				TAny* q = h->TestAlloc(actualAllocBytes);
-				// Check heap has grown
-				test(top < h->Top());
-				top = h->Top();
-				test(q!=NULL);
-				// Have grown the heap so allocate a cell as a place holder to stop
-				// the heap being shrunk and the actual cell we want to allocate from being the
-				// wrong size
-				spare=h->TestAlloc(8);
-				h->TestFree(q);
-				// Ensure heap wasn't shrunk after free
-				test(top == h->Top());
-				}
-			top = h->Top();
-			// Allocate the new 
-			p[i] = h->TestAlloc(al);
-			test(p[i]!=NULL);
-			if (remainingBytes < min)
-				{// now safe to free any padding as p[i] now allocated and its size can't change
-				h->TestFree(spare);
-				}
-			TInt tmp1=h->AllocLen(p[i]);
-			TInt tmp2=Max(_ALIGN_UP(al+RHeap::EAllocCellSize,h->Align()), min)-RHeap::EAllocCellSize;
-			test(tmp1 == tmp2);
-			}
-		last = (TUint8*)p[31] + _ALIGN_UP(Max((al + RHeap::EAllocCellSize), min), h->Align());
-		last_len = h->FreeCellLen(last);
-		test(last_len > 0);
-		if (pad)
-			{
-			test(h->TestAlloc(last_len) == last);
-			test(h->FreeRef().next == NULL);
-			}
-		else
-			last = NULL;
-		top = h->Top();
-		for (i=0,heapReduced=EFalse; i<32; ++i)
-			{
-			h->TestFree(p[i]);
-			TInt fl = h->FreeCellLen(p[i]);
-			TInt xfl = _ALIGN_UP(Max((al + RHeap::EAllocCellSize), h->MinCell()), h->Align()) - RHeap::EAllocCellSize;
-			if (h->Top() < top) // heap was reduced due to small KHeapShrinkHysRatio and big KHeapMinCellSize
-				{
-				top = h->Top();
-				heapReduced = ETrue;
-				}
-
-			if (i < 31 || pad)
-				test(fl == xfl);
-			else
-				{
-				if (!heapReduced)
-					test(fl == xfl + RHeap::EAllocCellSize + last_len);
-				else
-					{
-					heapReduced = EFalse;
-					}
-				}
-			test(h->TestAlloc(al)==p[i]);
-			}
-		for (i=0,heapReduced=EFalse; i<31; ++i)
-			{
-			TInt j = i+1;
-			TUint8* q;
-			// Free to adjacent cells and check that the free cell left is the combined
-			// size of the 2 adjacent cells just freed
-			h->TestFree(p[i]);
-			h->TestFree(p[j]);
-			TInt fl = h->FreeCellLen(p[i]);
-			if (h->Top() < top) // heap was reduced due to small KHeapShrinkHysRatio and big KHeapMinCellSize
-				{
-				top = h->Top();
-				heapReduced = ETrue;
-				}
-			TInt xfl = 2 * _ALIGN_UP(Max((al + RHeap::EAllocCellSize), h->MinCell()), h->Align()) - RHeap::EAllocCellSize;
-			if (j < 31 || pad)
-				test(fl == xfl);
-			else
-				{
-				if (!heapReduced)
-					test(fl == xfl + RHeap::EAllocCellSize + last_len);
-				else
-					{
-					heapReduced = EFalse;
-					}
-				}
-			test(h->FreeCellLen(p[j]) < 0);
-			test(h->TestAlloc(fl)==p[i]);
-			test(h->Top() == top);
-			h->TestFree(p[i]);
-			test(h->FreeCellLen(p[i]) == fl);
-			// test when you alloc a cell that is larger than cells just freed
-			// that its position is not the same as the freed cells
-			// will hold for all cells except top/last one
-			if (j < 31 && !pad && fl < last_len)
-				{
-				q = (TUint8*)h->TestAlloc(fl+1);
-				if (h->Top() > top)
-					top = h->Top();
-				test(h->Top() == top);
-				test(q > p[i]);
-				h->TestFree(q);
-				if (h->Top() < top) // heap was reduced due to small KHeapShrinkHysRatio and big KHeapMinCellSize
-					{
-					top = h->Top();
-					heapReduced = ETrue;
-					}
-				}
-			// check cell that is just smaller than space but not small enough 
-			// for a new free cell to be created, is the size of whole free cell
-			test(h->TestAlloc(fl-min+1)==p[i]);
-			test(h->Top() == top);
-			test(h->AllocLen(p[i])==fl);
-			h->TestFree(p[i]);
-			// Check cell that is small enough for new free cell and alloc'd cell to be
-			// created at p[i] cell is created at p[i]
-			test(h->TestAlloc(fl-min)==p[i]);
-			test(h->Top() == top);
-			// check free cell is at expected position
-			q = (TUint8*)p[i] + fl - min + RHeap::EAllocCellSize;
-			test(h->FreeCellLen(q) == min - RHeap::EAllocCellSize);
-			// alloc 0 length cell at q, will work as new cell of min length will be created
-			test(h->TestAlloc(0) == q);
-			test(h->Top() == top);
-			h->TestFree(p[i]);
-			test(h->FreeCellLen(p[i]) == fl - min);
-			h->TestFree(q);
-			// again check free cells are combined
-			test(h->FreeCellLen(q) < 0);
-			test(h->FreeCellLen(p[i]) == fl);
-			// check reallocating the cells places them back to same positions
-			test(h->TestAlloc(al)==p[i]);
-			test(h->Top() == top);
-			test(h->TestAlloc(al)==p[j]);
-			test(h->Top() == top);
-			if (pad)
-				test(h->FreeRef().next == NULL);
-			}
-		for (i=0,heapReduced=EFalse; i<30; ++i)
-			{
-			TInt j = i+1;
-			TInt k = i+2;
-			TUint8* q;
-			// Free 3 adjacent cells and check free cell created is combined size
-			h->TestFree(p[i]);
-			h->TestFree(p[k]);
-			h->TestFree(p[j]);
-			h->FullCheck();
-			if (h->Top() < top) // heap was reduced due to small KHeapShrinkHysRatio and big KHeapMinCellSize
-				{
-				top = h->Top();
-				heapReduced = ETrue;
-				}
-			TInt fl = h->FreeCellLen(p[i]);
-			TInt xfl = 3 * _ALIGN_UP(Max((al + RHeap::EAllocCellSize), h->MinCell()), h->Align()) - RHeap::EAllocCellSize;
-			if (k < 31 || pad)
-				test(fl == xfl);
-			else
-				{
-				if (!heapReduced)
-					test(fl == xfl + RHeap::EAllocCellSize + last_len);
-				else
-					{
-					heapReduced = EFalse;
-					}
-				}
-			test(h->FreeCellLen(p[j]) < 0);
-			test(h->FreeCellLen(p[k]) < 0);
-			//ensure created free cell is allocated to new cell of free cell size
-			test(h->TestAlloc(fl)==p[i]);
-			test(h->Top() == top);
-			h->TestFree(p[i]);
-			test(h->FreeCellLen(p[i]) == fl);
-			if (h->Top() < top) // heap was reduced due to small KHeapShrinkHysRatio and big KHeapMinCellSize
-				top = h->Top();
-			if (k < 31 && !pad && fl < last_len)
-				{
-				// Test new cell one larger than free cell size is allocated somewhere else
-				q = (TUint8*)h->TestAlloc(fl+1);
-				if (h->Top() > top)
-					top = h->Top();
-				test(h->Top() == top); 
-				test(q > p[i]);
-				h->TestFree(q);
-				if (h->Top() < top) // heap was reduced due to small KHeapShrinkHysRatio and big KHeapMinCellSize
-					{
-					top = h->Top();
-					heapReduced = ETrue;
-					}
-				}
-			// check allocating cell just smaller than free cell size but
-			// too large for neew free cell to be created, is size of whole free cell
-			test(h->TestAlloc(fl-min+1)==p[i]);
-			test(h->Top() == top);
-			test(h->AllocLen(p[i])==fl);
-			h->TestFree(p[i]);
-			// ensure free cell is created this time as well as alloc'd cell
-			test(h->TestAlloc(fl-min)==p[i]);
-			test(h->Top() == top);
-			q = (TUint8*)p[i] + fl - min + RHeap::EAllocCellSize;
-			test(h->FreeCellLen(q) == min - RHeap::EAllocCellSize);
-			test(h->TestAlloc(0) == q);
-			test(h->Top() == top);
-			h->TestFree(p[i]);
-			test(h->FreeCellLen(p[i]) == fl - min);
-			h->TestFree(q);
-			test(h->FreeCellLen(q) < 0);
-			test(h->FreeCellLen(p[i]) == fl);
-			// realloc all cells and check heap not expanded
-			test(h->TestAlloc(al)==p[i]);
-			test(h->Top() == top);
-			test(h->TestAlloc(al)==p[j]);
-			test(h->Top() == top);
-			test(h->TestAlloc(al)==p[k]);
-			test(h->Top() == top);
-			// If padding than no space should left on heap
-			if (pad)
-				test(h->FreeRef().next == NULL);
-			}
-		// when padding this will free padding from top of heap
-		h->TestFree(last);
-		}
-	h->FullCheck();
-	}
-
-void DoTest3(RHeap* aH)
-	{
-	RTestHeap* h = (RTestHeap*)aH;
-	test.Printf(_L("Test ReAlloc: min=%x max=%x align=%d growby=%d\n"),
-						h->MinLength(), h->MaxLength(), h->Align(), h->GrowBy());
-	// allocate continuous heap cell, then free them and reallocate again
-	TInt al;
-	for (al=1; al<256; al+=al+1)
-		{
-		TAny* p0 = h->TestAlloc(al);
-		TInt al0 = h->AllocLen(p0);
-		h->TestFree(p0);
-		TAny* p1 = h->TestReAlloc(NULL, al, 0);
-		TInt al1 = h->AllocLen(p1);
-		test(p1 == p0);
-		test(al1 == al0);
-		h->TestFree(p1);
-		TAny* p2 = h->TestAlloc(1);
-		TAny* p3 = h->TestReAlloc(p2, al, 0);
-		test(p3 == p0);
-		TInt al3 = h->AllocLen(p3);
-		test(al3 == al0);
-		h->TestFree(p3);
-		TAny* p4 = h->TestAlloc(1024);
-		TAny* p5 = h->TestReAlloc(p4, al, 0);
-		test(p5 == p0);
-		TInt al5 = h->AllocLen(p5);
-		test(al5 == al0);
-		h->TestFree(p5);
-		}
-	TInt i;
-	TInt j;
-	for (j=0; j<30; j+=3)
-		{
-		TAny* p[30];
-		TInt ala[30];
-		TInt fla[30];
-		h->Reset();
-		for (i=0; i<30; ++i)
-			{
-			p[i] = h->TestAlloc(8*i*i);
-			ala[i] = h->AllocLen(p[i]);
-			fla[i] = 0;
-			}
-		for (i=1; i<30; i+=3)
-			{
-			h->TestFree(p[i]);
-			fla[i] = h->FreeCellLen(p[i]);
-			test(fla[i] == ala[i]);
-			test(h->FreeCellLen(p[i-1]) < 0);
-			test(h->FreeCellLen(p[i+1]) < 0);
-			}
-		h->FullCheck();
-		TInt al1 = _ALIGN_UP(Max((RHeap::EAllocCellSize + 1), h->MinCell()), h->Align());
-		// adjust al1 for some case when reallocated heap cell will not be shrinked because remainder will not big enough
-		// to form a new free cell due to a big KHeapMinCellSize value
-		TInt alaj = ala[j] + RHeap::EAllocCellSize;
-		if (al1 < alaj && alaj - al1 < h->MinCell())
-			al1 = alaj;
-		TAny* p1 = h->TestReAlloc(p[j], 1, RHeap::ENeverMove);
-		test(p1 == p[j]);
-		test(h->AllocLen(p1) == al1 - RHeap::EAllocCellSize);
-		TAny* p1b = (TUint8*)p1 + al1;
-		test(h->FreeCellLen(p1b) == fla[j+1] + RHeap::EAllocCellSize + ala[j] - al1);
-		TInt l2 = ala[j] + fla[j+1] + RHeap::EAllocCellSize; // max without moving
-		TInt l3 = l2 - h->MinCell();
-		TAny* p3 = h->TestReAlloc(p[j], l3, RHeap::ENeverMove);
-		test(p3 == p[j]);
-		TAny* p3b = (TUint8*)p3 + h->AllocLen(p3) + RHeap::EAllocCellSize;
-		test(h->FreeCellLen(p3b) == h->MinCell() - RHeap::EAllocCellSize);
-		TAny* p2 = h->TestReAlloc(p[j], l2, RHeap::ENeverMove);
-		test(p2 == p[j]);
-		test(h->AllocLen(p2) == l2);
-		TAny* p4 = h->TestReAlloc(p[j], l2+1, RHeap::ENeverMove);
-		test(p4 == NULL);
-		test(h->AllocLen(p2) == l2);
-		TAny* p5 = h->TestReAlloc(p[j], l2+1, 0);
-		TInt k = 0;
-		for (; k<30 && fla[k] <= l2; ++k) {}
-		if (k < 30)
-			test(p5 == p[k]);
-		else
-			test(p5 >= (TUint8*)p[29] + ala[29]);
-		test(h->FreeCellLen(p2) == ala[j] + ala[j+1] + RHeap::EAllocCellSize);
-		TInt ali = _ALIGN_UP(RHeap::EAllocCellSize,h->Align());
-		TAny* p6b = (TUint8*)p[j+2] + ala[j+2] - ali + RHeap::EAllocCellSize;
-		test(h->FreeCellLen(p6b) < 0);
-		TAny* p6 = h->TestReAlloc(p[j+2], ala[j+2] - ali , 0);
-		test(p6 == p[j+2]);
-		if (h->AllocLen(p6) != ala[j+2]) // allocated heap cell size changed
-			test(h->FreeCellLen(p6b) == h->MinCell() - RHeap::EAllocCellSize);
-		TInt g = h->GrowBy();
-		TAny* p7 = h->TestReAlloc(p5, 8*g, 0);
-		test(p7 >= p5);
-		TUint8* p8 = (TUint8*)p7 - RHeap::EAllocCellSize + al1;
-		TUint8* p9 = (TUint8*)_ALIGN_UP(TLinAddr(p8), h->PageSize());
-		if (p9-p8 < h->MinCell())
-			p9 += h->PageSize();
-		TAny* p7b = h->TestReAlloc(p7, 1, 0);
-		test(p7b == p7);
-		test(h->Top() + (RHeap::EAllocCellSize & (h->Align()-1)) == p9);
-
-		h->FullCheck();
-		}
-	}
-
-// Test compression
-// {1 free cell, >1 free cell} x {reduce cell, eliminate cell, reduce cell but too small}
-//
-void DoTest4(RHeap* aH)
-	{
-	RTestHeap* h = (RTestHeap*)aH;
-	test.Printf(_L("Test Compress: min=%x max=%x align=%d growby=%d\n"),
-						h->MinLength(), h->MaxLength(), h->Align(), h->GrowBy());
-	TInt page_size;
-	UserHal::PageSizeInBytes(page_size);
-	test(page_size == h->PageSize());
-	TInt g = h->GrowBy();
-	TEST_ALIGN(g, page_size);
-	test(g >= page_size);
-	RChunk c;
-	c.SetHandle(h->ChunkHandle());
-	TInt align = h->Align();
-	TInt minc = h->MinCell();
-
-	TInt orig_size = c.Size();
-	TUint8* orig_top = h->Top();
-
-	// size in bytes that last free cell on the top of the heap must be 
-	// before the heap will be shrunk, size must include the no of bytes to
-	// store the cell data/header i.e RHeap::EAllocCellSize
-	TInt shrinkThres = KHeapShrinkHysRatio*(g>>8);
-
-	TInt pass;
-	for (pass=0; pass<2; ++pass)
-		{
-		TUint8* p0 = (TUint8*)h->TestAlloc(4);
-		test(p0 == h->Base() + RHeap::EAllocCellSize);
-		TInt l1 = h->Top() - (TUint8*)h->FreeRef().next;
-		TEST_ALIGN(l1, align);
-		l1 -= RHeap::EAllocCellSize;
-		TUint8* p1;
-		// Grow heap by 2*iGrowBy bytes
-		p1 = (TUint8*)h->TestAlloc(l1 + 2*g);
-		test(p1 == p0 + h->AllocLen(p0) + RHeap::EAllocCellSize);
-		test(h->Top() - orig_top == 2*g);
-		test(c.Size() - orig_size == 2*g);
-		// May compress heap, may not
-		h->TestFree(p1);
-		h->ForceCompress(2*g);
-		test(h->Top() == orig_top);
-		test(c.Size() == orig_size);
-		test((TUint8*)h->FreeRef().next == p1 - RHeap::EAllocCellSize);
-		h->FullCheck();
-		//if KHeapShrinkHysRatio is > 2.0 then heap compression will occur here
-		test(h->Compress() == 0);
-		test(h->TestAlloc(l1) == p1);
-		test(h->FreeRef().next == NULL);
-		if (pass)
-			h->TestFree(p0);	// leave another free cell on second pass
-		TInt l2 = g - RHeap::EAllocCellSize;
-		// Will grow heap by iGrowBy bytes
-		TUint8* p2 = (TUint8*)h->TestAlloc(l2);
-		test(p2 == orig_top + RHeap::EAllocCellSize);
-		test(h->Top() - orig_top == g);
-		test(c.Size() - orig_size == g);
-		// may or may not compress heap
-		h->TestFree(p2);
-		if (l2+RHeap::EAllocCellSize >= shrinkThres)
-			{
-			// When KHeapShrinkRatio small enough heap will have been compressed
-			test(h->Top() == orig_top);			
-			if (pass)
-				{
-				test((TUint8*)h->FreeRef().next == p0 - RHeap::EAllocCellSize);
-				test((TUint8*)h->FreeRef().next->next == NULL);
-				}
-			else
-				test((TUint8*)h->FreeRef().next == NULL);
-			}
-		else
-			{			
-			test(h->Top() - orig_top == g);
-			if (pass)
-				{
-				test((TUint8*)h->FreeRef().next == p0 - RHeap::EAllocCellSize);
-				test((TUint8*)h->FreeRef().next->next == orig_top);
-				}
-			else
-				test((TUint8*)h->FreeRef().next == orig_top);
-			}
-		// this compress will only do anything if the KHeapShrinkRatio is large 
-		// enough to introduce hysteresis otherwise the heap would have been compressed 
-		// by the free operation itself
-		TInt tmp1,tmp2;
-		tmp2=h->CalcComp(g);
-		tmp1=h->Compress();
-		test(tmp1 == tmp2);
-		test(h->Top() == orig_top);
-		test(c.Size() == orig_size);
-		h->FullCheck();
-		// shouldn't compress heap as already compressed
-		test(h->Compress() == 0);
-		//grow heap by iGrowBy bytes
-		test(h->TestAlloc(l2) == p2);
-		//grow heap by iGrowBy bytes
-		TUint8* p3 = (TUint8*)h->TestAlloc(l2);
-		test(p3 == p2 + g);
-		test(h->Top() - orig_top == 2*g);
-		test(c.Size() - orig_size == 2*g);
-		// may or may not reduce heap
-		h->TestFree(p2);
-		// may or may not reduce heap
-		h->TestFree(p3);
-		h->ForceCompress(2*g);
-		test(h->Top() == orig_top);
-		test(c.Size() == orig_size);
-		h->FullCheck();
-		if (pass)
-			{
-			test((TUint8*)h->FreeRef().next == p0 - RHeap::EAllocCellSize);
-			test((TUint8*)h->FreeRef().next->next == NULL);
-			}
-		else
-			test((TUint8*)h->FreeRef().next == NULL);
-		//grow heap by iGrowBy bytes
-		test(h->TestAlloc(l2) == p2);
-		//grow heap by iGrowBy*2 + page size bytes
-		test(h->TestAlloc(l2 + g + page_size) == p3);
-		test(h->Top() - orig_top == 4*g);
-		test(c.Size() - orig_size == 4*g);
-		// will compress heap if KHeapShrinkHysRatio <= KHeapShrinkRatioDflt
-		test(h->TestReAlloc(p3, page_size - RHeap::EAllocCellSize, 0) == p3);
-		h->ForceCompress(g+page_size);
-		test(h->Top() - orig_top == g + page_size);
-		test(c.Size() - orig_size == g + page_size);
-		h->FullCheck();
-		// will compress heap if KHeapShrinkHysRatio <= KHeapShrinkRatio1
-		h->TestFree(p2);
-		// will compress heap if KHeapShrinkHysRatio <= KHeapShrinkRatio1 && g<=page_size
-		// or KHeapShrinkHysRatio >= 2.0 and g==page_size
-		h->TestFree(p3);
-		// may or may not perform further compression
-		tmp1=h->CalcComp(g+page_size);
-		tmp2=h->Compress();
-		test(tmp1 == tmp2);
-		test(h->Top() == orig_top);
-		test(c.Size() == orig_size);
-		h->FullCheck();
-		test(h->TestAlloc(l2 - minc) == p2);
-		test(h->TestAlloc(l2 + g + page_size + minc) == p3 - minc);
-		test(h->Top() - orig_top == 4*g);
-		test(c.Size() - orig_size == 4*g);
-		h->TestFree(p3 - minc);
-		h->ForceCompress(l2 + g + page_size + minc);
-		test(h->Top() - orig_top == g);
-		test(c.Size() - orig_size == g);
-		h->FullCheck();
-		if (pass)
-			{
-			test((TUint8*)h->FreeRef().next == p0 - RHeap::EAllocCellSize);
-			test((TUint8*)h->FreeRef().next->next == p3 - minc - RHeap::EAllocCellSize);
-			}
-		else
-			test((TUint8*)h->FreeRef().next == p3 - minc - RHeap::EAllocCellSize);
-		h->TestFree(p2);
-		if (l2+RHeap::EAllocCellSize >= shrinkThres)
-			{
-			// When KHeapShrinkRatio small enough heap will have been compressed
-			test(h->Top() == orig_top);
-			test(c.Size() - orig_size == 0);
-			}
-		else
-			{
-			test(h->Top() - orig_top == g);
-			test(c.Size() - orig_size == g);
-			}
-		h->FullCheck();
-		if ( ((TLinAddr)orig_top & (align-1)) == 0)
-			{
-			TAny* free;
-			TEST_ALIGN(p2 - RHeap::EAllocCellSize, page_size);
-			// will have free space of g-minc
-			test(h->TestAlloc(l2 + minc) == p2);
-			test(h->Top() - orig_top == 2*g);
-			test(c.Size() - orig_size == 2*g);
-			free = pass ? h->FreeRef().next->next : h->FreeRef().next;
-			test(free != NULL);
-			test(h->TestReAlloc(p2, l2 - 4, 0) == p2);
-			TInt freeSp = g-minc + (l2+minc - (l2-4));
-			TInt adjust = 0;
-			if (freeSp >= shrinkThres && freeSp-page_size >= minc)
-				{
-				// if page_size is less than growBy (g) then heap will be shrunk
-				// by less than a whole g.
-				adjust = g-((page_size<g)?page_size:0);
-				}
-			test(h->Top() - orig_top == 2*g - adjust);
-			test(c.Size() - orig_size == 2*g - adjust);
-			free = pass ? h->FreeRef().next->next : h->FreeRef().next;
-			test(free != NULL);
-			TEST_ALIGN(TLinAddr(free)+4, page_size);
-			test(h->TestAlloc(l2 + g + page_size + 4) == p3 - 4);
-			test(h->Top() - orig_top == 4*g - adjust);
-			test(c.Size() - orig_size == 4*g - adjust);
-			h->TestFree(p3 - 4);
-			h->ForceCompress(l2 + g + page_size + 4);
-			test(h->Top() - orig_top == g + page_size);
-			test(c.Size() - orig_size == g + page_size);
-			h->FullCheck();
-			h->TestFree(p2);
-			h->ForceCompress(l2-4);
-			test(h->Compress() == 0);
-			// check heap is grown, will have free space of g-minc
-			test(h->TestAlloc(l2 + minc) == p2);
-			test(h->Top() - orig_top == 2*g);
-			test(c.Size() - orig_size == 2*g);
-			free = pass ? h->FreeRef().next->next : h->FreeRef().next;
-			test(free != NULL);
-			// may shrink heap as will now have g+minc free bytes
-			test(h->TestReAlloc(p2, l2 - minc, 0) == p2);
-			if (g+minc >= shrinkThres)
-				{
-				test(h->Top() - orig_top == g);
-				test(c.Size() - orig_size == g);
-				}
-			else
-				{
-				test(h->Top() - orig_top == 2*g);
-				test(c.Size() - orig_size == 2*g);
-				}
-			free = pass ? h->FreeRef().next->next : h->FreeRef().next;
-			test(free != NULL);
-			TEST_ALIGN(TLinAddr(free)+minc, page_size);
-			test(h->TestAlloc(l2 + g + page_size + minc) == p3 - minc);
-			test(h->Top() - orig_top == 4*g);
-			test(c.Size() - orig_size == 4*g);
-			h->TestFree(p3 - minc);
-			h->ForceCompress(l2 + g + page_size + minc);
-			test(h->Top() - orig_top == g);
-			test(c.Size() - orig_size == g);
-			h->FullCheck();
-			h->TestFree(p2);
-			}
-
-		h->TestFree(p1);
-		if (pass == 0)
-			h->TestFree(p0);
-		h->Compress();
-		}
-	h->FullCheck();
-	}
-
-void Test1()
-	{
-	RHeap* h;
-	h = RTestHeap::FixedHeap(0x1000, 0);
-	test(h != NULL);
-	DoTest1(h);
-	h->Close();
-	h = RTestHeap::FixedHeap(0x1000, 0, EFalse);
-	test(h != NULL);
-	DoTest1(h);
-	h->Close();
-	h = RTestHeap::FixedHeap(0x10000, 64);
-	test(h != NULL);
-	DoTest1(h);
-	h->Close();
-	h = RTestHeap::FixedHeap(0x100000, 4096);
-	test(h != NULL);
-	DoTest1(h);
-	h->Close();
-	h = RTestHeap::FixedHeap(0x100000, 8192);
-	test(h != NULL);
-	DoTest1(h);
-	h->Close();
-	h = UserHeap::ChunkHeap(&KNullDesC(), 0x1000, 0x1000, 0x1000, 4);
-	test(h != NULL);
-	DoTest1(h);
-	h->Close();
-	h = UserHeap::ChunkHeap(&KNullDesC(), 0x1000, 0x10000, 0x1000, 4);
-	test(h != NULL);
-	DoTest1(h);
-	h->Close();
-	h = UserHeap::ChunkHeap(&KNullDesC(), 0x1000, 0x100000, 0x1000, 4096);
-	test(h != NULL);
-	DoTest1(h);
-	h->Close();
-	h = UserHeap::ChunkHeap(&KNullDesC(), 0x1000, 0x100000, 0x1000, 4);
-	test(h != NULL);
-	DoTest1(h);
-	h->Reset();
-	DoTest2(h);
-	h->Reset();
-	DoTest3(h);
-	h->Reset();
-	DoTest4(h);
-	h->Close();
-	h = UserHeap::ChunkHeap(&KNullDesC(), 0x1000, 0x100000, 0x1000, 8);
-	test(h != NULL);
-	DoTest1(h);
-	h->Reset();
-	DoTest2(h);
-	h->Reset();
-	DoTest3(h);
-	h->Reset();
-	DoTest4(h);
-	h->Close();
-	h = UserHeap::ChunkHeap(&KNullDesC(), 0x1000, 0x100000, 0x1000, 16);
-	test(h != NULL);
-	DoTest1(h);
-	h->Reset();
-	DoTest2(h);
-	h->Reset();
-	DoTest3(h);
-	h->Reset();
-	DoTest4(h);
-	h->Close();
-	h = UserHeap::ChunkHeap(&KNullDesC(), 0x1000, 0x100000, 0x1000, 32);
-	test(h != NULL);
-	DoTest1(h);
-	h->Reset();
-	DoTest2(h);
-	h->Reset();
-	DoTest3(h);
-	h->Reset();
-	DoTest4(h);
-	h->Close();
-	h = UserHeap::ChunkHeap(&KNullDesC(), 0x3000, 0x100000, 0x3000, 4);
-	test(h != NULL);
-	DoTest1(h);
-	h->Reset();
-	DoTest2(h);
-	h->Reset();
-	DoTest3(h);
-	h->Reset();
-	DoTest4(h);
-	h->Close();
-	}
-
 struct SHeapStress
 	{
 	RThread iThread;
@@ -1277,8 +384,7 @@
 void DoStressTest1(RAllocator* aAllocator)
 	{
 	RTestHeap* h = (RTestHeap*)aAllocator;
-	test.Printf(_L("Test Stress 1: min=%x max=%x align=%d growby=%d\n"),
-						h->MinLength(), h->MaxLength(), h->Align(), h->GrowBy());
+	test.Printf(_L("Test Stress 1: max=%x\n"),	h->MaxLength());
 	SHeapStress hs;
 	hs.iSeed = 0xb504f334;
 	hs.iAllocator = aAllocator;
@@ -1292,8 +398,7 @@
 void DoStressTest2(RAllocator* aAllocator)
 	{
 	RTestHeap* h = (RTestHeap*)aAllocator;
-	test.Printf(_L("Test Stress 2: min=%x max=%x align=%d growby=%d\n"),
-						h->MinLength(), h->MaxLength(), h->Align(), h->GrowBy());
+	test.Printf(_L("Test Stress 2: max=%x\n"),	h->MaxLength());	
 	SHeapStress hs1;
 	SHeapStress hs2;
 	hs1.iSeed = 0xb504f334;
@@ -1330,39 +435,31 @@
 TInt TestHeapGrowInPlace(TInt aMode)
     {
     TBool reAllocs=EFalse;
-    TBool heapGrew=EFalse;
-    
     RHeap* myHeap;
-    
-    myHeap = UserHeap::ChunkHeap(NULL,0x1000,0x4000,0x1000);
+	//
+	// Fixed DL heap used. 
+	//
+	myHeap = UserHeap::ChunkHeap(NULL,0x4000,0x4000,0x1000);
     
     TAny *testBuffer,*testBuffer2;
     // Start size chosen so that 1st realloc will use up exactly all the heap.
     // Later iterations wont, and there will be a free cell at the end of the heap.
-    TInt currentSize = ((0x800) - sizeof(RHeap)) - RHeap::EAllocCellSize;
+    TInt currentSize = ((0x800) - KSizeOfHeap) - KAllocCellSize;
     TInt growBy = 0x800;
-    TInt newSpace, space;
-    
+
     testBuffer2 = myHeap->Alloc(currentSize);
 
-    newSpace = myHeap->Size();
     do 
     {
-    	space = newSpace;
-		testBuffer = testBuffer2;
+    	testBuffer = testBuffer2;
 	    currentSize+=growBy;
 		testBuffer2 = myHeap->ReAlloc(testBuffer,currentSize,aMode);	
 		
-		newSpace = myHeap->Size();
-		
 		if (testBuffer2) 
 			{
 				
 			if (testBuffer!=testBuffer2)
 					reAllocs = ETrue;
-				
-			if (newSpace>space)
-					heapGrew = ETrue;
 			}
 		growBy-=16;
  	} while (testBuffer2);
@@ -1377,11 +474,6 @@
     	test.Printf(_L("Failure - Memory was moved!\n"));
     	return -100;
     	}
-    if (!heapGrew) 
-    	{
-    	test.Printf(_L("Failure - Heap Never Grew!\n"));
-    	return -200;
-    	}
     if (currentSize<= 0x3000) 
     	{
     	test.Printf(_L("Failed to grow by a reasonable amount!\n"));
@@ -1440,15 +532,51 @@
 	TestDEF078391Heap->Close();
 	}
 
+void PageBitmapGrowTest()
+	{
+	// Create a large heap to allocate 4 Mb memory (64 * 68 kb).
+	test.Next(_L("Allocate 64 * 68 kbytes to cause page bitmap growing"));
+	RHeap* myHeap;
+	myHeap = UserHeap::ChunkHeap(NULL,0x1000,0x500000,0x1000);
+	test(myHeap!=NULL);
+	TInt OrigSize = myHeap->Size();	
+	TUint8* cell[64];
+		// allocate all cells
+	TInt i;
+	RTestHeap* h = (RTestHeap*)myHeap;
+	for (i=0; i<64; ++i)
+		{
+		cell[i] = (TUint8*)h->TestAlloc(0x11000);
+		test(cell[i]!=NULL);
+    	}
+	h->FullCheck();
+	
+	// Release all allocated buffers by reseting heap
+	TInt Size = myHeap->Size();
+	test(Size > 0x400000);	
+	myHeap->Reset();
+	TInt Count = myHeap->AllocSize(Size);
+ 	test(Count==0);
+	test(Size==0);
+	Size = myHeap->Size();
+	test(Size==OrigSize);
+	
+	h->Close();
+	
+	}
+	
 TInt E32Main()
 	{
 	test.Title();
 	__KHEAP_MARK;
 	test.Start(_L("Testing heaps"));
 	TestDEF078391();
-	Test1();
 	StressTests();
 	ReAllocTests();
+	//
+	// Some special tests for slab- and paged allocator
+	//
+	PageBitmapGrowTest();	
 	test.End();
 	__KHEAP_MARKEND;
 	return 0;
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/heap/t_heapcheck.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/heap/t_heapcheck.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,652 @@
+// Copyright (c) 2008-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test\debug\t_heapcorruption.cpp
+// This is a test application that will cause heap corruption 
+// to generate BTrace events (EHeapCorruption).
+// 
+//
+
+//  Include Files
+#include <e32test.h>
+#include <e32base.h>
+#include <e32panic.h>
+#include <e32cmn.h>
+#include "dla.h"
+#include "slab.h"
+#include "page_alloc.h"
+#include "heap_hybrid.h"
+
+LOCAL_D RTest test(_L("T_HEAPCHECK"));
+
+TUint32 gSeed = 0xb504f334;
+
+_LIT(KLitHeapCheck,"Heap Check");
+
+
+TUint32 Random()
+{
+	gSeed *= 69069;
+	gSeed += 41;
+	return gSeed;
+}
+
+TInt RandomNumber(TInt aMin, TInt aMax)
+{
+	TInt y = aMax - aMin;
+	if ( y <= 0 )
+		return aMax;
+	TUint32 x = Random() & 0xff;
+	TInt s = 0;
+	while ( y > (0x100 << s) )
+		{
+		s++;
+		}
+	return (aMin + (x << s) % y);
+}
+
+
+/**
+Friend class of RHeapHybrid to access to hybrid heap metadata
+*/
+class TestHybridHeap
+{
+	public:
+		TBool Init();
+		TBool Check();
+		TUint8* Alloc(TInt aLth);
+		TUint8* ReAlloc(TAny* aBfr, TInt aLth, TInt aMode);
+		void   Free(TAny* aBfr);
+		TInt  AllocLen(TAny* aBfr);
+		TInt  AllocSize(TInt& aTotalAllocSize);						
+		TBool SlabAllocatorExists();
+		TBool PageAllocatorExists();			   
+		TBool SlabsCreated();
+		TBool CorruptSmallBin();
+		TBool CorruptTreeBin();
+		TBool ConfigurePageAllocator();
+		TInt  CopyPageBitmap(TUint8* aBitmap, TInt aLth);
+		TBool RestorePageBitmap(TUint8* aBitmap, TInt aLth);
+		void AllocateSomeBuffers(TUint8** aBfrs, TInt aMinLth, TInt MaxLth, TInt aCount);
+		TBool PrintHeapInitData();		
+
+	private:
+		RHybridHeap* iHybridHeap;
+};
+
+
+
+TBool TestHybridHeap::Init()
+{
+	RHybridHeap::STestCommand cmd;
+	cmd.iCommand = RHybridHeap::EHeapMetaData;
+	RAllocator& heap = User::Allocator();
+	TInt ret = heap.DebugFunction(RHeap::EHybridHeap, &cmd, 0);
+	if (ret != KErrNone)
+		return EFalse;
+	iHybridHeap = (RHybridHeap*) cmd.iData;
+	
+	return ETrue;
+}
+
+TBool TestHybridHeap::Check()
+{
+	if ( iHybridHeap )
+		{
+		iHybridHeap->Check();  
+		}
+
+	return EFalse;
+}
+
+TUint8* TestHybridHeap::Alloc(TInt aLth)
+{
+	if ( iHybridHeap )
+		{
+		return (TUint8*)iHybridHeap->Alloc(aLth);  
+		}
+
+	return NULL;
+}
+
+TUint8* TestHybridHeap::ReAlloc(TAny* aBfr, TInt aLth, TInt aMode)
+{
+	if ( iHybridHeap )
+		{
+		return (TUint8*)iHybridHeap->ReAlloc(aBfr, aLth, aMode);  
+		}
+
+	return NULL;
+}
+
+void TestHybridHeap::Free(TAny* aBfr)
+{
+	if ( iHybridHeap )
+		{
+		iHybridHeap->Free(aBfr);  
+		}
+}
+
+TInt TestHybridHeap::AllocLen(TAny* aBfr)
+{
+	if ( iHybridHeap )
+		{
+		return iHybridHeap->AllocLen(aBfr);  
+		}
+	return 0;
+}
+
+TInt TestHybridHeap::AllocSize(TInt& aTotalAllocSize)
+{
+	aTotalAllocSize = 0;
+	if ( iHybridHeap )
+		{
+		return iHybridHeap->AllocSize(aTotalAllocSize);  
+		}
+	return 0;
+}
+
+TBool TestHybridHeap::SlabAllocatorExists()
+{
+	TBool status = EFalse;
+	if ( iHybridHeap )
+		{
+		status = !iHybridHeap->iDLOnly;
+		}
+	
+	return status;
+}
+
+TBool TestHybridHeap::PageAllocatorExists()
+{
+	TBool status = EFalse;
+	if ( iHybridHeap )
+		{
+		status = (!iHybridHeap->iDLOnly && (iHybridHeap->iPageThreshold < 31));
+		}
+
+	return status;
+}
+
+TBool TestHybridHeap::SlabsCreated()
+{
+	TBool status = EFalse;
+	if ( iHybridHeap )
+		{
+		status = (iHybridHeap->iSlabThreshold != 0);
+		}
+
+	return status;
+}
+
+TBool TestHybridHeap::ConfigurePageAllocator()
+{
+	TBool status = EFalse;
+	if ( iHybridHeap )
+		{
+		RHybridHeap::STestCommand conf;
+		conf.iCommand = RHybridHeap::ESetConfig;
+		conf.iConfig.iPagePower = 14;  // 16 Kb		
+		if ( iHybridHeap->DebugFunction(RHeap::EHybridHeap, (TAny*)&conf ) == KErrNone )
+			status = ETrue;
+		}
+
+	return status;
+}
+
+
+TBool TestHybridHeap::CorruptTreeBin()
+{
+	TBool status = EFalse;
+	if ( iHybridHeap )
+		{
+		TUint i;
+		for (i = 0; i < NTREEBINS; ++i)
+			{
+			tbinptr* tb = TREEBIN_AT(&iHybridHeap->iGlobalMallocState, i);
+			tchunkptr t = *tb;
+			if ( t )
+				{
+				// Corrupt tree bin by writing erroneous index value
+				t->iIndex ++;
+				return ETrue;
+				}
+			}
+		}
+
+	return status;
+}
+
+TBool TestHybridHeap::CorruptSmallBin()
+{
+	TBool status = EFalse;
+	if ( iHybridHeap )
+		{
+		TUint i;
+		for (i = 0; i < NSMALLBINS; ++i)
+			{
+			sbinptr b = SMALLBIN_AT(&iHybridHeap->iGlobalMallocState, i);
+			mchunkptr p = b->iBk;
+			if ( p != b )
+				{ 
+				b->iBk = b;
+				status = ETrue;
+				}
+			}
+		}
+
+	return status;
+}
+
+TInt TestHybridHeap::CopyPageBitmap(TUint8* aBitmap, TInt aLth)
+{
+	TInt lth = 0;
+	if ( iHybridHeap && (aLth > (TInt) sizeof(iHybridHeap->iBitMapBuffer)) )
+		{// Dirty version
+		memcpy(aBitmap, &iHybridHeap->iBitMapBuffer[0], sizeof(iHybridHeap->iBitMapBuffer));
+        lth = sizeof(iHybridHeap->iBitMapBuffer) << 3;
+		}
+
+	return lth;
+}
+
+TBool TestHybridHeap::RestorePageBitmap(TUint8* aBitmap, TInt aLth)
+{
+	TBool status = EFalse;
+	if ( iHybridHeap && ((aLth >> 3) <= (TInt) sizeof(iHybridHeap->iBitMapBuffer)) )
+		{// Dirty version
+		memcpy(&iHybridHeap->iBitMapBuffer[0], aBitmap, (aLth >> 3));
+		status = ETrue;
+		}
+
+	return status;
+}
+
+void TestHybridHeap::AllocateSomeBuffers(TUint8** aBfrs, TInt aMinLth, TInt MaxLth, TInt aCount )
+{
+	
+	TInt loop = RandomNumber(2, 8);
+
+	while ( loop )
+		{
+		// allocate all buffers
+		TInt i;
+		for (i=0; i<aCount; ++i)
+			{
+			if (!aBfrs[i])
+				{
+				aBfrs[i] = (TUint8*)Alloc(RandomNumber(aMinLth, MaxLth));
+				}
+			}
+
+		// free some cells
+		TInt n = RandomNumber(2, aCount);
+		while (--n)
+			{
+			i = RandomNumber(2, aCount);
+			if (aBfrs[i])
+				{
+				Free(aBfrs[i]);
+				aBfrs[i] = NULL;
+				}
+			}
+
+		// realloc some cells
+		n = RandomNumber(2, aCount);
+		while (--n)
+			{
+			TInt new_len = RandomNumber(aMinLth, MaxLth);
+			if (aBfrs[i])
+				{
+				TUint8* p = (TUint8*)ReAlloc(aBfrs[i], new_len, Random());
+				if (p)
+					{
+					aBfrs[i] = p;
+					}
+				}
+			}
+
+		loop --;
+		}
+
+}	
+
+TBool TestHybridHeap::PrintHeapInitData()
+{
+	TInt total;
+	TInt count = AllocSize(total);
+	RDebug::Printf("Heap initialised for test, alloc count: %d , alloc size: %d\n", count, total);
+	if ( iHybridHeap )
+		RDebug::Printf("Heap initialised for test, iCellCount: %d , iTotalAllocSize: %d\n", iHybridHeap->iCellCount, iHybridHeap->iTotalAllocSize);	    	
+	return (count != 0);
+}
+
+
+//  Local Functions
+LOCAL_D TInt HeapCheckTestThread(TAny* param)
+{
+	TInt t = *((TInt*)param);
+	TUint8* bfrs[256];
+	Mem::FillZ(bfrs, sizeof(bfrs));
+	TestHybridHeap heap;
+	test(heap.Init());
+
+	switch( t )
+		{
+		case 1:
+			{
+			// Overwrite Doug Lea buffer and check()
+			heap.AllocateSomeBuffers(bfrs, 0x40, 0xfff0, 256);
+			test(heap.PrintHeapInitData());
+			TUint8 *p = heap.Alloc(64);
+			test( p != NULL );
+			Mem::FillZ(p, 80);  // Heap corrupted
+			heap.Check();    // This should cause panic
+			break;
+			}
+
+		case 2:
+			// Corrupt a smallbin and check
+			{
+			TInt i = 0;
+			TBool smallbin_corrupted = EFalse;
+			while ( !smallbin_corrupted )
+				{
+				heap.AllocateSomeBuffers(bfrs, 0x4, 0xff, 256);
+				smallbin_corrupted = heap.CorruptSmallBin();
+				i ++;
+				if ( i > 9 )
+					break;
+				}
+			test(smallbin_corrupted);
+    		test(heap.PrintHeapInitData());
+			heap.Check();    // This should cause panic
+			}
+			break;
+
+		case 3:
+			// Corrupt a treebin and check
+			{
+			TInt i = 0;
+			TBool treebin_corrupted = EFalse;
+			while ( !treebin_corrupted )
+				{
+				heap.AllocateSomeBuffers(bfrs, 0x100, 0x4000, 256);
+				treebin_corrupted = heap.CorruptTreeBin();
+				i ++;
+				if ( i > 9 )
+					break;
+				}
+			test(treebin_corrupted);
+			test(heap.PrintHeapInitData());						
+			heap.Check();    // This should cause panic
+			break;
+			}
+
+		case 10:
+			// Overwrite slab buffer and check
+			{
+			TInt i = 0;
+			TBool slabs_created = EFalse;
+			if ( !heap.SlabAllocatorExists() )
+				{
+				User::Panic(KLitHeapCheck, ETHeapDebugUnmatchedCallToCheckHeap);
+				}
+
+			while ( !slabs_created )
+				{
+				// Allocate enough buffers to cause slab allocator to be
+				// initialised  		
+				heap.AllocateSomeBuffers(bfrs, 0x4, 0x2000, 256);
+				slabs_created = heap.SlabsCreated();
+				i ++;
+				if ( i > 9 )
+					break;
+				}
+			test(slabs_created);
+			test(heap.PrintHeapInitData());						
+			i = 0;
+			TUint8* p[10];
+			while ( i < 10 )
+				{
+				p[i] = heap.Alloc(24);
+				test( p[i] != NULL );
+				i ++;
+				}
+			i = 0;
+			while ( i < 10 )
+				{
+				heap.Free(p[i]);	
+				i +=2;
+				}
+			p[0] = heap.Alloc(24);
+			test( p[0] != NULL );
+			memset((TUint8*)(Floor(p[0], SLABSIZE) + sizeof(slabhdr)), 0xee, KMaxSlabPayload);  // Heap corrupted
+			heap.Check();         // This should cause panic
+			break;
+			}
+
+		case 11:
+			// Corrupt slab header
+			{
+			TInt i = 0;
+			TBool slabs_created = EFalse;
+			if ( !heap.SlabAllocatorExists() )
+				{
+				User::Panic(KLitHeapCheck, ETHeapDebugUnmatchedCallToCheckHeap);
+				}
+
+			while ( !slabs_created )
+				{
+				// Allocate enough buffers to cause slab allocator to be
+				// initialised  		
+				heap.AllocateSomeBuffers(bfrs, 0x4, 0x2000, 256);
+				slabs_created = heap.SlabsCreated();
+				i ++;
+				if ( i > 9 )
+					break;
+				}
+			test(slabs_created);
+			test(heap.PrintHeapInitData());						
+			TUint8* p = heap.Alloc(28);
+			test(p != NULL);
+			p = Floor(p, SLABSIZE);
+			*(TUint32*)p = 0xffeeddcc;
+			heap.Check();      // This should cause panic
+			break;
+			}
+
+		case 20:
+			// Corrupt page bitmap data and check
+			{
+			if ( !heap.PageAllocatorExists() )
+				{
+				User::Panic(KLitHeapCheck, ETHeapDebugUnmatchedCallToCheckHeap);
+				}
+			test(heap.ConfigurePageAllocator());
+			// Allocate some buffers to cause slab allocator to be
+			// initialised  		
+			heap.AllocateSomeBuffers(bfrs, 0x4000, 0x10000, 16);
+			test(heap.PrintHeapInitData());						
+			TUint8* bitmap = heap.Alloc(128);  // For saved bitmap
+			test(bitmap != NULL);
+			TInt bit_lth = heap.CopyPageBitmap(bitmap, 128);
+			test(bit_lth != 0);
+			memset(bitmap, 0xee, (bit_lth>>3));  //  corrupt bitmap data
+			heap.RestorePageBitmap(bitmap, bit_lth);
+			heap.Check();      // This should cause panic
+			break;
+			}
+
+		case 21:
+			// Corrupt page bitmap with a earlier freed "ghost" buffer info
+			{
+			if ( !heap.PageAllocatorExists() )
+				{
+				User::Panic(KLitHeapCheck, ETHeapDebugUnmatchedCallToCheckHeap);
+				}
+			test(heap.ConfigurePageAllocator());
+			// Allocate some buffers to cause slab allocator to be
+			// initialised  		
+			heap.AllocateSomeBuffers(bfrs, 0x4000, 0x10000, 16);
+			test(heap.PrintHeapInitData());						
+			TUint8* bitmap = heap.Alloc(128);  // For saved bitmap
+			test(bitmap != NULL);
+			TUint8* p = heap.Alloc(0x8000);     // One more page buffer
+			TInt bit_lth = heap.CopyPageBitmap(bitmap, 128);
+			test(bit_lth != 0);
+			heap.Free(p);
+			heap.RestorePageBitmap(bitmap, bit_lth);
+			heap.Check();      // This should cause panic
+			break;
+			}
+
+		default:
+			break;
+		}
+
+	User::Invariant();	// Should not reach here 
+	return 0;
+}
+
+
+class TestHeapCheck
+{
+	public:
+		void TestCheck(void);
+		TInt TestThreadExit(RThread& aThread, TExitType aExitType, TInt aExitReason);
+};
+
+
+TInt TestHeapCheck::TestThreadExit(RThread& aThread, TExitType aExitType, TInt aExitReason)
+{
+	// Disable JIT debugging.
+	TBool justInTime=User::JustInTime();
+	User::SetJustInTime(EFalse);
+
+	TRequestStatus status;
+	aThread.Logon(status); 
+	aThread.Resume();
+	User::WaitForRequest(status);
+	if (aExitType != aThread.ExitType())
+		return KErrGeneral;
+
+	if ( (status.Int() == ETHeapDebugUnmatchedCallToCheckHeap) && (aThread.ExitReason() == ETHeapDebugUnmatchedCallToCheckHeap))
+		{
+		CLOSE_AND_WAIT(aThread);
+		// Put JIT debugging back to previous status.
+		User::SetJustInTime(justInTime);
+		return KErrNotSupported;
+		}
+
+	if ( status.Int() == ERTestFailed )
+		return KErrGeneral;
+
+	if ( aExitReason > 0 )
+		{
+		if (aExitReason != status.Int())
+			return KErrGeneral;
+
+		if (aExitReason != aThread.ExitReason())
+			return KErrGeneral;		
+		}
+	
+	CLOSE_AND_WAIT(aThread);
+
+	// Put JIT debugging back to previous status.
+	User::SetJustInTime(justInTime);
+	return KErrNone;
+
+}
+
+void TestHeapCheck::TestCheck()
+{
+    TInt type;
+	TInt r;
+	
+	test.Next(_L("Testing Doug Lea allocator check"));
+	{
+	type = 1;
+	RThread thread;
+	test(thread.Create(_L("Check UserHeap"),HeapCheckTestThread, KDefaultStackSize, 0x1000, 0x400000,  (TAny*) &type)== KErrNone);
+	test(TestThreadExit(thread, EExitPanic, ETHeapBadCellAddress)==KErrNone);
+	
+    type = 2;
+    test(thread.Create(_L("Check UserHeap"),HeapCheckTestThread, KDefaultStackSize, 0x1000, 0x400000,  (TAny*) &type)==KErrNone);
+    test(TestThreadExit(thread, EExitPanic, ETHeapBadCellAddress)==KErrNone);
+
+	type = 3;
+	test(thread.Create(_L("Check UserHeap"),HeapCheckTestThread, KDefaultStackSize, 0x1000, 0x400000,  (TAny*) &type)==KErrNone);
+	test(TestThreadExit(thread, EExitPanic, ETHeapBadCellAddress)==KErrNone);
+	
+	}
+
+	test.Next(_L("Testing Slab allocator check"));	
+	{
+	type = 10;
+	RThread thread;
+	test(thread.Create(_L("Check UserHeap"),HeapCheckTestThread, KDefaultStackSize, 0x1000, 0x400000,  (TAny*) &type)==KErrNone);
+	r = TestThreadExit(thread, EExitPanic, ETHeapBadCellAddress);
+	if ( r != KErrNotSupported )
+		{
+		test(r==KErrNone);
+		
+		type = 11;
+		RThread thread;
+		test(thread.Create(_L("Check UserHeap"),HeapCheckTestThread, KDefaultStackSize, 0x1000, 0x400000,  (TAny*) &type)==KErrNone);
+		test(TestThreadExit(thread, EExitPanic, ETHeapBadCellAddress)==KErrNone);
+		}
+	else test.Printf(_L("Slab allocator does not exist, testes bypassed\n"));	
+	}
+
+	test.Next(_L("Testing Page allocator check"));	
+	{
+	type = 20;
+	RThread thread;
+	test(thread.Create(_L("Check UserHeap"),HeapCheckTestThread, KDefaultStackSize, 0x1000, 0x800000,  (TAny*) &type)==KErrNone);	
+	r = TestThreadExit(thread, EExitPanic, KErrNone);   // Accept any panic reason here
+	if ( r != KErrNotSupported )
+		{
+		test(r==KErrNone);
+
+		type = 21;
+		RThread thread;
+		test(thread.Create(_L("Check UserHeap"),HeapCheckTestThread, KDefaultStackSize, 0x1000, 0x800000,  (TAny*) &type)==KErrNone);
+		test(TestThreadExit(thread, EExitPanic,	KErrNone)==KErrNone);  // Accept any panic reason here
+		}
+    else test.Printf(_L("Page allocator does not exist, testes bypassed\n"));
+	}
+
+}
+
+
+
+
+//  Global Functions
+
+GLDEF_C TInt E32Main(void)
+	{
+
+	test.Title();
+	
+	test.Start(_L("Testing Heap Check function"));
+	
+	TestHeapCheck T;
+	
+	T.TestCheck();
+
+	test.End();
+	
+	return(0);
+	}
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/heap/t_heapdb.cpp
--- a/kerneltest/e32test/heap/t_heapdb.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/heap/t_heapdb.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -45,18 +45,28 @@
 #include <e32test.h>
 #include <e32def.h>
 #include <e32def_private.h>
+#include "dla.h"
+#include "slab.h"
+#include "page_alloc.h"
+#include "heap_hybrid.h"
+#define KHEAPCELLINFO RHybridHeap::SHeapCellInfo
 
 LOCAL_D RTest test(_L("T_HEAPDB"));
 
 #if defined(_DEBUG)
 
-RHeap::SHeapCellInfo CellInfo[4];
+KHEAPCELLINFO CellInfo[4];
 
 class RTestHeap : public RHeap
 	{
 public:
-	void AttachInfo(SHeapCellInfo* aInfo)
-		{iTestData = aInfo;}
+	void AttachInfo(KHEAPCELLINFO* aInfo)
+		{
+		RHybridHeap::STestCommand cmd;
+		cmd.iData = aInfo;
+		cmd.iCommand = RHybridHeap::ETestData;
+		DebugFunction(RHeap::EHybridHeap, (TAny*)&cmd);
+		}
 	};
 
 void AttachToHeap(RHeap* aHeap, TInt aInfo)
@@ -68,19 +78,17 @@
 
 void TestCellInfo(TInt aInfo, TInt aNest, TInt aAllocCount, TInt aLevelAlloc, TInt aSize, TAny* aAddr)
 	{
-	RHeap::SHeapCellInfo& ci = CellInfo[aInfo];
+	(void) aSize;
+	KHEAPCELLINFO& ci = CellInfo[aInfo];
 	RHeap::SDebugCell& cell = *ci.iStranded;
 	test(cell.nestingLevel == aNest);
 	test(cell.allocCount == aAllocCount);
 	test(ci.iLevelAlloc == aLevelAlloc);
-	test(cell.len == aSize + RHeap::EAllocCellSize);
 	test((&cell+1) == aAddr);
 	}
 
 const TInt KMaxFailureRate=100;
 const TInt KThreadMemError=-50;
-const TInt KCellSize=(sizeof(RHeap::SCell)); // Size of free cell header	
-const TInt KHeadSize=(sizeof(RHeap::SDebugCell)); // Size of allocated cell header with space for heaven info
 
 LOCAL_D TInt heapCount=1;
 LOCAL_D RSemaphore threadSemaphore;
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/heap/t_heapdl.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/heap/t_heapdl.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,495 @@
+// Copyright (c) 1995-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test\heap\t_heapdl.cpp
+// Overview:
+// Tests RHybridHeap class.
+// API Information:
+// RHybridHeap
+// Details:
+// 
+//
+
+#include <e32test.h>
+#include <e32math.h>
+#include <e32def_private.h>
+#include "dla.h"
+#include "slab.h"
+#include "page_alloc.h"
+#include "heap_hybrid.h"
+
+const TInt KHeadSize = (TInt)RHeap::EAllocCellSize;
+
+class TestHybridHeap
+  {
+public:
+  static void TopSize(TInt& aTopSize, const RHybridHeap * aHybridHeap);
+  static void DvSize(TInt& aDvSize, const RHybridHeap * aHybridHeap);
+  static void SmallMap(TUint& aSmallMap, const RHybridHeap * aHybridHeap);
+  static void TreeMap(TUint& aTreeMap, const RHybridHeap * aHybridHeap);
+  static void TrimCheck(TInt& aTrimCheck, const RHybridHeap * aHybridHeap);
+  static void GrowBy(TInt& aGrowBy, const RHybridHeap * aHybridHeap);
+  static void PageSize(TInt& aPageSize, const RHybridHeap * aHybridHeap);
+  };
+
+
+void TestHybridHeap::TopSize(TInt& aTopSize, const RHybridHeap * aHybridHeap)
+  {
+  aTopSize = aHybridHeap->iGlobalMallocState.iTopSize;
+  }
+
+
+void TestHybridHeap::DvSize(TInt& aDvSize, const RHybridHeap * aHybridHeap)
+  {
+  aDvSize = aHybridHeap->iGlobalMallocState.iDvSize;
+  }
+
+
+void TestHybridHeap::SmallMap(TUint& aSmallMap, const RHybridHeap * aHybridHeap)
+  {
+  aSmallMap = aHybridHeap->iGlobalMallocState.iSmallMap;
+  }
+
+
+void TestHybridHeap::TreeMap(TUint& aTreeMap, const RHybridHeap * aHybridHeap)
+  {
+  aTreeMap = aHybridHeap->iGlobalMallocState.iTreeMap;
+  }
+
+
+void TestHybridHeap::TrimCheck(TInt& aTrimCheck, const RHybridHeap * aHybridHeap)
+  {
+  aTrimCheck = aHybridHeap->iGlobalMallocState.iTrimCheck;
+  }
+
+
+void TestHybridHeap::GrowBy(TInt& aGrowBy, const RHybridHeap * aHybridHeap)
+  {
+  aGrowBy = aHybridHeap->iGrowBy;
+  }
+
+void TestHybridHeap::PageSize(TInt& aPageSize, const RHybridHeap * aHybridHeap)
+  {
+  aPageSize = aHybridHeap->iPageSize;
+  }
+
+
+LOCAL_D RTest test(_L("T_HEAPDL"));
+
+
+class TestRHeap
+  {
+public:
+  void InitTests();
+  void Test1(void);
+  void Test2(void);
+  void Test3(void);
+  void Test4(void);
+  void CloseTests();
+private:
+  RHybridHeap* iHybridHeap;
+  RHeap *iHeap;
+  };
+
+
+void TestRHeap::InitTests()
+  {
+  // Allocate a chunk heap
+  TPtrC testHeap=_L("TESTHEAP");
+  iHeap=User::ChunkHeap(&testHeap,0x1800,0x16000);
+        
+  RHybridHeap::STestCommand cmd;
+  cmd.iCommand = RHybridHeap::EHeapMetaData;
+  iHeap->DebugFunction(RHeap::EHybridHeap, (TAny*)&cmd );
+  iHybridHeap = (RHybridHeap*) cmd.iData;
+  }
+
+
+void TestRHeap::Test1(void)
+  {
+  //
+  //  Splitting a new cell off 'top' chunk
+  //  Growing and shrinking 'top' chunk
+  //  Coalesceing of adjacent free cells
+  //
+    
+  TInt topSizeBefore, topSizeAfter, allocSize;
+  TInt growBy, pageSize;
+  TestHybridHeap::GrowBy(growBy,iHybridHeap);
+  TestHybridHeap::PageSize(pageSize,iHybridHeap);
+        
+  //Splitting a new cell off 'top' chunk
+  TestHybridHeap::TopSize(topSizeBefore,iHybridHeap);
+  TAny* p1=iHeap->Alloc(0x256);
+  TestHybridHeap::TopSize(topSizeAfter,iHybridHeap);
+  test(topSizeBefore > topSizeAfter);
+  iHeap->Check();
+  iHeap->Free(p1);
+  iHeap->Check();
+    
+  //Growing 'top' chunk
+  test(iHeap!=NULL);
+  TestHybridHeap::TopSize(topSizeBefore,iHybridHeap);
+  p1=iHeap->Alloc(pageSize*2); 
+  test(p1!=NULL);
+  allocSize=iHeap->AllocLen(p1);
+  TestHybridHeap::TopSize(topSizeAfter,iHybridHeap);
+  test(topSizeBefore + growBy == topSizeAfter+allocSize+KHeadSize);
+    
+  //Splitting a new cell off 'top' chunk
+  TAny *p2=iHeap->Alloc(pageSize/8); 
+  test(p2!=NULL);
+  //Splitting a new cell off 'top' chunk
+  TAny *p3=iHeap->Alloc(pageSize/2); 
+  test(p3!=NULL);
+  //Growing 'top' chunk
+  TAny *p4=iHeap->Alloc(pageSize*2); 
+  test(p4!=NULL);
+  //Take allocSize of p4
+  allocSize=iHeap->AllocLen(p4);
+    
+  //Shrinking 'top' chunk
+  TInt trimCheck;
+  TestHybridHeap::TopSize(topSizeBefore,iHybridHeap);
+  iHeap->Free(p4);
+  TestHybridHeap::TopSize(topSizeAfter,iHybridHeap);
+  TestHybridHeap::TrimCheck(trimCheck,iHybridHeap);
+  test(topSizeAfter + trimCheck == topSizeBefore+allocSize+KHeadSize);
+  iHeap->Check();
+  
+  //Insert chunk into treebin
+  TUint treeMap,treeMap2;
+  TestHybridHeap::TreeMap(treeMap,iHybridHeap);
+  test(treeMap==0);
+  iHeap->Free(p2);
+  TestHybridHeap::TreeMap(treeMap,iHybridHeap);
+  test(treeMap>0);
+  iHeap->Check();
+    
+  //Coalesce adjacent free cells and insert chunk into treebin
+  TestHybridHeap::TreeMap(treeMap,iHybridHeap);
+  iHeap->Free(p1);
+  TestHybridHeap::TreeMap(treeMap2,iHybridHeap);
+  test(treeMap < treeMap2);
+  iHeap->Check();
+    
+  //free last allocation
+  iHeap->Free(p3);
+  iHeap->Check();
+  }
+
+
+void TestRHeap::Test2(void)
+  {
+  //
+  // Allocation of exact sized cells from 'small cell' lists (smallbin)
+  // Freeing of exact sized cells back to 'small cell' lists (smallbin)
+  //
+  TInt ArraySize=32;
+  TInt cellSize=0;
+  TInt topSizeBefore, topSizeAfter;
+     
+  TAny** ArrayOfCells;
+  ArrayOfCells= new TAny*[ArraySize];
+  TInt ArrayIndex;
+  // Allocate exact sized small cells 8,16,32,40--->
+  // and put them to the array. They are allocated from TOP chunk
+  for(ArrayIndex=0; ArrayIndex<ArraySize;ArrayIndex++)
+    {
+    TestHybridHeap::TopSize(topSizeBefore,iHybridHeap);
+    cellSize=cellSize+8;
+    ArrayOfCells[ArrayIndex]=iHeap->Alloc(cellSize);
+    TestHybridHeap::TopSize(topSizeAfter,iHybridHeap);
+    test(topSizeBefore > topSizeAfter);
+    }
+  iHeap->Check();
+  
+  TUint smallMap, smallMap2;
+  TInt dvSize, dvSize2;
+  TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+  test(smallMap == 0);
+  // Free some of small cells from the array. So they are inserted
+  // to the smallbin
+  for(ArrayIndex=2; ArrayIndex<ArraySize-1; ArrayIndex+=5)
+    {
+    TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+    iHeap->Free(ArrayOfCells[ArrayIndex]);
+    TestHybridHeap::SmallMap(smallMap2,iHybridHeap);
+    test(smallMap<smallMap2);
+    }
+  iHeap->Check();
+    
+  // Allocate exact sized cells from smallbin (or Designated Victim)   
+  TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+  TAny* p1=iHeap->Alloc(32);
+  TestHybridHeap::SmallMap(smallMap2,iHybridHeap);
+  test(smallMap>smallMap2);
+    
+  TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize,iHybridHeap);
+  TAny* p2=iHeap->Alloc(32);
+  TestHybridHeap::SmallMap(smallMap2,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize2,iHybridHeap);
+  if(dvSize <= dvSize2)
+    test(smallMap>smallMap2);
+    
+  TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize,iHybridHeap);
+  TAny* p3=iHeap->Alloc(32);
+  TestHybridHeap::SmallMap(smallMap2,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize2,iHybridHeap);
+  if(dvSize <= dvSize2)
+  	test(smallMap>smallMap2);
+   
+  TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize,iHybridHeap);
+  TAny* p4=iHeap->Alloc(32);
+  TestHybridHeap::SmallMap(smallMap2,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize2,iHybridHeap);
+  if(dvSize <= dvSize2)
+    test(smallMap>smallMap2);
+   
+  TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize,iHybridHeap);
+  TAny* p5=iHeap->Alloc(48);
+  TestHybridHeap::SmallMap(smallMap2,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize2,iHybridHeap);
+  if(dvSize <= dvSize2)
+    test(smallMap>smallMap2);
+    
+  TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize,iHybridHeap);
+  TAny* p6=iHeap->Alloc(64);
+  TestHybridHeap::SmallMap(smallMap2,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize2,iHybridHeap);
+  if(dvSize <= dvSize2)
+    test(smallMap>smallMap2);
+   
+  TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize,iHybridHeap);
+  TAny* p7=iHeap->Alloc(80);
+  TestHybridHeap::SmallMap(smallMap2,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize2,iHybridHeap);
+  if(dvSize <= dvSize2)
+    test(smallMap>smallMap2);
+   
+  TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize,iHybridHeap);
+  TAny* p8=iHeap->Alloc(96);
+  TestHybridHeap::SmallMap(smallMap2,iHybridHeap);
+  TestHybridHeap::DvSize(dvSize2,iHybridHeap);
+  if(dvSize <= dvSize2)
+    test(smallMap>smallMap2);
+  iHeap->Check();
+  
+  // Freeing of exact sized cells back to smallbin
+  TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+  iHeap->Free(p1);
+  iHeap->Free(p2);
+  iHeap->Free(p3);
+  iHeap->Free(p4);
+  iHeap->Free(p5);
+  iHeap->Free(p6);
+  iHeap->Free(p7);
+  iHeap->Free(p8);
+  TestHybridHeap::SmallMap(smallMap2,iHybridHeap);
+  test(smallMap < smallMap2);
+  iHeap->Check();
+  
+  // Now free rest of the array with Reset
+  iHeap->Reset();
+  iHeap->Check();
+  
+  delete [] ArrayOfCells;
+  }
+
+
+void TestRHeap::Test3(void)
+  {
+  //
+  // Allocation of approximate sized cells from 'small cell' lists (smallbin)
+  //
+  TInt ArraySize=32;
+  TInt cellSize=0;
+  TAny** ArrayOfCells;
+  ArrayOfCells= new TAny*[ArraySize];
+  TInt ArrayIndex;
+  TInt topSizeBefore, topSizeAfter;
+    
+  // Allocate small approximate sized cells and put
+  //them to the array. They are allocated from TOP chunk
+  TUint8 randomSize;
+  for(ArrayIndex=0; ArrayIndex<ArraySize;ArrayIndex++)
+    {
+    TestHybridHeap::TopSize(topSizeBefore,iHybridHeap);
+    do
+      {
+      randomSize= (TUint8)Math::Random();
+      }
+    while (randomSize>240);
+       
+  	cellSize=randomSize;
+  	ArrayOfCells[ArrayIndex]=iHeap->Alloc(cellSize);
+  	TestHybridHeap::TopSize(topSizeAfter,iHybridHeap);
+  	test(topSizeBefore > topSizeAfter);
+  	}
+  iHeap->Check();
+  
+  TUint smallMap, smallMap2;
+  // Free some of allocated cells from the array. So they are inserted
+  // to the smallbin
+  TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+  for(ArrayIndex=2; ArrayIndex<ArraySize-1; ArrayIndex+=5)
+    {
+    iHeap->Free(ArrayOfCells[ArrayIndex]);
+    }
+  TestHybridHeap::SmallMap(smallMap2,iHybridHeap);
+  test(smallMap<=smallMap2);
+  iHeap->Check();
+  
+  // Allocate approximate sized cells from smallbin
+  TInt ArraySize2=6;
+  TInt cellSize2=0;    
+  TAny** ArrayOfCells2;
+  ArrayOfCells2= new TAny*[ArraySize2];
+  TInt ArrayIndex2;
+  TestHybridHeap::SmallMap(smallMap,iHybridHeap);
+  for(ArrayIndex2=0; ArrayIndex2<ArraySize2;ArrayIndex2++)
+    {
+    TUint8 randomSize2 = (TUint8)Math::Random();
+    cellSize2=(randomSize2);
+    ArrayOfCells2[ArrayIndex2]=iHeap->Alloc(cellSize2);
+    }
+  TestHybridHeap::SmallMap(smallMap2,iHybridHeap);
+  test(smallMap>=smallMap2);              
+  iHeap->Check();
+  
+  // Freeing of approximate sized cells back to smallbin
+  for(ArrayIndex2=0; ArrayIndex2<ArraySize2-1; ArrayIndex2+=1)
+    {
+    iHeap->Free(ArrayOfCells2[ArrayIndex2]);
+    }
+  iHeap->Check();
+  
+  // Now free rest of the array with Reset
+  iHeap->Reset();
+  iHeap->Check();
+  
+  delete [] ArrayOfCells;
+  delete [] ArrayOfCells2; 
+  }
+
+
+void TestRHeap::Test4(void)
+  {
+  //
+  // Allocation of approximate sized cells from digital trees (treebin) and splitting
+  // Freeing of approximate sized cells back to digital trees (treebin)
+  //
+  TInt ArraySize=32;
+  TInt cellSize=0;
+  TAny** ArrayOfCells;
+  ArrayOfCells= new TAny*[ArraySize];
+  TInt ArrayIndex;
+        
+  // Allocate approximate sized cells bigger than 256
+  // and put them to the array. They are allocated from TOP chunk
+  for(ArrayIndex=0; ArrayIndex<ArraySize;ArrayIndex++)
+    {
+    TUint8 randomSize = (TUint8)Math::Random();
+    cellSize=(randomSize+256);
+    ArrayOfCells[ArrayIndex]=iHeap->Alloc(cellSize);
+    }
+  iHeap->Check();
+  
+  TUint treeMap,treeMap2;    
+  // Free some of allocated cells from the array. So they are inserted
+  // to the treebin
+  for(ArrayIndex=2; ArrayIndex<ArraySize-1; ArrayIndex+=5)
+    {
+    TestHybridHeap::TreeMap(treeMap,iHybridHeap);
+    iHeap->Free(ArrayOfCells[ArrayIndex]);
+    TestHybridHeap::TreeMap(treeMap2,iHybridHeap);
+    test(treeMap <= treeMap2);
+    }
+  iHeap->Check();
+  
+  // Allocate approximate sized cells from treebin
+  TInt ArraySize2=16;
+  TInt cellSize2=0;    
+  TAny** ArrayOfCells2;
+  ArrayOfCells2= new TAny*[ArraySize2];
+  TInt ArrayIndex2;
+  for(ArrayIndex2=0; ArrayIndex2<ArraySize2;ArrayIndex2++)
+    {
+    TestHybridHeap::TreeMap(treeMap,iHybridHeap);
+    TUint8 randomSize2 = (TUint8)Math::Random();
+    cellSize2=(randomSize2+256);
+    ArrayOfCells2[ArrayIndex2]=iHeap->Alloc(cellSize2);
+    TestHybridHeap::TreeMap(treeMap2,iHybridHeap);
+    test(treeMap >= treeMap2);
+    }
+  iHeap->Check();
+  
+  // Freeing of approximate sized cells back to treebin
+  TestHybridHeap::TreeMap(treeMap,iHybridHeap);
+  for(ArrayIndex2=0; ArrayIndex2<ArraySize2-1; ArrayIndex2+=1)
+    {
+    iHeap->Free(ArrayOfCells2[ArrayIndex2]);
+    }
+  TestHybridHeap::TreeMap(treeMap2,iHybridHeap);
+  test(treeMap <= treeMap2);
+  iHeap->Check();
+    
+  // Now free rest of the array with Reset
+  iHeap->Reset();
+  iHeap->Check();
+    
+  delete [] ArrayOfCells;
+  delete [] ArrayOfCells2; 
+  }
+
+
+void TestRHeap::CloseTests()
+  {
+  // close heap so we don't exceed chunk limit
+  iHeap->Close();  
+  }
+
+
+GLDEF_C TInt E32Main(void)
+  {
+  test.Title();
+
+  __KHEAP_MARK;
+
+  TestRHeap T;
+  test.Start(_L("Init DL allocator tests"));
+  T.InitTests();
+  test.Next(_L("Test DL allocator 1"));
+  T.Test1();
+  test.Next(_L("Test DL allocator 2"));
+  T.Test2();
+  test.Next(_L("Test DL allocator 3"));
+  T.Test3();
+  test.Next(_L("Test DL allocator 4"));
+  T.Test4();
+  test.Next(_L("Close DL allocator tests"));
+  T.CloseTests();
+	
+  __KHEAP_CHECK(0);
+  __KHEAP_MARKEND;
+
+  test.End();
+  return(0);
+  }
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/heap/t_heappagealloc.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/heap/t_heappagealloc.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,462 @@
+// Copyright (c) 1995-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test\heap\t_page_alloc.cpp
+// Overview:
+// Tests RHeap class.
+// API Information:
+// RHeap
+// Details:
+// - Tests that the page bitmap is consistent (i.e. encoded sizes are sensible and 
+// encoded in the correct fashion.
+// - Tests that pages which appear in the page bitmap are present in memory by 
+// reading them.
+// -Tests that other pages are not readable  
+// - Tests page bitmap by creating an allocator where all allocations >= 4kB use
+// paged allocator, allocating a large number of regions of various sizes (from
+// 4 kB to b MB), checking that the walk function finds them all correctly, freeing
+// some of them, checking the walk function again, and so on. 
+// Platforms/Drives/Compatibility:
+// All
+// Assumptions/Requirement/Pre-requisites:
+// Failures and causes:
+// Base Port information:
+// 
+//
+
+#include <e32test.h>
+#include <e32hal.h>
+#include <e32def.h>
+#include <e32math.h>
+#include <e32def_private.h>
+#include "dla.h"
+#include "slab.h"
+#include "page_alloc.h"
+#include "heap_hybrid.h"
+
+
+struct TMetaData
+    {
+    TBool           iDLOnly;
+    RFastLock*      iLock;
+    TInt            iChunkSize;
+    TInt            iSlabThreshold;
+    unsigned        iSlabInitThreshold;
+    unsigned        iSlabConfigBits;
+    slab*           iPartialPage;
+    slab*           iFullSlab;
+    page*           iSparePage;
+    TUint8*         iMemBase;
+    unsigned char   iSizeMap[(MAXSLABSIZE>>2)+1];
+    slabset         iSlabAlloc[MAXSLABSIZE>>2];
+    slab**          iSlabAllocRealRootAddress[MAXSLABSIZE>>2];
+    };
+
+LOCAL_D RTest test(_L("T_HEAPPAGEALLOC"));
+
+class TestHybridHeap
+    {
+public:
+    static TUint8* MemBase(const RHybridHeap * aHybridHeap);
+    static void GetHeapMetaData(RHeap& aHeap, TMetaData& aMeta);
+    };
+
+TUint8* TestHybridHeap::MemBase(const RHybridHeap * aHybridHeap)
+	{
+	return aHybridHeap->iMemBase;
+	}
+
+void TestHybridHeap::GetHeapMetaData(RHeap& aHeap, TMetaData& aMeta)
+{
+    RHybridHeap::STestCommand cmd;
+    cmd.iCommand = RHybridHeap::EHeapMetaData;
+    TInt ret = aHeap.DebugFunction(RHeap::EHybridHeap, &cmd, 0);
+    test(ret == KErrNone);
+    
+    RHybridHeap* hybridHeap = (RHybridHeap*) cmd.iData;
+    
+    aMeta.iDLOnly              = hybridHeap->iDLOnly;
+    aMeta.iLock                = &hybridHeap->iLock;
+    aMeta.iChunkSize           = hybridHeap->iChunkSize;
+    aMeta.iSlabThreshold       = hybridHeap->iSlabThreshold;
+    aMeta.iSlabInitThreshold   = hybridHeap->iSlabInitThreshold;
+    aMeta.iSlabConfigBits      = hybridHeap->iSlabConfigBits;
+    aMeta.iPartialPage         = hybridHeap->iPartialPage;
+    aMeta.iFullSlab            = hybridHeap->iFullSlab;
+    aMeta.iSparePage           = hybridHeap->iSparePage;
+    aMeta.iMemBase             = hybridHeap->iMemBase;
+
+    TInt i;
+    TInt count;
+    count = sizeof(aMeta.iSizeMap)/sizeof(unsigned char);
+    for (i=0; i<count; ++i)
+        {
+        aMeta.iSizeMap[i] = hybridHeap->iSizeMap[i];
+        }
+    count = sizeof(aMeta.iSlabAlloc)/sizeof(slabset);
+    for (i=0; i<count; ++i)
+        {
+        aMeta.iSlabAlloc[i].iPartial = hybridHeap->iSlabAlloc[i].iPartial;
+        aMeta.iSlabAllocRealRootAddress[i] = &hybridHeap->iSlabAlloc[i].iPartial;
+        }
+}
+
+LOCAL_C void GetMeta(RHeap& aHeap, TMetaData& aMeta)
+{
+    TestHybridHeap::GetHeapMetaData(aHeap, aMeta);
+}
+
+class TestRHeap : public RHeap
+	{
+public:
+	void InitTests();
+	void Test1(void);
+	void Test2(void);
+	void Test3(void);
+	void CloseTests();
+	TUint GetRandomSize(TUint aMaxSize);
+	TUint GetRandomIndex(TUint aMaxIndex);
+	static void WalkCallback(TAny* aPtr, TCellType aType, TAny* aCell, TInt aLen);
+	TBool CheckWalkArrayEmpty();
+			
+private:
+	RHybridHeap* iHybridHeap;
+	RHeap *iHeap;
+	TUint8* iMemBase;			     // bottom of Paged/Slab memory (chunk base)
+	static TUint iWalkArraySize;
+	static TUint iWalkArrayIndex;
+	static TAny** iWalkArrayOfCells;
+	TUint iAllocatedArrayIndex;
+	TAny** iAllocatedArrayOfCells;
+	};
+
+TUint TestRHeap::iWalkArraySize = 100;
+TUint TestRHeap::iWalkArrayIndex = 0;
+TAny** TestRHeap::iWalkArrayOfCells = new TAny*[iWalkArraySize];
+
+void TestRHeap::InitTests()
+{
+    // Allocate a chunk heap
+	TPtrC testHeap=_L("TESTHEAP");
+	iHeap=User::ChunkHeap(&testHeap,0x1800,0x800000); 
+	RHybridHeap::STestCommand cmd;
+	cmd.iCommand = RHybridHeap::EHeapMetaData;
+	iHeap->DebugFunction(RHeap::EHybridHeap, &cmd, 0);
+	iHybridHeap = (RHybridHeap*) cmd.iData;
+	iMemBase = TestHybridHeap::MemBase(iHybridHeap);
+	
+	// configure paged heap threshold 16 kB
+	cmd.iCommand = RHybridHeap::ESetConfig;
+	cmd.iConfig.iSlabBits = 0x0; //0xabe
+	cmd.iConfig.iDelayedSlabThreshold = 0x40000000;
+	cmd.iConfig.iPagePower = 14;
+	test(iHeap->DebugFunction(RHeap::EHybridHeap, &cmd, 0) == KErrNone);
+}
+
+
+TUint TestRHeap::GetRandomSize(TUint aMaxSize)
+{
+	TUint size = 0;
+	do
+	{
+		size = Math::Random() & aMaxSize;
+	}
+	while(size < 16384 ||  size > aMaxSize );
+	// subtract debug header size	
+	return size - 8;	
+}
+
+
+TUint TestRHeap::GetRandomIndex(TUint aMaxIndex)
+{
+	TUint index = 0;
+	do
+	    {
+        index = Math::Random() & 0x7F;
+	    }
+    while(index >= aMaxIndex || iWalkArrayOfCells[index] == 0);
+
+	return index;
+}
+
+
+void TestRHeap::WalkCallback(TAny* aPtr, TCellType aCellType, TAny* aBuffer, TInt aLen)
+{
+    if (aLen>16375 && aPtr>0)    // Don't test DL allocator
+        test(aCellType == EGoodAllocatedCell);
+    
+	TUint i = 0;
+	for(i=0; i<iWalkArrayIndex; i++)
+	{
+		if(iWalkArrayOfCells[i] == aBuffer)
+		{
+			iWalkArrayOfCells[i] = NULL;
+			break;
+		}
+	}
+}
+
+TBool TestRHeap::CheckWalkArrayEmpty()
+{
+	TUint i = 0;
+	for(i=0; i<iWalkArrayIndex; i++)
+	{
+		if(iWalkArrayOfCells[i])
+		{
+			return EFalse;
+		}
+	}
+	return ETrue;
+}
+
+
+///////////////////////////////////////////////////////////
+// Test page allocation with various sizes, 16 kB - 8 MB //
+// Simple test with fixed sizes.                         //
+///////////////////////////////////////////////////////////
+void TestRHeap::Test1(void)
+{
+	// Allocate and free single paged buffers of different size
+	// Small buffer
+	TAny* p1 = NULL;
+	p1=iHeap->Alloc(0x4000);
+	test(p1 != NULL && p1 >= iMemBase && p1 < iHybridHeap);
+	test(iHeap->Count() == 1);
+	iHeap->Free(p1);
+	p1 = NULL;
+	test(iHeap->Count() == 0);
+
+	// Medium buffer
+	p1=iHeap->Alloc(0x20000);
+	test(p1 != NULL && p1 >= iMemBase && p1 < iHybridHeap);
+	test(iHeap->Count() == 1);
+	iHeap->Free(p1);
+	p1 = NULL;
+	test(iHeap->Count() == 0);
+	
+	// Large buffer
+	p1=iHeap->Alloc(0x700000);
+	test(p1 != NULL && p1 >= iMemBase && p1 < iHybridHeap);
+	test(iHeap->Count() == 1);
+	iHeap->Free(p1);
+	p1 = NULL;
+	test(iHeap->Count() == 0);
+
+	// Oversized buffer, not allocated
+	p1=iHeap->Alloc(0x900000);
+	test(p1 == NULL);
+	test(iHeap->Count() == 0);
+}
+
+
+///////////////////////////////////////////////////////////////////////////
+// Allocate and free multiple random sized buffers, sizes under 65 kB.   //
+// Check that all are allocated succesfully with Count. Free every other //
+// of them, check the Count. Allocate more buffers sized under 655 kB    //
+// and free all buffers in reverse order. Check all are freed.           //
+///////////////////////////////////////////////////////////////////////////
+void TestRHeap::Test2(void)
+{
+    TInt ArraySize=10;
+	TInt ArrayIndex;
+	TAny** ArrayOfCells;
+	ArrayOfCells = new TAny*[ArraySize];
+
+	// Allocate set of buffers
+	for(ArrayIndex=0; ArrayIndex<ArraySize; ArrayIndex++)
+	{
+		ArrayOfCells[ArrayIndex] = 0;
+		ArrayOfCells[ArrayIndex] = iHeap->Alloc(GetRandomSize(0xFFFF));
+		test(ArrayOfCells[ArrayIndex] != NULL);
+	}
+	test(iHeap->Count() == 10);
+
+	// Free every other
+	for(ArrayIndex=0; ArrayIndex<ArraySize; ArrayIndex=ArrayIndex+2 )
+	{
+		iHeap->Free(ArrayOfCells[ArrayIndex]);
+		ArrayOfCells[ArrayIndex] = 0;
+	}
+	test(iHeap->Count() == 5);
+	
+	TInt ArraySize2=10;
+	TInt ArrayIndex2;
+	TAny** ArrayOfCells2;
+	ArrayOfCells2 = new TAny*[ArraySize2];
+
+	// Allocate larger buffers
+	for(ArrayIndex2=0; ArrayIndex2<ArraySize; ArrayIndex2++)
+	{
+		ArrayOfCells2[ArrayIndex2] = 0;
+		ArrayOfCells2[ArrayIndex2] = iHeap->Alloc(GetRandomSize(0x7FFFF));
+		test(ArrayOfCells2[ArrayIndex2] != NULL);
+	}
+	test(iHeap->Count() == 15);
+
+	// Free all buffers in reverse order
+	for(ArrayIndex=9; ArrayIndex>=0; ArrayIndex-- )
+	{
+		if(ArrayOfCells[ArrayIndex] != 0)
+		{
+			iHeap->Free(ArrayOfCells[ArrayIndex]);
+			ArrayOfCells[ArrayIndex] = 0;
+		}
+	}
+	for(ArrayIndex2=9; ArrayIndex2>=0; ArrayIndex2-- )
+	{
+		if(ArrayOfCells2[ArrayIndex2] != 0)
+		{
+			iHeap->Free(ArrayOfCells2[ArrayIndex2]);
+			ArrayOfCells2[ArrayIndex2] = 0;
+		}
+	}
+	test(iHeap->Count() == 0);
+}
+
+
+///////////////////////////////////////////////////////////////////////
+// Allocate and free multiple random sized buffers. Use              // 
+// DebugFunction(EWalk) to check that all allocated cells are found. //
+///////////////////////////////////////////////////////////////////////
+void TestRHeap::Test3(void)
+{
+    TUint iAllocatedArraySize = 100;
+    iAllocatedArrayOfCells = new TAny*[iAllocatedArraySize];
+    
+    // allocate 100 random cells and save them in iAllocatedArrayOfCells
+    for(iAllocatedArrayIndex=0; iAllocatedArrayIndex<iAllocatedArraySize; iAllocatedArrayIndex++)
+    {
+        iAllocatedArrayOfCells[iAllocatedArrayIndex] = 0;
+        iAllocatedArrayOfCells[iAllocatedArrayIndex] = iHeap->Alloc(GetRandomSize(0xFFFF));
+        test(iAllocatedArrayOfCells[iAllocatedArrayIndex] != NULL);
+    }
+    test(iHeap->Count() == 100);    //check that all 100 allocations have succeedeed
+	
+    // copy iAllocatedArrayOfCells => iWalkArrayOfCells
+    iWalkArrayOfCells = new TAny*[iWalkArrayIndex];
+    for(iWalkArrayIndex=0; iWalkArrayIndex<iWalkArraySize; iWalkArrayIndex++)
+        {
+            iWalkArrayOfCells[iWalkArrayIndex] = 0;
+            iWalkArrayOfCells[iWalkArrayIndex] = iAllocatedArrayOfCells[iWalkArrayIndex];
+            test(iWalkArrayOfCells[iWalkArrayIndex] == iAllocatedArrayOfCells[iWalkArrayIndex]);
+        }
+    
+    //check that walk finds all allocated cells...
+        iHeap->DebugFunction(EWalk, (TAny*)&WalkCallback, (TAny*)this);  
+        TBool ret = CheckWalkArrayEmpty();
+        test(ret);     // ...and iWalkArrayOfCells is emptied
+        
+	// copy iAllocatedArrayOfCells => iWalkArrayOfCells
+	    iWalkArrayOfCells = new TAny*[iWalkArrayIndex];
+	    for(iWalkArrayIndex=0; iWalkArrayIndex<iWalkArraySize; iWalkArrayIndex++)
+	        {
+	            iWalkArrayOfCells[iWalkArrayIndex] = 0;
+	            iWalkArrayOfCells[iWalkArrayIndex] = iAllocatedArrayOfCells[iWalkArrayIndex];
+	            test(iWalkArrayOfCells[iWalkArrayIndex] == iAllocatedArrayOfCells[iWalkArrayIndex]);
+	        }
+	
+	// free 40 random cells from iWalkArrayOfCells
+	TUint i;
+	for (i=0; i<40; i++)
+	    {
+        TUint RandomIndex = GetRandomIndex(99);
+        iHeap->Free(iWalkArrayOfCells[RandomIndex]);
+        iWalkArrayOfCells[RandomIndex] = 0;
+        iAllocatedArrayOfCells[RandomIndex] = 0;
+	    }
+	test(iHeap->Count() == 60);
+	
+	//check that walk finds all the remaining allocated cells...
+	iHeap->DebugFunction(EWalk, (TAny*)&WalkCallback, (TAny*)this);  
+	ret = CheckWalkArrayEmpty();
+	test(ret);     // ...and iWalkArrayOfCells is emptied
+	
+	// allocate 20 more random cells starting on the first available free cell
+	iAllocatedArrayIndex = 0;
+	for (i=0; i<20; i++)
+	    {
+        while (iAllocatedArrayOfCells[iAllocatedArrayIndex] != 0)
+            {
+            iAllocatedArrayIndex++;
+            }
+        iAllocatedArrayOfCells[iAllocatedArrayIndex] = iHeap->Alloc(GetRandomSize(0xFFFF));
+	    }
+	test(iHeap->Count() == 80);
+	
+	// copy iAllocatedArrayOfCells => iWalkArrayOfCells
+	iWalkArrayOfCells = new TAny*[iWalkArrayIndex];
+	    for(iWalkArrayIndex=0; iWalkArrayIndex<iWalkArraySize; iWalkArrayIndex++)
+	        {
+	            iWalkArrayOfCells[iWalkArrayIndex] = 0;
+	            iWalkArrayOfCells[iWalkArrayIndex] = iAllocatedArrayOfCells[iWalkArrayIndex];
+	            test(iWalkArrayOfCells[iWalkArrayIndex] == iAllocatedArrayOfCells[iWalkArrayIndex]);
+	        }
+	
+	//check that walk finds all the earlier and newly allocated cells...
+	iHeap->DebugFunction(EWalk, (TAny*)&WalkCallback, (TAny*)this);  
+	ret = CheckWalkArrayEmpty();
+	test(ret);     // ...and iWalkArrayOfCells is emptied
+}
+
+	
+void TestRHeap::CloseTests()
+	{
+		// close heap so we don't exceed chunk limit
+		iHeap->Close();  
+	}
+
+	
+GLDEF_C TInt E32Main(void)
+	{
+	test.Title();
+	__KHEAP_MARK;
+	
+	TestRHeap T;
+	
+	test.Start(_L("Page Allocator Test"));
+		    
+	TPtrC testHeapM=_L("TESTHEAP-MAIN");
+    RHeap* iHeapM;
+
+	iHeapM=User::ChunkHeap(&testHeapM,0x1800,0x800000); 
+	
+    TMetaData metaData;
+    GetMeta(*iHeapM, metaData);
+
+    iHeapM->Close();
+    
+    if (metaData.iDLOnly)
+        {
+        test.Printf(_L("Page allocator is not used, no tests to run.\n"));
+        __KHEAP_MARKEND;
+        test.End();
+        return(0);
+        }
+    
+    test.Next(_L("Init Paged allocator tests"));
+    T.InitTests();
+	test.Next(_L("Test Paged allocator 1"));
+	T.Test1();
+	test.Next(_L("Test Paged allocator 2"));
+	T.Test2();
+	test.Next(_L("Test Paged allocator 3"));
+	T.Test3();
+	T.CloseTests();
+
+	__KHEAP_CHECK(0);
+	__KHEAP_MARKEND;
+	
+	test.End();
+	
+	return (0);    
+    }
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/heap/t_heapslab.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/heap/t_heapslab.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,1056 @@
+// Copyright (c) 1995-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test\heap\t_heapslab.cpp
+// Overview:
+// Tests RHybridHeap class: slab allocator
+// API Information:
+// RHybridHeap/RHeap
+// Details:
+//- Starts with empty allocator configured to use slab allocation
+//  on all cell sizes less than slab threshold (49).
+//- Allocate enough cells of the same size to fill 128 slabs.
+//- Check the number of pages used corresponds to the number of slabs.
+//- Check that a new slab is taken from a partially filled page if available.
+//- Check that a partially filled slab is used if available.
+//- Check that if all four slabs in a page are free, the page is freed.
+//- Free cells to give empty slab.
+//- Free cells to give partial slab.
+//- Reallocate cells.
+//- RAllocator::Check() is used to check internal consistency.
+// Platforms/Drives/Compatibility:
+// All
+// Assumptions/Requirement/Pre-requisites:
+// Failures and causes:
+// Base Port information:
+// 
+//
+
+#include <e32test.h>
+#include <e32hal.h>
+#include <e32def.h>
+#include <e32def_private.h>
+#include "dla.h"
+#include "slab.h"
+#include "page_alloc.h"
+#include "heap_hybrid.h"
+
+#define MAX_THREADS 4
+#define MAX_ALLOCS 20000 // 16128, if slab count is 128 and alloc size is 8
+
+//#define TSTSLAB_DBG(a) a
+#define TSTSLAB_DBG(a)
+
+struct TSlabTestThreadParm
+    {
+    RHeap*  iHeap;
+    TInt    iAllocSize;
+    TInt    iInitSlabCount;
+    TBool   iUseRandomSize;
+    TInt    iThreadCount;
+    TInt    iThreadIndex;
+    };
+
+struct TMetaData
+    {
+    TBool           iDLOnly;
+    RFastLock*      iLock;
+    TInt            iChunkSize;
+    TInt            iSlabThreshold;
+    unsigned        iSlabInitThreshold;
+    unsigned        iSlabConfigBits;
+    slab*           iPartialPage;
+    slab*           iFullSlab;
+    page*           iSparePage;
+    TUint8*         iMemBase;
+    unsigned char   iSizeMap[(MAXSLABSIZE>>2)+1];
+    slabset         iSlabAlloc[MAXSLABSIZE>>2];
+    slab**          iSlabAllocRealRootAddress[MAXSLABSIZE>>2];
+    };
+
+class TestHybridHeap
+    {
+public:
+    static void GetHeapMetaData(RHeap& aHeap, TMetaData& aMeta);
+    };
+
+LOCAL_D RTest test(_L("T_HEAPSLAB"));
+
+LOCAL_D TInt PageSize;
+
+LOCAL_D TAny* PtrBuf[MAX_THREADS][MAX_ALLOCS];
+LOCAL_D TSlabTestThreadParm ThreadParm[MAX_THREADS];
+
+enum TTestWalkFunc {ETestWalk, ETestFindSlab};
+
+
+static unsigned SlabHeaderPagemap(unsigned h) {return (h&0x00000f00)>>8;}
+
+void TestHybridHeap::GetHeapMetaData(RHeap& aHeap, TMetaData& aMeta)
+{
+    RHybridHeap::STestCommand cmd;
+    cmd.iCommand = RHybridHeap::EHeapMetaData;
+    TInt ret = aHeap.DebugFunction(RHeap::EHybridHeap, &cmd, 0);
+    test(ret == KErrNone);
+    
+    RHybridHeap* hybridHeap = (RHybridHeap*) cmd.iData;
+    
+    aMeta.iDLOnly              = hybridHeap->iDLOnly;
+    aMeta.iLock                = &hybridHeap->iLock;
+    aMeta.iChunkSize           = hybridHeap->iChunkSize;
+    aMeta.iSlabThreshold       = hybridHeap->iSlabThreshold;
+    aMeta.iSlabInitThreshold   = hybridHeap->iSlabInitThreshold;
+    aMeta.iSlabConfigBits      = hybridHeap->iSlabConfigBits;
+    aMeta.iPartialPage         = hybridHeap->iPartialPage;
+    aMeta.iFullSlab            = hybridHeap->iFullSlab;
+    aMeta.iSparePage           = hybridHeap->iSparePage;
+    aMeta.iMemBase             = hybridHeap->iMemBase;
+
+    TInt i;
+    TInt count;
+    count = sizeof(aMeta.iSizeMap)/sizeof(unsigned char);
+    for (i=0; i<count; ++i)
+        {
+        aMeta.iSizeMap[i] = hybridHeap->iSizeMap[i];
+        }
+    count = sizeof(aMeta.iSlabAlloc)/sizeof(slabset);
+    for (i=0; i<count; ++i)
+        {
+        aMeta.iSlabAlloc[i].iPartial = hybridHeap->iSlabAlloc[i].iPartial;
+        aMeta.iSlabAllocRealRootAddress[i] = &hybridHeap->iSlabAlloc[i].iPartial;
+        }
+}
+
+LOCAL_C void GetMeta(RHeap& aHeap, TMetaData& aMeta)
+{
+    TestHybridHeap::GetHeapMetaData(aHeap, aMeta);
+}
+
+/*LOCAL_C void PrintMeta(const char* aText, TMetaData& aMeta)
+{
+    RDebug::Printf("=========== HeapMetaData (local) - begin: %s", aText);
+
+    RDebug::Printf("iDLOnly: 0x%08x", aMeta.iDLOnly);
+    RDebug::Printf("iChunkSize: 0x%08x", aMeta.iChunkSize);
+    RDebug::Printf("iSlabThreshold: 0x%08x / %d", aMeta.iSlabThreshold, aMeta.iSlabThreshold);
+    RDebug::Printf("iSlabInitThreshold: 0x%08x / %d", aMeta.iSlabInitThreshold, aMeta.iSlabInitThreshold);
+    RDebug::Printf("iSlabConfigBits: 0x%08x", aMeta.iSlabConfigBits);
+    RDebug::Printf("iPartialPage: 0x%08x", aMeta.iPartialPage);
+    RDebug::Printf("iFullSlab: 0x%08x", aMeta.iFullSlab);
+    RDebug::Printf("iSparePage: 0x%08x", aMeta.iSparePage);
+    RDebug::Printf("iMemBase: 0x%08x", aMeta.iMemBase);
+
+    TInt i;
+    TInt count;
+    count = sizeof(aMeta.iSizeMap)/sizeof(unsigned char);
+    for (i=0; i<count; ++i)
+        {
+        RDebug::Printf("iSizeMap[%d]: %d", i, aMeta.iSizeMap[i]);
+        }
+    count = sizeof(aMeta.iSlabAlloc)/sizeof(slabset);
+    for (i=0; i<count; ++i)
+        {
+        RDebug::Printf("iSlabAlloc[%d].iPartial: 0x%08x", i, aMeta.iSlabAlloc[i].iPartial);
+        }
+    for (i=0; i<count; ++i)
+        {
+        RDebug::Printf("iSlabAllocRealRootAddress[%d]: 0x%08x", i, aMeta.iSlabAllocRealRootAddress[i]);
+        }
+    RDebug::Printf("=========== HeapMetaData (local) - end");
+}
+
+LOCAL_C void GetAndPrintMeta(RHeap& aHeap, const char* aText, TMetaData& aMeta)
+{
+    (void)aText;
+    GetMeta(aHeap, aMeta);
+    TSTSLAB_DBG(PrintMeta(aText, aMeta));
+}
+
+#ifndef __KERNEL_MODE__
+LOCAL_C void Lock(TMetaData& aMeta)
+   {((RFastLock&)*aMeta.iLock).Wait();}
+
+LOCAL_C void Unlock(TMetaData& aMeta)
+   {((RFastLock&)*aMeta.iLock).Signal();}
+#else
+LOCAL_C void Lock(TMetaData& aMeta)
+   {;}
+
+LOCAL_C void Unlock(TMetaData& aMeta)
+   {;}
+#endif
+*/
+
+LOCAL_C  page* PageFor(slab* s)
+    {
+        return reinterpret_cast<page*>(Floor(s, PAGESIZE));
+    }
+
+   
+LOCAL_C slab* SlabFor(const void* p)
+{
+    return (slab*)(Floor(p, SLABSIZE));
+}
+
+LOCAL_C TInt TreeWalk(slab** aRealRootAddress, slab* const* aRoot, TTestWalkFunc aFunc, TAny* aParm, TInt& aOutParm)
+{
+    TInt count = 0;
+    aOutParm = 0;
+    
+    slab* s = *aRoot;
+    if (!s)
+        return count;
+    
+    for (;;)
+        {
+        slab* c;
+        while ((c = s->iChild1) != 0)
+            s = c;      // walk down left side to end
+        for (;;)
+            {
+            count++;
+            TSTSLAB_DBG(RDebug::Printf("TreeWalk - slab: 0x%08x", s));
+            (void)aParm;
+            if (aFunc == ETestWalk)
+                {
+                ;
+                }
+            else if (aFunc == ETestFindSlab)
+                {
+                if ((slab*)aParm == s)
+                    {
+                    aOutParm = 1;
+                    return 0;
+                    }
+                }
+            
+            c = s->iChild2;
+            if (c)
+                {   // one step down right side, now try and walk down left
+                s = c;
+                break;
+                }
+            for (;;)
+                {   // loop to walk up right side
+                slab** pp = s->iParent;
+                if (pp == aRealRootAddress)
+                    return count;
+                s = SlabFor(pp);
+                if (pp == &s->iChild1)
+                    break;
+                }
+            }
+        }
+}
+
+LOCAL_C TInt WalkSlabSet(TInt aSlabsetIndex, TMetaData& aMeta, TTestWalkFunc aFunc, TAny* aParm, TInt& aOutParm)
+{
+    if (aSlabsetIndex >= (MAXSLABSIZE>>2))
+        {
+        return 0;
+        }
+    return TreeWalk(aMeta.iSlabAllocRealRootAddress[aSlabsetIndex], &aMeta.iSlabAlloc[aSlabsetIndex].iPartial, aFunc, aParm, aOutParm);
+}
+
+/*LOCAL_C void DebugPrintSlabs(TInt aSlabsetIndex, TMetaData& aMeta)
+    {
+    //RDebug::Printf("=========== DebugPrintSlabs: %s", aText);
+    RDebug::Printf("=========== DebugPrintSlabs");
+
+    RDebug::Printf("iSparePage: 0x%08x", aMeta.iSparePage);
+    
+    slab* fullSlab = aMeta.iFullSlab;
+    TInt fullSlabCount = 0;
+    while (fullSlab)
+        {
+        RDebug::Printf("fullSlab: 0x%08x", fullSlab);
+        fullSlabCount++;
+        fullSlab = fullSlab->iChild1;
+        }
+
+    TInt outParm;
+    TInt partialTreeSlabCount = 0;
+    partialTreeSlabCount += WalkSlabSet(aSlabsetIndex, aMeta, ETestWalk, 0, outParm);
+
+    slab* partialPageSlab = aMeta.iPartialPage;
+    TInt partialPageSlabCount = 0;
+    while (partialPageSlab)
+        {
+        RDebug::Printf("partialPageSlab (empty): 0x%08x", partialPageSlab);
+        partialPageSlabCount++;
+        partialPageSlab = partialPageSlab->iChild1;
+        }
+    }*/
+
+LOCAL_C void TestSlabFixedSizeManyThreads(TSlabTestThreadParm& aParm)
+    {
+    RHeap* heap = aParm.iHeap;
+    TInt allocSize = aParm.iAllocSize;
+    TInt initSlabCount = aParm.iInitSlabCount;
+    //TBool useRandomSize = aParm.iUseRandomSize;
+    //TInt threadCount = aParm.iThreadCount;
+    TInt threadIndex = aParm.iThreadIndex;
+
+    TInt slabsPerPage = PageSize/SLABSIZE;
+
+    test(initSlabCount % slabsPerPage == 0); // for this test
+    
+#ifdef _DEBUG
+    TInt allocRealCellSize = allocSize + RHeap::EDebugHdrSize;
+#else
+    TInt allocRealCellSize = allocSize;
+#endif
+
+    TMetaData metaData;
+    GetMeta(*heap, metaData);
+    
+    if (allocRealCellSize >= metaData.iSlabThreshold)
+        {
+        allocRealCellSize = metaData.iSlabThreshold - 1;
+#ifdef _DEBUG
+        allocSize = allocRealCellSize - RHeap::EDebugHdrSize;
+#else
+        allocSize = allocRealCellSize;
+#endif
+        }
+    
+    TAny** pBuf = &PtrBuf[threadIndex][0];
+    TInt i;
+    for (i=0; i<MAX_ALLOCS; ++i)
+        {
+        pBuf[i] = 0;
+        }
+
+    //Allocate enough cells of the same size to fill initSlabCount (128) slabs
+    TInt slabsetIndex = metaData.iSizeMap[(allocRealCellSize+3)>>2];
+    test(slabsetIndex != 0xff);
+    TInt slabCellSize = 4 + (slabsetIndex * 4);
+    
+    TInt slabPayloadSize = SLABSIZE - sizeof(slabhdr);
+    TInt cellCountPerSlab = slabPayloadSize / slabCellSize;
+    TInt initCellCount = initSlabCount * cellCountPerSlab;
+
+    TSTSLAB_DBG(RDebug::Printf("=========== Allocate enough cells of the same size to fill %d slabs", initSlabCount));
+    TSTSLAB_DBG(RDebug::Printf("=========== counts: %d %d %d", cellCountPerSlab, initCellCount, slabCellSize));
+
+    for (i=0; i<initCellCount; ++i)
+        {
+        pBuf[i] = heap->Alloc(allocSize);
+        test(pBuf[i] != 0);
+        }
+
+    heap->Check();
+
+    TInt maxI5 = initCellCount + (cellCountPerSlab*(slabsPerPage+1));
+    for (i=initCellCount; i<maxI5; ++i)
+        {
+        pBuf[i] = heap->Alloc(allocSize);
+        test(pBuf[i] != 0);
+        }
+
+    heap->Check();
+    
+    TAny* p2 = heap->Alloc(allocSize);
+    test(p2 != 0);
+
+    heap->Check();
+    heap->Free(p2);
+
+    heap->Check();
+    
+
+    TInt page2pBufIndexFirst = cellCountPerSlab * slabsPerPage;
+    //TInt page2pBufIndexLast = page2pBufIndexFirst + (cellCountPerSlab * slabsPerPage);
+    
+    slab* partialTreeSlabX1 = SlabFor(pBuf[page2pBufIndexFirst]);
+    page* partialTreeSlabPageX1 = PageFor(partialTreeSlabX1);
+    
+    heap->Free(pBuf[page2pBufIndexFirst]);
+    pBuf[page2pBufIndexFirst] = 0;
+
+    heap->Check();
+    
+    TAny* p3 = heap->Alloc(allocSize);
+    test(p3 != 0);
+    heap->Check();
+    heap->Free(p3);
+    heap->Check();
+    
+    TInt size2 = metaData.iChunkSize;
+    TSTSLAB_DBG(RDebug::Printf("---- size2: 0x%08x", size2));
+    if (metaData.iSparePage)
+        {
+        size2 -= PageSize;
+        }
+
+    for (i=0; i<MAX_ALLOCS; ++i)
+        {
+        if (pBuf[i]) {
+            page* page1 = PageFor(SlabFor(pBuf[i]));
+            if (partialTreeSlabPageX1 == page1)
+                {
+                heap->Free(pBuf[i]);
+                pBuf[i] = 0;
+                }
+            }
+        }
+
+    heap->Check();
+
+    TInt size3 = metaData.iChunkSize;
+    if (metaData.iSparePage)
+        {
+        size3 -= PageSize;
+        }
+
+    TInt bufIndexFirst = cellCountPerSlab;
+    TInt maxI = bufIndexFirst + cellCountPerSlab;
+    for (i=bufIndexFirst; i<=maxI; ++i)
+        {
+        if (pBuf[i])
+            {
+            heap->Free(pBuf[i]);
+            pBuf[i] = 0;
+            }
+        }
+
+    heap->Check();
+
+    TInt firstI = cellCountPerSlab * 3;
+    maxI = firstI + cellCountPerSlab;
+    for (i=firstI; i<=maxI; ++i)
+        {
+        if (i % 3 == 0)
+            {
+            if (pBuf[i])
+                {
+                heap->Free(pBuf[i]);
+                pBuf[i] = 0;
+                }
+            }
+        }
+    
+    heap->Check();
+    
+    //Reallocate cells.
+    for (i=0; i<(MAX_ALLOCS); ++i)
+        {
+        if (pBuf[i] != 0)
+            {
+            pBuf[i] = heap->ReAlloc(pBuf[i], allocSize);
+            test(pBuf[i] != 0);
+            }
+        }
+    
+    heap->Check();
+    
+    //Allocate cells.
+    for (i=0; i<(MAX_ALLOCS/4); ++i)
+        {
+        if (pBuf[i] == 0)
+            {
+            pBuf[i] = heap->Alloc(allocSize);
+            test(pBuf[i] != 0);
+            }
+        }
+
+    heap->Check();
+    
+    for (i=0; i<MAX_ALLOCS; ++i)
+        {
+        if (pBuf[i])
+            {
+            heap->Free(pBuf[i]);
+            pBuf[i] = 0;
+            }
+        }
+    heap->Check();
+
+    TSTSLAB_DBG(RDebug::Printf("=========== TestSlabFixedSizeManyThreads end"));
+    }
+    
+    
+LOCAL_C void TestSlabFixedSizeOneThread(TSlabTestThreadParm& aParm)
+    {
+    RHeap* heap = aParm.iHeap;
+    TInt allocSize = aParm.iAllocSize;
+    TInt initSlabCount = aParm.iInitSlabCount;
+    //TBool useRandomSize = aParm.iUseRandomSize;
+    //TInt threadCount = aParm.iThreadCount;
+    TInt threadIndex = aParm.iThreadIndex;
+
+    TInt slabsPerPage = PageSize/SLABSIZE;
+
+    test(initSlabCount % slabsPerPage == 0); // for this test
+    
+#ifdef _DEBUG
+    TInt allocRealCellSize = allocSize + RHeap::EDebugHdrSize;
+#else
+    TInt allocRealCellSize = allocSize;
+#endif
+
+    TMetaData metaData;
+    GetMeta(*heap, metaData);
+    
+    TSTSLAB_DBG(PrintMeta(" --- TestSlabFixedSizeOneThread start", metaData));
+
+    if (allocRealCellSize >= metaData.iSlabThreshold)
+        {
+        allocRealCellSize = metaData.iSlabThreshold - 1;
+#ifdef _DEBUG
+        allocSize = allocRealCellSize - RHeap::EDebugHdrSize;
+#else
+        allocSize = allocRealCellSize;
+#endif
+        }
+
+    TAny** pBuf = &PtrBuf[threadIndex][0];
+    TInt i;
+    for (i=0; i<MAX_ALLOCS; ++i)
+        {
+        pBuf[i] = 0;
+        }
+
+    //Allocate enough cells of the same size to fill initSlabCount (128) slabs
+    TInt slabsetIndex = metaData.iSizeMap[(allocRealCellSize+3)>>2];
+    test(slabsetIndex != 0xff);
+    TInt slabCellSize = 4 + (slabsetIndex * 4);
+    
+    TInt slabPayloadSize = SLABSIZE - sizeof(slabhdr);
+    TInt cellCountPerSlab = slabPayloadSize / slabCellSize;
+    TInt initCellCount = initSlabCount * cellCountPerSlab;
+
+    TSTSLAB_DBG(RDebug::Printf("=========== Allocate enough cells of the same size to fill %d slabs", initSlabCount));
+    TSTSLAB_DBG(RDebug::Printf("=========== counts: %d %d %d", cellCountPerSlab, initCellCount, slabCellSize));
+
+    for (i=0; i<initCellCount; ++i)
+        {
+        pBuf[i] = heap->Alloc(allocSize);
+        test(pBuf[i] != 0);
+        }
+
+    heap->Check();
+    GetMeta(*heap, metaData);
+    
+    TSTSLAB_DBG(PrintMeta("after init allocs", metaData));
+    TSTSLAB_DBG(DebugPrintSlabs(slabsetIndex, metaData));
+
+    //Check the number of pages used corresponds to the number of slabs.
+    TSTSLAB_DBG(RDebug::Printf("=========== Check the number of pages used corresponds to the number of slabs"));
+    
+    TInt pageCountForSlabs1 = (metaData.iChunkSize / PageSize) - 1;
+    TInt pageCountForSlabs2 = (initSlabCount+(slabsPerPage-1)) / slabsPerPage;
+    TSTSLAB_DBG(RDebug::Printf("=========== page counts: %d %d", pageCountForSlabs1, pageCountForSlabs2));
+    test(pageCountForSlabs1 == pageCountForSlabs2);
+
+    //-----------------------------------------
+    TSTSLAB_DBG(RDebug::Printf("=========== check slab counts in the lists"));
+    
+    slab* fullSlab = metaData.iFullSlab;
+    TInt fullSlabCount = 0;
+    while (fullSlab)
+        {
+        TSTSLAB_DBG(RDebug::Printf("fullSlab: 0x%08x", fullSlab));
+        fullSlabCount++;
+        fullSlab = fullSlab->iChild1;
+        }
+
+    TInt outParm;
+    TInt partialTreeSlabCount = 0;
+    partialTreeSlabCount = WalkSlabSet(slabsetIndex, metaData, ETestWalk, 0, outParm);
+
+    slab* partialPageSlab = metaData.iPartialPage;
+    TInt partialPageSlabCount = 0;
+    while (partialPageSlab)
+        {
+        TSTSLAB_DBG(RDebug::Printf("partialPageSlab (empty): 0x%08x", partialPageSlab));
+        partialPageSlabCount++;
+        partialPageSlab = partialPageSlab->iChild1;
+        }
+
+    test(fullSlabCount == (initSlabCount-1));
+    test(partialTreeSlabCount == 1);
+    if (initSlabCount % slabsPerPage == 0)
+        {
+        test(partialPageSlabCount == 0);
+        }
+    else
+        {
+        test(partialPageSlabCount == 1);
+        }
+    //-----------------------------------------
+    TSTSLAB_DBG(RDebug::Printf("=========== alloc one cell more -> one full slab more"));
+
+    TAny* p = heap->Alloc(allocSize);
+    test(p != 0);
+    
+    heap->Check();
+    GetMeta(*heap, metaData);
+    TSTSLAB_DBG(DebugPrintSlabs(slabsetIndex, metaData));
+    
+    fullSlab = metaData.iFullSlab;
+    fullSlabCount = 0;
+    while (fullSlab)
+        {
+        TSTSLAB_DBG(RDebug::Printf("fullSlab: 0x%08x", fullSlab));
+        fullSlabCount++;
+        fullSlab = fullSlab->iChild1;
+        }
+    test(fullSlabCount == initSlabCount);
+
+    heap->Free(p);
+
+    heap->Check();
+    GetMeta(*heap, metaData);
+    TSTSLAB_DBG(DebugPrintSlabs(slabsetIndex, metaData));
+    
+    //-----------------------------------------
+    //Check that a new slab is taken from a partially filled page if available.
+    TSTSLAB_DBG(RDebug::Printf("=========== Check that a new slab is taken from a partially filled page if available"));
+
+    // fill the first slab in the page (after iSparePage)
+    TInt maxI5 = initCellCount + (cellCountPerSlab*(slabsPerPage+1));
+    for (i=initCellCount; i<maxI5; ++i)
+        {
+        pBuf[i] = heap->Alloc(allocSize);
+        test(pBuf[i] != 0);
+        }
+
+    heap->Check();
+    GetMeta(*heap, metaData);
+    TSTSLAB_DBG(DebugPrintSlabs(slabsetIndex, metaData));
+    
+    partialPageSlab = metaData.iPartialPage;
+    partialPageSlabCount = 0;
+    while (partialPageSlab)
+        {
+        TSTSLAB_DBG(RDebug::Printf("partialPageSlab (empty): 0x%08x", partialPageSlab));
+        partialPageSlabCount++;
+        partialPageSlab = partialPageSlab->iChild1;
+        }
+    test(partialPageSlabCount == 1);
+
+    page* page1 = PageFor(metaData.iPartialPage);
+    unsigned header = page1->iSlabs[0].iHeader;
+    unsigned pagemap = SlabHeaderPagemap(header);
+    unsigned slabix = LOWBIT(pagemap);
+    slab* partialPageSlab2 = &page1->iSlabs[slabix];
+    
+    TAny* p2 = heap->Alloc(allocSize);
+    test(p2 != 0);
+
+    heap->Check();
+    TSTSLAB_DBG(RDebug::Printf("p2: 0x%08x; partialPageSlab2: 0x%08x", p2, partialPageSlab2));
+    test(partialPageSlab2 == SlabFor(p2));
+    heap->Free(p2);
+
+    heap->Check();
+    
+    //-----------------------------
+    // use the second page for the next test
+    TInt page2pBufIndexFirst = cellCountPerSlab * slabsPerPage;
+    //TInt page2pBufIndexLast = page2pBufIndexFirst + (cellCountPerSlab * slabsPerPage);
+    
+    //-----------------------------------------
+    //Check that a partially filled slab is used if available.
+    TSTSLAB_DBG(RDebug::Printf("=========== Check that a partially filled slab is used if available"));
+
+    slab* partialTreeSlabX1 = SlabFor(pBuf[page2pBufIndexFirst]);
+    page* partialTreeSlabPageX1 = PageFor(partialTreeSlabX1);
+    
+    heap->Free(pBuf[page2pBufIndexFirst]);
+    pBuf[page2pBufIndexFirst] = 0;
+
+    heap->Check();
+    
+    TAny* p3 = heap->Alloc(allocSize);
+    test(p3 != 0);
+    heap->Check();
+    test(partialTreeSlabX1 == SlabFor(p3));
+    heap->Free(p3);
+    heap->Check();
+    
+    //-----------------------------------------
+    //Check that if all four slabs in a page are free the page is freed.
+    TSTSLAB_DBG(RDebug::Printf("=========== Check that if all four slabs in a page are free, the page is freed"));
+
+    GetMeta(*heap, metaData);
+    TSTSLAB_DBG(DebugPrintSlabs(slabsetIndex, metaData));
+
+    TInt size2 = metaData.iChunkSize;
+    TSTSLAB_DBG(RDebug::Printf("---- size2: 0x%08x", size2));
+    if (metaData.iSparePage)
+        {
+        size2 -= PageSize;
+        }
+
+    for (i=0; i<MAX_ALLOCS; ++i)
+        {
+        if (pBuf[i]) {
+            page* page1 = PageFor(SlabFor(pBuf[i]));
+            if (partialTreeSlabPageX1 == page1)
+                {
+                heap->Free(pBuf[i]);
+                pBuf[i] = 0;
+                }
+            }
+        }
+
+    heap->Check();
+    GetMeta(*heap, metaData);
+    TSTSLAB_DBG(DebugPrintSlabs(slabsetIndex, metaData));
+
+    TInt size3 = metaData.iChunkSize;
+    if (metaData.iSparePage)
+        {
+        size3 -= PageSize;
+        }
+
+    test(size3 == (size2-PageSize));
+
+    //-----------------------------------------
+    //Free cells to give empty slab (The second slab in the first page)
+    TSTSLAB_DBG(RDebug::Printf("=========== Free cells to give empty slab (The second slab in the first page)"));
+    slab* emptySlabAddr = (slab*)(metaData.iMemBase + SLABSIZE);
+
+    //Check that emptySlabAddr is not already in iPartialPage list
+    partialPageSlab = metaData.iPartialPage;
+    while (partialPageSlab)
+        {
+        if (partialPageSlab == emptySlabAddr)
+            {
+            test(0);
+            }
+        partialPageSlab = partialPageSlab->iChild1;
+        }
+
+    // free cells to give empty slab  - emptySlabAddr
+    TInt bufIndexFirst = cellCountPerSlab;
+    TInt maxI = bufIndexFirst + cellCountPerSlab;
+    for (i=bufIndexFirst; i<=maxI; ++i)
+        {
+        if (pBuf[i])
+            {
+            heap->Free(pBuf[i]);
+            pBuf[i] = 0;
+            }
+        }
+
+    heap->Check();
+    GetMeta(*heap, metaData);
+    TSTSLAB_DBG(DebugPrintSlabs(slabsetIndex, metaData));
+
+    // Check that emptySlabAddr is not now in iPartialPage list
+    partialPageSlab = metaData.iPartialPage;
+    while (partialPageSlab)
+        {
+        if (partialPageSlab == emptySlabAddr)
+            {
+            break;
+            }
+        partialPageSlab = partialPageSlab->iChild1;
+        }
+    test(partialPageSlab != 0);
+
+    //Free cells to give partial slab (The third slab in the first page)
+    TSTSLAB_DBG(RDebug::Printf("=========== Free cells to give partial slab (The third slab in the first page)"));
+    slab* partialSlabAddr = (slab*)(metaData.iMemBase + (3*SLABSIZE));
+
+    // Check that partialSlabAddr is not now in iPartialSlab list
+    WalkSlabSet(slabsetIndex, metaData, ETestFindSlab, partialSlabAddr, outParm);
+    test(outParm == 0);
+
+    TInt firstI = cellCountPerSlab * 3;
+    maxI = firstI + cellCountPerSlab;
+    for (i=firstI; i<=maxI; ++i)
+        {
+        if (i % 3 == 0)
+            {
+            if (pBuf[i])
+                {
+                heap->Free(pBuf[i]);
+                pBuf[i] = 0;
+                }
+            }
+        }
+    
+    heap->Check();
+    GetMeta(*heap, metaData);
+    TSTSLAB_DBG(DebugPrintSlabs(slabsetIndex, metaData));
+    
+    // Check that partialSlabAddr is now in iPartialSlab list
+    WalkSlabSet(slabsetIndex, metaData, ETestFindSlab, partialSlabAddr, outParm);
+    test(outParm == 1);
+    
+    //Reallocate cells.
+    for (i=0; i<(MAX_ALLOCS); ++i)
+        {
+        if (pBuf[i] != 0)
+            {
+            pBuf[i] = heap->ReAlloc(pBuf[i], allocSize);
+            test(pBuf[i] != 0);
+            }
+        }
+
+    heap->Check();
+    
+    //Allocate cells.
+    for (i=0; i<(MAX_ALLOCS/4); ++i)
+        {
+        if (pBuf[i] == 0)
+            {
+            pBuf[i] = heap->Alloc(allocSize);
+            test(pBuf[i] != 0);
+            }
+        }
+
+    heap->Check();
+    
+    for (i=0; i<MAX_ALLOCS; ++i)
+        {
+        if (pBuf[i])
+            {
+            heap->Free(pBuf[i]);
+            pBuf[i] = 0;
+            }
+        }
+    heap->Check();
+
+    TSTSLAB_DBG(RDebug::Printf("=========== TestSlabFixedSizeOneThread end"));
+    }
+
+LOCAL_C RHeap* CreateSlabHeap(TInt aThreadCount)
+{
+    //TPtrC slabHeap=_L("SlabHeap");
+    //RHeap* heap = User::ChunkHeap(&slabHeap, 0x1000, 0x10000);
+    TInt maxLth = 0x60000 * aThreadCount;
+    RHeap* heap = User::ChunkHeap(0, 0x1000, maxLth);
+    test(heap!=NULL);
+
+    // Configure heap for slab
+    RHybridHeap::STestCommand cmd;
+    cmd.iCommand = RHybridHeap::ESetConfig;
+    cmd.iConfig.iSlabBits = 0xabe;
+    cmd.iConfig.iDelayedSlabThreshold = 0;
+    cmd.iConfig.iPagePower = 0;  // 16 // 0 -> no page allocator
+    TInt ret = heap->DebugFunction(RHeap::EHybridHeap, &cmd, 0);
+    test(ret == KErrNone);
+    
+    return heap;
+}
+
+LOCAL_C TInt SlabTestManyThreads(TAny* aThreadParm)
+    {
+    TSlabTestThreadParm* parm = (TSlabTestThreadParm*)aThreadParm;
+
+    TInt i;
+    TInt maxLoops = 30; //300;
+    for (i=0; i<maxLoops; ++i)
+        {
+        TestSlabFixedSizeManyThreads(*parm);
+        }
+                                
+    return KErrNone;
+    }
+    
+LOCAL_C TInt SlabTestOneThread(TAny* aThreadParm)
+    {
+    TSlabTestThreadParm* parm = (TSlabTestThreadParm*)aThreadParm;
+    TestSlabFixedSizeOneThread(*parm);
+    return KErrNone;
+    }
+    
+TInt StartThreads(TInt aThreadCount, TSlabTestThreadParm& aThreadParm)
+    {
+    const TInt KSlabTestThreadStackSize=0x4000; //0x10000; //0x2000;
+
+    TRequestStatus  theStatus[MAX_THREADS];
+    RThread         theThreads[MAX_THREADS];
+    TBool           threadInUse[MAX_THREADS];
+
+    TInt index;
+    TInt ret;
+
+    if (aThreadCount <= 0)
+        {
+        return KErrNone;
+        }
+
+    RHeap* heap = CreateSlabHeap(aThreadCount);
+    aThreadParm.iHeap = heap;
+    
+    for (index = 0; index < aThreadCount; index++)
+        {
+        ThreadParm[index].iHeap             = aThreadParm.iHeap;
+        ThreadParm[index].iAllocSize        = aThreadParm.iAllocSize;
+        ThreadParm[index].iInitSlabCount    = aThreadParm.iInitSlabCount;
+        ThreadParm[index].iUseRandomSize    = aThreadParm.iUseRandomSize;
+        ThreadParm[index].iThreadCount      = aThreadParm.iThreadCount;
+        
+        ThreadParm[index].iThreadIndex = index;
+        
+        TBuf<32> threadName;
+        threadName.Format(_L("SlabTest%d"), index);
+        if (aThreadCount == 1)
+            {
+            ret = theThreads[index].Create(threadName, SlabTestOneThread, KSlabTestThreadStackSize, NULL, (TAny*)&ThreadParm[index]);
+            }
+        else
+            {
+            ret = theThreads[index].Create(threadName, SlabTestManyThreads, KSlabTestThreadStackSize, NULL, (TAny*)&ThreadParm[index]);
+            }
+        test(ret == KErrNone);
+        theThreads[index].Logon(theStatus[index]);
+        test(theStatus[index] == KRequestPending);
+        threadInUse[index] = ETrue;
+        theThreads[index].Resume();
+        }
+
+    User::WaitForAnyRequest();
+    
+    TBool anyUsed = ETrue;
+    while (anyUsed)
+        {
+        User::After(1001000);
+        anyUsed = EFalse;
+        for (index = 0; index < aThreadCount; index++)
+            {
+            if (threadInUse[index])
+                {
+                if (theThreads[index].ExitType() != EExitPending)
+                    {
+                    threadInUse[index] = EFalse;
+                    }
+                else
+                    {
+                    anyUsed = ETrue;
+                    }
+                }
+            }
+        }
+    
+    for (index = 0; index < aThreadCount; index++)
+        {
+        theThreads[index].Close();
+        }
+    TSTSLAB_DBG(RDebug::Printf("=========== StartThreads end"));
+    heap->Close();
+
+    return KErrNone;
+    }
+
+GLDEF_C TInt E32Main(void)
+    {
+    TInt ret;
+    
+    test.Title();
+
+    __KHEAP_MARK;
+    
+    test.Start(_L("TestSlab"));
+    UserHal::PageSizeInBytes(PageSize);
+
+    RHeap* heap = CreateSlabHeap(1);
+    
+    TMetaData metaData;
+    GetMeta(*heap, metaData);
+
+    heap->Close();
+
+    if (metaData.iDLOnly)
+        {
+        test.Printf(_L("Slab allocator is not used, no tests to run\n"));
+        __KHEAP_MARKEND;
+        test.End();
+        return(0);
+        }
+    
+    TSlabTestThreadParm threadParm;
+    threadParm.iHeap = heap;
+    threadParm.iAllocSize = 17;
+    threadParm.iInitSlabCount = 128; // 12
+    threadParm.iUseRandomSize = EFalse;
+
+    test.Next(_L("TestSlab - one thread"));
+
+    TInt threadCount;
+    threadCount = 1;
+    if (threadCount > MAX_THREADS)
+        {
+        threadCount = MAX_THREADS;
+        }
+    threadParm.iThreadCount = threadCount;
+    
+#if 0
+    ret = StartThreads(threadCount, threadParm);
+    test(ret==KErrNone);
+    
+#else   
+    
+    TInt i;
+    for (i=1; i<metaData.iSlabThreshold; ++i)
+        {
+#ifdef _DEBUG
+        if ((i + RHeap::EDebugHdrSize) >= metaData.iSlabThreshold)
+            {
+            break;
+            }
+#endif // _DEBUG
+        TSTSLAB_DBG(RDebug::Printf("=========== StartThreads size: %d", i));
+        threadParm.iAllocSize = i;
+        test.Printf(_L("AllocSize: %d\n"), i);
+        ret = StartThreads(threadCount, threadParm);
+        test(ret==KErrNone);
+        }
+#endif
+
+    
+    test.Next(_L("TestSlab - many threads"));
+
+    threadParm.iAllocSize = 17;
+    
+    threadCount = 3;
+    if (threadCount > MAX_THREADS)
+        {
+        threadCount = MAX_THREADS;
+        }
+    threadParm.iThreadCount = threadCount;
+    
+#if 1
+    ret = StartThreads(threadCount, threadParm);
+    test(ret==KErrNone);
+    
+#else   
+    
+    TInt i;
+    for (i=1; i<metaData.iSlabThreshold; ++i)
+        {
+#ifdef _DEBUG
+        if ((i + RHeap::EDebugHdrSize) >= metaData.iSlabThreshold)
+            {
+            break;
+            }
+#endif // _DEBUG
+        TSTSLAB_DBG(RDebug::Printf("=========== StartThreads size: %d", i));
+        threadParm.iAllocSize = i;
+        test.Printf(_L("AllocSize: %d\n"), i);
+        ret = StartThreads(threadCount, threadParm);
+        test(ret==KErrNone);
+        }
+#endif
+
+    __KHEAP_MARKEND;
+    
+    test.End();
+    return(0);
+    }
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/heap/t_heapstress.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/heap/t_heapstress.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,1233 @@
+// Copyright (c) 2002-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test\heap\t_heaphybridstress.cpp
+// Overview:
+// Tests RHybridHeap class: stress test
+// API Information:
+// RHybridHeap/RHeap
+// Details:
+// - Stress test heap implementation that allocates, frees
+//   and reallocates cells in random patterns, and checks the heap.
+// - Allocated/reallocated buffer content is verified, when buffer is freed/reallocated.
+// - Stress test with a single thread
+// - Stress test with two threads that run concurrently.
+// - Tests configured for slab, doug lea, paged and hybrid allocators
+// Platforms/Drives/Compatibility:
+// All
+// Assumptions/Requirement/Pre-requisites:
+// Failures and causes:
+// Base Port information:
+// 
+//
+
+#include <e32test.h>
+#include <e32hal.h>
+#include <e32def.h>
+#include <e32def_private.h>
+#include "dla.h"
+#include "slab.h"
+#include "page_alloc.h"
+#include "heap_hybrid.h"
+
+// Needed for KHeapShrinkHysRatio which is now ROM 'patchdata'
+#include "TestRHeapShrink.h"
+
+//-------------------------------------------
+
+//#define TSTDBG_PRINTMETA(a) a
+#define TSTDBG_PRINTMETA(a)
+
+//-------------------------------------------
+
+
+#ifdef __EABI__
+       IMPORT_D extern const TInt KHeapMinCellSize;
+#else
+       const TInt KHeapMinCellSize = 0;
+#endif
+
+RTest test(_L("T_HEAPSTRESS"));
+
+#define TEST_ALIGN(p,a)     test((TLinAddr(p)&((a)-1))==0)
+
+
+#define TST_HEAP_MAX_LTH 0x4000000 // 64M
+#define MAX_CELL_COUNT 0x100000 // 0x100 0x1000 0x10000 0x100000
+#define MAX_THREAD_COUNT 2
+LOCAL_D TUint8* HeapStressCell[MAX_THREAD_COUNT][MAX_CELL_COUNT];
+LOCAL_D TInt HeapStressLen[MAX_THREAD_COUNT][MAX_CELL_COUNT];
+
+enum TTestHybridHeapFunc {ETstOnlySlab, ETstOnlyDl, ETstOnlyPaged, ETstHybrid};
+enum TTestType {ETestE32Test, ETestForeverOne, ETestForeverAll};
+
+LOCAL_D TTimeIntervalMicroSeconds32 TickPeriod;
+
+//--------- config parameters - begin
+LOCAL_D TTestType TestType;
+LOCAL_D TInt TestTimeAsSeconds;
+LOCAL_D TBool TestForeverMultiThreadTest;
+LOCAL_D TTestHybridHeapFunc TestHybridHeapFunc;
+LOCAL_D TInt CurrMaxCellCount;
+LOCAL_D TInt HeapMaxLength;
+//--------- config parameters - end
+
+LOCAL_D TBool DlOnly;
+
+LOCAL_D TInt SlabThreshold;
+LOCAL_D TInt PageThreshold;
+
+
+struct TMetaData
+    {
+    TBool           iDLOnly;
+    RFastLock*      iLock;
+    TInt            iChunkSize;
+    TInt            iSlabThreshold;
+    TInt            iPageThreshold;
+    TInt            iSlabInitThreshold;
+    TUint32         iSlabConfigBits;
+    slab*           iPartialPage;
+    slab*           iFullSlab;
+    page*           iSparePage;
+    TUint8*         iMemBase;
+    TUint8          iSizeMap[(MAXSLABSIZE>>2)+1];
+    slabset         iSlabAlloc[MAXSLABSIZE>>2];
+    slab**          iSlabAllocRealRootAddress[MAXSLABSIZE>>2];
+    };
+
+class TestHybridHeap
+    {
+public:
+    static void GetHeapMetaData(RHeap& aHeap, TMetaData& aMeta);
+    };
+
+void TestHybridHeap::GetHeapMetaData(RHeap& aHeap, TMetaData& aMeta)
+{
+    RHybridHeap::STestCommand cmd;
+    cmd.iCommand = RHybridHeap::EHeapMetaData;
+    TInt ret = aHeap.DebugFunction(RHeap::EHybridHeap, &cmd, 0);
+    test(ret == KErrNone);
+    
+    RHybridHeap* hybridHeap = (RHybridHeap*)cmd.iData;
+    
+    aMeta.iDLOnly              = hybridHeap->iDLOnly;
+    aMeta.iLock                = &hybridHeap->iLock;
+    aMeta.iChunkSize           = hybridHeap->iChunkSize;
+    aMeta.iSlabThreshold       = hybridHeap->iSlabThreshold;
+    aMeta.iPageThreshold       = hybridHeap->iPageThreshold;
+    aMeta.iSlabInitThreshold   = hybridHeap->iSlabInitThreshold;
+    aMeta.iSlabConfigBits      = hybridHeap->iSlabConfigBits;
+    aMeta.iPartialPage         = hybridHeap->iPartialPage;
+    aMeta.iFullSlab            = hybridHeap->iFullSlab;
+    aMeta.iSparePage           = hybridHeap->iSparePage;
+    aMeta.iMemBase             = hybridHeap->iMemBase;
+
+    TInt i;
+    TInt count;
+    count = sizeof(aMeta.iSizeMap)/sizeof(unsigned char);
+    for (i=0; i<count; ++i)
+        {
+        aMeta.iSizeMap[i] = hybridHeap->iSizeMap[i];
+        }
+    count = sizeof(aMeta.iSlabAlloc)/sizeof(slabset);
+    for (i=0; i<count; ++i)
+        {
+        aMeta.iSlabAlloc[i].iPartial = hybridHeap->iSlabAlloc[i].iPartial;
+        aMeta.iSlabAllocRealRootAddress[i] = &hybridHeap->iSlabAlloc[i].iPartial;
+        }
+}
+
+LOCAL_C void GetMeta(RHeap& aHeap, TMetaData& aMeta)
+{
+    TestHybridHeap::GetHeapMetaData(aHeap, aMeta);
+}
+
+
+TSTDBG_PRINTMETA(
+LOCAL_C void PrintMeta(const char* aText, TMetaData& aMeta)
+{
+    RDebug::Printf("=========== HeapMetaData (local) - begin: %s", aText);
+
+    RDebug::Printf("iDLOnly: 0x%08x", aMeta.iDLOnly);
+    RDebug::Printf("iChunkSize: 0x%08x", aMeta.iChunkSize);
+    RDebug::Printf("iSlabThreshold: 0x%08x / %d", aMeta.iSlabThreshold, aMeta.iSlabThreshold);
+    RDebug::Printf("iPageThreshold: 0x%08x / %d", aMeta.iPageThreshold, aMeta.iPageThreshold);
+    RDebug::Printf("iSlabInitThreshold: 0x%08x / %d", aMeta.iSlabInitThreshold, aMeta.iSlabInitThreshold);
+    RDebug::Printf("iSlabConfigBits: 0x%08x", aMeta.iSlabConfigBits);
+    RDebug::Printf("iPartialPage: 0x%08x", aMeta.iPartialPage);
+    RDebug::Printf("iFullSlab: 0x%08x", aMeta.iFullSlab);
+    RDebug::Printf("iSparePage: 0x%08x", aMeta.iSparePage);
+    RDebug::Printf("iMemBase: 0x%08x", aMeta.iMemBase);
+
+    TInt i;
+    TInt count;
+    count = sizeof(aMeta.iSizeMap)/sizeof(unsigned char);
+    for (i=0; i<count; ++i)
+        {
+        RDebug::Printf("iSizeMap[%d]: %d", i, aMeta.iSizeMap[i]);
+        }
+    count = sizeof(aMeta.iSlabAlloc)/sizeof(slabset);
+    for (i=0; i<count; ++i)
+        {
+        RDebug::Printf("iSlabAlloc[%d].iPartial: 0x%08x", i, aMeta.iSlabAlloc[i].iPartial);
+        }
+    for (i=0; i<count; ++i)
+        {
+        RDebug::Printf("iSlabAllocRealRootAddress[%d]: 0x%08x", i, aMeta.iSlabAllocRealRootAddress[i]);
+        }
+    RDebug::Printf("=========== HeapMetaData (local) - end");
+}
+)
+
+LOCAL_C void ConfHeap(RHeap* aHeap)
+{
+    RHybridHeap::STestCommand cmd;
+
+    if (TestHybridHeapFunc == ETstOnlySlab)
+        {
+        cmd.iCommand = RHybridHeap::ESetConfig;
+        cmd.iConfig.iSlabBits = 0xabe;
+        cmd.iConfig.iDelayedSlabThreshold = 0;            // 0 -> use slab at once from the beginning
+        cmd.iConfig.iPagePower = 0;                       // 0 -> no page allocator
+        }
+    else if (TestHybridHeapFunc == ETstOnlyDl)
+        {
+        cmd.iCommand = RHybridHeap::ESetConfig;
+        cmd.iConfig.iSlabBits = 0xabe;
+        cmd.iConfig.iDelayedSlabThreshold = 0x40000000;   // 1G -> slab never used
+        cmd.iConfig.iPagePower = 0;                       // 0 -> no page allocator
+        }
+    else if (TestHybridHeapFunc == ETstOnlyPaged)
+        {
+        cmd.iCommand = RHybridHeap::ESetConfig;
+        cmd.iConfig.iSlabBits = 0xabe;
+        cmd.iConfig.iDelayedSlabThreshold = 0x40000000;   // 1G -> slab never used
+        cmd.iConfig.iPagePower = 14;                      // min page 14 -> 16K
+        }
+    else if (TestHybridHeapFunc == ETstHybrid)
+        {
+        cmd.iCommand = RHybridHeap::ESetConfig;
+        cmd.iConfig.iSlabBits = 0xabe;
+        cmd.iConfig.iDelayedSlabThreshold = 0;            // 0 -> use slab at once from the beginning
+        cmd.iConfig.iPagePower = 14;                      // min page 14 -> 16K
+        }
+    else
+        {
+        test(0);
+        }
+    
+    TInt ret = aHeap->DebugFunction(RHeap::EHybridHeap, &cmd, 0);
+    test(ret == KErrNone);
+}
+
+LOCAL_C TInt MinPagedAllocLength(void)
+{
+    return (1 << PageThreshold);
+}
+
+LOCAL_C TUint32 RandomPagedLength(TUint32 aRandom)
+{
+    TUint32 ret;
+    ret = aRandom;
+    ret <<= PageThreshold;
+    if (TestHybridHeapFunc == ETstOnlyPaged)
+        {
+        //ret &= 0xfffff; // below 1M
+        ret &= 0x7ffff; // below 512K
+        }
+    else
+        {
+        ret &= 0x1ffff; // below 128K
+        }
+    if (ret == 0)
+        {
+        ret = MinPagedAllocLength();
+        }
+    return ret;
+}
+
+#if 0            
+LOCAL_C TUint TicksAsMilliSeconds(TUint aTicks)
+{
+    TUint time = TUint((TUint64)aTicks*(TUint64)TickPeriod.Int()/(TUint64)1000);
+    return time;
+}
+#endif
+
+LOCAL_C TBool IsDlOnly(void)
+{
+    TestHybridHeapFunc = ETstHybrid;
+    
+    RHeap* heap;
+    heap = UserHeap::ChunkHeap(&KNullDesC(), 0x1000, 0x4000, 0x1000, 4);
+    test(heap != NULL);
+
+    ConfHeap(heap);
+    
+    TMetaData metaData;
+    GetMeta(*heap, metaData);
+    
+    heap->Close();
+    return metaData.iDLOnly;
+}
+
+LOCAL_C RHeap* CreateTestHeap(TInt aAlign)
+{
+    if (HeapMaxLength > TST_HEAP_MAX_LTH)
+        {
+        HeapMaxLength = TST_HEAP_MAX_LTH;
+        }
+    
+    if (CurrMaxCellCount > MAX_CELL_COUNT)
+        {
+        CurrMaxCellCount = MAX_CELL_COUNT;
+        }
+    
+    RHeap* heap;
+    heap = UserHeap::ChunkHeap(&KNullDesC(), 0x1000, HeapMaxLength, 0x1000, aAlign);
+    test(heap != NULL);
+
+    ConfHeap(heap);
+    
+    TMetaData metaData;
+    GetMeta(*heap, metaData);
+    
+    if (TestHybridHeapFunc == ETstOnlySlab)
+        {
+        SlabThreshold = metaData.iSlabThreshold;
+        test(SlabThreshold != 0);
+        }
+    else if (TestHybridHeapFunc == ETstOnlyDl)
+        {
+        }
+    else if (TestHybridHeapFunc == ETstOnlyPaged)
+        {
+        PageThreshold = metaData.iPageThreshold;
+        test(PageThreshold >= 14);
+        }
+    else if (TestHybridHeapFunc == ETstHybrid)
+        {
+        }
+    else
+        {
+        test(0);
+        }
+
+    return heap;
+}
+
+//-------------------------------------------------------------------
+
+struct STestCell
+    {
+    enum {EMagic = 0xb8aa3b29};
+
+    TUint32 iLength;
+    TUint32 iData[1];
+
+    void Set(TInt aLength);
+    void Verify(TInt aLength);
+    void Verify(const TAny* aInitPtr, TInt aInitLength, TInt aLength);
+    };
+
+void STestCell::Set(TInt aLength)
+    {
+    TInt i;
+    TUint32 x = (TUint32)this ^ (TUint32)aLength ^ (TUint32)EMagic;
+    if (aLength < (TInt) sizeof(iLength))
+        {
+        return;
+        }
+    iLength = x;
+    aLength /= sizeof(TUint32);
+    for (i=0; i<aLength-1; ++i)
+        {
+        x *= 69069;
+        x += 41;
+        iData[i] = x;
+        }
+    }
+
+void STestCell::Verify(TInt aLength)
+    {
+    Verify(this, aLength, aLength);
+    }
+
+void STestCell::Verify(const TAny* aInitPtr, TInt aInitLength, TInt aLength)
+    {
+    TInt i;
+    TUint32 x = (TUint32)aInitPtr ^ (TUint32)aInitLength ^ (TUint32)EMagic;
+    if (aLength < (TInt) sizeof(iLength))
+        {
+        return;
+        }
+    test(iLength == x);
+    aLength /= sizeof(TUint32);
+    for (i=0; i<aLength-1; ++i)
+        {
+        x *= 69069;
+        x += 41;
+        test(iData[i] == x);
+        }
+    }
+
+class RTestHeap : public RHeap
+    {
+public:
+    TInt CheckAllocatedCell(const TAny* aCell) const;
+    void FullCheckAllocatedCell(const TAny* aCell) const;
+    TAny* TestAlloc(TInt aSize);
+    void TestFree(TAny* aPtr);
+    TAny* TestReAlloc(TAny* aPtr, TInt aSize, TInt aMode=0);
+    void FullCheck();
+    static void WalkFullCheckCell(TAny* aPtr, TCellType aType, TAny* aCell, TInt aLen);
+    };
+
+TInt RTestHeap::CheckAllocatedCell(const TAny* aCell) const
+    {
+    TInt len = AllocLen(aCell);
+    return len;
+    }
+
+void RTestHeap::FullCheckAllocatedCell(const TAny* aCell) const
+    {
+    ((STestCell*)aCell)->Verify(CheckAllocatedCell(aCell));
+    }
+
+TAny* RTestHeap::TestAlloc(TInt aSize)
+    {
+    TAny* p = Alloc(aSize);
+    if (p)
+        {
+        TInt len = CheckAllocatedCell(p);
+        test(len>=aSize);       
+        ((STestCell*)p)->Set(len);
+        }
+    return p;
+    }
+
+void RTestHeap::TestFree(TAny* aPtr)
+    {
+    if (aPtr)
+        {
+        FullCheckAllocatedCell(aPtr);
+        }
+    Free(aPtr);
+    }
+
+TAny* RTestHeap::TestReAlloc(TAny* aPtr, TInt aSize, TInt aMode)
+    {
+    TInt old_len = aPtr ? CheckAllocatedCell(aPtr) : 0;
+    if (aPtr)
+        ((STestCell*)aPtr)->Verify(old_len);
+    TAny* p = ReAlloc(aPtr, aSize, aMode);
+    if (!p)
+        {
+        ((STestCell*)aPtr)->Verify(old_len);
+        return p;
+        }
+    TInt new_len = CheckAllocatedCell(p);
+    test(new_len>=aSize);       
+    if (p == aPtr)
+        {
+        ((STestCell*)p)->Verify(p, old_len, Min(old_len, new_len));
+        if (new_len != old_len)
+            ((STestCell*)p)->Set(new_len);
+        return p;
+        }
+    test(!(aMode & ENeverMove));
+    test((new_len > old_len) || (aMode & EAllowMoveOnShrink));
+    if (old_len)
+        ((STestCell*)p)->Verify(aPtr, old_len, Min(old_len, aSize));
+    ((STestCell*)p)->Set(new_len);
+    return p;
+    }
+
+struct SHeapCellInfo
+    {
+    RTestHeap* iHeap;
+    TInt iTotalAlloc;
+    TInt iTotalAllocSize;
+    TInt iTotalFree;
+    TUint8* iNextCell;
+    };
+
+void RTestHeap::WalkFullCheckCell(TAny* aPtr, TCellType aType, TAny* aCell, TInt aLen)
+    {
+    (void)aCell;
+    ::SHeapCellInfo& info = *(::SHeapCellInfo*)aPtr;
+    switch(aType)
+        {
+        case EGoodAllocatedCell:
+            {
+            TInt len = aLen;
+            info.iTotalAllocSize += len;
+            STestCell* pT = (STestCell*)aCell;
+            ++info.iTotalAlloc;
+            pT->Verify(len);
+            break;
+            }
+        case EGoodFreeCell:
+            {
+            ++info.iTotalFree;
+            break;
+            }
+        default:
+            test.Printf(_L("TYPE=%d ??\n"),aType);
+            test(0);
+            break;
+        }
+    }
+
+void RTestHeap::FullCheck()
+    {
+    ::SHeapCellInfo info;
+    Mem::FillZ(&info, sizeof(info));
+    info.iHeap = this;
+    DebugFunction(EWalk, (TAny*)&WalkFullCheckCell, &info);
+    TInt count = AllocSize(iTotalAllocSize);
+    test(info.iTotalAlloc == count);
+    test(info.iTotalAllocSize == iTotalAllocSize);
+    }
+
+
+struct STestStress
+    {
+    RThread iThread;
+    volatile TBool iStop;
+    TInt iAllocs;
+    TInt iFailedAllocs;
+    TInt iFrees;
+    TInt iReAllocs;
+    TInt iFailedReAllocs;
+    TInt iChecks;
+    TUint32 iSeed;
+    RAllocator* iAllocator;
+    TInt iThreadIndex;
+
+    TUint32 Random();
+    };
+
+TUint32 FirstSeed(TInt aThreadIndex)
+    {
+    static TUint32 seed0 = 0xb504f334;
+    static TUint32 seed1 = 0xddb3d743;
+    static TBool first = ETrue;
+
+    TUint32 ret;
+
+    if (aThreadIndex == 0)
+        {
+        ret = seed0;
+        }
+    else
+        {
+        ret = seed1;
+        }
+    
+    if (first)
+        {
+        first = EFalse;
+        }
+    
+    if (aThreadIndex == 0)
+        {
+        seed0 *= 69069;
+        seed0 += 41;
+        }
+    else
+        {
+        seed1 *= 69069;
+        seed1 += 41;
+        }
+
+    test.Printf(_L("FirstSeed: 0x%08x\n"), ret);
+    return ret;
+    }
+
+TUint32 STestStress::Random()
+    {
+    iSeed *= 69069;
+    iSeed += 41;
+    return iSeed;
+    }
+
+TInt RandomLength(TUint32 aRandom)
+    {
+    TUint32 ret = 0;
+    
+    if (TestHybridHeapFunc == ETstOnlySlab)
+        {
+        test(SlabThreshold != 0);
+        ret = aRandom;
+        TInt realSlabThreshold = SlabThreshold;
+#ifdef _DEBUG
+        realSlabThreshold -= RHeap::EDebugHdrSize;
+#endif
+        ret %= realSlabThreshold;
+        }
+    else if (TestHybridHeapFunc == ETstOnlyDl)
+        {
+        TUint8 x = (TUint8)aRandom;
+        if (x & 0x80)
+            {
+            ret = x & 0x7f;
+            }
+        else
+            {
+            ret = (x & 0x7f) << 7;
+            }
+        }
+    else if (TestHybridHeapFunc == ETstOnlyPaged)
+        {
+        ret = RandomPagedLength(aRandom);
+        }
+    else if (TestHybridHeapFunc == ETstHybrid)
+        {
+        TUint8 x = (TUint8)aRandom;
+        if (x & 0x80)
+            {
+            ret = x & 0x7f;
+            }
+        else
+            {
+            if (x & 0x10)
+                {
+                ret = (x & 0x7f) << 7;
+                }
+            else
+                {
+                ret = RandomPagedLength(aRandom);
+                }
+            }
+        }
+    else
+        {
+        test(0);
+        }
+
+    return (TInt)ret;
+    }
+
+TInt HeapStress(TAny* aPtr)
+    {
+    STestStress& stress = *(STestStress*)aPtr;
+    RTestHeap* heap = (RTestHeap*)&User::Allocator();
+    TUint8** cell;
+    TInt* len;
+
+    if (stress.iThreadIndex >= MAX_THREAD_COUNT)
+        {
+        test(0);
+        }
+    cell = &HeapStressCell[stress.iThreadIndex][0];
+    len = &HeapStressLen[stress.iThreadIndex][0];
+
+    Mem::FillZ(cell, sizeof(*cell)*CurrMaxCellCount);
+    Mem::FillZ(len, sizeof(*len)*CurrMaxCellCount);
+
+    RThread::Rendezvous(KErrNone);
+    while (!stress.iStop)
+        {
+        // allocate all cells
+        TInt i;
+        for (i=0; i<CurrMaxCellCount; ++i)
+            {
+            if (!cell[i])
+                {
+                ++stress.iAllocs;
+                cell[i] = (TUint8*)heap->TestAlloc(RandomLength(stress.Random()));
+                if (cell[i])
+                    len[i] = heap->AllocLen(cell[i]);
+                else
+                    ++stress.iFailedAllocs;
+                }
+            }
+
+        // free some cells
+        TInt n = (CurrMaxCellCount/4) + (stress.Random() & (CurrMaxCellCount/2-1));
+        while (--n)
+            {
+            i = stress.Random() & (CurrMaxCellCount-1);
+            if (cell[i])
+                {
+                test(heap->AllocLen(cell[i]) == len[i]);
+                heap->TestFree(cell[i]);
+                cell[i] = NULL;
+                len[i] = 0;
+                ++stress.iFrees;
+                }
+            }
+
+        // realloc some cells
+        n = (CurrMaxCellCount/4) + (stress.Random() & (CurrMaxCellCount/2-1));
+        while (--n)
+            {
+            TUint32 rn = stress.Random();
+            i = (rn >> 8) & (CurrMaxCellCount-1);
+            TInt new_len = RandomLength(rn);
+            if (cell[i])
+                {
+                test(heap->AllocLen(cell[i]) == len[i]);
+                ++stress.iReAllocs;
+                TUint8* p = (TUint8*)heap->TestReAlloc(cell[i], new_len, rn >> 16);
+                if (p)
+                    {
+                    cell[i] = p;
+                    len[i] = heap->AllocLen(p);
+                    }
+                else
+                    {
+                    ++stress.iFailedReAllocs;
+                    }
+                }
+            }
+                
+        // check the heap
+        heap->Check();
+        ++stress.iChecks;
+        }
+    
+    return 0;
+    }
+
+void PrintSummary(STestStress& aStress)
+    {
+    test.Printf(_L("Total Allocs    : %11d\n"), aStress.iAllocs);
+    test.Printf(_L("Failed Allocs   : %11d\n"), aStress.iFailedAllocs);
+    test.Printf(_L("Total Frees     : %11d\n"), aStress.iFrees);
+    test.Printf(_L("Total ReAllocs  : %11d\n"), aStress.iReAllocs);
+    test.Printf(_L("Failed ReAllocs : %11d\n"), aStress.iFailedReAllocs);
+    test.Printf(_L("Heap checks     : %11d\n"), aStress.iChecks);
+    }
+    
+void CreateStressThread(STestStress& aStress)
+    {
+    RThread& thread = aStress.iThread;
+    TInt err = thread.Create(KNullDesC(), &HeapStress, 0x2000, aStress.iAllocator, &aStress);
+    test(err==KErrNone);
+    thread.SetPriority(EPriorityLess);
+    TRequestStatus status;
+    thread.Rendezvous(status);
+    test(status == KRequestPending);
+    thread.Resume();
+    User::WaitForRequest(status);
+    test(status == KErrNone);
+    test(thread.ExitType() == EExitPending);
+    thread.SetPriority(EPriorityMuchLess);
+    }
+
+void StopStressThread(STestStress& aStress)
+    {
+    RThread& thread = aStress.iThread;
+    TRequestStatus status;
+    thread.Logon(status);
+    aStress.iStop = ETrue;
+    User::WaitForRequest(status);
+    const TDesC& exitCat = thread.ExitCategory();
+    TInt exitReason = thread.ExitReason();
+    TInt exitType = thread.ExitType();
+    test.Printf(_L("Exit type %d,%d,%S\n"), exitType, exitReason, &exitCat);
+    test(exitType == EExitKill);
+    test(exitReason == KErrNone);
+    test(status == KErrNone);
+    PrintSummary(aStress);
+    }
+
+void WaitForKey(STestStress* aStress1, STestStress* aStress2)
+{
+    TRequestStatus keyStatus;
+    CConsoleBase* console = test.Console();
+    console->Read(keyStatus);
+    
+    for (;;)
+        {
+        User::WaitForRequest(keyStatus);
+        if (keyStatus != KRequestPending)
+            {
+            test(keyStatus == KErrNone);
+            if (console->KeyCode() == EKeyEscape)
+                {
+                test.Printf(_L("Forever test aborted by user\n"));
+                break;
+                }
+            else if (console->KeyCode() == EKeySpace)
+                {
+                if (aStress1 != NULL)
+                    {
+                    PrintSummary(*aStress1);
+                    }
+                if (aStress2 != NULL)
+                    {
+                    PrintSummary(*aStress2);
+                    }
+                }
+            }
+        console->Read(keyStatus);
+        }
+}
+
+TBool WaitForTimeoutOrKey(STestStress* aStress1, STestStress* aStress2)
+{
+    TBool abortedByUser = EFalse;
+    RTimer timer;
+    TRequestStatus timerStatus;
+    TInt err = timer.CreateLocal();
+    test(err == KErrNone);
+    timer.After(timerStatus, TestTimeAsSeconds*1000000);
+    
+    TRequestStatus keyStatus;
+    CConsoleBase* console = test.Console();
+    console->Read(keyStatus);
+    
+    for (;;)
+        {
+        User::WaitForRequest(keyStatus, timerStatus);
+        if (keyStatus != KRequestPending)
+            {
+            test(keyStatus == KErrNone);
+            if (console->KeyCode() == EKeyEscape)
+                {
+                abortedByUser = ETrue;
+                timer.Cancel();
+                test.Printf(_L("Forever test aborted by user\n"));
+                break;
+                }
+            else if (console->KeyCode() == EKeySpace)
+                {
+                if (aStress1 != NULL)
+                    {
+                    PrintSummary(*aStress1);
+                    }
+                if (aStress2 != NULL)
+                    {
+                    PrintSummary(*aStress2);
+                    }
+                }
+            console->Read(keyStatus);
+            }
+        if (timerStatus != KRequestPending)
+            {
+            if (timerStatus != KErrNone)
+                {
+                test(0);
+                }
+            console->ReadCancel();
+            break;
+            }
+        }
+    timer.Close();
+    return abortedByUser;
+}
+    
+TBool DoStressTest1(RAllocator* aAllocator)
+    {
+    TBool abortedByUser = EFalse;
+    
+    RTestHeap* heap = (RTestHeap*)aAllocator;
+    //test.Printf(_L("Test Stress 1: max=0x%x\n"),  heap->MaxLength());
+    
+    STestStress stress;
+    Mem::FillZ(&stress, sizeof(STestStress));
+    stress.iAllocator = aAllocator;
+    stress.iThreadIndex = 0;
+    if (TestType == ETestForeverAll)
+        {
+        stress.iSeed = FirstSeed(stress.iThreadIndex);
+        }
+    else
+        {
+        stress.iSeed = 0xb504f334;;
+        }
+    
+    CreateStressThread(stress);
+    
+    if (TestType == ETestE32Test)
+        {
+        User::After(TestTimeAsSeconds*1000000);
+        }
+    else if (TestType == ETestForeverAll)
+        {
+        abortedByUser = WaitForTimeoutOrKey(&stress, NULL);
+        }
+    else if (TestType == ETestForeverOne)
+        {
+        WaitForKey(&stress, NULL);
+        abortedByUser = ETrue;
+        }
+    else
+        {
+        test(0);
+        }
+    
+    StopStressThread(stress);
+    CLOSE_AND_WAIT(stress.iThread);
+    heap->FullCheck();
+    return abortedByUser;
+    }
+
+TBool DoStressTest2(RAllocator* aAllocator)
+    {
+    TBool abortedByUser = EFalse;
+    
+    RTestHeap* heap = (RTestHeap*)aAllocator;
+    //test.Printf(_L("Test Stress 2: max=0x%x\n"),  heap->MaxLength());    
+    
+    STestStress stress1;
+    Mem::FillZ(&stress1, sizeof(STestStress));
+    stress1.iAllocator = aAllocator;
+    stress1.iThreadIndex = 0;
+    
+    STestStress stress2;
+    Mem::FillZ(&stress2, sizeof(STestStress));
+    stress2.iAllocator = aAllocator;
+    stress2.iThreadIndex = 1;
+    
+    if (TestType == ETestForeverAll)
+        {
+        stress1.iSeed = FirstSeed(stress1.iThreadIndex);
+        stress2.iSeed = FirstSeed(stress2.iThreadIndex);
+        }
+    else
+        {
+        stress1.iSeed = 0xb504f334;
+        stress2.iSeed = 0xddb3d743;
+        }
+    CreateStressThread(stress1);
+    CreateStressThread(stress2);
+
+    if (TestType == ETestE32Test)
+        {
+        User::After(2*TestTimeAsSeconds*1000000);
+        }
+    else if (TestType == ETestForeverAll)
+        {
+        abortedByUser = WaitForTimeoutOrKey(&stress1, &stress2);
+        }
+    else if (TestType == ETestForeverOne)
+        {
+        WaitForKey(&stress1, &stress2);
+        abortedByUser = ETrue;
+        }
+    else
+        {
+        test(0);
+        }
+    
+    StopStressThread(stress1);
+    StopStressThread(stress2);
+    CLOSE_AND_WAIT(stress1.iThread);
+    CLOSE_AND_WAIT(stress2.iThread);
+    heap->FullCheck();
+    return abortedByUser;
+    }
+
+TBool StressTests(void)
+    {
+    TBool abortedByUser = EFalse;
+    RHeap* heap = 0;
+    
+    for (;;)
+        {
+        if (TestType == ETestE32Test ||
+            TestType == ETestForeverAll)
+            {
+            heap = CreateTestHeap(4);
+            test(heap != NULL);
+            test.Next(_L("one thread, align 4"));
+            abortedByUser = DoStressTest1(heap);
+            if (abortedByUser)
+                {
+                break;
+                }
+            heap->Close();
+            
+            heap = CreateTestHeap(4);
+            test.Next(_L("two threads, align 4"));
+            abortedByUser = DoStressTest2(heap);
+            if (abortedByUser)
+                {
+                break;
+                }
+            heap->Close();
+                
+            heap = CreateTestHeap(8);
+            test(heap != NULL);
+            test.Next(_L("one thread, align 8"));
+            abortedByUser = DoStressTest1(heap);
+            if (abortedByUser)
+                {
+                break;
+                }
+            heap->Close();
+
+            heap = CreateTestHeap(8);
+            test.Next(_L("two threads, align 8"));
+            abortedByUser = DoStressTest2(heap);
+            }
+        else if (TestType == ETestForeverOne)
+            {
+            heap = CreateTestHeap(4);
+            test(heap != NULL);
+            if (TestForeverMultiThreadTest)
+                {
+                test.Next(_L("two threads, align 4"));
+                abortedByUser = DoStressTest2(heap);
+                }
+            else
+                {
+                test.Next(_L("one thread, align 4"));
+                abortedByUser = DoStressTest1(heap);
+                }
+            }
+        else
+            {
+            test(0);
+            }
+        break;
+        }
+    heap->Close();
+    
+    return abortedByUser;
+    }           
+
+        
+void ForeverOneTest(void)
+    {
+    //--------- config parameters - begin
+    TestForeverMultiThreadTest = ETrue; // EFalse
+    TestHybridHeapFunc = ETstOnlySlab; // ETstOnlySlab // ETstOnlyDl // ETstOnlyPaged // ETstHybrid
+    //--------- config parameters - end
+
+    if (TestHybridHeapFunc == ETstOnlySlab && !DlOnly)
+        {
+        // slab tests
+#ifdef __WINS__
+        test.Next(_L("slab test 48M"));
+        CurrMaxCellCount = 0x100000; //0x10000; 0x100000
+        HeapMaxLength = 0x3000000; // 48M
+#else
+        test.Next(_L("slab test 3M"));
+        CurrMaxCellCount = 0x10000; //0x10000; 0x100000
+        HeapMaxLength = 0x300000; // 3M
+#endif          
+        StressTests();
+        }
+    else if (TestHybridHeapFunc == ETstOnlyDl)
+        {
+        // DL tests
+        test.Next(_L("DL test 32M"));
+        CurrMaxCellCount = 0x1000; //0x10000;
+        HeapMaxLength = 0x2000000; // 32M
+        StressTests();
+        }
+    else if (TestHybridHeapFunc == ETstOnlyPaged && !DlOnly)
+        {
+        // paged tests
+        test.Next(_L("paged test 64M"));
+        CurrMaxCellCount = 0x100; //0x10000;
+        HeapMaxLength = 0x4000000; // 64M
+        StressTests();
+        }
+    else if (TestHybridHeapFunc == ETstHybrid && !DlOnly)
+        {
+        // hybrid tests
+        test.Next(_L("hybrid test 64M"));
+        CurrMaxCellCount = 0x1000; //0x10000;
+        HeapMaxLength = 0x4000000; // 64M
+        StressTests();
+        }
+    else
+        {
+        test(0);
+        }
+    }
+    
+void ForeverAllTests(void)
+    {
+    //--------- config parameters - begin
+    TInt basicTimeAsSeconds = 30; //10;
+    //--------- config parameters - end
+
+    for (;;)
+        {
+        if (!DlOnly)
+            {
+            // slab tests
+            TestHybridHeapFunc = ETstOnlySlab;
+            TestTimeAsSeconds = basicTimeAsSeconds * 3;
+#ifdef __WINS__
+            test.Next(_L("slab test 48M"));
+            CurrMaxCellCount = 0x100000; //0x10000; 0x100000
+            HeapMaxLength = 0x3000000; // 48M
+#else
+            test.Next(_L("slab test 3M"));
+            CurrMaxCellCount = 0x10000; //0x10000; 0x100000
+            HeapMaxLength = 0x300000; // 3M
+#endif          
+            if (StressTests())
+                {
+                break;
+                }
+            }
+        
+        // DL tests
+        TestHybridHeapFunc = ETstOnlyDl;
+        TestTimeAsSeconds = basicTimeAsSeconds;
+        
+        test.Next(_L("DL test 32M"));
+        CurrMaxCellCount = 0x1000; //0x10000;
+        HeapMaxLength = 0x2000000; // 32M
+        if (StressTests())
+            {
+            break;
+            }
+        
+        test.Next(_L("DL test 16M"));
+        CurrMaxCellCount = 0x1000; //0x10000;
+        HeapMaxLength = 0x1000000; // 16M
+        if (StressTests())
+            {
+            break;
+            }
+        
+        if (!DlOnly)
+            {
+            // paged tests
+            TestHybridHeapFunc = ETstOnlyPaged;
+            TestTimeAsSeconds = basicTimeAsSeconds;
+            
+            test.Next(_L("paged test 64M"));
+            CurrMaxCellCount = 0x100; //0x10000;
+            HeapMaxLength = 0x4000000; // 64M
+            if (StressTests())
+                {
+                break;
+                }
+            }
+        
+        if (!DlOnly)
+            {
+            // hybrid tests
+            TestHybridHeapFunc = ETstHybrid;
+            TestTimeAsSeconds = basicTimeAsSeconds * 2;
+            
+            test.Next(_L("hybrid test 64M"));
+            CurrMaxCellCount = 0x1000; //0x10000;
+            HeapMaxLength = 0x4000000; // 64M
+            if (StressTests())
+                {
+                break;
+                }
+            }
+        }
+    }
+    
+void TestUsedInE32Tests(void)
+    {
+    //--------- config parameters - begin
+    TInt basicTimeAsSeconds = 10;
+    //--------- config parameters - end
+
+    if (!DlOnly)
+        {
+        // slab tests
+        TestHybridHeapFunc = ETstOnlySlab;
+        TestTimeAsSeconds = basicTimeAsSeconds * 3;
+#ifdef __WINS__
+        test.Next(_L("slab test 48M"));
+        CurrMaxCellCount = 0x100000; //0x10000; 0x100000
+        HeapMaxLength = 0x3000000; // 48M
+#else
+        test.Next(_L("slab test 3M"));
+        CurrMaxCellCount = 0x10000; //0x10000; 0x100000
+        HeapMaxLength = 0x300000; // 3M
+#endif          
+        StressTests();
+        }
+    
+    // DL tests
+    TestHybridHeapFunc = ETstOnlyDl;
+    TestTimeAsSeconds = basicTimeAsSeconds;
+    
+    test.Next(_L("DL test 32M"));
+    CurrMaxCellCount = 0x1000; //0x10000;
+    HeapMaxLength = 0x2000000; // 32M
+    StressTests();
+    
+    test.Next(_L("DL test 16M"));
+    CurrMaxCellCount = 0x1000; //0x10000;
+    HeapMaxLength = 0x1000000; // 16M
+    StressTests();
+    
+    if (!DlOnly)
+        {
+        // paged tests
+        TestHybridHeapFunc = ETstOnlyPaged;
+        TestTimeAsSeconds = basicTimeAsSeconds;
+        
+        test.Next(_L("paged test 64M"));
+        CurrMaxCellCount = 0x100; //0x10000;
+        HeapMaxLength = 0x4000000; // 64M
+        StressTests();
+        }
+
+    if (!DlOnly)
+        {
+        // hybrid tests
+        TestHybridHeapFunc = ETstHybrid;
+        TestTimeAsSeconds = basicTimeAsSeconds * 2;
+        
+        test.Next(_L("hybrid test 64M"));
+        CurrMaxCellCount = 0x1000; //0x10000;
+        HeapMaxLength = 0x4000000; // 64M
+        StressTests();
+        }
+    }
+    
+TInt E32Main()
+    {
+    test.Title();
+    __KHEAP_MARK;
+    test.Start(_L("Testing heaps"));
+
+    TInt err = UserHal::TickPeriod(TickPeriod);
+    test(err == KErrNone);
+
+    DlOnly = IsDlOnly();
+    
+    TestType = ETestE32Test; //ETestE32Test // ETestForeverOne // ETestForeverAll
+    // see other config parameters: TestUsedInE32Tests()/ForeverOneTest()/ForeverAllTests()
+   
+    if (TestType == ETestE32Test)
+        {
+        TestUsedInE32Tests();
+        }
+    else if (TestType == ETestForeverOne)
+        {
+        ForeverOneTest();
+        }
+    else if (TestType == ETestForeverAll)
+        {
+        ForeverAllTests();
+        }
+    else
+        {
+        test(0);
+        }
+    
+    test.End();
+    __KHEAP_MARKEND;
+    return 0;
+    }
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/heap/t_kheap.cpp
--- a/kerneltest/e32test/heap/t_kheap.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/heap/t_kheap.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -54,7 +54,7 @@
 #include <f32dbg.h>
 #include "d_kheap.h"
 
-RTest test(_L("T_KHeap"));
+RTest test(_L("T_KHEAP"));
 RLoader LoaderSession;
 
 #ifdef _DEBUG
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/locl/t_lat1.cpp
--- a/kerneltest/e32test/locl/t_lat1.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/locl/t_lat1.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,7 +1,7 @@
 // Copyright (c) 1995-2009 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
-// under the terms of "Eclipse Public License v1.0"
+// under the terms of the License "Eclipse Public License v1.0"
 // which accompanies this distribution, and is available
 // at the URL "http://www.eclipse.org/legal/epl-v10.html".
 //
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/misc/d_TestKernCoreStats.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/misc/d_TestKernCoreStats.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,168 @@
+// Copyright (c) 2008-2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test\misc\d_kerncorestas.cpp
+// 
+//
+
+#include "d_TestKernCoreStats.h"
+
+#include <kernel/kernel.h>
+#include <kernel/kerncorestats.h>
+
+
+class DTestKernCoreStatsFactory : public DLogicalDevice
+        {
+public:
+        DTestKernCoreStatsFactory();
+        ~DTestKernCoreStatsFactory();
+        virtual TInt Install();
+        virtual void GetCaps(TDes8& aDes) const;
+        virtual TInt Create(DLogicalChannelBase*& aChannel);
+        };
+
+class DTestKernCoreStatsChannel : public DLogicalChannelBase
+        {
+public:
+        DTestKernCoreStatsChannel();
+        virtual ~DTestKernCoreStatsChannel();
+        TInt Request(TInt aFunction, TAny* a1, TAny* a2);
+        virtual TInt DoCreate(TInt aUnit, const TDesC8* anInfo, const TVersion&
+aVer);
+private:
+	TInt GetStats(TAny* aBuffer);
+	TInt Configure(TInt aMode);
+	TInt DumpInfo();
+private:
+	TInt iLength;
+        };
+
+
+DECLARE_STANDARD_LDD()
+        {
+        return new DTestKernCoreStatsFactory;
+        }
+
+DTestKernCoreStatsFactory::DTestKernCoreStatsFactory()
+        {
+        }
+
+DTestKernCoreStatsFactory::~DTestKernCoreStatsFactory()
+        {
+        }
+
+TInt DTestKernCoreStatsFactory::Install()
+        {
+        return SetName(&KTestKernCoreStatsName);
+        }
+
+
+void DTestKernCoreStatsFactory::GetCaps(TDes8&) const
+        {
+        }
+
+
+TInt DTestKernCoreStatsFactory::Create(DLogicalChannelBase*& aChannel)
+        {
+        aChannel=new DTestKernCoreStatsChannel();
+        if(!aChannel)
+                return KErrNoMemory;
+
+        return KErrNone;
+        }
+
+DTestKernCoreStatsChannel::DTestKernCoreStatsChannel()
+	{
+	}
+
+
+DTestKernCoreStatsChannel::~DTestKernCoreStatsChannel()
+	{
+	}
+
+TInt DTestKernCoreStatsChannel::DoCreate(TInt, const TDesC8*, const TVersion&)
+        {
+        return KErrNone;
+        }
+
+TInt DTestKernCoreStatsChannel::Request(TInt aFunction, TAny* a1, TAny*)
+        {
+        switch (aFunction)
+                {
+                case RTestKernCoreStats::ERequestGetStats:
+                        return GetStats( (TAny*) a1);
+                case RTestKernCoreStats::ERequestConfigure:
+                        return Configure( (TInt) a1);
+                case RTestKernCoreStats::ERequestDumpInfo:
+                        return DumpInfo();
+                default:
+                        return KErrNotSupported;
+                }
+        }
+
+
+TInt DTestKernCoreStatsChannel::GetStats(TAny* aBuffer)
+	{
+	NKern::ThreadEnterCS();
+	
+	if (iLength==0)
+		return KErrNone;
+	
+	TAny* tempBuff = Kern::Alloc(iLength);
+	if (!tempBuff)
+		{
+		NKern::ThreadLeaveCS();
+		return KErrNoMemory;
+		}
+
+	TInt r = KernCoreStats::Stats(tempBuff);
+
+
+	if (r==KErrNone)
+		kumemput(aBuffer, tempBuff, iLength);
+
+	Kern::Free(tempBuff);
+	NKern::ThreadLeaveCS();
+
+	return r;
+	}
+
+TInt DTestKernCoreStatsChannel::Configure(TInt aMode)
+	{
+
+	NKern::ThreadEnterCS();
+	TInt cores = NKern::NumberOfCpus();
+
+	TInt len = 0;
+	len+= (aMode & KStatsCoreTotalTimeInIdle)?		sizeof(TUint)*cores :0;
+	len+= (aMode & KStatsTimeCrossIdleAndActive)?		sizeof(TUint)*(cores+1) :0;
+	len+= (aMode & KStatsCoreNumTimesInIdle)?		sizeof(TUint)*cores :0;
+	len+= (aMode & KStatsNumEvents)?			sizeof(TUint) :0;
+	len+= (aMode & KStatsReadyStateChanges)?		sizeof(TUint)*2:0;
+	len+= (aMode & KStatsNumTimeSliceExpire)?		sizeof(TUint):0;
+
+	iLength=len;
+	Kern::Printf("KernCoreStats packet length = %d", len);
+	TInt r =  KernCoreStats::Configure(aMode);
+	NKern::ThreadLeaveCS();
+	return r;
+	}
+
+
+TInt DTestKernCoreStatsChannel::DumpInfo()
+	{
+
+	//KernCoreStats::Engage(0);
+
+	return iLength;
+	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/misc/d_TestKernCoreStats.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/misc/d_TestKernCoreStats.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,79 @@
+// Copyright (c) 2008-2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// e32test\misc\d_kerncorestas.h
+// 
+
+
+#ifndef D_TESTKERNCORESTATS
+#define D_TESTKERNCORESTATS
+
+
+#include <e32cmn.h>
+#include <e32ver.h>
+#ifndef __KERNEL_MODE__
+#include <e32std.h>
+#endif
+
+
+
+_LIT(KTestKernCoreStatsName,"TestKernCoreStats");
+
+
+
+class RTestKernCoreStats : public RBusLogicalChannel
+        {
+public:
+
+        enum TControl
+                {
+
+        ERequestGetStats,
+        ERequestConfigure,
+        ERequestDumpInfo
+                };
+public:
+        inline TInt Open();
+        inline TInt GetStats( TAny* a0);
+        inline TInt Configure( TInt a0);
+        inline TInt DumpInfo();
+
+        };
+
+#ifndef __KERNEL_MODE__
+
+inline TInt RTestKernCoreStats::Open()
+		{ return DoCreate(KTestKernCoreStatsName,TVersion(0,1,1),KNullUnit,NULL,NULL); }
+
+
+inline TInt RTestKernCoreStats::GetStats( TAny* a0)
+        { return DoControl(ERequestGetStats, (TAny*) a0); }
+
+inline TInt RTestKernCoreStats::Configure( TInt a0)
+        { return DoControl(ERequestConfigure, (TAny*) a0); }
+
+inline TInt RTestKernCoreStats::DumpInfo()
+        { return DoControl(ERequestDumpInfo,NULL); }
+
+
+
+
+#else
+
+#define DRIVER_NAME(x)
+#define DRIVER_REQUEST TInt
+
+#endif // __KERNEL_MODE__
+
+#endif
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/misc/d_testkerncorestats.cpp
--- a/kerneltest/e32test/misc/d_testkerncorestats.cpp	Mon May 24 18:45:46 2010 +0100
+++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
@@ -1,168 +0,0 @@
-// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
-// All rights reserved.
-// This component and the accompanying materials are made available
-// under the terms of "Eclipse Public License v1.0"
-// which accompanies this distribution, and is available
-// at the URL "http://www.eclipse.org/legal/epl-v10.html".
-//
-// Initial Contributors:
-// Nokia Corporation - initial contribution.
-//
-// Contributors:
-//
-// Description:
-// e32test\misc\d_kerncorestas.cpp
-// 
-//
-
-#include "d_TestKernCoreStats.h"
-
-#include <kernel/kernel.h>
-#include <kernel/kerncorestats.h>
-
-
-class DTestKernCoreStatsFactory : public DLogicalDevice
-        {
-public:
-        DTestKernCoreStatsFactory();
-        ~DTestKernCoreStatsFactory();
-        virtual TInt Install();
-        virtual void GetCaps(TDes8& aDes) const;
-        virtual TInt Create(DLogicalChannelBase*& aChannel);
-        };
-
-class DTestKernCoreStatsChannel : public DLogicalChannelBase
-        {
-public:
-        DTestKernCoreStatsChannel();
-        virtual ~DTestKernCoreStatsChannel();
-        TInt Request(TInt aFunction, TAny* a1, TAny* a2);
-        virtual TInt DoCreate(TInt aUnit, const TDesC8* anInfo, const TVersion&
-aVer);
-private:
-	TInt GetStats(TAny* aBuffer);
-	TInt Configure(TInt aMode);
-	TInt DumpInfo();
-private:
-	TInt iLength;
-        };
-
-
-DECLARE_STANDARD_LDD()
-        {
-        return new DTestKernCoreStatsFactory;
-        }
-
-DTestKernCoreStatsFactory::DTestKernCoreStatsFactory()
-        {
-        }
-
-DTestKernCoreStatsFactory::~DTestKernCoreStatsFactory()
-        {
-        }
-
-TInt DTestKernCoreStatsFactory::Install()
-        {
-        return SetName(&KTestKernCoreStatsName);
-        }
-
-
-void DTestKernCoreStatsFactory::GetCaps(TDes8&) const
-        {
-        }
-
-
-TInt DTestKernCoreStatsFactory::Create(DLogicalChannelBase*& aChannel)
-        {
-        aChannel=new DTestKernCoreStatsChannel();
-        if(!aChannel)
-                return KErrNoMemory;
-
-        return KErrNone;
-        }
-
-DTestKernCoreStatsChannel::DTestKernCoreStatsChannel()
-	{
-	}
-
-
-DTestKernCoreStatsChannel::~DTestKernCoreStatsChannel()
-	{
-	}
-
-TInt DTestKernCoreStatsChannel::DoCreate(TInt, const TDesC8*, const TVersion&)
-        {
-        return KErrNone;
-        }
-
-TInt DTestKernCoreStatsChannel::Request(TInt aFunction, TAny* a1, TAny*)
-        {
-        switch (aFunction)
-                {
-                case RTestKernCoreStats::ERequestGetStats:
-                        return GetStats( (TAny*) a1);
-                case RTestKernCoreStats::ERequestConfigure:
-                        return Configure( (TInt) a1);
-                case RTestKernCoreStats::ERequestDumpInfo:
-                        return DumpInfo();
-                default:
-                        return KErrNotSupported;
-                }
-        }
-
-
-TInt DTestKernCoreStatsChannel::GetStats(TAny* aBuffer)
-	{
-	NKern::ThreadEnterCS();
-	
-	if (iLength==0)
-		return KErrNone;
-	
-	TAny* tempBuff = Kern::Alloc(iLength);
-	if (!tempBuff)
-		{
-		NKern::ThreadLeaveCS();
-		return KErrNoMemory;
-		}
-
-	TInt r = KernCoreStats::Stats(tempBuff);
-
-
-	if (r==KErrNone)
-		kumemput(aBuffer, tempBuff, iLength);
-
-	Kern::Free(tempBuff);
-	NKern::ThreadLeaveCS();
-
-	return r;
-	}
-
-TInt DTestKernCoreStatsChannel::Configure(TInt aMode)
-	{
-
-	NKern::ThreadEnterCS();
-	TInt cores = NKern::NumberOfCpus();
-
-	TInt len = 0;
-	len+= (aMode & KStatsCoreTotalTimeInIdle)?		sizeof(TUint)*cores :0;
-	len+= (aMode & KStatsTimeCrossIdleAndActive)?		sizeof(TUint)*(cores+1) :0;
-	len+= (aMode & KStatsCoreNumTimesInIdle)?		sizeof(TUint)*cores :0;
-	len+= (aMode & KStatsNumEvents)?			sizeof(TUint) :0;
-	len+= (aMode & KStatsReadyStateChanges)?		sizeof(TUint)*2:0;
-	len+= (aMode & KStatsNumTimeSliceExpire)?		sizeof(TUint):0;
-
-	iLength=len;
-	Kern::Printf("KernCoreStats packet length = %d", len);
-	TInt r =  KernCoreStats::Configure(aMode);
-	NKern::ThreadLeaveCS();
-	return r;
-	}
-
-
-TInt DTestKernCoreStatsChannel::DumpInfo()
-	{
-
-	//KernCoreStats::Engage(0);
-
-	return iLength;
-	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/misc/d_testkerncorestats.h
--- a/kerneltest/e32test/misc/d_testkerncorestats.h	Mon May 24 18:45:46 2010 +0100
+++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
@@ -1,79 +0,0 @@
-// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
-// All rights reserved.
-// This component and the accompanying materials are made available
-// under the terms of "Eclipse Public License v1.0"
-// which accompanies this distribution, and is available
-// at the URL "http://www.eclipse.org/legal/epl-v10.html".
-//
-// Initial Contributors:
-// Nokia Corporation - initial contribution.
-//
-// Contributors:
-//
-// Description:
-// e32test\misc\d_kerncorestas.h
-// 
-
-
-#ifndef D_TESTKERNCORESTATS
-#define D_TESTKERNCORESTATS
-
-
-#include <e32cmn.h>
-#include <e32ver.h>
-#ifndef __KERNEL_MODE__
-#include <e32std.h>
-#endif
-
-
-
-_LIT(KTestKernCoreStatsName,"TestKernCoreStats");
-
-
-
-class RTestKernCoreStats : public RBusLogicalChannel
-        {
-public:
-
-        enum TControl
-                {
-
-        ERequestGetStats,
-        ERequestConfigure,
-        ERequestDumpInfo
-                };
-public:
-        inline TInt Open();
-        inline TInt GetStats( TAny* a0);
-        inline TInt Configure( TInt a0);
-        inline TInt DumpInfo();
-
-        };
-
-#ifndef __KERNEL_MODE__
-
-inline TInt RTestKernCoreStats::Open()
-		{ return DoCreate(KTestKernCoreStatsName,TVersion(0,1,1),KNullUnit,NULL,NULL); }
-
-
-inline TInt RTestKernCoreStats::GetStats( TAny* a0)
-        { return DoControl(ERequestGetStats, (TAny*) a0); }
-
-inline TInt RTestKernCoreStats::Configure( TInt a0)
-        { return DoControl(ERequestConfigure, (TAny*) a0); }
-
-inline TInt RTestKernCoreStats::DumpInfo()
-        { return DoControl(ERequestDumpInfo,NULL); }
-
-
-
-
-#else
-
-#define DRIVER_NAME(x)
-#define DRIVER_REQUEST TInt
-
-#endif // __KERNEL_MODE__
-
-#endif
-
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/misc/inflate.c
--- a/kerneltest/e32test/misc/inflate.c	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/misc/inflate.c	Thu Jun 10 11:48:01 2010 +0100
@@ -1,19 +1,3 @@
-/*
-* Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-* All rights reserved.
-* This component and the accompanying materials are made available
-* under the terms of "Eclipse Public License v1.0"
-* which accompanies this distribution, and is available
-* at the URL "http://www.eclipse.org/legal/epl-v10.html".
-*
-* Initial Contributors:
-* Nokia Corporation - initial contribution.
-*
-* Contributors:
-*
-* Description: 
-*
-*/
 /* inflate.c -- Not copyrighted 1992 by Mark Adler
    version c10p1, 10 January 1993 */
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/misc/t_cputime.cpp
--- a/kerneltest/e32test/misc/t_cputime.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/misc/t_cputime.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -228,32 +228,46 @@
 	test(s==KRequestPending);
 
 	TTimeIntervalMicroSeconds time, time2;
-	TUint us;
-	
-	// Test time is initially zero
+	TInt64 us;
+
+	// Test cpu time is initially zero
 	FailIfError(thread.GetCpuTime(time));
 	test(time == 0);
 
-	// Test not increased while waiting on semaphore
+	// Test cpu time is not increased while thread is waiting on semaphore
 	thread.Resume();
 	User::After(KShortWait);
-	FailIfError(thread.GetCpuTime(time));
-	us = I64LOW(time.Int64());
+	FailIfError(thread.GetCpuTime(time2));
+	us = time2.Int64();
 	test.Printf(_L("Time %dus\n"), us);
-	test(time < KTolerance); // wait happens in less than 0.5ms
+	test(us < KTolerance); // wait should happen in less than 1ms
 
-	// Test increases when thread allowed to run
+	// Test cpu time increases when thread allowed to run
+	// We want to allow 2% tolerance for the thread's CPU time, as there could be
+	// something else running on the system during that time which would result lower CPU time than the
+	// actual KShortPeriod or KLongPeriod wait time.
+	// Also User::After(t) might return within the range of <t, t + 1000000/64 + 2*NanoKarnelTickPeriod>.
+	// Given all that - we expect that the the cpu time should be within the range of:
+	// <t - 0.02*t, t + 15625 + 2*NanoKernelTickPeriod>
+	// or <0.98*t, t + 15625 + 2*NanoKernelTickPeriod>
+	TInt user_after_tolerance = 0;
+	HAL::Get(HAL::ENanoTickPeriod, user_after_tolerance);
+	user_after_tolerance += user_after_tolerance + 15625;
+
 	(threadParam.iSem).Signal();
 	User::After(KShortWait);
 	FailIfError(thread.GetCpuTime(time));
-	us = I64LOW(time.Int64());
+	us = time.Int64() - time2.Int64();
 	test.Printf(_L("Time %dus\n"), us);
-	test(time > (KShortWait - KTolerance));
+	test(100*us >= 98*KShortWait); // left limit
+	test(us - KShortWait <= user_after_tolerance); // right limit
+
 	User::After(KLongWait);
 	FailIfError(thread.GetCpuTime(time2));
-	us = I64LOW(time2.Int64());
+	us = time2.Int64() - time.Int64();
 	test.Printf(_L("Time %dus\n"), us);
-	test(time2.Int64() - time.Int64() > (KLongWait - KTolerance));
+	test(100*us >= 98*KLongWait); // left limit
+	test(us - KLongWait <= user_after_tolerance); // right limit
 
 	// Test not increased while suspended
 	thread.Suspend();
@@ -262,7 +276,7 @@
 	FailIfError(thread.GetCpuTime(time2));
 	test(time == time2);
 	thread.Resume();
-	
+
 	// Test not increased while dead
 	thread.Kill(KErrNone);
 	User::WaitForRequest(s);	// wait on undertaker since that completes in supervisor thread
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/misc/t_kerncorestats.cpp
--- a/kerneltest/e32test/misc/t_kerncorestats.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/misc/t_kerncorestats.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,7 +1,7 @@
-// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 2008-2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
-// under the terms of "Eclipse Public License v1.0"
+// under the terms of the License "Eclipse Public License v1.0"
 // which accompanies this distribution, and is available
 // at the URL "http://www.eclipse.org/legal/epl-v10.html".
 //
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/mmu/t_chunk.cpp
--- a/kerneltest/e32test/mmu/t_chunk.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/mmu/t_chunk.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -51,6 +51,7 @@
 #include <e32test.h>
 #include <e32panic.h>
 #include <e32svr.h>
+#include <hal.h>
 #include "mmudetect.h"
 #include "d_gobble.h"
 #include "freeram.h"
@@ -820,29 +821,31 @@
 	{
 	RGobbler gobbler;
 	TInt r = gobbler.Open();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TUint32 taken = gobbler.GobbleRAM(128*1024*1024);
 	test.Printf(_L("Gobbled: %dK\n"), taken/1024);
 	test.Printf(_L("Free RAM 0x%08X bytes\n"),FreeRam());
 
 	test.Next(_L("Create thread"));
 	r=NtfThrd.Create(KNotifierThreadName,NotifierThread,KDefaultStackSize,NULL,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	NtfThrd.SetPriority(EPriorityMore);
 	NtfThrd.Resume();
 	test.Next(_L("Check for initial notifier"));
 	CheckNotifierCount(1,1);
 	TInt free=FreeRam();
 	test.Printf(_L("Free RAM: %dK\n"),free/1024);
-	test(free>=1048576);
+	test_Value(free, free >= 1048576);
 	test.Next(_L("Set thresholds"));
 	r=UserSvr::SetMemoryThresholds(65536,524288);	// low=64K good=512K
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Next(_L("Create chunk"));
 	// Chunk must not be paged otherwise it will not effect the amount 
 	// of free ram reported plus on h4 swap size is less than the total ram.
+	TInt totalRam;
+	test_KErrNone(HAL::Get(HAL::EMemoryRAM, totalRam));
 	TChunkCreateInfo createInfo;
-	createInfo.SetNormal(0, free+2097152);
+	createInfo.SetNormal(0, totalRam);
 	createInfo.SetPaging(TChunkCreateInfo::EUnpaged);
 	RChunk c;
 	test_KErrNone(c.Create(createInfo));
@@ -858,31 +861,31 @@
 	TInt free3=free-(KBufferSpace-free2);	// this accounts for space used by page tables
 	test.Next(_L("Leave 32K"));
 	r=c.Adjust(free3-32768);		// leave 32K
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckNotifierCount(2,1);		// should get notifier
 	test.Next(_L("Leave 28K"));
 	r=c.Adjust(free3-28672);		// leave 28K
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckNotifierCount(2,1);		// shouldn't get another notifier
 	test.Next(_L("Ask for too much"));
-	r=c.Adjust(free3+4096);			// try to get more than available
-	test(r==KErrNoMemory);
+	r=c.Adjust(totalRam);			// try to get more than available
+	test_Equal(KErrNoMemory, r);
 	CheckNotifierCount(2,2);		// should get another notifier
 	test.Next(_L("Leave 128K"));
 	r=c.Adjust(free3-131072);		// leave 128K
-	test(r==KErrNone);
+	test_KErrNone(r);;
 	CheckNotifierCount(2,2);		// shouldn't get another notifier
 	test.Next(_L("Leave 640K"));
 	r=c.Adjust(free3-655360);		// leave 640K
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckNotifierCount(3,2);		// should get another notifier
 	test.Next(_L("Leave 1M"));
 	r=c.Adjust(free3-1048576);		// leave 1M
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckNotifierCount(3,2);		// shouldn't get another notifier
 	test.Next(_L("Ask for too much"));
-	r=c.Adjust(free3+4096);			// try to get more than available
-	test(r==KErrNoMemory);
+	r=c.Adjust(totalRam);			// try to get more than available
+	test_Equal(KErrNoMemory, r);
 
 	TInt notifierCount = 3;
 	if(MemModel==EMemModelTypeFlexible)
@@ -897,7 +900,7 @@
 	CheckNotifierCount(notifierCount,3);		// should get another notifier
 	test.Next(_L("Leave 1M"));
 	r=c.Adjust(free3-1048576);					// leave 1M
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckNotifierCount(notifierCount,3);		// shouldn't get another notifier
 
 	c.Close();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/mmu/t_sharedio.cpp
--- a/kerneltest/e32test/mmu/t_sharedio.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/mmu/t_sharedio.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -128,7 +128,6 @@
 #include <f32dbg.h>
 #include <e32def.h>
 #include <e32def_private.h>
-#include "freeram.h"
 
 LOCAL_D RTest test(_L("T_SHAREDIO"));
 
@@ -350,8 +349,6 @@
 	{
 	TInt failResult=KErrGeneral;
 
-	TInt freeRam = FreeRam(); //This will also add a delay
-
 	for(TInt failCount=1; failCount<1000; failCount++)
 		{
 		test.Printf(_L("alloc fail count = %d\n"),failCount);
@@ -369,10 +366,8 @@
 
 		test(failResult==KErrNoMemory);
 		__KHEAP_MARKEND;
+		}
 
-		test(freeRam == FreeRam());  //This will also add a delay
-		}
-	User::__DbgSetAllocFail(ETrue,RAllocator::ENone,0);
 	__KHEAP_RESET;
 
 	test.Next(_L("Destroy buffer"));
@@ -381,7 +376,7 @@
 	else
 		ldd.DestroyBuffer();
 	
-	test(freeRam == FreeRam());  //This will also add a delay
+	__KHEAP_MARKEND;
 	}
 
 GLDEF_C TInt E32Main()
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/mmu/t_shbuf.cpp
--- a/kerneltest/e32test/mmu/t_shbuf.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/mmu/t_shbuf.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -39,6 +39,8 @@
 
 const TInt* PtrBufSize;
 
+static TInt ThreadCounter = 0;
+
 RShBufTestChannel Ldd;
 
 _LIT(KTestSlave, "SLAVE");
@@ -1872,9 +1874,9 @@
  */
 void RequestLowSpacePanic(RShPool& aPool, TUint aThreshold1, TUint aThreshold2, TTestLowSpaceType aType, TInt aLine)
 	{
-	static TInt count = 0;
-	count++;
-	test.Printf(_L("RequestLowSpacePanic@%d(%d)\n"), aLine, count);
+	TBuf<40> threadname;
+	threadname.Format(_L("ThreadLowSpacePanic%d"), ++ThreadCounter);
+	test.Printf(_L("RequestLowSpacePanic@%d(%S)\n"), aLine, &threadname);
 	TBool jit = User::JustInTime();
 	User::SetJustInTime(EFalse);
 	TInt expectedpaniccode = KErrNone;	// Initialised to silence compiler warnings
@@ -1897,8 +1899,6 @@
 	RThread threadpanic;
 	TRequestStatus threadpanicrs;
 	TInt r;
-	TBuf<30> threadname;
-	threadname.Format(_L("ThreadLowSpacePanic%d"), count);
 	r = threadpanic.Create(threadname, ThreadLowSpacePanic, KDefaultStackSize, KMinHeapSize, 1 << 20, (TAny*) &targs);
 	test_KErrNone(r);
 	threadpanic.Logon(threadpanicrs);
@@ -1925,7 +1925,10 @@
 	test_KErrNone(r);
 	RThread thread;
 	TRequestStatus threadrs;
-	r = thread.Create(_L("ThreadNotifications"), ThreadNotifications, KDefaultStackSize, KMinHeapSize, 1 << 20, (TAny*) &aPool);
+	TBuf<40> threadname;
+	threadname.Format(_L("ThreadNotifications%d"), ++ThreadCounter);
+	test.Printf(_L("Create %S\n"), &threadname);
+	r = thread.Create(threadname, ThreadNotifications, KDefaultStackSize, KMinHeapSize, 1 << 20, (TAny*) &aPool);
 	test_KErrNone(r);
 	thread.SetPriority(EPriorityMore);
 	thread.Logon(threadrs);
@@ -2077,9 +2080,13 @@
 	RSemaphore sem;
 	r = sem.CreateGlobal(KTestLowSpaceSemaphore, 0);
 	test_KErrNone(r);
+
+	TBuf<40> threadname;
+	threadname.Format(_L("ThreadCancelNotifications%d"), ++ThreadCounter);
+	test.Printf(_L("Create %S\n"), &threadname);
 	RThread thread;
 	TRequestStatus threadrs;
-	r = thread.Create(_L("ThreadCancelNotifications"), ThreadNotifications, KDefaultStackSize, KMinHeapSize, 1 << 20, (TAny*) &aPool);
+	r = thread.Create(threadname, ThreadNotifications, KDefaultStackSize, KMinHeapSize, 1 << 20, (TAny*) &aPool);
 	test_KErrNone(r);
 	thread.SetPriority(EPriorityLess);
 	thread.Logon(threadrs);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/notifier/t_textnotifier.cpp
--- a/kerneltest/e32test/notifier/t_textnotifier.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/notifier/t_textnotifier.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -83,7 +83,16 @@
 	User::WaitForRequest(stat);
 	n.CancelNotifier(aUid);
 	test(stat==heapCellCount);
-	test(heapInfo1==heapInfo2);
+	
+	TInt size1, size2;
+	TLex8 lex(heapInfo1);
+	r = lex.Val(size1);
+	test(r==KErrNone);
+	lex.Assign(heapInfo2);
+	r = lex.Val(size2);
+	test(r==KErrNone);
+	//allocated size after should not be greater than before BUT may be less with new allocator
+	test(size2 <= size1); 
 
 	test.Next(_L("Close connection to notifier server"));
 	n.Close();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/pccd/t_medch.cpp
--- a/kerneltest/e32test/pccd/t_medch.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/pccd/t_medch.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -50,6 +50,9 @@
 
 const TInt KPowerUpTimeOut = 5000000; // Give the card 5 seconds to power up
 
+const TUint KDriveAttMask = KDriveAttLocal | KDriveAttRom | KDriveAttRemote;
+const TUint KMediaAttMask = KMediaAttVariableSize | KMediaAttDualDensity | KMediaAttLockable | KMediaAttLocked | KMediaAttHasPassword  | KMediaAttReadWhileWrite;
+
 LOCAL_D	RTest test(_L("Media change test"));
 
 LOCAL_D	TBusLocalDrive TheDrive;
@@ -57,6 +60,129 @@
 LOCAL_D TRequestStatus TheMediaStatus;
 LOCAL_D TBool TheChangedFlag;
 
+LOCAL_C TInt FindDataPagingDrive()
+/** 
+Find the drive containing the swap partition.
+
+@return		Local drive identifier or KErrNotFound if not found
+*/
+	{
+	TInt drive = KErrNotFound;
+	
+	RLocalDrive	d;
+	TBool change = EFalse;
+	TLocalDriveCapsV5 driveCaps;
+	TPckg<TLocalDriveCapsV5> capsPack(driveCaps);
+	
+	for(TInt i = 0; i < KMaxLocalDrives && drive < 0; ++i)
+		{
+		if(d.Connect(i, change) == KErrNone)
+			{
+			if(d.Caps(capsPack) == KErrNone)
+				{
+				if ((driveCaps.iMediaAtt & KMediaAttPageable) &&
+					(driveCaps.iPartitionType == KPartitionTypePagedData))
+					{
+					drive = i;
+					}
+				}
+			d.Close();
+			}
+		}
+		
+	if(drive == KErrNotFound)
+		{
+		test.Printf(_L("No data paging drive found\n"));
+		}
+		
+	return drive;
+	}
+	
+LOCAL_C TInt DataPagingMediaCaps(TLocalDriveCapsV5 &aCaps)
+/** 
+Return the caps of the media containing a swap partition.
+
+@return		Error code, on success aCaps contains the capabilities of the paging drive
+*/
+	{
+	TInt dataPagingDrive = FindDataPagingDrive();
+	
+	if (dataPagingDrive == KErrNotFound)
+		{
+		return KErrNotFound;
+		}
+
+	RLocalDrive	dpDrive;
+	TBool change = EFalse;
+
+	TInt r = dpDrive.Connect(dataPagingDrive, change);
+	test(r == KErrNone);
+	
+	TLocalDriveCapsV5 dpDriveCaps;
+	TPckg<TLocalDriveCapsV5> capsPack(dpDriveCaps);
+	r = dpDrive.Caps(capsPack);
+	test(r == KErrNone);
+	
+	if((dpDriveCaps.iDriveAtt & KDriveAttHidden) == 0)
+		{
+		test.Printf(_L("Paging partition is not hidden! Assuming it is correct anyway!\n"));
+		}
+	
+	aCaps = dpDriveCaps;
+	
+	return KErrNone;
+	}
+	
+LOCAL_C TBool IsDriveOnPagingMedia(TInt aDrive, TLocalDriveCapsV5 &aPagingMediaCaps)
+/** 
+Determines whether a drive is on the same media as the paging media by comparing 
+media characteristics
+
+@return		ETrue if (likely) to be on the same media, EFalse if not.
+*/	{
+	RLocalDrive	drive;
+	TBool change = EFalse;
+
+	TInt r = drive.Connect(aDrive, change);
+	test(r == KErrNone);
+	
+	TLocalDriveCapsV5 driveCaps;
+	TPckg<TLocalDriveCapsV5> capsPack(driveCaps);
+	r = drive.Caps(capsPack);
+	test(r == KErrNone);
+	
+	// Check media serial number
+	if(aPagingMediaCaps.iSerialNumLength > 0)
+		{
+		if((driveCaps.iSerialNumLength > 0) && 
+		   ((memcompare(driveCaps.iSerialNum, driveCaps.iSerialNumLength, 
+			aPagingMediaCaps.iSerialNum, aPagingMediaCaps.iSerialNumLength)) == 0))
+			{
+			// serial numbers equal, so drive in question is on same media as paging drive
+			test.Printf(_L("Based on serial number match, drive %d shares the same media as paging drive\n"), aDrive);
+			return ETrue;
+			}
+		}
+	else
+		{
+		// Turn off bits which may be different
+		aPagingMediaCaps.iDriveAtt &= KDriveAttMask;
+		aPagingMediaCaps.iMediaAtt &= KMediaAttMask;
+		driveCaps.iDriveAtt &= KDriveAttMask;
+		driveCaps.iMediaAtt &= KMediaAttMask;
+
+		if ((driveCaps.iType == aPagingMediaCaps.iType) &&
+			(driveCaps.iDriveAtt == aPagingMediaCaps.iDriveAtt) && 
+			(driveCaps.iMediaAtt == aPagingMediaCaps.iMediaAtt))
+			{
+			test.Printf(_L("Based on media characteristics match, drive %d shares the same media as paging drive\n"), aDrive);
+			return ETrue;
+			}
+		}
+		
+	return EFalse;
+	}
+
 
 LOCAL_C TBool SetupDrivesForPlatform(TInt& aDrive, TInt& aSocket)
 /**
@@ -75,11 +201,26 @@
 	aDrive  = -1;
 	aSocket = -1;
 	
+	TLocalDriveCapsV5 pagingMediaCaps;
+	TBool pagingMediaCheck = EFalse;
+	if(DataPagingMediaCaps(pagingMediaCaps) == KErrNone)
+		{
+		pagingMediaCheck = ETrue;
+		}
+	
 	for(aDrive=0; aDrive < di.iTotalSupportedDrives; aDrive++)
 		{
 		test.Printf(_L(" Drive %d - %S\r\n"), aDrive, &di.iDriveName[aDrive]);
 		if(di.iDriveName[aDrive].MatchF(_L("MultiMediaCard0")) == KErrNone)
-			break;
+			{
+			if(pagingMediaCheck)
+				{
+				if( ! IsDriveOnPagingMedia(aDrive, pagingMediaCaps))
+					{
+					break;
+					}
+				}
+			}
 		}
 
 	if(aDrive == di.iTotalSupportedDrives)
@@ -172,14 +313,14 @@
  */
 	{
 	test.Console()->SetPos(20, 25);
-	test.Printf(_L("%S [%d cycles]"), &aTitle, aCycles);
+	test.Printf(_L("%S [%d cycles]\n"), &aTitle, aCycles);
 #ifdef __MANUAL_TEST__
 	test.Console()->SetPos(20, 27);
-	test.Printf(_L("<press a key>"));
+	test.Printf(_L("<press a key>\n"));
 	test.Getch();
 #endif
 	}
-		
+
 GLDEF_C TInt E32Main()
 /**
  * Test Entry Point for T_MEDCH.
@@ -213,6 +354,7 @@
 	 */
 	TInt drive;
 	TInt socket;
+
 	if(SetupDrivesForPlatform(drive, socket))
 		{
 		b.Format(_L("Connect to local drive %d"), drive);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/rm_debug/basic_tests/t_rmdebug2.cpp
--- a/kerneltest/e32test/rm_debug/basic_tests/t_rmdebug2.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/rm_debug/basic_tests/t_rmdebug2.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -400,28 +400,49 @@
 	test(KErrNone == iServSession.AttachExecutable(iFileName, EFalse));
 	test(KErrNone == iServSession.SuspendThread(iThreadID));
 
-	//test getting the global list, ETrue as should find the target debug thread
-	DoTestGetThreadList(ETrue, EScopeGlobal);
-
-	//test getting this thread's thread list, ETrue as should find the target debug thread
-	DoTestGetThreadList(ETrue, EScopeThreadSpecific, RThread().Id().Id());
-
-	//test getting this process's thread list, ETrue as should find the target debug thread
-	DoTestGetThreadList(ETrue, EScopeProcessSpecific, RProcess().Id().Id());
+	TBool found = EFalse;
+	
+	/* We need these loops because on some system the kernel run mode debugger does not 
+	 immediately present the thread in the thread list. 
+	 */
+	
+	for(TInt retryCount = 0; retryCount < 10 && !found; retryCount++ )
+		{
+		//test getting this process's thread list, ETrue as should find the target debug thread
+		User::After(50000);
+		found = DoTestGetThreadList(ETrue, EScopeProcessSpecific, RProcess().Id().Id());
+		}
+	test( found );
+	found = EFalse;
+
+	for(TInt retryCount = 0; retryCount < 10 && !found; retryCount++ )
+		{
+		//test getting the global list, ETrue as should find the target debug thread
+		User::After(50000);
+		found = DoTestGetThreadList(ETrue, EScopeGlobal);
+		}
+	test( found );
+
+	found = EFalse;
+	for(TInt retryCount = 0; retryCount < 10 && !found; retryCount++ )
+		{
+		//test getting this thread's thread list, ETrue as should find the target debug thread
+		User::After(50000);
+		found = DoTestGetThreadList(ETrue, EScopeThreadSpecific, RThread().Id().Id());
+		}
+	test( found );
 
 	test(KErrNone == iServSession.ResumeThread(iThreadID));
 	test(KErrNone == iServSession.DetachExecutable(iFileName));
 	}
-
-void CRunModeAgent::DoTestGetThreadList(const TBool aShouldPass, const TListScope aListScope, const TUint64 aTargetId)
+			
+TBool CRunModeAgent::DoTestGetThreadList(const TBool aShouldPass, const TListScope aListScope, const TUint64 aTargetId)
 	{
-	test.Next(_L("DoTestGetThreadList\n"));
-
 	//create data to pass
 	RBuf8 buffer;
 	TUint32 size = 0;
 
-	//perform the call to get the Code segs
+	//perform the call to get the thread list
 	DoGetList(EThreads, aListScope, buffer, size, aTargetId);
 
 	//initialise data about the target debug thread to compare the kernel's data against
@@ -438,22 +459,22 @@
 		{
 		TThreadListEntry* entry = (TThreadListEntry*)ptr;
 		TPtr entryName(&(entry->iName[0]), entry->iNameLength, entry->iNameLength);
+
 		if( (threadId == entry->iThreadId) && (processId == entry->iProcessId) && (0 == name.CompareF(entryName)) )
 			{
 			test(entry->iSupervisorStackBaseValid);
 			test(entry->iSupervisorStackSizeValid);
 			//if all match then we've found it
 			found = ETrue;
+			break;
 			}
 
 		ptr += Align4(entry->GetSize());
 		}
 
-	//check whether the expected result happened
-	test(found == aShouldPass);
-
 	//clean up
 	buffer.Close();
+	return found;
 
 	}
 
@@ -582,6 +603,12 @@
 
 	}
 
+
+/**
+ * Get a list from the run mode debug system. Most list calls will initially return KErrTooBig, 
+ * since the initial size of the buffer is 0. However it is sometimes valid for a list to be empty
+ * given its filtering and scope. These calls should return KErrNone.
+ */
 void CRunModeAgent::DoGetList(const TListId aListId, const TListScope aListScope, RBuf8& aBuffer, TUint32& aSize, const TUint64 aTargetId)
 	{
 	//close the buffer in case there's stuff allocated in it
@@ -589,19 +616,20 @@
 	//initialise it to be one byte big, which will guarantee data won't fit in it
 	test(KErrNone == aBuffer.Create(1));
 	aSize = 0;
-
+	
+	TInt ret = KErrNone;
 	//should pass this test (assuming we've passed in sensible arguments above...)
 	if(EScopeGlobal == aListScope)
 		{
-		test(KErrTooBig == iServSession.GetList(aListId, aBuffer, aSize));
+		ret = iServSession.GetList(aListId, aBuffer, aSize);
 		}
 	else if(EScopeThreadSpecific == aListScope)
 		{
-		test(KErrTooBig == iServSession.GetList((TThreadId)aTargetId, aListId, aBuffer, aSize));
+		ret = iServSession.GetList((TThreadId)aTargetId, aListId, aBuffer, aSize);
 		}
 	else if(EScopeProcessSpecific == aListScope)
 		{
-		test(KErrTooBig == iServSession.GetList((TProcessId)aTargetId, aListId, aBuffer, aSize));
+		ret = iServSession.GetList((TProcessId)aTargetId, aListId, aBuffer, aSize);
 		}
 	else
 		{
@@ -609,6 +637,17 @@
 		test(0);
 		}
 
+	if( KErrNone == ret )
+		{
+		/* In the case that there is no data, just return and let the caller check
+		the buffer. It is valid for a caller to not expect any data to be returned.
+		*/
+		return;
+		}
+	
+	// The only other allowed return is KErrTooBig
+	test( ret == KErrTooBig );
+
 	//keep allocating larger buffers, beginning with the aSize returned by the above call,
 	//and hopefully we'll eventually make a large enough one
 	test(KErrNone == aBuffer.ReAlloc(aSize));
@@ -2727,9 +2766,9 @@
 			/* Wait a little while and try again, just in case the process is still being removed.
 			This can happen on a very busy system or when a popup for the events is still active
 			*/
-			RDebug::Printf("CRunModeAgent::TestEventsWithExtraThreads. ProcessExists(id=%d), waiting for it to exit %d", 
+			RDebug::Printf("CRunModeAgent::TestEventsWithExtraThreads. ProcessExists(id=%d), waiting count exit=%d", 
 				I64LOW(processId), waitCount);
-			User::After(500);
+			User::After(50000);
 			}
 		test(!ProcessExists(processId));
 		}
@@ -2738,34 +2777,37 @@
 // helper function to check whether a thread with id aThreadId exists in the process with id aProcessId
 TBool CRunModeAgent::ThreadExistsForProcess(const TThreadId aThreadId, const TProcessId aProcessId)
 	{
-	TUint32 size;
-	RBuf8 buffer;
-	test(KErrNone == buffer.Create(1024));
-	TInt err = iServSession.GetList(aProcessId, EThreads, buffer, size);
-	while(KErrTooBig == err)
+	RThread lThread;
+	TInt ret = lThread.Open( aThreadId.Id() );
+
+	if( ret != KErrNone )
 		{
-		size*=2;
-		test(size<=16*1024);
-		test(KErrNone == buffer.ReAlloc(size));
-		err = iServSession.GetList(aProcessId, EThreads, buffer, size);
+		RDebug::Printf("ThreadExistsForProcess: thread id=%d opening returned %d",
+			I64LOW( aThreadId.Id() ), ret );
+		lThread.Close();
+		return EFalse;
 		}
-	test(KErrNone == err);
-
-	//look through the buffer and check if the target debug thread is there
-	TUint8* ptr = (TUint8*)buffer.Ptr();
-	const TUint8* ptrEnd = ptr + size;
-	while(ptr < ptrEnd)
+
+	RProcess lProcess;
+	ret = lThread.Process( lProcess );
+
+	lThread.Close();
+
+	if( ret != KErrNone )
 		{
-		TThreadListEntry& entry = *(TThreadListEntry*)ptr;
-		if(aThreadId.Id() == entry.iThreadId)
-			{
-			buffer.Close();
-			return ETrue;
-			}
-		ptr += Align4(entry.GetSize());
+		RDebug::Printf("ThreadExistsForProcess: proc opening returned %d", ret );
+		ret = KErrNotFound;
 		}
-	buffer.Close();
-	return EFalse;
+	else if( lProcess.Id() != aProcessId )
+		{
+		RDebug::Printf("ThreadExistsForProcess: lProcess.Id()(%d)!= aProcessId(%d)",
+				I64LOW(lProcess.Id().Id()), I64LOW(aProcessId.Id()));
+		ret = KErrNotFound;
+		}
+
+	lProcess.Close();
+	
+	return ( ret == KErrNone );
 	}
 
 // helper function to check whether a process with id aProcessId exists
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/rm_debug/basic_tests/t_rmdebug2.h
--- a/kerneltest/e32test/rm_debug/basic_tests/t_rmdebug2.h	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/rm_debug/basic_tests/t_rmdebug2.h	Thu Jun 10 11:48:01 2010 +0100
@@ -71,7 +71,7 @@
 	void TestGetXipLibrariesList();
 	void TestGetListInvalidData();
 
-	void DoTestGetThreadList(const TBool aShouldPass, const Debug::TListScope aListScope, const TUint64 aTargetId=0);
+	TBool DoTestGetThreadList(const TBool aShouldPass, const Debug::TListScope aListScope, const TUint64 aTargetId=0);
 	void DoTestGetCodeSegsList(const TBool aShouldPass, const Debug::TListScope aListScope, const TUint64 aTargetId=0);
 
 	void DoGetList(const Debug::TListId aListId, const Debug::TListScope aListScope, RBuf8& aBuffer, TUint32& aSize, const TUint64 aTargetId=0);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/rm_debug/common/t_target_launcher.cpp
--- a/kerneltest/e32test/rm_debug/common/t_target_launcher.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/rm_debug/common/t_target_launcher.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -192,6 +192,8 @@
            }
        }
 
+    launchMutex.Wait( 500000 );
+
     CleanupStack::PopAndDestroy( &launchMutex );
 
     if( commandLine )
@@ -202,6 +204,8 @@
 
 GLDEF_C TInt E32Main()
 	{
+	RProcess thisProcess;
+	thisProcess.Rendezvous(KErrNone);
 	RDebug::Printf( ">Launcher Process()" );
 
 	CTrapCleanup* trap = CTrapCleanup::New();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/rm_debug/debug_targets/t_rmdebug_app.cpp
--- a/kerneltest/e32test/rm_debug/debug_targets/t_rmdebug_app.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/rm_debug/debug_targets/t_rmdebug_app.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -352,6 +352,8 @@
 
 TInt E32Main()
 	{
+		
+	RDebug::Printf("t_rmdebug_app tid=%d,pid=%d", I64LOW(RThread().Id().Id()), I64LOW(RProcess().Id().Id()) ) ;
 	// setup heap checking and clean up trap
 	__UHEAP_MARK;
 	CTrapCleanup* cleanup=CTrapCleanup::New();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/rm_debug/multi_target_tests/t_multi_target.cpp
--- a/kerneltest/e32test/rm_debug/multi_target_tests/t_multi_target.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/rm_debug/multi_target_tests/t_multi_target.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -110,14 +110,16 @@
 // Performs each test in turn
 //
   {
+  test.Start(_L("ClientAppL"));
   TInt err = iServSession.Connect(securityServerVersion);
   if (err != KErrNone)
       {
       User::Panic(_L("Can't open server session"), err);
       }
-
+  SetupDebugServerL();
   LaunchTargetsInOrderL();
   RDebug::Printf( "returning from CMultiTargetAgent::ClientAppL" );
+  test.End();
   }
 
 /**
@@ -158,7 +160,7 @@
 void CMultiTargetAgent::SetupDebugServerL()
     {
     RDebug::Printf( "CMultiTargetAgent::SetupDebugServerL" );
-
+    test.Next(_L("SetupDebugServerL\n"));
     iTargets.ReserveL( KNumApps );
 
     RBuf targetName;
@@ -235,8 +237,7 @@
     
     TBool thisLaunchCompleted; 
 
-    SetupDebugServerL();
-   
+    test.Next(_L("LaunchTargetsInOrderL\n"));
     for( TInt numLaunches = KNumLaunches; numLaunches > 0; numLaunches-- )
         {
         for( TInt numApps = KNumApps; numApps > 0; numApps-- )
@@ -362,17 +363,19 @@
             }
         }    
 
-        CleanupStack::PopAndDestroy( &launchSemaphore ); // launchSemaphore
-      
-        for( TInt i = iTargets.Count()-1; i>=0; i-- )
-            {
-            RDebug::Printf( "Closing target %d", i );
-            iTargets[ i ].Close();
-            }
+    launchSemaphore.Signal();
+    
+	CleanupStack::PopAndDestroy( &launchSemaphore ); // launchSemaphore
+  
+	for( TInt i = iTargets.Count()-1; i>=0; i-- )
+		{
+		RDebug::Printf( "Closing target %d", i );
+		iTargets[ i ].Close();
+		}
 
-        iTargets.Close();
-        
-        return KErrNone;
+	iTargets.Close();
+	
+	return KErrNone;
     }
 
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/system/t_mstim.cpp
--- a/kerneltest/e32test/system/t_mstim.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/system/t_mstim.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -84,7 +84,7 @@
 	TInt r=mstim.GetInfo(aId,info);
 	CHECK(r);
 	TEST(info.iCount==1);
-	return info.iMin/1000;
+	return (info.iMin+500)/1000;
 	}
 
 GLDEF_C TInt E32Main()
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/thread/t_thread.cpp
--- a/kerneltest/e32test/thread/t_thread.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/thread/t_thread.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -601,7 +601,8 @@
 		test(thread.ExitCategory()==_L("panic"));
 		test(thread.ExitReason()==123);
 		test(thread.ExitType()==EExitPanic);
-		CLOSE_AND_WAIT(thread);
+		r = RTest::CloseHandleAndWaitForDestruction(thread);
+		test_KErrNone(r);
 		}
 	
 	test.Next(_L("Internal exit"));
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/timestamp/d_timestamp.cpp
--- a/kerneltest/e32test/timestamp/d_timestamp.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/timestamp/d_timestamp.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,20 +1,18 @@
-/*
-* Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
-* All rights reserved.
-* This component and the accompanying materials are made available
-* under the terms of "Eclipse Public License v1.0"
-* which accompanies this distribution, and is available
-* at the URL "http://www.eclipse.org/legal/epl-v10.html".
-*
-* Initial Contributors:
-* Nokia Corporation - initial contribution.
-*
-* Contributors:
-*
-* Description: 
-*
-*/
-
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// d_timestamp.cpp
+//
 
 #include <kern_priv.h>
 #include <kernel.h>
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/timestamp/d_timestamp.h
--- a/kerneltest/e32test/timestamp/d_timestamp.h	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/timestamp/d_timestamp.h	Thu Jun 10 11:48:01 2010 +0100
@@ -1,20 +1,18 @@
-/*
-* Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
-* All rights reserved.
-* This component and the accompanying materials are made available
-* under the terms of "Eclipse Public License v1.0"
-* which accompanies this distribution, and is available
-* at the URL "http://www.eclipse.org/legal/epl-v10.html".
-*
-* Initial Contributors:
-* Nokia Corporation - initial contribution.
-*
-* Contributors:
-*
-* Description: 
-*
-*/
-
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// d_timestamp.h
+//
 
 
 #ifndef __TIMESTAMPTEST_H__
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/timestamp/d_timestamp_dev.h
--- a/kerneltest/e32test/timestamp/d_timestamp_dev.h	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/timestamp/d_timestamp_dev.h	Thu Jun 10 11:48:01 2010 +0100
@@ -1,20 +1,18 @@
-/*
-* Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
-* All rights reserved.
-* This component and the accompanying materials are made available
-* under the terms of "Eclipse Public License v1.0"
-* which accompanies this distribution, and is available
-* at the URL "http://www.eclipse.org/legal/epl-v10.html".
-*
-* Initial Contributors:
-* Nokia Corporation - initial contribution.
-*
-* Contributors:
-*
-* Description: 
-*
-*/
-
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// d_timestamp_dev.h
+//
 
 #ifndef __D_TIMERSTAMP_DEV_H__
 #define __D_TIMERSTAMP_DEV_H__
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/usb/t_usb_win/scripts/massstorage/bmwritelargefile.pl
--- a/kerneltest/e32test/usb/t_usb_win/scripts/massstorage/bmwritelargefile.pl	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/usb/t_usb_win/scripts/massstorage/bmwritelargefile.pl	Thu Jun 10 11:48:01 2010 +0100
@@ -2,7 +2,7 @@
 # Copyright (c) 2006-2009 Nokia Corporation and/or its subsidiary(-ies).
 # All rights reserved.
 # This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
+# under the terms of the License "Eclipse Public License v1.0"
 # which accompanies this distribution, and is available
 # at the URL "http://www.eclipse.org/legal/epl-v10.html".
 #
@@ -287,8 +287,4 @@
 free space for the file that is going to be created. The default size is 400
 MB.
 
-=head1 COPYRIGHT
-
-Copyright (c) 2006-2009 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.
-
 =cut
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/usb/t_usb_win/scripts/massstorage/bmwritemanyfiles.pl
--- a/kerneltest/e32test/usb/t_usb_win/scripts/massstorage/bmwritemanyfiles.pl	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/usb/t_usb_win/scripts/massstorage/bmwritemanyfiles.pl	Thu Jun 10 11:48:01 2010 +0100
@@ -2,7 +2,7 @@
 # Copyright (c) 2006-2009 Nokia Corporation and/or its subsidiary(-ies).
 # All rights reserved.
 # This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
+# under the terms of the License "Eclipse Public License v1.0"
 # which accompanies this distribution, and is available
 # at the URL "http://www.eclipse.org/legal/epl-v10.html".
 #
@@ -300,8 +300,4 @@
 free space for the file that is going to be created. The default size is 400
 MB.
 
-=head1 COPYRIGHT
-
-Copyright (c) 2006-2008 Symbian Software Ltd. All rights reserved. All rights reserved.
-
 =cut
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/usb/t_usb_win/scripts/massstorage/createfilesanddirs.pl
--- a/kerneltest/e32test/usb/t_usb_win/scripts/massstorage/createfilesanddirs.pl	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/usb/t_usb_win/scripts/massstorage/createfilesanddirs.pl	Thu Jun 10 11:48:01 2010 +0100
@@ -2,7 +2,7 @@
 # Copyright (c) 2004-2009 Nokia Corporation and/or its subsidiary(-ies).
 # All rights reserved.
 # This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
+# under the terms of the License "Eclipse Public License v1.0"
 # which accompanies this distribution, and is available
 # at the URL "http://www.eclipse.org/legal/epl-v10.html".
 #
@@ -397,8 +397,4 @@
  TestExpectedResults:  
 	Read data from files should match with written.
 
-=head1 COPYRIGHT
-
-Copyright (c) 2004-2009 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.
-
 =cut
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/usb/t_usb_win/scripts/massstorage/createlargefile.pl
--- a/kerneltest/e32test/usb/t_usb_win/scripts/massstorage/createlargefile.pl	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32test/usb/t_usb_win/scripts/massstorage/createlargefile.pl	Thu Jun 10 11:48:01 2010 +0100
@@ -2,7 +2,7 @@
 # Copyright (c) 2004-2009 Nokia Corporation and/or its subsidiary(-ies).
 # All rights reserved.
 # This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
+# under the terms of the License "Eclipse Public License v1.0"
 # which accompanies this distribution, and is available
 # at the URL "http://www.eclipse.org/legal/epl-v10.html".
 #
@@ -248,8 +248,4 @@
  with written.  Sum of file size and free space should be close to
  drive size.
 
-=head1 COPYRIGHT
-
-Copyright (c) 2004-2009 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.
-
 =cut
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/usbho/t_otgdi/Bld.inf
--- a/kerneltest/e32test/usbho/t_otgdi/Bld.inf	Mon May 24 18:45:46 2010 +0100
+++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
@@ -1,39 +0,0 @@
-// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
-// All rights reserved.
-// This component and the accompanying materials are made available
-// under the terms of the License "Eclipse Public License v1.0"
-// which accompanies this distribution, and is available
-// at the URL "http://www.eclipse.org/legal/epl-v10.html".
-//
-// Initial Contributors:
-// Nokia Corporation - initial contribution.
-//
-// Contributors:
-//
-// Description:
-// t_usbotg/bld.inf
-// Test code for usb OTG component
-// 
-//
-
-/**
- @file
-*/
-
-PRJ_PLATFORMS
-armv5
-
-PRJ_TESTEXPORTS
-scripts/b2bm.bat     				/epoc32/rom/e32test/usbho/t_otgdi/b2bm.bat
-scripts/b2bs.bat     				/epoc32/rom/e32test/usbho/t_otgdi/b2bs.bat
-scripts/oet.bat     				/epoc32/rom/e32test/usbho/t_otgdi/oet.bat
-scripts/opta.bat     				/epoc32/rom/e32test/usbho/t_otgdi/opta.bat
-scripts/optb.bat     				/epoc32/rom/e32test/usbho/t_otgdi/optb.bat
-
-PRJ_MMPFILES
-
-PRJ_TESTMMPFILES
-#if defined(SYMBIAN_ENABLE_USB_OTG_HOST)
-group/t_otgdi.mmp
-group/t_otgdi_fdfactor.mmp
-#endif
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32test/usbho/t_otgdi/bld.inf
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32test/usbho/t_otgdi/bld.inf	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,39 @@
+// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// t_usbotg/bld.inf
+// Test code for usb OTG component
+// 
+//
+
+/**
+ @file
+*/
+
+PRJ_PLATFORMS
+armv5
+
+PRJ_TESTEXPORTS
+scripts/b2bm.bat     				/epoc32/rom/e32test/usbho/t_otgdi/b2bm.bat
+scripts/b2bs.bat     				/epoc32/rom/e32test/usbho/t_otgdi/b2bs.bat
+scripts/oet.bat     				/epoc32/rom/e32test/usbho/t_otgdi/oet.bat
+scripts/opta.bat     				/epoc32/rom/e32test/usbho/t_otgdi/opta.bat
+scripts/optb.bat     				/epoc32/rom/e32test/usbho/t_otgdi/optb.bat
+
+PRJ_MMPFILES
+
+PRJ_TESTMMPFILES
+#if defined(SYMBIAN_ENABLE_USB_OTG_HOST)
+group/t_otgdi.mmp
+group/t_otgdi_fdfactor.mmp
+#endif
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/analyse/profiler.rtf
--- a/kerneltest/e32utils/analyse/profiler.rtf	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/e32utils/analyse/profiler.rtf	Thu Jun 10 11:48:01 2010 +0100
@@ -1,3017 +1,3017 @@
-{\rtf1\ansi\ansicpg1252\uc1\deff0\stshfdbch0\stshfloch0\stshfhich0\stshfbi0\deflang2057\deflangfe2057{\fonttbl{\f0\froman\fcharset0\fprq2{\*\panose 02020603050405020304}Times New Roman;}{\f1\fswiss\fcharset0\fprq2{\*\panose 020b0604020202020204}Arial;}
-{\f2\fmodern\fcharset0\fprq1{\*\panose 02070309020205020404}Courier New;}{\f3\froman\fcharset2\fprq2{\*\panose 05050102010706020507}Symbol;}{\f10\fnil\fcharset2\fprq2{\*\panose 05000000000000000000}Wingdings;}
-{\f35\fswiss\fcharset0\fprq2{\*\panose 020b0604030504040204}Tahoma;}{\f36\fmodern\fcharset0\fprq1{\*\panose 020b0609040504020204}Lucida Console;}{\f37\froman\fcharset238\fprq2 Times New Roman CE;}{\f38\froman\fcharset204\fprq2 Times New Roman Cyr;}
-{\f40\froman\fcharset161\fprq2 Times New Roman Greek;}{\f41\froman\fcharset162\fprq2 Times New Roman Tur;}{\f42\froman\fcharset177\fprq2 Times New Roman (Hebrew);}{\f43\froman\fcharset178\fprq2 Times New Roman (Arabic);}
-{\f44\froman\fcharset186\fprq2 Times New Roman Baltic;}{\f45\froman\fcharset163\fprq2 Times New Roman (Vietnamese);}{\f47\fswiss\fcharset238\fprq2 Arial CE;}{\f48\fswiss\fcharset204\fprq2 Arial Cyr;}{\f50\fswiss\fcharset161\fprq2 Arial Greek;}
-{\f51\fswiss\fcharset162\fprq2 Arial Tur;}{\f52\fswiss\fcharset177\fprq2 Arial (Hebrew);}{\f53\fswiss\fcharset178\fprq2 Arial (Arabic);}{\f54\fswiss\fcharset186\fprq2 Arial Baltic;}{\f55\fswiss\fcharset163\fprq2 Arial (Vietnamese);}
-{\f57\fmodern\fcharset238\fprq1 Courier New CE;}{\f58\fmodern\fcharset204\fprq1 Courier New Cyr;}{\f60\fmodern\fcharset161\fprq1 Courier New Greek;}{\f61\fmodern\fcharset162\fprq1 Courier New Tur;}{\f62\fmodern\fcharset177\fprq1 Courier New (Hebrew);}
-{\f63\fmodern\fcharset178\fprq1 Courier New (Arabic);}{\f64\fmodern\fcharset186\fprq1 Courier New Baltic;}{\f65\fmodern\fcharset163\fprq1 Courier New (Vietnamese);}{\f387\fswiss\fcharset238\fprq2 Tahoma CE;}{\f388\fswiss\fcharset204\fprq2 Tahoma Cyr;}
-{\f390\fswiss\fcharset161\fprq2 Tahoma Greek;}{\f391\fswiss\fcharset162\fprq2 Tahoma Tur;}{\f392\fswiss\fcharset177\fprq2 Tahoma (Hebrew);}{\f393\fswiss\fcharset178\fprq2 Tahoma (Arabic);}{\f394\fswiss\fcharset186\fprq2 Tahoma Baltic;}
-{\f395\fswiss\fcharset163\fprq2 Tahoma (Vietnamese);}{\f396\fswiss\fcharset222\fprq2 Tahoma (Thai);}{\f397\fmodern\fcharset238\fprq1 Lucida Console CE;}{\f398\fmodern\fcharset204\fprq1 Lucida Console Cyr;}
-{\f400\fmodern\fcharset161\fprq1 Lucida Console Greek;}{\f401\fmodern\fcharset162\fprq1 Lucida Console Tur;}}{\colortbl;\red0\green0\blue0;\red0\green0\blue255;\red0\green255\blue255;\red0\green255\blue0;\red255\green0\blue255;\red255\green0\blue0;
-\red255\green255\blue0;\red255\green255\blue255;\red0\green0\blue128;\red0\green128\blue128;\red0\green128\blue0;\red128\green0\blue128;\red128\green0\blue0;\red128\green128\blue0;\red128\green128\blue128;\red192\green192\blue192;\red255\green255\blue255;
-}{\stylesheet{\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \snext0 Normal;}{\s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 
-\b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext0 heading 1;}{\s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 
-\b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext0 heading 2;}{\s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 
-\sbasedon0 \snext0 heading 3;}{\s4\ql \li0\ri0\sb240\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel3\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext0 heading 4;}{
-\s9\ql \li0\ri0\sb240\sa60\widctlpar\wrapdefault\faauto\outlinelevel8\rin0\lin0\itap0 \b\i\f1\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext0 heading 9;}{\*\cs10 \additive \ssemihidden Default Paragraph Font;}{\*
-\ts11\tsrowd\trftsWidthB3\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tblind0\tblindtype3\tscellwidthfts0\tsvertalt\tsbrdrt\tsbrdrl\tsbrdrb\tsbrdrr\tsbrdrdgl\tsbrdrdgr\tsbrdrh\tsbrdrv 
-\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \fs20\lang1024\langfe1024\cgrid\langnp1024\langfenp1024 \snext11 \ssemihidden Normal Table;}{\s15\ql \li0\ri0\sb60\sa60\widctlpar\brdrb\brdrs\brdrw15\brsp20 
-\tqc\tx4153\tqr\tx9639\wrapdefault\faauto\rin0\lin0\itap0 \f1\fs16\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext15 header;}{\s16\ql \li0\ri0\sb60\sa60\widctlpar\brdrt\brdrs\brdrw15\brsp20 
-\tqc\tx4153\tqr\tx9639\wrapdefault\faauto\rin0\lin0\rtlgutter\itap0 \f1\fs16\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext16 footer;}{\s17\ql \li0\ri0\sb60\sa120\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 
-\fs22\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext17 DocumentSubTitle;}{\s18\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \b\fs21\cf8\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 
-\sbasedon0 \snext18 Tabletitle;}{\*\cs19 \additive \f1 \sbasedon10 Filename;}{\*\cs20 \additive \b\f36 \sbasedon10 Syntax Literal;}{\*\cs21 \additive \i \sbasedon10 Syntax Element;}{\s22\ql \li851\ri851\sb60\sa240\keep\widctlpar\brdrt
-\brdrs\brdrw15\brsp20 \brdrb\brdrs\brdrw15\brsp20 \wrapdefault\faauto\rin851\lin851\rtlgutter\itap0 \fs24\lang1033\langfe2057\cgrid\langnp1033\langfenp2057 \sbasedon0 \snext0 Syntax;}{
-\s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext23 Comamnd;}{\s24\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 
-\f35\fs16\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext24 \ssemihidden \styrsid6372845 Balloon Text;}{\*\ts25\tsrowd\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 
-\trbrdrv\brdrs\brdrw10 \trftsWidthB3\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tblind0\tblindtype0\tscellwidthfts0\tsvertalt\tsbrdrt\tsbrdrl\tsbrdrb\tsbrdrr\tsbrdrdgl\tsbrdrdgr\tsbrdrh\tsbrdrv 
-\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang1024\langfe1024\cgrid\langnp1024\langfenp1024 \sbasedon11 \snext25 \styrsid678217 Table Grid;}{
-\s26\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \f2\fs20\lang2057\langfe1033\cgrid\langnp2057\langfenp1033 \sbasedon0 \snext26 \styrsid8592727 Body Text;}{\*\cs27 \additive \sbasedon10 \styrsid11890070 f40;}}
-{\*\listtable{\list\listtemplateid-1714398180\listsimple{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat0\levelspace0\levelindent0{\leveltext\'01*;}{\levelnumbers;}\hres0\chhres0 }{\listname ;}\listid-2}
-{\list\listtemplateid1604386730\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li720
-\jclisttab\tx720\lin720 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li1440
-\jclisttab\tx1440\lin1440 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li2160
-\jclisttab\tx2160\lin2160 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li2880
-\jclisttab\tx2880\lin2880 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li3600
-\jclisttab\tx3600\lin3600 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li4320
-\jclisttab\tx4320\lin4320 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li5040
-\jclisttab\tx5040\lin5040 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li5760
-\jclisttab\tx5760\lin5760 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li6480
-\jclisttab\tx6480\lin6480 }{\listname ;}\listid227346643}{\list\listtemplateid597999524\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698689
-\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li720\jclisttab\tx720\lin720 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698691
-\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li1440\jclisttab\tx1440\lin1440 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698693
-\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li2160\jclisttab\tx2160\lin2160 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698689
-\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li2880\jclisttab\tx2880\lin2880 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698691
-\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li3600\jclisttab\tx3600\lin3600 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698693
-\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li4320\jclisttab\tx4320\lin4320 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698689
-\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li5040\jclisttab\tx5040\lin5040 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698691
-\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li5760\jclisttab\tx5760\lin5760 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698693
-\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li6480\jclisttab\tx6480\lin6480 }{\listname ;}\listid607854900}{\list\listtemplateid-2132086688\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat0
-\levelspace45\levelindent0{\leveltext\leveltemplateid-1068182316\'01-;}{\levelnumbers;}\loch\af0\hich\af0\dbch\af0\fbias0\hres0\chhres0 \fi-360\li450\jclisttab\tx450\lin450 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1
-\levelspace45\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li1485\jclisttab\tx1485\lin1485 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45
-\levelindent0{\leveltext\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li2205\jclisttab\tx2205\lin2205 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0
-{\leveltext\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li2925\jclisttab\tx2925\lin2925 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
-\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li3645\jclisttab\tx3645\lin3645 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
-\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li4365\jclisttab\tx4365\lin4365 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
-\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li5085\jclisttab\tx5085\lin5085 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
-\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li5805\jclisttab\tx5805\lin5805 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
-\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li6525\jclisttab\tx6525\lin6525 }{\listname ;}\listid1202405001}{\list\listtemplateid1624279010\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0
-\levelfollow0\levelstartat0\levelspace0\levelindent0{\leveltext\leveltemplateid-1068182316\'01-;}{\levelnumbers;}\loch\af0\hich\af0\dbch\af0\fbias0\hres0\chhres0 \fi-360\li405\jclisttab\tx405\lin405 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0
-\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li1125\jclisttab\tx1125\lin1125 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0
-\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li1845\jclisttab\tx1845\lin1845 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1
-\levelspace0\levelindent0{\leveltext\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li2565\jclisttab\tx2565\lin2565 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0
-\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li3285\jclisttab\tx3285\lin3285 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
-\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li4005\jclisttab\tx4005\lin4005 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
-\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li4725\jclisttab\tx4725\lin4725 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
-\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li5445\jclisttab\tx5445\lin5445 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid134807557
-\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li6165\jclisttab\tx6165\lin6165 }{\listname ;}\listid1562641293}{\list\listtemplateid1239692824\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat0
-\levelspace45\levelindent0{\leveltext\leveltemplateid-1068182316\'01-;}{\levelnumbers;}\loch\af0\hich\af0\dbch\af0\fbias0\hres0\chhres0 \fi-360\li405\jclisttab\tx405\lin405 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1
-\levelspace45\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li1440\jclisttab\tx1440\lin1440 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45
-\levelindent0{\leveltext\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li2160\jclisttab\tx2160\lin2160 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0
-{\leveltext\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li2880\jclisttab\tx2880\lin2880 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
-\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li3600\jclisttab\tx3600\lin3600 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
-\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li4320\jclisttab\tx4320\lin4320 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
-\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li5040\jclisttab\tx5040\lin5040 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
-\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li5760\jclisttab\tx5760\lin5760 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
-\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li6480\jclisttab\tx6480\lin6480 }{\listname ;}\listid1755588230}}{\*\listoverridetable{\listoverride\listid-2\listoverridecount1{\lfolevel\listoverrideformat
-{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelold\levelspace0\levelindent283{\leveltext\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-283\li283\lin283 }}\ls1}{\listoverride\listid607854900
-\listoverridecount0\ls2}{\listoverride\listid227346643\listoverridecount0\ls3}{\listoverride\listid1562641293\listoverridecount0\ls4}{\listoverride\listid1202405001\listoverridecount0\ls5}{\listoverride\listid1755588230\listoverridecount0\ls6}}
-{\*\rsidtbl \rsid212434\rsid335316\rsid481371\rsid678217\rsid735290\rsid1653898\rsid2495527\rsid3154883\rsid3544718\rsid3948828\rsid4207626\rsid4285936\rsid4540351\rsid5055728\rsid5070621\rsid5196648\rsid5403878\rsid5454414\rsid6226036\rsid6254420
-\rsid6307333\rsid6310753\rsid6358148\rsid6372845\rsid6816192\rsid6890489\rsid7406415\rsid7810845\rsid8289572\rsid8334973\rsid8592727\rsid9066106\rsid9120167\rsid10028869\rsid10304687\rsid10551457\rsid10961137\rsid11476477\rsid11748829\rsid11890070
-\rsid12218284\rsid12285517\rsid12334294\rsid12336355\rsid12536172\rsid13524902\rsid14296482\rsid15020123\rsid15342006\rsid15867397\rsid16414626\rsid16604991}{\*\generator Microsoft Word 10.0.6818;}{\info{\title Standard:_}{\author Andrew Thoelke}
-{\operator lukaszforynski}{\creatim\yr2000\mo9\dy26\hr14\min25}{\revtim\yr2007\mo7\dy9\hr14\min59}{\printim\yr2000\mo9\dy27\hr13\min29}{\version26}{\edmins1541}{\nofpages14}{\nofwords3744}{\nofchars21344}{\*\company Symbian}{\nofcharsws25038}
-{\vern16393}{\*\password 00000000}}{\*\xmlnstbl {\xmlns1 urn:schemas-microsoft-com:office:smarttags}}\paperw11907\paperh16840\margl1134\margr1134\margt1134\margb1134\gutter0 
-\widowctrl\ftnbj\aenddoc\noxlattoyen\expshrtn\noultrlspc\dntblnsbdb\nospaceforul\hyphcaps0\formshade\horzdoc\dghspace120\dgvspace120\dghorigin1701\dgvorigin1984\dghshow0\dgvshow3\jcompress\viewkind1\viewscale100\nolnhtadjtbl\rsidroot6254420 \fet0
-{\*\wgrffmtfilter 013f}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\headerr \pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\pvpara\phmrg\posxr\posy0\dxfrtext181\dfrmtxtx181\dfrmtxty0\nowrap\faauto\rin0\lin0\itap0 
-\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid4207626 {\*\shppict{\pict{\*\picprop\shplid1026{\sp{\sn shapeType}{\sv 75}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\sp{\sn fLine}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}
-{\sp{\sn fLayoutInCell}{\sv 1}}}\picscalex17\picscaley17\piccropl0\piccropr0\piccropt0\piccropb0\picw23813\pich6615\picwgoal13500\pichgoal3750\pngblip\bliptag1016976793{\*\blipuid 3c9dd5997eca05e5285611ada434fb29}
-89504e470d0a1a0a0000000d4948445200000384000000fa0803000000ce507925000000017352474200aece1ce900000300504c5445ffffffffffccffff99ff
-ff66ffff33ffff00ffccffffccccffcc99ffcc66ffcc33ffcc00ff99ffff99ccff9999ff9966ff9933ff9900ff66ffff66ccff6699ff6666ff6633ff6600ff33
-ffff33ccff3399ff3366ff3333ff3300ff00ffff00ccff0099ff0066ff0033ff0000ccffffccffccccff99ccff66ccff33ccff00ccccffcccccccccc99cccc66
-cccc33cccc00cc99ffcc99cccc9999cc9966cc9933cc9900cc66ffcc66cccc6699cc6666cc6633cc6600cc33ffcc33cccc3399cc3366cc3333cc3300cc00ffcc
-00cccc0099cc0066cc0033cc000099ffff99ffcc99ff9999ff6699ff3399ff0099ccff99cccc99cc9999cc6699cc3399cc009999ff9999cc9999999999669999
-339999009966ff9966cc9966999966669966339966009933ff9933cc9933999933669933339933009900ff9900cc99009999006699003399000066ffff66ffcc
-66ff9966ff6666ff3366ff0066ccff66cccc66cc9966cc6666cc3366cc006699ff6699cc6699996699666699336699006666ff6666cc66669966666666663366
-66006633ff6633cc6633996633666633336633006600ff6600cc66009966006666003366000033ffff33ffcc33ff9933ff6633ff3333ff0033ccff33cccc33cc
-9933cc6633cc3333cc003399ff3399cc3399993399663399333399003366ff3366cc3366993366663366333366003333ff3333cc333399333366333333333300
-3300ff3300cc33009933006633003333000000ffff00ffcc00ff9900ff6600ff3300ff0000ccff00cccc00cc9900cc6600cc3300cc000099ff0099cc00999900
-99660099330099000066ff0066cc0066990066660066330066000033ff0033cc0033990033660033330033000000ff0000cc0000990000660000330000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
-000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000199e9ab4000000097048
-597300000ec300000ec301c76fa8640000207149444154785eed9dd981ebb80e446f3e9d4fe7d3f9389f4967b478d142f214b899b6d05ff3de9548a050058094
-4cfdfbe77f8e8023e00838027d10f8f9fdbbfdf499ca6771041c8123029300ff9bff5c84ce0d47e00d084c057011e0fcf7fb86f9a7297f5f7fef31c0677504de
-85c0dc813e0538ffc7df3b2cd94870fecf7798e0733a02ef40e024c03789f0204197e13bc8e073f647e0e750009fd5f0d6db9680045d86bd83e0f3f546e0d881
-eedad1de228c68d07bd2deacf0f97a2110ec40df29c2a8065d85bd38e1f37445e07727b7c8ffe86b514284be3fd335143e591f047e4613614a825e0afb90c267
-e98cc06789d04b61677af8743d10d83f120c4bb2871df739d285d01f18760c854fd50d81f5cdb4f45fc7f7d65c84dd22ef130d83c05822440d7a3f3a0c73dc90
-6a0828dba3fd2a218bd055582df43ed0280828dba32ec251a2e5767c2702b420ecf95b26a1107a25fc4e1a5edb2b17e1b5e3efde0f80c0a789d04be100a47113
-ea22203c28ecb62654da511761ddf8fb6803202088b0dbaf7a5d840310c24de88f80f0a0d045d83f2c3ee39510f834115e2936eeeb451070115e24d0eee6b808
-8c24c2ed096bb1f5e1b848ba658e4026022ec24ce0fc3647a01602c2cba3dd3666844a58cb6d1fc711180701e1e5d17e2264158e039c5be208d442c045580b49
-1fc711c844602c115229cc74d26f73044646e0a3443832906e9b23908bc060224c97c25c27fd3e476064044613614a8523e3e8b63902d9080c27c2b80ab37df4
-1b1d81a111184f8431150e0da31be708e42330a008771f087dbcbe96efa1dfe9080c8ec090223c15c3c14174f31c811204c614e1e4917f2ebb24ac7eef272130
-ac083f0944b7d5112841c04558829edfeb085440c0455801441fc2112841c04558829edfeb085440c0455801441fc2112841c04558829edfeb085440c0455801
-441fc2112841c04558829edfeb085440c0455801441fc2112841c04558829edfeb085440c0455801441fc2112841c04558829edfeb085440c0455801441fc211
-2841c04558829edfeb085440c0455801441fc2112841606c1176fb487009847eaf235086c0c022fcf99bff5c8765017edcfdb3c0795bfe56607f1cda3ad0168f
-922dc229868fbf62234203ac12fc1215be95ef1392d18fa24f7a7cab6d4da8b30efaf30b83cff4fd5d92514136ba0ff25b36c87ff8777466b2fc18d4399675f1
-7c6ab0fac8a1d2b0568709c9ba4eaca32d706923cf215decd02e676bcfa10a85fb561ebda5d0de2647d9a61e572c7ec75538fdf39ec253fc49b347b343329846
-c9899c5009b7c3fefc4693ea7f763f12e178d4c106b570e64bd28b1c1c23ae3cf1a24f5b9d439a19d08d21bfc2c7279f9acc13e2524b7684b672b9be245f1c0d
-8efd130dfe4d575002da0c1998449850e03d98e67c1289c15683356b61207d054a43068e213f766528a1ec042df24b944981e6e82d892c98c928dbc44527a50c
-4890537c37f13cdb12877abd4de22f436b0c9b41841248931f150ac95e837ff981dd859cc1db06b02ca59fa21df3818cba6539cfe932b20a49b3f05cf8cec364
-97b67877f29ae4961afdd47b1faffe11287ca3b80b634cf6e2305b4764116a73afe9a454869b05e15d8ed9917dae00336899ed475058e1dd275c91e7e06988d5
-79fe445f2a8d9b1b7c818989655e789db413d48fa2f2593f290f240816500d32145c9f6d521d78f435b99158997a2c84c50d6986025720ed7e441b9e7386d541
-355543e10be820fd187fa4914db66e57b04a3e0ac663df836e87d9d8a2833d559158ce9700782db355f66822d4f5ffb0203714b3fbe74258d49052c3970cbe4d
-86a9a98e88585891dae93b10c6366cccf74813ace824d931263a1aa54e055895deff7dce67637038ea7668451508229c2a9302fee11a1b7b77c13917c2fc5248
-2b71f64c04724a1d40a39d8fcaf264679b68464ea8c218849a71697435ffef052910f1948a527bf5ab53775becf209ac0c25e70f586a51137cffa7e4a8402035
-03ceb9315408334ba199ea213e4ae944c0711bd78c802a66d8c9964a4267194aed18ed6c84aba134f4fe56e196958319689f5ad24c68a5be80c913de89e60a32
-ada8f2b6534285304b84b92bc1936f0aad18905752ca0c28961881956ce6f68a93f095dbf392af2294e3c86ccd424165e8f350fbc9b2a15544c022644fe35720
-6d42320d8bd03c541ef491d68cd3094ff70c075f1a411430c8264a22c407194aa63358812b149a1d93a1608d794ff165c75685c24cd1e535c3d15684893787a2
-a685bb516329acd2876e60e5ec2e28607539b30c6e973861ec0a889250c05ef88297864d24ebdee8d16f81bc3fc23531ef5f41cf5c90ad0333770a6c54725786
-0ac385d0b435535b820a9202900b9fcba492c8aa65033311d7a995a033ebce6e28d69fc7e5bbf88a8447f7ca5b923625150adc51708f5fa3aca7b631891542bd
-143690a0a242ce9693084be3195f6114b14d5f5048d3700376ba4221d9b91b970ab33274aaff2f97082da5ca67201f8d2a2c16a14413323af0efe407cffb5758
-0653599567cf7039d04a49b427d29d45aa0c1b4a40594e196e9af3a6e1f2c8a5b43953610a32d2169258372af6a38dc838fb58bc2d420f1209c8e5dfc3562824
-96863f5c749e4d19c5de8f2a610b8dcaed87626ffc9a5b0d0d22753a8890d8bbcb8bf142a8f4a3d51e4a84c202f9ac07929359412b5acd1de0bd2217cafce74a
-a84825947e146b94b1a3d7d4996000ea58625222c2d20517450b1ad2d659f96e5e888bada60ecc25d55c5bf3a3b57c411649d6505c3bfc7b1a90563974e798a1
-3d8977a3d88fb60f487ac3a14ed244466456271c37704190f7ca40b47e3e02a940171cb30b7d158fe19ab402fa78a107656811a6a1549854219ee703249ac530
-98bf15370d5977d1a352c9c3c5a406a01dc6483783cd02b8f74ced4f52dd282e0a955096019e2c85ed2bf16afc29a3b5f23bcc1c8931b68714ca90115db7f2bd
-8c27e7bb930250fcaf6090ba2c2c12617b5f9215bdfdf46b208e5836137f84380aeff5d6477d812132a252972bf0b778882198234625d58de2a2b0c26338003b
-9d4b8a23250e7028338a28c4917797c59c55786feb47150f22b5553126c7f9daf72401e995bec5a3f0ca4428bd5455046fb2ab50b85434fbfde67d42eb5d08a5
-27676ae7b3be4d2b801223f1a788300988028080115f22e5c674378a8bc27fcd08f9f02f59d07b89700fa571d6fbf9dbd349abd9559fee9c0756370166112a51
-8b01df8dbfccf0f415a955723f2794b0948a50da662b813399d07a65e59d1196001e8f724c1e00198f97e2a79473efc454441de3b0c5fd92c017df9ba27f3f27
-94b0a4bb51ae8452675384672aa129e42c9afc71f3d6087dd2c8f14d91435a12e946e18ca11f55868b9247b9b90ae6a5838c2142a54321117235d53999876aca
-02a5adca9bf570d75684f280894e3a743c4eca51a57471a81e5e28b0c54793fd7ff385a9854c462679ac2aac5e09a5b05c8496bd99f51345b838daf999722203
-4b2b86ebf51b4aaa73d20935c7df7f15f7dde276f8a444216f26acb123f8fabe40fcac441e75fd928c76a2fb3c5a4de26cbf78c1875ded7dc127b8b42414fa51
-69953f7f3663975bf553116b62c9918e5cb1b15d60f03c88d21deede7e2f7eae25a4dc3b1f0418128309776f2f397e6f22eb7de3fdf9c8da10f588733a7f4b33
-e08e02c6a58608796f26fce59c1a6c361262bdfc9910f0ccc4e7f01b85289de1be762652e1ab1c8268955931e5de2f28eb462d9d4ff86c78c5975d60cf6b6b85
-3b2944d576265a51150cef3e603aa66e54a984b03713ffd68288448a5b76111e12b308e6269b69539a7b43b841619d3aa730568a381a00cb5591cf1a18469873
-6668792a0c514784b15585a118525c5884ca723f1ed5f4e7013415d614e199159a0d2f116ad763f63b6eb7d20dcab4d8f7e8dd688a3772218bae8ac5ccb7b62d
-d9bfa9ae22c204a6320e14973a228c3104bfef2245a39e0883f64836bc7014cac8441d4a7e079f7ef95b2642c849c8866e3485b960c9229f0406421dbb5f121d
-8487a821c2a47ed884fb15b04ea823c2f0761b4a70b24d0968e9d6fd03ab5862566c78055413a1d23fa84bb8f53a655e6d5661a424f714bce0d841c184b59d8d
-63c4565410613a972add09a5a3f91d421621d5d215a63324da7d4a19aa24c228a00a96af8072f067dc6d0253ae56acd4eaaf90c0cbdf154c9ba2841dfa0941c7
-a90d310104ee67041b2897d414e191224a155c3012c0a822c2544e10746514a1d8182ae27b5e63b23231b22280a4618a215093958c025fc913dc281521e73401
-8a85e0493cab55c27db7244b50ea476b883089a790d05eaa12b286f690d0a440b11f55c614bc4d7731cc3cce41028ad04a093a2e14216b507b444e5b044237aa
-b595dbc714f4aac80e1b8112e522048b84a43a800805d649fb41ac21188607e0b5298f41bc13e02814a192d1d80fee47151132a2fb8d0321816cdc1304502cc2
-0af1348ab0c19a506a1ac8d37905c245a8f8bd01a60c92b74631ed204281bed88f5614e17d6f46a0c10e1b8113a52264932cbce46be72b98864a9edd5f23340d
-82f8855100301490e03d5af1212254f634880f354538cbc9d489ae146352178a50a8cc6c83b512b2f0ed2214f295d08fb28448433c02a7a0af11213ab2722bf9
-831a45852a5dfe844f529dc76201148a50309f69651521115930ea7c099bc91110944c4588cdb89008c57e34919495cd51e9edd185303f8c7d807b5f2a426272
-8e0a85ac8bd30aa4a1d6611011b2191dd6844a2737333cf5836da510b6e8ac36f030961f5909b926d965285431acc00c778521381b633ec16c22bc6cd5458402
-a0e92785752ba19d55f31decc4678a50fa41a11132c68a1685828e91fe6cc5954488e9646df5e290b80857153090c6376670356e54dffd72a197040909235037
-5a98365757d00e4c0582195d2a2173079e144adde805da5106d2fa02f7aa42fe6d844d8c421d838714ec293fe5a85109d1938f11217ab25221ae224d84dc5cd8
-a8b4bfba2ca47c3793ca5609051a6ff69af6c73294e0b4dc2bb89b2e64bc0dc639978d60c62075bf4d84717f5c84f676141ba923cf8f67ac942851983c2922e1
-7eec46854c7025110a0fba174644c3ee22b48b107378a0d81c4fb9cad6a132796a70a18cb36d5e097718311c2ec2daeda89af94e05317ed60ef3fe798510f154
-19aad18d7a25b4aea7d2dba35e09ed9550d84a8d52fd7828be417dfafe68a21f15ba51ee245d8459228cb6f91d45381fdafaf7773ef8b730b50bb70b4ce72e6d
-b3ae16989c2a38654214fad1c49686c9cf286e8c392b19fdf8988d193529c772a3f698d0f00bdd60dce62393396e09deb67f586f2227f2877bbe823d5301c938
-5e6c19ef8d2a5bb42ec233d285225402134e9bfa91e5297a0c2642a11d63b24f0f8ef627920bf55a7bca9d78635fa8e12c1f17e121549cc1d767c691088b9530
-4f84255f1dd8937834110a5c5654389f04ae707e1f3ca10e473b39a60b3781d2c34a760bdd604bb8274824369c3ff550613f2ea3fa2611eae7cb0b741d4d84b9
-fba32157ed3a64ee45f783f9567e48e8223c4a7b5011eebe7322a80c2e194e8422eca2e7c67228d4e1889484eccf25cc45f809223c7ef14ba4e2e76ccc48c7b4
-98bc36bd622a4829b27ee0dcc13de0cc402ea8ac65f4824d6133866a4763fd498335617d09a6cf6be148547f583f8596e96c12a1ed58906c97f946a91b751166
-ad09bb89b08504471421e671a306a7cbf5a654e847839548305adba265317b250c10a0d3ee68f502b1ba32dc9ab041299cdcd4ca90d40c07fb5116afb80dee22
-dce949657d17111a3ed8662b14038a5068c96c3ece578b1a10e60e2ea8583b621ae0812e550939b9ad54e82142d5163b394714a1d0dbd91de5cd08f5797d0032
-c162ad1b1592c0a5442800db4b846a51b65373c47654389f21c351f1581a21ea819ac649b25e257611be654dc82d4a0e29875d13b6d8219d9dd56a21831dd013
-dfc4d2594b658d91309130126c469f4714e8ca9df9addb51d58e3c218ed88e4e887269c97097b9a7cd7c8e381a234ded223c21ab92bfb10855339007e10b0615
-611b152a3da180f7a91fe594a1ccec95f02c25211a3dd684dc1864ca6fe476748a860abfc97b450b0cf869145eb3abdda8b7a37b21727aebb13bca9430b1f074
-f1a895b0d1c250108310f763c6c610c8dda88b70c0376638c72201d2170c2cc2262da9f0a480113d80c6b2151f12fac6cc313c2aff5bae0939bccc98cf15618b
-9767848694037f18846f100af09d46dcf9f058d8c973616633faec8e32b4cddb5144b3548243beb6b60d6ffd378598c39cf90e2446c60aca7f388d63e1276584
-e5f4d789b0e52febd53c50a0c591dbd1f51516a6a5c97d26a0f0bbe21d6a9c2af56ed4d784596bc28622e4e89ae817bc7878114e89bdae0c59119cfb766370e5
-1416a25e098320712816563714615df27dd673c25d48aafe8a8b4b21ab6ad75f22510cdda857c2ac4ad8eeb435e6c24957b7e9f8d19fe9efee89504a3fa012ae
-5d29525dee0a7855c8436da9825773ed7d0dc78997cdc7b0731e623386da9869274206621bfe497d275c301ac36fccec3669a6335691f0c2055c9858f01b5d31
-c8866ed42be158959083fb225ce4530cc2109f52091fb1293eed78020d45c13dc846c8a85816fdc6204e335e09cf89368649f1193318dca72dd1d31bbe50842b
-5fcb0e3e661a633ddd3474281b9ece4518cb8b08ee1aa966224422dc2fb8c583cc197dccdf1362a92a532297264e802fd0294ebc00dbbacbac634d63ee6593d8
-8c3e6b42b663813f664c69251404b4cc9f621473e99345f85022a9e0bc7d852267f09f8b42643c4bde45180d481f1146f39a20a0995dc99d37618c4f5b1386c2
-65de394511f2f3faa7b450af5cb95c8485226cf6b96c2dbfa7d3ec4544383fc11053667a09f1e20222f78c3b5dc9addf8e81ec078b1a8b33dbc466f469474b55
-50f67d420472310fd024822496b433c61c09de68545ec2664e70e932bd57c30feeb0be3dfb78a209cfe5228c8797d05dff3d5e8aca44c82cc06654e1ffc7af09
-37f1d320a375f47d408cfe5d5c982c85fce1ed68746305c3b05c106f0eca442814312c84ca89f2dfb0267c841005f108a9b05782f8dfc720e50b5379258c262a
-31a2f144572642a115e4136d91491ff5c68c505324d43879cd8b4cccc1ab3904b1b11b159600575a1372146051a68930c62ce440ba0c6b0cf9a635e1e2b19839
-95452806601503c95ec81c5e09a320518aa325e13fed4161910829c2820fdfd48e4a054cd8cf924adcfde11068d5da8da2a8d3bdcb4a084c459c8428b724dffd
-c3f927d088baebbfb319b033522442c50fda1be55ee9eb2aa1183626a1d08f2efaa23859bb518176576a47b11d817d99b24a48c1859dd97b9eb95e2514d672fc
-6467450f09305f448b162de16faee2dc7f21114a2a481765695118891205d74558d2c72b9510b75c968d714873e66ed42be136ae920a922f6e16b5a3420de3cd
-51a208eded7056565a7b7645d2845a5304a3b98f578adcb22884d9b86a1ddd62f3794c2c200c389b918a073611e29a90a9830fcb954a1843549a1ef3ac30ca97
-6dcc606d5af8c12454fad119fe3459b579767466f65f48840c06d5917fcd4588e1701186733266af4517881e2e1ccddb32a46ae4dc62f8db2ba1201ea5b1413f
-848cda5c841863018c112b21fa958a204a678a9c26425c91fc10dd314b9e1de190f1a0485eaed06c46610c14112aa1a42fa13717217289a11cf1ddd1dfff12bf
-53c6e0299113554e4b9b5f2896cc7517612a9e027de121dbd415082a8cd9a0508913bae0c5809570b63a5f8682cfc221d6523ffa072214b5fe7d6b422cc5d2c6
-0c76224237fa19222ccc44589884a5d5619fe48e7df4e01c98b2a208894b37d89711c0395dc2e67f403bcacf58956d758602f7463b54426c77d88de4107cbb82
-2517f5bd11cf59b1db0e919c84b3644f551d04407ab22cfb69ca4f786d4d49bcdc256885906229b4a385875b109938a249a2f0ed0481b4c9b8af845bec3368cc
-9257f76526db8907e9c9986781f831e69f5009093865738c9198f3295284d7845140a5849e3e60069f6261311760a034a0ecf4ef45b89fd4dc94d2660a3abdf3
-08464b032460f3a51b33c23b7f281f259be2b6cc4c3ffc2b1421a501565132adf2edf52be12987da6428858e6bc9431cd27011a55270c21a65ccd97acce0b88e
-a13781b0a557804b6ebe09b5547bed0235188f13e2b846be7493221d0d260419606f470373def4be4e828d29f884551a2f2242ddea6d1419f38f10a1a6a138ff
-b5fbe921e10c2c2f0ae32252da2a2ce918d174b6c6db310b98451806ffa6964309354b89122088cc6990fa178a5028a54b218b642aa5906a85b0488462f493a5
-90d3493aab0a3608eb1e065439533ef2b58dddfce2870cb994bc46650863bab7487de30563cee663fde604c16640e439ea2b702119eaa02bdd06f5a3093c4527
-52a1665f20181c89daed68d264d22172ef1e762171bc2e916a6be822d64ad00ec69c0746203a88507854f8406d1f57cbb728d90f61672681272b68f5213e8430
-02241226446d11d28c291d8a690bb794f7da50473dea50e2c7d73ea29036c53790dde60f6bce7f44803dcc4a21c4edd18408319bddcd89065b600f11454044a8
-2a6cc8d30e216ffc770b0b916779c44f307973891a87a308257e7cb308c5556176a731b7b2522869672635886a5dd81269794444e92e4261c27521317f8ff805
-def4a134152ddccb3a8544b5e96001378d5ffd8862724ec9a87ad8f23bfe1211cabc0aa950ba191389c03f2117b12d0f43ac55e7b6fed9222958bcdfedb10d4f
-0d0a4dcfdeb0bc11478cbc50c6c811e5a79159d03e6f52b7bed23b334938f544727ae8297e1d05a3c984a8bb2614e62b0bdb743755ff33b7b2acb24f739f9867
-c3b0d1af1c953e8ecd6011622e280c265bb05e512042c3f6d27fdbc7683feae296130947a2aa085b076d6964d5c8bdaed3b3e18654f669be4f848d1b5239cfa5
-45988e14b771dbeda57991f463f98ab440c7ce2214a62bcc9dca4f10aa94424e70b1d833081f5309951f53e407548738bd284c8bb07161e0580a0b839a95b0b1
-bf4bb8f5c86d6263ca862babe42c9db10fc48143243901732e906a3d0f93ab4276e16560aa14129aed3c1069221820848239bc022acc961bb1c77d96c86d3cb3
-4f2bc012b9845120da0c70d0d3d3374c077668ef77300a754498b51811bd924a0213a262256c17af172496c895944209ddb00a19737602a1e464c4666879064d
-11f97abcccd46aa4fa51748391c87441dc9f10e6471f9485c1c20961b25c6f1ff7317d23ee5827ce9e4881810747e6f71361a3cd195b962b1261b352c841501b
-c46a2244e2588570bede943d778e7147bd9b4d8437881de7a2cf12611315da34987a48c160b6aa0e2a499810f5da5161ae42195a23b7d588cdbab633316f30a1
-3101d86121fdae97d42f256cfec1b8f8ce8ce005a299c54bd9078e443511b6f1740b4f89328c446299c463cf98f3e808263380cd10e87bbfa4b60ad9faa36df1
-7e54f1a2b6fdb66d7a8e443511fe13dff2c9ca3a650f0dd4cefc699a9d241b2a30e61f27427e83c714d51c7863a590b19c43635c8d08de1856464c887a229cda
-16613ac1bff02506af83c9118bcb66daa2b91804260e1acb3c6633941af2bc86879323cbb6072c8b9542d1898ae62f7e72085f8609730b5e701e79e0da4e8616
-afc32eb1174f1a154dc698f3f0e389b05e31c95b554444c850dec9c051919388f5d54961eaaa229c1e330b531adcbd5f9a953c8f9ec9d3e6d1e4311d03c0cc19
-5084b5229b0b6eb81f6528ef614144657698dfa66242d46c47577f2da71b889ee7066e2f4379795ed48d0a1be2cc1ca40c67250ebd907ef797187a896860b3b1
-0d9742830f0c88c646f5c8324b272fb8c1e0ef39515986f99f9639f8c67eac611020495cc2c1fe54119617c39250864a212369da31135498e1011342611c93f7
-94982b2e0eb373e75928021c531c0aeb2e4fc2d419b3124e8096c5b508d95029b4a54be631a9d07080eefb366636a0542a8745713bc608b9bd04a150f55f2dc2
-12199afbb8632373aa859ccdf643146e58dcf2c8c88468540917e72d07c784735069dcb254684bafa7ab1973e60e668bb7ac091f7b1c591525a38f3b407b2e85
-f6486599be7233ab0ace1632215a8ab054877989271919211796ceca987fb808a7bd3773575a259b1e2ba15d83f9bbf7050e30211a8b305f877450704e04e67b
-3017b244d25333e63cc3d0957071dfa2c36aa1dcab90610c062a639d945d0417039810ed4538474c3d35e7d194de7e331116a4092ae4464f98e31a97fc0a618d
-1c329b07d0be21cd1bc34cc7965ccc7621f34625626bef5d2d71861321ec809576a399f07cea6d894391a6b3656be7d2ad0a8b1013cb42632e16b9907b331e63
-3539ddae04ae56533bda7afe5cec86beefe7675fa47eb7273bd7b4fc354df1a844c60e5c2cf6217b80f944b9bfc381bff3970c9acb6fb5183a74ef46b303dbe7
-c6755d582b55ce4a3c32622663ab24d207a3d167a177d70a1f128eeefe37d83795ddfa6e4c83ce7ff507f611cf08d0569563e60838026d11a0bd7fdf96698bbf
-8fee08e0b68c77a34e1247a02d02540895a7a66d2df4d11d812f47809e4f7837fae50470f7de8e001642df1d7b7b8cdc802f47800aa13f24fc7202b87b6f4700
-0ba16fcbbc3d466ec0972340cf087d5be6cb09e0eebd1d017a59a6f45c8bb73be8063802832380cda8e944d7c19d75f31c811111c066d4b765460c9bdbf44508
-60335a7ac0d31761e5ae38022d10e066d4b7655ae0ee633a024f04b019f56d19678b23d01401d6a06fcb340d800f7e7904e85599f273b72f0fb103e008241110
-34e885d039e408344440d1a0ff7ea261007ce8cb23a068d00be1e569e200b4434038f87e3eecb49d013eb223707104f819fd7218b0ff90f0e23c71f79b21a095
-c1e24f1236b3df0776043e1c0155825e083f3cd06efea808183edfe55ba3a306d1edfa64040c122cfd48fd27c3e4b63b028d10307e22d84fb56814071ff6aa08
-983f02e98f27ae4a15f7bb0902c61ae88f279a44c107bd2e02390af4c713d7e58b7bde0001e1f74ae7cff47a33da20123ee46511107e3d7f16a1bf2b7359beb8
-e32d10c82885be33da22103ee67511b097427f4c7f5db6b8e76d10b09642d7609b38f8a81746c0580a7d53e6c25c71d75b2120fd80f7b13be31a6c15061ff7ca
-08584aa1f7a257668afbde0e01bd14ba06db45c147be34027229f4671397e6893bdf1201ad14defc197dcb20f8d81747e0fc52ccf9fff156f4e22471f7db22c0
-a5f0e6ad68db10f8e89747804aa197c1cb53c401688d40ba14fef96ab075007c7c47e05fe2e535df90717e38023d10881ef8eb55b007fc3e87233021102e852e
-41278723d00d814029fcf31dd16ef0fb448ec0b914ba029d158e406f0436a5f0e60aec8dbecfe708cc08acab4217a0b3c111781b023f7f7f3ffe40f06df0fbc4ef40e07fe66a76e6cc5765320000000049454e44ae426082}}{\nonshppict
-{\pict\picscalex17\picscaley17\piccropl0\piccropr0\piccropt0\piccropb0\picw23816\pich6616\picwgoal13502\pichgoal3751\wmetafile8\bliptag1016976793\blipupi95{\*\blipuid 3c9dd5997eca05e5285611ada434fb29}
-0100090000031add00000000f5dc000000000400000003010800050000000b0200000000050000000c02fb008503030000001e000400000007010400f5dc0000
-410b2000cc00fa00840300000000fa008403000000002800000084030000fa000000010004000000000000000000000000000000000000000000000000000000
-0000ffffff00fefefe00cccccc009999990066666600333333000000000000000000000000000000000000000000000000000000000000000000000000002222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222355332222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-02022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222226000006542222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222400000000006542222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222226000000000000005422222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222400000000000000000054222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222226000000000000000000000532222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222400000000000000000000000053222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222226000000000000000000000000006322222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000000532222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222220000000000000000000000000000000052222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000000000064222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220000000000000000000000000000000000
-00522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000
-00000000000632222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222230000000000000000000
-00000000000000000000042222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222500000000000
-00000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222230000
-00000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22250000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-02022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222223000000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222260000000000000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222223000000000000000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222260000000000000000000000000000000000000000000000000042222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222223000000000000000000000000000000000000000000000000000032222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222260000000000000000000000000000000000000000000000000000622222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222450000000000000000000000000000000000000000000000000000522222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222224500000000000000000000000000000000000000000000000000322222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222235000000000000000000000000000000000000000000000006
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222450000000000000000000000000000000000000
-00000000422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222224600000000000000000000000000
-00000000000000000222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222460000000000000000
-00000000000000000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222236000000
-00000000000000000000000000000000003222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22360000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222240000000000000000000000000000000000000032222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222236000000000000000000000000000000000000622222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-02022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222225000000000000000000000000000000000000322222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222225000000000000000000000000000000000005222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222225000000000000000000000000000000000003222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222225000000000000000000000000000000000052222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000032222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000522222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222230000000000000000000000000000000000222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222240000000000000000000000000000000004
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222260000000000000000000000000
-00000006222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222300000000000000000
-00000000000000003222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222400000000
-00000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-60000000000000000000000000000000022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222300000000000000000000000000000000422222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222500000000000000000000000000000006222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222223000000000000000000000000000000003222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222225000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-02022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222230000000000000000000000000000000022222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222250000000000000000000000000000000422222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222300000000000000000000000000000005222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222600000000000000000000000000000002222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222224000000000000000000000000000000042222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222233322222222222222222222222222222222222222222222222222222222222222222222222222222222223333333222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222220202222222222222222222222222222222222222222222334556600000000000006655432222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000622222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222255555532222222222222222222222222222222222222222222222222222222222222222222222234566000000000000000665533222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222202022222222222222222222222222222222222222345600000000000000000000000000000654322
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222250000000000000000000000000000000322
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222333555555555555543322222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222235555555552222222222222222222222222222222222222222222222222222222222222222234560000000000000000000000
-00000065432222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222245600000000000000000000000000000000
-00000065422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222300000000000000000000000000
-00000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222223456000000000000000000000006554322222222222222222222222222222222222222222222
-22222222222222222222222222222222223555555555552222222222222222222222222222222222222222222222222222222222222356000000000000000000
-00000000000000000065422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222223560000000000000000000000000000
-00000000000000000064322222222222222222222222222222222222222222222222222222222222222222222222222222222222222222500000000000000000
-00000000000006222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222456000000000000000000000000000000000654222222222222222222222222222222222
-22222222222222222222222222222222222222222355555555555552222222222222222222222222222222222222222222222222222222223560000000000000
-00000000000000000000000000000064322222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222245000000000000000000000000
-00000000000000000000000000000542222222222222222222222222222222222222222222222222222222222222222222222222222222222222250000000000
-00000000000000000000003222222222222222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222222
-22222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002
-22222222222222222222222222222222222222222222222222222222222234600000000000000000000000000000000000000000542222222222222222222222
-22222222222222222222222222222222222222222222222225555555555555532222222222222222222222222222222222222222222222222222223500000000
-00000000000000000000000000000000000000000642222222222222222222222222222222222222222222222222222222222226000000000000000000000000
-00000000002222222222222222222222222222222222250000000000000000000000000000000006020222222222222222222222222450000000000000000000
-00000000000000000000000000000000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222236000
-00000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000
-32222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000
-00000002222222222222222222222222222222222222222222222222222222222346000000000000000000000000000000000000000000000005322222222222
-22222222222222222222222222222222222222222222222222222222555555555555555522222222222222222222222222222222222222222222222222223600
-00000000000000000000000000000000000000000000000000005322222222222222222222222222222222222222222222222222222222260000000000000000
-00000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222222222222222224500000000000000
-00000000000000000000000000000000000000000000000000532222222222222222222222222222222222222222222222222222222222222222222222222222
-22300000000000000000000000000000000000022222222222222222222222222222222222222222222222222222222222222260000000000000000000000000
-00000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000
-00000000000000022222222222222222222222222222222222222222222222222222222350000000000000000000000000000000000000000000000000000632
-22222222222222222222222222222222222222222222222222222222222222235555555555555555522222222222222222222222222222222222222222222222
-22250000000000000000000000000000000000000000000000000000000000642222222222222222222222222222222222222222222222222222222600000000
-00000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222222222222222235000000000
-00000000000000000000000000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222
-22222222230000000000000000000000000000000000000422222222222222222222222222222222222222222222222222222222222222600000000000000000
-00000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000
-00000000000000000000000222222222222222222222222222222222222222222222222222222460000000000000000000000000000000000000000000000000
-00000005322222222222222222222222222222222222222222222222222222222222222555555555555555555322222222222222222222222222222222222222
-22222222236000000000000000000000000000000000000000000000000000000000000065222222222222222222222222222222222222222222222222222226
-00000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006020222222222222222246000
-00000000000000000000000000000000000000000000000000000000000000000000004222222222222222222222222222222222222222222222222222222222
-22222222222222222600000000000000000000000000000000000005222222222222222222222222222222222222222222222222222222222222226000000000
-00000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600
-00000000000000000000000000000002222222222222222222222222222222222222222222222222222460000000000000000000000000000000000000000000
-00000000000000000522222222222222222222222222222222222222222222222222222222222235555555555555555555222222222222222222222222222222
-22222222222222225000000000000000000000000000000000000000000000000000000000000000006422222222222222222222222222222222222222222222
-22222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222222222
-35000000000000000000000000000000000000000000000000000000000000000000000000000006322222222222222222222222222222222222222222222222
-22222222222222222222222250000000000000000000000000000000000000002222222222222222222222222222222222222222222222222222222222222260
-00000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222
-22222600000000000000000000000000000000022222222222222222222222222222222222222222222222222360000000000000000000000000000000000000
-00000000000000000000000000632222222222222222222222222222222222222222222222222222222222555555555555555555553222222222222222222222
-22222222222222222222222600000000000000000000000000000000000000000000000000000000000000000000632222222222222222222222222222222222
-22222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222
-22222235000000000000000000000000000000000000000000000000000000000000000000000000000000000522222222222222222222222222222222222222
-22222222222222222222222222222224000000000000000000000000000000000000000042222222222222222222222222222222222222222222222222222222
-22222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222
-22222222222226000000000000000000000000000000000222222222222222222222222222222222222222222222222250000000000000000000000000000000
-00000000000000000000000000000000000042222222222222222222222222222222222222222222222222222222235555555555555555555552222222222222
-22222222222222222222222222222260000000000000000000000000000000000000000000000000000000000000000000000053222222222222222222222222
-22222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006
-02022222222236000000000000000000000000000000000000000000000000000000000000000000000000000000000000622222222222222222222222222222
-22222222222222222222222222222222222222200000000000000000000000000000000000000000522222222222222222222222222222222222222222222222
-22222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222
-22222222222222222222260000000000000000000000000000000002222222222222222222222222222222222222222222222236000000000000000000000000
-00000000000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222555555555555555555555532222
-22222222222222222222222222222222222230000000000000000000000000000000000000000000000000000000000000000000000000004222222222222222
-22222222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000
-00000006020222222246000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032222222222222222222
-22222222222222222222222222222222222222222222225000000000000000000000000000000000000000000322222222222222222222222222222222222222
-22222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222
-22222222222222222222222222222600000000000000000000000000000000022222222222222222222222222222222222222222222225000000000000000000
-00000000000000000000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222235555555555555555555
-55532222222222222222222222222222222222222222600000000000000000000000000000000000000000000000000000000000000000000000000006222222
-22222222222222222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000
-00000000000000060202222246000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042222222222
-22222222222222222222222222222222222222222222222222222300000000000000000000000000000000000000000004222222222222222222222222222222
-22222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000
-00062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222222222222222222222600000000000
-00000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222222222355555555555
-55555555555522222222222222222222222222222222222222260000000000000000000000000000000000000000000000000000000000000000000000000000
-00032222222222222222222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000
-00000000000000000000000602022246000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042
-22222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000000000000062222222222222222222222
-22222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000
-00000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222222222222222222222300000
-00000000000000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222222225555
-55555555555555555555322222222222222222222222222222222222225000000000000000000000000000000000000000000000000000000000000000000000
-00000000000042222222222222222222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500
-00000000000000000000000000000006020223000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000005222222222222222222222222222222222222222222222222222222222222400000000000000000000000000000000000000000000032222222222222
-22222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000
-00000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222222222222222222222222222
-24000000000000000000000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222
-22235555555555555555555555555222222222222222222222222222222222222400000000000000000000000000000000000000000000000000000000000000
-00000000000000000000052222222222222222222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222
-22222500000000000000000000000000000000060202226000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000005222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000000000000000522222
-22222222222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000
-00000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222222222
-22222222400000000000000000000000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222
-22222222222555555555555555555555555552222222222222222222222222222222222230000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000062222222222222222222222222222222222222222600000000000000000000000000000000002222222222222222222222
-22222222222225000000000000000000000000000000000602022230000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000004222222222222222222222222222222222222222222222222222222222500000000000000000000000000000000000000000000
-00622222222222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222
-22300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222
-22222222222222240000000000000000000000000000000000000000000000000000000000000000000000000000000000052222222222222222222222222222
-22222222222222222225555555555555555555555555532222222222222222222222222222222222600000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000062222222222222222222222222222222222222226000000000000000000000000000000000022222222222222
-22222222222222222222250000000000000000000000000000000006020222260000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000003222222222222222222222222222222222222222222222222222222220000000000000000000000000000000000000
-00000000000322222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222
-22222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222
-22222222222222222222224000000000000000000000000000000000000000000000000000000000000000000000000000000000000052222222222222222222
-22222222222222222222222222355555555555555555555555555522222222222222222222222222222222240000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000062222222222222222222222222222222222222260000000000000000000000000000000000222222
-22222222222222222222222222222500000000000000000000000000000000060202222300000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000003222222222222222222222222222222222222222222222222222222500000000000000000000000000000
-00000000000000000005222222222222222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222
-22222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222
-22222222222222222222222222222300000000000000000000000000000000000000000000000000000000000000000000000000000000000000042222222222
-22222222222222222222222222222222223555555555555555555555555555222222222222222222222222222222222600000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222600000000000000000000000000000000
-00222222222222222222222222222222222225000000000000000000000000000000000602022222600000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222222222220000000000000000000000
-00000000000000000000000000002222222222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222222
-22222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002
-22222222222222222222222222222222222230000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032
-22222222222222222222222222222222222222222255555555555555555555555555553222222222222222222222222222222240000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000052222222222222222222222222222222222226000000000000000000000000
-00000000002222222222222222222222222222222222250000000000000000000000000000000006020222223000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222500000000000000
-00000000000000000000000000000000000042222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000
-32222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000
-00000002222222222222222222222222222222222222600000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000062222222222222222222222222222222222222222222555555555555555555555555555532222222222222222222222222222222600000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000042222222222222222222222222222222222260000000000000000
-00000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222226000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000032222222222222222222222222222222222222222222222222226000000
-00000000000000000000000000000000000000000000522222222222222222222222222222222222222222222222222222222260000000000000000000000000
-00000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000
-00000000000000022222222222222222222222222222222222250000000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000052222222222222222222222222222222222222222235555555555555555555555555555522222222222222222222222222222230000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000032222222222222222222222222222222222600000000
-00000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222230000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000622222222222222222222222222222222222222222222222222
-40000000000000000000000000000000000000000000000000000222222222222222222222222222222222222222222222222222222222600000000000000000
-00000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000
-00000000000000000000000222222222222222222222222222222222224000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000042222222222222222222222222222222222222222555555555555555555555555555555222222222222222222222222222222500
-00000000000000000000000000000000000000000065332334560000000000000000000000000000000000000000622222222222222222222222222222222226
-00000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006020222222260000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000422222222222222222222222222222222222222222
-22222222600000000000000000000000000000000000000000000000000004222222222222222222222222222222222222222222222222222222226000000000
-00000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600
-00000000000000000000000000000002222222222222222222222222222222222300000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000022222222222222222222222222222222222222225555555555555555555555555555553222222222222222222222222
-22222000000000000000000000000000000000000000000053222222222235600000000000000000000000000000000000000522222222222222222222222222
-22222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222300000
-00000000000000000000000000000000000000000066666660000000000000000000000000000000000000000000000222222222222222222222222222222222
-22222222222222230000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222222222222260
-00000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222
-22222600000000000000000000000000000000022222222222222222222222222222222226000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000522222222222222222222222222222222222222255555555555555555555555555555532222222222222222
-22222222222240000000000000000000000000000000000000000063222222222222222460000000000000000000000000000000000000322222222222222222
-22222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222
-22260000000000000000000000000000000000000006553322222222223450000000000000000000000000000000000000000005222222222222222222222222
-22222222222222222222222600000000000000000000000000000000000000000000000000000032222222222222222222222222222222222222222222222222
-22222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222
-22222222222226000000000000000000000000000000000222222222222222222222222222222222400000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000322222222222222222222222222222222222223555555555555555555555555555555522222222
-22222222222222222222500000000000000000000000000000000000000006222222222222222222250000000000000000000000000000000000006222222222
-22222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006
-02022222222400000000000000000000000000000000000654222222222222222222225000000000000000000000000000000000000000002222222222222222
-22222222222222222222222222222230000000000000000000000000000000000000000000000000000000422222222222222222222222222222222222222222
-22222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222
-22222222222222222222260000000000000000000000000000000002222222222222222222222222222222226000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000006222222222222222222222222222222222222235555555555555555555555555555555
-22222222222222222222222222220000000000000000000000000000000000000000622222222222222222222236000000000000000000000000000000000004
-22222222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000
-00000006060022222222600000000000000000000000000000005422222222222222222222222222500000000000000000000000000000000000000042222222
-22222222222222222222222222222222222222500000000000000000000000000000000000000000000000000000006222222222222222222222222222222222
-22222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222
-22222222222222222222222222222600000000000000000000000000000000022222222222222222222222222222222500000000000000000000000000000000
-00000000000066555555560000000000000000000000000000000000000000000004222222222222222222222222222222222222555555555555555555555555
-55555555322222222222222222222222222300000000000000000000000000000000000000062222222222222222222222225000000000000000000000000000
-00000006222222222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000
-00000000000000060202222222224000000000000000000000000000054222222222222222222222222222222300000000000000000000000000000000000000
-62222222222222222222222222222222222222222222220000000000000000000000000000000000000000000000000000000003222222222222222222222222
-22222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000
-00062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222222220000000000000000000000000
-00000000000000000542222222222223500000000000000000000000000000000000000000062222222222222222222222222222222222225555555555555555
-55555555555555553222222222222222222222222224000000000000000000000000000000000000000322222222222222222222222224000000000000000000
-00000000000000004222222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000
-00000000000000000000000600002222222226000000000000000000000000542222222222222222222222222222222222360000000000000000000000000000
-00000000032222222222222222222222222222222222222222222400000000000000000000000000000000000000000000000000000000052222222222222222
-22222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000
-00000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222222222500000000000000000
-00000000000000000000006422222222222222222240000000000000000000000000000000000000000042222222222222222222222222222222222255555555
-55555555555555555555555532222222222222222222222222250000000000000000000000000000000000000052222222222222222222222222224000000000
-00000000000000000000000062222222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500
-00000000000000000000000000000006020222222222240000000000000000000006532222222222222222222222222222222222222200000000000000000000
-00000000000000000522222222222222222222222222222222222222222226000000000000000000000000000000000000000000000000000000000622222222
-22222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000
-00000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222222222222222226000000000
-00000000000000000000000000006422222222222222222222225000000000000000000000000000000000000000622222222222222222222222222222222223
-55555555555555555555555555555555522222222222222222222222222600000000000000000000000000000000000000222222222222222222222222222224
-00000000000000000000000000000000032222222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222
-22222500000000000000000000000000000000060000222222222260000000000000000006422222222222222222222222222222222222222222300000000000
-00000000000000000000000006222222222222222222222222222222222222222222300000000000000000000000000000000000000000000000000000000000
-42222222222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000
-00000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222222400
-00000000000000000000000000000000000522222222222222222222222224000000000000000000000000000000000000000422222222222222222222222222
-22222223555555555555555555555555555555555222222222222222222222222220000000000000000000000000000000000000052222222222222222222222
-22222222600000000000000000000000000000000522222222222222222222222222222600000000000000000000000000000000002222222222222222222222
-22222222222225000000000000000000000000000000000602022222222222400000000000000005322222222222222222222222222222222222222222222500
-00000000000000000000000000000000003222222222222222222222222222222222222222225000000000000000000000000000000000000000000000000000
-00000000522222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222
-22300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222
-22222500000000000000000000000000000000000632222222222222222222222222224000000000000000000000000000000000000006222222222222222222
-22222222222222255555555555555555555555555555555552222222222222222222222222300000000000000000000000000000000000000222222222222222
-22222222222222226000000000000000000000000000000006222222222222222222222222222226000000000000000000000000000000000022222222222222
-22222222222222222222250000000000000000000000000000000006000022222222222600000000000005322222222222222222222222222222222222222222
-22222200000000000000000000000000000000000042222222222222222222222222222222222222222200000000000000000000000000000006000000000000
-00000000000000000222222222222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222
-22222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222
-22222222222220000000000000000000000000000000000052222222222222222222222222222225000000000000000000000000000000000000003222222222
-22222222222222222222222555555555555555555555555555555555532222222222222222222222223000000000000000000000000000000000000052222222
-22222222222222222222222260000000000000000000000000000000003222222222222222222222222222260000000000000000000000000000000000222222
-22222222222222222222222222222500000000000000000000000000000000060202222222222224000000000005222222222222222222222222222222222222
-22222222222222500000000000000000000000000000000000522222222222222222222222222222222222222224000000000000000000000000000000050000
-00000000000000000000000004222222222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222
-22222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222
-22222222222222222222400000000000000000000000000000000005222222222222222222222222222222226000000000000000000000000000000000000052
-22222222222222222222222222222225555555555555555555555555555555555322222222222222222222222230000000000000000000000000000000000000
-42222222222222222222222222222222600000000000000000000000000000000042222222222222222222222222222600000000000000000000000000000000
-00222222222222222222222222222222222225000000000000000000000000000000000600002222222222226000000005222222222222222222222222222222
-22222222222222222222223000000000000000000000000000000000000222222222222222222222222222222222222222260000000000000000000000000000
-00030000000000000000000000000000052222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222222
-22222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002
-22222222222222222222222222225000000000000000000000000000000000422222222222222222222222222222222240000000000000000000000000000000
-00000002222222222222222222222222222222355555555555555555555555555555555553222222222222222222222222500000000000000000000000000000
-00000000222222222222222222222222222222226000000000000000000000000000000000522222222222222222222222222226000000000000000000000000
-00000000002222222222222222222222222222222222250000000000000000000000000000000006020222222222222240000005322222222222222222222222
-22222222222222222222222222222226000000000000000000000000000000000003222222222222222222222222222222222222223000000000000000000000
-00000000006260000000000000000000000000000022222222222222222222222222222222222222222222222222226000000000000000000000000000000000
-32222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000
-00000002222222222222222222222222222200000000000000000000000000000000002222222222222222222222222222222222260000000000000000000000
-00000000000000042222222222222222222222222222223555555555555555555555555555555555552222222222222222222222225000000000000000000000
-00000000000000062222222222222222222222222222222260000000000000000000000000000000006222222222222222222222222222260000000000000000
-00000000000000000022222222222222222222222222222222222500000000000000000000000000000000060000222222222222260006322222222222222222
-22222222222222222222222222222222222222260000000000000000000000000000000000032222222222222222222222222222222222222250000000000000
-00000000000000000052500000000000000000000000000000422222222222222222222222222222222222222222222222222260000000000000000000000000
-00000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000
-00000000000000022222222222222222222222222223000000000000000000000000000000000022222222222222222222222222222222222400000000000000
-00000000000000000000000622222222222222222222222222222235555555555555555555555555555555555522222222222222222222222250000000000000
-00000000000000000000000522222222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222600000000
-00000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222222222222406322222222222
-22222222222222222222222222222222222222222222222500000000000000000000000000000000000422222222222222222222222222222222222222000000
-00000000000000000000000000425000000000000000000000000000006222222222222222222222222222222222222222222222222222600000000000000000
-00000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000
-00000000000000000000000222222222222222222222222222250000000000000000000000000000000000222222222222222222222222222222222222600000
-00000000000000000000000000000000322222222222222222222222222222355555555555555555555555555555555555222222222222222222222222500000
-00000000000000000000000000000005222222222222222222222222222222226000000000000000000000000000000000032222222222222222222222222226
-00000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006000022222222222222422222
-22222222222222222222222222222222222222222222222222222225000000000000000000000000000000000005222222222222222222222222222222222222
-24000000000000000000000000000000003230000000000000000000000000000003222222222222222222222222222222222222222222222222226000000000
-00000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600
-00000000000000000000000000000002222222222222222222222222222500000000000000000000000000000000002222222222222222222222222222222222
-22500000000000000000000000000000000000004222222222222222222222222222225555555555555555555555555555555555553222222222222222222222
-22500000000000000000000000000000000000052222222222222222222222222222222260000000000000000000000000000000000322222222222222222222
-22222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222222222
-22222222222222222222222222222222222222222222222222222222222222250000000000000000000000000000000000052222222222222222222222222222
-22222222250000000000000000000000000000000022200000000000000000000000000000042222222222222222222222222222222222222222222222222260
-00000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222
-22222600000000000000000000000000000000022222222222222222222222222226000000000000000000000000000000000022222222222222222222222222
-22222222223000000000000000000000000000000000000062222222222222222222222222222255555555555555555555555555555555555532222222222222
-22222222225000000000000000000000000000000000000422222222222222222222222222222222600000000000000000000000000000000003222222222222
-22222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000600002222
-22222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000000000000622222222222222222222
-22222222222222222000000000000000000000000000000005222600000000000000000000000000000622222222222222222222222222222222222222222222
-22222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222
-22222222222226000000000000000000000000000000000222222222222222222222222222200000000000000000000000000000000000222222222222222222
-22222222222222222226000000000000000000000000000000000000032222222222222222222222222222555555555555555555555555555555555555322222
-22222222222222222250000000000000000000000000000000000003222222222222222222222222222222225000000000000000000000000000000000032222
-22222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006
-02022222222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000006222222222222
-22222222222222222222222240000000000000000000000000000000042226000000000000000000000000000000322222222222222222222222222222222222
-22222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222
-22222222222222222222260000000000000000000000000000000002222222222222222222222222222000000000000000000000000000000000002222222222
-22222222222222222222222222250000000000000000000000000000000000000422222222222222222222222222225555555555555555555555555555555555
-55322222222222222222222222500000000000000000000000000000000000052222222222222222222222222222222250000000000000000000000000000000
-00032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000
-00000006000022222222222222222222222222222222222222222222222222222222222222222222222222200000000000000000000000000000000000062222
-22222222222222222222222222222222500000000000000000000000000000000322250000000000000000000000000000005222222222222222222222222222
-22222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222
-22222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022
-22222222222222222222222222222222222400000000000000000000000000000000000005222222222222222222222222222355555555555555555555555555
-55555555555222222222222222222222225000000000000000000000000000000000000522222222222222222222222222222222500000000000000000000000
-00000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000
-00000000000000060202222222222222222222222222222222222222222222222222222222222222222222222222224000000000000000000000000000000000
-00062222222222222222222222222222222222220000000000000000000000000000000002222400000000000000000000000000000002222222222222222222
-22222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000
-00062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000
-00000022222222222222222222222222222222222223000000000000000000000000000000000000002222222222222222222222222223555555555555555555
-55555555555555555552222222222222222222222240000000000000000000000000000000000005222222222222222222222222222222225000000000000000
-00000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000
-00000000000000000000000600042222222222222222222222222222222222222222222222222222222222222222222222222260000000000000000000000000
-00000000000622222222222222222222222222222222222400000000000000000000000000000000522223000000000000000000000000000000042222222222
-22222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000
-00000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000
-00000000000000222222222222222222222222222222222222220000000000000000000000000000000000000032222222222222222222222222235555555555
-55555555555555555555555555522222222222222222222222300000000000000000000000000000000000052222222222222222222222222222222250000000
-00000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500
-00000000000000000000000000000006020222222222222222222222222222222222222222222222222222222222222222222222222224000000000000000000
-00000000000000000006222222222222222222222222222222222225000000000000000000000000000000004222220000000000000000000000000000000522
-22222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000
-00000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000
-00000000000000000000002222222222222222222222222222222222222260000000000000000000000000000000000000422222222222222222222222222355
-55555555555555555555555555555555555222222222222222222222223000000000000000000000000000000000000622222222222222222222222222222222
-50000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222
-22222500000000000000000000000000000000060202222222222222222222222222222222222222222222222222222222222222222222222222300000000000
-00000000000000000000000000062222222222222222222222222222222222200000000000000000000000000000000032222260000000000000000000000000
-00000022222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000
-00000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000
-00000000000000000000000000000022222222222222222222222222222222222222500000000000000000000000000000000000005222222222222222222222
-22222355555555555555555555555555555555555552222222222222222222222220000000000000000000000000000000000000222222222222222222222222
-22222222500000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222
-22222222222225000000000000000000000000000000000602022222222222222222222222222222222222222222222222222222222222222222222222226000
-00000000000000000000000000000000000622222222222222222222222222222222224000000000000000000000000000000000222222500000000000000000
-00000000000000422222222222222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222
-22300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222
-22300000000000000000000000000000000000222222222222222222222222222222222222224000000000000000000000000000000000000062222222222222
-22222222222225555555555555555555555555555555555555522222222222222222222222200000000000000000000000000000000000003222222222222222
-22222222222222225000000000000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222
-22222222222222222222250000000000000000000000000000000006020222222222222222222222222222222222222222222222222222222222222222222222
-22300000000000000000000000000000000000000005222222222222222222222222222222222250000000000000000000000000000000052222224000000000
-00000000000000000000005222222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222
-22222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222
-22222222223000000000000000000000000000000000002222222222222222222222222222222222222230000000000000000000000000000000000000022222
-22222222222222222222255555555555555555555555555555555555555322222222222222222222222600000000000000000000000000000000000052222222
-22222222222222222222222250000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222
-22222222222222222222222222222500000000000000000000000000000000060202222222222222222222222222222222222222222222222222222222222222
-22222222240000000000000000000000000000000000000000052222222222222222222222222222222222000000000000000000000000000000000422222230
-00000000000000000000000000000002222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222
-22222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222
-22222222222222222230000000000000000000000000000000000022222222222222222222222222222222222222300000000000000000000000000000000000
-00032222222222222222222222222555555555555555555555555555555555555553222222222222222222222225000000000000000000000000000000000000
-62222222222222222222222222222222500000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000
-00222222222222222222222222222222222225000000000000000000000000000000000602022222222222222222222222222222222222222222222222222222
-22222222222222236000000000000000000000000000000000000000000422222222222222222222222222222222240000000000000000000000000000000003
-22222220000000000000000000000000000000042222222222222222222222222222222222222222222222600000000000000000000000000000000032222222
-22222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002
-22222222222222222222222222300000000000000000000000000000000000222222222222222222222222222222222222222000000000000000000000000000
-00000000000522222222222222222222222225555555555555555555555555555555555555532222222222222222222222240000000000000000000000000000
-00000000042222222222222222222222222222225000000000000000000000000000000000032222222222222222222222222226000000000000000000000000
-00000000002222222222222222222222222222222222250000000000000000000000000000000006020222222222222222222222222222222222222222222222
-22222222222222222222246000000000000000000000000000000000000000000003222222222222222222222222222222222500000000000000000000000000
-00000062222222250000000000000000000000000000000622222222222222222222222222222222222222222222226000000000000000000000000000000000
-32222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000
-00000002222222222222222222222222223000000000000000000000000000000000002222222222222222222222222222222222222220000000000000000000
-00000000000000000005222222222222222222222222255555555555555555555555555555555555555322222222222222222222222300000000000000000000
-00000000000000000622222222222222222222222222222250000000000000000000000000000000000322222222222222222222222222260000000000000000
-00000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222222222222222222222222222222222
-22222222222222222222222222450000000000000000000000000000000000000000000000022222222222222222222222222222222220000000000000000000
-00000000000000522222222400000000000000000000000000000000322222222222222222222222222222222222222222222260000000000000000000000000
-00000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000
-00000000000000022222222222222222222222222230000000000000000000000000000000000022222222222222222222222222222222222222260000000000
-00000000000000000000000000062222222222222222222222222555555555555555555555555555555555555553222222222222222222222222000000000000
-00000000000000000000000000522222222222222222222222222222500000000000000000000000000000000003222222222222222222222222222600000000
-00000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222222222222222222222222222
-22222222222222222222222222222234500000000000000000000000000000000000000000000000006222222222222222222222222222222222400000000000
-00000000000000000000004222222223000000000000000000000000000000005222222222222222222222222222222222222222222222600000000000000000
-00000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000
-00000000000000000000000222222222222222222222222222300000000000000000000000000000000000222222222222222222222222222222222222222600
-00000000000000000000000000000000000022222222222222222222222235555555555555555555555555555555555555532222222222222222222222225000
-00000000000000000000000000000000000422222222222222222222222222225000000000000000000000000000000000032222222222222222222222222226
-00000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006020222222222222222222222
-22222222222222222222222222222222234560000000000000000000000000000000000000000000000000000052222222222222222222222222222222225000
-00000000000000000000000000000032222222220000000000000000000000000000000062222222222222222222222222222222222222222222226000000000
-00000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600
-00000000000000000000000000000002222222222222222222222222223000000000000000000000000000000000002222222222222222222222222222222222
-22222600000000000000000000000000000000000000222222222222222222222222355555555555555555555555555555555555555522222222222222222222
-22224000000000000000000000000000000000000000522222222222222222222222222250000000000000000000000000000000000322222222222222222222
-22222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222222222
-22222222222222222222222222222222222234560000000000000000000000000000000000000000000000000000000000322222222222222222222222222222
-22220000000000000000000000000000000006222222222260000000000000000000000000000000032222222222222222222222222222222222222222222260
-00000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222
-22222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022222222222222222222222222
-22222222222226000000000000000000000000000000000000003222222222222222222222223555555555555555555555555555555555555555222222222222
-22222222222220000000000000000000000000000000000000000632222222222222222222222222400000000000000000000000000000000003222222222222
-22222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222
-22222222222222222222222222222222222222345660000000000000000000000000000000000000000000000000000000000000002222222222222222222222
-22222222222400000000000000000000000000000000052222222222500000000000000000000000000000000522222222222222222222222222222222222222
-22222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222
-22222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000000000222222222222222222
-22222222222222222222250000000000000000000000000000000000000032222222222222222222222235555555555555555555555555555555555555552222
-22222222222222222222250000000000000000000000000000000000000000053222222222222222222222223000000000000000000000000000000000032222
-22222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006
-02022222222222222222222222222222222222222345600000000000000000000000000000000000000000000000000000000000000000000522222222222222
-22222222222222222225000000000000000000000000000000000422222222223000000000000000000000000000000000222222222222222222222222222222
-22222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222
-22222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000000000000000002222222222
-22222222222222222222222222222500000000000000000000000000000000000000522222222222222222222222355555555555555555555555555555555555
-55552222222222222222222222222300000000000000000000000000000000000000000005422222222222222222222230000000000000000000000000000000
-00032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000
-00000006020222222222222222222222222222222222224500000000000000000000000000000000000000000000000000000000000000000000000003222222
-22222222222222222222222222200000000000000000000000000000000002222222222220000000000000000000000000000000004222222222222222222222
-22222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222
-22222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022
-22222222222222222222222222222222222225000000000000000000000000000000000000005222222222222222222222223555555555555555555555555555
-55555555555522222222222222222222222222600000000000000000000000000000000000000000000055322222222222222222300000000000000000000000
-00000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000
-00000000000000060202222222222222222222222222222222235000000000000000000000000000000000000000000000000000000000000000000000000000
-62222222222222222222222222222222224000000000000000000000000000000000522222222222250000000000000000000000000000000052222222222222
-22222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000
-00062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000
-00000022222222222222222222222222222222222222250000000000000000000000000000000000000052222222222222222222222235555555555555555555
-55555555555555555555222222222222222222222222224000000000000000000000000000000000000000000000000006555333322222223000000000000000
-00000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000
-00000000000000000000000602022222222222222222222222222222236000000000000000000000000000000000000000000000000000000000000000000000
-00000000422222222222222222222222222222222250000000000000000000000000000000004222222222222400000000000000000000000000000000022222
-22222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000
-00000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000
-00000000000000222222222222222222222222222222222222222500000000000000000000000000000000000000622222222222222222222222355555555555
-55555555555555555555555555552222222222222222222222222226000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500
-00000000000000000000000000000006030522222222222222222222222222246000000000000000000000000000000000000000000000000000000000000000
-00000000000000062222222222222222222222222222222222000000000000000000000000000000000032222222222223000000000000000000000000000000
-00042222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000
-00000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000
-00000000000000000000002222222222222222222222222222222222222225000000000000000000000000000000000000006222222222222222222222223555
-55555555555555555555555555555555555522222222222222222222222222230000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222
-22222500000000000000000000000000000000060202222222222222222222222222236000000000000000000000000000000000000000000000000000000000
-00000000000000000000000322222222222222222222222222222222240000000000000000000000000000000006222222222222226000000000000000000000
-00000000000522222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000
-00000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000
-00000000000000000000000000000022222222222222222222222222222222222222250000000000000000000000000000000000000062222222222222222222
-22223555555555555555555555555555555555555555222222222222222222222222222250000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222
-22222222222225000000000000000000000000000000000600002222222222222222222222225000000000000000000000000000000000000000000000000000
-00000000000000000000000000000052222222222222222222222222222222222500000000000000000000000000000000052222222222222250000000000000
-00000000000000000000322222222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222
-22300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222
-22300000000000000000000000000000000000222222222222222222222222222222222222222500000000000000000000000000000000000000022222222222
-22222222222235555555555555555555555555555555555555552222222222222222222222222222300000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222
-22222222222222222222250000000000000000000000000000000006020222222222222222222222224000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000222222222222222222222222222222222220000000000000000000000000000000000322222222222222400000
-00000000000000000000000000004222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222
-22222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222
-22222222223000000000000000000000000000000000002222222222222222222222222222222222222225000000000000000000000000000000000000000222
-22222222222222222222355555555555555555555555555555555555555522222222222222222222222222222400000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222
-22222222222222222222222222222500000000000000000000000000000000060000222222222222222222222500000000000000000000000000000000000000
-00000000000000000000000000000000000000000000032222222222222222222222222222222222400000000000000000000000000000000002222222222222
-22200000000000000000000000000000000062222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222
-22222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222
-22222222222222222230000000000000000000000000000000000022222222222222222222222222222222222222250000000000000000000000000000000000
-00000222222222222222222222223555555555555555555555555555555555555555222222222222222222222222222222500000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000
-00222222222222222222222222222222222225000000000000000000000000000000000602022222222222222222222300000000000000000000000000000000
-00000000000000000000000000000000000000000000000000005222222222222222222222222222222222226000000000000000000000000000000000522222
-22222222222500000000000000000000000000000000032222222222222222222222222222222222222222600000000000000000000000000000000032222222
-22222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002
-22222222222222222222222222300000000000000000000000000000000000222222222222222222222222222222222222222400000000000000000000000000
-00000000000002222222222222222222222235555555555555555555555555555555555555552222222222222222222222222222222600000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000032222222222222222222222222226000000000000000000000000
-00000000002222222222222222222222222222222222250000000000000000000000000000000006000022222222222222222240000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000522222222222222222222222222222222222300000000000000000000000000000000
-00422222222222222224000000000000000000000000000000000522222222222222222222222222222222222222226000000000000000000000000000000000
-32222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000
-00000002222222222222222222222222223000000000000000000000000000000000002222222222222222222222222222222222222223000000000000000000
-00000000000000000000022222222222222222222222355555555555555555555555555555555555555522222222222222222222222222222222600000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000322222222222222222222222222260000000000000000
-00000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222222222222224000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222224000000000000000000000000
-00000000002222222222222222220000000000000000000000000000000006222222222222222222222222222222222222222260000000000000000000000000
-00000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000
-00000000000000022222222222222222222222222230000000000000000000000000000000000022222222222222222222222222222222222222230000000000
-00000000000000000000000000000222222222222222222222223555555555555555555555555555555555555555222222222222222222222222222222223000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003222222222222222222222222222600000000
-00000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000600002222222222222222500000000000
-00000000000000000000000000000000000000000000000000000000000000000000000006222222222222222222222222222222222222260000000000000000
-00000000000000000522222222222222222260000000000000000000000000000000003222222222222222222222222222222222222222600000000000000000
-00000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000
-00000000000000000000000222222222222222222222222222300000000000000000000000000000000000222222222222222222222222222222222222222300
-00000000000000000000000000000000000002222222222222222222222235555555555555555555555555555555555555552222222222222222222222222222
-22222300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032222222222222222222222222226
-00000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006020222222222222222240000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000622222222222222222222222222222222222223000000000
-00000000000000000000000004222222222222222222400000000000000000000000000000000052222222222222222222222222222222222222226000000000
-00000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600
-00000000000000000000000000000002222222222222222222222222223000000000000000000000000000000000002222222222222222222222222222222222
-22222300000000000000000000000000000000000000022222222222222222222222355555555555555555555555555555555555555522222222222222222222
-22222222222222260000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000322222222222222222222
-22222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000000000060000222222222222
-22300000000000000000000000000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222240
-00000000000000000000000000000000032222222222222222223000000000000000000000000000000000022222222222222222222222222222222222222260
-00000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222
-22222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022222222222222222222222222
-22222222222223000000000000000000000000000000000000000222222222222222222222223555555555555555555555555555555555555555222222222222
-22222222222222222222222250000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003222222222222
-22222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222
-22222222226000000000000000000000000000000000000000000000000000000000000000000000000000000000005222222222222222222222222222222222
-22222260000000000000000000000000000000006222222222222222222226000000000000000000000000000000000422222222222222222222222222222222
-22222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222
-22222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000000000222222222222222222
-22222222222222222222240000000000000000000000000000000000000002222222222222222222222235555555555555555555555555555555555555552222
-22222222222222222222222222222222240000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032222
-22222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006
-00002222222222222500000000000000000000000000000000000000000000000000000000000000000000000000000000000422222222222222222222222222
-22222222222223000000000000000000000000000000000052222222222222222222240000000000000000000000000000000005222222222222222222222222
-22222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222
-22222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000000000000000002222222222
-22222222222222222222222222222500000000000000000000000000000000000000022222222222222222222222355555555555555555555555555555555555
-55552222222222222222222222222222222222222236000000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000
-00000006020222222222222230000000000000000000000000000000000000000000000000000000000000000000000000000000000532222222222222222222
-22222222222222222222240000000000000000000000000000000000322222222222222222222300000000000000000000000000000000002222222222222222
-22222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222
-22222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022
-22222222222222222222222222222222222225000000000000000000000000000000000000000222222222222222222222223555555555555555555555555555
-55555555555522222222222222222222222222222222222222225000000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000
-00000000000000060000222222222222500000000000000000000000000000000000000000000000000000000000000000000000000000000632222222222222
-22222222222222222222222222222600000000000000000000000000000000002222222222222222222222600000000000000000000000000000000042222222
-22222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000
-00062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000
-00000022222222222222222222222222222222222222250000000000000000000000000000000000000002222222222222222222222235555555555555555555
-55555555555555555555222222222222222222222222222222222222222223500000000000000000000000000000000000000000000000000000000000000000
-00000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000
-00000000000000000000000602022222222222230000000000000000000000000000000000000000000000000000000000000000000000000000000642222222
-22222222222222222222222222222222222230000000000000000000000000000000000522222222222222222222225000000000000000000000000000000000
-62222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000
-00000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000
-00000000000000222222222222222222222222222222222222222500000000000000000000000000000000000000022222222222222222222222355555555555
-55555555555555555555555555552222222222222222222222222222222222222222222350000000000000000000000000000000000000000000000000000000
-00000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500
-00000000000000000000000000000006000022222222222500000000000000000000000000000000000000000000000000000000000000000000000000000532
-22222222222222222222222222222222222222222222400000000000000000000000000000000004222222222222222222222230000000000000000000000000
-00000000032222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000
-00000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000
-00000000000000000000002222222222222222222222222222222222222225000000000000000000000000000000000000006222222222222222222222223555
-55555555555555555555555555555555555522222222222222222222222222222222222222222222235000000000000000000000000000000000000000000000
-00000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222
-22222500000000000000000000000000000000060600222222222220000000000000000000000000000000000000000000000000000000000000000000000000
-00653222222222222222222222222222222222222222222222226000000000000000000000000000000000022222222222222222222222260000000000000000
-00000000000000000422222222222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000
-00000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000
-00000000000000000000000000000022222222222222222222222222222222222222250000000000000000000000000000000000000062222222222222222222
-22223555555555555555555555555555555555555555222222222222222222222222222222222222222222222222460000000000000000000000000000000000
-00000000000000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222
-22222222222225000000000000000000000000000000000600002222222222400000000000000000000000000000000000000000000000000000000000000000
-00000006532222222222222222222222222222222222222222222222222300000000000000000000000000000000006222222222222222222222222500000000
-00000000000000000000000006222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222
-22300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222
-22300000000000000000000000000000000000222222222222222222222222222222222222222500000000000000000000000000000000000000622222222222
-22222222222235555555555555555555555555555555555555552222222222222222222222222222222222222222222222222235600000000000000000000000
-00000000000000000000000000000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222
-22222222222222222222250000000000000000000000000000000006000022222222226000000000000000000000000000000000000000000000000000000000
-00000000000054322222222222222222222222222222222222222222222222222224000000000000000000000000000000000042222222222222222222222224
-00000000000000000000000000000000003222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222
-22222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222
-22222222223000000000000000000000000000000000002222222222222222222222222222222222222225000000000000000000000000000000000000006222
-22222222222222222222355555555555555555555555555555555555555522222222222222222222222222222222222222222222222222222345000000000000
-00000000000000000000000000000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222
-22222222222222222222222222222500000000000000000000000000000000060000222222222300000000000000000000000000000000000000000000000000
-00000000000000006532222222222222222222222222222222222222222222222222222222260000000000000000000000000000000000322222222222222222
-22222222000000000000000000000000000000000052222222222222222222222222222222222260000000000000000000000000000000003222222222222222
-22222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222
-22222222222222222230000000000000000000000000000000000022222222222222222222222222222222222222250000000000000000000000000000000000
-00005222222222222222222222223555555555555555555555555555555555555555222222222222222222222222222222222222222222222222222222222345
-60000000000000000000000000000000000000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000
-00222222222222222222222222222222222225000000000000000000000000000000000600002222222224000000000000000000000000000000000000000000
-00000000000000000000654222222222222222222222222222222222222222222222222222222222223000000000000000000000000000000000062222222222
-22222222222222225000000000000000000000000000000000622222222222222222222222222222222222600000000000000000000000000000000032222222
-22222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002
-22222222222222222222222222300000000000000000000000000000000000222222222222222222222222222222222222222500000000000000000000000000
-00000000000052222222222222222222222235555555555555555555555555555555555555532222222222222222222222222222222222222222222222222222
-22222222223456600000000000000000000000000000000000000000000000000000000000032222222222222222222222222226000000000000000000000000
-00000000002222222222222222222222222222222222250000000000000000000000000000000006000022222222250000000000000000000000000000000000
-00000000000000000000000065422222222222222222222222222222222222222222222222222222222222222240000000000000000000000000000000000522
-22222222222222222222222240000000000000000000000000000000000322222222222222222222222222222222226000000000000000000000000000000000
-32222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000
-00000002222222222222222222222222223000000000000000000000000000000000002222222222222222222222222222222222222226000000000000000000
-00000000000000000000422222222222222222222222255555555555555555555555555555555555555322222222222222222222222222222222222222222222
-22222222222222222222222233455566660000000000000060000000000000000000000000000000000322222222222222222222222222260000000000000000
-00000000000000000022222222222222222222222222222222222500000000000000000000000000000000060000222222222000000000000000000000000000
-00000000000000000000000000006542222222222222222222222222222222222222222222222222222222222222222222600000000000000000000000000000
-00000322222222222222222222222222200000000000000000000000000000000005222222222222222222222222222222222260000000000000000000000000
-00000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000
-00000000000000022222222222222222222222222230000000000000000000000000000000000022222222222222222222222222222222222222260000000000
-00000000000000000000000000003222222222222222222222222555555555555555555555555555555555555553222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222600000000
-00000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000600002222222230000000000000000000
-00000000000000000000000000000000654322222222222222222222222222222222222222222222222222222222222222222222230000000000000000000000
-00000000000002222222222222222222222222222500000000000000000000000000000000002222222222222222222222222222222222600000000000000000
-00000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000
-00000000000000000000000222222222222222222222222222300000000000000000000000000000000000222222222222222222222222222222222222222600
-00000000000000000000000000000000000022222222222222222222222225555555555555555555555555555555555555532222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222226
-00000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006000022222222400000000000
-00000000000000000000000000000000000006432222222222222222222222222222222222222222222222222222222222222222222222222400000000000000
-00000000000000000000522222222222222222222222222224000000000000000000000000000000000042222222222222222222222222222222226000000000
-00000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600
-00000000000000000000000000000002222222222222222222222222223000000000000000000000000000000000002222222222222222222222222222222222
-22222000000000000000000000000000000000000000222222222222222222222222255555555555555555555555555555555555555322222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222
-22222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000000000060000222222225000
-00000000000000000000000000000000000000000065322222222222222222222222222222222222222222222222222222222222222222222222222226000000
-00000000000000000000000000004222222222222222222222222222220000000000000000000000000000000000522222222222222222222222222222222260
-00000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222
-22222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022222222222222222222222222
-22222222222230000000000000000000000000000000000000062222222222222222222222222555555555555555555555555555555555555553222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222
-22222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000600002222
-22225000000000000000000000000000000000000000000064222222222222222222222222222222222222222222222222222222222222222222222222222222
-30000000000000000000000000000000000022222222222222222222222222222250000000000000000000000000000000000222222222222222222222222222
-22222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222
-22222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000000000222222222222222222
-22222222222222222222300000000000000000000000000000000000000522222222222222222222222225555555555555555555555555555555555555532222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222
-22222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006
-00002222222260000000000000000000000000000000000000000004222222222222222222222222222222222222222222222222222222222222222222222222
-22222222400000000000000000000000000000000006222222222222222222222222222222400000000000000000000000000000000004222222222222222222
-22222222222222600000000000000000000000000000000032222222222222222222222222222222224000000000000000000000000000000006222222222222
-22222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000000000000000002222222222
-22222222222222222222222222225000000000000000000000000000000000000005222222222222222222222222255555555555555555555555555555555555
-55522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000
-00032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000
-00000006000022222222000000000000000000000000000000000000000006222222222222222222222222222222222222222222222222222222222222222222
-22222222222222226000000000000000000000000000000000042222222222222222222222222222223000000000000000000000000000000000062222222222
-22222222222222222222226000000000000000000000000000000000322222222222222222222222222222222250000000000000000000000000000000062222
-22222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022
-22222222222222222222222222222222222250000000000000000000000000000000000000032222222222222222222222222355555555555555555555555555
-55555555555222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222260000000000000000000000
-00000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000
-00000000000000060000222222220000000000000000000000000000000000000000522222222222222222222222222222222222222222222222222222222222
-22222222222222222222222300000000000000000000000000000000000322222222222222222222222222222226000000000000000000000000000000000032
-22222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222500000000000000000000000000000
-00062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000
-00000022222222222222222222222222222222222222600000000000000000000000000000000000000222222222222222222222222223555555555555555555
-55555555555555555552222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222600000000000000
-00000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222260000000000
-00000000000000000000000600002222222200000000000000000000000000000000000000062222222222222222222222222222222222222222222222222222
-22222222222222222222222222222225000000000000000000000000000000000062222222222222222222222222222222240000000000000000000000000000
-00000042222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222225000000000000000000000
-00000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000
-00000000000000222222222222222222222222222222222222220000000000000000000000000000000000000062222222222222222222222222235555555555
-55555555555555555555555555522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222226000000
-00000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222600
-00000000000000000000000000000006000022222222000000000000000000000000000000000000000322222222222222222222222222222222222222222222
-22222222222222222222222222222222222222260000000000000000000000000000000000522222222222222222222222222222222300000000000000000000
-00000000000000622222222222222222222222222222226000000000000000000000000000000000322222222222222222222222222222222250000000000000
-00000000000000000006222222222222222222222222222222222000000000000000000000000000000000022222222222222222222222222230000000000000
-00000000000000000000002222222222222222222222222222222222222400000000000000000000000000000000000000522222222222222222222222222355
-55555555555555555555555555555555555222222222222222222222222222222222222222233222222222222222222222222222222222222222222222222222
-20000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222
-22222600000000000000000000000000000000060000222222220000000000000000000000000000000000000052222222222222222222222222222222222222
-22222222222222222222222222222222222222222222223000000000000000000000000000000000004222222222222222222222222222222222600000000000
-00000000000000000000000322222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222500000
-00000000000000000000000000062222222222222222222222222222222220000000000000000000000000000000000222222222222222222222222222300000
-00000000000000000000000000000022222222222222222222222222222222222225000000000000000000000000000000000000004222222222222222222222
-22222355555555555555555555555555555555555552222222222222222222222222222222222222222505222222222222222222222222222222222222222222
-22222222200000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222
-22222222222226000000000000000000000000000000000600002222222200000000000000000000000000000000000000322222222222222222222222222222
-22222222222222222222222222222222222222222222222222222250000000000000000000000000000000000022222222222222222222222222222222225000
-00000000000000000000000000000005222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222
-22500000000000000000000000000000000622222222222222222222222222222222200000000000000000000000000000000002222222222222222222222222
-22300000000000000000000000000000000000222222222222222222222222222222222222200000000000000000000000000000000000000032222222222222
-22222222222222555555555555555555555555555555555555322222222222222222222222222222222222222230006322222222222222222222222222222222
-22222222222222222000000000000000000000000000000000032222222222222222222222222226000000000000000000000000000000000042222222222222
-22222222222222222222200000000000000000000000000000000006020222222222000000000000000000000000000000000000002222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222600000000000000000000000000000000005222222222222222222222222222222
-22223000000000000000000000000000000000062222222222222222222222222222226000000000000000000000000000000000322222222222222222222222
-22222222226000000000000000000000000000000006222222222222222222222222222222222000000000000000000000000000000000022222222222222222
-22222222223000000000000000000000000000000000002222222222222222222222222222222222224000000000000000000000000000000000000000222222
-22222222222222222222225555555555555555555555555555555555553222222222222222222222222222222222222222600000522222222222222222222222
-22222222222222222222222230000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000052222
-22222222222222222222222222222000000000000000000000000000000000060000222222220000000000000000000000000000000000000622222222222222
-22222222222222222222222222222222222222222222222222222222222222222222230000000000000000000000000000000000042222222222222222222222
-22222222222226000000000000000000000000000000000042222222222222222222222222222260000000000000000000000000000000003222222222222222
-22222222222222222260000000000000000000000000000000005222222222222222222222222222222230000000000000000000000000000000000222222222
-22222222222222222230000000000000000000000000000000000022222222222222222222222222222222222260000000000000000000000000000000000000
-05222222222222222222222222222255555555555555555555555555555555555532222222222222222222222222222222222222250000000042222222222222
-22222222222222222222222222222222400000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000
-00005222222222222222222222222222222230000000000000000000000000000000000602022222222200000000000000000000000000000000000006222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000000000000222222222222222
-22222222222222222222250000000000000000000000000000000000522222222222222222222222222222600000000000000000000000000000000062222222
-22222222222222222222222222000000000000000000000000000000000005222222222222222222222222222222300000000000000000000000000000000002
-22222222222222222222222222300000000000000000000000000000000000422222222222222222222222222222222224000000000000000000000000000000
-00000000042222222222222222222222222222555555555555555555555555555555555555222222222222222222222222222222222222223000000000063222
-22222222222222222222222222222222222222225000000000000000000000000000000000032222222222222222222222222226000000000000000000000000
-00000000000006322222222222222222222222222222400000000000000000000000000000000006000022222222600000000000000000000000000000000000
-06222222222222222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000062222222
-22222222222222222222222222222400000000000000000000000000000000000222222222222222222222222222226000000000000000000000000000000000
-06322222222222222222222222222222230000000000000000000000000000000000006322222222222222222222222222224000000000000000000000000000
-00000002222222222222222222222222223000000000000000000000000000000000000422222222222222222222222222222222260000000000000000000000
-00000000000000000222222222222222222222222222223555555555555555555555555555555555552222222222222222222222222222222222222250000000
-00000532222222222222222222222222222222222222222260000000000000000000000000000000000322222222222222222222222222260000000000000000
-00000000000000000000000422222222222222222222222222225000000000000000000000000000000000060202222222226000000000000000000000000000
-00000000002222222222222222222222222222222222222222222222222222222222222222222222222222222222300000000000000000000000000000000000
-42222222222222222222222222222222222222000000000000000000000000000000000004222222222222222222222222222260000000000000000000000000
-00000000000422222222222222222222222222222400000000000000000000000000000000000000422222222222222222222222222250000000000000000000
-00000000000000022222222222222222222222222230000000000000000000000000000000000000422222222222222222222222222222225000000000000000
-00000000000000000000000052222222222222222222222222222235555555555555555555555555555555555522222222222222222222222222222222222223
-00000000000000053222222222222222222222222222222222222222000000000000000000000000000000000003222222222222222222222222222600000000
-00000000000000000000000000000000522222222222222222222222222260000000000000000000000000000000000602022222222250000000000000000000
-00000000000000000032222222222222222222222222222222222222222222222222222222222222222222222222222222225000000000000000000000000000
-00000000322222222222222222222222222222222222225000000000000000000000000000000000052222222222222222222222222222600000000000000000
-00000000000000000000522222222222222222222222222225000000000000000000000000000000000000000522222222222222222222222222600000000000
-00000000000000000000006222222222222222222222222222300000000000000000000000000000000000000422222222222222222222222222222300000000
-00000000000000000000000000000000422222222222222222222222222222355555555555555555555555555555555555222222222222222222222222222222
-22222226000000000000000005222222222222222222222222222222222222240000000000000000000000000000000000032222222222222222222222222226
-00000000000000000000000000000000000000000042222222222222222222222223000000000000000000000000000000000006020222222222500000000000
-00000000000000000000000000422222222222222222222222222222222222222222222224642222222222222222222222222222222260000000000000000000
-00000000000000062222222222222222222222222222222222222240000000000000000000000000000000000022222222222222222222222222226000000000
-00000000000000000000000000000042222222222222222222222222200000000000000000000000000000000000000000042222222222222222222222220000
-00000000000000000000000000000062222222222222222222222222223000000000000000000000000000000000000000522222222222222222222222222220
-00000000000000000000000000000000000000002222222222222222222222222222222555555555555555555555555555555555532222222222222222222222
-22222222222222500000000000000000000532222222222222222222222222222222222600000000000000000000000000000000000322222222222222222222
-22222226000000000000000000000000000000000000000000063222222222222222222222260000000000000000000000000000000000060202222222223000
-00000000000000000000000000000000006222222222222222222222222222222222222222222225000622222222222222222222222222222223000000000000
-00000000000000000000000522222222222222222222222222222222222222200000000000000000000000000000000000422222222222222222222222222260
-00000000000000000000000000000000000000063222222222222222222222224000000000000000000000000000000000000000000063222222222222222222
-22240000000000000000000000000000000000622222222222222222222222222230000000000000000000000000000000000000000522222222222222222222
-22222260000000000000000000000000000000000000000522222222222222222222222222222225555555555555555555555555555555555322222222222222
-22222222222222222222230000000000000000000000053222222222222222222222222222222240000000000000000000000000000000000002222222222222
-22222222222222200000000000000000000000000000000000000000000005322222222222222222224000000000000000000000000000000000000502022222
-22222000000000000000000000000000000000000004222222222222222222222222222222222222222225000000422222222222222222222222222222250000
-00000000000000000000000000000004222222222222222222222222222222222222222500000000000000000000000000000000006222222222222222222222
-22222200000000000000000000000000000000000000000005322222222222222222222200000000000000000000000000000000000000000000006322222222
-22222222222000000000000000000000000000000000006222222222222222222222222222300000000000000000000000000000000000000000632222222222
-22222222222236000000000000000000000000000000000000000004222222222222222222222222222222255555555555555555555555555555555553222222
-22222222222222222222222222222500000000000000000000000006422222222222222222222222222223000000000000000000000000000000000000022222
-22222222222222222222222000000000000000000000000000000000000000000000000532222222222222222300000000000000000000000000000000000005
-02022222222226000000000000000000000000000000000000003222222222222222222222222222222222222235000000006222222222222222222222222222
-22260000000000000000000000000000000000022222222222222222222222222222222222222224000000000000000000000000000000000003222222222222
-22222222222222000000000000000000000000000000000000000000000532222222222222222226000000000000000000000000000000000000000000000000
-64222222222222222250000000000000000000000000000000000062222222222222222222222222223000000000000000000000000000000000000000000052
-22222222222222222224000000000000000000000000000000000000000000622222222222222222222222222222222555555555555555555555555555555555
-52222222222222222222222222222222222230000000000000000000000000000054222222222222222222222222300000000000000000000000000000000000
-00022222222222222222222222222220000000000000000000000000000000000000000000000000064322222222222240000000000000000000000000000000
-00000005020222222222250000000000000000000000000000000000000062222222222222222222222222222222222246000000000004222222222222222222
-22222222223000000000000000000000000000000000005222222222222222222222222222222222222222220000000000000000000000000000000000052222
-22222222222222222222220000000000000000000000000000000000000000000000064322222222222223600000000000000000000000000000000000000000
-00000000006532222222222236000000000000000000000000000000000000522222222222222222222222222230000000000000000000000000000000000000
-00000000532222222222222223600000000000000000000000000000000000000000005222222222222222222222222222222223555555555555555555555555
-55555555522222222222222222222222222222222222600000000000000000000000000000000543222222222222222222250000000000000000000000000000
-00000000006222222222222222222222222222200000000000000000000000000000000000000000000000000000654322222356000000000000000000000000
-00000000000000040202222222222300000000000000000000000000000000000000063222222222222222222222222222222350000000000000062222222222
-22222222222222222250000000000000000000000000000000000042222222222222222222222222222222222222222250000000000000000000000000000000
-00062222222222222222222222222200000000000000000000000000000000000000000000000000654322222234500000000000000000000000000000000000
-00000000000000000000005533333456000000000000000000000000000000000000005222222222222222222222222222300000000000000000000000000000
-00000000000000000054322222222234600000000000000000000000000000000000000000000022222222222222222222222222222222235555555555555555
-55555555555555555222222222222222222222222222222222240000000000000000000000000000000000006543222222222222450000000000000000000000
-00000000000000000052222222222222222222222222223000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000302022222222222000000000000000000000000000000000000000004222222222222222222222222223560000000000000000032
-22222222222222222222222222600000000000000000000000000000000000322222222222222222222222222222222222222222400000000000000000000000
-00000000000032222222222222222222222222000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000042222222222222222222222222223000000000000000000000
-00000000000000000000000000000665555560000000000000000000000000000000000000000000000005222222222222222222222222222222222255555555
-55555555555555555555555532222222222222222222222222222222222000000000000000000000000000000000000000000066666666000000000000000000
-00000000000000000000000000522222222222222222222222222230000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000003020222222222225000000000000000000000000000000000000000006422222222222222222222245600000000000000
-00000062222222222222222222222222230000000000000000000000000000000000062222222222222222222222222222222222222222223000000000000000
-00000000000000000000522222222222222222222222230000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000322222222222222222222222222230000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032222222222222222222222222222222222
-55555555555555555555555555555555322222222222222222222222222222222250000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000003222222222222222222222222222400000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000020202222222222230000000000000000000000000000000000000000000654222222222222234560000000000
-00000000000000032222222222222222222222222500000000000000000000000000000000000522222222222222222222222222222222222222222226000000
-00000000000000000000000000000222222222222222222222222300000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003222222222222222222222222222300000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005222222222222222222222222222
-22222222555555555555555555555555555555552222222222222222222222222222222223000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000022222222222222222222222222225000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000202022222222222260000000000000000000000000000000000000000000000665555566600000000
-00000000000000000000000622222222222222222222222226000000000000000000000000000000000003222222222222222222222222222222222222222222
-24000000000000000000000000000000000004222222222222222222222223000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000022222222222222222222222222
-22300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032222222222222222222
-22222222222222223555555555555555555555555555555522222222222222222222222222222222260000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000006222222222222222222222222222250000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000062030022222222222400000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000322222222222222222222222300000000000000000000000000000000000622222222222222222222222222222222222
-22222222230000000000000000000000000000000000052222222222222222222222250000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006222222222222222222
-22222222223000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005222222222222
-22222222222222222222222235555555555555555555555555555555222222222222222222222222222222224000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000042222222222222222222222222222600000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000520202222222222222600000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000006222222222222222222222225000000000000000000000000000000000005222222222222222222222222222
-22222222222222222260000000000000000000000000000000000022222222222222222222222500000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000052222222222
-22222222222222222230000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000022222
-22222222222222222222222222222222255555555555555555555555555555532222222222222222222222222222222200000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000322222222222222222222222222226000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000004200002222222222224000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000003222222222222222222222260000000000000000000000000000000000042222222222222222222
-22222222222222222222222222500000000000000000000000000000000000422222222222222222222225000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000422
-22222222222222222222222222300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00422222222222222222222222222222222222222555555555555555555555555555555322222222222222222222222222222225000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222200000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000022020222222222222226000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000062222222222222222222223000000000000000000000000000000000000222222222222
-22222222222222222222222222222222223000000000000000000000000000000000005222222222222222222222260000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000322222222222222222222222222223000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000000062222222222222222222222222222222222222223555555555555555555555555555552222222222222222222222222222222300000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000422222222222222222222222222223000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000006220000222222222222230000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000032222222222222222222250000000000000000000000000000000000052222
-22222222222222222222222222222222222222222226000000000000000000000000000000000003222222222222222222222000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000062222222222222222222222222222230000000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000322222222222222222222222222222222222222235555555555555555555555555555522222222222222222222222222222226000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000002222222222222222222222222222240000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042202062222222222222250000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000622222222222222222222000000000000000000000000000000000
-00042222222222222222222222222222222222222222222222250000000000000000000000000000000000042222222222222222222230000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000522222222222222222222222222222300000000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000042222222222222222222222222222222222222222255555555555555555555555555553222222222222222222222222222222400
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000522222222222222222222222222222500
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000222000022222222222222260000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000322222222222222222240000000000000000000000000
-00000000000322222222222222222222222222222222222222222222222300000000000000000000000000000000000622222222222222222222400000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000003222222222222222222222222222223000000000000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000005222222222222222222222222222222222222222222555555555555555555555555555532222222222222222222222222
-22222400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002222222222222222222222222
-22222500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000052220000222222222222
-22230000000000000000000000000000000000000000000000000000000000000000000000000000000000000005222222222222222222500000000000000000
-00000000000000000062222222222222222222222222222222222222222222222222000000000000000000000000000000000000322222222222222222225000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000050000000000000000000000000000000000
-00000000000000000000000000000000000622222222222222222222222222222230000000000000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000622222222222222222222222222222222222222222223555555555555555555555555555222222222222222222
-22222222222222360000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000422222222222222222
-22222222222226000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000322200002222
-22222222222240000000000000000000000000000000000000000000000000000000000000000000000000000000000000003222222222222222220000000000
-00000000000000000000000000522222222222222222222222222222222222222222222222225000000000000000000000000000000000005222222222222222
-22226000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006230000000000000000000000000
-00000000000000000000000000000000000000000003222222222222222222222222222222300000000000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000003222222222222222222222222222222222222222222235555555555555555555555555552222222222
-22222222222222222222222246000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000062222222222
-22222222222222222222300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000062222
-00002222222222222222250000000000000000000000000000000000000000000000000000000000000000000000000000000000000052222222222222222400
-00000000000000000000000000000000003222222222222222222222222222222222222222222222222240000000000000000000000000000000000062222222
-22222222222200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032230000000000000000
-00000000000000000000000000000000000000000000000000622222222222222222222222222222223000000000000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000322222222222222222222222222222222222222222222255555555555555555555555555322
-22222222222222222222222222222222225000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000322
-22222222222222222222222222224000000000000000000000000000000000560000000000000000000000000000000000000000000000000000000000000000
-00032222000022222222222222222250000000000000000000000000000000000000000000000000000000000000000000000000000000000000032222222222
-22222500000000000000000000000000000000000022222222222222222222222222222222222222222222222222200000000000000000000000000000000000
-03222222222222222224000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003222230000000
-00000000000000000000000000000000000000000000000000000000003222222222222222222222222222222230000000000000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000042222222222222222222222222222222222222222222222355555555555555555555
-55555222222222222222222222222222222222222222500000000000000000000000000000000000000000000000000000000000000000000000000000000000
-00004222222222222222222222222222222250000000000000000000000000000000005250000000000000000000000000000000000000000000000000000000
-00000000005222220000222222222222222222250000000000000000000000000000000000000000000000000000000000000000000000000000000000000522
-22222222222220000000000000000000000000000000000005222222222222222222222222222222222222222222222222222500000000000000000000000000
-00000000052222222222222222250000000000000000000000000000000005000000000000000000000000000000000000000000000000000000000000422222
-23600000000000000000000000000000000000000000000000000000000000000522222222222222222222222222222222300000000000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000004222222222222222222222222222222222222222222222223555555555555
-55555555555552222222222222222222222222222222222222222350000000000000000000000000000000000000000000000000000000000000000000000000
-00000000000522222222222222222222222222222222600000000000000000000000000000000032236000000000000000000000000000000000000000000000
-00000000000000000622222200002222222222222222222250000000000000000000000000000000000000000000000000000000000000000000000000000000
-00000032222222222222400000000000000000000000000000000000042222222222222222222222222222222222222222222222222224000000000000000000
-00000000000000000022222222222222223000000000000000000000000000000000033000000000000000000000000000000000000000000000000000000000
-05222222222600000000000000000000000000000000000000000000000000000000000052222222222222222222222222222222223000000000000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000422222222222222222222222222222222222222222222222225555
-55555555555555555555322222222222222222222222222222222222222222235000000000000000000000000000000000000000000000000000000000000000
-00000000000000000052222222222222222222222222222222230000000000000000000000000000000000322225000000000000000000000000000000000000
-00000000000000000000000002222222000022222222222222222222240000000000000000000000000000000000000000000000000000000000000000000000
-00000000000006322222222222225000000000000000000000000000000000000222222222222222222222222222222222222222222222222222220000000000
-00000000000000000000000000422222222222222250000000000000000000000000000000000223600000000000000000000000000000000000000000000000
-00000000522222222222500000000000000000000000000000000000000000000000000000000006222222222222222222222222222222222230000000000000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000042222222222222222222222222222222222222222222222
-22223555555555555555555555552222222222222222222222222222222222222222222223500000000000000000000000000000000000000000000000000000
-00000000000000000000000005222222222222222222222222222222222400000000000000000000000000000000002222223600000000000000000000000000
-00000000000000000000000000000000322222220000222222222222222222222240000000000000000000000000000000000000000000000000000000000000
-00000000000000000006322222222222222200000000000000000000000000000000000052222222222222222222222222222222222222222222222222222250
-00000000000000000000000000000000005222222222222222000000000000000000000000000000000062222500000000000000000000000000000000000000
-00000000000000052222222222222400000000000000000000000000000000000000000000000000000000622222222222222222222222222222222222300000
-00000000000000000000000000000000000000000000000000000000000000000000000000000000000000003222222222222222222222222222222222222222
-22222222222225555555555555555555555322222222222222222222222222222222222222222222222250000000000000000000000000000000000000000000
-00000000000000000000000000000000522222222222222222222222222222222225000000000000000000000000000000000622222222500000000000000000
-00000000000000000000000000000000000000032222222200002222222222222222222222236000000000000000000000000000000000000000000000000000
-00000000000000000000000005322222222222222224000000000000000000000000000000000000422222222222222222222222222222222222222222222222
-22222240000000000000000000000000000000000002222222222222240000000000000000000000000000000000522222500000000000000000000000000000
-00000000000000000000005222222222222222360000000000000000000000000000000000000000000000000000062222222222222222222222222222222222
-22300000000000000000000000000000000066000000000000000000000000000000000000000000000000000000006222222222222222222222222222222222
-22222222222222222222255555555555555555555552222222222222222222222222222222222222222222222222224600000000000000000000000000000000
-00000000000000000000000000000000000000042222222222222222222222222222222222200000000000000000000000000000000005222222222360000000
-00000000000000000000000000000000000000000000003222222222000622222222222222222222222225000000000000000000000000000000000000000000
-00000000000000000000000000000005322222222222222222250000000000000000000000000000000000003222222222222222222222222222222222222222
-22222222222222300000000000000000000000000000000000042222222222222234600000000000000000000000000000003222222360000000000000000000
-00000000000000000000000000000422222222222222222250000000000000000000000000000000000000000000000000005222222222222222222222222222
-22222222223000000000000000000000000000000000026000000000000000000000000000000000000000000000000000000522222222222222222222222222
-22222222222222222222222222222355555555555555555555522222222222222222222222222222222222222222222222222222350000000000000000000000
-00000000000000000000000000000000000000000000063222222222222222222222222222222222223000000000000000000000000000000000042222222222
-25000000000000000000000000000000000000000000000000006322222222220000222222222222222222222222223600000000000000000000000000000000
-00000000000000000000000000000000000065222222222222222222222000000000000000000000000000000000000622222222222222222222222222222222
-22222222222222222222222600000000000000000000000000000000000522222222222222222245600000000000000000000000000022222222250000000000
-00000000000000000000000000000000000632222222222222222222236000000000000000000000000000000000000000000000000522222222222222222222
-22222222222222222230000000000000000000000000000000000225000000000000000000000000000000000000000000000000000632222222222222222222
-22222222222222222222222222222222222222555555555555555555553222222222222222222222222222222222222222222222222222222235600000000000
-00000000000000000000000000000000000000000000000000005222222222222222222222222222222222222222356000000000000000000000000000000222
-22222222223500000000000000000000000000000000000000000000000522222222222202022222222222222222222222222222400000000000000000000000
-00000000000000000000000000000000000000000064222222222222222222222240000000000000000000000000000000000005222222222222222222222222
-22222222222222222222222222222224000000000000000000000000000000000000322222222222222222222345000000000000000000000005222222222236
-00000000000000000000000000000000000000000052222222222222222222222224000000000000000000000000000000000000000000000632222222222222
-22222222222222222222222222300000000000000000000000000000000003225000000000000000000000000000000000000000000000000052222222222222
-22222222222222222222222222222222222222222222223555555555555555555522222222222222222222222222222222222222222222222222222222222450
-00000000000000000000000000000000000000000000000000000000006322222222222222222222222222222222222222222222450000000000000000000000
-00005222222222222222360000000000000000000000000000000000000000000042222222222222000022222222222222222222222222222250000000000000
-00000000000000000000000000000000000000000000000653222222222222222222222222500000000000000000000000000000000000032222222222222222
-22222222222222222222222222222222222222230000000000000000000000000000000000004222222222222222222222222346000000000000000000042222
-22222222360000000000000000000000000000000000000063222222222222222222222222222500000000000000000000000000000000000000000642222222
-22222222222222222222222222222222223000000000000000000000000000000000032223600000000000000000000000000000000000000000000053222222
-22222222222222222222222222222222222222222222222222222225555555555555555553222222222222222222222222222222222222222222222222222222
-22222222460000000000000000000000000000000000000000000000000000006322222222222222222222222222222222222222222222222223560000000000
-00000000000042222222222222222236000000000000000000000000000000000000000052222222222222220202222222222222222222222222222222224600
-00000000000000000000000000000000000000000000000000000542222222222222222222222222222334556600000000000000000000000000000222222222
-22222222222222222222222222222222222222222222222260000000000000000000000000000000000062222222222222222222222222222456000000000000
-00622222222222222235000000000000000000000000000000000064222222222222222222222222222222250000000000000000000000000000000000000642
-22222222222222222222222222222222222222222230000000000000000000000000000000000322222500000000000000000000000000000000000000000053
-22222222222222222222222222222222222222222222222222222222222222235555555555555555522222222222222222222222222222222222222222222222
-22222222222222222234600000000000000000000000000000000000000000000000005322222222222222222222222222222222222222222222222222222224
-50000000000000000000222222222222222222223500000000000000000000000000000000000053222222222222222200002222222222222222222222222222
-22222245000000000000000000000000000000000000000000000000005422222222222222222222222222222222222222223355660000000000000000000052
-22222222222222222222222222222222222222222222222222222222500000000000000000000000000000000000032222222222222222222222222222223450
-00000000005222222222222222223560000000000000000000000000000054222222222222222222222222222222222224500000000000000000000000000000
-00053222222222222222222222222222222222222222222222300000000000000000000000000000000003222222250000000000000000000000000000000000
-00005322222222222222222222222222222222222222222222222222222222222222222255555555555555552222222222222222222222222222222222222222
-22222222222222222222222222222245000000000000000000000000000000000000000000054222222222222222222222222222222222222222222222222222
-22222222223560000000000000052222222222222222222222245000000000000000000000000000000652222222222222222222020222222222222222222222
-22222222222222222450000000000000000000000000000000000000000000653222222222222222222222222222222222222222222222222222334556600000
-00000042222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222346000000022222222222222222222235600000000000000000000000643222222222222222222222222222222222222222245000000000000000000
-00000006542222222222222222222222222222222222222222222222223000000000000000000000000000000000032222222224600000000000000000000000
-00000000054222222222222222222222222222222222222222222222222222222222222222222222255555555555555322222222222222222222222222222222
-22222222222222222222222222222222222222222345600000000000000000000000000000000006542222222222222222222222222222222222222222222222
-22222222222222222222224560000000000322222222222222222222222222356000000000000000000000006532222222222222222222220202222222222222
-22222222222222222222222222224560000000000000000000000000000000000065322222222222222222222222222222222222222222222222222222222222
-22222335556600222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222456004222222222222222222222222245660000000000000665422222222222222222222222222222222222222222222222345600000
-00000000006654322222222222222222222222222222222222222222222222222230000000000000000000000000000000000322222222222346000000000000
-00000000000006542222222222222222222222222222222222222222222222222222222222222222222222222255555555555532222222222222222222222222
-22222222222222222222222222222222222222222222222222222335560000000000000000000000000654322222222222222222222222222222222222222222
-22222222222222222222222222222222234600000052222222222222222222222222222222345600000000000000654322222222222222222222222202022222
-22222222222222222222222222222222222222223556000000000000000000000000655332222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222223422222222222222222222222222222223333455333322222222222222222222222222222222222222222222222222222
-22222333345543332222222222222222222222222222222222222222222222222222222222300000000000000000000000000000000004222222222222222345
-60000000000000006553222222222222222222222222222222222222222222222222222222222222222222222222222222355555555553222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222335555666666666555433222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222245600322222222222222222222222222222222222223333554333222222222222222222222222222222
-02022222222222222222222222222222222222222222222222222233555566666655555333222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222223000000000000000000000000000000000052222222222
-22222222222333333333332222222222222222222222222222222222222222222222222222222222222222222222222222222222222355555555322222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222332222222222222222222222222222222222222222222222222222222222222222222222
-22222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222230000000000000000000000000000000000522
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222235555532222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222300000000000000000000000000000
-00000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-32222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222223000000000000000000000
-00000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222230000000000000
-00000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222300000
-00000000000000000000000000000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22300000000000000000000000000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222223000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222230000000000000000000000000000000000522222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222200002222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222300000000000000000000000000000000005222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222223000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222220000222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222230000000000000000000000000000000000522222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222300000000000000000000000000000000005222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222000022222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222223000000000000000000000000000000000052222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222230000000000000000000000000000000000522222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222200002222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222300000000000000000000000000000000005222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-00002222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222223000000000000000000000000000000000052222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222000022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222230000000000000000000000000000000000522
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222220000222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222300000000000000000000000000000
-00000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444
-44444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222200002222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222223000000000000000000000
-00000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-44444444444444442222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222000022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222230000000000000
-00000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222224444444444444444444222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222220000222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222300000
-00000000000000000000000000000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222224444444444444444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222200002222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22300000000000000000000000000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222444444444444444444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222000022222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222223000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222244444444444444444444444444422222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222220000222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222230000000000000000000000000000000000522222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222224444444444444444444444444444422222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222200022222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222300000000000000000000000000000000005222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222444444444444444444444444444444222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222000022222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222223000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222224444444444444444444444444444444222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222230000000000000000000000000000000000522222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222444444444444444444444444444444444222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222200002222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222300000000000000000000000000000000005222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222224444444444444444444444444444444442222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222224000000000000000000000000000000000052222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222444444444444444444444444444444444422222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220000222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222250000000000000000000000000000000000522222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222224444444444444444444444444444444444422222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000000000005222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444444444444444444444444444222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-00062222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222225000000000000000000000000000000000052222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222224444444444444444444444444444444444
-44222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222250000000000000000000000000000000000522
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444444444444444444
-44444444442222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000000
-00000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222444444444444444444
-44444444444444444442222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000
-00000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222224444444444
-44444444444444444444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222260000000000000
-00000000000000000000032222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244
-44444444444444444444444444444444444222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222000000
-00000000000000000000000000000322222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222244444444444444444444444444444444444442222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22000000000000000000000000000000000003222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222444444444444444444444444444444444444222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222030022222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222220000000000000000000000000000000000032222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222224444444444444444444444444444444444442222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222300000000000000000000000000000000000322222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222224444444444444444444444444444444444422222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222200002222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222224000000000000000000000000000000000003222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222244444444444444444444444444444444444222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222250000000000000000000000000000000000032222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222444444444444444444444444444444444422222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222220000222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222500000000000000000000000000000000000322222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222444444444444444444444444444444444222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222226000000000000000000000000000000000002222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222224444444444444444444444444444444442222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222000022222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222200000000000000000000000000000000000022222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222224444444444444444444444444444444222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220000222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222223000000000000000000000000000000000000222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444444444444444444444422222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222200002222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222240000000000000000000000000000000000002222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444444444444444444444222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-00002222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222223456000000000000000000000000000000622222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444444444444444444422
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222000022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222456000000000000000000000000006222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444444444444
-44444222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222220000222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222356000000000000000000
-00006222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444
-44444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222200002222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222345600000
-00000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222224
-44444444444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222000022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22234560000000000000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222244444444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222220000222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222224560000000004222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222224444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222200002222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222223450000032222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222000022222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222223456322222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222220000222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
-222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202040000002701ffff030000000000}}}{\insrsid2495527 
-
-\par }\pard\plain \s15\ql \li0\ri0\sb60\sa60\widctlpar\brdrb\brdrs\brdrw15\brsp20 \tqc\tx4153\tqr\tx9639\wrapdefault\faauto\rin0\lin0\itap0 \f1\fs16\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid2495527 \line \line \line \line }{\field{\*\fldinst 
-{\b\insrsid2495527  REF Doc_Issuing_Office \\* MERGEFORMAT}}{\fldrslt {\b\insrsid10304687\charrsid10304687 SLN}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 .}{\field{\*\fldinst {\b\insrsid2495527  REF Doc_Context_Project  \\
-* MERGEFORMAT }}{\fldrslt {\b\lang1024\langfe1024\noproof\insrsid10304687\charrsid10304687 AAA}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\field{\*\fldinst {\b\insrsid2495527  REF Doc_Context_Number  \\* MERGEFORMAT }}{\fldrslt {
-\b\lang1024\langfe1024\noproof\insrsid10304687\charrsid10304687 NNN}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 .}{\field{\*\fldinst {\b\insrsid2495527  REF Doc_Object_Number  \\* MERGEFORMAT }}{\fldrslt {
-\b\lang1024\langfe1024\noproof\insrsid10304687\charrsid10304687 NNNN}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 , Rev }{\field{\*\fldinst {\b\insrsid2495527  REF Doc_Version_Number  \\* MERGEFORMAT }}{\fldrslt {
-\b\lang1024\langfe1024\noproof\insrsid10304687\charrsid10304687 NNNN.NN}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 \tab \tab }{\field{\*\fldinst {\b\insrsid2495527  REF Doc_Title  \\* MERGEFORMAT }}{\fldrslt {
-\b\insrsid10304687\charrsid10304687 Sampling Profiler For}{\b\fs28\insrsid10304687  EPOC Devices}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 \line }{\field{\*\fldinst {\b\insrsid2495527  REF Doc_Status  \\* MERGEFORMAT }}{\fldrslt {
-\b\insrsid10304687\charrsid10304687 REVIEW}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 , }{\b\insrsid481371 {\*\xmlopen\xmlns1{\factoidname date}{\xmlattr\xmlattrns0{\xmlattrname Month}{\xmlattrvalue 7}}{\xmlattr\xmlattrns0
-{\xmlattrname Day}{\xmlattrvalue 9}}{\xmlattr\xmlattrns0{\xmlattrname Year}{\xmlattrvalue 2007}}}0}{\b\insrsid11890070 9}{\b\insrsid481371 /0}{\b\insrsid11890070 7}{\b\insrsid481371 /200}{\b\insrsid11890070 7}{\b\insrsid2495527 {\*\xmlclose}\tab \tab }
-{\field\fldedit{\*\fldinst {\b\insrsid2495527  REF Doc_Owner  \\* MERGEFORMAT }}{\fldrslt }}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527  - }{\field{\*\fldinst {\b\insrsid2495527  REF Doc_Function  \\* MERGEFORMAT }}{\fldrslt {
-\b\insrsid10304687\charrsid10304687 Development}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 
-\par }}{\footerr \pard\plain \s16\ql \li0\ri0\sb60\sa60\widctlpar\brdrt\brdrs\brdrw15\brsp20 \tqc\tx4153\tqr\tx9639\wrapdefault\faauto\rin0\lin0\rtlgutter\itap0 \f1\fs16\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid2495527 \'a9 Symbian Ltd. }
-{\field{\*\fldinst {\insrsid2495527  SAVEDATE \\@ "yyyy" \\* MERGEFORMAT }}{\fldrslt {\lang1024\langfe1024\noproof\insrsid11890070 2007}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\insrsid2495527 \tab \tab Pg. }{\field{\*\fldinst {\insrsid2495527 
- PAGE  \\* MERGEFORMAT }}{\fldrslt {\lang1024\langfe1024\noproof\insrsid11890070 14}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\insrsid2495527  of }{\field{\*\fldinst {\insrsid2495527  NUMPAGES  \\* MERGEFORMAT }}{\fldrslt {
-\lang1024\langfe1024\noproof\insrsid11890070 14}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\insrsid2495527 
-\par }}{\*\pnseclvl1\pnucrm\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl2\pnucltr\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl3\pndec\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl4\pnlcltr\pnstart1\pnindent720\pnhang {\pntxta )}}
-{\*\pnseclvl5\pndec\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl6\pnlcltr\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl7\pnlcrm\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl8
-\pnlcltr\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl9\pnlcrm\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}\trowd \irow0\irowband0
-\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA37\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
-\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8043\clshdrawnil \cellx9744\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 
-\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\f1\fs28\insrsid6226036 Document:\cell {\*\bkmkstart Doc_Title}}{\field\fldedit{\*\fldinst {\b\f1\fs28\insrsid6226036  FORMTEXT }{\b\f1\fs28\insrsid11890070 {\*\datafield 
-800100000000000009446f635f5469746c6500104e616d65204f6620446f63756d656e74000a5469746c652063617365001f456e74657220746865206e616d65206f66207468697320646f63756d656e740021456e74657220746865207469746c65206f66207468697320646f63756d656e742e0000000000}
-{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Title}{\*\ffdeftext Name Of Document}{\*\ffformat Title case}{\*\ffhelptext Enter the name of this document}{\*\ffstattext Enter the title of this document.}}}}}{\fldrslt {
-\b\f1\fs28\insrsid6226036 Sampling Profiler For EPOC Devices}}}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\b\f1\fs28\insrsid6226036 {\*\bkmkend Doc_Title}\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\f1\fs28\insrsid6226036 \trowd \irow0\irowband0
-\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA37\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
-\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8043\clshdrawnil \cellx9744\row }\trowd \irow1\irowband1
-\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA38\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
-\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4820\clshdrawnil \cellx6521\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1701\clshdrawnil \cellx8222\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1521\clshdrawnil \cellx9744\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\f1\insrsid6226036 Number:\cell {\*\bkmkstart Doc_Issuing_Office}}{\field\flddirty\fldpriv{\*\fldinst {\f1\insrsid6226036  FORMDROPDOWN }{\f1\insrsid11890070 {\*\datafield 
-8a8100000000000012446f635f49737375696e675f4f666669636500000000007f43686f6f7365207468652053796d6269616e2049737375696e67206f66666963653a20534342202d2043616d6272696467652c2053474c202d20476c6f62616c2c20534c4e202d204c6f6e646f6e2c20535259202d20526f6e6e6562792c
-20535346202d2053616e204672616e636973636f2c2053544f202d20546f6b796f003b456e746572207468652049737375696e67204f666669636520636f6465202d20463120666f72206578706c616e6174696f6e206f6620636f646573000000000024000600060000000a000c001000140018001c002000035343420353
-474c03534c4e03535259035353460353544f}{\*\formfield{\fftype2\ffres2\ffownhelp\ffownstat\fftypetxt0\ffhaslistbox{\*\ffname Doc_Issuing_Office}\ffdefres0{\*\ffhelptext 
-Choose the Symbian Issuing office: SCB - Cambridge, SGL - Global, SLN - London, SRY - Ronneby, SSF - San Francisco, STO - Tokyo}{\*\ffstattext Enter the Issuing Office code - F1 for explanation of codes}{\*\ffl SCB}{\*\ffl SGL}{\*\ffl SLN}{\*\ffl SRY}
-{\*\ffl SSF}{\*\ffl STO}}}}}{\fldrslt }}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\f1\insrsid6226036 {\*\bkmkend Doc_Issuing_Office}.{\*\bkmkstart Doc_Context_Project}}{\field{\*\fldinst {\f1\insrsid6226036 
- FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
-800103000000000013446f635f436f6e746578745f50726f6a656374000341414100095570706572636173650040456e7465722074686520646f63756d656e7420636f6e746578742070726f6a6563742067726f75702028746872656520746578742063686172616374657273290038456e7465722074686520646f63756d
-656e7420636f6e746578742070726f6a6563742067726f757072202d20463120666f722068656c702e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0\ffmaxlen3{\*\ffname Doc_Context_Project}{\*\ffdeftext AAA}{\*\ffformat Uppercase}{\*\ffhelptext 
-Enter the document context project group (three text characters)}{\*\ffstattext Enter the document context project groupr - F1 for help.}}}}}{\fldrslt {\f1\lang1024\langfe1024\noproof\insrsid6226036 AAA}}}\sectd 
-\psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\*\bkmkstart Doc_Context_Number}{\*\bkmkend Doc_Context_Project}{\field{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
-800103000000000012446f635f436f6e746578745f4e756d62657200034e4e4e00095570706572636173650041456e7465722074686520646f63756d656e7420636f6e746578742070726f6a6563742073657175656e6365206e756d6265722028746872656520646967697473290041456e7465722074686520646f63756d
-656e7420636f6e746578742070726f6a6563742073657175656e6365206e756d626572202d20463120666f722068656c702e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0\ffmaxlen3{\*\ffname Doc_Context_Number}{\*\ffdeftext NNN}{\*\ffformat Uppercase}
-{\*\ffhelptext Enter the document context project sequence number (three digits)}{\*\ffstattext Enter the document context project sequence number - F1 for help.}}}}}{\fldrslt {\f1\lang1024\langfe1024\noproof\insrsid6226036 NNN}}}\sectd 
-\psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\f1\insrsid6226036 {\*\bkmkend Doc_Context_Number}.{\*\bkmkstart Doc_Object_Number}}{\field{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
-800100000000000011446f635f4f626a6563745f4e756d62657200044e4e4e4e00095570706572636173650046456e7465722074686520646f63756d656e74206f626a6563742073657175656e6365206e756d6265722028756e6c696d69746564206e756d626572206f6620646967697473290038456e7465722074686520
-646f63756d656e74206f626a6563742073657175656e6365206e756d626572202d20463120666f722068656c702e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Object_Number}{\*\ffdeftext NNNN}{\*\ffformat Uppercase}{\*\ffhelptext 
-Enter the document object sequence number (unlimited number of digits)}{\*\ffstattext Enter the document object sequence number - F1 for help.}}}}}{\fldrslt {\f1\lang1024\langfe1024\noproof\insrsid6226036 NNNN}}}\sectd 
-\psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\f1\insrsid6226036 {\*\bkmkend Doc_Object_Number}/{\*\bkmkstart Doc_Version_Number}}{\field{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
-800100000000000012446f635f56657273696f6e5f4e756d62657200074e4e4e4e2e4e4e0009557070657263617365006c456e7465722074686520646f63756d656e742076657273696f6e206e756d62657220696e2074686520666f6c6c6f77696e6720666f726d3a206e6e6e6e2e6e6e2e20557064617465207468652044
-6f63756d656e7420486973746f7279207461626c652061732077656c6c2e0030456e7465722074686520646f63756d656e742076657273696f6e206e756d626572202d20463120666f722068656c702e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Version_Number}
-{\*\ffdeftext NNNN.NN}{\*\ffformat Uppercase}{\*\ffhelptext Enter the document version number in the following form: nnnn.nn. Update the Document History table as well.}{\*\ffstattext Enter the document version number - F1 for help.}}}}}{\fldrslt {
-\f1\lang1024\langfe1024\noproof\insrsid6226036 NNNN.NN}}}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\b\f1\insrsid6226036 {\*\bkmkend Doc_Version_Number}\cell Status:\cell {\*\bkmkstart Doc_Status}}
-{\field\flddirty\fldpriv{\*\fldinst {\f1\insrsid6226036  FORMDROPDOWN }{\f1\insrsid11890070 {\*\datafield 
-86810000000000000a446f635f53746174757300000000002143686f6f73652074686520737461747573206f662074686520646f63756d656e74003443686f6f7365207374617475732066726f6d207468652064726f7020646f776e206c697374202d20463120666f722068656c702e00000000001a000300030000000a00
-06000c0013000544524146540652455649455706495353554544}{\*\formfield{\fftype2\ffres1\ffownhelp\ffownstat\fftypetxt0\ffhaslistbox{\*\ffname Doc_Status}\ffdefres0{\*\ffhelptext Choose the status of the document}{\*\ffstattext 
-Choose status from the drop down list - F1 for help.}{\*\ffl DRAFT}{\*\ffl REVIEW}{\*\ffl ISSUED}}}}}{\fldrslt }}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\b\f1\insrsid6226036 {\*\bkmkend Doc_Status}\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f1\insrsid6226036 \trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA38\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 
-\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth4820\clshdrawnil \cellx6521\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1701\clshdrawnil \cellx8222\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1521\clshdrawnil \cellx9744\row }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\f1\insrsid6226036 Owner:\cell }{\f1\insrsid6372845 Dennis May}{\b\f1\insrsid6226036 \cell 
-Last Revised:\cell }{\f1\insrsid9120167 {\*\xmlopen\xmlns1{\factoidname date}{\xmlattr\xmlattrns0{\xmlattrname Month}{\xmlattrvalue 7}}{\xmlattr\xmlattrns0{\xmlattrname Day}{\xmlattrvalue 9}}{\xmlattr\xmlattrns0{\xmlattrname Year}{\xmlattrvalue 2007}}}0}{
-\f1\insrsid11890070 9}{\f1\insrsid9120167 /0}{\f1\insrsid11890070 7}{\f1\insrsid8289572 /200}{\f1\insrsid11890070 7}{\b\f1\insrsid6226036 {\*\xmlclose}\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
-\f1\insrsid6226036 \trowd \irow2\irowband2\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA38\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4820\clshdrawnil \cellx6521\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1701\clshdrawnil \cellx8222\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1521\clshdrawnil \cellx9744\row }\trowd \irow3\irowband3
-\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA38\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
-\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8042\clshdrawnil \cellx9744\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\f1\insrsid6226036 Function:\cell 
-{\*\bkmkstart Doc_Function}}{\field\flddirty\fldpriv{\*\fldinst {\f1\insrsid6226036  FORMDROPDOWN }{\f1\insrsid11890070 {\*\datafield 
-8a810000000000000c446f635f46756e6374696f6e00000000004743686f6f736520746865206e616d65206f6620746865206f7267616e69736174696f6e616c2066756e6374696f6e2074686174206f776e73207468697320646f63756d656e742e004743686f6f736520746865206e616d65206f6620746865206f726761
-6e69736174696f6e616c2066756e6374696f6e2074686174206f776e73207468697320646f63756d656e742e0000000000d9000c000c0000000a00180027003b00470052005a006e0080009700a900b400c4000e41646d696e697374726174696f6e1344657369676e202620546563686e6f6c6f67790b446576656c6f706d
-656e740a466163696c69746965730746696e616e636513496e666f726d6174696f6e20537570706f7274114d61726b6574696e6720262053616c6573164f7267616e69736174696f6e616c20537570706f7274114f7065726174696f6e616c20426f6172640a50726f6772616d6d65730f48756d616e205265736f75726365
-7314546563686e6963616c20436f6e73756c74696e67}{\*\formfield{\fftype2\ffres2\ffownhelp\ffownstat\fftypetxt0\ffhaslistbox{\*\ffname Doc_Function}\ffdefres0{\*\ffhelptext Choose the name of the organisational function that owns this document.}{\*\ffstattext 
-Choose the name of the organisational function that owns this document.}{\*\ffl Administration}{\*\ffl Design & Technology}{\*\ffl Development}{\*\ffl Facilities}{\*\ffl Finance}{\*\ffl Information Support}{\*\ffl Marketing & Sales}{\*\ffl 
-Organisational Support}{\*\ffl Operational Board}{\*\ffl Programmes}{\*\ffl Human Resources}{\*\ffl Technical Consulting}}}}}{\fldrslt }}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\b\f1\insrsid6226036 
-{\*\bkmkend Doc_Function}\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f1\insrsid6226036 \trowd \irow3\irowband3
-\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA38\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
-\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8042\clshdrawnil \cellx9744\row }\trowd \irow4\irowband4\ts11\trgaph108\trleft-108\trbrdrb\brdrs\brdrw15 
-\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl
-\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8080\clshdrawnil \cellx9782\pard\plain \s17\ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \fs22\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {
-\b\f1\fs20\kerning0\insrsid6226036 Contributors:\cell {\*\bkmkstart Doc_Contributors}}{\field\fldedit{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
-800100000000000010446f635f436f6e7472696275746f727300144c697374204f6620436f6e7472696275746f7273000a5469746c6520636173650033456e7465722074686520746865206c697374206f6620636f6e7472696275746f727320746f2074686520646f63756d656e742e0033456e7465722074686520746865
-206c697374206f6620636f6e7472696275746f727320746f2074686520646f63756d656e742e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Contributors}{\*\ffdeftext List Of Contributors}{\*\ffformat Title case}{\*\ffhelptext 
-Enter the the list of contributors to the document.}{\*\ffstattext Enter the the list of contributors to the document.}}}}}{\fldrslt {\f1\lang1024\langfe1024\noproof\insrsid6226036 Adam Stevenson}}}\sectd 
-\psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\f1\insrsid6372845 {\*\bkmkend Doc_Contributors}, Djordje Kovacevic}{\f1\insrsid9120167 , Mark Tai}{\insrsid6226036 \cell }\pard\plain 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 \trowd \irow4\irowband4\ts11\trgaph108\trleft-108\trbrdrb\brdrs\brdrw15 
-\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl
-\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8080\clshdrawnil \cellx9782\row }\pard\plain \s17\ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \fs22\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {
-\b\f1\fs20\kerning0\insrsid6226036 Key Reviewers:\cell {\*\bkmkstart Doc_Reviewers}}{\field\fldedit{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
-80010000000000000d446f635f52657669657765727300154c697374204f66204b657920526576696577657273000a5469746c6520636173650049456e74657220746865206c697374206f6620746865206b657920726576696577657273206f662074686520646f63756d656e742c2073657061726174656420627920636f
-6d6d61732e0030456e74657220746865206c697374206f66206b657920726576696577657273206f662074686520646f63756d656e742e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Reviewers}{\*\ffdeftext List Of Key Reviewers}{\*\ffformat 
-Title case}{\*\ffhelptext Enter the list of the key reviewers of the document, separated by commas.}{\*\ffstattext Enter the list of key reviewers of the document.}}}}}{\fldrslt {\f1\insrsid6226036 \u8194\'20\u8194\'20\u8194\'20\u8194\'20\u8194\'20}}}
-\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\f1\insrsid6372845 {\*\bkmkend Doc_Reviewers}Oleg Isakov}{\insrsid6226036 \cell }\pard\plain 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 \trowd \irow5\irowband5\ts11\trgaph108\trleft-108\trbrdrb\brdrs\brdrw15 
-\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl
-\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8080\clshdrawnil \cellx9782\row }\pard\plain \s17\ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \fs22\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {
-\b\f1\fs20\kerning0\insrsid6226036 Distribution\cell {\*\bkmkstart Doc_Distribution}}{\field\fldedit{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
-800100000000000010446f635f446973747269627574696f6e0011446973747269627574696f6e204c697374000a5469746c6520636173650069456e74657220746865206c697374206f66207468652070656f706c65206f72206a6f622066756e6374696f6e732074686520646f63756d656e742073686f756c6420626520
-646973747269627574656420746f2c2073657061726174656420627920636f6d6d61732e0069456e74657220746865206c697374206f66207468652070656f706c65206f72206a6f622066756e6374696f6e732074686520646f63756d656e742073686f756c6420626520646973747269627574656420746f2c2073657061
-726174656420627920636f6d6d61732e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Distribution}{\*\ffdeftext Distribution List}{\*\ffformat Title case}{\*\ffhelptext 
-Enter the list of the people or job functions the document should be distributed to, separated by commas.}{\*\ffstattext Enter the list of the people or job functions the document should be distributed to, separated by commas.}}}}}{\fldrslt {
-\insrsid5055728 \u8194\'20\u8194\'20\u8194\'20\u8194\'20\u8194\'20}}}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\insrsid6226036 {\*\bkmkend Doc_Distribution}\cell }\pard\plain 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 \trowd \irow6\irowband6\ts11\trgaph108\trleft-108\trbrdrb\brdrs\brdrw15 
-\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl
-\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8080\clshdrawnil \cellx9782\row }\trowd \irow7\irowband7\lastrow \ts11\trgaph108\trleft-108\trbrdrb\brdrs\brdrw15 
-\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl
-\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4820\clshdrawnil \cellx6521\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1701\clshdrawnil \cellx8222
-\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1559\clshdrawnil \cellx9782\pard\plain \s17\ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 
-\fs22\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\b\f1\fs20\kerning0\insrsid6226036 Approved By:\cell {\*\bkmkstart Doc_Approval_Name}}{\field{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
-800100000000000011446f635f417070726f76616c5f4e616d65001a4e616d65204f6620417070726f76616c20417574686f72697479000a5469746c6520636173650029456e74657220746865206e616d65206f662074686520617070726f76616c20617574686f726974792e0029456e74657220746865206e616d65206f
-662074686520617070726f76616c20617574686f726974792e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Approval_Name}{\*\ffdeftext Name Of Approval Authority}{\*\ffformat Title case}{\*\ffhelptext 
-Enter the name of the approval authority.}{\*\ffstattext Enter the name of the approval authority.}}}}}{\fldrslt {\f1\lang1024\langfe1024\noproof\insrsid6226036 Name Of Approval Authority}}}\sectd 
-\psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\insrsid6226036 {\*\bkmkend Doc_Approval_Name}\cell }{\b\f1\fs20\kerning0\insrsid6226036 Approval Ref.:\cell {\*\bkmkstart Doc_Approval_Ref}}{\field{\*\fldinst {\f1\insrsid6226036 
- FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
-800100000000000010446f635f417070726f76616c5f526566000c417070726f76616c20526566000a5469746c6520636173650026456e7465722074686520646f63756d656e7420617070726f76616c207265666572656e63652e0026456e7465722074686520646f63756d656e7420617070726f76616c20726566657265
-6e63652e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Approval_Ref}{\*\ffdeftext Approval Ref}{\*\ffformat Title case}{\*\ffhelptext Enter the document approval reference.}{\*\ffstattext 
-Enter the document approval reference.}}}}}{\fldrslt {\f1\lang1024\langfe1024\noproof\insrsid6226036 Approval Ref}}}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\insrsid6226036 {\*\bkmkend Doc_Approval_Ref}\cell 
-}\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 \trowd \irow7\irowband7\lastrow \ts11\trgaph108\trleft-108\trbrdrb\brdrs\brdrw15 
-\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl
-\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4820\clshdrawnil \cellx6521\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1701\clshdrawnil \cellx8222
-\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1559\clshdrawnil \cellx9782\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\insrsid6226036 
-\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\ul\cf6\insrsid6226036 \sect }\sectd 
-\psz9\sbknone\linex0\headery709\footery709\colsx709\endnhere\sectunlocked1\sectdefaultcl\sftnbj {\*\pnseclvl1\pnucrm\pnqc\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl2\pnucltr\pnqc\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl3
-\pndec\pnqc\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl4\pnlcltr\pnqc\pnstart1\pnindent720\pnhang {\pntxta )}}{\*\pnseclvl5\pndec\pnqc\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl6\pnlcltr\pnqc\pnstart1\pnindent720\pnhang 
-{\pntxtb (}{\pntxta )}}{\*\pnseclvl7\pnlcrm\pnqc\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl8\pnlcltr\pnqc\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl9\pnlcrm\pnqc\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}
-\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid6226036 {\*\bkmkstart _Toc420414641}Introduction
-{\*\bkmkend _Toc420414641}
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 {\*\bkmkstart _Toc420154979}{\*\bkmkstart _Toc420156457}
-{\*\bkmkstart _Toc420414642}Purpose and scope{\*\bkmkend _Toc420154979}{\*\bkmkend _Toc420156457}{\*\bkmkend _Toc420414642}
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
-This document describes the use of the sampling and analysis tools that can be used to profile execution on EPOC devices.}{\cf6\insrsid6226036 {\*\bkmkstart _Toc419889484}{\*\bkmkstart _Toc420414643}
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 References{\*\bkmkend _Toc419889484}{\*\bkmkend _Toc420414643}
-\par {\*\bkmkstart _Toc419889485}{\*\bkmkstart _Toc420414644}Open Issues{\*\bkmkend _Toc419889485}{\*\bkmkend _Toc420414644}
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The following issues need to be resolved before this document is completed.
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0\pararsid678217 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid678217 Abbrevations
-\par }\trowd \irow0\irowband0\ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb
-\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth8046\clshdrawnil \cellx9747
-\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\yts25 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid678217 XIP image\cell eXecuteInPlace ROM image. The executables are }{\insrsid481371 executed}{
-\insrsid678217  from the place they are stored. Their run addresses are decided during rombuild process. NOR Flash is }{\insrsid2495527 an example of }{\insrsid678217 XIP media.\cell }\pard\plain 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid678217 \trowd \irow0\irowband0\ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 
-\trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb
-\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth8046\clshdrawnil \cellx9747
-\row }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\yts25 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid678217 non-XIP image\cell 
-The executables of the non-XIP image are copied into RAM before being run. Their run addresses are decided during run time. NAND Flash is }{\insrsid2495527 an example }{\insrsid678217 non-XIP media.\cell }\pard\plain 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid678217 \trowd \irow1\irowband1\lastrow \ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl
-\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb
-\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth8046\clshdrawnil \cellx9747
-\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\insrsid678217 
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 {\*\bkmkstart _Toc419889486}{\*\bkmkstart _Toc420414645}
-Document History{\*\bkmkend _Toc419889486}{\*\bkmkend _Toc420414645}
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft0\trhdr\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 \trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 
-\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\clshdng6000\cltxlrtb\clftsWidth3\clwWidth1276\clshdngraw6000 \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\clshdng6000\cltxlrtb\clftsWidth3\clwWidth974\clshdngraw6000 \cellx2250\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\clshdng6000\cltxlrtb\clftsWidth3\clwWidth973\clshdngraw6000 \cellx3223\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\clshdng6000\cltxlrtb\clftsWidth3\clwWidth5709\clshdngraw6000 \cellx8932\pard\plain \s18\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \b\fs21\cf8\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Date\cell Version
-\cell Status\cell Description\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 \trowd \irow0\irowband0
-\ts11\trgaph108\trleft0\trhdr\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 \trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 
-\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\clshdng6000\cltxlrtb\clftsWidth3\clwWidth1276\clshdngraw6000 \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\clshdng6000\cltxlrtb\clftsWidth3\clwWidth974\clshdngraw6000 \cellx2250\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\clshdng6000\cltxlrtb\clftsWidth3\clwWidth973\clshdngraw6000 \cellx3223\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\clshdng6000\cltxlrtb\clftsWidth3\clwWidth5709\clshdngraw6000 \cellx8932\row }\trowd \irow1\irowband1\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 
-\trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 \trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr
-\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth1276\clshdrawnil \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\cltxlrtb\clftsWidth3\clwWidth974\clshdrawnil \cellx2250\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth973\clshdrawnil \cellx3223
-\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth5709\clshdrawnil \cellx8932\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 {\*\xmlopen\xmlns1{\factoidname date}{\xmlattr\xmlattrns0{\xmlattrname Month}{\xmlattrvalue 9}}{\xmlattr\xmlattrns0{\xmlattrname Day}{\xmlattrvalue 27}}
-{\xmlattr\xmlattrns0{\xmlattrname Year}{\xmlattrvalue 2000}}}27/09/2000{\*\xmlclose}\cell }\pard \qc \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 0.01\cell }\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Draft\cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow1\irowband1
-\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 \trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 
-\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\cltxlrtb\clftsWidth3\clwWidth1276\clshdrawnil \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth974\clshdrawnil \cellx2250
-\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth973\clshdrawnil \cellx3223\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl
-\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth5709\clshdrawnil \cellx8932\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6372845 
-{\*\xmlopen\xmlns1{\factoidname date}{\xmlattr\xmlattrns0{\xmlattrname Month}{\xmlattrvalue 5}}{\xmlattr\xmlattrns0{\xmlattrname Day}{\xmlattrvalue 31}}{\xmlattr\xmlattrns0{\xmlattrname Year}{\xmlattrvalue 2005}}}31/05/2005{\*\xmlclose}\cell }\pard 
-\qc \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6372845 0.02\cell }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6372845 Draft\cell }{\insrsid2495527 Added}{\insrsid6372845  non-XIP support
-}{\insrsid2495527  in profiler}{\insrsid6372845 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6372845 \trowd \irow2\irowband2\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl
-\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 \trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 \trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt
-\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth1276\clshdrawnil \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb
-\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth974\clshdrawnil \cellx2250\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\cltxlrtb\clftsWidth3\clwWidth973\clshdrawnil \cellx3223\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth5709\clshdrawnil \cellx8932\row 
-}\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid13524902 {\*\xmlopen\xmlns1{\factoidname date}{\xmlattr\xmlattrns0{\xmlattrname Month}{\xmlattrvalue 9}}{\xmlattr\xmlattrns0{\xmlattrname Day}{\xmlattrvalue 8}}
-{\xmlattr\xmlattrns0{\xmlattrname Year}{\xmlattrvalue 2006}}}08/09/2006{\*\xmlclose}\cell }\pard \qc \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid13524902 0.03\cell }\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid13524902 Draft\cell Added description of \endash drive= option\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
-\insrsid13524902 \trowd \irow3\irowband3\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 \trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 
-\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\cltxlrtb\clftsWidth3\clwWidth1276\clshdrawnil \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth974\clshdrawnil \cellx2250
-\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth973\clshdrawnil \cellx3223\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl
-\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth5709\clshdrawnil \cellx8932\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid11890070 
-{\*\xmlopen\xmlns1{\factoidname date}{\xmlattr\xmlattrns0{\xmlattrname Month}{\xmlattrvalue 7}}{\xmlattr\xmlattrns0{\xmlattrname Day}{\xmlattrvalue 9}}{\xmlattr\xmlattrns0{\xmlattrname Year}{\xmlattrvalue 2007}}}09/07/2007{\*\xmlclose}\cell }\pard 
-\qc \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid11890070 0.04\cell }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid11890070 Draft\cell Changed XIP to non-XIP for }{\cs27\insrsid11890070 
-\endash }{\cs27\insrsid11890070 rofs}{\cs27\insrsid11890070  option. }{\insrsid11890070 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid11890070 \trowd \irow4\irowband4\lastrow 
-\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 \trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 
-\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
-\cltxlrtb\clftsWidth3\clwWidth1276\clshdrawnil \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth974\clshdrawnil \cellx2250
-\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth973\clshdrawnil \cellx3223\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl
-\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth5709\clshdrawnil \cellx8932\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\insrsid6226036 
-\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The profiling tool
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
-The profiler consists of a program running on the target device which periodically samples the PC (program counter) and current thread ID, saving the resulting }{\i\insrsid6226036 trace data}{\insrsid6226036  to a file. This program comprises of:
-\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
-\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 a kernel-dependant device driver, currently only ARM targets are supported
-\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
-\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 an executable which can be controlled via command line, programmatically by IPC, or through a console interface
-\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
-\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 an optional DLL which provides a }{\i\insrsid6226036 hot-key}{\insrsid6226036  UI to replace the default console
-\par }\pard \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlcont\ilvl0\ls0\pnrnot0\pndec }\faauto\rin0\lin0\itap0 {\insrsid6226036 
-Currently the sample rate is fixed at 1000Hz, typically generating 3Kb of data per second of processor activity. It can run on a standard build of EPOC (no kernel modifications are required), and does not require changes to the code to be profiled.
-\par }{\insrsid12336355 When profiler runs, it gets all the data from the device driver and stores it in memory. This ultimately becomes a limitation and when the profiler runs out of heap memory, it stops and writes all the data to disk. With a defaul
-t heap that can grow to 1MB and with 3Kb of data per second, the profiler will run for 5-6 minutes before running out of memory and stopping. You can increase the maximum heap size of the profiler in order for it to run longer.
-\par }{\insrsid12218284 The tool also supports profiling of non-XIP executables. It uses Kernel\rquote s debug interface to collects the relevant information regarding non-XIP code segments. In order to do so, Kernel must be built with }{
-\insrsid15342006\charrsid15342006 __DEBUGGER_SUPPORT__}{\insrsid15342006  }{\insrsid12218284 option.}{\insrsid7406415  (Assabet, Lubbock and H2 are all built by default in this way.)}{\insrsid12218284 
-\par }{\insrsid6226036 After }{\insrsid6816192 profiling the trace data file ([drive letter]}{\insrsid6226036 :\\PROFILER.DAT on the device) is transferred to a PC, where it can be processed using a Win32 tool: Analyse. Some of its feature include:
-\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
-\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 Providing various reports based on the trace data, including a basic trace listing, a thread/location profile distribution table and a thread/time profile
-\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
-\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 A rom symbol file can be used to translate code addresses into DLL or function names
-\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
-\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 The trace can be filtered in various ways before generating the report, e.g. restrict analysis to a single thread, process, DLL and/or time interval.
-\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
-\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 Output suitable for pasting directly into Excel can be generated to enable simple graphical analysis of the results
-\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid6226036 \page Using the profiler
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Installing the profiler
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 To 
-generate the profiling trace, the profile program must be installed on the EPOC device (e.g. by copying to a CF card). Three parts of the program need to be installed as follows:
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth2835\clshdrawnil \cellx4395\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth5353\clshdrawnil \cellx9748\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 File\cell Found in\cell Install to\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\insrsid6226036 \trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth2835\clshdrawnil \cellx4395\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth5353\clshdrawnil \cellx9748\row }\trowd \irow1\irowband1
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth2835\clshdrawnil \cellx4395\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth5353\clshdrawnil \cellx9748\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Profiler.exe\cell \\epoc\\release\\}{\i\insrsid6226036 <ABI>}{\insrsid6226036 \\urel\cell \\}{
-\insrsid6372845 s}{\insrsid481371 ys}{\insrsid6226036 \\}{\insrsid6372845 bin}{\insrsid6226036  or other suitable location on the device\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
-\trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil 
-\cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth2835\clshdrawnil \cellx4395\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth5353\clshdrawnil \cellx9748\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Sampler.ldd\cell \\epoc\\release\\}{\i\insrsid6226036 <A}{\i\insrsid6890489 BI}{\i\insrsid6226036 >}{
-\insrsid6226036 \\urel\cell \\}{\insrsid6372845 s}{\insrsid6226036 ys\\}{\insrsid6372845 bin}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow2\irowband2
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth2835\clshdrawnil \cellx4395\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth5353\clshdrawnil \cellx9748\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 ProfilerKeys.dll\cell \\epoc\\release\\}{\i\insrsid6226036 <ABI>}{\insrsid6226036 \\urel\cell \\}{
-\insrsid6372845 s}{\insrsid6226036 ys\\}{\insrsid6372845 bin}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow3\irowband3\lastrow 
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth2835\clshdrawnil \cellx4395\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth5353\clshdrawnil \cellx9748\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid6226036 {\insrsid6226036 In this table, }{\i\insrsid6226036 ABI}{\insrsid6226036 
- refers to the flavour of ARM build required\emdash }{\insrsid6890489 e.g. ARM4. }{\insrsid6226036 The final component\emdash ProfilerKeys.dll\emdash 
-requires the full Window Server to function, thus it is optional and omitting from the installation will cause the profiler to provide a console UI instead of using hot keys.
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Running the profiler
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 To load the profiler, the Profiler.exe program must be execu
-ted on the target device, it then remains loaded until asked to exit.
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Profiler commands
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The Profiler understands four commands:
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth959\clshdrawnil 
-\cellx851\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8895\clshdrawnil \cellx9746\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 start\cell }{
-\insrsid6226036 Start sampling, if not already doing so.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow0\irowband0
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth959\clshdrawnil \cellx851\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8895\clshdrawnil \cellx9746\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 stop\cell }{
-\insrsid6226036 Stop sampling. If restarted, the new samples are added to the current trace data.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow1\irowband1
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth959\clshdrawnil \cellx851\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8895\clshdrawnil \cellx9746\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 close\cell }{
-\insrsid6226036 Stop sampling if necessary and then close the trace data file. If restarted, the current trace data is discarded and a new trace file started. This allows the file to be copied from the internal disk without having to unload the profiler.
-\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow2\irowband2\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth959\clshdrawnil \cellx851\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth8895\clshdrawnil \cellx9746\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 unload\cell }{\insrsid6226036 
-Stop sampling if necessary and unload the profiler. This first ensures that all trace data is saved before the program exits.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
-\trowd \irow3\irowband3\lastrow \ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth959\clshdrawnil \cellx851\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8895\clshdrawnil \cellx9746\row }\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid6372845 {\insrsid6372845 It also accepts the following options:
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthB3\trftsWidthA3\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth7903\clshdrawnil \cellx9746\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\b\insrsid6372845 -noui\cell }{\insrsid6372845 Starts profiler application without }{\insrsid12218284 user interface. }{\insrsid481371 Particularly}{\insrsid12218284  }{
-\insrsid481371 useful}{\insrsid12218284  on eshell window server system}{\insrsid2495527 s}{\insrsid12218284  with no touch sensitive screen.}{\insrsid6372845 
-\par }{\insrsid12218284 In such case, the profiler should be started from the ESHELL by:
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12218284 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12218284 start profiler start \endash noui
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12218284 and stopped by:
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12218284 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12218284 profiler exit\cell }\pard\plain 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6372845 \trowd \irow0\irowband0
-\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthB3\trftsWidthA3\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth7903\clshdrawnil \cellx9746\row }\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\b\insrsid6372845 -xiponly\cell }{\insrsid12218284 Suppresses any activity in the tool regarding non-XIP }{\insrsid15342006 support}{\insrsid12218284 
-. This is recommended option when r}{\insrsid2495527 unning the profiler tool on XIP-}{\insrsid12218284 only platforms.}{\insrsid6372845 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6372845 
-\trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthB3\trftsWidthA3\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth7903\clshdrawnil \cellx9746\row }\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\b\insrsid6816192 -drive=[drive letter]}{\b\insrsid6816192\charrsid6816192 \cell }{\insrsid6816192 
-Specify which drive to store the trace data file (PROFILER.DAT), where [drive letter] can be }{\insrsid13524902 one of the 26 drive letters, }{\insrsid6816192 \lquote A\rquote  to \lquote Z\rquote 
-.  When this drive letter option is not specified the default drive C is used.  If the file cannot be created at the specified drive the profiler will not start.\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6816192 \trowd \irow2\irowband2\lastrow 
-\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthB3\trftsWidthA3\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth7903\clshdrawnil \cellx9746\row }\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid6372845 {\insrsid6372845\charrsid6372845 
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Command line control
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The Profiler can be controll
-ed from the command line, by specifying the action as a parameter to the Profiler.exe program. If the profiler is already loaded, this will just pass on the control request to the running program, otherwise it will load the profiler ready for further comm
-ands. E.g. use the following command in ESHELL:
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 profiler start
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Console control
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
-The console UI is used if the ProfilerKeys.dll is not present on the device. When the console is in the foreground, it interprets the following keypresses to control the profiler:
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 Key\cell Action\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\insrsid6226036 \trowd \irow0\irowband0
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\row }\trowd \irow1\irowband1
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 s\cell }{\insrsid12218284 S}{
-\insrsid6226036 tart\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow1\irowband1
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 p\cell }{\insrsid12218284 S}{
-\insrsid6226036 top\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow2\irowband2
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 c\cell }{\insrsid12218284 C}{
-\insrsid6226036 lose\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow3\irowband3
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 x\cell unload\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow4\irowband4\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone 
-\clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\row 
-}\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 ?\cell Display the key mapping used to control the profiler\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
-\insrsid6226036 \trowd \irow5\irowband5\lastrow \ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\row }\pard\plain 
-\s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Hot key control
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
-If ProfilerKeys.dll is installed then the profiler hooks the following key combinations which can be used to control the profiler from any application:
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil \cellx6521\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 Key\cell Action\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\insrsid6226036 \trowd \irow0\irowband0
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil \cellx6521\row }\trowd \irow1\irowband1
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil \cellx6521\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Fn+Ctrl+Shift+1\cell start\cell 
-}\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil 
-\cellx6521\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Fn+Ctrl+Shift+2\cell stop\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
-\trowd \irow2\irowband2\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil 
-\cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil \cellx6521\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 
-Fn+Ctrl+Shift+3\cell close\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow3\irowband3
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil \cellx6521\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Fn+Ctrl+Shift+4\cell unload
-\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow4\irowband4\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil \cellx6521\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Fn+Ctrl+Shift+0\cell Display the current operation of the profiler in an infoprint\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow5\irowband5\lastrow \ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil 
-\cellx6521\row }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Programmatic control
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
-The profiler can also be controlled from within another program on the device by using the API defined in profiler.h. This defines the }{\f36\fs18\insrsid6226036 Profiler}{\insrsid6226036  class, which
- has static functions corresponding to each profiler command. Note that }{\f36\fs18\insrsid6226036 Profiler::Start()}{\insrsid6226036 
- will not load the profiler if it is not currently loaded, it will only cause an already loaded profiler to start sampling. It is possible to check for this possibility and use the command line to run the profiler using the following code:
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 if (Profiler::Start() == KErrNotFound)\line \tab \{\line \tab _LIT(KProfiler,"profiler");
-\line \tab _LIT(KStart,"start");\line \tab RProcess p;\line \tab if (p.Create(KProfiler,KStart) == KErrNone)\line \tab \tab \{\line \tab \tab p.Resume();\line \tab \tab p.Close();\line \tab \tab \}\line \tab \}
-\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid6226036 \page Analysing the trace data
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
-Once a trace data file has been obtained using the profiler, it needs to be transferred to a PC for analysis using the Analyse program, which should be present in the EPOC tools directory. Here are some example of standard 
-uses of the tool, followed by a complete command reference describing all of the options.
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Generating a full listing of the trace
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The full trace recorded in the trace file can be output in text form using the listing }{
-\f36\fs18\insrsid6226036 -listing}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -l}{\insrsid6226036 ) option:
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -listing
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
-This outputs one line for each sample, recording the sample number, thread ID and a PC value. A table mapping these thread IDs to thread names is provided at the end of the listing. By default, samples of the NULL thread are not shown\emdash processor
- inactivity can be detected by samples that are missing in the trace\emdash if necessary the NULL thread can be reported using the }{\f36\fs18\insrsid6226036 -null}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -n}{\insrsid6226036 ) option.
-\par A more interesting trace can be generated if a ROM symbol file matching the device ROM is available\emdash PC values are then displayed relative to symbols in the {\*\xmlopen\xmlns1{\factoidname country-region}}ROM.{\*\xmlclose} This is done using the }{
-\f36\fs18\insrsid6226036 -rom}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -r}{\insrsid6226036 ) command option:
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -rom \\epoc32\\rom\\myrom.symbol -listing
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Finding out where threads spend most of their time
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 A distribution of thread against location can be generated using the }{\f36\fs18\insrsid6226036 
--profile}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -p}{\insrsid6226036 ) command option\emdash this is the default if }{\f36\fs18\insrsid6226036 -l}{\insrsid6226036  and }{\f36\fs18\insrsid6226036 -v}{\insrsid6226036 
- are omitted. The address space can be divided up by address, by DLL or by function, the latter two requiring a symbol file. The following command will analyse the trace and report the amount of time spent by each thread in each function in the ROM:
-
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -rom \\epoc32\\rom\\myrom.symbol -byfunction
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 You may need a very wide command prompt to read the tablulated output
- sensibly. The output begins with a summary of the sample analysed: the total number of samples, the number of active samples (i.e. ignoring the NULL thread), and the number of samples analysed in the following report. Then there is a thread ID to name ma
-p
-ping, followed by a table with the threads across the top and the locations down the right side. The first row contains the proportion of time spent overall in that thread, the last column is the proportion of time spent by all threads in that function. N
-ote that both the threads and locations are sorted into descending order.
-\par Usually, the last few threads and locations are of no interest for analysis, and eliminating them makes the output easier to follow. A \lquote cut off\rquote  value can be supplied which eliminates
- the output of results for threads or locations which contain fewer samples than the provided value. The }{\f36\fs18\insrsid6226036 -cutoff}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -c}{\insrsid6226036 
-) option takes a number which is specified in percent, e.g.
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -r \\epoc32\\rom\\myrom.symbol -bf -cutuff0.5
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 This produces th
-e same results as last time, but does not report on any threads or locations with less than 0.5% of the overall samples.
-\par }{\insrsid12336355 When using the analyse tool with a symbol file, there is a limitation you should be aware of. C static functions (LOCAL_C functions) ar
-e not listed in the symbol file by the tools (they do not appear in the .map file). As a consequence of this, hits in these functions will be wrongly attributed to the functions right before of them in {\*\xmlopen\xmlns1{\factoidname country-region}}
-{\*\xmlopen\xmlns1{\factoidname country-region}}ROM.{\*\xmlclose}{\*\xmlclose}
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Finding out when threads are executing
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 A distribution of thread activity against time can be generated using the }{\f36\fs18\insrsid6226036 
--activity}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -v}{\insrsid6226036 ) command option. The following command will analyse the trace and report the amount of time spent by each thread in each block of 1000 samples (1 second):
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -activity -bysize1000
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 If the }{\f36\fs18\insrsid6226036 -bysize}{\insrsid6226036 
- parameter is omitted, a default value of 100 samples is used. The cutoff option can be used to eliminate threads that contribute little to the overall execution time.
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Restricting the analysis to certain samples
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Filters ca
-n be provided to restrict the analysis to specific samples in the trace. These options generally work for all types of output.
-\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Filtering by thread name
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The samples for a specific thread can be analysed using the }{\f36\fs18\insrsid6226036 -thread}{
-\insrsid6226036  (}{\f36\fs18\insrsid6226036 -t}{\insrsid6226036 ) option, this is followed by a basic wildcard pattern for the thread name to analyse. (The }{\f36\fs18\insrsid6226036 *}{\insrsid6226036 
- character can represent zero or more of any character). E.g. to analyse just the threads in the file server the following commands could be used:
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -r \\epoc32\\rom\\myrom.symbol -bf -thread efile*
-\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Filtering by dll name
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
-Analysis for the thread/location distribution can be restricted to DLLs matching a provided pattern using the }{\f36\fs18\insrsid6226036 -dll}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -d}{\insrsid6226036 
-) option. E.g. to restrict analysis to BitGdi.dll the following command could be used:
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -r \\epoc32\\rom\\myrom.symbol -bf -dll bitgdi.dll
-\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Filtering by function name
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
-Analysis can be even more specific by providing a DLL and function pattern to match. In this case, the first matching function in the first matching DLL is analysed by ad
-dress, defaulting to instruction-level granularity. This can provide code-path analysis for execution hotspots. E.g. to analyse execution in the }{\f36\fs18\insrsid6226036 ExecuteJava()}{\insrsid6226036  function the following command could be used:
-
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -r \\epoc32\\rom\\myrom.symbol -d pjavai.dll -function executejava
-
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Note that the \lquote function name\rquote 
- usually includes the signature of the parameters, so it is often effective to add a }{\f36\fs18\insrsid6226036 *}{\insrsid6226036  to the end of the function name for analysis.
-\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Filtering by sample number
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The }{\f36\fs18\insrsid6226036 -samples}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -s}{
-\insrsid6226036 ) option allows a
- specific range of samples to be analysed, rather than the entire file. This can be useful if the trace contains activity which should not be analysed, or for generating high-resolution activity traces for specific parts of the trace. E.g. to analyse 1000
- samples starting at sample number 2500, the following command could be used:
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -v -bs50 -samples2500+1000
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Generating graphs and charts from the output
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 By default, spaces are us
-ed when formatting the output resulting in tables that are easily read by eye. However, very often it helps to be able to generate charts from the tabulated data for visual analysis. The }{\f36\fs18\insrsid6226036 -formatexcel}{\insrsid6226036  (}{
-\f36\fs18\insrsid6226036 -mx}{\insrsid6226036 ) option instructs Analyse to format the output so t
-hat it is suitable for cut-and-paste into Microsoft Excel: using tabs rather than spaces, rearranging the tables for chart generation, and using numerical representation of sample data (rather than %). If the output from Analyse is directed to a file, thi
-s can then be opened by a text editor and the table can be pasted directly into Excel.
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0\pararsid735290 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid735290 Profiling Jazelle code
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid735290 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid735290 
-Profiler tool clears the LSB bit in every sample. This is because it is used for some other markings that help keep log file short. ARM and Thumb i
-nstructions always appear on even program addresses. However, Jazelle instructions are one byte long and can appear on any program address. As the consequence, sampling Jazelle code does not give the exact result. If a Jazelle instruction on odd program a
-ddress is sampled, it will be reported as the Jazelle instruction on the preceding even program address.}{\insrsid735290\charrsid735290 
-\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid6226036 \page Analyse command reference
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Command line
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse }{\f0\fs20\insrsid6226036 [ report-type ]}{\insrsid6226036  }{
-\f0\fs20\insrsid6226036 [ options ]}{\fs20\insrsid6226036  }{\i\f0\fs20\insrsid6226036 tracefile}{\insrsid6226036 
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Reports
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 
-Report type\cell Abbrev.\cell Description\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\insrsid6226036 \trowd \irow0\irowband0
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone 
-\clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl
-\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -listing}{\insrsid6226036 \cell }{
-\f36\fs18\insrsid6226036 -l}{\insrsid6226036 \cell Generate a listing of the trace\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow1\irowband1
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\trowd \irow2\irowband2\ts11\trgaph108\trrh221\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone 
-\clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -profile}{\insrsid6226036 \cell }{
-\f36\fs18\insrsid6226036 -p}{\insrsid6226036 \cell Generate a thread vs. location profile of the data. This is the default type of report.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
-\trowd \irow2\irowband2\ts11\trgaph108\trrh221\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\trowd \irow3\irowband3\lastrow \ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone 
-\clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835
-\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -activity}{
-\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -v}{\insrsid6226036 \cell Generate a thread activity profile of the data\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
-\trowd \irow3\irowband3\lastrow \ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 
-\b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Options
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 Option
-\cell Abbrev.\cell Description\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\insrsid6226036 \trowd \irow0\irowband0
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone 
-\clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl
-\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -help}{\insrsid6226036 \cell }{
-\f36\fs18\insrsid6226036 -h}{\insrsid6226036 \line }{\f36\fs18\insrsid6226036 -?}{\insrsid6226036 \cell Display a brief summary of the command line options\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
-\insrsid6226036 \trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid1653898 -help config\cell -h }{\f2\fs18\insrsid1653898\charrsid1653898 
-config}{\f36\fs18\insrsid1653898 \cell }{\insrsid1653898 Display an example of the config file\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid1653898 \trowd \irow2\irowband2
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -rom}{\insrsid6226036  }{\i\insrsid6226036 symbolfile}{\insrsid6226036 \cell }{
-\f36\fs18\insrsid6226036 -r }{\insrsid6226036 \'85\cell Supply a ROM symbol file}{\insrsid3948828  of the XIP image}{\insrsid6226036  for interpretation of PC values\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow3\irowband3\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone 
-\clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835
-\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -samples}{
-\i\insrsid6226036 range}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -s}{\insrsid6226036 \'85\cell Restrict the analysis to the sample range specified. The range can either be specified as }{\i\insrsid6226036 begin}{\f36\fs18\insrsid6226036 -}{
-\i\insrsid6226036 end}{\insrsid6226036  or as }{\i\insrsid6226036 begin}{\f36\fs18\insrsid6226036 +}{\i\insrsid6226036 count}{\insrsid6226036 , the sample numbers should be specified in decimal. So the following are equivalent:
-\par }{\f36\fs18\insrsid6226036 -samples2500-3500}{\insrsid6226036 \line }{\f36\fs18\insrsid6226036 -samples2500+1000}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
-\trowd \irow4\irowband4\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil 
-\cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -null}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -n}{\insrsid6226036 \cell Include
- the EPOC Kernel NULL thread in the analysis. This thread is ignored by default.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow5\irowband5
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -thread}{\insrsid6226036  }{\i\insrsid6226036 name}{\insrsid6226036 \cell }{
-\f36\fs18\insrsid6226036 -t }{\insrsid6226036 \'85\cell Restrict analysis to threads whose full name (}{\i\insrsid6226036 processname}{\insrsid6226036 ::}{\i\insrsid6226036 threadname}{\insrsid6226036 
-) matches the pattern provided. The pattern matching has a single wildcard character \lquote *\rquote , which will match zero or more of any character.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
-\insrsid6226036 \trowd \irow6\irowband6\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -dll }{\i\insrsid6226036 name}{\insrsid6226036 \cell }{
-\f36\fs18\insrsid6226036 -d }{\insrsid6226036 \'85\cell Restrict analysis to Dlls whose name matches the pattern provided.
-\par This option is only effective for a Profile report, and requires a ROM symbol file.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow7\irowband7
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -function }{\i\insrsid6226036 name}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -f }{
-\insrsid6226036 \'85\cell Restrict analysis to functions whose name matches the pattern provided. If }{\f36\fs18\insrsid6226036 -dll}{\insrsid6226036  is also specified, then only functions matching the pattern within a matching Dll are analysed.
-\par This option is only effective for a Profile report, and requires a ROM symbol file.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow8\irowband8
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -address}{\i\insrsid6226036 range}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -a}{
-\insrsid6226036 \'85\cell Restrict analysis to the address range specified. This may be useful if no symbol file is available when generating a Profile report. The range can either be specified as }{\i\insrsid6226036 begin}{\f36\fs18\insrsid6226036 -}{
-\i\insrsid6226036 end}{\insrsid6226036  or as }{\i\insrsid6226036 begin}{\f36\fs18\insrsid6226036 +}{\i\insrsid6226036 size}{\insrsid6226036 , the addresses should be specified in hexadecimal. So the following would both analyse the first 6Mb of the ROM:
-
-\par }{\f36\fs18\insrsid6226036 -address50000000-50600000}{\insrsid6226036 \line }{\f36\fs18\insrsid6226036 -address50000000+600000}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
-\insrsid6226036 \trowd \irow9\irowband9\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -by\'85}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -b\'85
-}{\insrsid6226036 \cell Determine the way in which the space is partitioned in a Profile or Activity report. Only one of the following four options should be specified:\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow10\irowband10\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil 
-\cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 
--bydll}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -bd}{\insrsid6226036 \cell Split the address space by Dll in a Profile report.
-\par This requires a ROM symbol file. It is the default partitioning if neither }{\f36\fs18\insrsid6226036 -dll}{\insrsid6226036  or }{\f36\fs18\insrsid6226036 \_function}{\insrsid6226036  are specified.\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow11\irowband11\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil 
-\cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 
--byfunction}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -bf}{\insrsid6226036 \cell Split the address space by function in a Profile report.
-\par This requires a ROM symbol file. It is the default partitioning if }{\f36\fs18\insrsid6226036 -dll}{\insrsid6226036  is specified without }{\f36\fs18\insrsid6226036 -function}{\insrsid6226036 .\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow12\irowband12\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil 
-\cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 
--bysize}{\i\insrsid6226036 size}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -bs}{\insrsid6226036 \'85\cell In a Profile report, this will split the address space into blocks of approximately }{\i\insrsid6226036 size}{\insrsid6226036 
- bytes. This assumes that either the }{\f36\fs18\insrsid6226036 -address}{\insrsid6226036  option has been used, or analysis is focussed on a single function using the }{\f36\fs18\insrsid6226036 -function}{\insrsid6226036 
- option. It is the default partitioning if }{\f36\fs18\insrsid6226036 -function}{\insrsid6226036  is specified, providing instruction level analysis.
-\par In an Activity report, this is the number of samples grouped in each line of the report. The default value of }{\i\insrsid6226036 size}{\insrsid6226036  in this case is 100 samples.\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow13\irowband13\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil 
-\cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 
--bynumber}{\i\insrsid6226036 count}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -bn}{\insrsid6226036 \'85\cell Split the address space into }{\i\insrsid6226036 count}{\insrsid6226036  \lquote buckets\rquote  in a Profile report.
-\par It is the default partitioning if }{\f36\fs18\insrsid6226036 -address}{\insrsid6226036  is specified, providing 100 buckets.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
-\trowd \irow14\irowband14\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil 
-\cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -cutoff}{\i\insrsid6226036 percent}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -c}{
-\insrsid6226036 \'85\cell Discard threads and locations from the output that account for less than }{\i\insrsid6226036 percent}{\insrsid6226036  samples in the analysis. }{\i\insrsid6226036 Percent}{\insrsid6226036 
- is a floating point percentage value, i.e. the following specifies a cutoff at 0.5%:
-\par }{\f36\fs18\insrsid6226036 -cutoff.5}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow15\irowband15
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -format\'85}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -m\'85}{\insrsid6226036 \cell 
-Modify the format of the reports. Any number of the following options can be concatenated into the option string, e.g.
-\par }{\f36\fs18\insrsid6226036 -formatexceltotalother}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow16\irowband16
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatpercent}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -mp}{\insrsid6226036 \cell 
-Report samples as a percentage of the total analysed. This is the default.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow17\irowband17
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatsamples}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -ms}{\insrsid6226036 \cell 
-Report the number of samples for each entry.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow18\irowband18
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatexcel}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -mx}{\insrsid6226036 \cell 
-Generate an excel compatible report for cut-and-paste.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow19\irowband19
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatzero\cell -mz}{\insrsid6226036 \cell 
-Report zero values explicitly. The default is to leave blanks.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow20\irowband20
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formattotal}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -mt}{\insrsid6226036 \cell 
-Just report the \lquote total\rquote  column in a Profile report, and discard the thread breakdown.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow21\irowband21
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatother}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -mo}{\insrsid6226036 \cell 
-Discard the \lquote other\rquote  location from a Profile report. This is where all samples that do not fit in another identified location are accumulated.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
-\insrsid6226036 \trowd \irow22\irowband22\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid5454414 -oby}{\f36\fs18\insrsid15342006 \cell }{
-\f36\fs18\insrsid5454414 -o}{\f36\fs18\insrsid15342006 \cell }{\insrsid5454414 Supply oby file of the non-XIP image}{\insrsid15342006 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid15342006 
-\trowd \irow23\irowband23\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil 
-\cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid3948828 -}{\f36\fs18\insrsid3948828\charrsid3948828 rofs}{\f36\fs18\insrsid5454414\charrsid3948828 
-\cell }{\f36\fs18\insrsid5454414 -z\cell }{\insrsid5454414 Supply symbol file of the }{\insrsid16414626 non-}{\insrsid5454414 XIP image\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid5454414 
-\trowd \irow24\irowband24\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil 
-\cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid3948828 -}{\f36\fs18\insrsid3948828\charrsid3948828 config\cell }{\f36\fs18\insrsid3948828 -x\cell }
-{\insrsid3948828 Supply configuration file. The file can contains all input argument and options. A template of the file is given in Appendix A.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
-\insrsid3948828 \trowd \irow25\irowband25\lastrow \ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 
-\b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Options used in each type of report
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\pard\plain 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 Option\cell Listing\cell Profile\cell Activity\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\insrsid6226036 \trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
-\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl
-\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -rom\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {
-\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone 
-\clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552
-\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -samples\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {
-\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 
-{\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow2\irowband2
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -null\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings"
- \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt
-\f10\fs20}}}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow3\irowband3
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -thread\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings"
- \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt
-\f10\fs20}}}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow4\irowband4
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -dll\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f 
-"Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow5\irowband5
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -function\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
- 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow6\irowband6
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -address\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
- 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow7\irowband7
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -bydll\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
- 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow8\irowband8
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -byfunction\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
- 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow9\irowband9
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -bysize\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
- 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow10\irowband10\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil 
-\cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -bynumber\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {
-\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
-\trowd \irow11\irowband11\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
-\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -cutoff\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
- 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow12\irowband12\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil 
-\cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatpercent\cell }\pard 
-\qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
- 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow13\irowband13
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatsamples\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
- 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow14\irowband14\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil 
-\cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatexcel\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 
-{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell 
-}\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow15\irowband15\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil 
-\cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatzero\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {
-\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell 
-}\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow16\irowband16\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil 
-\cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formattotal\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 
-{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
-\trowd \irow17\irowband17\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
-\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatother\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
- 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow18\irowband18
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid3948828 - o}{\f36\fs18\insrsid678217 by}{\f36\fs18\insrsid3948828 \cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid3948828 
-{\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell }{\insrsid3948828 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell \cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid3948828 \trowd \irow19\irowband19\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
-\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil 
-\cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid3948828 - }{\f36\fs18\insrsid678217 rofs}{\f36\fs18\insrsid3948828 \cell }\pard 
-\qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid3948828 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell }{\insrsid3948828 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings"
- \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid3948828 \trowd \irow20\irowband20
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid3948828 - }{\f36\fs18\insrsid678217 config}{\f36\fs18\insrsid3948828 \cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid3948828 
-{\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell }{\insrsid3948828 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell }{\insrsid3948828 {\field{\*\fldinst SYMBOL
- 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid3948828 \trowd \irow21\irowband21\lastrow 
-\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
-\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
-\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\insrsid678217 
-\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0\pararsid678217 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid678217 \page 
-Appendix A: non-XIP support and configuration file}{\insrsid6226036 
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid678217 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid10961137 N}{\insrsid678217 
-on-XIP executables are copied into RAM memory before being executed. Their run addresses are not known during ROM image build up. Therefore, corresponding symbol file does not contain run addresses of each particular function in the image, as }{
-\insrsid15867397 it}{\insrsid678217  is the case with XIP images. Instead, it contains the offset}{\insrsid11476477 s}{\insrsid678217  of the functions }{\insrsid10961137 within their }{\insrsid678217 e}{\insrsid5070621 xe}{\insrsid678217 cutables.
-\par }{\insrsid11476477 In order to calculate actual run addresses of non-XIP }{\insrsid15867397 functions}{\insrsid11476477 , the profiler tool also collects the events }{\insrsid5070621 of}{\insrsid10961137  non-XIP}{\insrsid11476477  code segment}{
-\insrsid10961137 s}{\insrsid11476477  creation/deletion. It uses Kernel debug interface and Kernel has to be built with }{\insrsid11476477\charrsid15342006 __DEBUGGER_SUPPORT__}{\insrsid3544718  option.}{\insrsid11476477 
-\par }{\insrsid3544718 During start}{\insrsid5070621 -}{\insrsid3544718 up of the }{\insrsid15867397 profiler }{\insrsid3544718 tool,}{\insrsid15867397  }{\insrsid3544718 the current list of all active non-XIP }{\insrsid10961137 code segments }{
-\insrsid3544718 are collected and stored into the c:\\profiler.dat. Once the profiling }{\insrsid10961137 is }{\insrsid3544718 started, the driver is still }{\insrsid481371 continuously}{\insrsid3544718  }{\insrsid10961137 monitoring}{\insrsid3544718 
- for such events and logs them into the file, alongside with sample data.
-\par }{\insrsid5070621 
-\par }{\insrsid15867397 For each particular non-XIP ima}{\insrsid481371 ge, both oby and symbol file have}{\insrsid15867397  to be provided to the analyse tool (XIP image requires only symbol }{\insrsid5070621 file}{\insrsid15867397 
-). As there could be more non-XIP images in the system, a more convenient way for passing input argument}{\insrsid481371 s}{\insrsid15867397  to analyse tool would }{\insrsid5070621 be }{\insrsid15867397 by }{\insrsid5070621 means of }{\insrsid15867397 
-configuration file.}{\insrsid3544718 
-\par }{\insrsid5070621 Below}{\insrsid15867397  is }{\insrsid481371 an}{\insrsid15867397  example of the configuration file to profile }{\insrsid9066106 NAND image of H2 Techview.}{\insrsid15867397 
-\par }{\insrsid5070621 It is used as:
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0\pararsid5070621 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid5070621 analyse \endash x analyse.cfg
-\par }\pard \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0\pararsid335316 {\insrsid5070621 
-\par }{\fs16\insrsid5070621\charrsid4540351 ;***************************
-\par }{\fs16\insrsid335316\charrsid4540351 ;Analase.cfg file
-\par [Common]
-\par TraceFile=PROFILER.DAT
-\par ;Mode=listing|profile|activity
-\par }{\fs16\insrsid10961137\charrsid4540351 Mode=profile}{\fs16\insrsid335316\charrsid4540351 
-\par SymbolFile=om_001.techview.nand.symbol
-\par ;Range=100-200 | 100+100
-\par ;IncludeNullThread=0|1
-\par 
-\par [Profile]
-\par Thread=
-\par Dll=
-\par Function=
-\par ;Range=1f1a+20 | 1f1a-1f3a
-\par Range=
-\par 
-\par [Partition]
-\par ;Mode=dll|function
-\par BucketSize=
-\par NumberOfBuckets=
-\par 
-\par [Format]
-\par ;Mode=percentages|samples|excel
-\par Mode=
-\par ;ZeroValues=0|1
-\par ZeroValues=
-\par ;NoOthers=0|1
-\par NoOthers=
-\par ;TotalOnly=0|1
-\par TotalOnly=
-\par 
-\par [NonXIP]
-\par ObyFile1=om_001.techview.nand.rofs.oby
-\par RofsSymbolFile1=om_001.techview.nand.rofs.symbol}{\fs16\insrsid9066106\charrsid4540351 
-\par }\pard \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0\pararsid5070621 {\fs16\insrsid5070621\charrsid4540351 ;***************************
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid1653898 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid1653898 Any option provided in the configur
-ation file can be overwritten by the same option in the command line.
-\par 
-\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0\pararsid1653898 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid10961137 \page 
-Appendix B: The format of the profiler.dat file}{\insrsid15867397 
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0\pararsid8592727 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392815}Basic Elements
-{\*\bkmkend _Toc100392815}
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Profiler.dat is built}{\insrsid5070621  up }{\insrsid8592727 
-from the following basic elements:
-\par {\listtext\pard\plain\fs20\insrsid8592727 \hich\af0\dbch\af0\loch\f0 -\tab}}\pard \ql \fi-360\li450\ri0\sb60\sa60\widctlpar\jclisttab\tx450\wrapdefault\faauto\ls5\rin0\lin450\itap0\pararsid8592727 {\insrsid8592727 UInt (32-bits unsigned integer);
-\par {\listtext\pard\plain\fs20\insrsid8592727 \hich\af0\dbch\af0\loch\f0 -\tab}Int (32-bit signed integer);
-\par {\listtext\pard\plain\fs20\insrsid8592727 \hich\af0\dbch\af0\loch\f0 -\tab}Text (up to 255 bytes long non-unicode text).
-\par }\pard \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 {\insrsid8592727 
-\par They are encoded as:
-\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0\pararsid8592727 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392816}UInt{\*\bkmkend _Toc100392816}
-
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 
-7 bits occupies a byte (starting from the least significant bits) with MSB=1 in the last byte. To decode, value should be extended to 32-bit length by 0s.
-\par }\trowd \irow0\irowband0\ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
-\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\pard\plain 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid481371\yts25 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 UInt}{\insrsid481371  (32 bits divided into groups of 7 bits)}{\insrsid8592727 \cell 
-Encoded as:\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow0\irowband0\ts25\trgaph108\trleft-108\trbrdrt
-\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
-\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row 
-}\trowd \irow1\irowband1\ts25\trgaph108\trrh301\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
-\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\pard\plain 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527\yts25 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\fs18\insrsid8592727\charrsid8592727 1001}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{
-\f2\fs18\insrsid8592727\charrsid8592727 1000110}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1000011}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1101100}{
-\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 0001101 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{
-\f2\fs18\insrsid8592727\charrsid8592727 1101100 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1000011 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1000110 }{
-\b\f2\fs18\insrsid8592727\charrsid8592727 1}{\i\f2\fs18\insrsid8592727\charrsid8592727 000}{\f2\fs18\insrsid8592727\charrsid8592727 1001\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 
-\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow1\irowband1\ts25\trgaph108\trrh301\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 
-\trbrdrv\brdrs\brdrw10 \trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 
-\clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil 
-\cellx9747\row }\trowd \irow2\irowband2\ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
-\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\pard\plain 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527\yts25 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\fs18\insrsid8592727\charrsid8592727 0000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{
-\f2\fs18\insrsid8592727\charrsid8592727 0000000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0000000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0001100}{
-\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 0001101 }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{
-\f2\fs18\insrsid8592727\charrsid8592727 0001100\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow2\irowband2
-\ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
-\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row 
-}\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527\yts25 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\fs18\insrsid8592727\charrsid8592727 0000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{
-\f2\fs18\insrsid8592727\charrsid8592727 0000000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0000000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0000000}{
-\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }\pard\plain 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow3\irowband3\lastrow \ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl
-\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
-\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row 
-}\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0\pararsid8592727 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392817}Int{\*\bkmkend _Toc100392817}
-
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 
-7 bits occupies a byte (starting from the least significant bits) with MSB=1 in the last byte. To decode, value should be extended to 32-bit length by the most significant bit.}{\insrsid8592727\charrsid8592727 
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508
-\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid481371 {
-\insrsid8592727 Int}{\insrsid481371  (32 bits divided into groups of 7 bits)}{\insrsid8592727 \cell Encoded as:\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid8592727 \trowd \irow0\irowband0
-\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 
-\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr
-\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row }\trowd \irow1\irowband1\ts11\trgaph108\trrh297\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv
-\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil 
-\cellx4508\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\f2\fs18\insrsid8592727\charrsid8592727 1001}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1000110}{
-\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1000011}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1101100}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{
-\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 0001101 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1101100 }{
-\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1000011 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1000110 }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{
-\b\i\f2\fs18\insrsid8592727\charrsid8592727 111}{\f2\fs18\insrsid8592727\charrsid8592727 1001\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f2\insrsid8592727 \trowd \irow1\irowband1
-\ts11\trgaph108\trrh297\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508
-\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row }\trowd \irow2\irowband2\ts11\trgaph108\trrh301\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl
-\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 
-\clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil 
-\cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\f2\fs18\insrsid8592727\charrsid8592727 1111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{
-\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{
-\f2\fs18\insrsid8592727\charrsid8592727 1111111\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{\f2\fs18\insrsid8592727\charrsid8592727 1111111\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
-\f2\insrsid8592727 \trowd \irow2\irowband2\ts11\trgaph108\trrh301\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508
-\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 
-{\f2\fs18\insrsid8592727\charrsid8592727 0111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{
-\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{
-\f2\fs18\insrsid8592727\charrsid8592727 1111111 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1111111 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1111111 }{
-\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1111111 }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{\b\i\f2\fs18\insrsid8592727\charrsid8592727 000}{\f2\fs18\insrsid8592727\charrsid8592727 0111}{
-\b\f2\fs18\insrsid8592727\charrsid8592727 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f2\insrsid8592727 \trowd \irow3\irowband3\ts11\trgaph108\trrh301\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl
-\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 
-\clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil 
-\cellx9747\row }\trowd \irow4\irowband4\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508
-\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {
-\f2\fs18\insrsid8592727\charrsid8592727 1111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{
-\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{
-\f2\fs18\insrsid8592727\charrsid8592727 1111111 }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{\f2\fs18\insrsid8592727\charrsid8592727 1111000\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
-\f2\insrsid8592727 \trowd \irow4\irowband4\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508
-\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 
-{\f2\fs18\insrsid8592727\charrsid8592727 0000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0000000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0000000}{
-\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0000000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{
-\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f2\insrsid8592727 \trowd \irow5\irowband5\lastrow \ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl
-\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 
-\clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil 
-\cellx9747\row }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0\pararsid8592727 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392818}Text
-{\*\bkmkend _Toc100392818}
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Supports up to 255 long non Unicode text:
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354
-\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid481371 {
-\insrsid8592727 Text\cell Encoded as:\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid8592727 \trowd \irow0\irowband0\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb
-\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
-\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil \cellx9747\row 
-}\trowd \irow1\irowband1\ts11\trgaph108\trrh297\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354
-\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {
-\f2\fs18\insrsid8592727\charrsid8592727 \'93Text\'94\cell 4, \lquote T\rquote , \lquote e\rquote , \lquote x\rquote , \lquote t\rquote \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f2\insrsid8592727 
-\trowd \irow1\irowband1\ts11\trgaph108\trrh297\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354
-\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil \cellx9747\row }\trowd \irow2\irowband2\ts11\trgaph108\trrh301\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl
-\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 
-\clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil 
-\cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\f2\fs18\insrsid8592727\charrsid8592727 \lquote x\rquote  times 255\cell 255, \lquote x\rquote  times 255\cell }\pard 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f2\insrsid8592727 \trowd \irow2\irowband2\ts11\trgaph108\trrh301\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 
-\trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
-\cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil \cellx9747\row }\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\f2\fs18\insrsid8592727\charrsid8592727 \'93\'94\cell 0\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
-\f2\insrsid8592727 \trowd \irow3\irowband3\lastrow \ts11\trgaph108\trrh301\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354
-\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil \cellx9747\row }\pard\plain 
-\s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0\pararsid8592727 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392819}Derived Elements
-{\*\bkmkend _Toc100392819}
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 The following derived elements are defined as well:
-\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0\pararsid8592727 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392820}Tag{\*\bkmkend _Toc100392820}
-
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid5070621 This is the header of the file.}{\insrsid8592727 
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0\pararsid8592727 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Tag = Text(\'93Profiler\'94) + UInt(MajorVersionNumber)
-\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0\pararsid8592727 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392821}Thread
-{\*\bkmkend _Toc100392821}
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 
-Contains processID and thread name. Also can contain process name if the process is seen for the first time:
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0\pararsid8592727 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 
-Thread(DThread*) = UInt(processID) [+ Text(processName) ]+ Text(threadName]
-\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0\pararsid8592727 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392822}Repeat
-{\*\bkmkend _Toc100392822}
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Encode repeated sequence of the same sample:
-\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0\pararsid8592727 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Repeat(x) = Int(0) + UI}{\insrsid12536172 nt(x)}{\insrsid8592727 :
-\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0\pararsid8592727 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392823}File build up
-{\*\bkmkend _Toc100392823}
-\par {\listtext\pard\plain\fs20\insrsid8592727 \hich\af0\dbch\af0\loch\f0 -\tab}}\pard\plain \ql \fi-360\li405\ri0\sb60\sa60\widctlpar\jclisttab\tx405\wrapdefault\faauto\ls6\rin0\lin405\itap0\pararsid12536172 
-\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 File starts with Tag element.
-\par {\listtext\pard\plain\fs20\insrsid8592727 \hich\af0\dbch\af0\loch\f0 -\tab}It is followed by samples that are recorded as:
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
-\cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid8592727 Sample description\cell Sample record\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
-\f2\insrsid8592727 \trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
-\cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid8592727 The first sample record}{\insrsid12536172 .}{\insrsid8592727 \cell }\pard\plain 
-\s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Int(PC | 1)
-\par }{\f2\fs20\insrsid8592727 UInt(threadID)
-\par UInt(processID)   ]
-\par Text(processName) ] Thread element
-\par Text(threadName)  ]\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow1\irowband1\ts11\trgaph108\trleft-108
-\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 
-\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr
-\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid481371 A s}{\insrsid8592727 
-ample record with a new thread and a new process seen\cell }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 
-Int((PC - PC of the previous sample) | 1)
-\par }{\f2\fs20\insrsid8592727 UInt(threadID)
-\par UInt(processID)   ]
-\par Text(processName) ] Thread element
-\par Text(threadName)  ]\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow2\irowband2\ts11\trgaph108\trleft-108
-\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 
-\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr
-\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid481371 A s}{\insrsid8592727 
-ample record with a new thread seen (with already known process)\cell }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 
-Int((PC - PC of the previous sample) | 1)
-\par }{\f2\fs20\insrsid8592727 UInt(threadID)
-\par UInt(processID)   ]
-\par Text(threadName)  ] Thread element\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow3\irowband3
-\ts11\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
-\cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid481371 A s}{\insrsid8592727 ample record with already known thread\cell }\pard\plain 
-\s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Int((PC - PC of the previous sample) | 1)
-\par }{\f2\fs20\insrsid8592727 UInt(threadID)\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow4\irowband4
-\ts11\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
-\cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid481371 A s}{\insrsid8592727 ample with the same thread ID as the previous sample\cell }\pard\plain 
-\s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Int(PC - PC of the previous sample)\cell }\pard\plain 
-\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow5\irowband5\ts11\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl
-\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 
-\clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
-\cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid481371 A s}{\insrsid8592727 
-amples with the same PC and threadID that repeat N consecutive times\cell }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {
-\insrsid8592727 <Any sample record described above>
-\par Repeat(N-1)\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 \trowd \irow6\irowband6\lastrow \ts11\trgaph108\trleft-108\trbrdrt
-\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt
-\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
-\cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0\pararsid12536172 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {
-\insrsid12536172 {\*\bkmkstart _Toc100392824}Non-XIP code support{\*\bkmkend _Toc100392824}
-\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid12536172 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 
-The record of non-XIP DCodeSeg creation/deletion can be inserted between any two consecutive sample records. It can also appea}{\insrsid5070621 r immediately after Tag element or just before Repeat element.}{\insrsid12536172 
-\par All records (samples and DCodeSeg) are placed in chronological order.
-\par }\pard\plain \s26\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid12536172 \f2\fs20\lang2057\langfe1033\cgrid\langnp2057\langfenp1033 {\insrsid12536172 
-\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trkeep\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4788\clshdrawnil \cellx4348\clvertalt
-\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5688\clshdrawnil \cellx9747\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 
-\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 Description\cell Recorded as\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid12536172 \trowd \irow0\irowband0
-\ts11\trgaph108\trleft-108\trkeep\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4788\clshdrawnil \cellx4348\clvertalt
-\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5688\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {
-\insrsid12536172\charrsid3154883 The record of nonXIP code segment creation. CodeSegFullName contains full path of the file name. If it is longer then 255 characters, the last 255 characters will be recorded.\cell }\pard\plain 
-\s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 Int(0)
-\par UInt(0)
-\par UInt(CodeSegRunAddress)
-\par UInt(CodeSegSize)
-\par Text(CodeSegFullName)\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 \trowd \irow1\irowband1
-\ts11\trgaph108\trleft-108\trkeep\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4788\clshdrawnil \cellx4348\clvertalt
-\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5688\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {
-\insrsid12536172 The record of nonXIP code segment deletion\cell }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 Int(0)
-
-\par UInt(0)
-\par UInt(CodeSegRunAddress | 1)\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 \trowd \irow2\irowband2
-\ts11\trgaph108\trleft-108\trkeep\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
-\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4788\clshdrawnil \cellx4348\clvertalt
-\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5688\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {
-\insrsid12536172 Footer. Resides at the bottom of the file. 
-\par }{\insrsid481371\charrsid16604991 RowBufferErrCounter}{\insrsid481371  }{\insrsid5055728 is the number of the dropped sample records due to full buffer condition in the driver.}{\insrsid481371 
-\par }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid5055728 {\insrsid5055728\charrsid16604991 CookBufferErrCounter}{\insrsid5055728 
- is the number of the dropped code segment events due to full buffer condition in the driver.
-\par }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid5055728 \cell }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 
-\f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 Int(0)
-\par UInt(0)
-\par UInt(0)
-\par UInt(}{\insrsid12536172\charrsid16604991 RowBufferErrCounter}{\insrsid12536172 )
-\par UInt(}{\insrsid12536172\charrsid16604991 CookBufferErrCounter}{\insrsid12536172 )
-\par UInt(ReportBitMask) where:
-\par   bit 0 set in }{\insrsid12536172\charrsid5403878 NonXIPMode}{\insrsid12536172 
-\par   bit 1 set if }{\insrsid12536172\charrsid5403878 NonXIPMode}{\insrsid12536172  but Kernel
-\par             hasn\rquote t got debu}{\insrsid5070621 g}{\insrsid12536172 ger support}{\insrsid12536172\charrsid5403878 \cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 
-\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 \trowd \irow3\irowband3\lastrow \ts11\trgaph108\trleft-108\trkeep\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 
-\trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
-\cltxlrtb\clftsWidth3\clwWidth4788\clshdrawnil \cellx4348\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5688\clshdrawnil \cellx9747\row }\pard 
-\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid678217 {\insrsid10961137 
+{\rtf1\ansi\ansicpg1252\uc1\deff0\stshfdbch0\stshfloch0\stshfhich0\stshfbi0\deflang2057\deflangfe2057{\fonttbl{\f0\froman\fcharset0\fprq2{\*\panose 02020603050405020304}Times New Roman;}{\f1\fswiss\fcharset0\fprq2{\*\panose 020b0604020202020204}Arial;}
+{\f2\fmodern\fcharset0\fprq1{\*\panose 02070309020205020404}Courier New;}{\f3\froman\fcharset2\fprq2{\*\panose 05050102010706020507}Symbol;}{\f10\fnil\fcharset2\fprq2{\*\panose 05000000000000000000}Wingdings;}
+{\f35\fswiss\fcharset0\fprq2{\*\panose 020b0604030504040204}Tahoma;}{\f36\fmodern\fcharset0\fprq1{\*\panose 020b0609040504020204}Lucida Console;}{\f37\froman\fcharset238\fprq2 Times New Roman CE;}{\f38\froman\fcharset204\fprq2 Times New Roman Cyr;}
+{\f40\froman\fcharset161\fprq2 Times New Roman Greek;}{\f41\froman\fcharset162\fprq2 Times New Roman Tur;}{\f42\froman\fcharset177\fprq2 Times New Roman (Hebrew);}{\f43\froman\fcharset178\fprq2 Times New Roman (Arabic);}
+{\f44\froman\fcharset186\fprq2 Times New Roman Baltic;}{\f45\froman\fcharset163\fprq2 Times New Roman (Vietnamese);}{\f47\fswiss\fcharset238\fprq2 Arial CE;}{\f48\fswiss\fcharset204\fprq2 Arial Cyr;}{\f50\fswiss\fcharset161\fprq2 Arial Greek;}
+{\f51\fswiss\fcharset162\fprq2 Arial Tur;}{\f52\fswiss\fcharset177\fprq2 Arial (Hebrew);}{\f53\fswiss\fcharset178\fprq2 Arial (Arabic);}{\f54\fswiss\fcharset186\fprq2 Arial Baltic;}{\f55\fswiss\fcharset163\fprq2 Arial (Vietnamese);}
+{\f57\fmodern\fcharset238\fprq1 Courier New CE;}{\f58\fmodern\fcharset204\fprq1 Courier New Cyr;}{\f60\fmodern\fcharset161\fprq1 Courier New Greek;}{\f61\fmodern\fcharset162\fprq1 Courier New Tur;}{\f62\fmodern\fcharset177\fprq1 Courier New (Hebrew);}
+{\f63\fmodern\fcharset178\fprq1 Courier New (Arabic);}{\f64\fmodern\fcharset186\fprq1 Courier New Baltic;}{\f65\fmodern\fcharset163\fprq1 Courier New (Vietnamese);}{\f387\fswiss\fcharset238\fprq2 Tahoma CE;}{\f388\fswiss\fcharset204\fprq2 Tahoma Cyr;}
+{\f390\fswiss\fcharset161\fprq2 Tahoma Greek;}{\f391\fswiss\fcharset162\fprq2 Tahoma Tur;}{\f392\fswiss\fcharset177\fprq2 Tahoma (Hebrew);}{\f393\fswiss\fcharset178\fprq2 Tahoma (Arabic);}{\f394\fswiss\fcharset186\fprq2 Tahoma Baltic;}
+{\f395\fswiss\fcharset163\fprq2 Tahoma (Vietnamese);}{\f396\fswiss\fcharset222\fprq2 Tahoma (Thai);}{\f397\fmodern\fcharset238\fprq1 Lucida Console CE;}{\f398\fmodern\fcharset204\fprq1 Lucida Console Cyr;}
+{\f400\fmodern\fcharset161\fprq1 Lucida Console Greek;}{\f401\fmodern\fcharset162\fprq1 Lucida Console Tur;}}{\colortbl;\red0\green0\blue0;\red0\green0\blue255;\red0\green255\blue255;\red0\green255\blue0;\red255\green0\blue255;\red255\green0\blue0;
+\red255\green255\blue0;\red255\green255\blue255;\red0\green0\blue128;\red0\green128\blue128;\red0\green128\blue0;\red128\green0\blue128;\red128\green0\blue0;\red128\green128\blue0;\red128\green128\blue128;\red192\green192\blue192;\red255\green255\blue255;
+}{\stylesheet{\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \snext0 Normal;}{\s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 
+\b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext0 heading 1;}{\s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 
+\b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext0 heading 2;}{\s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 
+\sbasedon0 \snext0 heading 3;}{\s4\ql \li0\ri0\sb240\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel3\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext0 heading 4;}{
+\s9\ql \li0\ri0\sb240\sa60\widctlpar\wrapdefault\faauto\outlinelevel8\rin0\lin0\itap0 \b\i\f1\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext0 heading 9;}{\*\cs10 \additive \ssemihidden Default Paragraph Font;}{\*
+\ts11\tsrowd\trftsWidthB3\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tblind0\tblindtype3\tscellwidthfts0\tsvertalt\tsbrdrt\tsbrdrl\tsbrdrb\tsbrdrr\tsbrdrdgl\tsbrdrdgr\tsbrdrh\tsbrdrv 
+\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \fs20\lang1024\langfe1024\cgrid\langnp1024\langfenp1024 \snext11 \ssemihidden Normal Table;}{\s15\ql \li0\ri0\sb60\sa60\widctlpar\brdrb\brdrs\brdrw15\brsp20 
+\tqc\tx4153\tqr\tx9639\wrapdefault\faauto\rin0\lin0\itap0 \f1\fs16\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext15 header;}{\s16\ql \li0\ri0\sb60\sa60\widctlpar\brdrt\brdrs\brdrw15\brsp20 
+\tqc\tx4153\tqr\tx9639\wrapdefault\faauto\rin0\lin0\rtlgutter\itap0 \f1\fs16\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext16 footer;}{\s17\ql \li0\ri0\sb60\sa120\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 
+\fs22\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext17 DocumentSubTitle;}{\s18\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \b\fs21\cf8\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 
+\sbasedon0 \snext18 Tabletitle;}{\*\cs19 \additive \f1 \sbasedon10 Filename;}{\*\cs20 \additive \b\f36 \sbasedon10 Syntax Literal;}{\*\cs21 \additive \i \sbasedon10 Syntax Element;}{\s22\ql \li851\ri851\sb60\sa240\keep\widctlpar\brdrt
+\brdrs\brdrw15\brsp20 \brdrb\brdrs\brdrw15\brsp20 \wrapdefault\faauto\rin851\lin851\rtlgutter\itap0 \fs24\lang1033\langfe2057\cgrid\langnp1033\langfenp2057 \sbasedon0 \snext0 Syntax;}{
+\s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext23 Comamnd;}{\s24\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 
+\f35\fs16\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 \sbasedon0 \snext24 \ssemihidden \styrsid6372845 Balloon Text;}{\*\ts25\tsrowd\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 
+\trbrdrv\brdrs\brdrw10 \trftsWidthB3\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tblind0\tblindtype0\tscellwidthfts0\tsvertalt\tsbrdrt\tsbrdrl\tsbrdrb\tsbrdrr\tsbrdrdgl\tsbrdrdgr\tsbrdrh\tsbrdrv 
+\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang1024\langfe1024\cgrid\langnp1024\langfenp1024 \sbasedon11 \snext25 \styrsid678217 Table Grid;}{
+\s26\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \f2\fs20\lang2057\langfe1033\cgrid\langnp2057\langfenp1033 \sbasedon0 \snext26 \styrsid8592727 Body Text;}{\*\cs27 \additive \sbasedon10 \styrsid11890070 f40;}}
+{\*\listtable{\list\listtemplateid-1714398180\listsimple{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat0\levelspace0\levelindent0{\leveltext\'01*;}{\levelnumbers;}\hres0\chhres0 }{\listname ;}\listid-2}
+{\list\listtemplateid1604386730\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li720
+\jclisttab\tx720\lin720 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li1440
+\jclisttab\tx1440\lin1440 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li2160
+\jclisttab\tx2160\lin2160 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li2880
+\jclisttab\tx2880\lin2880 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li3600
+\jclisttab\tx3600\lin3600 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li4320
+\jclisttab\tx4320\lin4320 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li5040
+\jclisttab\tx5040\lin5040 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li5760
+\jclisttab\tx5760\lin5760 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li6480
+\jclisttab\tx6480\lin6480 }{\listname ;}\listid227346643}{\list\listtemplateid597999524\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698689
+\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li720\jclisttab\tx720\lin720 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698691
+\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li1440\jclisttab\tx1440\lin1440 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698693
+\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li2160\jclisttab\tx2160\lin2160 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698689
+\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li2880\jclisttab\tx2880\lin2880 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698691
+\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li3600\jclisttab\tx3600\lin3600 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698693
+\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li4320\jclisttab\tx4320\lin4320 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698689
+\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li5040\jclisttab\tx5040\lin5040 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698691
+\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li5760\jclisttab\tx5760\lin5760 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace360\levelindent0{\leveltext\leveltemplateid67698693
+\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li6480\jclisttab\tx6480\lin6480 }{\listname ;}\listid607854900}{\list\listtemplateid-2132086688\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat0
+\levelspace45\levelindent0{\leveltext\leveltemplateid-1068182316\'01-;}{\levelnumbers;}\loch\af0\hich\af0\dbch\af0\fbias0\hres0\chhres0 \fi-360\li450\jclisttab\tx450\lin450 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1
+\levelspace45\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li1485\jclisttab\tx1485\lin1485 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45
+\levelindent0{\leveltext\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li2205\jclisttab\tx2205\lin2205 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0
+{\leveltext\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li2925\jclisttab\tx2925\lin2925 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
+\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li3645\jclisttab\tx3645\lin3645 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
+\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li4365\jclisttab\tx4365\lin4365 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
+\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li5085\jclisttab\tx5085\lin5085 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
+\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li5805\jclisttab\tx5805\lin5805 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
+\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li6525\jclisttab\tx6525\lin6525 }{\listname ;}\listid1202405001}{\list\listtemplateid1624279010\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0
+\levelfollow0\levelstartat0\levelspace0\levelindent0{\leveltext\leveltemplateid-1068182316\'01-;}{\levelnumbers;}\loch\af0\hich\af0\dbch\af0\fbias0\hres0\chhres0 \fi-360\li405\jclisttab\tx405\lin405 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0
+\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li1125\jclisttab\tx1125\lin1125 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0
+\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li1845\jclisttab\tx1845\lin1845 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1
+\levelspace0\levelindent0{\leveltext\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li2565\jclisttab\tx2565\lin2565 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0
+\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li3285\jclisttab\tx3285\lin3285 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li4005\jclisttab\tx4005\lin4005 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li4725\jclisttab\tx4725\lin4725 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li5445\jclisttab\tx5445\lin5445 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid134807557
+\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li6165\jclisttab\tx6165\lin6165 }{\listname ;}\listid1562641293}{\list\listtemplateid1239692824\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat0
+\levelspace45\levelindent0{\leveltext\leveltemplateid-1068182316\'01-;}{\levelnumbers;}\loch\af0\hich\af0\dbch\af0\fbias0\hres0\chhres0 \fi-360\li405\jclisttab\tx405\lin405 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1
+\levelspace45\levelindent0{\leveltext\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li1440\jclisttab\tx1440\lin1440 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45
+\levelindent0{\leveltext\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li2160\jclisttab\tx2160\lin2160 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0
+{\leveltext\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li2880\jclisttab\tx2880\lin2880 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
+\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li3600\jclisttab\tx3600\lin3600 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
+\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li4320\jclisttab\tx4320\lin4320 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
+\leveltemplateid134807553\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-360\li5040\jclisttab\tx5040\lin5040 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
+\leveltemplateid134807555\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \fi-360\li5760\jclisttab\tx5760\lin5760 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace45\levelindent0{\leveltext
+\leveltemplateid134807557\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \fi-360\li6480\jclisttab\tx6480\lin6480 }{\listname ;}\listid1755588230}}{\*\listoverridetable{\listoverride\listid-2\listoverridecount1{\lfolevel\listoverrideformat
+{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelold\levelspace0\levelindent283{\leveltext\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \fi-283\li283\lin283 }}\ls1}{\listoverride\listid607854900
+\listoverridecount0\ls2}{\listoverride\listid227346643\listoverridecount0\ls3}{\listoverride\listid1562641293\listoverridecount0\ls4}{\listoverride\listid1202405001\listoverridecount0\ls5}{\listoverride\listid1755588230\listoverridecount0\ls6}}
+{\*\rsidtbl \rsid212434\rsid335316\rsid481371\rsid678217\rsid735290\rsid1653898\rsid2495527\rsid3154883\rsid3544718\rsid3948828\rsid4207626\rsid4285936\rsid4540351\rsid5055728\rsid5070621\rsid5196648\rsid5403878\rsid5454414\rsid6226036\rsid6254420
+\rsid6307333\rsid6310753\rsid6358148\rsid6372845\rsid6816192\rsid6890489\rsid7406415\rsid7810845\rsid8289572\rsid8334973\rsid8592727\rsid9066106\rsid9120167\rsid10028869\rsid10304687\rsid10551457\rsid10961137\rsid11476477\rsid11748829\rsid11890070
+\rsid12218284\rsid12285517\rsid12334294\rsid12336355\rsid12536172\rsid13524902\rsid14296482\rsid15020123\rsid15342006\rsid15867397\rsid16414626\rsid16604991}{\*\generator Microsoft Word 10.0.6818;}{\info{\title Standard:_}{\author Andrew Thoelke}
+{\operator lukaszforynski}{\creatim\yr2000\mo9\dy26\hr14\min25}{\revtim\yr2007\mo7\dy9\hr14\min59}{\printim\yr2000\mo9\dy27\hr13\min29}{\version26}{\edmins1541}{\nofpages14}{\nofwords3744}{\nofchars21344}{\*\company Symbian}{\nofcharsws25038}
+{\vern16393}{\*\password 00000000}}{\*\xmlnstbl {\xmlns1 urn:schemas-microsoft-com:office:smarttags}}\paperw11907\paperh16840\margl1134\margr1134\margt1134\margb1134\gutter0 
+\widowctrl\ftnbj\aenddoc\noxlattoyen\expshrtn\noultrlspc\dntblnsbdb\nospaceforul\hyphcaps0\formshade\horzdoc\dghspace120\dgvspace120\dghorigin1701\dgvorigin1984\dghshow0\dgvshow3\jcompress\viewkind1\viewscale100\nolnhtadjtbl\rsidroot6254420 \fet0
+{\*\wgrffmtfilter 013f}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\headerr \pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\pvpara\phmrg\posxr\posy0\dxfrtext181\dfrmtxtx181\dfrmtxty0\nowrap\faauto\rin0\lin0\itap0 
+\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid4207626 {\*\shppict{\pict{\*\picprop\shplid1026{\sp{\sn shapeType}{\sv 75}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\sp{\sn fLine}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}
+{\sp{\sn fLayoutInCell}{\sv 1}}}\picscalex17\picscaley17\piccropl0\piccropr0\piccropt0\piccropb0\picw23813\pich6615\picwgoal13500\pichgoal3750\pngblip\bliptag1016976793{\*\blipuid 3c9dd5997eca05e5285611ada434fb29}
+89504e470d0a1a0a0000000d4948445200000384000000fa0803000000ce507925000000017352474200aece1ce900000300504c5445ffffffffffccffff99ff
+ff66ffff33ffff00ffccffffccccffcc99ffcc66ffcc33ffcc00ff99ffff99ccff9999ff9966ff9933ff9900ff66ffff66ccff6699ff6666ff6633ff6600ff33
+ffff33ccff3399ff3366ff3333ff3300ff00ffff00ccff0099ff0066ff0033ff0000ccffffccffccccff99ccff66ccff33ccff00ccccffcccccccccc99cccc66
+cccc33cccc00cc99ffcc99cccc9999cc9966cc9933cc9900cc66ffcc66cccc6699cc6666cc6633cc6600cc33ffcc33cccc3399cc3366cc3333cc3300cc00ffcc
+00cccc0099cc0066cc0033cc000099ffff99ffcc99ff9999ff6699ff3399ff0099ccff99cccc99cc9999cc6699cc3399cc009999ff9999cc9999999999669999
+339999009966ff9966cc9966999966669966339966009933ff9933cc9933999933669933339933009900ff9900cc99009999006699003399000066ffff66ffcc
+66ff9966ff6666ff3366ff0066ccff66cccc66cc9966cc6666cc3366cc006699ff6699cc6699996699666699336699006666ff6666cc66669966666666663366
+66006633ff6633cc6633996633666633336633006600ff6600cc66009966006666003366000033ffff33ffcc33ff9933ff6633ff3333ff0033ccff33cccc33cc
+9933cc6633cc3333cc003399ff3399cc3399993399663399333399003366ff3366cc3366993366663366333366003333ff3333cc333399333366333333333300
+3300ff3300cc33009933006633003333000000ffff00ffcc00ff9900ff6600ff3300ff0000ccff00cccc00cc9900cc6600cc3300cc000099ff0099cc00999900
+99660099330099000066ff0066cc0066990066660066330066000033ff0033cc0033990033660033330033000000ff0000cc0000990000660000330000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000199e9ab4000000097048
+597300000ec300000ec301c76fa8640000207149444154785eed9dd981ebb80e446f3e9d4fe7d3f9389f4967b478d142f214b899b6d05ff3de9548a050058094
+4cfdfbe77f8e8023e00838027d10f8f9fdbbfdf499ca6771041c8123029300ff9bff5c84ce0d47e00d084c057011e0fcf7fb86f9a7297f5f7fef31c0677504de
+85c0dc813e0538ffc7df3b2cd94870fecf7798e0733a02ef40e024c03789f0204197e13bc8e073f647e0e750009fd5f0d6db9680045d86bd83e0f3f546e0d881
+eedad1de228c68d07bd2deacf0f97a2110ec40df29c2a8065d85bd38e1f37445e07727b7c8ffe86b514284be3fd335143e591f047e4613614a825e0afb90c267
+e98cc06789d04b61677af8743d10d83f120c4bb2871df739d285d01f18760c854fd50d81f5cdb4f45fc7f7d65c84dd22ef130d83c05822440d7a3f3a0c73dc90
+6a0828dba3fd2a218bd055582df43ed0280828dba32ec251a2e5767c2702b420ecf95b26a1107a25fc4e1a5edb2b17e1b5e3efde0f80c0a789d04be100a47113
+ea22203c28ecb62654da511761ddf8fb6803202088b0dbaf7a5d840310c24de88f80f0a0d045d83f2c3ee39510f834115e2936eeeb451070115e24d0eee6b808
+8c24c2ed096bb1f5e1b848ba658e4026022ec24ce0fc3647a01602c2cba3dd3666844a58cb6d1fc711180701e1e5d17e2264158e039c5be208d442c045580b49
+1fc711c844602c115229cc74d26f73044646e0a3443832906e9b23908bc060224c97c25c27fd3e476064044613614a8523e3e8b63902d9080c27c2b80ab37df4
+1b1d81a111184f8431150e0da31be708e42330a008771f087dbcbe96efa1dfe9080c8ec090223c15c3c14174f31c811204c614e1e4917f2ebb24ac7eef272130
+ac083f0944b7d5112841c04558829edfeb085440c0455801441fc2112841c04558829edfeb085440c0455801441fc2112841c04558829edfeb085440c0455801
+441fc2112841c04558829edfeb085440c0455801441fc2112841c04558829edfeb085440c0455801441fc2112841c04558829edfeb085440c0455801441fc211
+2841c04558829edfeb085440c0455801441fc2112841606c1176fb487009847eaf235086c0c022fcf99bff5c8765017edcfdb3c0795bfe56607f1cda3ad0168f
+922dc229868fbf62234203ac12fc1215be95ef1392d18fa24f7a7cab6d4da8b30efaf30b83cff4fd5d92514136ba0ff25b36c87ff8777466b2fc18d4399675f1
+7c6ab0fac8a1d2b0568709c9ba4eaca32d706923cf215decd02e676bcfa10a85fb561ebda5d0de2647d9a61e572c7ec75538fdf39ec253fc49b347b343329846
+c9899c5009b7c3fefc4693ea7f763f12e178d4c106b570e64bd28b1c1c23ae3cf1a24f5b9d439a19d08d21bfc2c7279f9acc13e2524b7684b672b9be245f1c0d
+8efd130dfe4d575002da0c1998449850e03d98e67c1289c15683356b61207d054a43068e213f766528a1ec042df24b944981e6e82d892c98c928dbc44527a50c
+4890537c37f13cdb12877abd4de22f436b0c9b41841248931f150ac95e837ff981dd859cc1db06b02ca59fa21df3818cba6539cfe932b20a49b3f05cf8cec364
+97b67877f29ae4961afdd47b1faffe11287ca3b80b634cf6e2305b4764116a73afe9a454869b05e15d8ed9917dae00336899ed475058e1dd275c91e7e06988d5
+79fe445f2a8d9b1b7c818989655e789db413d48fa2f2593f290f240816500d32145c9f6d521d78f435b99158997a2c84c50d6986025720ed7e441b9e7386d541
+355543e10be820fd187fa4914db66e57b04a3e0ac663df836e87d9d8a2833d559158ce9700782db355f66822d4f5ffb0203714b3fbe74258d49052c3970cbe4d
+86a9a98e88585891dae93b10c6366cccf74813ace824d931263a1aa54e055895deff7dce67637038ea7668451508229c2a9302fee11a1b7b77c13917c2fc5248
+2b71f64c04724a1d40a39d8fcaf264679b68464ea8c218849a71697435ffef052910f1948a527bf5ab53775becf209ac0c25e70f586a51137cffa7e4a8402035
+03ceb9315408334ba199ea213e4ae944c0711bd78c802a66d8c9964a4267194aed18ed6c84aba134f4fe56e196958319689f5ad24c68a5be80c913de89e60a32
+ada8f2b6534285304b84b92bc1936f0aad18905752ca0c28961881956ce6f68a93f095dbf392af2294e3c86ccd424165e8f350fbc9b2a15544c022644fe35720
+6d42320d8bd03c541ef491d68cd3094ff70c075f1a411430c8264a22c407194aa63358812b149a1d93a1608d794ff165c75685c24cd1e535c3d15684893787a2
+a685bb516329acd2876e60e5ec2e28607539b30c6e973861ec0a889250c05ef88297864d24ebdee8d16f81bc3fc23531ef5f41cf5c90ad0333770a6c54725786
+0ac385d0b435535b820a9202900b9fcba492c8aa65033311d7a995a033ebce6e28d69fc7e5bbf88a8447f7ca5b923625150adc51708f5fa3aca7b631891542bd
+143690a0a242ce9693084be3195f6114b14d5f5048d3700376ba4221d9b91b970ab33274aaff2f97082da5ca67201f8d2a2c16a14413323af0efe407cffb5758
+0653599567cf7039d04a49b427d29d45aa0c1b4a40594e196e9af3a6e1f2c8a5b43953610a32d2169258372af6a38dc838fb58bc2d420f1209c8e5dfc3562824
+96863f5c749e4d19c5de8f2a610b8dcaed87626ffc9a5b0d0d22753a8890d8bbcb8bf142a8f4a3d51e4a84c202f9ac07929359412b5acd1de0bd2217cafce74a
+a84825947e146b94b1a3d7d4996000ea58625222c2d20517450b1ad2d659f96e5e888bada60ecc25d55c5bf3a3b57c411649d6505c3bfc7b1a90563974e798a1
+3d8977a3d88fb60f487ac3a14ed244466456271c37704190f7ca40b47e3e02a940171cb30b7d158fe19ab402fa78a107656811a6a1549854219ee703249ac530
+98bf15370d5977d1a352c9c3c5a406a01dc6483783cd02b8f74ced4f52dd282e0a955096019e2c85ed2bf16afc29a3b5f23bcc1c8931b68714ca90115db7f2bd
+8c27e7bb930250fcaf6090ba2c2c12617b5f9215bdfdf46b208e5836137f84380aeff5d6477d812132a252972bf0b778882198234625d58de2a2b0c26338003b
+9d4b8a23250e7028338a28c4917797c59c55786feb47150f22b5553126c7f9daf72401e995bec5a3f0ca4428bd5455046fb2ab50b85434fbfde67d42eb5d08a5
+27676ae7b3be4d2b801223f1a788300988028080115f22e5c674378a8bc27fcd08f9f02f59d07b89700fa571d6fbf9dbd349abd9559fee9c0756370166112a51
+8b01df8dbfccf0f415a955723f2794b0948a50da662b813399d07a65e59d1196001e8f724c1e00198f97e2a79473efc454441de3b0c5fd92c017df9ba27f3f27
+94b0a4bb51ae8452675384672aa129e42c9afc71f3d6087dd2c8f14d91435a12e946e18ca11f55868b9247b9b90ae6a5838c2142a54321117235d53999876aca
+02a5adca9bf570d75684f280894e3a743c4eca51a57471a81e5e28b0c54793fd7ff385a9854c462679ac2aac5e09a5b05c8496bd99f51345b838daf999722203
+4b2b86ebf51b4aaa73d20935c7df7f15f7dde276f8a444216f26acb123f8fabe40fcac441e75fd928c76a2fb3c5a4de26cbf78c1875ded7dc127b8b42414fa51
+69953f7f3663975bf553116b62c9918e5cb1b15d60f03c88d21deede7e2f7eae25a4dc3b1f0418128309776f2f397e6f22eb7de3fdf9c8da10f588733a7f4b33
+e08e02c6a58608796f26fce59c1a6c361262bdfc9910f0ccc4e7f01b85289de1be762652e1ab1c8268955931e5de2f28eb462d9d4ff86c78c5975d60cf6b6b85
+3b2944d576265a51150cef3e603aa66e54a984b03713ffd68288448a5b76111e12b308e6269b69539a7b43b841619d3aa730568a381a00cb5591cf1a18469873
+6668792a0c514784b15585a118525c5884ca723f1ed5f4e7013415d614e199159a0d2f116ad763f63b6eb7d20dcab4d8f7e8dd688a3772218bae8ac5ccb7b62d
+d9bfa9ae22c204a6320e14973a228c3104bfef2245a39e0883f64836bc7014cac8441d4a7e079f7ef95b2642c849c8866e3485b960c9229f0406421dbb5f121d
+8487a821c2a47ed884fb15b04ea823c2f0761b4a70b24d0968e9d6fd03ab5862566c78055413a1d23fa84bb8f53a655e6d5661a424f714bce0d841c184b59d8d
+63c4565410613a972add09a5a3f91d421621d5d215a63324da7d4a19aa24c228a00a96af8072f067dc6d0253ae56acd4eaaf90c0cbdf154c9ba2841dfa0941c7
+a90d310104ee67041b2897d414e191224a155c3012c0a822c2544e10746514a1d8182ae27b5e63b23231b22280a4618a215093958c025fc913dc281521e73401
+8a85e0493cab55c27db7244b50ea476b883089a790d05eaa12b286f690d0a440b11f55c614bc4d7731cc3cce41028ad04a093a2e14216b507b444e5b044237aa
+b595dbc714f4aac80e1b8112e522048b84a43a800805d649fb41ac21188607e0b5298f41bc13e02814a192d1d80fee47151132a2fb8d0321816cdc1304502cc2
+0af1348ab0c19a506a1ac8d37905c245a8f8bd01a60c92b74631ed204281bed88f5614e17d6f46a0c10e1b8113a52264932cbce46be72b98864a9edd5f23340d
+82f8855100301490e03d5af1212254f634880f354538cbc9d489ae146352178a50a8cc6c83b512b2f0ed2214f295d08fb28448433c02a7a0af11213ab2722bf9
+831a45852a5dfe844f529dc76201148a50309f69651521115930ea7c099bc91110944c4588cdb89008c57e34919495cd51e9edd185303f8c7d807b5f2a426272
+8e0a85ac8bd30aa4a1d6611011b2191dd6844a2737333cf5836da510b6e8ac36f030961f5909b926d965285431acc00c778521381b633ec16c22bc6cd5458402
+a0e92785752ba19d55f31decc4678a50fa41a11132c68a1685828e91fe6cc5954488e9646df5e290b80857153090c6376670356e54dffd72a197040909235037
+5a98365757d00e4c0582195d2a2173079e144adde805da5106d2fa02f7aa42fe6d844d8c421d838714ec293fe5a85109d1938f11217ab25221ae224d84dc5cd8
+a8b4bfba2ca47c3793ca5609051a6ff69af6c73294e0b4dc2bb89b2e64bc0dc639978d60c62075bf4d84717f5c84f676141ba923cf8f67ac942851983c2922e1
+7eec46854c7025110a0fba174644c3ee22b48b107378a0d81c4fb9cad6a132796a70a18cb36d5e097718311c2ec2daeda89af94e05317ed60ef3fe798510f154
+19aad18d7a25b4aea7d2dba35e09ed9550d84a8d52fd7828be417dfafe68a21f15ba51ee245d8459228cb6f91d45381fdafaf7773ef8b730b50bb70b4ce72e6d
+b3ae16989c2a38654214fad1c49686c9cf286e8c392b19fdf8988d193529c772a3f698d0f00bdd60dce62393396e09deb67f586f2227f2877bbe823d5301c938
+5e6c19ef8d2a5bb42ec233d285225402134e9bfa91e5297a0c2642a11d63b24f0f8ef627920bf55a7bca9d78635fa8e12c1f17e121549cc1d767c691088b9530
+4f84255f1dd8937834110a5c5654389f04ae707e1f3ca10e473b39a60b3781d2c34a760bdd604bb8274824369c3ff550613f2ea3fa2611eae7cb0b741d4d84b9
+fba32157ed3a64ee45f783f9567e48e8223c4a7b5011eebe7322a80c2e194e8422eca2e7c67228d4e1889484eccf25cc45f809223c7ef14ba4e2e76ccc48c7b4
+98bc36bd622a4829b27ee0dcc13de0cc402ea8ac65f4824d6133866a4763fd498335617d09a6cf6be148547f583f8596e96c12a1ed58906c97f946a91b751166
+ad09bb89b08504471421e671a306a7cbf5a654e847839548305adba265317b250c10a0d3ee68f502b1ba32dc9ab041299cdcd4ca90d40c07fb5116afb80dee22
+dce949657d17111a3ed8662b14038a5068c96c3ece578b1a10e60e2ea8583b621ae0812e550939b9ad54e82142d5163b394714a1d0dbd91de5cd08f5797d0032
+c162ad1b1592c0a5442800db4b846a51b65373c47654389f21c351f1581a21ea819ac649b25e257611be654dc82d4a0e29875d13b6d8219d9dd56a21831dd013
+dfc4d2594b658d91309130126c469f4714e8ca9df9addb51d58e3c218ed88e4e887269c97097b9a7cd7c8e381a234ded223c21ab92bfb10855339007e10b0615
+611b152a3da180f7a91fe594a1ccec95f02c25211a3dd684dc1864ca6fe476748a860abfc97b450b0cf869145eb3abdda8b7a37b21727aebb13bca9430b1f074
+f1a895b0d1c250108310f763c6c610c8dda88b70c0376638c72201d2170c2cc2262da9f0a480113d80c6b2151f12fac6cc313c2aff5bae0939bccc98cf15618b
+9767848694037f18846f100af09d46dcf9f058d8c973616633faec8e32b4cddb5144b3548243beb6b60d6ffd378598c39cf90e2446c60aca7f388d63e1276584
+e5f4d789b0e52febd53c50a0c591dbd1f51516a6a5c97d26a0f0bbe21d6a9c2af56ed4d784596bc28622e4e89ae817bc7878114e89bdae0c59119cfb766370e5
+1416a25e098320712816563714615df27dd673c25d48aafe8a8b4b21ab6ad75f22510cdda857c2ac4ad8eeb435e6c24957b7e9f8d19fe9efee89504a3fa012ae
+5d29525dee0a7855c8436da9825773ed7d0dc78997cdc7b0731e623386da9869274206621bfe497d275c301ac36fccec3669a6335691f0c2055c9858f01b5d31
+c8866ed42be158959083fb225ce4530cc2109f52091fb1293eed78020d45c13dc846c8a85816fdc6204e335e09cf89368649f1193318dca72dd1d31bbe50842b
+5fcb0e3e661a633ddd3474281b9ece4518cb8b08ee1aa966224422dc2fb8c583cc197dccdf1362a92a532297264e802fd0294ebc00dbbacbac634d63ee6593d8
+8c3e6b42b663813f664c69251404b4cc9f621473e99345f85022a9e0bc7d852267f09f8b42643c4bde45180d481f1146f39a20a0995dc99d37618c4f5b1386c2
+65de394511f2f3faa7b450af5cb95c8485226cf6b96c2dbfa7d3ec4544383fc11053667a09f1e20222f78c3b5dc9addf8e81ec078b1a8b33dbc466f469474b55
+50f67d420472310fd024822496b433c61c09de68545ec2664e70e932bd57c30feeb0be3dfb78a209cfe5228c8797d05dff3d5e8aca44c82cc06654e1ffc7af09
+37f1d320a375f47d408cfe5d5c982c85fce1ed68746305c3b05c106f0eca442814312c84ca89f2dfb0267c841005f108a9b05782f8dfc720e50b5379258c262a
+31a2f144572642a115e4136d91491ff5c68c505324d43879cd8b4cccc1ab3904b1b11b159600575a1372146051a68930c62ce440ba0c6b0cf9a635e1e2b19839
+95452806601503c95ec81c5e09a320518aa325e13fed4161910829c2820fdfd48e4a054cd8cf924adcfde11068d5da8da2a8d3bdcb4a084c459c8428b724dffd
+c3f927d088baebbfb319b033522442c50fda1be55ee9eb2aa1183626a1d08f2efaa23859bb518176576a47b11d817d99b24a48c1859dd97b9eb95e2514d672fc
+6467450f09305f448b162de16faee2dc7f21114a2a481765695118891205d74558d2c72b9510b75c968d714873e66ed42be136ae920a922f6e16b5a3420de3cd
+51a208eded7056565a7b7645d2845a5304a3b98f578adcb22884d9b86a1ddd62f3794c2c200c389b918a073611e29a90a9830fcb954a1843549a1ef3ac30ca97
+6dcc606d5af8c12454fad119fe3459b579767466f65f48840c06d5917fcd4588e1701186733266af4517881e2e1ccddb32a46ae4dc62f8db2ba1201ea5b1413f
+848cda5c841863018c112b21fa958a204a678a9c26425c91fc10dd314b9e1de190f1a0485eaed06c46610c14112aa1a42fa13717217289a11cf1ddd1dfff12bf
+53c6e0299113554e4b9b5f2896cc7517612a9e027de121dbd415082a8cd9a0508913bae0c5809570b63a5f8682cfc221d6523ffa072214b5fe7d6b422cc5d2c6
+0c76224237fa19222ccc44589884a5d5619fe48e7df4e01c98b2a208894b37d89711c0395dc2e67f403bcacf58956d758602f7463b54426c77d88de4107cbb82
+2517f5bd11cf59b1db0e919c84b3644f551d04407ab22cfb69ca4f786d4d49bcdc256885906229b4a385875b109938a249a2f0ed0481b4c9b8af845bec3368cc
+9257f76526db8907e9c9986781f831e69f5009093865738c9198f3295284d7845140a5849e3e60069f6261311760a034a0ecf4ef45b89fd4dc94d2660a3abdf3
+08464b032460f3a51b33c23b7f281f259be2b6cc4c3ffc2b1421a501565132adf2edf52be12987da6428858e6bc9431cd27011a55270c21a65ccd97acce0b88e
+a13781b0a557804b6ebe09b5547bed0235188f13e2b846be7493221d0d260419606f470373def4be4e828d29f884551a2f2242ddea6d1419f38f10a1a6a138ff
+b5fbe921e10c2c2f0ae32252da2a2ce918d174b6c6db310b98451806ffa6964309354b89122088cc6990fa178a5028a54b218b642aa5906a85b0488462f493a5
+90d3493aab0a3608eb1e065439533ef2b58dddfce2870cb994bc46650863bab7487de30563cee663fde604c16640e439ea2b702119eaa02bdd06f5a3093c4527
+52a1665f20181c89daed68d264d22172ef1e762171bc2e916a6be822d64ad00ec69c0746203a88507854f8406d1f57cbb728d90f61672681272b68f5213e8430
+02241226446d11d28c291d8a690bb794f7da50473dea50e2c7d73ea29036c53790dde60f6bce7f44803dcc4a21c4edd18408319bddcd89065b600f11454044a8
+2a6cc8d30e216ffc770b0b916779c44f307973891a87a308257e7cb308c5556176a731b7b2522869672635886a5dd81269794444e92e4261c27521317f8ff805
+def4a134152ddccb3a8544b5e96001378d5ffd8862724ec9a87ad8f23bfe1211cabc0aa950ba191389c03f2117b12d0f43ac55e7b6fed9222958bcdfedb10d4f
+0d0a4dcfdeb0bc11478cbc50c6c811e5a79159d03e6f52b7bed23b334938f544727ae8297e1d05a3c984a8bb2614e62b0bdb743755ff33b7b2acb24f739f9867
+c3b0d1af1c953e8ecd6011622e280c265bb05e512042c3f6d27fdbc7683feae296130947a2aa085b076d6964d5c8bdaed3b3e18654f669be4f848d1b5239cfa5
+45988e14b771dbeda57991f463f98ab440c7ce2214a62bcc9dca4f10aa94424e70b1d833081f5309951f53e407548738bd284c8bb07161e0580a0b839a95b0b1
+bf4bb8f5c86d6263ca862babe42c9db10fc48143243901732e906a3d0f93ab4276e16560aa14129aed3c1069221820848239bc022acc961bb1c77d96c86d3cb3
+4f2bc012b9845120da0c70d0d3d3374c077668ef77300a754498b51811bd924a0213a262256c17af172496c895944209ddb00a19737602a1e464c4666879064d
+11f97abcccd46aa4fa51748391c87441dc9f10e6471f9485c1c20961b25c6f1ff7317d23ee5827ce9e4881810747e6f71361a3cd195b962b1261b352c841501b
+c46a2244e2588570bede943d778e7147bd9b4d8437881de7a2cf12611315da34987a48c160b6aa0e2a499810f5da5161ae42195a23b7d588cdbab633316f30a1
+3101d86121fdae97d42f256cfec1b8f8ce8ce005a299c54bd9078e443511b6f1740b4f89328c446299c463cf98f3e808263380cd10e87bbfa4b60ad9faa36df1
+7e54f1a2b6fdb66d7a8e443511fe13dff2c9ca3a650f0dd4cefc699a9d241b2a30e61f27427e83c714d51c7863a590b19c43635c8d08de1856464c887a229cda
+16613ac1bff02506af83c9118bcb66daa2b91804260e1acb3c6633941af2bc86879323cbb6072c8b9542d1898ae62f7e72085f8609730b5e701e79e0da4e8616
+afc32eb1174f1a154dc698f3f0e389b05e31c95b554444c850dec9c051919388f5d54961eaaa229c1e330b531adcbd5f9a953c8f9ec9d3e6d1e4311d03c0cc19
+5084b5229b0b6eb81f6528ef614144657698dfa66242d46c47577f2da71b889ee7066e2f4379795ed48d0a1be2cc1ca40c67250ebd907ef797187a896860b3b1
+0d9742830f0c88c646f5c8324b272fb8c1e0ef39515986f99f9639f8c67eac611020495cc2c1fe54119617c39250864a212369da31135498e1011342611c93f7
+94982b2e0eb373e75928021c531c0aeb2e4fc2d419b3124e8096c5b508d95029b4a54be631a9d07080eefb366636a0542a8745713bc608b9bd04a150f55f2dc2
+12199afbb8632373aa859ccdf643146e58dcf2c8c88468540917e72d07c784735069dcb254684bafa7ab1973e60e668bb7ac091f7b1c591525a38f3b407b2e85
+f6486599be7233ab0ace1632215a8ab054877989271919211796ceca987fb808a7bd3773575a259b1e2ba15d83f9bbf7050e30211a8b305f877450704e04e67b
+3017b244d25333e63cc3d0957071dfa2c36aa1dcab90610c062a639d945d0417039810ed4538474c3d35e7d194de7e331116a4092ae4464f98e31a97fc0a618d
+1c329b07d0be21cd1bc34cc7965ccc7621f34625626bef5d2d71861321ec809576a399f07cea6d894391a6b3656be7d2ad0a8b1013cb42632e16b9907b331e63
+3539ddae04ae56533bda7afe5cec86beefe7675fa47eb7273bd7b4fc354df1a844c60e5c2cf6217b80f944b9bfc381bff3970c9acb6fb5183a74ef46b303dbe7
+c6755d582b55ce4a3c32622663ab24d207a3d167a177d70a1f128eeefe37d83795ddfa6e4c83ce7ff507f611cf08d0569563e60838026d11a0bd7fdf96698bbf
+8fee08e0b68c77a34e1247a02d02540895a7a66d2df4d11d812f47809e4f7837fae50470f7de8e001642df1d7b7b8cdc802f47800aa13f24fc7202b87b6f4700
+0ba16fcbbc3d466ec0972340cf087d5be6cb09e0eebd1d017a59a6f45c8bb73be8063802832380cda8e944d7c19d75f31c811111c066d4b765460c9bdbf44508
+60335a7ac0d31761e5ae38022d10e066d4b7655ae0ee633a024f04b019f56d19678b23d01401d6a06fcb340d800f7e7904e85599f273b72f0fb103e008241110
+34e885d039e408344440d1a0ff7ea261007ce8cb23a068d00be1e569e200b4434038f87e3eecb49d013eb223707104f819fd7218b0ff90f0e23c71f79b21a095
+c1e24f1236b3df0776043e1c0155825e083f3cd06efea808183edfe55ba3a306d1edfa64040c122cfd48fd27c3e4b63b028d10307e22d84fb56814071ff6aa08
+983f02e98f27ae4a15f7bb0902c61ae88f279a44c107bd2e02390af4c713d7e58b7bde0001e1f74ae7cff47a33da20123ee46511107e3d7f16a1bf2b7359beb8
+e32d10c82885be33da22103ee67511b097427f4c7f5db6b8e76d10b09642d7609b38f8a81746c0580a7d53e6c25c71d75b2120fd80f7b13be31a6c15061ff7ca
+08584aa1f7a257668afbde0e01bd14ba06db45c147be34027229f4671397e6893bdf1201ad14defc197dcb20f8d81747e0fc52ccf9fff156f4e22471f7db22c0
+a5f0e6ad68db10f8e89747804aa197c1cb53c401688d40ba14fef96ab075007c7c47e05fe2e535df90717e38023d10881ef8eb55b007fc3e87233021102e852e
+41278723d00d814029fcf31dd16ef0fb448ec0b914ba029d158e406f0436a5f0e60aec8dbecfe708cc08acab4217a0b3c111781b023f7f7f3ffe40f06df0fbc4ef40e07fe66a76e6cc5765320000000049454e44ae426082}}{\nonshppict
+{\pict\picscalex17\picscaley17\piccropl0\piccropr0\piccropt0\piccropb0\picw23816\pich6616\picwgoal13502\pichgoal3751\wmetafile8\bliptag1016976793\blipupi95{\*\blipuid 3c9dd5997eca05e5285611ada434fb29}
+0100090000031add00000000f5dc000000000400000003010800050000000b0200000000050000000c02fb008503030000001e000400000007010400f5dc0000
+410b2000cc00fa00840300000000fa008403000000002800000084030000fa000000010004000000000000000000000000000000000000000000000000000000
+0000ffffff00fefefe00cccccc009999990066666600333333000000000000000000000000000000000000000000000000000000000000000000000000002222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222355332222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+02022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222226000006542222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222400000000006542222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222226000000000000005422222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222400000000000000000054222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222226000000000000000000000532222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222400000000000000000000000053222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222226000000000000000000000000006322222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000000532222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222220000000000000000000000000000000052222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000000000064222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220000000000000000000000000000000000
+00522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000
+00000000000632222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222230000000000000000000
+00000000000000000000042222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222500000000000
+00000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222230000
+00000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22250000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+02022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222223000000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222260000000000000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222223000000000000000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222260000000000000000000000000000000000000000000000000042222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222223000000000000000000000000000000000000000000000000000032222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222260000000000000000000000000000000000000000000000000000622222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222450000000000000000000000000000000000000000000000000000522222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222224500000000000000000000000000000000000000000000000000322222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222235000000000000000000000000000000000000000000000006
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222450000000000000000000000000000000000000
+00000000422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222224600000000000000000000000000
+00000000000000000222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222460000000000000000
+00000000000000000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222236000000
+00000000000000000000000000000000003222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22360000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222240000000000000000000000000000000000000032222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222236000000000000000000000000000000000000622222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+02022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222225000000000000000000000000000000000000322222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222225000000000000000000000000000000000005222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222225000000000000000000000000000000000003222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222225000000000000000000000000000000000052222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000032222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000522222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222230000000000000000000000000000000000222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222240000000000000000000000000000000004
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222260000000000000000000000000
+00000006222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222300000000000000000
+00000000000000003222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222400000000
+00000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+60000000000000000000000000000000022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222300000000000000000000000000000000422222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222500000000000000000000000000000006222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222223000000000000000000000000000000003222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222225000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+02022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222230000000000000000000000000000000022222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222250000000000000000000000000000000422222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222300000000000000000000000000000005222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222600000000000000000000000000000002222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222224000000000000000000000000000000042222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222233322222222222222222222222222222222222222222222222222222222222222222222222222222222223333333222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222220202222222222222222222222222222222222222222222334556600000000000006655432222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000622222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222255555532222222222222222222222222222222222222222222222222222222222222222222222234566000000000000000665533222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222202022222222222222222222222222222222222222345600000000000000000000000000000654322
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222250000000000000000000000000000000322
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222333555555555555543322222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222235555555552222222222222222222222222222222222222222222222222222222222222222234560000000000000000000000
+00000065432222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222245600000000000000000000000000000000
+00000065422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222300000000000000000000000000
+00000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222223456000000000000000000000006554322222222222222222222222222222222222222222222
+22222222222222222222222222222222223555555555552222222222222222222222222222222222222222222222222222222222222356000000000000000000
+00000000000000000065422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222223560000000000000000000000000000
+00000000000000000064322222222222222222222222222222222222222222222222222222222222222222222222222222222222222222500000000000000000
+00000000000006222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222456000000000000000000000000000000000654222222222222222222222222222222222
+22222222222222222222222222222222222222222355555555555552222222222222222222222222222222222222222222222222222222223560000000000000
+00000000000000000000000000000064322222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222245000000000000000000000000
+00000000000000000000000000000542222222222222222222222222222222222222222222222222222222222222222222222222222222222222250000000000
+00000000000000000000003222222222222222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222222
+22222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002
+22222222222222222222222222222222222222222222222222222222222234600000000000000000000000000000000000000000542222222222222222222222
+22222222222222222222222222222222222222222222222225555555555555532222222222222222222222222222222222222222222222222222223500000000
+00000000000000000000000000000000000000000642222222222222222222222222222222222222222222222222222222222226000000000000000000000000
+00000000002222222222222222222222222222222222250000000000000000000000000000000006020222222222222222222222222450000000000000000000
+00000000000000000000000000000000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222236000
+00000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000
+32222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000
+00000002222222222222222222222222222222222222222222222222222222222346000000000000000000000000000000000000000000000005322222222222
+22222222222222222222222222222222222222222222222222222222555555555555555522222222222222222222222222222222222222222222222222223600
+00000000000000000000000000000000000000000000000000005322222222222222222222222222222222222222222222222222222222260000000000000000
+00000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222222222222222224500000000000000
+00000000000000000000000000000000000000000000000000532222222222222222222222222222222222222222222222222222222222222222222222222222
+22300000000000000000000000000000000000022222222222222222222222222222222222222222222222222222222222222260000000000000000000000000
+00000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000
+00000000000000022222222222222222222222222222222222222222222222222222222350000000000000000000000000000000000000000000000000000632
+22222222222222222222222222222222222222222222222222222222222222235555555555555555522222222222222222222222222222222222222222222222
+22250000000000000000000000000000000000000000000000000000000000642222222222222222222222222222222222222222222222222222222600000000
+00000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222222222222222235000000000
+00000000000000000000000000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222
+22222222230000000000000000000000000000000000000422222222222222222222222222222222222222222222222222222222222222600000000000000000
+00000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000
+00000000000000000000000222222222222222222222222222222222222222222222222222222460000000000000000000000000000000000000000000000000
+00000005322222222222222222222222222222222222222222222222222222222222222555555555555555555322222222222222222222222222222222222222
+22222222236000000000000000000000000000000000000000000000000000000000000065222222222222222222222222222222222222222222222222222226
+00000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006020222222222222222246000
+00000000000000000000000000000000000000000000000000000000000000000000004222222222222222222222222222222222222222222222222222222222
+22222222222222222600000000000000000000000000000000000005222222222222222222222222222222222222222222222222222222222222226000000000
+00000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600
+00000000000000000000000000000002222222222222222222222222222222222222222222222222222460000000000000000000000000000000000000000000
+00000000000000000522222222222222222222222222222222222222222222222222222222222235555555555555555555222222222222222222222222222222
+22222222222222225000000000000000000000000000000000000000000000000000000000000000006422222222222222222222222222222222222222222222
+22222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222222222
+35000000000000000000000000000000000000000000000000000000000000000000000000000006322222222222222222222222222222222222222222222222
+22222222222222222222222250000000000000000000000000000000000000002222222222222222222222222222222222222222222222222222222222222260
+00000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222
+22222600000000000000000000000000000000022222222222222222222222222222222222222222222222222360000000000000000000000000000000000000
+00000000000000000000000000632222222222222222222222222222222222222222222222222222222222555555555555555555553222222222222222222222
+22222222222222222222222600000000000000000000000000000000000000000000000000000000000000000000632222222222222222222222222222222222
+22222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222
+22222235000000000000000000000000000000000000000000000000000000000000000000000000000000000522222222222222222222222222222222222222
+22222222222222222222222222222224000000000000000000000000000000000000000042222222222222222222222222222222222222222222222222222222
+22222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222
+22222222222226000000000000000000000000000000000222222222222222222222222222222222222222222222222250000000000000000000000000000000
+00000000000000000000000000000000000042222222222222222222222222222222222222222222222222222222235555555555555555555552222222222222
+22222222222222222222222222222260000000000000000000000000000000000000000000000000000000000000000000000053222222222222222222222222
+22222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006
+02022222222236000000000000000000000000000000000000000000000000000000000000000000000000000000000000622222222222222222222222222222
+22222222222222222222222222222222222222200000000000000000000000000000000000000000522222222222222222222222222222222222222222222222
+22222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222
+22222222222222222222260000000000000000000000000000000002222222222222222222222222222222222222222222222236000000000000000000000000
+00000000000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222555555555555555555555532222
+22222222222222222222222222222222222230000000000000000000000000000000000000000000000000000000000000000000000000004222222222222222
+22222222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000
+00000006020222222246000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032222222222222222222
+22222222222222222222222222222222222222222222225000000000000000000000000000000000000000000322222222222222222222222222222222222222
+22222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222
+22222222222222222222222222222600000000000000000000000000000000022222222222222222222222222222222222222222222225000000000000000000
+00000000000000000000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222235555555555555555555
+55532222222222222222222222222222222222222222600000000000000000000000000000000000000000000000000000000000000000000000000006222222
+22222222222222222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000
+00000000000000060202222246000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042222222222
+22222222222222222222222222222222222222222222222222222300000000000000000000000000000000000000000004222222222222222222222222222222
+22222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000
+00062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222222222222222222222600000000000
+00000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222222222355555555555
+55555555555522222222222222222222222222222222222222260000000000000000000000000000000000000000000000000000000000000000000000000000
+00032222222222222222222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000
+00000000000000000000000602022246000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042
+22222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000000000000062222222222222222222222
+22222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000
+00000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222222222222222222222300000
+00000000000000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222222225555
+55555555555555555555322222222222222222222222222222222222225000000000000000000000000000000000000000000000000000000000000000000000
+00000000000042222222222222222222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500
+00000000000000000000000000000006020223000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000005222222222222222222222222222222222222222222222222222222222222400000000000000000000000000000000000000000000032222222222222
+22222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000
+00000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222222222222222222222222222
+24000000000000000000000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222
+22235555555555555555555555555222222222222222222222222222222222222400000000000000000000000000000000000000000000000000000000000000
+00000000000000000000052222222222222222222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222
+22222500000000000000000000000000000000060202226000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000005222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000000000000000522222
+22222222222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000
+00000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222222222
+22222222400000000000000000000000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222
+22222222222555555555555555555555555552222222222222222222222222222222222230000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000062222222222222222222222222222222222222222600000000000000000000000000000000002222222222222222222222
+22222222222225000000000000000000000000000000000602022230000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000004222222222222222222222222222222222222222222222222222222222500000000000000000000000000000000000000000000
+00622222222222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222
+22300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222
+22222222222222240000000000000000000000000000000000000000000000000000000000000000000000000000000000052222222222222222222222222222
+22222222222222222225555555555555555555555555532222222222222222222222222222222222600000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000062222222222222222222222222222222222222226000000000000000000000000000000000022222222222222
+22222222222222222222250000000000000000000000000000000006020222260000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000003222222222222222222222222222222222222222222222222222222220000000000000000000000000000000000000
+00000000000322222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222
+22222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222
+22222222222222222222224000000000000000000000000000000000000000000000000000000000000000000000000000000000000052222222222222222222
+22222222222222222222222222355555555555555555555555555522222222222222222222222222222222240000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000062222222222222222222222222222222222222260000000000000000000000000000000000222222
+22222222222222222222222222222500000000000000000000000000000000060202222300000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000003222222222222222222222222222222222222222222222222222222500000000000000000000000000000
+00000000000000000005222222222222222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222
+22222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222
+22222222222222222222222222222300000000000000000000000000000000000000000000000000000000000000000000000000000000000000042222222222
+22222222222222222222222222222222223555555555555555555555555555222222222222222222222222222222222600000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222600000000000000000000000000000000
+00222222222222222222222222222222222225000000000000000000000000000000000602022222600000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222222222220000000000000000000000
+00000000000000000000000000002222222222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222222
+22222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002
+22222222222222222222222222222222222230000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032
+22222222222222222222222222222222222222222255555555555555555555555555553222222222222222222222222222222240000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000052222222222222222222222222222222222226000000000000000000000000
+00000000002222222222222222222222222222222222250000000000000000000000000000000006020222223000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000052222222222222222222222222222222222222222222222222222500000000000000
+00000000000000000000000000000000000042222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000
+32222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000
+00000002222222222222222222222222222222222222600000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000062222222222222222222222222222222222222222222555555555555555555555555555532222222222222222222222222222222600000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000042222222222222222222222222222222222260000000000000000
+00000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222226000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000032222222222222222222222222222222222222222222222222226000000
+00000000000000000000000000000000000000000000522222222222222222222222222222222222222222222222222222222260000000000000000000000000
+00000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000
+00000000000000022222222222222222222222222222222222250000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000052222222222222222222222222222222222222222235555555555555555555555555555522222222222222222222222222222230000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000032222222222222222222222222222222222600000000
+00000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222230000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000622222222222222222222222222222222222222222222222222
+40000000000000000000000000000000000000000000000000000222222222222222222222222222222222222222222222222222222222600000000000000000
+00000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000
+00000000000000000000000222222222222222222222222222222222224000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000042222222222222222222222222222222222222222555555555555555555555555555555222222222222222222222222222222500
+00000000000000000000000000000000000000000065332334560000000000000000000000000000000000000000622222222222222222222222222222222226
+00000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006020222222260000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000422222222222222222222222222222222222222222
+22222222600000000000000000000000000000000000000000000000000004222222222222222222222222222222222222222222222222222222226000000000
+00000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600
+00000000000000000000000000000002222222222222222222222222222222222300000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000022222222222222222222222222222222222222225555555555555555555555555555553222222222222222222222222
+22222000000000000000000000000000000000000000000053222222222235600000000000000000000000000000000000000522222222222222222222222222
+22222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222300000
+00000000000000000000000000000000000000000066666660000000000000000000000000000000000000000000000222222222222222222222222222222222
+22222222222222230000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222222222222222222222260
+00000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222
+22222600000000000000000000000000000000022222222222222222222222222222222226000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000522222222222222222222222222222222222222255555555555555555555555555555532222222222222222
+22222222222240000000000000000000000000000000000000000063222222222222222460000000000000000000000000000000000000322222222222222222
+22222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222
+22260000000000000000000000000000000000000006553322222222223450000000000000000000000000000000000000000005222222222222222222222222
+22222222222222222222222600000000000000000000000000000000000000000000000000000032222222222222222222222222222222222222222222222222
+22222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222
+22222222222226000000000000000000000000000000000222222222222222222222222222222222400000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000322222222222222222222222222222222222223555555555555555555555555555555522222222
+22222222222222222222500000000000000000000000000000000000000006222222222222222222250000000000000000000000000000000000006222222222
+22222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006
+02022222222400000000000000000000000000000000000654222222222222222222225000000000000000000000000000000000000000002222222222222222
+22222222222222222222222222222230000000000000000000000000000000000000000000000000000000422222222222222222222222222222222222222222
+22222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222
+22222222222222222222260000000000000000000000000000000002222222222222222222222222222222226000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000006222222222222222222222222222222222222235555555555555555555555555555555
+22222222222222222222222222220000000000000000000000000000000000000000622222222222222222222236000000000000000000000000000000000004
+22222222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000
+00000006060022222222600000000000000000000000000000005422222222222222222222222222500000000000000000000000000000000000000042222222
+22222222222222222222222222222222222222500000000000000000000000000000000000000000000000000000006222222222222222222222222222222222
+22222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222
+22222222222222222222222222222600000000000000000000000000000000022222222222222222222222222222222500000000000000000000000000000000
+00000000000066555555560000000000000000000000000000000000000000000004222222222222222222222222222222222222555555555555555555555555
+55555555322222222222222222222222222300000000000000000000000000000000000000062222222222222222222222225000000000000000000000000000
+00000006222222222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000
+00000000000000060202222222224000000000000000000000000000054222222222222222222222222222222300000000000000000000000000000000000000
+62222222222222222222222222222222222222222222220000000000000000000000000000000000000000000000000000000003222222222222222222222222
+22222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000
+00062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222222220000000000000000000000000
+00000000000000000542222222222223500000000000000000000000000000000000000000062222222222222222222222222222222222225555555555555555
+55555555555555553222222222222222222222222224000000000000000000000000000000000000000322222222222222222222222224000000000000000000
+00000000000000004222222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000
+00000000000000000000000600002222222226000000000000000000000000542222222222222222222222222222222222360000000000000000000000000000
+00000000032222222222222222222222222222222222222222222400000000000000000000000000000000000000000000000000000000052222222222222222
+22222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000
+00000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222222222500000000000000000
+00000000000000000000006422222222222222222240000000000000000000000000000000000000000042222222222222222222222222222222222255555555
+55555555555555555555555532222222222222222222222222250000000000000000000000000000000000000052222222222222222222222222224000000000
+00000000000000000000000062222222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500
+00000000000000000000000000000006020222222222240000000000000000000006532222222222222222222222222222222222222200000000000000000000
+00000000000000000522222222222222222222222222222222222222222226000000000000000000000000000000000000000000000000000000000622222222
+22222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000
+00000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222222222222222226000000000
+00000000000000000000000000006422222222222222222222225000000000000000000000000000000000000000622222222222222222222222222222222223
+55555555555555555555555555555555522222222222222222222222222600000000000000000000000000000000000000222222222222222222222222222224
+00000000000000000000000000000000032222222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222
+22222500000000000000000000000000000000060000222222222260000000000000000006422222222222222222222222222222222222222222300000000000
+00000000000000000000000006222222222222222222222222222222222222222222300000000000000000000000000000000000000000000000000000000000
+42222222222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000
+00000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222222400
+00000000000000000000000000000000000522222222222222222222222224000000000000000000000000000000000000000422222222222222222222222222
+22222223555555555555555555555555555555555222222222222222222222222220000000000000000000000000000000000000052222222222222222222222
+22222222600000000000000000000000000000000522222222222222222222222222222600000000000000000000000000000000002222222222222222222222
+22222222222225000000000000000000000000000000000602022222222222400000000000000005322222222222222222222222222222222222222222222500
+00000000000000000000000000000000003222222222222222222222222222222222222222225000000000000000000000000000000000000000000000000000
+00000000522222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222
+22300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222
+22222500000000000000000000000000000000000632222222222222222222222222224000000000000000000000000000000000000006222222222222222222
+22222222222222255555555555555555555555555555555552222222222222222222222222300000000000000000000000000000000000000222222222222222
+22222222222222226000000000000000000000000000000006222222222222222222222222222226000000000000000000000000000000000022222222222222
+22222222222222222222250000000000000000000000000000000006000022222222222600000000000005322222222222222222222222222222222222222222
+22222200000000000000000000000000000000000042222222222222222222222222222222222222222200000000000000000000000000000006000000000000
+00000000000000000222222222222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222
+22222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222
+22222222222220000000000000000000000000000000000052222222222222222222222222222225000000000000000000000000000000000000003222222222
+22222222222222222222222555555555555555555555555555555555532222222222222222222222223000000000000000000000000000000000000052222222
+22222222222222222222222260000000000000000000000000000000003222222222222222222222222222260000000000000000000000000000000000222222
+22222222222222222222222222222500000000000000000000000000000000060202222222222224000000000005222222222222222222222222222222222222
+22222222222222500000000000000000000000000000000000522222222222222222222222222222222222222224000000000000000000000000000000050000
+00000000000000000000000004222222222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222
+22222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222
+22222222222222222222400000000000000000000000000000000005222222222222222222222222222222226000000000000000000000000000000000000052
+22222222222222222222222222222225555555555555555555555555555555555322222222222222222222222230000000000000000000000000000000000000
+42222222222222222222222222222222600000000000000000000000000000000042222222222222222222222222222600000000000000000000000000000000
+00222222222222222222222222222222222225000000000000000000000000000000000600002222222222226000000005222222222222222222222222222222
+22222222222222222222223000000000000000000000000000000000000222222222222222222222222222222222222222260000000000000000000000000000
+00030000000000000000000000000000052222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222222
+22222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002
+22222222222222222222222222225000000000000000000000000000000000422222222222222222222222222222222240000000000000000000000000000000
+00000002222222222222222222222222222222355555555555555555555555555555555553222222222222222222222222500000000000000000000000000000
+00000000222222222222222222222222222222226000000000000000000000000000000000522222222222222222222222222226000000000000000000000000
+00000000002222222222222222222222222222222222250000000000000000000000000000000006020222222222222240000005322222222222222222222222
+22222222222222222222222222222226000000000000000000000000000000000003222222222222222222222222222222222222223000000000000000000000
+00000000006260000000000000000000000000000022222222222222222222222222222222222222222222222222226000000000000000000000000000000000
+32222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000
+00000002222222222222222222222222222200000000000000000000000000000000002222222222222222222222222222222222260000000000000000000000
+00000000000000042222222222222222222222222222223555555555555555555555555555555555552222222222222222222222225000000000000000000000
+00000000000000062222222222222222222222222222222260000000000000000000000000000000006222222222222222222222222222260000000000000000
+00000000000000000022222222222222222222222222222222222500000000000000000000000000000000060000222222222222260006322222222222222222
+22222222222222222222222222222222222222260000000000000000000000000000000000032222222222222222222222222222222222222250000000000000
+00000000000000000052500000000000000000000000000000422222222222222222222222222222222222222222222222222260000000000000000000000000
+00000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000
+00000000000000022222222222222222222222222223000000000000000000000000000000000022222222222222222222222222222222222400000000000000
+00000000000000000000000622222222222222222222222222222235555555555555555555555555555555555522222222222222222222222250000000000000
+00000000000000000000000522222222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222600000000
+00000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222222222222406322222222222
+22222222222222222222222222222222222222222222222500000000000000000000000000000000000422222222222222222222222222222222222222000000
+00000000000000000000000000425000000000000000000000000000006222222222222222222222222222222222222222222222222222600000000000000000
+00000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000
+00000000000000000000000222222222222222222222222222250000000000000000000000000000000000222222222222222222222222222222222222600000
+00000000000000000000000000000000322222222222222222222222222222355555555555555555555555555555555555222222222222222222222222500000
+00000000000000000000000000000005222222222222222222222222222222226000000000000000000000000000000000032222222222222222222222222226
+00000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006000022222222222222422222
+22222222222222222222222222222222222222222222222222222225000000000000000000000000000000000005222222222222222222222222222222222222
+24000000000000000000000000000000003230000000000000000000000000000003222222222222222222222222222222222222222222222222226000000000
+00000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600
+00000000000000000000000000000002222222222222222222222222222500000000000000000000000000000000002222222222222222222222222222222222
+22500000000000000000000000000000000000004222222222222222222222222222225555555555555555555555555555555555553222222222222222222222
+22500000000000000000000000000000000000052222222222222222222222222222222260000000000000000000000000000000000322222222222222222222
+22222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222222222
+22222222222222222222222222222222222222222222222222222222222222250000000000000000000000000000000000052222222222222222222222222222
+22222222250000000000000000000000000000000022200000000000000000000000000000042222222222222222222222222222222222222222222222222260
+00000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222
+22222600000000000000000000000000000000022222222222222222222222222226000000000000000000000000000000000022222222222222222222222222
+22222222223000000000000000000000000000000000000062222222222222222222222222222255555555555555555555555555555555555532222222222222
+22222222225000000000000000000000000000000000000422222222222222222222222222222222600000000000000000000000000000000003222222222222
+22222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000600002222
+22222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000000000000622222222222222222222
+22222222222222222000000000000000000000000000000005222600000000000000000000000000000622222222222222222222222222222222222222222222
+22222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222
+22222222222226000000000000000000000000000000000222222222222222222222222222200000000000000000000000000000000000222222222222222222
+22222222222222222226000000000000000000000000000000000000032222222222222222222222222222555555555555555555555555555555555555322222
+22222222222222222250000000000000000000000000000000000003222222222222222222222222222222225000000000000000000000000000000000032222
+22222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006
+02022222222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000006222222222222
+22222222222222222222222240000000000000000000000000000000042226000000000000000000000000000000322222222222222222222222222222222222
+22222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222
+22222222222222222222260000000000000000000000000000000002222222222222222222222222222000000000000000000000000000000000002222222222
+22222222222222222222222222250000000000000000000000000000000000000422222222222222222222222222225555555555555555555555555555555555
+55322222222222222222222222500000000000000000000000000000000000052222222222222222222222222222222250000000000000000000000000000000
+00032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000
+00000006000022222222222222222222222222222222222222222222222222222222222222222222222222200000000000000000000000000000000000062222
+22222222222222222222222222222222500000000000000000000000000000000322250000000000000000000000000000005222222222222222222222222222
+22222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222
+22222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022
+22222222222222222222222222222222222400000000000000000000000000000000000005222222222222222222222222222355555555555555555555555555
+55555555555222222222222222222222225000000000000000000000000000000000000522222222222222222222222222222222500000000000000000000000
+00000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000
+00000000000000060202222222222222222222222222222222222222222222222222222222222222222222222222224000000000000000000000000000000000
+00062222222222222222222222222222222222220000000000000000000000000000000002222400000000000000000000000000000002222222222222222222
+22222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000
+00062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000
+00000022222222222222222222222222222222222223000000000000000000000000000000000000002222222222222222222222222223555555555555555555
+55555555555555555552222222222222222222222240000000000000000000000000000000000005222222222222222222222222222222225000000000000000
+00000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000
+00000000000000000000000600042222222222222222222222222222222222222222222222222222222222222222222222222260000000000000000000000000
+00000000000622222222222222222222222222222222222400000000000000000000000000000000522223000000000000000000000000000000042222222222
+22222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000
+00000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000
+00000000000000222222222222222222222222222222222222220000000000000000000000000000000000000032222222222222222222222222235555555555
+55555555555555555555555555522222222222222222222222300000000000000000000000000000000000052222222222222222222222222222222250000000
+00000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500
+00000000000000000000000000000006020222222222222222222222222222222222222222222222222222222222222222222222222224000000000000000000
+00000000000000000006222222222222222222222222222222222225000000000000000000000000000000004222220000000000000000000000000000000522
+22222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000
+00000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000
+00000000000000000000002222222222222222222222222222222222222260000000000000000000000000000000000000422222222222222222222222222355
+55555555555555555555555555555555555222222222222222222222223000000000000000000000000000000000000622222222222222222222222222222222
+50000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222
+22222500000000000000000000000000000000060202222222222222222222222222222222222222222222222222222222222222222222222222300000000000
+00000000000000000000000000062222222222222222222222222222222222200000000000000000000000000000000032222260000000000000000000000000
+00000022222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000
+00000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000
+00000000000000000000000000000022222222222222222222222222222222222222500000000000000000000000000000000000005222222222222222222222
+22222355555555555555555555555555555555555552222222222222222222222220000000000000000000000000000000000000222222222222222222222222
+22222222500000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222
+22222222222225000000000000000000000000000000000602022222222222222222222222222222222222222222222222222222222222222222222222226000
+00000000000000000000000000000000000622222222222222222222222222222222224000000000000000000000000000000000222222500000000000000000
+00000000000000422222222222222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222
+22300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222
+22300000000000000000000000000000000000222222222222222222222222222222222222224000000000000000000000000000000000000062222222222222
+22222222222225555555555555555555555555555555555555522222222222222222222222200000000000000000000000000000000000003222222222222222
+22222222222222225000000000000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222
+22222222222222222222250000000000000000000000000000000006020222222222222222222222222222222222222222222222222222222222222222222222
+22300000000000000000000000000000000000000005222222222222222222222222222222222250000000000000000000000000000000052222224000000000
+00000000000000000000005222222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222
+22222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222
+22222222223000000000000000000000000000000000002222222222222222222222222222222222222230000000000000000000000000000000000000022222
+22222222222222222222255555555555555555555555555555555555555322222222222222222222222600000000000000000000000000000000000052222222
+22222222222222222222222250000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222
+22222222222222222222222222222500000000000000000000000000000000060202222222222222222222222222222222222222222222222222222222222222
+22222222240000000000000000000000000000000000000000052222222222222222222222222222222222000000000000000000000000000000000422222230
+00000000000000000000000000000002222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222
+22222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222
+22222222222222222230000000000000000000000000000000000022222222222222222222222222222222222222300000000000000000000000000000000000
+00032222222222222222222222222555555555555555555555555555555555555553222222222222222222222225000000000000000000000000000000000000
+62222222222222222222222222222222500000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000
+00222222222222222222222222222222222225000000000000000000000000000000000602022222222222222222222222222222222222222222222222222222
+22222222222222236000000000000000000000000000000000000000000422222222222222222222222222222222240000000000000000000000000000000003
+22222220000000000000000000000000000000042222222222222222222222222222222222222222222222600000000000000000000000000000000032222222
+22222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002
+22222222222222222222222222300000000000000000000000000000000000222222222222222222222222222222222222222000000000000000000000000000
+00000000000522222222222222222222222225555555555555555555555555555555555555532222222222222222222222240000000000000000000000000000
+00000000042222222222222222222222222222225000000000000000000000000000000000032222222222222222222222222226000000000000000000000000
+00000000002222222222222222222222222222222222250000000000000000000000000000000006020222222222222222222222222222222222222222222222
+22222222222222222222246000000000000000000000000000000000000000000003222222222222222222222222222222222500000000000000000000000000
+00000062222222250000000000000000000000000000000622222222222222222222222222222222222222222222226000000000000000000000000000000000
+32222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000
+00000002222222222222222222222222223000000000000000000000000000000000002222222222222222222222222222222222222220000000000000000000
+00000000000000000005222222222222222222222222255555555555555555555555555555555555555322222222222222222222222300000000000000000000
+00000000000000000622222222222222222222222222222250000000000000000000000000000000000322222222222222222222222222260000000000000000
+00000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222222222222222222222222222222222
+22222222222222222222222222450000000000000000000000000000000000000000000000022222222222222222222222222222222220000000000000000000
+00000000000000522222222400000000000000000000000000000000322222222222222222222222222222222222222222222260000000000000000000000000
+00000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000
+00000000000000022222222222222222222222222230000000000000000000000000000000000022222222222222222222222222222222222222260000000000
+00000000000000000000000000062222222222222222222222222555555555555555555555555555555555555553222222222222222222222222000000000000
+00000000000000000000000000522222222222222222222222222222500000000000000000000000000000000003222222222222222222222222222600000000
+00000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222222222222222222222222222
+22222222222222222222222222222234500000000000000000000000000000000000000000000000006222222222222222222222222222222222400000000000
+00000000000000000000004222222223000000000000000000000000000000005222222222222222222222222222222222222222222222600000000000000000
+00000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000
+00000000000000000000000222222222222222222222222222300000000000000000000000000000000000222222222222222222222222222222222222222600
+00000000000000000000000000000000000022222222222222222222222235555555555555555555555555555555555555532222222222222222222222225000
+00000000000000000000000000000000000422222222222222222222222222225000000000000000000000000000000000032222222222222222222222222226
+00000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006020222222222222222222222
+22222222222222222222222222222222234560000000000000000000000000000000000000000000000000000052222222222222222222222222222222225000
+00000000000000000000000000000032222222220000000000000000000000000000000062222222222222222222222222222222222222222222226000000000
+00000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600
+00000000000000000000000000000002222222222222222222222222223000000000000000000000000000000000002222222222222222222222222222222222
+22222600000000000000000000000000000000000000222222222222222222222222355555555555555555555555555555555555555522222222222222222222
+22224000000000000000000000000000000000000000522222222222222222222222222250000000000000000000000000000000000322222222222222222222
+22222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222222222
+22222222222222222222222222222222222234560000000000000000000000000000000000000000000000000000000000322222222222222222222222222222
+22220000000000000000000000000000000006222222222260000000000000000000000000000000032222222222222222222222222222222222222222222260
+00000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222
+22222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022222222222222222222222222
+22222222222226000000000000000000000000000000000000003222222222222222222222223555555555555555555555555555555555555555222222222222
+22222222222220000000000000000000000000000000000000000632222222222222222222222222400000000000000000000000000000000003222222222222
+22222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222
+22222222222222222222222222222222222222345660000000000000000000000000000000000000000000000000000000000000002222222222222222222222
+22222222222400000000000000000000000000000000052222222222500000000000000000000000000000000522222222222222222222222222222222222222
+22222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222
+22222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000000000222222222222222222
+22222222222222222222250000000000000000000000000000000000000032222222222222222222222235555555555555555555555555555555555555552222
+22222222222222222222250000000000000000000000000000000000000000053222222222222222222222223000000000000000000000000000000000032222
+22222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006
+02022222222222222222222222222222222222222345600000000000000000000000000000000000000000000000000000000000000000000522222222222222
+22222222222222222225000000000000000000000000000000000422222222223000000000000000000000000000000000222222222222222222222222222222
+22222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222
+22222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000000000000000002222222222
+22222222222222222222222222222500000000000000000000000000000000000000522222222222222222222222355555555555555555555555555555555555
+55552222222222222222222222222300000000000000000000000000000000000000000005422222222222222222222230000000000000000000000000000000
+00032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000
+00000006020222222222222222222222222222222222224500000000000000000000000000000000000000000000000000000000000000000000000003222222
+22222222222222222222222222200000000000000000000000000000000002222222222220000000000000000000000000000000004222222222222222222222
+22222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222
+22222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022
+22222222222222222222222222222222222225000000000000000000000000000000000000005222222222222222222222223555555555555555555555555555
+55555555555522222222222222222222222222600000000000000000000000000000000000000000000055322222222222222222300000000000000000000000
+00000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000
+00000000000000060202222222222222222222222222222222235000000000000000000000000000000000000000000000000000000000000000000000000000
+62222222222222222222222222222222224000000000000000000000000000000000522222222222250000000000000000000000000000000052222222222222
+22222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000
+00062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000
+00000022222222222222222222222222222222222222250000000000000000000000000000000000000052222222222222222222222235555555555555555555
+55555555555555555555222222222222222222222222224000000000000000000000000000000000000000000000000006555333322222223000000000000000
+00000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000
+00000000000000000000000602022222222222222222222222222222236000000000000000000000000000000000000000000000000000000000000000000000
+00000000422222222222222222222222222222222250000000000000000000000000000000004222222222222400000000000000000000000000000000022222
+22222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000
+00000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000
+00000000000000222222222222222222222222222222222222222500000000000000000000000000000000000000622222222222222222222222355555555555
+55555555555555555555555555552222222222222222222222222226000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500
+00000000000000000000000000000006030522222222222222222222222222246000000000000000000000000000000000000000000000000000000000000000
+00000000000000062222222222222222222222222222222222000000000000000000000000000000000032222222222223000000000000000000000000000000
+00042222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000
+00000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000
+00000000000000000000002222222222222222222222222222222222222225000000000000000000000000000000000000006222222222222222222222223555
+55555555555555555555555555555555555522222222222222222222222222230000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222
+22222500000000000000000000000000000000060202222222222222222222222222236000000000000000000000000000000000000000000000000000000000
+00000000000000000000000322222222222222222222222222222222240000000000000000000000000000000006222222222222226000000000000000000000
+00000000000522222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000
+00000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000
+00000000000000000000000000000022222222222222222222222222222222222222250000000000000000000000000000000000000062222222222222222222
+22223555555555555555555555555555555555555555222222222222222222222222222250000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222
+22222222222225000000000000000000000000000000000600002222222222222222222222225000000000000000000000000000000000000000000000000000
+00000000000000000000000000000052222222222222222222222222222222222500000000000000000000000000000000052222222222222250000000000000
+00000000000000000000322222222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222
+22300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222
+22300000000000000000000000000000000000222222222222222222222222222222222222222500000000000000000000000000000000000000022222222222
+22222222222235555555555555555555555555555555555555552222222222222222222222222222300000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222
+22222222222222222222250000000000000000000000000000000006020222222222222222222222224000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000222222222222222222222222222222222220000000000000000000000000000000000322222222222222400000
+00000000000000000000000000004222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222
+22222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222
+22222222223000000000000000000000000000000000002222222222222222222222222222222222222225000000000000000000000000000000000000000222
+22222222222222222222355555555555555555555555555555555555555522222222222222222222222222222400000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222
+22222222222222222222222222222500000000000000000000000000000000060000222222222222222222222500000000000000000000000000000000000000
+00000000000000000000000000000000000000000000032222222222222222222222222222222222400000000000000000000000000000000002222222222222
+22200000000000000000000000000000000062222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222
+22222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222
+22222222222222222230000000000000000000000000000000000022222222222222222222222222222222222222250000000000000000000000000000000000
+00000222222222222222222222223555555555555555555555555555555555555555222222222222222222222222222222500000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000
+00222222222222222222222222222222222225000000000000000000000000000000000602022222222222222222222300000000000000000000000000000000
+00000000000000000000000000000000000000000000000000005222222222222222222222222222222222226000000000000000000000000000000000522222
+22222222222500000000000000000000000000000000032222222222222222222222222222222222222222600000000000000000000000000000000032222222
+22222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002
+22222222222222222222222222300000000000000000000000000000000000222222222222222222222222222222222222222400000000000000000000000000
+00000000000002222222222222222222222235555555555555555555555555555555555555552222222222222222222222222222222600000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000032222222222222222222222222226000000000000000000000000
+00000000002222222222222222222222222222222222250000000000000000000000000000000006000022222222222222222240000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000522222222222222222222222222222222222300000000000000000000000000000000
+00422222222222222224000000000000000000000000000000000522222222222222222222222222222222222222226000000000000000000000000000000000
+32222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000
+00000002222222222222222222222222223000000000000000000000000000000000002222222222222222222222222222222222222223000000000000000000
+00000000000000000000022222222222222222222222355555555555555555555555555555555555555522222222222222222222222222222222600000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000322222222222222222222222222260000000000000000
+00000000000000000022222222222222222222222222222222222500000000000000000000000000000000060202222222222222222224000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222224000000000000000000000000
+00000000002222222222222222220000000000000000000000000000000006222222222222222222222222222222222222222260000000000000000000000000
+00000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000
+00000000000000022222222222222222222222222230000000000000000000000000000000000022222222222222222222222222222222222222230000000000
+00000000000000000000000000000222222222222222222222223555555555555555555555555555555555555555222222222222222222222222222222223000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003222222222222222222222222222600000000
+00000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000600002222222222222222500000000000
+00000000000000000000000000000000000000000000000000000000000000000000000006222222222222222222222222222222222222260000000000000000
+00000000000000000522222222222222222260000000000000000000000000000000003222222222222222222222222222222222222222600000000000000000
+00000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000
+00000000000000000000000222222222222222222222222222300000000000000000000000000000000000222222222222222222222222222222222222222300
+00000000000000000000000000000000000002222222222222222222222235555555555555555555555555555555555555552222222222222222222222222222
+22222300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032222222222222222222222222226
+00000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006020222222222222222240000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000622222222222222222222222222222222222223000000000
+00000000000000000000000004222222222222222222400000000000000000000000000000000052222222222222222222222222222222222222226000000000
+00000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600
+00000000000000000000000000000002222222222222222222222222223000000000000000000000000000000000002222222222222222222222222222222222
+22222300000000000000000000000000000000000000022222222222222222222222355555555555555555555555555555555555555522222222222222222222
+22222222222222260000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000322222222222222222222
+22222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000000000060000222222222222
+22300000000000000000000000000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222222222222240
+00000000000000000000000000000000032222222222222222223000000000000000000000000000000000022222222222222222222222222222222222222260
+00000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222
+22222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022222222222222222222222222
+22222222222223000000000000000000000000000000000000000222222222222222222222223555555555555555555555555555555555555555222222222222
+22222222222222222222222250000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003222222222222
+22222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000602022222
+22222222226000000000000000000000000000000000000000000000000000000000000000000000000000000000005222222222222222222222222222222222
+22222260000000000000000000000000000000006222222222222222222226000000000000000000000000000000000422222222222222222222222222222222
+22222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222
+22222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000000000222222222222222222
+22222222222222222222240000000000000000000000000000000000000002222222222222222222222235555555555555555555555555555555555555552222
+22222222222222222222222222222222240000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032222
+22222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006
+00002222222222222500000000000000000000000000000000000000000000000000000000000000000000000000000000000422222222222222222222222222
+22222222222223000000000000000000000000000000000052222222222222222222240000000000000000000000000000000005222222222222222222222222
+22222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222
+22222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000000000000000002222222222
+22222222222222222222222222222500000000000000000000000000000000000000022222222222222222222222355555555555555555555555555555555555
+55552222222222222222222222222222222222222236000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000
+00000006020222222222222230000000000000000000000000000000000000000000000000000000000000000000000000000000000532222222222222222222
+22222222222222222222240000000000000000000000000000000000322222222222222222222300000000000000000000000000000000002222222222222222
+22222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222
+22222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022
+22222222222222222222222222222222222225000000000000000000000000000000000000000222222222222222222222223555555555555555555555555555
+55555555555522222222222222222222222222222222222222225000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000
+00000000000000060000222222222222500000000000000000000000000000000000000000000000000000000000000000000000000000000632222222222222
+22222222222222222222222222222600000000000000000000000000000000002222222222222222222222600000000000000000000000000000000042222222
+22222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000
+00062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000
+00000022222222222222222222222222222222222222250000000000000000000000000000000000000002222222222222222222222235555555555555555555
+55555555555555555555222222222222222222222222222222222222222223500000000000000000000000000000000000000000000000000000000000000000
+00000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000
+00000000000000000000000602022222222222230000000000000000000000000000000000000000000000000000000000000000000000000000000642222222
+22222222222222222222222222222222222230000000000000000000000000000000000522222222222222222222225000000000000000000000000000000000
+62222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222223000000000000000000000
+00000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000
+00000000000000222222222222222222222222222222222222222500000000000000000000000000000000000000022222222222222222222222355555555555
+55555555555555555555555555552222222222222222222222222222222222222222222350000000000000000000000000000000000000000000000000000000
+00000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500
+00000000000000000000000000000006000022222222222500000000000000000000000000000000000000000000000000000000000000000000000000000532
+22222222222222222222222222222222222222222222400000000000000000000000000000000004222222222222222222222230000000000000000000000000
+00000000032222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222222222222230000000000000
+00000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000
+00000000000000000000002222222222222222222222222222222222222225000000000000000000000000000000000000006222222222222222222222223555
+55555555555555555555555555555555555522222222222222222222222222222222222222222222235000000000000000000000000000000000000000000000
+00000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222
+22222500000000000000000000000000000000060600222222222220000000000000000000000000000000000000000000000000000000000000000000000000
+00653222222222222222222222222222222222222222222222226000000000000000000000000000000000022222222222222222222222260000000000000000
+00000000000000000422222222222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222300000
+00000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000
+00000000000000000000000000000022222222222222222222222222222222222222250000000000000000000000000000000000000062222222222222222222
+22223555555555555555555555555555555555555555222222222222222222222222222222222222222222222222460000000000000000000000000000000000
+00000000000000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222
+22222222222225000000000000000000000000000000000600002222222222400000000000000000000000000000000000000000000000000000000000000000
+00000006532222222222222222222222222222222222222222222222222300000000000000000000000000000000006222222222222222222222222500000000
+00000000000000000000000006222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222
+22300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222
+22300000000000000000000000000000000000222222222222222222222222222222222222222500000000000000000000000000000000000000622222222222
+22222222222235555555555555555555555555555555555555552222222222222222222222222222222222222222222222222235600000000000000000000000
+00000000000000000000000000000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222
+22222222222222222222250000000000000000000000000000000006000022222222226000000000000000000000000000000000000000000000000000000000
+00000000000054322222222222222222222222222222222222222222222222222224000000000000000000000000000000000042222222222222222222222224
+00000000000000000000000000000000003222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222222
+22222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000000000022222222222222222
+22222222223000000000000000000000000000000000002222222222222222222222222222222222222225000000000000000000000000000000000000006222
+22222222222222222222355555555555555555555555555555555555555522222222222222222222222222222222222222222222222222222345000000000000
+00000000000000000000000000000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222
+22222222222222222222222222222500000000000000000000000000000000060000222222222300000000000000000000000000000000000000000000000000
+00000000000000006532222222222222222222222222222222222222222222222222222222260000000000000000000000000000000000322222222222222222
+22222222000000000000000000000000000000000052222222222222222222222222222222222260000000000000000000000000000000003222222222222222
+22222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000000000000000000222222222
+22222222222222222230000000000000000000000000000000000022222222222222222222222222222222222222250000000000000000000000000000000000
+00005222222222222222222222223555555555555555555555555555555555555555222222222222222222222222222222222222222222222222222222222345
+60000000000000000000000000000000000000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000
+00222222222222222222222222222222222225000000000000000000000000000000000600002222222224000000000000000000000000000000000000000000
+00000000000000000000654222222222222222222222222222222222222222222222222222222222223000000000000000000000000000000000062222222222
+22222222222222225000000000000000000000000000000000622222222222222222222222222222222222600000000000000000000000000000000032222222
+22222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000000000000000000000000002
+22222222222222222222222222300000000000000000000000000000000000222222222222222222222222222222222222222500000000000000000000000000
+00000000000052222222222222222222222235555555555555555555555555555555555555532222222222222222222222222222222222222222222222222222
+22222222223456600000000000000000000000000000000000000000000000000000000000032222222222222222222222222226000000000000000000000000
+00000000002222222222222222222222222222222222250000000000000000000000000000000006000022222222250000000000000000000000000000000000
+00000000000000000000000065422222222222222222222222222222222222222222222222222222222222222240000000000000000000000000000000000522
+22222222222222222222222240000000000000000000000000000000000322222222222222222222222222222222226000000000000000000000000000000000
+32222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600000000000000000000000000
+00000002222222222222222222222222223000000000000000000000000000000000002222222222222222222222222222222222222226000000000000000000
+00000000000000000000422222222222222222222222255555555555555555555555555555555555555322222222222222222222222222222222222222222222
+22222222222222222222222233455566660000000000000060000000000000000000000000000000000322222222222222222222222222260000000000000000
+00000000000000000022222222222222222222222222222222222500000000000000000000000000000000060000222222222000000000000000000000000000
+00000000000000000000000000006542222222222222222222222222222222222222222222222222222222222222222222600000000000000000000000000000
+00000322222222222222222222222222200000000000000000000000000000000005222222222222222222222222222222222260000000000000000000000000
+00000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222222226000000000000000000
+00000000000000022222222222222222222222222230000000000000000000000000000000000022222222222222222222222222222222222222260000000000
+00000000000000000000000000003222222222222222222222222555555555555555555555555555555555555553222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222600000000
+00000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000600002222222230000000000000000000
+00000000000000000000000000000000654322222222222222222222222222222222222222222222222222222222222222222222230000000000000000000000
+00000000000002222222222222222222222222222500000000000000000000000000000000002222222222222222222222222222222222600000000000000000
+00000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222222222222222260000000000
+00000000000000000000000222222222222222222222222222300000000000000000000000000000000000222222222222222222222222222222222222222600
+00000000000000000000000000000000000022222222222222222222222225555555555555555555555555555555555555532222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222226
+00000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006000022222222400000000000
+00000000000000000000000000000000000006432222222222222222222222222222222222222222222222222222222222222222222222222400000000000000
+00000000000000000000522222222222222222222222222224000000000000000000000000000000000042222222222222222222222222222222226000000000
+00000000000000000000000032222222222222222222222222222222223000000000000000000000000000000006222222222222222222222222222222222600
+00000000000000000000000000000002222222222222222222222222223000000000000000000000000000000000002222222222222222222222222222222222
+22222000000000000000000000000000000000000000222222222222222222222222255555555555555555555555555555555555555322222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000322222222222222222222
+22222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000000000060000222222225000
+00000000000000000000000000000000000000000065322222222222222222222222222222222222222222222222222222222222222222222222222226000000
+00000000000000000000000000004222222222222222222222222222220000000000000000000000000000000000522222222222222222222222222222222260
+00000000000000000000000000000000322222222222222222222222222222222230000000000000000000000000000000062222222222222222222222222222
+22222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022222222222222222222222222
+22222222222230000000000000000000000000000000000000062222222222222222222222222555555555555555555555555555555555555553222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222260000000000000000000000000000000003222222222222
+22222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000000000000000000600002222
+22225000000000000000000000000000000000000000000064222222222222222222222222222222222222222222222222222222222222222222222222222222
+30000000000000000000000000000000000022222222222222222222222222222250000000000000000000000000000000000222222222222222222222222222
+22222260000000000000000000000000000000003222222222222222222222222222222222300000000000000000000000000000000622222222222222222222
+22222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000000000222222222222222222
+22222222222222222222300000000000000000000000000000000000000522222222222222222222222225555555555555555555555555555555555555532222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222600000000000000000000000000000000032222
+22222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222250000000000000000000000000000000006
+00002222222260000000000000000000000000000000000000000004222222222222222222222222222222222222222222222222222222222222222222222222
+22222222400000000000000000000000000000000006222222222222222222222222222222400000000000000000000000000000000004222222222222222222
+22222222222222600000000000000000000000000000000032222222222222222222222222222222224000000000000000000000000000000006222222222222
+22222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000000000000000002222222222
+22222222222222222222222222225000000000000000000000000000000000000005222222222222222222222222255555555555555555555555555555555555
+55522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000
+00032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222500000000000000000000000000
+00000006000022222222000000000000000000000000000000000000000006222222222222222222222222222222222222222222222222222222222222222222
+22222222222222226000000000000000000000000000000000042222222222222222222222222222223000000000000000000000000000000000062222222222
+22222222222222222222226000000000000000000000000000000000322222222222222222222222222222222250000000000000000000000000000000062222
+22222222222222222222222222222600000000000000000000000000000000022222222222222222222222222230000000000000000000000000000000000022
+22222222222222222222222222222222222250000000000000000000000000000000000000032222222222222222222222222355555555555555555555555555
+55555555555222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222260000000000000000000000
+00000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222222225000000000000000000
+00000000000000060000222222220000000000000000000000000000000000000000522222222222222222222222222222222222222222222222222222222222
+22222222222222222222222300000000000000000000000000000000000322222222222222222222222222222226000000000000000000000000000000000032
+22222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222500000000000000000000000000000
+00062222222222222222222222222222222226000000000000000000000000000000000222222222222222222222222222300000000000000000000000000000
+00000022222222222222222222222222222222222222600000000000000000000000000000000000000222222222222222222222222223555555555555555555
+55555555555555555552222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222600000000000000
+00000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222222222222222260000000000
+00000000000000000000000600002222222200000000000000000000000000000000000000062222222222222222222222222222222222222222222222222222
+22222222222222222222222222222225000000000000000000000000000000000062222222222222222222222222222222240000000000000000000000000000
+00000042222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222225000000000000000000000
+00000000000622222222222222222222222222222222260000000000000000000000000000000002222222222222222222222222223000000000000000000000
+00000000000000222222222222222222222222222222222222220000000000000000000000000000000000000062222222222222222222222222235555555555
+55555555555555555555555555522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222226000000
+00000000000000000000000000032222222222222222222222222226000000000000000000000000000000000022222222222222222222222222222222222600
+00000000000000000000000000000006000022222222000000000000000000000000000000000000000322222222222222222222222222222222222222222222
+22222222222222222222222222222222222222260000000000000000000000000000000000522222222222222222222222222222222300000000000000000000
+00000000000000622222222222222222222222222222226000000000000000000000000000000000322222222222222222222222222222222250000000000000
+00000000000000000006222222222222222222222222222222222000000000000000000000000000000000022222222222222222222222222230000000000000
+00000000000000000000002222222222222222222222222222222222222400000000000000000000000000000000000000522222222222222222222222222355
+55555555555555555555555555555555555222222222222222222222222222222222222222233222222222222222222222222222222222222222222222222222
+20000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000222222222222222222222222222222
+22222600000000000000000000000000000000060000222222220000000000000000000000000000000000000052222222222222222222222222222222222222
+22222222222222222222222222222222222222222222223000000000000000000000000000000000004222222222222222222222222222222222600000000000
+00000000000000000000000322222222222222222222222222222260000000000000000000000000000000003222222222222222222222222222222222500000
+00000000000000000000000000062222222222222222222222222222222220000000000000000000000000000000000222222222222222222222222222300000
+00000000000000000000000000000022222222222222222222222222222222222225000000000000000000000000000000000000004222222222222222222222
+22222355555555555555555555555555555555555552222222222222222222222222222222222222222505222222222222222222222222222222222222222222
+22222222200000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000002222222222222222222222
+22222222222226000000000000000000000000000000000600002222222200000000000000000000000000000000000000322222222222222222222222222222
+22222222222222222222222222222222222222222222222222222250000000000000000000000000000000000022222222222222222222222222222222225000
+00000000000000000000000000000005222222222222222222222222222222600000000000000000000000000000000032222222222222222222222222222222
+22500000000000000000000000000000000622222222222222222222222222222222200000000000000000000000000000000002222222222222222222222222
+22300000000000000000000000000000000000222222222222222222222222222222222222200000000000000000000000000000000000000032222222222222
+22222222222222555555555555555555555555555555555555322222222222222222222222222222222222222230006322222222222222222222222222222222
+22222222222222222000000000000000000000000000000000032222222222222222222222222226000000000000000000000000000000000042222222222222
+22222222222222222222200000000000000000000000000000000006020222222222000000000000000000000000000000000000002222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222600000000000000000000000000000000005222222222222222222222222222222
+22223000000000000000000000000000000000062222222222222222222222222222226000000000000000000000000000000000322222222222222222222222
+22222222226000000000000000000000000000000006222222222222222222222222222222222000000000000000000000000000000000022222222222222222
+22222222223000000000000000000000000000000000002222222222222222222222222222222222224000000000000000000000000000000000000000222222
+22222222222222222222225555555555555555555555555555555555553222222222222222222222222222222222222222600000522222222222222222222222
+22222222222222222222222230000000000000000000000000000000000322222222222222222222222222260000000000000000000000000000000000052222
+22222222222222222222222222222000000000000000000000000000000000060000222222220000000000000000000000000000000000000622222222222222
+22222222222222222222222222222222222222222222222222222222222222222222230000000000000000000000000000000000042222222222222222222222
+22222222222226000000000000000000000000000000000042222222222222222222222222222260000000000000000000000000000000003222222222222222
+22222222222222222260000000000000000000000000000000005222222222222222222222222222222230000000000000000000000000000000000222222222
+22222222222222222230000000000000000000000000000000000022222222222222222222222222222222222260000000000000000000000000000000000000
+05222222222222222222222222222255555555555555555555555555555555555532222222222222222222222222222222222222250000000042222222222222
+22222222222222222222222222222222400000000000000000000000000000000003222222222222222222222222222600000000000000000000000000000000
+00005222222222222222222222222222222230000000000000000000000000000000000602022222222200000000000000000000000000000000000006222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000000000000222222222222222
+22222222222222222222250000000000000000000000000000000000522222222222222222222222222222600000000000000000000000000000000062222222
+22222222222222222222222222000000000000000000000000000000000005222222222222222222222222222222300000000000000000000000000000000002
+22222222222222222222222222300000000000000000000000000000000000422222222222222222222222222222222224000000000000000000000000000000
+00000000042222222222222222222222222222555555555555555555555555555555555555222222222222222222222222222222222222223000000000063222
+22222222222222222222222222222222222222225000000000000000000000000000000000032222222222222222222222222226000000000000000000000000
+00000000000006322222222222222222222222222222400000000000000000000000000000000006000022222222600000000000000000000000000000000000
+06222222222222222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000000000000000062222222
+22222222222222222222222222222400000000000000000000000000000000000222222222222222222222222222226000000000000000000000000000000000
+06322222222222222222222222222222230000000000000000000000000000000000006322222222222222222222222222224000000000000000000000000000
+00000002222222222222222222222222223000000000000000000000000000000000000422222222222222222222222222222222260000000000000000000000
+00000000000000000222222222222222222222222222223555555555555555555555555555555555552222222222222222222222222222222222222250000000
+00000532222222222222222222222222222222222222222260000000000000000000000000000000000322222222222222222222222222260000000000000000
+00000000000000000000000422222222222222222222222222225000000000000000000000000000000000060202222222226000000000000000000000000000
+00000000002222222222222222222222222222222222222222222222222222222222222222222222222222222222300000000000000000000000000000000000
+42222222222222222222222222222222222222000000000000000000000000000000000004222222222222222222222222222260000000000000000000000000
+00000000000422222222222222222222222222222400000000000000000000000000000000000000422222222222222222222222222250000000000000000000
+00000000000000022222222222222222222222222230000000000000000000000000000000000000422222222222222222222222222222225000000000000000
+00000000000000000000000052222222222222222222222222222235555555555555555555555555555555555522222222222222222222222222222222222223
+00000000000000053222222222222222222222222222222222222222000000000000000000000000000000000003222222222222222222222222222600000000
+00000000000000000000000000000000522222222222222222222222222260000000000000000000000000000000000602022222222250000000000000000000
+00000000000000000032222222222222222222222222222222222222222222222222222222222222222222222222222222225000000000000000000000000000
+00000000322222222222222222222222222222222222225000000000000000000000000000000000052222222222222222222222222222600000000000000000
+00000000000000000000522222222222222222222222222225000000000000000000000000000000000000000522222222222222222222222222600000000000
+00000000000000000000006222222222222222222222222222300000000000000000000000000000000000000422222222222222222222222222222300000000
+00000000000000000000000000000000422222222222222222222222222222355555555555555555555555555555555555222222222222222222222222222222
+22222226000000000000000005222222222222222222222222222222222222240000000000000000000000000000000000032222222222222222222222222226
+00000000000000000000000000000000000000000042222222222222222222222223000000000000000000000000000000000006020222222222500000000000
+00000000000000000000000000422222222222222222222222222222222222222222222224642222222222222222222222222222222260000000000000000000
+00000000000000062222222222222222222222222222222222222240000000000000000000000000000000000022222222222222222222222222226000000000
+00000000000000000000000000000042222222222222222222222222200000000000000000000000000000000000000000042222222222222222222222220000
+00000000000000000000000000000062222222222222222222222222223000000000000000000000000000000000000000522222222222222222222222222220
+00000000000000000000000000000000000000002222222222222222222222222222222555555555555555555555555555555555532222222222222222222222
+22222222222222500000000000000000000532222222222222222222222222222222222600000000000000000000000000000000000322222222222222222222
+22222226000000000000000000000000000000000000000000063222222222222222222222260000000000000000000000000000000000060202222222223000
+00000000000000000000000000000000006222222222222222222222222222222222222222222225000622222222222222222222222222222223000000000000
+00000000000000000000000522222222222222222222222222222222222222200000000000000000000000000000000000422222222222222222222222222260
+00000000000000000000000000000000000000063222222222222222222222224000000000000000000000000000000000000000000063222222222222222222
+22240000000000000000000000000000000000622222222222222222222222222230000000000000000000000000000000000000000522222222222222222222
+22222260000000000000000000000000000000000000000522222222222222222222222222222225555555555555555555555555555555555322222222222222
+22222222222222222222230000000000000000000000053222222222222222222222222222222240000000000000000000000000000000000002222222222222
+22222222222222200000000000000000000000000000000000000000000005322222222222222222224000000000000000000000000000000000000502022222
+22222000000000000000000000000000000000000004222222222222222222222222222222222222222225000000422222222222222222222222222222250000
+00000000000000000000000000000004222222222222222222222222222222222222222500000000000000000000000000000000006222222222222222222222
+22222200000000000000000000000000000000000000000005322222222222222222222200000000000000000000000000000000000000000000006322222222
+22222222222000000000000000000000000000000000006222222222222222222222222222300000000000000000000000000000000000000000632222222222
+22222222222236000000000000000000000000000000000000000004222222222222222222222222222222255555555555555555555555555555555553222222
+22222222222222222222222222222500000000000000000000000006422222222222222222222222222223000000000000000000000000000000000000022222
+22222222222222222222222000000000000000000000000000000000000000000000000532222222222222222300000000000000000000000000000000000005
+02022222222226000000000000000000000000000000000000003222222222222222222222222222222222222235000000006222222222222222222222222222
+22260000000000000000000000000000000000022222222222222222222222222222222222222224000000000000000000000000000000000003222222222222
+22222222222222000000000000000000000000000000000000000000000532222222222222222226000000000000000000000000000000000000000000000000
+64222222222222222250000000000000000000000000000000000062222222222222222222222222223000000000000000000000000000000000000000000052
+22222222222222222224000000000000000000000000000000000000000000622222222222222222222222222222222555555555555555555555555555555555
+52222222222222222222222222222222222230000000000000000000000000000054222222222222222222222222300000000000000000000000000000000000
+00022222222222222222222222222220000000000000000000000000000000000000000000000000064322222222222240000000000000000000000000000000
+00000005020222222222250000000000000000000000000000000000000062222222222222222222222222222222222246000000000004222222222222222222
+22222222223000000000000000000000000000000000005222222222222222222222222222222222222222220000000000000000000000000000000000052222
+22222222222222222222220000000000000000000000000000000000000000000000064322222222222223600000000000000000000000000000000000000000
+00000000006532222222222236000000000000000000000000000000000000522222222222222222222222222230000000000000000000000000000000000000
+00000000532222222222222223600000000000000000000000000000000000000000005222222222222222222222222222222223555555555555555555555555
+55555555522222222222222222222222222222222222600000000000000000000000000000000543222222222222222222250000000000000000000000000000
+00000000006222222222222222222222222222200000000000000000000000000000000000000000000000000000654322222356000000000000000000000000
+00000000000000040202222222222300000000000000000000000000000000000000063222222222222222222222222222222350000000000000062222222222
+22222222222222222250000000000000000000000000000000000042222222222222222222222222222222222222222250000000000000000000000000000000
+00062222222222222222222222222200000000000000000000000000000000000000000000000000654322222234500000000000000000000000000000000000
+00000000000000000000005533333456000000000000000000000000000000000000005222222222222222222222222222300000000000000000000000000000
+00000000000000000054322222222234600000000000000000000000000000000000000000000022222222222222222222222222222222235555555555555555
+55555555555555555222222222222222222222222222222222240000000000000000000000000000000000006543222222222222450000000000000000000000
+00000000000000000052222222222222222222222222223000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000302022222222222000000000000000000000000000000000000000004222222222222222222222222223560000000000000000032
+22222222222222222222222222600000000000000000000000000000000000322222222222222222222222222222222222222222400000000000000000000000
+00000000000032222222222222222222222222000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000042222222222222222222222222223000000000000000000000
+00000000000000000000000000000665555560000000000000000000000000000000000000000000000005222222222222222222222222222222222255555555
+55555555555555555555555532222222222222222222222222222222222000000000000000000000000000000000000000000066666666000000000000000000
+00000000000000000000000000522222222222222222222222222230000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000003020222222222225000000000000000000000000000000000000000006422222222222222222222245600000000000000
+00000062222222222222222222222222230000000000000000000000000000000000062222222222222222222222222222222222222222223000000000000000
+00000000000000000000522222222222222222222222230000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000322222222222222222222222222230000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032222222222222222222222222222222222
+55555555555555555555555555555555322222222222222222222222222222222250000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000003222222222222222222222222222400000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000020202222222222230000000000000000000000000000000000000000000654222222222222234560000000000
+00000000000000032222222222222222222222222500000000000000000000000000000000000522222222222222222222222222222222222222222226000000
+00000000000000000000000000000222222222222222222222222300000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003222222222222222222222222222300000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005222222222222222222222222222
+22222222555555555555555555555555555555552222222222222222222222222222222223000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000022222222222222222222222222225000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000202022222222222260000000000000000000000000000000000000000000000665555566600000000
+00000000000000000000000622222222222222222222222226000000000000000000000000000000000003222222222222222222222222222222222222222222
+24000000000000000000000000000000000004222222222222222222222223000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000022222222222222222222222222
+22300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032222222222222222222
+22222222222222223555555555555555555555555555555522222222222222222222222222222222260000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000006222222222222222222222222222250000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000062030022222222222400000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000322222222222222222222222300000000000000000000000000000000000622222222222222222222222222222222222
+22222222230000000000000000000000000000000000052222222222222222222222250000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006222222222222222222
+22222222223000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005222222222222
+22222222222222222222222235555555555555555555555555555555222222222222222222222222222222224000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000042222222222222222222222222222600000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000520202222222222222600000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000006222222222222222222222225000000000000000000000000000000000005222222222222222222222222222
+22222222222222222260000000000000000000000000000000000022222222222222222222222500000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000052222222222
+22222222222222222230000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000022222
+22222222222222222222222222222222255555555555555555555555555555532222222222222222222222222222222200000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000322222222222222222222222222226000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000004200002222222222224000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000003222222222222222222222260000000000000000000000000000000000042222222222222222222
+22222222222222222222222222500000000000000000000000000000000000422222222222222222222225000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000422
+22222222222222222222222222300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00422222222222222222222222222222222222222555555555555555555555555555555322222222222222222222222222222225000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000062222222222222222222222222222200000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000022020222222222222226000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000062222222222222222222223000000000000000000000000000000000000222222222222
+22222222222222222222222222222222223000000000000000000000000000000000005222222222222222222222260000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000322222222222222222222222222223000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000062222222222222222222222222222222222222223555555555555555555555555555552222222222222222222222222222222300000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000422222222222222222222222222223000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000006220000222222222222230000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000032222222222222222222250000000000000000000000000000000000052222
+22222222222222222222222222222222222222222226000000000000000000000000000000000003222222222222222222222000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000062222222222222222222222222222230000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000322222222222222222222222222222222222222235555555555555555555555555555522222222222222222222222222222226000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000002222222222222222222222222222240000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042202062222222222222250000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000622222222222222222222000000000000000000000000000000000
+00042222222222222222222222222222222222222222222222250000000000000000000000000000000000042222222222222222222230000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000522222222222222222222222222222300000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000042222222222222222222222222222222222222222255555555555555555555555555553222222222222222222222222222222400
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000522222222222222222222222222222500
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000222000022222222222222260000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000322222222222222222240000000000000000000000000
+00000000000322222222222222222222222222222222222222222222222300000000000000000000000000000000000622222222222222222222400000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000003222222222222222222222222222223000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000005222222222222222222222222222222222222222222555555555555555555555555555532222222222222222222222222
+22222400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002222222222222222222222222
+22222500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000052220000222222222222
+22230000000000000000000000000000000000000000000000000000000000000000000000000000000000000005222222222222222222500000000000000000
+00000000000000000062222222222222222222222222222222222222222222222222000000000000000000000000000000000000322222222222222222225000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000050000000000000000000000000000000000
+00000000000000000000000000000000000622222222222222222222222222222230000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000622222222222222222222222222222222222222222223555555555555555555555555555222222222222222222
+22222222222222360000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000422222222222222222
+22222222222226000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000322200002222
+22222222222240000000000000000000000000000000000000000000000000000000000000000000000000000000000000003222222222222222220000000000
+00000000000000000000000000522222222222222222222222222222222222222222222222225000000000000000000000000000000000005222222222222222
+22226000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006230000000000000000000000000
+00000000000000000000000000000000000000000003222222222222222222222222222222300000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000003222222222222222222222222222222222222222222235555555555555555555555555552222222222
+22222222222222222222222246000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000062222222222
+22222222222222222222300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000062222
+00002222222222222222250000000000000000000000000000000000000000000000000000000000000000000000000000000000000052222222222222222400
+00000000000000000000000000000000003222222222222222222222222222222222222222222222222240000000000000000000000000000000000062222222
+22222222222200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032230000000000000000
+00000000000000000000000000000000000000000000000000622222222222222222222222222222223000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000322222222222222222222222222222222222222222222255555555555555555555555555322
+22222222222222222222222222222222225000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000322
+22222222222222222222222222224000000000000000000000000000000000560000000000000000000000000000000000000000000000000000000000000000
+00032222000022222222222222222250000000000000000000000000000000000000000000000000000000000000000000000000000000000000032222222222
+22222500000000000000000000000000000000000022222222222222222222222222222222222222222222222222200000000000000000000000000000000000
+03222222222222222224000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003222230000000
+00000000000000000000000000000000000000000000000000000000003222222222222222222222222222222230000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000042222222222222222222222222222222222222222222222355555555555555555555
+55555222222222222222222222222222222222222222500000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00004222222222222222222222222222222250000000000000000000000000000000005250000000000000000000000000000000000000000000000000000000
+00000000005222220000222222222222222222250000000000000000000000000000000000000000000000000000000000000000000000000000000000000522
+22222222222220000000000000000000000000000000000005222222222222222222222222222222222222222222222222222500000000000000000000000000
+00000000052222222222222222250000000000000000000000000000000005000000000000000000000000000000000000000000000000000000000000422222
+23600000000000000000000000000000000000000000000000000000000000000522222222222222222222222222222222300000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000004222222222222222222222222222222222222222222222223555555555555
+55555555555552222222222222222222222222222222222222222350000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000522222222222222222222222222222222600000000000000000000000000000000032236000000000000000000000000000000000000000000000
+00000000000000000622222200002222222222222222222250000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000032222222222222400000000000000000000000000000000000042222222222222222222222222222222222222222222222222224000000000000000000
+00000000000000000022222222222222223000000000000000000000000000000000033000000000000000000000000000000000000000000000000000000000
+05222222222600000000000000000000000000000000000000000000000000000000000052222222222222222222222222222222223000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000422222222222222222222222222222222222222222222222225555
+55555555555555555555322222222222222222222222222222222222222222235000000000000000000000000000000000000000000000000000000000000000
+00000000000000000052222222222222222222222222222222230000000000000000000000000000000000322225000000000000000000000000000000000000
+00000000000000000000000002222222000022222222222222222222240000000000000000000000000000000000000000000000000000000000000000000000
+00000000000006322222222222225000000000000000000000000000000000000222222222222222222222222222222222222222222222222222220000000000
+00000000000000000000000000422222222222222250000000000000000000000000000000000223600000000000000000000000000000000000000000000000
+00000000522222222222500000000000000000000000000000000000000000000000000000000006222222222222222222222222222222222230000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000042222222222222222222222222222222222222222222222
+22223555555555555555555555552222222222222222222222222222222222222222222223500000000000000000000000000000000000000000000000000000
+00000000000000000000000005222222222222222222222222222222222400000000000000000000000000000000002222223600000000000000000000000000
+00000000000000000000000000000000322222220000222222222222222222222240000000000000000000000000000000000000000000000000000000000000
+00000000000000000006322222222222222200000000000000000000000000000000000052222222222222222222222222222222222222222222222222222250
+00000000000000000000000000000000005222222222222222000000000000000000000000000000000062222500000000000000000000000000000000000000
+00000000000000052222222222222400000000000000000000000000000000000000000000000000000000622222222222222222222222222222222222300000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000003222222222222222222222222222222222222222
+22222222222225555555555555555555555322222222222222222222222222222222222222222222222250000000000000000000000000000000000000000000
+00000000000000000000000000000000522222222222222222222222222222222225000000000000000000000000000000000622222222500000000000000000
+00000000000000000000000000000000000000032222222200002222222222222222222222236000000000000000000000000000000000000000000000000000
+00000000000000000000000005322222222222222224000000000000000000000000000000000000422222222222222222222222222222222222222222222222
+22222240000000000000000000000000000000000002222222222222240000000000000000000000000000000000522222500000000000000000000000000000
+00000000000000000000005222222222222222360000000000000000000000000000000000000000000000000000062222222222222222222222222222222222
+22300000000000000000000000000000000066000000000000000000000000000000000000000000000000000000006222222222222222222222222222222222
+22222222222222222222255555555555555555555552222222222222222222222222222222222222222222222222224600000000000000000000000000000000
+00000000000000000000000000000000000000042222222222222222222222222222222222200000000000000000000000000000000005222222222360000000
+00000000000000000000000000000000000000000000003222222222000622222222222222222222222225000000000000000000000000000000000000000000
+00000000000000000000000000000005322222222222222222250000000000000000000000000000000000003222222222222222222222222222222222222222
+22222222222222300000000000000000000000000000000000042222222222222234600000000000000000000000000000003222222360000000000000000000
+00000000000000000000000000000422222222222222222250000000000000000000000000000000000000000000000000005222222222222222222222222222
+22222222223000000000000000000000000000000000026000000000000000000000000000000000000000000000000000000522222222222222222222222222
+22222222222222222222222222222355555555555555555555522222222222222222222222222222222222222222222222222222350000000000000000000000
+00000000000000000000000000000000000000000000063222222222222222222222222222222222223000000000000000000000000000000000042222222222
+25000000000000000000000000000000000000000000000000006322222222220000222222222222222222222222223600000000000000000000000000000000
+00000000000000000000000000000000000065222222222222222222222000000000000000000000000000000000000622222222222222222222222222222222
+22222222222222222222222600000000000000000000000000000000000522222222222222222245600000000000000000000000000022222222250000000000
+00000000000000000000000000000000000632222222222222222222236000000000000000000000000000000000000000000000000522222222222222222222
+22222222222222222230000000000000000000000000000000000225000000000000000000000000000000000000000000000000000632222222222222222222
+22222222222222222222222222222222222222555555555555555555553222222222222222222222222222222222222222222222222222222235600000000000
+00000000000000000000000000000000000000000000000000005222222222222222222222222222222222222222356000000000000000000000000000000222
+22222222223500000000000000000000000000000000000000000000000522222222222202022222222222222222222222222222400000000000000000000000
+00000000000000000000000000000000000000000064222222222222222222222240000000000000000000000000000000000005222222222222222222222222
+22222222222222222222222222222224000000000000000000000000000000000000322222222222222222222345000000000000000000000005222222222236
+00000000000000000000000000000000000000000052222222222222222222222224000000000000000000000000000000000000000000000632222222222222
+22222222222222222222222222300000000000000000000000000000000003225000000000000000000000000000000000000000000000000052222222222222
+22222222222222222222222222222222222222222222223555555555555555555522222222222222222222222222222222222222222222222222222222222450
+00000000000000000000000000000000000000000000000000000000006322222222222222222222222222222222222222222222450000000000000000000000
+00005222222222222222360000000000000000000000000000000000000000000042222222222222000022222222222222222222222222222250000000000000
+00000000000000000000000000000000000000000000000653222222222222222222222222500000000000000000000000000000000000032222222222222222
+22222222222222222222222222222222222222230000000000000000000000000000000000004222222222222222222222222346000000000000000000042222
+22222222360000000000000000000000000000000000000063222222222222222222222222222500000000000000000000000000000000000000000642222222
+22222222222222222222222222222222223000000000000000000000000000000000032223600000000000000000000000000000000000000000000053222222
+22222222222222222222222222222222222222222222222222222225555555555555555553222222222222222222222222222222222222222222222222222222
+22222222460000000000000000000000000000000000000000000000000000006322222222222222222222222222222222222222222222222223560000000000
+00000000000042222222222222222236000000000000000000000000000000000000000052222222222222220202222222222222222222222222222222224600
+00000000000000000000000000000000000000000000000000000542222222222222222222222222222334556600000000000000000000000000000222222222
+22222222222222222222222222222222222222222222222260000000000000000000000000000000000062222222222222222222222222222456000000000000
+00622222222222222235000000000000000000000000000000000064222222222222222222222222222222250000000000000000000000000000000000000642
+22222222222222222222222222222222222222222230000000000000000000000000000000000322222500000000000000000000000000000000000000000053
+22222222222222222222222222222222222222222222222222222222222222235555555555555555522222222222222222222222222222222222222222222222
+22222222222222222234600000000000000000000000000000000000000000000000005322222222222222222222222222222222222222222222222222222224
+50000000000000000000222222222222222222223500000000000000000000000000000000000053222222222222222200002222222222222222222222222222
+22222245000000000000000000000000000000000000000000000000005422222222222222222222222222222222222222223355660000000000000000000052
+22222222222222222222222222222222222222222222222222222222500000000000000000000000000000000000032222222222222222222222222222223450
+00000000005222222222222222223560000000000000000000000000000054222222222222222222222222222222222224500000000000000000000000000000
+00053222222222222222222222222222222222222222222222300000000000000000000000000000000003222222250000000000000000000000000000000000
+00005322222222222222222222222222222222222222222222222222222222222222222255555555555555552222222222222222222222222222222222222222
+22222222222222222222222222222245000000000000000000000000000000000000000000054222222222222222222222222222222222222222222222222222
+22222222223560000000000000052222222222222222222222245000000000000000000000000000000652222222222222222222020222222222222222222222
+22222222222222222450000000000000000000000000000000000000000000653222222222222222222222222222222222222222222222222222334556600000
+00000042222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222346000000022222222222222222222235600000000000000000000000643222222222222222222222222222222222222222245000000000000000000
+00000006542222222222222222222222222222222222222222222222223000000000000000000000000000000000032222222224600000000000000000000000
+00000000054222222222222222222222222222222222222222222222222222222222222222222222255555555555555322222222222222222222222222222222
+22222222222222222222222222222222222222222345600000000000000000000000000000000006542222222222222222222222222222222222222222222222
+22222222222222222222224560000000000322222222222222222222222222356000000000000000000000006532222222222222222222220202222222222222
+22222222222222222222222222224560000000000000000000000000000000000065322222222222222222222222222222222222222222222222222222222222
+22222335556600222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222456004222222222222222222222222245660000000000000665422222222222222222222222222222222222222222222222345600000
+00000000006654322222222222222222222222222222222222222222222222222230000000000000000000000000000000000322222222222346000000000000
+00000000000006542222222222222222222222222222222222222222222222222222222222222222222222222255555555555532222222222222222222222222
+22222222222222222222222222222222222222222222222222222335560000000000000000000000000654322222222222222222222222222222222222222222
+22222222222222222222222222222222234600000052222222222222222222222222222222345600000000000000654322222222222222222222222202022222
+22222222222222222222222222222222222222223556000000000000000000000000655332222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222223422222222222222222222222222222223333455333322222222222222222222222222222222222222222222222222222
+22222333345543332222222222222222222222222222222222222222222222222222222222300000000000000000000000000000000004222222222222222345
+60000000000000006553222222222222222222222222222222222222222222222222222222222222222222222222222222355555555553222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222335555666666666555433222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222245600322222222222222222222222222222222222223333554333222222222222222222222222222222
+02022222222222222222222222222222222222222222222222222233555566666655555333222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222223000000000000000000000000000000000052222222222
+22222222222333333333332222222222222222222222222222222222222222222222222222222222222222222222222222222222222355555555322222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222332222222222222222222222222222222222222222222222222222222222222222222222
+22222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222230000000000000000000000000000000000522
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222235555532222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222300000000000000000000000000000
+00000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+32222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222223000000000000000000000
+00000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222230000000000000
+00000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222300000
+00000000000000000000000000000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22300000000000000000000000000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222223000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222230000000000000000000000000000000000522222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222200002222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222300000000000000000000000000000000005222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222223000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222220000222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222230000000000000000000000000000000000522222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222300000000000000000000000000000000005222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222000022222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222223000000000000000000000000000000000052222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222230000000000000000000000000000000000522222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222200002222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222300000000000000000000000000000000005222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+00002222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222223000000000000000000000000000000000052222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222000022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222230000000000000000000000000000000000522
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222220000222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222300000000000000000000000000000
+00000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444
+44444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222200002222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222223000000000000000000000
+00000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+44444444444444442222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222000022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222230000000000000
+00000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222224444444444444444444222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222220000222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222300000
+00000000000000000000000000000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222224444444444444444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222200002222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22300000000000000000000000000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222444444444444444444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222000022222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222223000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222244444444444444444444444444422222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222220000222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222230000000000000000000000000000000000522222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222224444444444444444444444444444422222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222200022222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222300000000000000000000000000000000005222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222444444444444444444444444444444222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222000022222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222223000000000000000000000000000000000052222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222224444444444444444444444444444444222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222230000000000000000000000000000000000522222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222444444444444444444444444444444444222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222200002222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222300000000000000000000000000000000005222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222224444444444444444444444444444444442222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222224000000000000000000000000000000000052222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222444444444444444444444444444444444422222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220000222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222250000000000000000000000000000000000522222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222224444444444444444444444444444444444422222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000000000005222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444444444444444444444444444222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+00062222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222225000000000000000000000000000000000052222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222224444444444444444444444444444444444
+44222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222250000000000000000000000000000000000522
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444444444444444444
+44444444442222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222500000000000000000000000000000
+00000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222444444444444444444
+44444444444444444442222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222226000000000000000000000
+00000000000005222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222224444444444
+44444444444444444444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222020222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222260000000000000
+00000000000000000000032222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244
+44444444444444444444444444444444444222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222000000
+00000000000000000000000000000322222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222244444444444444444444444444444444444442222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222202022222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22000000000000000000000000000000000003222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222444444444444444444444444444444444444222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222030022222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222220000000000000000000000000000000000032222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222224444444444444444444444444444444444442222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222220202222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222300000000000000000000000000000000000322222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222224444444444444444444444444444444444422222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222200002222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222224000000000000000000000000000000000003222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222244444444444444444444444444444444444222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222020222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222250000000000000000000000000000000000032222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222444444444444444444444444444444444422222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222220000222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222500000000000000000000000000000000000322222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222444444444444444444444444444444444222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222202022222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222226000000000000000000000000000000000002222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222224444444444444444444444444444444442222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222000022222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222200000000000000000000000000000000000022222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222224444444444444444444444444444444222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220000222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222223000000000000000000000000000000000000222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444444444444444444444422222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222200002222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222240000000000000000000000000000000000002222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444444444444444444444222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+00002222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222223456000000000000000000000000000000622222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444444444444444444422
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222000022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222456000000000000000000000000006222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444444444444
+44444222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222220000222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222356000000000000000000
+00006222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222244444444444
+44444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222200002222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222345600000
+00000000000052222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222224
+44444444444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222000022222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22234560000000000000522222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222244444444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222220000222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222224560000000004222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222224444444444422222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222200002222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222223450000032222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222000022222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222223456322222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222220000222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222
+222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222220202040000002701ffff030000000000}}}{\insrsid2495527 
+
+\par }\pard\plain \s15\ql \li0\ri0\sb60\sa60\widctlpar\brdrb\brdrs\brdrw15\brsp20 \tqc\tx4153\tqr\tx9639\wrapdefault\faauto\rin0\lin0\itap0 \f1\fs16\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid2495527 \line \line \line \line }{\field{\*\fldinst 
+{\b\insrsid2495527  REF Doc_Issuing_Office \\* MERGEFORMAT}}{\fldrslt {\b\insrsid10304687\charrsid10304687 SLN}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 .}{\field{\*\fldinst {\b\insrsid2495527  REF Doc_Context_Project  \\
+* MERGEFORMAT }}{\fldrslt {\b\lang1024\langfe1024\noproof\insrsid10304687\charrsid10304687 AAA}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\field{\*\fldinst {\b\insrsid2495527  REF Doc_Context_Number  \\* MERGEFORMAT }}{\fldrslt {
+\b\lang1024\langfe1024\noproof\insrsid10304687\charrsid10304687 NNN}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 .}{\field{\*\fldinst {\b\insrsid2495527  REF Doc_Object_Number  \\* MERGEFORMAT }}{\fldrslt {
+\b\lang1024\langfe1024\noproof\insrsid10304687\charrsid10304687 NNNN}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 , Rev }{\field{\*\fldinst {\b\insrsid2495527  REF Doc_Version_Number  \\* MERGEFORMAT }}{\fldrslt {
+\b\lang1024\langfe1024\noproof\insrsid10304687\charrsid10304687 NNNN.NN}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 \tab \tab }{\field{\*\fldinst {\b\insrsid2495527  REF Doc_Title  \\* MERGEFORMAT }}{\fldrslt {
+\b\insrsid10304687\charrsid10304687 Sampling Profiler For}{\b\fs28\insrsid10304687  EPOC Devices}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 \line }{\field{\*\fldinst {\b\insrsid2495527  REF Doc_Status  \\* MERGEFORMAT }}{\fldrslt {
+\b\insrsid10304687\charrsid10304687 REVIEW}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 , }{\b\insrsid481371 {\*\xmlopen\xmlns1{\factoidname date}{\xmlattr\xmlattrns0{\xmlattrname Month}{\xmlattrvalue 7}}{\xmlattr\xmlattrns0
+{\xmlattrname Day}{\xmlattrvalue 9}}{\xmlattr\xmlattrns0{\xmlattrname Year}{\xmlattrvalue 2007}}}0}{\b\insrsid11890070 9}{\b\insrsid481371 /0}{\b\insrsid11890070 7}{\b\insrsid481371 /200}{\b\insrsid11890070 7}{\b\insrsid2495527 {\*\xmlclose}\tab \tab }
+{\field\fldedit{\*\fldinst {\b\insrsid2495527  REF Doc_Owner  \\* MERGEFORMAT }}{\fldrslt }}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527  - }{\field{\*\fldinst {\b\insrsid2495527  REF Doc_Function  \\* MERGEFORMAT }}{\fldrslt {
+\b\insrsid10304687\charrsid10304687 Development}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\b\insrsid2495527 
+\par }}{\footerr \pard\plain \s16\ql \li0\ri0\sb60\sa60\widctlpar\brdrt\brdrs\brdrw15\brsp20 \tqc\tx4153\tqr\tx9639\wrapdefault\faauto\rin0\lin0\rtlgutter\itap0 \f1\fs16\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid2495527 \'a9 Symbian Ltd. }
+{\field{\*\fldinst {\insrsid2495527  SAVEDATE \\@ "yyyy" \\* MERGEFORMAT }}{\fldrslt {\lang1024\langfe1024\noproof\insrsid11890070 2007}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\insrsid2495527 \tab \tab Pg. }{\field{\*\fldinst {\insrsid2495527 
+ PAGE  \\* MERGEFORMAT }}{\fldrslt {\lang1024\langfe1024\noproof\insrsid11890070 14}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\insrsid2495527  of }{\field{\*\fldinst {\insrsid2495527  NUMPAGES  \\* MERGEFORMAT }}{\fldrslt {
+\lang1024\langfe1024\noproof\insrsid11890070 14}}}\sectd \linex0\endnhere\sectdefaultcl\sftnbj {\insrsid2495527 
+\par }}{\*\pnseclvl1\pnucrm\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl2\pnucltr\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl3\pndec\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl4\pnlcltr\pnstart1\pnindent720\pnhang {\pntxta )}}
+{\*\pnseclvl5\pndec\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl6\pnlcltr\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl7\pnlcrm\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl8
+\pnlcltr\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl9\pnlcrm\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}\trowd \irow0\irowband0
+\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA37\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
+\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8043\clshdrawnil \cellx9744\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 
+\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\f1\fs28\insrsid6226036 Document:\cell {\*\bkmkstart Doc_Title}}{\field\fldedit{\*\fldinst {\b\f1\fs28\insrsid6226036  FORMTEXT }{\b\f1\fs28\insrsid11890070 {\*\datafield 
+800100000000000009446f635f5469746c6500104e616d65204f6620446f63756d656e74000a5469746c652063617365001f456e74657220746865206e616d65206f66207468697320646f63756d656e740021456e74657220746865207469746c65206f66207468697320646f63756d656e742e0000000000}
+{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Title}{\*\ffdeftext Name Of Document}{\*\ffformat Title case}{\*\ffhelptext Enter the name of this document}{\*\ffstattext Enter the title of this document.}}}}}{\fldrslt {
+\b\f1\fs28\insrsid6226036 Sampling Profiler For EPOC Devices}}}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\b\f1\fs28\insrsid6226036 {\*\bkmkend Doc_Title}\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\f1\fs28\insrsid6226036 \trowd \irow0\irowband0
+\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA37\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
+\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8043\clshdrawnil \cellx9744\row }\trowd \irow1\irowband1
+\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA38\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
+\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4820\clshdrawnil \cellx6521\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1701\clshdrawnil \cellx8222\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1521\clshdrawnil \cellx9744\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\f1\insrsid6226036 Number:\cell {\*\bkmkstart Doc_Issuing_Office}}{\field\flddirty\fldpriv{\*\fldinst {\f1\insrsid6226036  FORMDROPDOWN }{\f1\insrsid11890070 {\*\datafield 
+8a8100000000000012446f635f49737375696e675f4f666669636500000000007f43686f6f7365207468652053796d6269616e2049737375696e67206f66666963653a20534342202d2043616d6272696467652c2053474c202d20476c6f62616c2c20534c4e202d204c6f6e646f6e2c20535259202d20526f6e6e6562792c
+20535346202d2053616e204672616e636973636f2c2053544f202d20546f6b796f003b456e746572207468652049737375696e67204f666669636520636f6465202d20463120666f72206578706c616e6174696f6e206f6620636f646573000000000024000600060000000a000c001000140018001c002000035343420353
+474c03534c4e03535259035353460353544f}{\*\formfield{\fftype2\ffres2\ffownhelp\ffownstat\fftypetxt0\ffhaslistbox{\*\ffname Doc_Issuing_Office}\ffdefres0{\*\ffhelptext 
+Choose the Symbian Issuing office: SCB - Cambridge, SGL - Global, SLN - London, SRY - Ronneby, SSF - San Francisco, STO - Tokyo}{\*\ffstattext Enter the Issuing Office code - F1 for explanation of codes}{\*\ffl SCB}{\*\ffl SGL}{\*\ffl SLN}{\*\ffl SRY}
+{\*\ffl SSF}{\*\ffl STO}}}}}{\fldrslt }}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\f1\insrsid6226036 {\*\bkmkend Doc_Issuing_Office}.{\*\bkmkstart Doc_Context_Project}}{\field{\*\fldinst {\f1\insrsid6226036 
+ FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
+800103000000000013446f635f436f6e746578745f50726f6a656374000341414100095570706572636173650040456e7465722074686520646f63756d656e7420636f6e746578742070726f6a6563742067726f75702028746872656520746578742063686172616374657273290038456e7465722074686520646f63756d
+656e7420636f6e746578742070726f6a6563742067726f757072202d20463120666f722068656c702e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0\ffmaxlen3{\*\ffname Doc_Context_Project}{\*\ffdeftext AAA}{\*\ffformat Uppercase}{\*\ffhelptext 
+Enter the document context project group (three text characters)}{\*\ffstattext Enter the document context project groupr - F1 for help.}}}}}{\fldrslt {\f1\lang1024\langfe1024\noproof\insrsid6226036 AAA}}}\sectd 
+\psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\*\bkmkstart Doc_Context_Number}{\*\bkmkend Doc_Context_Project}{\field{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
+800103000000000012446f635f436f6e746578745f4e756d62657200034e4e4e00095570706572636173650041456e7465722074686520646f63756d656e7420636f6e746578742070726f6a6563742073657175656e6365206e756d6265722028746872656520646967697473290041456e7465722074686520646f63756d
+656e7420636f6e746578742070726f6a6563742073657175656e6365206e756d626572202d20463120666f722068656c702e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0\ffmaxlen3{\*\ffname Doc_Context_Number}{\*\ffdeftext NNN}{\*\ffformat Uppercase}
+{\*\ffhelptext Enter the document context project sequence number (three digits)}{\*\ffstattext Enter the document context project sequence number - F1 for help.}}}}}{\fldrslt {\f1\lang1024\langfe1024\noproof\insrsid6226036 NNN}}}\sectd 
+\psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\f1\insrsid6226036 {\*\bkmkend Doc_Context_Number}.{\*\bkmkstart Doc_Object_Number}}{\field{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
+800100000000000011446f635f4f626a6563745f4e756d62657200044e4e4e4e00095570706572636173650046456e7465722074686520646f63756d656e74206f626a6563742073657175656e6365206e756d6265722028756e6c696d69746564206e756d626572206f6620646967697473290038456e7465722074686520
+646f63756d656e74206f626a6563742073657175656e6365206e756d626572202d20463120666f722068656c702e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Object_Number}{\*\ffdeftext NNNN}{\*\ffformat Uppercase}{\*\ffhelptext 
+Enter the document object sequence number (unlimited number of digits)}{\*\ffstattext Enter the document object sequence number - F1 for help.}}}}}{\fldrslt {\f1\lang1024\langfe1024\noproof\insrsid6226036 NNNN}}}\sectd 
+\psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\f1\insrsid6226036 {\*\bkmkend Doc_Object_Number}/{\*\bkmkstart Doc_Version_Number}}{\field{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
+800100000000000012446f635f56657273696f6e5f4e756d62657200074e4e4e4e2e4e4e0009557070657263617365006c456e7465722074686520646f63756d656e742076657273696f6e206e756d62657220696e2074686520666f6c6c6f77696e6720666f726d3a206e6e6e6e2e6e6e2e20557064617465207468652044
+6f63756d656e7420486973746f7279207461626c652061732077656c6c2e0030456e7465722074686520646f63756d656e742076657273696f6e206e756d626572202d20463120666f722068656c702e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Version_Number}
+{\*\ffdeftext NNNN.NN}{\*\ffformat Uppercase}{\*\ffhelptext Enter the document version number in the following form: nnnn.nn. Update the Document History table as well.}{\*\ffstattext Enter the document version number - F1 for help.}}}}}{\fldrslt {
+\f1\lang1024\langfe1024\noproof\insrsid6226036 NNNN.NN}}}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\b\f1\insrsid6226036 {\*\bkmkend Doc_Version_Number}\cell Status:\cell {\*\bkmkstart Doc_Status}}
+{\field\flddirty\fldpriv{\*\fldinst {\f1\insrsid6226036  FORMDROPDOWN }{\f1\insrsid11890070 {\*\datafield 
+86810000000000000a446f635f53746174757300000000002143686f6f73652074686520737461747573206f662074686520646f63756d656e74003443686f6f7365207374617475732066726f6d207468652064726f7020646f776e206c697374202d20463120666f722068656c702e00000000001a000300030000000a00
+06000c0013000544524146540652455649455706495353554544}{\*\formfield{\fftype2\ffres1\ffownhelp\ffownstat\fftypetxt0\ffhaslistbox{\*\ffname Doc_Status}\ffdefres0{\*\ffhelptext Choose the status of the document}{\*\ffstattext 
+Choose status from the drop down list - F1 for help.}{\*\ffl DRAFT}{\*\ffl REVIEW}{\*\ffl ISSUED}}}}}{\fldrslt }}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\b\f1\insrsid6226036 {\*\bkmkend Doc_Status}\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f1\insrsid6226036 \trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA38\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 
+\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth4820\clshdrawnil \cellx6521\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1701\clshdrawnil \cellx8222\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1521\clshdrawnil \cellx9744\row }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\f1\insrsid6226036 Owner:\cell }{\f1\insrsid6372845 Dennis May}{\b\f1\insrsid6226036 \cell 
+Last Revised:\cell }{\f1\insrsid9120167 {\*\xmlopen\xmlns1{\factoidname date}{\xmlattr\xmlattrns0{\xmlattrname Month}{\xmlattrvalue 7}}{\xmlattr\xmlattrns0{\xmlattrname Day}{\xmlattrvalue 9}}{\xmlattr\xmlattrns0{\xmlattrname Year}{\xmlattrvalue 2007}}}0}{
+\f1\insrsid11890070 9}{\f1\insrsid9120167 /0}{\f1\insrsid11890070 7}{\f1\insrsid8289572 /200}{\f1\insrsid11890070 7}{\b\f1\insrsid6226036 {\*\xmlclose}\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
+\f1\insrsid6226036 \trowd \irow2\irowband2\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA38\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4820\clshdrawnil \cellx6521\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1701\clshdrawnil \cellx8222\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1521\clshdrawnil \cellx9744\row }\trowd \irow3\irowband3
+\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA38\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
+\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8042\clshdrawnil \cellx9744\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\f1\insrsid6226036 Function:\cell 
+{\*\bkmkstart Doc_Function}}{\field\flddirty\fldpriv{\*\fldinst {\f1\insrsid6226036  FORMDROPDOWN }{\f1\insrsid11890070 {\*\datafield 
+8a810000000000000c446f635f46756e6374696f6e00000000004743686f6f736520746865206e616d65206f6620746865206f7267616e69736174696f6e616c2066756e6374696f6e2074686174206f776e73207468697320646f63756d656e742e004743686f6f736520746865206e616d65206f6620746865206f726761
+6e69736174696f6e616c2066756e6374696f6e2074686174206f776e73207468697320646f63756d656e742e0000000000d9000c000c0000000a00180027003b00470052005a006e0080009700a900b400c4000e41646d696e697374726174696f6e1344657369676e202620546563686e6f6c6f67790b446576656c6f706d
+656e740a466163696c69746965730746696e616e636513496e666f726d6174696f6e20537570706f7274114d61726b6574696e6720262053616c6573164f7267616e69736174696f6e616c20537570706f7274114f7065726174696f6e616c20426f6172640a50726f6772616d6d65730f48756d616e205265736f75726365
+7314546563686e6963616c20436f6e73756c74696e67}{\*\formfield{\fftype2\ffres2\ffownhelp\ffownstat\fftypetxt0\ffhaslistbox{\*\ffname Doc_Function}\ffdefres0{\*\ffhelptext Choose the name of the organisational function that owns this document.}{\*\ffstattext 
+Choose the name of the organisational function that owns this document.}{\*\ffl Administration}{\*\ffl Design & Technology}{\*\ffl Development}{\*\ffl Facilities}{\*\ffl Finance}{\*\ffl Information Support}{\*\ffl Marketing & Sales}{\*\ffl 
+Organisational Support}{\*\ffl Operational Board}{\*\ffl Programmes}{\*\ffl Human Resources}{\*\ffl Technical Consulting}}}}}{\fldrslt }}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\b\f1\insrsid6226036 
+{\*\bkmkend Doc_Function}\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f1\insrsid6226036 \trowd \irow3\irowband3
+\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthA3\trwWidthA38\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
+\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8042\clshdrawnil \cellx9744\row }\trowd \irow4\irowband4\ts11\trgaph108\trleft-108\trbrdrb\brdrs\brdrw15 
+\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl
+\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8080\clshdrawnil \cellx9782\pard\plain \s17\ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \fs22\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {
+\b\f1\fs20\kerning0\insrsid6226036 Contributors:\cell {\*\bkmkstart Doc_Contributors}}{\field\fldedit{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
+800100000000000010446f635f436f6e7472696275746f727300144c697374204f6620436f6e7472696275746f7273000a5469746c6520636173650033456e7465722074686520746865206c697374206f6620636f6e7472696275746f727320746f2074686520646f63756d656e742e0033456e7465722074686520746865
+206c697374206f6620636f6e7472696275746f727320746f2074686520646f63756d656e742e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Contributors}{\*\ffdeftext List Of Contributors}{\*\ffformat Title case}{\*\ffhelptext 
+Enter the the list of contributors to the document.}{\*\ffstattext Enter the the list of contributors to the document.}}}}}{\fldrslt {\f1\lang1024\langfe1024\noproof\insrsid6226036 Adam Stevenson}}}\sectd 
+\psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\f1\insrsid6372845 {\*\bkmkend Doc_Contributors}, Djordje Kovacevic}{\f1\insrsid9120167 , Mark Tai}{\insrsid6226036 \cell }\pard\plain 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 \trowd \irow4\irowband4\ts11\trgaph108\trleft-108\trbrdrb\brdrs\brdrw15 
+\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl
+\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8080\clshdrawnil \cellx9782\row }\pard\plain \s17\ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \fs22\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {
+\b\f1\fs20\kerning0\insrsid6226036 Key Reviewers:\cell {\*\bkmkstart Doc_Reviewers}}{\field\fldedit{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
+80010000000000000d446f635f52657669657765727300154c697374204f66204b657920526576696577657273000a5469746c6520636173650049456e74657220746865206c697374206f6620746865206b657920726576696577657273206f662074686520646f63756d656e742c2073657061726174656420627920636f
+6d6d61732e0030456e74657220746865206c697374206f66206b657920726576696577657273206f662074686520646f63756d656e742e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Reviewers}{\*\ffdeftext List Of Key Reviewers}{\*\ffformat 
+Title case}{\*\ffhelptext Enter the list of the key reviewers of the document, separated by commas.}{\*\ffstattext Enter the list of key reviewers of the document.}}}}}{\fldrslt {\f1\insrsid6226036 \u8194\'20\u8194\'20\u8194\'20\u8194\'20\u8194\'20}}}
+\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\f1\insrsid6372845 {\*\bkmkend Doc_Reviewers}Oleg Isakov}{\insrsid6226036 \cell }\pard\plain 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 \trowd \irow5\irowband5\ts11\trgaph108\trleft-108\trbrdrb\brdrs\brdrw15 
+\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl
+\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8080\clshdrawnil \cellx9782\row }\pard\plain \s17\ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \fs22\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {
+\b\f1\fs20\kerning0\insrsid6226036 Distribution\cell {\*\bkmkstart Doc_Distribution}}{\field\fldedit{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
+800100000000000010446f635f446973747269627574696f6e0011446973747269627574696f6e204c697374000a5469746c6520636173650069456e74657220746865206c697374206f66207468652070656f706c65206f72206a6f622066756e6374696f6e732074686520646f63756d656e742073686f756c6420626520
+646973747269627574656420746f2c2073657061726174656420627920636f6d6d61732e0069456e74657220746865206c697374206f66207468652070656f706c65206f72206a6f622066756e6374696f6e732074686520646f63756d656e742073686f756c6420626520646973747269627574656420746f2c2073657061
+726174656420627920636f6d6d61732e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Distribution}{\*\ffdeftext Distribution List}{\*\ffformat Title case}{\*\ffhelptext 
+Enter the list of the people or job functions the document should be distributed to, separated by commas.}{\*\ffstattext Enter the list of the people or job functions the document should be distributed to, separated by commas.}}}}}{\fldrslt {
+\insrsid5055728 \u8194\'20\u8194\'20\u8194\'20\u8194\'20\u8194\'20}}}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\insrsid6226036 {\*\bkmkend Doc_Distribution}\cell }\pard\plain 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 \trowd \irow6\irowband6\ts11\trgaph108\trleft-108\trbrdrb\brdrs\brdrw15 
+\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl
+\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8080\clshdrawnil \cellx9782\row }\trowd \irow7\irowband7\lastrow \ts11\trgaph108\trleft-108\trbrdrb\brdrs\brdrw15 
+\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl
+\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4820\clshdrawnil \cellx6521\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1701\clshdrawnil \cellx8222
+\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1559\clshdrawnil \cellx9782\pard\plain \s17\ql \li0\ri0\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 
+\fs22\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\b\f1\fs20\kerning0\insrsid6226036 Approved By:\cell {\*\bkmkstart Doc_Approval_Name}}{\field{\*\fldinst {\f1\insrsid6226036  FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
+800100000000000011446f635f417070726f76616c5f4e616d65001a4e616d65204f6620417070726f76616c20417574686f72697479000a5469746c6520636173650029456e74657220746865206e616d65206f662074686520617070726f76616c20617574686f726974792e0029456e74657220746865206e616d65206f
+662074686520617070726f76616c20617574686f726974792e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Approval_Name}{\*\ffdeftext Name Of Approval Authority}{\*\ffformat Title case}{\*\ffhelptext 
+Enter the name of the approval authority.}{\*\ffstattext Enter the name of the approval authority.}}}}}{\fldrslt {\f1\lang1024\langfe1024\noproof\insrsid6226036 Name Of Approval Authority}}}\sectd 
+\psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\insrsid6226036 {\*\bkmkend Doc_Approval_Name}\cell }{\b\f1\fs20\kerning0\insrsid6226036 Approval Ref.:\cell {\*\bkmkstart Doc_Approval_Ref}}{\field{\*\fldinst {\f1\insrsid6226036 
+ FORMTEXT }{\f1\insrsid11890070 {\*\datafield 
+800100000000000010446f635f417070726f76616c5f526566000c417070726f76616c20526566000a5469746c6520636173650026456e7465722074686520646f63756d656e7420617070726f76616c207265666572656e63652e0026456e7465722074686520646f63756d656e7420617070726f76616c20726566657265
+6e63652e0000000000}{\*\formfield{\fftype0\ffownhelp\ffownstat\fftypetxt0{\*\ffname Doc_Approval_Ref}{\*\ffdeftext Approval Ref}{\*\ffformat Title case}{\*\ffhelptext Enter the document approval reference.}{\*\ffstattext 
+Enter the document approval reference.}}}}}{\fldrslt {\f1\lang1024\langfe1024\noproof\insrsid6226036 Approval Ref}}}\sectd \psz9\linex0\headery709\footery709\colsx709\endnhere\sectdefaultcl\sftnbj {\insrsid6226036 {\*\bkmkend Doc_Approval_Ref}\cell 
+}\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 \trowd \irow7\irowband7\lastrow \ts11\trgaph108\trleft-108\trbrdrb\brdrs\brdrw15 
+\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl
+\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4820\clshdrawnil \cellx6521\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1701\clshdrawnil \cellx8222
+\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1559\clshdrawnil \cellx9782\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\insrsid6226036 
+\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\ul\cf6\insrsid6226036 \sect }\sectd 
+\psz9\sbknone\linex0\headery709\footery709\colsx709\endnhere\sectunlocked1\sectdefaultcl\sftnbj {\*\pnseclvl1\pnucrm\pnqc\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl2\pnucltr\pnqc\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl3
+\pndec\pnqc\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl4\pnlcltr\pnqc\pnstart1\pnindent720\pnhang {\pntxta )}}{\*\pnseclvl5\pndec\pnqc\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl6\pnlcltr\pnqc\pnstart1\pnindent720\pnhang 
+{\pntxtb (}{\pntxta )}}{\*\pnseclvl7\pnlcrm\pnqc\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl8\pnlcltr\pnqc\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl9\pnlcrm\pnqc\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}
+\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid6226036 {\*\bkmkstart _Toc420414641}Introduction
+{\*\bkmkend _Toc420414641}
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 {\*\bkmkstart _Toc420154979}{\*\bkmkstart _Toc420156457}
+{\*\bkmkstart _Toc420414642}Purpose and scope{\*\bkmkend _Toc420154979}{\*\bkmkend _Toc420156457}{\*\bkmkend _Toc420414642}
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
+This document describes the use of the sampling and analysis tools that can be used to profile execution on EPOC devices.}{\cf6\insrsid6226036 {\*\bkmkstart _Toc419889484}{\*\bkmkstart _Toc420414643}
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 References{\*\bkmkend _Toc419889484}{\*\bkmkend _Toc420414643}
+\par {\*\bkmkstart _Toc419889485}{\*\bkmkstart _Toc420414644}Open Issues{\*\bkmkend _Toc419889485}{\*\bkmkend _Toc420414644}
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The following issues need to be resolved before this document is completed.
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0\pararsid678217 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid678217 Abbrevations
+\par }\trowd \irow0\irowband0\ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb
+\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth8046\clshdrawnil \cellx9747
+\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\yts25 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid678217 XIP image\cell eXecuteInPlace ROM image. The executables are }{\insrsid481371 executed}{
+\insrsid678217  from the place they are stored. Their run addresses are decided during rombuild process. NOR Flash is }{\insrsid2495527 an example of }{\insrsid678217 XIP media.\cell }\pard\plain 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid678217 \trowd \irow0\irowband0\ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 
+\trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb
+\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth8046\clshdrawnil \cellx9747
+\row }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\yts25 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid678217 non-XIP image\cell 
+The executables of the non-XIP image are copied into RAM before being run. Their run addresses are decided during run time. NAND Flash is }{\insrsid2495527 an example }{\insrsid678217 non-XIP media.\cell }\pard\plain 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid678217 \trowd \irow1\irowband1\lastrow \ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl
+\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb
+\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth8046\clshdrawnil \cellx9747
+\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\insrsid678217 
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 {\*\bkmkstart _Toc419889486}{\*\bkmkstart _Toc420414645}
+Document History{\*\bkmkend _Toc419889486}{\*\bkmkend _Toc420414645}
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft0\trhdr\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 \trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 
+\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\clshdng6000\cltxlrtb\clftsWidth3\clwWidth1276\clshdngraw6000 \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\clshdng6000\cltxlrtb\clftsWidth3\clwWidth974\clshdngraw6000 \cellx2250\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\clshdng6000\cltxlrtb\clftsWidth3\clwWidth973\clshdngraw6000 \cellx3223\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\clshdng6000\cltxlrtb\clftsWidth3\clwWidth5709\clshdngraw6000 \cellx8932\pard\plain \s18\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \b\fs21\cf8\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Date\cell Version
+\cell Status\cell Description\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 \trowd \irow0\irowband0
+\ts11\trgaph108\trleft0\trhdr\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 \trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 
+\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\clshdng6000\cltxlrtb\clftsWidth3\clwWidth1276\clshdngraw6000 \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\clshdng6000\cltxlrtb\clftsWidth3\clwWidth974\clshdngraw6000 \cellx2250\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\clshdng6000\cltxlrtb\clftsWidth3\clwWidth973\clshdngraw6000 \cellx3223\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\clshdng6000\cltxlrtb\clftsWidth3\clwWidth5709\clshdngraw6000 \cellx8932\row }\trowd \irow1\irowband1\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 
+\trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 \trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr
+\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth1276\clshdrawnil \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\cltxlrtb\clftsWidth3\clwWidth974\clshdrawnil \cellx2250\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth973\clshdrawnil \cellx3223
+\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth5709\clshdrawnil \cellx8932\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 {\*\xmlopen\xmlns1{\factoidname date}{\xmlattr\xmlattrns0{\xmlattrname Month}{\xmlattrvalue 9}}{\xmlattr\xmlattrns0{\xmlattrname Day}{\xmlattrvalue 27}}
+{\xmlattr\xmlattrns0{\xmlattrname Year}{\xmlattrvalue 2000}}}27/09/2000{\*\xmlclose}\cell }\pard \qc \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 0.01\cell }\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Draft\cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow1\irowband1
+\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 \trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 
+\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\cltxlrtb\clftsWidth3\clwWidth1276\clshdrawnil \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth974\clshdrawnil \cellx2250
+\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth973\clshdrawnil \cellx3223\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl
+\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth5709\clshdrawnil \cellx8932\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6372845 
+{\*\xmlopen\xmlns1{\factoidname date}{\xmlattr\xmlattrns0{\xmlattrname Month}{\xmlattrvalue 5}}{\xmlattr\xmlattrns0{\xmlattrname Day}{\xmlattrvalue 31}}{\xmlattr\xmlattrns0{\xmlattrname Year}{\xmlattrvalue 2005}}}31/05/2005{\*\xmlclose}\cell }\pard 
+\qc \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6372845 0.02\cell }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6372845 Draft\cell }{\insrsid2495527 Added}{\insrsid6372845  non-XIP support
+}{\insrsid2495527  in profiler}{\insrsid6372845 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6372845 \trowd \irow2\irowband2\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl
+\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 \trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 \trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt
+\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth1276\clshdrawnil \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb
+\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth974\clshdrawnil \cellx2250\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\cltxlrtb\clftsWidth3\clwWidth973\clshdrawnil \cellx3223\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth5709\clshdrawnil \cellx8932\row 
+}\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid13524902 {\*\xmlopen\xmlns1{\factoidname date}{\xmlattr\xmlattrns0{\xmlattrname Month}{\xmlattrvalue 9}}{\xmlattr\xmlattrns0{\xmlattrname Day}{\xmlattrvalue 8}}
+{\xmlattr\xmlattrns0{\xmlattrname Year}{\xmlattrvalue 2006}}}08/09/2006{\*\xmlclose}\cell }\pard \qc \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid13524902 0.03\cell }\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid13524902 Draft\cell Added description of \endash drive= option\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
+\insrsid13524902 \trowd \irow3\irowband3\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 \trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 
+\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\cltxlrtb\clftsWidth3\clwWidth1276\clshdrawnil \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth974\clshdrawnil \cellx2250
+\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth973\clshdrawnil \cellx3223\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl
+\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth5709\clshdrawnil \cellx8932\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid11890070 
+{\*\xmlopen\xmlns1{\factoidname date}{\xmlattr\xmlattrns0{\xmlattrname Month}{\xmlattrvalue 7}}{\xmlattr\xmlattrns0{\xmlattrname Day}{\xmlattrvalue 9}}{\xmlattr\xmlattrns0{\xmlattrname Year}{\xmlattrvalue 2007}}}09/07/2007{\*\xmlclose}\cell }\pard 
+\qc \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid11890070 0.04\cell }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid11890070 Draft\cell Changed XIP to non-XIP for }{\cs27\insrsid11890070 
+\endash }{\cs27\insrsid11890070 rofs}{\cs27\insrsid11890070  option. }{\insrsid11890070 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid11890070 \trowd \irow4\irowband4\lastrow 
+\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw15\brdrcf1 \trbrdrl\brdrs\brdrw15\brdrcf1 \trbrdrb\brdrs\brdrw15\brdrcf1 \trbrdrr\brdrs\brdrw15\brdrcf1 \trbrdrh\brdrs\brdrw15\brdrcf1 \trbrdrv\brdrs\brdrw15\brdrcf1 
+\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 
+\cltxlrtb\clftsWidth3\clwWidth1276\clshdrawnil \cellx1276\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth974\clshdrawnil \cellx2250
+\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth973\clshdrawnil \cellx3223\clvertalt\clbrdrt\brdrs\brdrw15\brdrcf1 \clbrdrl
+\brdrs\brdrw15\brdrcf1 \clbrdrb\brdrs\brdrw15\brdrcf1 \clbrdrr\brdrs\brdrw15\brdrcf1 \cltxlrtb\clftsWidth3\clwWidth5709\clshdrawnil \cellx8932\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\insrsid6226036 
+\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The profiling tool
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
+The profiler consists of a program running on the target device which periodically samples the PC (program counter) and current thread ID, saving the resulting }{\i\insrsid6226036 trace data}{\insrsid6226036  to a file. This program comprises of:
+\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
+\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 a kernel-dependant device driver, currently only ARM targets are supported
+\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
+\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 an executable which can be controlled via command line, programmatically by IPC, or through a console interface
+\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
+\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 an optional DLL which provides a }{\i\insrsid6226036 hot-key}{\insrsid6226036  UI to replace the default console
+\par }\pard \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlcont\ilvl0\ls0\pnrnot0\pndec }\faauto\rin0\lin0\itap0 {\insrsid6226036 
+Currently the sample rate is fixed at 1000Hz, typically generating 3Kb of data per second of processor activity. It can run on a standard build of EPOC (no kernel modifications are required), and does not require changes to the code to be profiled.
+\par }{\insrsid12336355 When profiler runs, it gets all the data from the device driver and stores it in memory. This ultimately becomes a limitation and when the profiler runs out of heap memory, it stops and writes all the data to disk. With a defaul
+t heap that can grow to 1MB and with 3Kb of data per second, the profiler will run for 5-6 minutes before running out of memory and stopping. You can increase the maximum heap size of the profiler in order for it to run longer.
+\par }{\insrsid12218284 The tool also supports profiling of non-XIP executables. It uses Kernel\rquote s debug interface to collects the relevant information regarding non-XIP code segments. In order to do so, Kernel must be built with }{
+\insrsid15342006\charrsid15342006 __DEBUGGER_SUPPORT__}{\insrsid15342006  }{\insrsid12218284 option.}{\insrsid7406415  (Assabet, Lubbock and H2 are all built by default in this way.)}{\insrsid12218284 
+\par }{\insrsid6226036 After }{\insrsid6816192 profiling the trace data file ([drive letter]}{\insrsid6226036 :\\PROFILER.DAT on the device) is transferred to a PC, where it can be processed using a Win32 tool: Analyse. Some of its feature include:
+\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
+\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 Providing various reports based on the trace data, including a basic trace listing, a thread/location profile distribution table and a thread/time profile
+\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
+\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 A rom symbol file can be used to translate code addresses into DLL or function names
+\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
+\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 The trace can be filtered in various ways before generating the report, e.g. restrict analysis to a single thread, process, DLL and/or time interval.
+\par {\pntext\pard\plain\f3\fs20\insrsid6226036 \loch\af3\dbch\af0\hich\f3 \'b7\tab}}\pard \ql \fi-283\li283\ri0\sb60\sa60\widctlpar\wrapdefault{\*\pn \pnlvlblt\ilvl0\ls1\pnrnot0\pnf3\pnstart1\pnindent283\pnhang {\pntxtb \'b7}}
+\faauto\ls1\rin0\lin283\itap0\pararsid6890489 {\insrsid6226036 Output suitable for pasting directly into Excel can be generated to enable simple graphical analysis of the results
+\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid6226036 \page Using the profiler
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Installing the profiler
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 To 
+generate the profiling trace, the profile program must be installed on the EPOC device (e.g. by copying to a CF card). Three parts of the program need to be installed as follows:
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth2835\clshdrawnil \cellx4395\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth5353\clshdrawnil \cellx9748\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 File\cell Found in\cell Install to\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\insrsid6226036 \trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth2835\clshdrawnil \cellx4395\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth5353\clshdrawnil \cellx9748\row }\trowd \irow1\irowband1
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth2835\clshdrawnil \cellx4395\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth5353\clshdrawnil \cellx9748\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Profiler.exe\cell \\epoc\\release\\}{\i\insrsid6226036 <ABI>}{\insrsid6226036 \\urel\cell \\}{
+\insrsid6372845 s}{\insrsid481371 ys}{\insrsid6226036 \\}{\insrsid6372845 bin}{\insrsid6226036  or other suitable location on the device\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
+\trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil 
+\cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth2835\clshdrawnil \cellx4395\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth5353\clshdrawnil \cellx9748\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Sampler.ldd\cell \\epoc\\release\\}{\i\insrsid6226036 <A}{\i\insrsid6890489 BI}{\i\insrsid6226036 >}{
+\insrsid6226036 \\urel\cell \\}{\insrsid6372845 s}{\insrsid6226036 ys\\}{\insrsid6372845 bin}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow2\irowband2
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth2835\clshdrawnil \cellx4395\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth5353\clshdrawnil \cellx9748\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 ProfilerKeys.dll\cell \\epoc\\release\\}{\i\insrsid6226036 <ABI>}{\insrsid6226036 \\urel\cell \\}{
+\insrsid6372845 s}{\insrsid6226036 ys\\}{\insrsid6372845 bin}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow3\irowband3\lastrow 
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth2835\clshdrawnil \cellx4395\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth5353\clshdrawnil \cellx9748\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid6226036 {\insrsid6226036 In this table, }{\i\insrsid6226036 ABI}{\insrsid6226036 
+ refers to the flavour of ARM build required\emdash }{\insrsid6890489 e.g. ARM4. }{\insrsid6226036 The final component\emdash ProfilerKeys.dll\emdash 
+requires the full Window Server to function, thus it is optional and omitting from the installation will cause the profiler to provide a console UI instead of using hot keys.
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Running the profiler
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 To load the profiler, the Profiler.exe program must be execu
+ted on the target device, it then remains loaded until asked to exit.
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Profiler commands
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The Profiler understands four commands:
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth959\clshdrawnil 
+\cellx851\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8895\clshdrawnil \cellx9746\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 start\cell }{
+\insrsid6226036 Start sampling, if not already doing so.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow0\irowband0
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth959\clshdrawnil \cellx851\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8895\clshdrawnil \cellx9746\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 stop\cell }{
+\insrsid6226036 Stop sampling. If restarted, the new samples are added to the current trace data.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow1\irowband1
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth959\clshdrawnil \cellx851\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8895\clshdrawnil \cellx9746\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 close\cell }{
+\insrsid6226036 Stop sampling if necessary and then close the trace data file. If restarted, the current trace data is discarded and a new trace file started. This allows the file to be copied from the internal disk without having to unload the profiler.
+\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow2\irowband2\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth959\clshdrawnil \cellx851\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth8895\clshdrawnil \cellx9746\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 unload\cell }{\insrsid6226036 
+Stop sampling if necessary and unload the profiler. This first ensures that all trace data is saved before the program exits.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
+\trowd \irow3\irowband3\lastrow \ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth959\clshdrawnil \cellx851\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth8895\clshdrawnil \cellx9746\row }\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid6372845 {\insrsid6372845 It also accepts the following options:
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthB3\trftsWidthA3\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth7903\clshdrawnil \cellx9746\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\b\insrsid6372845 -noui\cell }{\insrsid6372845 Starts profiler application without }{\insrsid12218284 user interface. }{\insrsid481371 Particularly}{\insrsid12218284  }{
+\insrsid481371 useful}{\insrsid12218284  on eshell window server system}{\insrsid2495527 s}{\insrsid12218284  with no touch sensitive screen.}{\insrsid6372845 
+\par }{\insrsid12218284 In such case, the profiler should be started from the ESHELL by:
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12218284 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12218284 start profiler start \endash noui
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12218284 and stopped by:
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12218284 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12218284 profiler exit\cell }\pard\plain 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6372845 \trowd \irow0\irowband0
+\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthB3\trftsWidthA3\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth7903\clshdrawnil \cellx9746\row }\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\b\insrsid6372845 -xiponly\cell }{\insrsid12218284 Suppresses any activity in the tool regarding non-XIP }{\insrsid15342006 support}{\insrsid12218284 
+. This is recommended option when r}{\insrsid2495527 unning the profiler tool on XIP-}{\insrsid12218284 only platforms.}{\insrsid6372845 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6372845 
+\trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthB3\trftsWidthA3\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth7903\clshdrawnil \cellx9746\row }\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\b\insrsid6816192 -drive=[drive letter]}{\b\insrsid6816192\charrsid6816192 \cell }{\insrsid6816192 
+Specify which drive to store the trace data file (PROFILER.DAT), where [drive letter] can be }{\insrsid13524902 one of the 26 drive letters, }{\insrsid6816192 \lquote A\rquote  to \lquote Z\rquote 
+.  When this drive letter option is not specified the default drive C is used.  If the file cannot be created at the specified drive the profiler will not start.\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6816192 \trowd \irow2\irowband2\lastrow 
+\ts11\trgaph108\trleft-108\trftsWidth1\trftsWidthB3\trftsWidthA3\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth7903\clshdrawnil \cellx9746\row }\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid6372845 {\insrsid6372845\charrsid6372845 
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Command line control
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The Profiler can be controll
+ed from the command line, by specifying the action as a parameter to the Profiler.exe program. If the profiler is already loaded, this will just pass on the control request to the running program, otherwise it will load the profiler ready for further comm
+ands. E.g. use the following command in ESHELL:
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 profiler start
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Console control
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
+The console UI is used if the ProfilerKeys.dll is not present on the device. When the console is in the foreground, it interprets the following keypresses to control the profiler:
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 Key\cell Action\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\insrsid6226036 \trowd \irow0\irowband0
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\row }\trowd \irow1\irowband1
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 s\cell }{\insrsid12218284 S}{
+\insrsid6226036 tart\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow1\irowband1
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 p\cell }{\insrsid12218284 S}{
+\insrsid6226036 top\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow2\irowband2
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 c\cell }{\insrsid12218284 C}{
+\insrsid6226036 lose\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow3\irowband3
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 x\cell unload\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow4\irowband4\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone 
+\clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\row 
+}\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 ?\cell Display the key mapping used to control the profiler\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
+\insrsid6226036 \trowd \irow5\irowband5\lastrow \ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth675\clshdrawnil \cellx567\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4536\clshdrawnil \cellx5103\row }\pard\plain 
+\s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Hot key control
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
+If ProfilerKeys.dll is installed then the profiler hooks the following key combinations which can be used to control the profiler from any application:
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil \cellx6521\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\b\insrsid6226036 Key\cell Action\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\insrsid6226036 \trowd \irow0\irowband0
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil \cellx6521\row }\trowd \irow1\irowband1
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil \cellx6521\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Fn+Ctrl+Shift+1\cell start\cell 
+}\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil 
+\cellx6521\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Fn+Ctrl+Shift+2\cell stop\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
+\trowd \irow2\irowband2\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil 
+\cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil \cellx6521\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 
+Fn+Ctrl+Shift+3\cell close\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow3\irowband3
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil \cellx6521\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Fn+Ctrl+Shift+4\cell unload
+\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow4\irowband4\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil \cellx6521\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 Fn+Ctrl+Shift+0\cell Display the current operation of the profiler in an infoprint\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow5\irowband5\lastrow \ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1668\clshdrawnil \cellx1560\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth4961\clshdrawnil 
+\cellx6521\row }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Programmatic control
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
+The profiler can also be controlled from within another program on the device by using the API defined in profiler.h. This defines the }{\f36\fs18\insrsid6226036 Profiler}{\insrsid6226036  class, which
+ has static functions corresponding to each profiler command. Note that }{\f36\fs18\insrsid6226036 Profiler::Start()}{\insrsid6226036 
+ will not load the profiler if it is not currently loaded, it will only cause an already loaded profiler to start sampling. It is possible to check for this possibility and use the command line to run the profiler using the following code:
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 if (Profiler::Start() == KErrNotFound)\line \tab \{\line \tab _LIT(KProfiler,"profiler");
+\line \tab _LIT(KStart,"start");\line \tab RProcess p;\line \tab if (p.Create(KProfiler,KStart) == KErrNone)\line \tab \tab \{\line \tab \tab p.Resume();\line \tab \tab p.Close();\line \tab \tab \}\line \tab \}
+\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid6226036 \page Analysing the trace data
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
+Once a trace data file has been obtained using the profiler, it needs to be transferred to a PC for analysis using the Analyse program, which should be present in the EPOC tools directory. Here are some example of standard 
+uses of the tool, followed by a complete command reference describing all of the options.
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Generating a full listing of the trace
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The full trace recorded in the trace file can be output in text form using the listing }{
+\f36\fs18\insrsid6226036 -listing}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -l}{\insrsid6226036 ) option:
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -listing
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
+This outputs one line for each sample, recording the sample number, thread ID and a PC value. A table mapping these thread IDs to thread names is provided at the end of the listing. By default, samples of the NULL thread are not shown\emdash processor
+ inactivity can be detected by samples that are missing in the trace\emdash if necessary the NULL thread can be reported using the }{\f36\fs18\insrsid6226036 -null}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -n}{\insrsid6226036 ) option.
+\par A more interesting trace can be generated if a ROM symbol file matching the device ROM is available\emdash PC values are then displayed relative to symbols in the {\*\xmlopen\xmlns1{\factoidname country-region}}ROM.{\*\xmlclose} This is done using the }{
+\f36\fs18\insrsid6226036 -rom}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -r}{\insrsid6226036 ) command option:
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -rom \\epoc32\\rom\\myrom.symbol -listing
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Finding out where threads spend most of their time
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 A distribution of thread against location can be generated using the }{\f36\fs18\insrsid6226036 
+-profile}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -p}{\insrsid6226036 ) command option\emdash this is the default if }{\f36\fs18\insrsid6226036 -l}{\insrsid6226036  and }{\f36\fs18\insrsid6226036 -v}{\insrsid6226036 
+ are omitted. The address space can be divided up by address, by DLL or by function, the latter two requiring a symbol file. The following command will analyse the trace and report the amount of time spent by each thread in each function in the ROM:
+
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -rom \\epoc32\\rom\\myrom.symbol -byfunction
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 You may need a very wide command prompt to read the tablulated output
+ sensibly. The output begins with a summary of the sample analysed: the total number of samples, the number of active samples (i.e. ignoring the NULL thread), and the number of samples analysed in the following report. Then there is a thread ID to name ma
+p
+ping, followed by a table with the threads across the top and the locations down the right side. The first row contains the proportion of time spent overall in that thread, the last column is the proportion of time spent by all threads in that function. N
+ote that both the threads and locations are sorted into descending order.
+\par Usually, the last few threads and locations are of no interest for analysis, and eliminating them makes the output easier to follow. A \lquote cut off\rquote  value can be supplied which eliminates
+ the output of results for threads or locations which contain fewer samples than the provided value. The }{\f36\fs18\insrsid6226036 -cutoff}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -c}{\insrsid6226036 
+) option takes a number which is specified in percent, e.g.
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -r \\epoc32\\rom\\myrom.symbol -bf -cutuff0.5
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 This produces th
+e same results as last time, but does not report on any threads or locations with less than 0.5% of the overall samples.
+\par }{\insrsid12336355 When using the analyse tool with a symbol file, there is a limitation you should be aware of. C static functions (LOCAL_C functions) ar
+e not listed in the symbol file by the tools (they do not appear in the .map file). As a consequence of this, hits in these functions will be wrongly attributed to the functions right before of them in {\*\xmlopen\xmlns1{\factoidname country-region}}
+{\*\xmlopen\xmlns1{\factoidname country-region}}ROM.{\*\xmlclose}{\*\xmlclose}
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Finding out when threads are executing
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 A distribution of thread activity against time can be generated using the }{\f36\fs18\insrsid6226036 
+-activity}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -v}{\insrsid6226036 ) command option. The following command will analyse the trace and report the amount of time spent by each thread in each block of 1000 samples (1 second):
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -activity -bysize1000
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 If the }{\f36\fs18\insrsid6226036 -bysize}{\insrsid6226036 
+ parameter is omitted, a default value of 100 samples is used. The cutoff option can be used to eliminate threads that contribute little to the overall execution time.
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Restricting the analysis to certain samples
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Filters ca
+n be provided to restrict the analysis to specific samples in the trace. These options generally work for all types of output.
+\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Filtering by thread name
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The samples for a specific thread can be analysed using the }{\f36\fs18\insrsid6226036 -thread}{
+\insrsid6226036  (}{\f36\fs18\insrsid6226036 -t}{\insrsid6226036 ) option, this is followed by a basic wildcard pattern for the thread name to analyse. (The }{\f36\fs18\insrsid6226036 *}{\insrsid6226036 
+ character can represent zero or more of any character). E.g. to analyse just the threads in the file server the following commands could be used:
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -r \\epoc32\\rom\\myrom.symbol -bf -thread efile*
+\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Filtering by dll name
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
+Analysis for the thread/location distribution can be restricted to DLLs matching a provided pattern using the }{\f36\fs18\insrsid6226036 -dll}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -d}{\insrsid6226036 
+) option. E.g. to restrict analysis to BitGdi.dll the following command could be used:
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -r \\epoc32\\rom\\myrom.symbol -bf -dll bitgdi.dll
+\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Filtering by function name
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 
+Analysis can be even more specific by providing a DLL and function pattern to match. In this case, the first matching function in the first matching DLL is analysed by ad
+dress, defaulting to instruction-level granularity. This can provide code-path analysis for execution hotspots. E.g. to analyse execution in the }{\f36\fs18\insrsid6226036 ExecuteJava()}{\insrsid6226036  function the following command could be used:
+
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -r \\epoc32\\rom\\myrom.symbol -d pjavai.dll -function executejava
+
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Note that the \lquote function name\rquote 
+ usually includes the signature of the parameters, so it is often effective to add a }{\f36\fs18\insrsid6226036 *}{\insrsid6226036  to the end of the function name for analysis.
+\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Filtering by sample number
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 The }{\f36\fs18\insrsid6226036 -samples}{\insrsid6226036  (}{\f36\fs18\insrsid6226036 -s}{
+\insrsid6226036 ) option allows a
+ specific range of samples to be analysed, rather than the entire file. This can be useful if the trace contains activity which should not be analysed, or for generating high-resolution activity traces for specific parts of the trace. E.g. to analyse 1000
+ samples starting at sample number 2500, the following command could be used:
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse profiler.dat -v -bs50 -samples2500+1000
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Generating graphs and charts from the output
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 By default, spaces are us
+ed when formatting the output resulting in tables that are easily read by eye. However, very often it helps to be able to generate charts from the tabulated data for visual analysis. The }{\f36\fs18\insrsid6226036 -formatexcel}{\insrsid6226036  (}{
+\f36\fs18\insrsid6226036 -mx}{\insrsid6226036 ) option instructs Analyse to format the output so t
+hat it is suitable for cut-and-paste into Microsoft Excel: using tabs rather than spaces, rearranging the tables for chart generation, and using numerical representation of sample data (rather than %). If the output from Analyse is directed to a file, thi
+s can then be opened by a text editor and the table can be pasted directly into Excel.
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0\pararsid735290 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid735290 Profiling Jazelle code
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid735290 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid735290 
+Profiler tool clears the LSB bit in every sample. This is because it is used for some other markings that help keep log file short. ARM and Thumb i
+nstructions always appear on even program addresses. However, Jazelle instructions are one byte long and can appear on any program address. As the consequence, sampling Jazelle code does not give the exact result. If a Jazelle instruction on odd program a
+ddress is sampled, it will be reported as the Jazelle instruction on the preceding even program address.}{\insrsid735290\charrsid735290 
+\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid6226036 \page Analyse command reference
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Command line
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 analyse }{\f0\fs20\insrsid6226036 [ report-type ]}{\insrsid6226036  }{
+\f0\fs20\insrsid6226036 [ options ]}{\fs20\insrsid6226036  }{\i\f0\fs20\insrsid6226036 tracefile}{\insrsid6226036 
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Reports
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 
+Report type\cell Abbrev.\cell Description\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\insrsid6226036 \trowd \irow0\irowband0
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone 
+\clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl
+\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -listing}{\insrsid6226036 \cell }{
+\f36\fs18\insrsid6226036 -l}{\insrsid6226036 \cell Generate a listing of the trace\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow1\irowband1
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\trowd \irow2\irowband2\ts11\trgaph108\trrh221\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone 
+\clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -profile}{\insrsid6226036 \cell }{
+\f36\fs18\insrsid6226036 -p}{\insrsid6226036 \cell Generate a thread vs. location profile of the data. This is the default type of report.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
+\trowd \irow2\irowband2\ts11\trgaph108\trrh221\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\trowd \irow3\irowband3\lastrow \ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone 
+\clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835
+\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -activity}{
+\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -v}{\insrsid6226036 \cell Generate a thread activity profile of the data\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
+\trowd \irow3\irowband3\lastrow \ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 
+\b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Options
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 Option
+\cell Abbrev.\cell Description\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\insrsid6226036 \trowd \irow0\irowband0
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone 
+\clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl
+\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -help}{\insrsid6226036 \cell }{
+\f36\fs18\insrsid6226036 -h}{\insrsid6226036 \line }{\f36\fs18\insrsid6226036 -?}{\insrsid6226036 \cell Display a brief summary of the command line options\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
+\insrsid6226036 \trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid1653898 -help config\cell -h }{\f2\fs18\insrsid1653898\charrsid1653898 
+config}{\f36\fs18\insrsid1653898 \cell }{\insrsid1653898 Display an example of the config file\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid1653898 \trowd \irow2\irowband2
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -rom}{\insrsid6226036  }{\i\insrsid6226036 symbolfile}{\insrsid6226036 \cell }{
+\f36\fs18\insrsid6226036 -r }{\insrsid6226036 \'85\cell Supply a ROM symbol file}{\insrsid3948828  of the XIP image}{\insrsid6226036  for interpretation of PC values\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow3\irowband3\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone 
+\clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835
+\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -samples}{
+\i\insrsid6226036 range}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -s}{\insrsid6226036 \'85\cell Restrict the analysis to the sample range specified. The range can either be specified as }{\i\insrsid6226036 begin}{\f36\fs18\insrsid6226036 -}{
+\i\insrsid6226036 end}{\insrsid6226036  or as }{\i\insrsid6226036 begin}{\f36\fs18\insrsid6226036 +}{\i\insrsid6226036 count}{\insrsid6226036 , the sample numbers should be specified in decimal. So the following are equivalent:
+\par }{\f36\fs18\insrsid6226036 -samples2500-3500}{\insrsid6226036 \line }{\f36\fs18\insrsid6226036 -samples2500+1000}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
+\trowd \irow4\irowband4\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil 
+\cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -null}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -n}{\insrsid6226036 \cell Include
+ the EPOC Kernel NULL thread in the analysis. This thread is ignored by default.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow5\irowband5
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -thread}{\insrsid6226036  }{\i\insrsid6226036 name}{\insrsid6226036 \cell }{
+\f36\fs18\insrsid6226036 -t }{\insrsid6226036 \'85\cell Restrict analysis to threads whose full name (}{\i\insrsid6226036 processname}{\insrsid6226036 ::}{\i\insrsid6226036 threadname}{\insrsid6226036 
+) matches the pattern provided. The pattern matching has a single wildcard character \lquote *\rquote , which will match zero or more of any character.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
+\insrsid6226036 \trowd \irow6\irowband6\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -dll }{\i\insrsid6226036 name}{\insrsid6226036 \cell }{
+\f36\fs18\insrsid6226036 -d }{\insrsid6226036 \'85\cell Restrict analysis to Dlls whose name matches the pattern provided.
+\par This option is only effective for a Profile report, and requires a ROM symbol file.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow7\irowband7
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -function }{\i\insrsid6226036 name}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -f }{
+\insrsid6226036 \'85\cell Restrict analysis to functions whose name matches the pattern provided. If }{\f36\fs18\insrsid6226036 -dll}{\insrsid6226036  is also specified, then only functions matching the pattern within a matching Dll are analysed.
+\par This option is only effective for a Profile report, and requires a ROM symbol file.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow8\irowband8
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -address}{\i\insrsid6226036 range}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -a}{
+\insrsid6226036 \'85\cell Restrict analysis to the address range specified. This may be useful if no symbol file is available when generating a Profile report. The range can either be specified as }{\i\insrsid6226036 begin}{\f36\fs18\insrsid6226036 -}{
+\i\insrsid6226036 end}{\insrsid6226036  or as }{\i\insrsid6226036 begin}{\f36\fs18\insrsid6226036 +}{\i\insrsid6226036 size}{\insrsid6226036 , the addresses should be specified in hexadecimal. So the following would both analyse the first 6Mb of the ROM:
+
+\par }{\f36\fs18\insrsid6226036 -address50000000-50600000}{\insrsid6226036 \line }{\f36\fs18\insrsid6226036 -address50000000+600000}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
+\insrsid6226036 \trowd \irow9\irowband9\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -by\'85}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -b\'85
+}{\insrsid6226036 \cell Determine the way in which the space is partitioned in a Profile or Activity report. Only one of the following four options should be specified:\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow10\irowband10\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil 
+\cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 
+-bydll}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -bd}{\insrsid6226036 \cell Split the address space by Dll in a Profile report.
+\par This requires a ROM symbol file. It is the default partitioning if neither }{\f36\fs18\insrsid6226036 -dll}{\insrsid6226036  or }{\f36\fs18\insrsid6226036 \_function}{\insrsid6226036  are specified.\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow11\irowband11\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil 
+\cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 
+-byfunction}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -bf}{\insrsid6226036 \cell Split the address space by function in a Profile report.
+\par This requires a ROM symbol file. It is the default partitioning if }{\f36\fs18\insrsid6226036 -dll}{\insrsid6226036  is specified without }{\f36\fs18\insrsid6226036 -function}{\insrsid6226036 .\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow12\irowband12\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil 
+\cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 
+-bysize}{\i\insrsid6226036 size}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -bs}{\insrsid6226036 \'85\cell In a Profile report, this will split the address space into blocks of approximately }{\i\insrsid6226036 size}{\insrsid6226036 
+ bytes. This assumes that either the }{\f36\fs18\insrsid6226036 -address}{\insrsid6226036  option has been used, or analysis is focussed on a single function using the }{\f36\fs18\insrsid6226036 -function}{\insrsid6226036 
+ option. It is the default partitioning if }{\f36\fs18\insrsid6226036 -function}{\insrsid6226036  is specified, providing instruction level analysis.
+\par In an Activity report, this is the number of samples grouped in each line of the report. The default value of }{\i\insrsid6226036 size}{\insrsid6226036  in this case is 100 samples.\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow13\irowband13\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil 
+\cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 
+-bynumber}{\i\insrsid6226036 count}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -bn}{\insrsid6226036 \'85\cell Split the address space into }{\i\insrsid6226036 count}{\insrsid6226036  \lquote buckets\rquote  in a Profile report.
+\par It is the default partitioning if }{\f36\fs18\insrsid6226036 -address}{\insrsid6226036  is specified, providing 100 buckets.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
+\trowd \irow14\irowband14\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil 
+\cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -cutoff}{\i\insrsid6226036 percent}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -c}{
+\insrsid6226036 \'85\cell Discard threads and locations from the output that account for less than }{\i\insrsid6226036 percent}{\insrsid6226036  samples in the analysis. }{\i\insrsid6226036 Percent}{\insrsid6226036 
+ is a floating point percentage value, i.e. the following specifies a cutoff at 0.5%:
+\par }{\f36\fs18\insrsid6226036 -cutoff.5}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow15\irowband15
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -format\'85}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -m\'85}{\insrsid6226036 \cell 
+Modify the format of the reports. Any number of the following options can be concatenated into the option string, e.g.
+\par }{\f36\fs18\insrsid6226036 -formatexceltotalother}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow16\irowband16
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatpercent}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -mp}{\insrsid6226036 \cell 
+Report samples as a percentage of the total analysed. This is the default.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow17\irowband17
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatsamples}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -ms}{\insrsid6226036 \cell 
+Report the number of samples for each entry.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow18\irowband18
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatexcel}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -mx}{\insrsid6226036 \cell 
+Generate an excel compatible report for cut-and-paste.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow19\irowband19
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatzero\cell -mz}{\insrsid6226036 \cell 
+Report zero values explicitly. The default is to leave blanks.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow20\irowband20
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formattotal}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -mt}{\insrsid6226036 \cell 
+Just report the \lquote total\rquote  column in a Profile report, and discard the thread breakdown.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow21\irowband21
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatother}{\insrsid6226036 \cell }{\f36\fs18\insrsid6226036 -mo}{\insrsid6226036 \cell 
+Discard the \lquote other\rquote  location from a Profile report. This is where all samples that do not fit in another identified location are accumulated.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
+\insrsid6226036 \trowd \irow22\irowband22\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid5454414 -oby}{\f36\fs18\insrsid15342006 \cell }{
+\f36\fs18\insrsid5454414 -o}{\f36\fs18\insrsid15342006 \cell }{\insrsid5454414 Supply oby file of the non-XIP image}{\insrsid15342006 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid15342006 
+\trowd \irow23\irowband23\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil 
+\cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid3948828 -}{\f36\fs18\insrsid3948828\charrsid3948828 rofs}{\f36\fs18\insrsid5454414\charrsid3948828 
+\cell }{\f36\fs18\insrsid5454414 -z\cell }{\insrsid5454414 Supply symbol file of the }{\insrsid16414626 non-}{\insrsid5454414 XIP image\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid5454414 
+\trowd \irow24\irowband24\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil 
+\cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid3948828 -}{\f36\fs18\insrsid3948828\charrsid3948828 config\cell }{\f36\fs18\insrsid3948828 -x\cell }
+{\insrsid3948828 Supply configuration file. The file can contains all input argument and options. A template of the file is given in Appendix A.\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
+\insrsid3948828 \trowd \irow25\irowband25\lastrow \ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1951\clshdrawnil \cellx1843\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth992\clshdrawnil \cellx2835\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth6912\clshdrawnil \cellx9747\row }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0 
+\b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid6226036 Options used in each type of report
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\pard\plain 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\b\insrsid6226036 Option\cell Listing\cell Profile\cell Activity\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\b\insrsid6226036 \trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb
+\brdrs\brdrw15 \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl
+\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -rom\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {
+\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow1\irowband1\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone 
+\clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552
+\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -samples\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {
+\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 
+{\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow2\irowband2
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -null\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings"
+ \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt
+\f10\fs20}}}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow3\irowband3
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -thread\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings"
+ \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt
+\f10\fs20}}}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow4\irowband4
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -dll\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f 
+"Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow5\irowband5
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -function\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
+ 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow6\irowband6
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -address\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
+ 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow7\irowband7
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -bydll\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
+ 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow8\irowband8
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -byfunction\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
+ 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow9\irowband9
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -bysize\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
+ 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow10\irowband10\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil 
+\cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -bynumber\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {
+\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
+\trowd \irow11\irowband11\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
+\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -cutoff\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
+ 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow12\irowband12\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil 
+\cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatpercent\cell }\pard 
+\qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
+ 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow13\irowband13
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatsamples\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
+ 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow14\irowband14\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil 
+\cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatexcel\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 
+{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell 
+}\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow15\irowband15\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil 
+\cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatzero\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {
+\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell 
+}\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow16\irowband16\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil 
+\cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formattotal\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 
+{\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 
+\trowd \irow17\irowband17\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil 
+\cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid6226036 -formatother\cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid6226036 \cell }{\insrsid6226036 {\field{\*\fldinst SYMBOL
+ 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid6226036 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid6226036 \trowd \irow18\irowband18
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid3948828 - o}{\f36\fs18\insrsid678217 by}{\f36\fs18\insrsid3948828 \cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid3948828 
+{\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell }{\insrsid3948828 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell \cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid3948828 \trowd \irow19\irowband19\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt
+\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil 
+\cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard \ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid3948828 - }{\f36\fs18\insrsid678217 rofs}{\f36\fs18\insrsid3948828 \cell }\pard 
+\qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid3948828 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell }{\insrsid3948828 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings"
+ \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid3948828 \trowd \irow20\irowband20
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\f36\fs18\insrsid3948828 - }{\f36\fs18\insrsid678217 config}{\f36\fs18\insrsid3948828 \cell }\pard \qc \li0\ri0\sb40\sa40\widctlpar\intbl\wrapdefault\faauto\rin0\lin0 {\insrsid3948828 
+{\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell }{\insrsid3948828 {\field{\*\fldinst SYMBOL 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell }{\insrsid3948828 {\field{\*\fldinst SYMBOL
+ 252 \\f "Wingdings" \\s 10}{\fldrslt\f10\fs20}}}{\insrsid3948828 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid3948828 \trowd \irow21\irowband21\lastrow 
+\ts11\trgaph108\trleft-108\trftsWidth1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth1809\clshdrawnil \cellx1701\clvertalt
+\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth851\clshdrawnil \cellx2552\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone 
+\cltxlrtb\clftsWidth3\clwWidth850\clshdrawnil \cellx3402\clvertalt\clbrdrt\brdrnone \clbrdrl\brdrnone \clbrdrb\brdrnone \clbrdrr\brdrnone \cltxlrtb\clftsWidth3\clwWidth993\clshdrawnil \cellx4395\row }\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\insrsid678217 
+\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0\pararsid678217 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid678217 \page 
+Appendix A: non-XIP support and configuration file}{\insrsid6226036 
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid678217 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid10961137 N}{\insrsid678217 
+on-XIP executables are copied into RAM memory before being executed. Their run addresses are not known during ROM image build up. Therefore, corresponding symbol file does not contain run addresses of each particular function in the image, as }{
+\insrsid15867397 it}{\insrsid678217  is the case with XIP images. Instead, it contains the offset}{\insrsid11476477 s}{\insrsid678217  of the functions }{\insrsid10961137 within their }{\insrsid678217 e}{\insrsid5070621 xe}{\insrsid678217 cutables.
+\par }{\insrsid11476477 In order to calculate actual run addresses of non-XIP }{\insrsid15867397 functions}{\insrsid11476477 , the profiler tool also collects the events }{\insrsid5070621 of}{\insrsid10961137  non-XIP}{\insrsid11476477  code segment}{
+\insrsid10961137 s}{\insrsid11476477  creation/deletion. It uses Kernel debug interface and Kernel has to be built with }{\insrsid11476477\charrsid15342006 __DEBUGGER_SUPPORT__}{\insrsid3544718  option.}{\insrsid11476477 
+\par }{\insrsid3544718 During start}{\insrsid5070621 -}{\insrsid3544718 up of the }{\insrsid15867397 profiler }{\insrsid3544718 tool,}{\insrsid15867397  }{\insrsid3544718 the current list of all active non-XIP }{\insrsid10961137 code segments }{
+\insrsid3544718 are collected and stored into the c:\\profiler.dat. Once the profiling }{\insrsid10961137 is }{\insrsid3544718 started, the driver is still }{\insrsid481371 continuously}{\insrsid3544718  }{\insrsid10961137 monitoring}{\insrsid3544718 
+ for such events and logs them into the file, alongside with sample data.
+\par }{\insrsid5070621 
+\par }{\insrsid15867397 For each particular non-XIP ima}{\insrsid481371 ge, both oby and symbol file have}{\insrsid15867397  to be provided to the analyse tool (XIP image requires only symbol }{\insrsid5070621 file}{\insrsid15867397 
+). As there could be more non-XIP images in the system, a more convenient way for passing input argument}{\insrsid481371 s}{\insrsid15867397  to analyse tool would }{\insrsid5070621 be }{\insrsid15867397 by }{\insrsid5070621 means of }{\insrsid15867397 
+configuration file.}{\insrsid3544718 
+\par }{\insrsid5070621 Below}{\insrsid15867397  is }{\insrsid481371 an}{\insrsid15867397  example of the configuration file to profile }{\insrsid9066106 NAND image of H2 Techview.}{\insrsid15867397 
+\par }{\insrsid5070621 It is used as:
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0\pararsid5070621 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid5070621 analyse \endash x analyse.cfg
+\par }\pard \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0\pararsid335316 {\insrsid5070621 
+\par }{\fs16\insrsid5070621\charrsid4540351 ;***************************
+\par }{\fs16\insrsid335316\charrsid4540351 ;Analase.cfg file
+\par [Common]
+\par TraceFile=PROFILER.DAT
+\par ;Mode=listing|profile|activity
+\par }{\fs16\insrsid10961137\charrsid4540351 Mode=profile}{\fs16\insrsid335316\charrsid4540351 
+\par SymbolFile=om_001.techview.nand.symbol
+\par ;Range=100-200 | 100+100
+\par ;IncludeNullThread=0|1
+\par 
+\par [Profile]
+\par Thread=
+\par Dll=
+\par Function=
+\par ;Range=1f1a+20 | 1f1a-1f3a
+\par Range=
+\par 
+\par [Partition]
+\par ;Mode=dll|function
+\par BucketSize=
+\par NumberOfBuckets=
+\par 
+\par [Format]
+\par ;Mode=percentages|samples|excel
+\par Mode=
+\par ;ZeroValues=0|1
+\par ZeroValues=
+\par ;NoOthers=0|1
+\par NoOthers=
+\par ;TotalOnly=0|1
+\par TotalOnly=
+\par 
+\par [NonXIP]
+\par ObyFile1=om_001.techview.nand.rofs.oby
+\par RofsSymbolFile1=om_001.techview.nand.rofs.symbol}{\fs16\insrsid9066106\charrsid4540351 
+\par }\pard \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0\pararsid5070621 {\fs16\insrsid5070621\charrsid4540351 ;***************************
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid1653898 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid1653898 Any option provided in the configur
+ation file can be overwritten by the same option in the command line.
+\par 
+\par }\pard\plain \s1\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel0\rin0\lin0\itap0\pararsid1653898 \b\f1\fs24\lang2057\langfe2057\kerning28\cgrid\langnp2057\langfenp2057 {\insrsid10961137 \page 
+Appendix B: The format of the profiler.dat file}{\insrsid15867397 
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0\pararsid8592727 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392815}Basic Elements
+{\*\bkmkend _Toc100392815}
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Profiler.dat is built}{\insrsid5070621  up }{\insrsid8592727 
+from the following basic elements:
+\par {\listtext\pard\plain\fs20\insrsid8592727 \hich\af0\dbch\af0\loch\f0 -\tab}}\pard \ql \fi-360\li450\ri0\sb60\sa60\widctlpar\jclisttab\tx450\wrapdefault\faauto\ls5\rin0\lin450\itap0\pararsid8592727 {\insrsid8592727 UInt (32-bits unsigned integer);
+\par {\listtext\pard\plain\fs20\insrsid8592727 \hich\af0\dbch\af0\loch\f0 -\tab}Int (32-bit signed integer);
+\par {\listtext\pard\plain\fs20\insrsid8592727 \hich\af0\dbch\af0\loch\f0 -\tab}Text (up to 255 bytes long non-unicode text).
+\par }\pard \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 {\insrsid8592727 
+\par They are encoded as:
+\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0\pararsid8592727 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392816}UInt{\*\bkmkend _Toc100392816}
+
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 
+7 bits occupies a byte (starting from the least significant bits) with MSB=1 in the last byte. To decode, value should be extended to 32-bit length by 0s.
+\par }\trowd \irow0\irowband0\ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
+\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\pard\plain 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid481371\yts25 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 UInt}{\insrsid481371  (32 bits divided into groups of 7 bits)}{\insrsid8592727 \cell 
+Encoded as:\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow0\irowband0\ts25\trgaph108\trleft-108\trbrdrt
+\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
+\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row 
+}\trowd \irow1\irowband1\ts25\trgaph108\trrh301\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
+\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\pard\plain 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527\yts25 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\fs18\insrsid8592727\charrsid8592727 1001}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{
+\f2\fs18\insrsid8592727\charrsid8592727 1000110}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1000011}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1101100}{
+\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 0001101 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{
+\f2\fs18\insrsid8592727\charrsid8592727 1101100 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1000011 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1000110 }{
+\b\f2\fs18\insrsid8592727\charrsid8592727 1}{\i\f2\fs18\insrsid8592727\charrsid8592727 000}{\f2\fs18\insrsid8592727\charrsid8592727 1001\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 
+\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow1\irowband1\ts25\trgaph108\trrh301\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 
+\trbrdrv\brdrs\brdrw10 \trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 
+\clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil 
+\cellx9747\row }\trowd \irow2\irowband2\ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
+\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\pard\plain 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527\yts25 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\fs18\insrsid8592727\charrsid8592727 0000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{
+\f2\fs18\insrsid8592727\charrsid8592727 0000000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0000000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0001100}{
+\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 0001101 }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{
+\f2\fs18\insrsid8592727\charrsid8592727 0001100\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow2\irowband2
+\ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
+\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row 
+}\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527\yts25 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\fs18\insrsid8592727\charrsid8592727 0000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{
+\f2\fs18\insrsid8592727\charrsid8592727 0000000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0000000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0000000}{
+\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }\pard\plain 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow3\irowband3\lastrow \ts25\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl
+\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tbllkhdrrows\tbllklastrow\tbllkhdrcols\tbllklastcol\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
+\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4409\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row 
+}\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0\pararsid8592727 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392817}Int{\*\bkmkend _Toc100392817}
+
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 
+7 bits occupies a byte (starting from the least significant bits) with MSB=1 in the last byte. To decode, value should be extended to 32-bit length by the most significant bit.}{\insrsid8592727\charrsid8592727 
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508
+\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid481371 {
+\insrsid8592727 Int}{\insrsid481371  (32 bits divided into groups of 7 bits)}{\insrsid8592727 \cell Encoded as:\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid8592727 \trowd \irow0\irowband0
+\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 
+\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr
+\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row }\trowd \irow1\irowband1\ts11\trgaph108\trrh297\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv
+\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil 
+\cellx4508\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\f2\fs18\insrsid8592727\charrsid8592727 1001}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1000110}{
+\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1000011}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1101100}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{
+\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 0001101 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1101100 }{
+\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1000011 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1000110 }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{
+\b\i\f2\fs18\insrsid8592727\charrsid8592727 111}{\f2\fs18\insrsid8592727\charrsid8592727 1001\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f2\insrsid8592727 \trowd \irow1\irowband1
+\ts11\trgaph108\trrh297\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508
+\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row }\trowd \irow2\irowband2\ts11\trgaph108\trrh301\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl
+\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 
+\clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil 
+\cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\f2\fs18\insrsid8592727\charrsid8592727 1111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{
+\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{
+\f2\fs18\insrsid8592727\charrsid8592727 1111111\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{\f2\fs18\insrsid8592727\charrsid8592727 1111111\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
+\f2\insrsid8592727 \trowd \irow2\irowband2\ts11\trgaph108\trrh301\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508
+\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 
+{\f2\fs18\insrsid8592727\charrsid8592727 0111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{
+\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{
+\f2\fs18\insrsid8592727\charrsid8592727 1111111 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1111111 }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1111111 }{
+\b\f2\fs18\insrsid8592727\charrsid8592727 0}{\f2\fs18\insrsid8592727\charrsid8592727 1111111 }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{\b\i\f2\fs18\insrsid8592727\charrsid8592727 000}{\f2\fs18\insrsid8592727\charrsid8592727 0111}{
+\b\f2\fs18\insrsid8592727\charrsid8592727 \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f2\insrsid8592727 \trowd \irow3\irowband3\ts11\trgaph108\trrh301\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl
+\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 
+\clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil 
+\cellx9747\row }\trowd \irow4\irowband4\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508
+\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {
+\f2\fs18\insrsid8592727\charrsid8592727 1111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111}{
+\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 1111111\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 0}{
+\f2\fs18\insrsid8592727\charrsid8592727 1111111 }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{\f2\fs18\insrsid8592727\charrsid8592727 1111000\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
+\f2\insrsid8592727 \trowd \irow4\irowband4\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508
+\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 
+{\f2\fs18\insrsid8592727\charrsid8592727 0000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0000000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0000000}{
+\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0000000}{\b\f2\fs18\insrsid8592727\charrsid8592727 |}{\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }{\b\f2\fs18\insrsid8592727\charrsid8592727 1}{
+\f2\fs18\insrsid8592727\charrsid8592727 0001101\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f2\insrsid8592727 \trowd \irow5\irowband5\lastrow \ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl
+\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 
+\clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4537\clshdrawnil \cellx4508\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5543\clshdrawnil 
+\cellx9747\row }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0\pararsid8592727 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392818}Text
+{\*\bkmkend _Toc100392818}
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Supports up to 255 long non Unicode text:
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354
+\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid481371 {
+\insrsid8592727 Text\cell Encoded as:\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid8592727 \trowd \irow0\irowband0\ts11\trgaph108\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb
+\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 
+\clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil \cellx9747\row 
+}\trowd \irow1\irowband1\ts11\trgaph108\trrh297\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354
+\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil \cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {
+\f2\fs18\insrsid8592727\charrsid8592727 \'93Text\'94\cell 4, \lquote T\rquote , \lquote e\rquote , \lquote x\rquote , \lquote t\rquote \cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f2\insrsid8592727 
+\trowd \irow1\irowband1\ts11\trgaph108\trrh297\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354
+\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil \cellx9747\row }\trowd \irow2\irowband2\ts11\trgaph108\trrh301\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl
+\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 
+\clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil 
+\cellx9747\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\f2\fs18\insrsid8592727\charrsid8592727 \lquote x\rquote  times 255\cell 255, \lquote x\rquote  times 255\cell }\pard 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\f2\insrsid8592727 \trowd \irow2\irowband2\ts11\trgaph108\trrh301\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 
+\trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
+\cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil \cellx9747\row }\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid2495527 {\f2\fs18\insrsid8592727\charrsid8592727 \'93\'94\cell 0\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
+\f2\insrsid8592727 \trowd \irow3\irowband3\lastrow \ts11\trgaph108\trrh301\trleft0\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind108\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4500\clshdrawnil \cellx4354
+\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5580\clshdrawnil \cellx9747\row }\pard\plain 
+\s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0\pararsid8592727 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392819}Derived Elements
+{\*\bkmkend _Toc100392819}
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 The following derived elements are defined as well:
+\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0\pararsid8592727 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392820}Tag{\*\bkmkend _Toc100392820}
+
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid5070621 This is the header of the file.}{\insrsid8592727 
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0\pararsid8592727 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Tag = Text(\'93Profiler\'94) + UInt(MajorVersionNumber)
+\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0\pararsid8592727 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392821}Thread
+{\*\bkmkend _Toc100392821}
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 
+Contains processID and thread name. Also can contain process name if the process is seen for the first time:
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0\pararsid8592727 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 
+Thread(DThread*) = UInt(processID) [+ Text(processName) ]+ Text(threadName]
+\par }\pard\plain \s3\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel2\rin0\lin0\itap0\pararsid8592727 \f1\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392822}Repeat
+{\*\bkmkend _Toc100392822}
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid8592727 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Encode repeated sequence of the same sample:
+\par }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin284\itap0\pararsid8592727 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Repeat(x) = Int(0) + UI}{\insrsid12536172 nt(x)}{\insrsid8592727 :
+\par }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0\pararsid8592727 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 {\*\bkmkstart _Toc100392823}File build up
+{\*\bkmkend _Toc100392823}
+\par {\listtext\pard\plain\fs20\insrsid8592727 \hich\af0\dbch\af0\loch\f0 -\tab}}\pard\plain \ql \fi-360\li405\ri0\sb60\sa60\widctlpar\jclisttab\tx405\wrapdefault\faauto\ls6\rin0\lin405\itap0\pararsid12536172 
+\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 File starts with Tag element.
+\par {\listtext\pard\plain\fs20\insrsid8592727 \hich\af0\dbch\af0\loch\f0 -\tab}It is followed by samples that are recorded as:
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
+\cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid8592727 Sample description\cell Sample record\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {
+\f2\insrsid8592727 \trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
+\cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid8592727 The first sample record}{\insrsid12536172 .}{\insrsid8592727 \cell }\pard\plain 
+\s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Int(PC | 1)
+\par }{\f2\fs20\insrsid8592727 UInt(threadID)
+\par UInt(processID)   ]
+\par Text(processName) ] Thread element
+\par Text(threadName)  ]\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow1\irowband1\ts11\trgaph108\trleft-108
+\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 
+\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr
+\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid481371 A s}{\insrsid8592727 
+ample record with a new thread and a new process seen\cell }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 
+Int((PC - PC of the previous sample) | 1)
+\par }{\f2\fs20\insrsid8592727 UInt(threadID)
+\par UInt(processID)   ]
+\par Text(processName) ] Thread element
+\par Text(threadName)  ]\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow2\irowband2\ts11\trgaph108\trleft-108
+\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 
+\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr
+\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid481371 A s}{\insrsid8592727 
+ample record with a new thread seen (with already known process)\cell }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 
+Int((PC - PC of the previous sample) | 1)
+\par }{\f2\fs20\insrsid8592727 UInt(threadID)
+\par UInt(processID)   ]
+\par Text(threadName)  ] Thread element\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow3\irowband3
+\ts11\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
+\cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid481371 A s}{\insrsid8592727 ample record with already known thread\cell }\pard\plain 
+\s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Int((PC - PC of the previous sample) | 1)
+\par }{\f2\fs20\insrsid8592727 UInt(threadID)\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow4\irowband4
+\ts11\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
+\cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid481371 A s}{\insrsid8592727 ample with the same thread ID as the previous sample\cell }\pard\plain 
+\s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 Int(PC - PC of the previous sample)\cell }\pard\plain 
+\ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\f2\insrsid8592727 \trowd \irow5\irowband5\ts11\trgaph108\trleft-108\trbrdrt\brdrs\brdrw10 \trbrdrl
+\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 
+\clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
+\cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid481371 A s}{\insrsid8592727 
+amples with the same PC and threadID that repeat N consecutive times\cell }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {
+\insrsid8592727 <Any sample record described above>
+\par Repeat(N-1)\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid8592727 \trowd \irow6\irowband6\lastrow \ts11\trgaph108\trleft-108\trbrdrt
+\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 \trftsWidth1\trftsWidthB3\trftsWidthA3\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt
+\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4455\clshdrawnil \cellx4347\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
+\cltxlrtb\clftsWidth3\clwWidth5400\clshdrawnil \cellx9747\row }\pard\plain \s2\ql \li0\ri0\sb120\sa60\keepn\widctlpar\wrapdefault\faauto\outlinelevel1\rin0\lin0\itap0\pararsid12536172 \b\i\f1\fs22\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {
+\insrsid12536172 {\*\bkmkstart _Toc100392824}Non-XIP code support{\*\bkmkend _Toc100392824}
+\par }\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid12536172 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 
+The record of non-XIP DCodeSeg creation/deletion can be inserted between any two consecutive sample records. It can also appea}{\insrsid5070621 r immediately after Tag element or just before Repeat element.}{\insrsid12536172 
+\par All records (samples and DCodeSeg) are placed in chronological order.
+\par }\pard\plain \s26\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid12536172 \f2\fs20\lang2057\langfe1033\cgrid\langnp2057\langfenp1033 {\insrsid12536172 
+\par }\trowd \irow0\irowband0\ts11\trgaph108\trleft-108\trkeep\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4788\clshdrawnil \cellx4348\clvertalt
+\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5688\clshdrawnil \cellx9747\pard\plain \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 
+\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 Description\cell Recorded as\cell }\pard \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 {\insrsid12536172 \trowd \irow0\irowband0
+\ts11\trgaph108\trleft-108\trkeep\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4788\clshdrawnil \cellx4348\clvertalt
+\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5688\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {
+\insrsid12536172\charrsid3154883 The record of nonXIP code segment creation. CodeSegFullName contains full path of the file name. If it is longer then 255 characters, the last 255 characters will be recorded.\cell }\pard\plain 
+\s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 Int(0)
+\par UInt(0)
+\par UInt(CodeSegRunAddress)
+\par UInt(CodeSegSize)
+\par Text(CodeSegFullName)\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 \trowd \irow1\irowband1
+\ts11\trgaph108\trleft-108\trkeep\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4788\clshdrawnil \cellx4348\clvertalt
+\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5688\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {
+\insrsid12536172 The record of nonXIP code segment deletion\cell }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 \f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 Int(0)
+
+\par UInt(0)
+\par UInt(CodeSegRunAddress | 1)\cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 \fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 \trowd \irow2\irowband2
+\ts11\trgaph108\trleft-108\trkeep\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 \trbrdrv\brdrs\brdrw10 
+\trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth4788\clshdrawnil \cellx4348\clvertalt
+\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5688\clshdrawnil \cellx9747\row }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {
+\insrsid12536172 Footer. Resides at the bottom of the file. 
+\par }{\insrsid481371\charrsid16604991 RowBufferErrCounter}{\insrsid481371  }{\insrsid5055728 is the number of the dropped sample records due to full buffer condition in the driver.}{\insrsid481371 
+\par }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid5055728 {\insrsid5055728\charrsid16604991 CookBufferErrCounter}{\insrsid5055728 
+ is the number of the dropped code segment events due to full buffer condition in the driver.
+\par }\pard \ql \li0\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin0\pararsid12536172 {\insrsid5055728 \cell }\pard\plain \s23\ql \li284\ri0\sb60\sa60\widctlpar\intbl\wrapdefault\faauto\rin0\lin284\pararsid12536172 
+\f36\fs18\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 Int(0)
+\par UInt(0)
+\par UInt(0)
+\par UInt(}{\insrsid12536172\charrsid16604991 RowBufferErrCounter}{\insrsid12536172 )
+\par UInt(}{\insrsid12536172\charrsid16604991 CookBufferErrCounter}{\insrsid12536172 )
+\par UInt(ReportBitMask) where:
+\par   bit 0 set in }{\insrsid12536172\charrsid5403878 NonXIPMode}{\insrsid12536172 
+\par   bit 1 set if }{\insrsid12536172\charrsid5403878 NonXIPMode}{\insrsid12536172  but Kernel
+\par             hasn\rquote t got debu}{\insrsid5070621 g}{\insrsid12536172 ger support}{\insrsid12536172\charrsid5403878 \cell }\pard\plain \ql \li0\ri0\widctlpar\intbl\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0 
+\fs20\lang2057\langfe2057\cgrid\langnp2057\langfenp2057 {\insrsid12536172 \trowd \irow3\irowband3\lastrow \ts11\trgaph108\trleft-108\trkeep\trbrdrt\brdrs\brdrw10 \trbrdrl\brdrs\brdrw10 \trbrdrb\brdrs\brdrw10 \trbrdrr\brdrs\brdrw10 \trbrdrh\brdrs\brdrw10 
+\trbrdrv\brdrs\brdrw10 \trftsWidth1\trautofit1\trpaddl108\trpaddr108\trpaddfl3\trpaddfr3\tblind0\tblindtype3 \clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 
+\cltxlrtb\clftsWidth3\clwWidth4788\clshdrawnil \cellx4348\clvertalt\clbrdrt\brdrs\brdrw10 \clbrdrl\brdrs\brdrw10 \clbrdrb\brdrs\brdrw10 \clbrdrr\brdrs\brdrw10 \cltxlrtb\clftsWidth3\clwWidth5688\clshdrawnil \cellx9747\row }\pard 
+\ql \li0\ri0\sb60\sa60\widctlpar\wrapdefault\faauto\rin0\lin0\itap0\pararsid678217 {\insrsid10961137 
 \par }}
\ No newline at end of file
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/hcrdat.pm
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32utils/hcrscripts/hcrdat.pm	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,378 @@
+#!perl -w
+#
+# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
+# All rights reserved.
+# This component and the accompanying materials are made available
+# under the terms of the License "Eclipse Public License v1.0"
+# which accompanies this distribution, and is available
+# at the URL "http://www.eclipse.org/legal/epl-v10.html".
+#
+# Initial Contributors:
+# Nokia Corporation - initial contribution.
+#
+# Contributors:
+#
+# Description:
+#
+use strict;
+
+#use Math::BigInt;
+
+#
+# Perl module to create and maintain feature manager data files.
+# You can either set up the information programmatically or else load up
+# information from a pre-existing feature data file and then modify it. You
+# can also save the information to a file (in feature manager dataset format).
+#
+# This class maintains header information plus two arrays, one containing
+# feature flag information and the other containing default supported range
+# information. Those are themselves objects and have their own accessor
+# methods.
+#
+
+package HCRdat;
+
+use HCRrec;
+
+
+#
+# n e w
+#
+# Create a new HCRdat object. For example 'my $hd = HCRdat->new("filea");
+#
+sub new
+{
+	my $arg = shift;
+	my $fn = shift;
+	my $class = ref($arg) || $arg;
+	my $self = {
+			        fingerprint => "HCRf",  # 4 bytes wide.
+					fileversion => 1,       # 2 bytes.
+					fileflags => 0x0001,  # 2 bytes.
+					numrecords => 0,      # 4 bytes. 
+					lsdoffset => 0,       # 4 bytes. 
+					lsdsize => 0,         # 4 bytes.
+				    packprefix => "V",    # Changed with endian-ness.
+					                      # Used to create binary strings.
+
+					settingrecords => [],  # Array of objects
+					lsd => [],             # Array of bytes
+	           };
+    bless $self, $class;
+	return $self;
+}
+
+
+# Print to STDOUT the header information we have.
+sub ShowHeader
+{
+	my $self = shift;
+	return undef unless(ref($self));
+
+	# Get header information..
+	my $typefield = $self->TypeField();
+	my $fileversion = $self->FileVersion();
+	my $fileflags = $self->FileFlags();
+	my $numrecords = $self->NumRecords();
+	my $lsdoffset = $self->LsdOffset();
+	my $lsdsize = $self->LsdSize();
+	
+	# Display it in English.
+	print "  FINGERPRINTF: '$typefield'\n";
+	print "  FILEVERSION: '$fileversion'\n";
+	print "  FILEFLAGS: '$fileflags'\n";
+	print "  NUMRECORDS: '$numrecords'\n";
+	print "  LSDOFFSET: '$lsdoffset'\n";
+    print "  LSDSIZE: '$lsdsize'\n";
+
+	return(0);
+}
+
+# Get/Set the endian-ness we want. Changes the 'packprefix' member which is
+# used in the creation of binary data.
+sub Endian
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $arg = shift;
+	return $self->{endian} unless(defined($arg));
+	if($arg =~ m/(LE|BE)/i)
+	{
+		my $endian = uc($1);
+		$self->{endian} = $endian;
+		# Used by 'pack' to generate binary strings.
+		$self->{packprefix} = "V" if($endian eq "LE");
+		$self->{packprefix} = "N" if($endian eq "BE");
+	}
+	return $self->{endian};
+}
+
+# This is the fingerprint.
+sub TypeField
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $arg = shift;
+	$self->{fingerprint} = $arg if(defined($arg));
+	return $self->{fingerprint};
+}
+
+sub FileVersion
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $arg = shift;
+	# Should we be testing for a numeric value?
+	$self->{fileversion} = $arg if(defined($arg));
+	return $self->{fileversion};
+}
+
+sub FileFlags
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $arg = shift;
+	$self->{fileflags} = $arg if(defined($arg));
+	return $self->{fileflags};
+}
+
+# How many feature flag objects have we got?
+sub NumRecords
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $arg = shift;
+	$self->{numrecords} += $arg if(defined($arg));
+	return $self->{numrecords};
+}
+
+
+sub LsdOffset
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $arg = shift;
+	$self->{lsdoffset} = $arg if(defined($arg));
+	return $self->{lsdoffset};
+}
+
+sub LsdSize
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $arg = shift;
+	$self->{lsdsize} = $arg if(defined($arg));
+	return $self->{lsdsize};
+}
+
+# Create a binary string containing the header information for the
+# feature manager data file based on the various fields in this object.
+sub CreateBinaryHeader
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $hdrstring;
+
+	# Get the letter for packing information with 'pack' into a binary form.
+	my $pack16 = lc($self->{packprefix});
+	my $pack32 = uc($self->{packprefix});
+	
+	# Get header information..
+	my $typefield = $self->TypeField();
+	my $fileversion = $self->FileVersion();
+	my $fileflags = $self->FileFlags();
+	my $numrecords = $self->NumRecords();
+	my $lsdoffset = $self->LsdOffset();
+	my $lsdsize = $self->LsdSize();
+
+	# Write the 'type' field out. This is 'feat'. Would this be different on
+	# big-endian systems?
+	$hdrstring = $typefield;
+
+	# Now the file version number. A 16-bit value.. Will this cause trouble
+	# if the shifted value is signed?
+	$hdrstring .= pack($pack16 . "1", $fileversion);
+
+	# Now the file flags. Another 16-bit value..
+	$hdrstring .= pack($pack16 . "1", $fileflags);
+
+	# Now the number of listed features - a 32-bit value.
+	$hdrstring .= pack($pack32 . "1", $numrecords);
+
+	# Now the number of listed features - a 32-bit value.
+	$hdrstring .= pack($pack32 . "1", $lsdoffset);
+
+	# Now the number of listed features - a 32-bit value.
+	$hdrstring .= pack($pack32 . "1", $lsdsize);
+
+	# Now the 3 reserved words
+	$hdrstring .= pack($pack32 . "3", (0, 0, 0));
+
+	return $hdrstring;
+}
+
+sub CreateImageHdr
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	#my $partid = shift;
+	#return -1 unless(defined($partid));
+
+	# Add fingerprint, 1st reserved word and format version
+	my $imghdr = pack "V4", (0x5F524348, 0x54524150, 0x00000000, 0x00000001);
+	# Add space for image size, timestamp, 2nd reserved word
+	$imghdr .= pack "V3", (0x00000000, time, 0x00000000);
+	# Add space for payload checksum, HCR Payload constants: UID and 0x0 flags
+    $imghdr .= pack "V3", (0x00000000, 0x10286AB8, 0x00000000);
+    #Reserved space
+    $imghdr .= pack "x216", (0x00000000);
+ 
+    return $imghdr;
+}
+
+sub WriteToImage
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $imgfile = shift;
+	return -1 unless(defined($imgfile));
+	my $datfile = shift;
+	return -1 unless(defined($datfile));
+	#my $partid = shift;
+	#return -1 unless(defined($partid));
+	my $rc = 0;
+	
+    open IMGFILE, "> $imgfile" or die "Couldn't open file '$imgfile' for writing.\n";
+	binmode IMGFILE;
+   
+ 	syswrite(IMGFILE, $self->CreateImageHdr(), 256);	
+ 	
+    open DATFILE, "$datfile" or die "Couldn't open file '$datfile' for reading.\n";
+	binmode DATFILE;
+	# print FILE $self->BinaryContent();
+	
+    #my $wordsum = 0x1200000000;
+    #my $wordsum = Math::BigInt->new("0x0220100123");
+    #printf("test: %x\n", $wordsum->external();
+
+	my $imgsize = 256;
+	my $word;
+	printf("-reading image:\n")  if ($mhd::otrace);
+	while (sysread (DATFILE, $word, 4)) {
+	    #printf ("%08x ",$word)  if ($mhd::otrace);
+        my $iword = unpack("V" , $word);
+	    printf ("%08x ",$iword)  if ($mhd::otrace);
+        $rc = syswrite (IMGFILE, $word, 4);
+        die "error: ($rc) failed to write datfile word into imgfile.\n" if ($rc != 4);
+	    #$wordsum->badd($iword);
+        $imgsize += 4;
+	    print "\n" if (($mhd::otrace) && ($imgsize%16==0));
+        }
+    print "\n" if ($mhd::otrace);
+    # ordsum: 0x". $wordsum ."\n" if ($mhd::otrace);
+	my $checksum = 0x12345678;
+	close DATFILE;
+	
+	printf("-image size: %d, checksum: 0x%08x", $imgsize, $checksum) if ($mhd::otrace);
+	
+	$rc = sysseek(IMGFILE, 16, 0);
+	die "error: ($rc) failed to seek in image to write header.\n" if ($rc != 16);
+
+	# Write out the image size	
+	my $imginfo1 = pack "V1", ($imgsize);
+	$rc = syswrite(IMGFILE, $imginfo1, 4);
+	die "error: ($rc) failed to write image size/checksum to image header.\n" if ($rc != 4);
+
+	$rc = sysseek(IMGFILE, 28, 0);
+	die "error: ($rc) failed to seek in image to write header.\n" if ($rc != 28);
+	
+	# Write out the image checksum 
+	my $imginfo2 = pack "V1", ($checksum);
+	$rc = syswrite(IMGFILE, $imginfo2, 4);
+	die "error: ($rc) failed to write image size/checksum to image header.\n" if ($rc != 4);
+  
+	close IMGFILE; 	
+	
+    return 0;
+}
+
+# Writes the binary file specified as an argument with the content of this
+# and contained feature flag and dsr objects.
+sub WriteToFile
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $file = shift;
+	return undef unless(defined($file));
+    open FILE, "> $file" or die "Couldn't open file '$file' for writing.\n";
+	binmode FILE;
+	print FILE $self->BinaryContent();
+	
+	close FILE;
+	return 0;
+}
+
+
+# Create the binary equivalent of the internal data and return it as a
+# string.
+sub BinaryContent
+{
+	my $self = shift;
+	return undef unless(ref($self));
+
+    # Get the feature flag entries.. This is an array reference.
+	# For each one append the binary representation of the information
+	# contained.
+	my $records = "";
+    my $lsd = "";
+   	my $ffs_ref = $self->SettingRecords();
+	my $ff;
+
+    my $count = 0;
+	foreach $ff (@$ffs_ref)
+	{
+	    $count++;
+	    printf("-encoding record: %04d (0x%08x:%04d)\n", $count, $ff->CUID(), $ff->EID());
+		$records .= $ff->GetRecHdrBinary(length ($lsd));
+	    my $stype = $ff->Type();
+    	if (($stype & 0xffff0000) && ($ff->Length() > 0)) {
+		    $lsd .= $ff->GetRecLsdBinary();
+            }
+	}
+
+    $self->LsdOffset(32+length ($records));     # header size 32
+    $self->LsdSize(length ($lsd));
+    
+	my $header = $self->CreateBinaryHeader();
+
+	return $header . $records . $lsd;
+}
+
+# Return a reference to the 'feature flags' array.
+sub SettingRecords
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	return $self->{settingrecords};
+}
+
+# Add a Feature Flag object. Perhaps there should be code to check if we
+# already know about this feature flag. (i.e check the uid against the ones
+# we have).
+sub AddSettingRecord
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $arg = shift;
+	die "panic: method 'AddSettingRecord' requires a 'HCRrec' object as argument.\n"
+   	    unless(ref($arg) eq  "HCRrec");
+   	
+	push @{$self->SettingRecords()}, $arg;
+	$self->NumRecords(1);
+	
+    return 0;
+}
+
+
+1;
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/hcrmd.bat
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32utils/hcrscripts/hcrmd.bat	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,19 @@
+@rem
+@rem Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
+@rem All rights reserved.
+@rem This component and the accompanying materials are made available
+@rem under the terms of the License "Eclipse Public License v1.0"
+@rem which accompanies this distribution, and is available
+@rem at the URL "http://www.eclipse.org/legal/epl-v10.html".
+@rem
+@rem Initial Contributors:
+@rem Nokia Corporation - initial contribution.
+@rem
+@rem Contributors:
+@rem
+@rem Description:
+@rem
+
+@echo off
+
+@perl -S -I%EPOCROOT%epoc32/tools/hcr %EPOCROOT%epoc32/tools/hcr/makehcrdat.pl %*
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/hcrrec.pm
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32utils/hcrscripts/hcrrec.pm	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,437 @@
+#!perl -w
+#
+# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
+# All rights reserved.
+# This component and the accompanying materials are made available
+# under the terms of the License "Eclipse Public License v1.0"
+# which accompanies this distribution, and is available
+# at the URL "http://www.eclipse.org/legal/epl-v10.html".
+#
+# Initial Contributors:
+# Nokia Corporation - initial contribution.
+#
+# Contributors:
+#
+# Description:
+#
+use strict;
+
+#
+# A simple class to manage feature flags for a feature set data file.
+#
+package HCRrec;
+
+my %typemap = (
+    Int32 =>       0x00000001,
+    Int16 =>       0x00000002,    
+    Int8 =>        0x00000004,
+    Bool =>        0x00000008,    
+    UInt32 =>      0x00000010,
+    UInt16 =>      0x00000020,    
+    UInt8 =>       0x00000040,
+    LinAddr =>     0x00000100,
+    BinData =>     0x00010000,
+    Text8 =>       0x00020000,    
+	ArrayInt32 =>  0x00040000,
+	ArrayUInt32 => 0x00080000,
+    Int64 =>       0x01000000,
+    UInt64 =>      0x02000000,    
+);
+my %maptype = reverse %typemap;
+my %lsdtype2packmap = (
+    0x00010000 => "C",
+    0x00020000 => "a",    
+    0x01000000 => "C",
+    0x02000000 => "C",    
+);
+
+# Create a feature flag object.
+sub new
+{
+	my $arg = shift;
+	my $class = ref($arg) || $arg;
+
+	my $self = {
+			     cuid => 0,              # 4 bytes
+			     eid => 0,               # 4 bytes
+			     type => 0,              # 4 bytes
+			     flagword => 0x0000,     # 2 bytes 
+                 valueset => 0,
+                           
+			     intvalue => 0,           # 4 bytes
+			     strvalue => "",          # array of chars
+			     binvalue => [],          # array of bytes
+			     arrvalue => [],		  # array of 4 byte integers
+			     
+   				 endian => "LE",
+			   };
+ 
+	bless $self, $class;
+	return $self;
+}
+
+sub Endian
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $arg = shift;
+	return $self->{endian} unless(defined($arg) and $arg =~ m/(^BE$|^LE$)/i);
+	$self->{endian} = lc($1);
+	return $self->{endian};
+}
+
+# Return a twelve byte string 'feature flag' information.
+sub GetRecHdrBinary
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	
+	my $lsd_size = shift;
+	
+	my $stype = $self->Type(); 
+	my @hdrarr = ( $self->CUID(), $self->EID(), $stype, $self->Flags(),
+                $self->SizeInBytes() );
+    
+	# Decide whether we want big or little endian output.
+	# According to the documentation, 'V', 'N' are GUARANTEED to be 32-bit.
+	my $packstring;
+	if($self->Endian() eq "BE") {
+	    $packstring = "N3n2N";
+        }
+    else {
+        $packstring = "V3v2V"; # Little endian.
+        }
+        
+    #
+    # Could add range checks here for 8-bit and 16-bit types.
+    # However would stop negative test cases from being generated.
+    # Do it later.
+    #
+    
+    if ($stype & 0xffff) {
+        print "Writing integer\n" if ($mhd::otrace);
+        push @hdrarr, $self->IntValue();
+        }
+    
+    if ($stype & 0xffff0000) {
+        if ($self->Length() > 0) {
+            print "Writing offset: " . $lsd_size . "\n" if ($mhd::otrace);
+            push @hdrarr, $lsd_size;
+            }
+        else {
+            print "Writing null offset: 0\n" if ($mhd::otrace);
+            push @hdrarr, 0;            
+            }
+        }
+
+	my $hdr_string = pack $packstring, @hdrarr;
+	
+	return $hdr_string;
+}
+
+# Return a twelve byte string 'feature flag' information.
+# Assumes Little Endian output!
+sub GetRecLsdBinary
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	
+    my $value = "";
+    my $valuelen = $self->Length();
+    my $vallen = $valuelen;
+    #print "vallen before:" . $vallen . "\n";
+    $vallen = ($valuelen+3)&0xfffc if ($valuelen%4) ;
+    #print "vallen after:" . $vallen . "\n";
+	my $valtype = $self->{type};
+
+    # String
+    if ($valtype & 0x00020000) {
+	    my $packstr = $lsdtype2packmap{$valtype} . $vallen;
+	    printf ("packstr:%s\n", $packstr) if($mhd::otrace);
+        printf ("strvalue:%s\n", $self->{strvalue}) if($mhd::otrace);
+        $value = pack $packstr,  $self->{strvalue} ;
+        }
+    # Binary Data
+    elsif ($valtype & 0x00010000) {
+        for (my $c=0;  $c < $valuelen; $c++) {
+            my $byte = $self->{binvalue}[$c];
+            $value .= pack $lsdtype2packmap{$valtype}, $byte;
+            $vallen--;     
+        }
+        while ($vallen > 0) {
+            $value .= pack "C", ( 0x00 );
+            $vallen--;
+            }
+    }
+    # 64bit quantity
+    elsif ($valtype & 0x03000000) {
+        die "error: 64 bit integer missing hex binvalues\n" if (! exists $self->{binvalue}[7]);
+        $value  = pack $lsdtype2packmap{$valtype}, $self->{binvalue}[0];
+        $value  .= pack $lsdtype2packmap{$valtype}, $self->{binvalue}[1];
+        $value  .= pack $lsdtype2packmap{$valtype}, $self->{binvalue}[2];
+        $value  .= pack $lsdtype2packmap{$valtype}, $self->{binvalue}[3];
+        $value  .= pack $lsdtype2packmap{$valtype}, $self->{binvalue}[4];
+        $value  .= pack $lsdtype2packmap{$valtype}, $self->{binvalue}[5];
+        $value  .= pack $lsdtype2packmap{$valtype}, $self->{binvalue}[6];
+        $value  .= pack $lsdtype2packmap{$valtype}, $self->{binvalue}[7];
+        }
+    # array of 32bit quantity
+    elsif ($valtype & 0x000C0000) {
+        for (my $c=0;  $c < $valuelen; $c++) {
+            my $int = $self->{arrvalue}[$c];
+            $value .= pack "V", $int;
+            $vallen--;     
+            }
+	}    
+    else {
+        die "panic: proramming error!!";
+    }
+    
+	return $value;
+	}
+
+# A single 32-bit number.
+sub CUID
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $uid = shift;
+	return $self->{cuid} unless(defined($uid));
+	my $uidv = hex($uid);
+	$self->{cuid} = $uidv;
+	return $uidv;
+}
+
+# A single 32-bit number.
+sub EID
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $id = shift;
+	return $self->{eid} unless(defined($id));
+	my $idv = int($id);
+	$self->{eid} = $idv;
+	return $idv;
+}
+
+sub Type
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $type = shift;
+	return $self->{type} unless(defined($type));
+	my $enum = $typemap{$type};
+	#print "--->Defined\n" if (defined $enum);
+	#print "--->NOT Defined\n" if (! defined $enum);
+	die "error: unknown setting type found in input file\n" if (! defined $enum);
+   	$self->{type} = $enum;
+	return $enum;
+}
+
+sub TypeName
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	return "Undefined Type" if (! exists $maptype{$self->{type}});
+	return $maptype{$self->{type}};
+}
+
+sub Flags
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $flags = shift;
+	return $self->{flagword} unless(defined($flags));
+	my $vf = hex($flags);
+	$self->{flagword} = $vf;
+	return $vf;
+}
+
+sub Length
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $len = shift;
+	die "panic: Length() does not take an argument!\n" if (defined($len));
+	
+	my $length = 0;
+	if ($self->{type} & 0x00020000) {
+        $length = length ($self->{strvalue});
+        }
+    elsif ($self->{type} & 0x03010000) {
+	    my $array_ref = $self->{binvalue};
+	    my @array = @$array_ref;
+	    $length = $#array+1;
+	    }
+    elsif ($self->{type} & 0x000C0000) {
+	    my $array_ref = $self->{arrvalue};
+	    my @array = @$array_ref;
+	    $length = $#array+1;
+	    #printf ("arrval length %d %d\n",  length ($self->{arrval}), $length);
+	    }
+	else {
+	    $length = 0;
+        }
+	return $length;	
+}
+
+sub SizeInBytes
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $len = shift;
+	die "panic: Length() does not take an argument!\n" if (defined($len));
+	
+	my $size = 0;
+	if ($self->{type} & 0x00020000) {
+        $size = length ($self->{strvalue});
+        }
+    elsif ($self->{type} & 0x03010000) {
+	    my $array_ref = $self->{binvalue};
+	    my @array = @$array_ref;
+	    $size = $#array+1;
+	    }
+    elsif ($self->{type} & 0x000C0000) {
+	    my $array_ref = $self->{arrvalue};
+	    my @array = @$array_ref;
+	    $size = ($#array+1)*4;
+	    #printf ("arrval length %d %d\n",  length ($self->{arrval}), $length);
+	    }
+	else {
+	    $size = 0;
+        }
+	return $size;	
+}
+
+sub IsValid
+{
+	my $self = shift;
+	return undef unless(ref($self));
+
+    if (($self->{cuid} == 0) || ($self->{eid} == 0) ||
+        ($self->{type} == 0) || ($self->{flagword} != 0) ||
+        ($self->IsValueSet() == 0)) {
+        return 0;
+        }    
+    
+    #Record valid if we reach here
+    return 1;    
+}
+
+sub IsValueSet
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	return $self->{valueset};
+}
+
+sub MarkValueSet
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	$self->{valueset} = 1;
+}
+
+sub IntValue
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $value = shift;
+	if (defined($value)) {
+        my $int = int($value);
+        $self->{intvalue} = $int;
+        $self->MarkValueSet();
+        }
+	return $self->{intvalue};
+}
+
+sub HexValue
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $value = shift;
+	return $self->{intvalue} unless(defined($value));
+	my $int = hex($value);
+	$self->{intvalue} = $int;
+	$self->MarkValueSet();
+    return $int;
+}
+
+sub StrValue
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $value = shift;
+	return $self->{strvalue} unless(defined($value));
+	#printf ("strlen before %d\n", length ($self->{strvalue}));	
+    $self->{strvalue} .= $value;
+	#printf ("strlen after %d\n",  length ($self->{strvalue}));
+	$self->MarkValueSet();
+    return $value;
+}
+
+sub ArrValue
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $value = shift;
+
+	return $self->{arrvalue} unless(defined($value));
+
+    my $int = int($value);
+	my $index = $self->Length();
+
+	$self->{arrvalue}[$index] = $int; # Increments the array size as well as appending item
+	$index*=4; 
+
+	printf ("warning: array value larger than HCR maximum (512 bytes): %d\n", $index) if ($index > 512);    
+	$self->MarkValueSet();
+
+    return $self->{arrvalue};
+}
+
+sub BinValue
+{
+	my $self = shift;
+	return undef unless(ref($self));
+	my $value = shift;
+	
+	return $self->{binvalue} unless(defined($value));
+
+    my @hwords = split(/\s/,$value);
+    shift @hwords if ($hwords[0] eq "");
+    my $hwordslen = scalar(@hwords);  
+
+    #printf("(len:%d)(0:%04x 1:%04x last:%04x)\n", $hwordslen, hex($hwords[0]), hex($hwords[1]), hex($hwords[$hwordslen-1])) if ($mhd::trace);
+    
+    my $index = $self->Length();
+	#printf ("binlen before %d\n", $index);
+         
+    #print "Index: " . $index . "\n";
+    foreach my $word (@hwords) {
+        if (length ($word) == 2) {
+	        $self->{binvalue}[$index] = hex($word);
+            }
+        else {
+            die "error: hexadecimal value '$word' too short/large for 8-bit integer\n";
+            }
+
+
+	   #$self->{binvalue}[$index] = $mint;
+	   #printf("%d: %04x\n", $count, $self->{binvalue}[$count]);
+       $index++;	  
+	   }
+	  
+
+	#printf ("binlen after %d\n", $index);
+            
+    printf ("warning: binary value larger than HCR maximum (512 bytes): %d\n", $index) if ($index > 512);
+    $self->MarkValueSet();            
+	return $self->{binvalue};
+}
+
+
+# ###########################################################################
+
+1;
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/hcrscripts.inf
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32utils/hcrscripts/hcrscripts.inf	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,31 @@
+// Copyright (c) 2008-2009 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// Hardware Configuration Respoitory Scripts and Utils
+// Convienence inf file, to build:  bldmake -f hcrscripts.inf bldfiles
+// Scripts not part of the offical OS build, hence these are unsupported.
+// Available for developer adhoc-testing only until offical HCR tools available.
+//
+
+/**
+@file
+Hardware Configuration Repository Scripts
+*/
+
+PRJ_EXPORTS
+
+./hcrmd.bat								/epoc32/tools/hcrmd.bat
+./hcrdat.pm								/epoc32/tools/hcr/hcrdat.pm
+./hcrrec.pm								/epoc32/tools/hcr/hcrrec.pm	
+./makehcrdat.pl							/epoc32/tools/hcr/makehcrdat.pl
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/makehcrdat.pl
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32utils/hcrscripts/makehcrdat.pl	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,219 @@
+#!perl -w
+#
+# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
+# All rights reserved.
+# This component and the accompanying materials are made available
+# under the terms of the License "Eclipse Public License v1.0"
+# which accompanies this distribution, and is available
+# at the URL "http://www.eclipse.org/legal/epl-v10.html".
+#
+# Initial Contributors:
+# Nokia Corporation - initial contribution.
+#
+# Contributors:
+#
+# Description:
+# This simple script makes a binary HCR data file from a text input file
+#
+use strict;
+
+use HCRdat;
+use HCRrec;
+
+package mhd;
+
+#
+# Find out what file the user is interested in..
+# Make sure it's specified and exists.
+#
+$mhd::trace = 0;
+$mhd::otrace = 0;
+
+if (@ARGV < 2 || @ARGV > 4) {
+    die "\nUsage: hcrmd.bat <source_textfile> <dest_datfile> [-i]\n";
+    }
+
+my $textfile = shift @ARGV;
+my $datfile  = shift @ARGV;
+
+my $do_create_image = 0;
+my $opt_i = shift @ARGV;
+#my $partid = 0x10000005;
+if (defined($opt_i)) {
+    $do_create_image = 1 if ($opt_i eq "-i");
+    die "error: unknown command option\n" if ($opt_i ne "-i");
+    #my $i_no = shift @ARGV;
+    #$partid = hex($i_no) if (defined($i_no)); 
+    #printf("partitionid: 0x%x\n", $partid)
+    }
+
+
+print "\n    HCR Binary Data File Generator, version v0.1\n";
+print "    Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.\n\n";
+print "-input: $textfile\n" if($mhd::trace);
+print "-output: $datfile\n" if($mhd::trace);
+
+die "error: Specifed source_textfile not found!" unless(-f $textfile);
+#die "error: Specified dest_binfile '$datfile' already exists!" if(-e $datfile);
+
+printf "\nReading input file... $textfile\n";
+
+printf "-opening text file\n" if($mhd::trace);
+my $tfh;
+open($tfh, "<$textfile");
+
+printf "-started conversion...\n"  if($mhd::trace);
+my $datobj = HCRdat->new();
+my $inrec = 0;
+my $ln = 0;
+my $recobj;
+
+while (<$tfh>)
+    {
+    $ln++;
+    if ($_ =~ '^\s*#') {
+        printf "-comment\n" if($mhd::trace);
+        }
+    elsif ($_ =~ '^@') {
+        die "error: Syntax error line $ln: New record started before previous one is closed" if($inrec > 0);
+        printf "-start\n" if($mhd::trace);
+        $inrec = 1;
+        $recobj = HCRrec->new();
+        }
+    elsif ($_ =~ '^\.') {
+        die "error: Syntax error line $ln: Record closed before a new record has been opened" if($inrec == 0); 
+        printf "-end\n" if($mhd::trace);
+        if ($recobj->IsValid()) {
+            $datobj->AddSettingRecord($recobj);
+            }
+        else {
+            die "error: Record after record " . $datobj->NumRecords() . " completed but not valid, missing or has =0  fields?\n";
+            }
+        $inrec = 0;
+        }
+    elsif ($_ =~ '^\s*$') {
+        printf "-blank\n" if($mhd::trace);
+        }
+    elsif ($_ =~ '^\s*cuid:\s') {
+        print "--cuid " if($mhd::trace);
+        my @hwords = split(/\s+/,$_);
+        die "error: 'cuid:' line incorrectly formed" if (scalar(@hwords) != 2); 
+
+        $recobj->CUID($hwords[1]);
+        printf("=0x%08x\n", $recobj->CUID()) if($mhd::trace);
+        }
+    elsif ($_ =~ '^\s*eid:\s') {
+        print "--eid " if($mhd::trace);
+        my @hwords = split(/\s+/,$_);
+        die "error: 'eid:' line incorrectly formed" if (scalar(@hwords) != 2); 
+
+        $recobj->EID($hwords[1]);
+        print "=".($recobj->EID())."\n" if($mhd::trace);  
+        }
+    elsif ($_ =~ '^\s*type:\s') {
+        print "--type " if($mhd::trace);
+        my @hwords = split(/\s+/,$_);
+        die "error: 'type:' line incorrectly formed" if (scalar(@hwords) != 2); 
+        
+        $recobj->Type($hwords[1]); 
+        printf("=0x%08x (%s)\n", $recobj->Type(), $recobj->TypeName()) if($mhd::trace);
+        }
+    elsif ($_ =~ '^\s*flags:\s') {
+        print "--flags " if($mhd::trace);
+        my @hwords = split(/\s+/,$_);
+        die "error: 'flags:' line incorrectly formed" if (scalar(@hwords) != 2);
+        
+        $recobj->Flags($hwords[1]);
+        printf ("=0x%x\n", $recobj->Flags()) if($mhd::trace);  
+        printf ("warning: flag length value greater than 2-bytes\n") if ($recobj->Flags() > 0xffff);
+        }
+    elsif ($_ =~ '^\s*intval:\s') {
+        print "--intval " if($mhd::trace);
+        my @hwords = split(/\s+/,$_);
+        die "error: 'intval:' line incorrectly formed" if (scalar(@hwords) != 2); 
+
+        $recobj->IntValue($hwords[1]);
+        printf("=%d (0x%x)\n", $recobj->IntValue(), $recobj->IntValue()) if($mhd::trace);  
+        }
+    elsif ($_ =~ '^\s*hexval:\s') {
+        print "--hexval " if($mhd::trace);
+        my @hwords = split(/\s+/,$_);
+        die "error: 'hexval:' line incorrectly formed" if (scalar(@hwords) != 2); 
+
+        $recobj->HexValue($hwords[1]);
+        printf("=%d (0x%x)\n", $recobj->IntValue(), $recobj->IntValue()) if($mhd::trace);  
+        }
+    elsif ($_ =~ '^\s*arrval:\s') {
+        print "--arrval " if($mhd::trace);
+        my @hwords = split(/\s+/,$_);
+        die "error: 'arrval:' line incorrectly formed" if (scalar(@hwords) != 2); 
+        
+		print  $hwords[1]."\n" if ($mhd::trace);
+        $recobj->ArrValue($hwords[1]);  
+        }
+    elsif ($_ =~ '^\s*strval:\s') {
+        print "--strval " if($mhd::trace);
+        my @hwords = split(/\"/,$_);
+        die "error: 'strval:' line incorrectly formed" if (scalar(@hwords) != 3); 
+
+        my $strval_size = $recobj->Length();
+        $recobj->StrValue($hwords[1]);
+        
+        printf("=\"%s\"\n", substr($recobj->StrValue(), $strval_size)) if($mhd::trace);  
+        }
+    elsif ($_ =~ '^\s*binval:\s') {
+        print "--binval " if($mhd::trace);
+        my @hwords = split(/:/,$_);
+        die "error: 'binval:' line incorrectly formed" if (scalar(@hwords) < 2); 
+
+        my $binval_size = $recobj->Length();
+        $recobj->BinValue($hwords[1]);
+        
+        my $binval_ref = $recobj->BinValue();
+        my @binval = @$binval_ref;
+        
+        printf("(%d) =", $#binval+1) if($mhd::trace);
+        my $uint16 = $binval_size;
+        for (; $uint16 < @binval; $uint16++) {
+            printf("%02x ", $binval[$uint16]) if($mhd::trace);
+            } 
+
+        print "\n" if($mhd::trace);
+        }
+    elsif ($_ =~ '') {
+        }
+    else {
+        die "error: unknown line type '$_'" 
+#        print $_  if($mhd::trace);
+        }
+    }
+
+close $tfh;
+
+printf "\nGenerating output file... $datfile\n";
+
+printf "-creating binary data file\n"  if($mhd::otrace);
+if ($datobj->WriteToFile($datfile.".tmp") != 0) {
+    die "error: failed to write to dest_binfile";
+    }
+    
+printf "-renaming file to temp file to $datfile\n"  if($mhd::otrace);
+rename ($datfile.".tmp", $datfile);
+
+printf "-file header written:\n"  if($mhd::otrace);
+$datobj->ShowHeader() if($mhd::otrace);
+
+if ($do_create_image) {
+    my $imgfile = $datfile . ".img";
+    print "\nGenerating partition image... ".  $imgfile . "\n";
+
+    if ($datobj->WriteToImage($imgfile, $datfile) != 0) {
+        die "error: failed to write to image file $imgfile";
+        }
+    }
+
+print "\nDone.\n";
+exit 0;
+
+
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/test/array_hcrfile.dat
Binary file kerneltest/e32utils/hcrscripts/test/array_hcrfile.dat has changed
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/test/array_hcrfile.dat.img
Binary file kerneltest/e32utils/hcrscripts/test/array_hcrfile.dat.img has changed
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/test/array_test.txt
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32utils/hcrscripts/test/array_test.txt	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,54 @@
+#------------------------------------------------------------------------------
+# Large Array Settings Test file for use with the 'hcrmd' tool.
+#
+
+#------------------------------------------------------------------------------
+# Signed Integer array 32-bit tests
+#
+@
+cuid: 0xee000001
+eid:  121
+type: ArrayInt32
+flags: 0x0000
+arrval: 2147483647
+arrval: 2147483647
+.
+@
+cuid: 0xee000001
+eid:  122
+type: ArrayInt32
+flags: 0x0000
+arrval: 1
+.
+@
+cuid: 0xee000001
+eid:  123
+type: ArrayInt32
+flags: 0x0000
+arrval: -2147483648
+arrval: -2147483648
+arrval: -2147483648
+.
+
+
+#------------------------------------------------------------------------------
+# Unsigned Integer array 32-bit tests
+#
+@
+cuid: 0xee000004
+eid:  131
+type: ArrayUInt32
+flags: 0x0000
+arrval: 4294967295
+arrval: 4294967295
+arrval: 4294967295
+arrval: 4294967295
+.
+
+@
+cuid: 0xee000004
+eid:  132
+type: ArrayUInt32
+flags: 0x0000
+arrval: 0
+.
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/test/integer_hcrfile.dat
Binary file kerneltest/e32utils/hcrscripts/test/integer_hcrfile.dat has changed
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/test/integer_hcrfile.dat.img
Binary file kerneltest/e32utils/hcrscripts/test/integer_hcrfile.dat.img has changed
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/test/integer_test.txt
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32utils/hcrscripts/test/integer_test.txt	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,205 @@
+#------------------------------------------------------------------------------
+# Integer Setting Test file for use with the 'hcrmd' tool.
+#
+
+#------------------------------------------------------------------------------
+# Signed Integer 32-bit tests
+#
+@
+cuid: 0xff000001
+eid:  1
+type: Int32
+flags: 0x0000
+intval: 2147483647
+.
+@
+cuid: 0xff000001
+eid:  2
+type: Int32
+flags: 0x0000
+intval: 0
+.
+@
+cuid: 0xff000001
+eid:  3
+type: Int32
+flags: 0x0000
+intval: -2147483648
+.
+
+#------------------------------------------------------------------------------
+# Signed Integer 16-bit tests
+#
+@
+cuid: 0xff000002
+eid:  11
+type: Int16
+flags: 0x0000
+intval: 32767
+.
+@
+cuid: 0xff000002
+eid:  12
+type: Int16
+flags: 0x0000
+intval: 0
+.
+@
+cuid: 0xff000002
+eid:  13
+type: Int16
+flags: 0x0000
+intval: -32768
+.
+
+#------------------------------------------------------------------------------
+# Signed Integer 8-bit tests
+#
+@
+cuid: 0xff000003
+eid:  21
+type: Int8
+flags: 0x0000
+intval: 127
+.
+
+@
+cuid: 0xff000003
+eid:  22
+type: Int8
+flags: 0x0000
+intval: 0
+.
+@
+cuid: 0xff000003
+eid:  23
+type: Int8
+flags: 0x0000
+intval: -128
+.
+
+#------------------------------------------------------------------------------
+# Unsigned Integer tests
+#
+@
+cuid: 0xff000004
+eid:  31
+type: UInt32
+flags: 0x0000
+intval: 4294967295
+.
+@
+cuid: 0xff000004
+eid:  32
+type: UInt16
+flags: 0x0000
+intval: 65535
+.
+@
+cuid: 0xff000004
+eid:  33
+type: UInt8
+flags: 0x0000
+intval: 255
+.
+
+#------------------------------------------------------------------------------
+# Boolean tests
+#
+@
+cuid: 0xff000005
+eid:  41
+type: Bool
+flags: 0x0000
+intval: 1
+.
+@
+cuid: 0xff000005
+eid:  42
+type: Bool
+flags: 0x0000
+intval: 0
+.
+
+
+#------------------------------------------------------------------------------
+# Linear Addrress tests
+#
+@
+cuid: 0xff000006
+eid:  51
+type: LinAddr
+flags: 0x0000
+hexval: 0x80000000
+.
+@
+cuid: 0xff000006
+eid:  52
+type: LinAddr
+flags: 0x0000
+hexval: 0x01008004
+.
+@
+cuid: 0xff000006
+eid:  53
+type: LinAddr
+flags: 0x0000
+hexval: 0x00000000
+.
+
+
+#------------------------------------------------------------------------------
+# Synatx tests
+#
+
+# Tool should cope with these
+@
+cuid: 0xffff0001
+eid:  101
+type: Int32
+intval: 1889025
+.
+@
+cuid: 0xffff0002
+eid:  102
+type: Int32
+intval: 5889025
+.
+
+# Missing fields - Tool should abort for these records
+# 
+#@
+#cuid: 0xffff0003
+#eid:  103
+#type: Int32
+#.
+#@
+#cuid: 0xffff0004
+#eid:  104
+#.
+#@
+#cuid: 0xffff0005
+#.
+#@
+#.
+
+# Incorrect Types - Tool should abort for these records
+# 
+#@
+#cuid: 0xffff0006
+#eid:  106
+#type: int32
+#intval: 1889025
+#.
+#@
+#cuid: 0xffff0007
+#eid:  107
+#type: Int
+#intval: 1889025
+#.
+#@
+#cuid: 0xffff0008
+#eid:  108
+#type: Int32ab
+#intval: 1889025
+#.
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/test/large_hcrfile.dat
Binary file kerneltest/e32utils/hcrscripts/test/large_hcrfile.dat has changed
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/test/large_hcrfile.dat.img
Binary file kerneltest/e32utils/hcrscripts/test/large_hcrfile.dat.img has changed
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/hcrscripts/test/large_test.txt
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32utils/hcrscripts/test/large_test.txt	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,378 @@
+#------------------------------------------------------------------------------
+# Large Settings Test file for use with the 'hcrmd' tool.
+#
+
+#------------------------------------------------------------------------------
+# BinData tests
+#
+
+@
+cuid: 0x000000ff
+eid:  13
+type: BinData
+flags: 000000
+binval: 0E
+.
+@
+cuid: 0x000000ff
+eid:  23
+type: BinData
+flags: 000000
+binval: 0E 1F 
+.
+@
+cuid: 0x000000ff
+eid:  33
+type: BinData
+flags: 000000
+binval: 0E 1F BA
+.
+@
+cuid: 0x000000ff
+eid:  43
+type: BinData
+flags: 000000
+binval: 0E 1F BA 11
+.
+@
+cuid: 0x000000ff
+eid:  53
+type: BinData
+flags: 000000
+binval: 0E 1F BA 11 1F
+.
+@
+cuid: 0x000000ff
+eid:  63
+type: BinData
+flags: 000000
+binval: FF FF BA 0E 00 B4 
+.
+@
+cuid: 0x000000ff
+eid:  64
+type: BinData
+flags: 000000
+binval: FF FF BA 0E 00 B4 2E
+.
+@
+cuid: 0x000000ff
+eid:  73
+type: BinData
+flags: 000000
+binval: FF FF BA 0E 00 B4 2E AA
+.
+@
+cuid: 0x000000ff
+eid:  83
+type: BinData
+flags: 000000
+binval: FF FF BA 0E 00 B4 2E AA DD
+.
+@
+cuid: 0x000000ff
+eid:  93
+type: BinData
+flags: 000000
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F 
+binval: 74 20 62 65 20 72 75 6E 20 69 6E 20 44 4F 53 20 
+binval: 6D 6F 64 65 2E 0D 0D 0A 24 00 00 00 00 00 00 0F
+binval: 0E 1F BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68 
+binval: 69 73 20 70 72 6F 67 72 61 6D 11 11 22 22 00 FF
+.
+
+@
+cuid: 0x000000ff
+eid:  103
+type: BinData
+flags: 000000
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F 
+binval: 74 20 62 65 20 72 75 6E 20 69 6E 20 44 4F 53 20 
+binval: 6D 6F 64 65 2E 0D 0D 0A 24 00 00 00 00 00 00 0F
+binval: 0E 1F BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68 
+binval: 69 73 20 70 72 6F 67 72 61 6D 11 11 22 22 00 FF
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F 
+binval: 74 20 62 65 20 72 75 6E 20 69 6E 20 44 4F 53 20 
+binval: 6D 6F 64 65 2E 0D 0D 0A 24 00 00 00 00 00 00 0F
+binval: 0E 1F BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68 
+binval: 69 73 20 70 72 6F 67 72 61 6D 11 11 22 22 00 FF
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F 
+binval: 74 20 62 65 20 72 75 6E 20 69 6E 20 44 4F 53 20 
+binval: 6D 6F 64 65 2E 0D 0D 0A 24 00 00 00 00 00 00 0F
+binval: 0E 1F BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68 
+binval: 69 73 20 70 72 6F 67 72 61 6D 11 11 22 22 00 FF
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F 
+binval: 74 20 62 65 20 72 75 6E 20 69 6E 20 44 4F 53 20 
+binval: 6D 6F 64 65 2E 0D 0D 0A 24 00 00 00 00 00 00 0F
+binval: 0E 1F BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68 
+binval: 69 73 20 70 72 6F 67 72 61 6D 11 11 22 22 00 FF
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F 
+binval: 74 20 62 65 20 72 75 6E 20 69 6E 20 44 4F 53 20 
+binval: 6D 6F 64 65 2E 0D 0D 0A 24 00 00 00 00 00 00 0F
+binval: 0E 1F BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68 
+binval: 69 73 20 70 72 6F 67 72 61 6D 11 11 22 22 00 FF
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F 
+.
+
+@
+cuid: 0x000000ff
+eid:  113
+type: BinData
+flags: 000000
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F 
+binval: 74 20 62 65 20 72 75 6E 20 69 6E 20 44 4F 53 20 
+binval: 6D 6F 64 65 2E 0D 0D 0A 24 00 00 00 00 00 00 0F
+binval: 0E 1F BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68 
+binval: 69 73 20 70 72 6F 67 72 61 6D 11 11 22 22 00 FF
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F 
+binval: 74 20 62 65 20 72 75 6E 20 69 6E 20 44 4F 53 20 
+binval: 6D 6F 64 65 2E 0D 0D 0A 24 00 00 00 00 00 00 0F
+binval: 0E 1F BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68 
+binval: 69 73 20 70 72 6F 67 72 61 6D 11 11 22 22 00 FF
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F 
+binval: 74 20 62 65 20 72 75 6E 20 69 6E 20 44 4F 53 20 
+binval: 6D 6F 64 65 2E 0D 0D 0A 24 00 00 00 00 00 00 0F
+binval: 0E 1F BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68 
+binval: 69 73 20 70 72 6F 67 72 61 6D 11 11 22 22 00 FF
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F 
+binval: 74 20 62 65 20 72 75 6E 20 69 6E 20 44 4F 53 20 
+binval: 6D 6F 64 65 2E 0D 0D 0A 24 00 00 00 00 00 00 0F
+binval: 0E 1F BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68 
+binval: 69 73 20 70 72 6F 67 72 61 6D 11 11 22 22 00 FF
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F 
+binval: 74 20 62 65 20 72 75 6E 20 69 6E 20 44 4F 53 20 
+binval: 6D 6F 64 65 2E 0D 0D 0A 24 00 00 00 00 00 00 0F
+binval: 0E 1F BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68 
+binval: 69 73 20 70 72 6F 67 72 61 6D 11 11 22 22 00 FF
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F  
+binval: 0E 1F BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68 
+binval: 69 73 20 70 72 6F 67 72 61 6D 11 11 22 22 00 FF
+binval: FF FF BA 0E 00 B4 09 CD 21 B8 01 4C CD 21 54 68
+binval: 69 73 20 70 72 6F 67 72 61 6D 20 63 61 6E 6E 6F  
+.
+
+#------------------------------------------------------------------------------
+# Text8 tests
+#
+
+# Length field tests
+#
+@
+cuid: 0x11223301
+eid:  1
+type: Text8
+flags: 0x0000
+strval: "Hello World!!"   
+.
+@
+cuid: 0x11223302
+eid:  2
+type: Text8
+flags: 0x0000
+strval: "Hell"   
+.
+@
+cuid: 0x11223303
+eid:  3
+type: Text8
+flags: 0x0000
+strval: "Hello World!!    "   
+.
+
+# strval field tests
+#
+@
+cuid: 0x11223304
+eid:  1
+type: Text8
+flags: 0x0000
+strval: ""   
+.
+@
+cuid: 0x11223305
+eid:  5
+type: Text8
+flags: 0x0000
+strval: "012345678901234567890123456789ab012345678901234567890123456789ab012345678901234567890123456789ab012345678901234567890123456789ab"
+.
+
+@
+cuid: 0x11223306
+eid:  6
+type: Text8
+flags: 0x0000
+strval: "012345678901234567890123456789ab012345678901234567890123456789ab012345678901234567890123456789ab012345678901234567890123456789ab"
+strval: "012345678901234567890123456789ab012345678901234567890123456789ab012345678901234567890123456789ab012345678901234567890123456789bc"
+strval: "012345678901234567890123456789ab012345678901234567890123456789ab012345678901234567890123456789ab012345678901234567890123456789cd"
+strval: "012345678901234567890123456789ab012345678901234567890123456789ab012345678901234567890123456789ab012345678901234567890123456789de" 
+.
+
+
+# strval field and padding tests
+#
+@
+cuid: 0x11223311
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "A"   
+.
+@
+cuid: 0x11223312
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "We"  
+. 
+@
+cuid: 0x11223313
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "Car"   
+.
+@
+cuid: 0x11223314
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "Cake"   
+.
+@
+cuid: 0x11223315
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "1---A"
+.
+@
+cuid: 0x11223316
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "1---We"  
+. 
+@
+cuid: 0x11223317
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "1---Car"   
+.
+@
+cuid: 0x11223318
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "1---Cake"   
+.
+@
+cuid: 0x11223319
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "1---2---A"
+.
+@
+cuid: 0x1122331a 
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "1---2---We"  
+. 
+@
+cuid: 0x1122331b
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "1---2---Car"   
+.
+@
+cuid: 0x1122331c
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "1---2---Cake"   
+.
+@
+cuid: 0x1122331d
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "1---2---3---A"
+.
+@
+cuid: 0x1122331e
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "1---2---3---We"  
+. 
+@
+cuid: 0x1122331f
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "1---2---3---Car"   
+.
+@
+cuid: 0x11223320
+eid:  128
+type: Text8
+flags: 0x0000
+strval: "1---2---3---Cake"   
+.
+
+
+#------------------------------------------------------------------------------
+# UInt64 & Int64 tests
+#
+
+@
+cuid: 0x55667711
+eid:  91
+type: Int64
+flags: 0x0000
+binval: 00 00 00 00 00 00 00 80
+.
+@
+cuid: 0x55667711
+eid:  92
+type: Int64
+flags: 0x0000
+binval: 00 00 00 00 00 00 00 00
+.
+#@
+#cuid: 0x55667711
+#eid:  192
+#type: Int64
+#flags: 0x0000
+#binval: 00
+#.
+@
+cuid: 0x55667711
+eid:  93
+type: Int64
+flags: 0x0000
+binval: ff ff ff ff ff ff ff 7f 
+.
+@
+cuid: 0x55667711
+eid:  94
+type: UInt64
+flags: 0x0000
+binval: ff ff ff ff ff ff ff ff
+.
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/nistsecurerng/include/utils/openc.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32utils/nistsecurerng/include/utils/openc.h	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,86 @@
+/*
+* Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
+* All rights reserved.
+* This component and the accompanying materials are made available
+* under the terms of "Eclipse Public License v1.0"
+* which accompanies this distribution, and is available
+* at the URL "http://www.eclipse.org/legal/epl-v10.html".
+*
+* Initial Contributors:
+* Nokia Corporation - initial contribution.
+*
+* Contributors:
+*
+* Description: 
+*/
+
+
+#ifndef _OPENC_H_
+#define _OPENC_H_
+
+#include <e32base.h>
+#include <e32std.h>
+#include <e32cons.h>            // Console
+#include <f32file.h>
+
+#include <e32math.h>
+
+extern RFs gFileSession;
+
+// Math functions
+double log(double);
+double exp(double);
+double fabs(double);
+double floor(double);
+double sqrt(double);
+double erf(double);
+double erfc(double);
+
+double pow(double, double);
+
+// Math trigonometric functions
+double sin(double);
+double cos(double);
+
+
+// data types
+typedef RFile FILE;
+#define EOF (-1)
+typedef TUint32     u_int32_t;
+typedef TInt32      int32_t;
+
+#define SEEK_SET    0   /* set file offset to offset */
+#define SEEK_CUR    1   /* set file offset to current plus offset */
+#define SEEK_END    2   /* set file offset to EOF plus offset */
+
+
+// stdio functions
+int     printf(const char * __restrict, ...);
+int     scanf(const char * __restrict, ...);
+int     sprintf(char * __restrict, const char * __restrict, ...);
+int     puts ( const char * str );
+int     putchar ( int character );
+char*   strcpy(char* aDest, const char* aSrc);
+
+FILE    *fopen(const char * __restrict, const char * __restrict);
+int     fclose(FILE *);
+int     fprintf(FILE * __restrict, const char * __restrict, ...);
+int     fscanf(FILE * __restrict, const char * __restrict, ...);
+TUint32  fread(void * __restrict, TUint32, TUint32, FILE * __restrict);
+int     fseek(FILE *, long, int);
+
+int     fflush(FILE *);
+
+// stdlib functions
+void*   calloc(TUint32, TUint32);
+void    free(void *);
+
+void    qsort (void* base, TUint32 nmemb, TUint32 size, int (*compar)(const void*, const void*));
+
+void    exit (int status);
+
+// Other utility functions
+void ReadStringFromConsole(TDes& aString);
+TInt ReadIntL(TInt& aValue);
+
+#endif /* _OPENC_H_ */
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/nistsecurerng/src/math/erf.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32utils/nistsecurerng/src/math/erf.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,355 @@
+/*
+* Portions Copyright (c) 2006, 2009 Nokia Corporation and/or its subsidiary(-ies).
+* All rights reserved.
+* This component and the accompanying materials are made available
+* under the terms of "Eclipse Public License v1.0"
+* which accompanies this distribution, and is available
+* at the URL "http://www.eclipse.org/legal/epl-v10.html".
+*
+* Initial Contributors:
+* Nokia Corporation - initial contribution.
+*
+* Contributors:
+*
+* Description: 
+*/
+
+/* @(#)s_erf.c 5.1 93/09/24 */
+/*
+ * ====================================================
+ * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
+ *
+ * Developed at SunPro, a Sun Microsystems, Inc. business.
+ * Permission to use, copy, modify, and distribute this
+ * software is freely granted, provided that this notice
+ * is preserved.
+ * ====================================================
+ */
+#ifndef __SYMBIAN32__
+#ifndef lint
+static char rcsid[] = "$FreeBSD: src/lib/msun/src/s_erf.c,v 1.7 2002/05/28 18:15:04 alfred Exp $";
+#endif
+#endif //__SYMBIAN32__
+
+#include <e32std.h>
+
+#include "openc.h"
+
+/* double erf(double x)
+ * double erfc(double x)
+ *               x
+ *            2      |\
+ *     erf(x)  =  ---------  | exp(-t*t)dt
+ *         sqrt(pi) \|
+ *               0
+ *
+ *     erfc(x) =  1-erf(x)
+ *  Note that
+ *      erf(-x) = -erf(x)
+ *      erfc(-x) = 2 - erfc(x)
+ *
+ * Method:
+ *  1. For |x| in [0, 0.84375]
+ *      erf(x)  = x + x*R(x^2)
+ *          erfc(x) = 1 - erf(x)           if x in [-.84375,0.25]
+ *                  = 0.5 + ((0.5-x)-x*R)  if x in [0.25,0.84375]
+ *     where R = P/Q where P is an odd poly of degree 8 and
+ *     Q is an odd poly of degree 10.
+ *                       -57.90
+ *          | R - (erf(x)-x)/x | <= 2
+ *
+ *
+ *     Remark. The formula is derived by noting
+ *          erf(x) = (2/sqrt(pi))*(x - x^3/3 + x^5/10 - x^7/42 + ....)
+ *     and that
+ *          2/sqrt(pi) = 1.128379167095512573896158903121545171688
+ *     is close to one. The interval is chosen because the fix
+ *     point of erf(x) is near 0.6174 (i.e., erf(x)=x when x is
+ *     near 0.6174), and by some experiment, 0.84375 is chosen to
+ *     guarantee the error is less than one ulp for erf.
+ *
+ *      2. For |x| in [0.84375,1.25], let s = |x| - 1, and
+ *         c = 0.84506291151 rounded to single (24 bits)
+ *          erf(x)  = sign(x) * (c  + P1(s)/Q1(s))
+ *          erfc(x) = (1-c)  - P1(s)/Q1(s) if x > 0
+ *            1+(c+P1(s)/Q1(s))    if x < 0
+ *          |P1/Q1 - (erf(|x|)-c)| <= 2**-59.06
+ *     Remark: here we use the taylor series expansion at x=1.
+ *      erf(1+s) = erf(1) + s*Poly(s)
+ *           = 0.845.. + P1(s)/Q1(s)
+ *     That is, we use rational approximation to approximate
+ *          erf(1+s) - (c = (single)0.84506291151)
+ *     Note that |P1/Q1|< 0.078 for x in [0.84375,1.25]
+ *     where
+ *      P1(s) = degree 6 poly in s
+ *      Q1(s) = degree 6 poly in s
+ *
+ *      3. For x in [1.25,1/0.35(~2.857143)],
+ *          erfc(x) = (1/x)*exp(-x*x-0.5625+R1/S1)
+ *          erf(x)  = 1 - erfc(x)
+ *     where
+ *      R1(z) = degree 7 poly in z, (z=1/x^2)
+ *      S1(z) = degree 8 poly in z
+ *
+ *      4. For x in [1/0.35,28]
+ *          erfc(x) = (1/x)*exp(-x*x-0.5625+R2/S2) if x > 0
+ *          = 2.0 - (1/x)*exp(-x*x-0.5625+R2/S2) if -6<x<0
+ *          = 2.0 - tiny        (if x <= -6)
+ *          erf(x)  = sign(x)*(1.0 - erfc(x)) if x < 6, else
+ *          erf(x)  = sign(x)*(1.0 - tiny)
+ *     where
+ *      R2(z) = degree 6 poly in z, (z=1/x^2)
+ *      S2(z) = degree 7 poly in z
+ *
+ *      Note1:
+ *     To compute exp(-x*x-0.5625+R/S), let s be a single
+ *     precision number and s := x; then
+ *      -x*x = -s*s + (s-x)*(s+x)
+ *          exp(-x*x-0.5626+R/S) =
+ *          exp(-s*s-0.5625)*exp((s-x)*(s+x)+R/S);
+ *      Note2:
+ *     Here 4 and 5 make use of the asymptotic series
+ *            exp(-x*x)
+ *      erfc(x) ~ ---------- * ( 1 + Poly(1/x^2) )
+ *            x*sqrt(pi)
+ *     We use rational approximation to approximate
+ *          g(s)=f(1/x^2) = log(erfc(x)*x) - x*x + 0.5625
+ *     Here is the error bound for R1/S1 and R2/S2
+ *          |R1/S1 - f(x)|  < 2**(-62.57)
+ *          |R2/S2 - f(x)|  < 2**(-61.52)
+ *
+ *      5. For inf > x >= 28
+ *          erf(x)  = sign(x) *(1 - tiny)  (raise inexact)
+ *          erfc(x) = tiny*tiny (raise underflow) if x > 0
+ *          = 2 - tiny if x<0
+ *
+ *      7. Special case:
+ *          erf(0)  = 0, erf(inf)  = 1, erf(-inf) = -1,
+ *          erfc(0) = 1, erfc(inf) = 0, erfc(-inf) = 2,
+ *      erfc/erf(NaN) is NaN
+ */
+
+
+
+
+
+////--------------------------------------------------
+
+#define __ieee754_exp   exp
+typedef TUint32 u_int32_t;
+typedef TInt32 int32_t;
+
+typedef union
+    {
+    double value;
+    struct
+        {
+        u_int32_t lsw;
+        u_int32_t msw;
+        } parts;
+    } ieee_double_shape_type;
+
+
+inline void GET_HIGH_WORD(int32_t& aHighWord, double aValue)
+    {
+    ieee_double_shape_type gh_u;
+    gh_u.value = aValue;
+    aHighWord = gh_u.parts.msw;                  
+    }
+    
+inline void SET_LOW_WORD(double& aValue, int32_t aLowWord)
+    {
+    ieee_double_shape_type sl_u;
+    sl_u.value = aValue;
+    sl_u.parts.lsw = aLowWord;
+    aValue = sl_u.value;
+    }
+
+//----------------------------------------------------------------math_private.h
+
+static const double tiny    = 1e-300;
+static const double tinySquare    = 0.00; // tiny * tiny 
+static const double half    = 5.00000000000000000000e-01; /* 0x3FE00000, 0x00000000 */
+static const double one     = 1.00000000000000000000e+00; /* 0x3FF00000, 0x00000000 */
+static const double two     = 2.00000000000000000000e+00; /* 0x40000000, 0x00000000 */
+    /* c = (float)0.84506291151 */
+static const double erx     = 8.45062911510467529297e-01; /* 0x3FEB0AC1, 0x60000000 */
+/*
+ * Coefficients for approximation to  erf on [0,0.84375]
+ */
+static const double efx     =  1.28379167095512586316e-01; /* 0x3FC06EBA, 0x8214DB69 */
+static const double efx8    =  1.02703333676410069053e+00; /* 0x3FF06EBA, 0x8214DB69 */
+static const double pp0     =  1.28379167095512558561e-01; /* 0x3FC06EBA, 0x8214DB68 */
+static const double pp1     = -3.25042107247001499370e-01; /* 0xBFD4CD7D, 0x691CB913 */
+static const double pp2     = -2.84817495755985104766e-02; /* 0xBF9D2A51, 0xDBD7194F */
+static const double pp3     = -5.77027029648944159157e-03; /* 0xBF77A291, 0x236668E4 */
+static const double pp4     = -2.37630166566501626084e-05; /* 0xBEF8EAD6, 0x120016AC */
+static const double qq1     =  3.97917223959155352819e-01; /* 0x3FD97779, 0xCDDADC09 */
+static const double qq2     =  6.50222499887672944485e-02; /* 0x3FB0A54C, 0x5536CEBA */
+static const double qq3     =  5.08130628187576562776e-03; /* 0x3F74D022, 0xC4D36B0F */
+static const double qq4     =  1.32494738004321644526e-04; /* 0x3F215DC9, 0x221C1A10 */
+static const double qq5     = -3.96022827877536812320e-06; /* 0xBED09C43, 0x42A26120 */
+/*
+ * Coefficients for approximation to  erf  in [0.84375,1.25]
+ */
+static const double pa0     = -2.36211856075265944077e-03; /* 0xBF6359B8, 0xBEF77538 */
+static const double pa1     =  4.14856118683748331666e-01; /* 0x3FDA8D00, 0xAD92B34D */
+static const double pa2     = -3.72207876035701323847e-01; /* 0xBFD7D240, 0xFBB8C3F1 */
+static const double pa3     =  3.18346619901161753674e-01; /* 0x3FD45FCA, 0x805120E4 */
+static const double pa4     = -1.10894694282396677476e-01; /* 0xBFBC6398, 0x3D3E28EC */
+static const double pa5     =  3.54783043256182359371e-02; /* 0x3FA22A36, 0x599795EB */
+static const double pa6     = -2.16637559486879084300e-03; /* 0xBF61BF38, 0x0A96073F */
+static const double qa1     =  1.06420880400844228286e-01; /* 0x3FBB3E66, 0x18EEE323 */
+static const double qa2     =  5.40397917702171048937e-01; /* 0x3FE14AF0, 0x92EB6F33 */
+static const double qa3     =  7.18286544141962662868e-02; /* 0x3FB2635C, 0xD99FE9A7 */
+static const double qa4     =  1.26171219808761642112e-01; /* 0x3FC02660, 0xE763351F */
+static const double qa5     =  1.36370839120290507362e-02; /* 0x3F8BEDC2, 0x6B51DD1C */
+static const double qa6     =  1.19844998467991074170e-02; /* 0x3F888B54, 0x5735151D */
+/*
+ * Coefficients for approximation to  erfc in [1.25,1/0.35]
+ */
+static const double ra0     = -9.86494403484714822705e-03; /* 0xBF843412, 0x600D6435 */
+static const double ra1     = -6.93858572707181764372e-01; /* 0xBFE63416, 0xE4BA7360 */
+static const double ra2     = -1.05586262253232909814e+01; /* 0xC0251E04, 0x41B0E726 */
+static const double ra3     = -6.23753324503260060396e+01; /* 0xC04F300A, 0xE4CBA38D */
+static const double ra4     = -1.62396669462573470355e+02; /* 0xC0644CB1, 0x84282266 */
+static const double ra5     = -1.84605092906711035994e+02; /* 0xC067135C, 0xEBCCABB2 */
+static const double ra6     = -8.12874355063065934246e+01; /* 0xC0545265, 0x57E4D2F2 */
+static const double ra7     = -9.81432934416914548592e+00; /* 0xC023A0EF, 0xC69AC25C */
+static const double sa1     =  1.96512716674392571292e+01; /* 0x4033A6B9, 0xBD707687 */
+static const double sa2     =  1.37657754143519042600e+02; /* 0x4061350C, 0x526AE721 */
+static const double sa3     =  4.34565877475229228821e+02; /* 0x407B290D, 0xD58A1A71 */
+static const double sa4     =  6.45387271733267880336e+02; /* 0x40842B19, 0x21EC2868 */
+static const double sa5     =  4.29008140027567833386e+02; /* 0x407AD021, 0x57700314 */
+static const double sa6     =  1.08635005541779435134e+02; /* 0x405B28A3, 0xEE48AE2C */
+static const double sa7     =  6.57024977031928170135e+00; /* 0x401A47EF, 0x8E484A93 */
+static const double sa8     = -6.04244152148580987438e-02; /* 0xBFAEEFF2, 0xEE749A62 */
+/*
+ * Coefficients for approximation to  erfc in [1/.35,28]
+ */
+static const double rb0     = -9.86494292470009928597e-03; /* 0xBF843412, 0x39E86F4A */
+static const double rb1     = -7.99283237680523006574e-01; /* 0xBFE993BA, 0x70C285DE */
+static const double rb2     = -1.77579549177547519889e+01; /* 0xC031C209, 0x555F995A */
+static const double rb3     = -1.60636384855821916062e+02; /* 0xC064145D, 0x43C5ED98 */
+static const double rb4     = -6.37566443368389627722e+02; /* 0xC083EC88, 0x1375F228 */
+static const double rb5     = -1.02509513161107724954e+03; /* 0xC0900461, 0x6A2E5992 */
+static const double rb6     = -4.83519191608651397019e+02; /* 0xC07E384E, 0x9BDC383F */
+static const double sb1     =  3.03380607434824582924e+01; /* 0x403E568B, 0x261D5190 */
+static const double sb2     =  3.25792512996573918826e+02; /* 0x40745CAE, 0x221B9F0A */
+static const double sb3     =  1.53672958608443695994e+03; /* 0x409802EB, 0x189D5118 */
+static const double sb4     =  3.19985821950859553908e+03; /* 0x40A8FFB7, 0x688C246A */
+static const double sb5     =  2.55305040643316442583e+03; /* 0x40A3F219, 0xCEDF3BE6 */
+static const double sb6     =  4.74528541206955367215e+02; /* 0x407DA874, 0xE79FE763 */
+static const double sb7     = -2.24409524465858183362e+01; /* 0xC03670E2, 0x42712D62 */
+
+double erf(double x)
+{
+    TInt32 hx,ix,i;
+    double R,S,P,Q,s,y,z,r;
+    GET_HIGH_WORD(hx,x);
+    ix = hx&0x7fffffff;
+    if(ix>=0x7ff00000) {        /* erf(nan)=nan */
+        i = ((TUint32)hx>>31)<<1;
+        return (double)(1-i)+one/x; /* erf(+-inf)=+-1 */
+    }
+
+    if(ix < 0x3feb0000) {       /* |x|<0.84375 */
+        if(ix < 0x3e300000) {   /* |x|<2**-28 */
+            if (ix < 0x00800000)
+            return 0.125*(8.0*x+efx8*x);  /*avoid underflow */
+        return x + efx*x;
+        }
+        z = x*x;
+        r = pp0+z*(pp1+z*(pp2+z*(pp3+z*pp4)));
+        s = one+z*(qq1+z*(qq2+z*(qq3+z*(qq4+z*qq5))));
+        y = r/s;
+        return x + x*y;
+    }
+    if(ix < 0x3ff40000) {       /* 0.84375 <= |x| < 1.25 */
+        s = fabs(x)-one;
+        P = pa0+s*(pa1+s*(pa2+s*(pa3+s*(pa4+s*(pa5+s*pa6)))));
+        Q = one+s*(qa1+s*(qa2+s*(qa3+s*(qa4+s*(qa5+s*qa6)))));
+        if(hx>=0) return erx + P/Q; else return -erx - P/Q;
+    }
+    if (ix >= 0x40180000) {     /* inf>|x|>=6 */
+        if(hx>=0) return one-tiny; else return tiny-one;
+    }
+    x = fabs(x);
+    s = one/(x*x);
+    if(ix< 0x4006DB6E) {    /* |x| < 1/0.35 */
+        R=ra0+s*(ra1+s*(ra2+s*(ra3+s*(ra4+s*(
+                ra5+s*(ra6+s*ra7))))));
+        S=one+s*(sa1+s*(sa2+s*(sa3+s*(sa4+s*(
+                sa5+s*(sa6+s*(sa7+s*sa8)))))));
+    } else {    /* |x| >= 1/0.35 */
+        R=rb0+s*(rb1+s*(rb2+s*(rb3+s*(rb4+s*(
+                rb5+s*rb6)))));
+        S=one+s*(sb1+s*(sb2+s*(sb3+s*(sb4+s*(
+                sb5+s*(sb6+s*sb7))))));
+    }
+    z  = x;
+    SET_LOW_WORD(z,0);
+    r  =  __ieee754_exp(-z*z-0.5625)*__ieee754_exp((z-x)*(z+x)+R/S);
+    if(hx>=0) return one-r/x; else return  r/x-one;
+}
+
+double erfc(double x)
+{
+    int32_t hx,ix;
+    double R,S,P,Q,s,y,z,r;
+    GET_HIGH_WORD(hx,x);
+    ix = hx&0x7fffffff;
+    if(ix>=0x7ff00000) {            /* erfc(nan)=nan */
+                        /* erfc(+-inf)=0,2 */
+        return (double)(((u_int32_t)hx>>31)<<1)+one/x;
+    }
+
+    if(ix < 0x3feb0000) {       /* |x|<0.84375 */
+        if(ix < 0x3c700000)     /* |x|<2**-56 */
+        return one-x;
+        z = x*x;
+        r = pp0+z*(pp1+z*(pp2+z*(pp3+z*pp4)));
+        s = one+z*(qq1+z*(qq2+z*(qq3+z*(qq4+z*qq5))));
+        y = r/s;
+        if(hx < 0x3fd00000) {   /* x<1/4 */
+        return one-(x+x*y);
+        } else {
+        r = x*y;
+        r += (x-half);
+            return half - r ;
+        }
+    }
+    if(ix < 0x3ff40000) {       /* 0.84375 <= |x| < 1.25 */
+        s = fabs(x)-one;
+        P = pa0+s*(pa1+s*(pa2+s*(pa3+s*(pa4+s*(pa5+s*pa6)))));
+        Q = one+s*(qa1+s*(qa2+s*(qa3+s*(qa4+s*(qa5+s*qa6)))));
+        if(hx>=0) {
+            z  = one-erx; return z - P/Q;
+        } else {
+        z = erx+P/Q; return one+z;
+        }
+    }
+    if (ix < 0x403c0000) {      /* |x|<28 */
+        x = fabs(x);
+        s = one/(x*x);
+        if(ix< 0x4006DB6D) {    /* |x| < 1/.35 ~ 2.857143*/
+            R=ra0+s*(ra1+s*(ra2+s*(ra3+s*(ra4+s*(
+                ra5+s*(ra6+s*ra7))))));
+            S=one+s*(sa1+s*(sa2+s*(sa3+s*(sa4+s*(
+                sa5+s*(sa6+s*(sa7+s*sa8)))))));
+        } else {            /* |x| >= 1/.35 ~ 2.857143 */
+        if(hx<0&&ix>=0x40180000) return two-tiny;/* x < -6 */
+            R=rb0+s*(rb1+s*(rb2+s*(rb3+s*(rb4+s*(
+                rb5+s*rb6)))));
+            S=one+s*(sb1+s*(sb2+s*(sb3+s*(sb4+s*(
+                sb5+s*(sb6+s*sb7))))));
+        }
+        z  = x;
+        SET_LOW_WORD(z,0);
+        r  =  __ieee754_exp(-z*z-0.5625)*
+            __ieee754_exp((z-x)*(z+x)+R/S);
+        if(hx>0) return r/x; else return two-r/x;
+    } else {
+        if(hx>0) return tinySquare; else return two-tiny;
+    }
+}
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/nistsecurerng/src/utils/openc.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32utils/nistsecurerng/src/utils/openc.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,616 @@
+/*
+* Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
+* All rights reserved.
+* This component and the accompanying materials are made available
+* under the terms of "Eclipse Public License v1.0"
+* which accompanies this distribution, and is available
+* at the URL "http://www.eclipse.org/legal/epl-v10.html".
+*
+* Initial Contributors:
+* Nokia Corporation - initial contribution.
+*
+* Contributors:
+*
+* Description: 
+*/
+
+
+//------------------------------------ System Header Files ------------------------------------------------
+#include <e32cons.h>        // ConsoleBase
+//------------------------------------ Local Header Files -------------------------------------------------
+#include "openc.h"
+
+//-------------------------------- Constants, global variables and Macro Definitions ----------------------------------------
+_LIT(KConsoleName, "NIST Test Console");
+CConsoleBase* gConsole = NULL;
+
+
+int PrintToScreen(const char* aString);
+
+const TInt KIntStringLen = 10;
+RFs gFileSession;
+
+enum TDataType
+    {
+    EInteger,
+    EFloat,
+    EUnknownType = 0x10000
+    };
+
+const TInt KMaxReadSize = 50;
+const TInt KMaxScreenBufferSize = 100;
+
+TBuf<KMaxScreenBufferSize> gScreenBuffer;
+
+class GlobalInitilizer
+    {
+public:
+    GlobalInitilizer()
+        {
+        TInt err = gFileSession.Connect();
+
+        if(err != KErrNone)
+            {
+            User::Exit(err);
+            }
+
+        TRAP(err, gConsole = Console::NewL(KConsoleName, TSize(KConsFullScreen,KConsFullScreen)));
+        if(err != KErrNone)
+            {
+            User::Exit(err);
+            }
+        }
+    ~GlobalInitilizer()
+        {
+        gFileSession.Close();
+        delete gConsole;
+        }
+    };
+
+GlobalInitilizer globalObj;
+
+//------------------------------------ Function Definitions -----------------------------------------------
+
+double log(double aSource)
+    {
+    double result = 0.0;
+    Math::Ln(result, aSource);
+    return result;
+    }
+
+double exp(double aSource)
+    {
+    double result = 0.0;
+    Math::Exp(result, aSource);
+    return result;
+    }
+
+double fabs(double aSource)
+    {
+    return (aSource >= 0.0)? aSource: -aSource;
+    }
+
+
+double floor(double aSource)
+    {
+    if(aSource >= 0.0 || aSource == (TInt64)aSource)
+        {
+        return (double)(TInt64)aSource;
+        }
+   
+    return (double)((TInt64)aSource - 1);
+    }
+
+double sqrt(double aSource)
+    {
+    double result = 0.0;
+    Math::Sqrt(result, aSource);
+    return result;
+    }
+
+double pow(double aSource, double aPower)
+    {
+    double result = 0.0;
+    Math::Pow(result, aSource, aPower);
+    return result;
+    }
+
+// Math trigonometric functions
+double sin(double aSource)
+    {
+    double result = 0.0;
+    Math::Sin(result, aSource);
+    return result;
+    }
+
+double cos(double aSource)
+    {
+    double result = 0.0;
+    Math::Cos(result, aSource);
+    return result;
+    }
+
+// Stdio functions
+int printf(const char* aFormatString, ...)
+    {
+    TUint length = User::StringLength((TUint8*)aFormatString) + 100;
+    HBufC8* buffer = HBufC8::New(length);
+    if(NULL == buffer)
+        {
+        return KErrNoMemory;
+        }
+    
+    TPtr8 targetPtr = buffer->Des();
+    TPtrC8 formatPtr((TUint8*)aFormatString);
+
+    VA_LIST list;
+    VA_START(list, aFormatString);
+    
+    targetPtr.FormatList(formatPtr, list);
+    
+    PrintToScreen((const char*)targetPtr.PtrZ());
+
+    delete buffer;
+
+    return targetPtr.Length();
+    }
+
+int puts(const char* aString)
+    {
+    int ret = PrintToScreen(aString);
+    gConsole->Printf(_L("\n"));
+    
+    return ret;
+    }
+
+int putchar(int aChar)
+    {
+    gConsole->Printf(_L("%c"), aChar);
+    return aChar;
+    }
+
+char* strcpy(char* aDst, const char* aSrc)
+    {
+    char* cp = aDst;
+
+    while((*cp++ = *aSrc++) != 0)
+        ; // Copy src over dst
+
+    return(aDst);
+    }
+
+int scanf(const char* aFormatString, ...)
+    {
+    TDataType type = EUnknownType;
+    TBool byteRead = EFalse;
+    
+    if(Mem::Compare((const unsigned char*)aFormatString, 2, (const unsigned char*)"%d", 2) == 0)
+        {
+        type = EInteger;
+        }
+    else if(Mem::Compare((const unsigned char*)aFormatString, 2, (const unsigned char*)"%f", 2) == 0)
+        {
+        type = EFloat;
+        }
+    else if(Mem::Compare((const unsigned char*)aFormatString, 3, (const unsigned char*)"%1d", 3) == 0)
+        {
+        type = EInteger;
+        byteRead = ETrue;
+        }
+    else
+        {
+        User::Panic(_L("NIST TestSuit Error"), KErrArgument);
+        }
+    
+    if(!byteRead || (gScreenBuffer.Length() == 0))
+        {
+        ReadStringFromConsole(gScreenBuffer);
+        }
+
+    TLex parser(gScreenBuffer);
+    parser.SkipSpace();
+    
+    VA_LIST list;
+    VA_START(list, aFormatString);
+
+    switch(type)
+        {
+        case EInteger:
+            {
+            TInt* ptr = VA_ARG(list, TInt*);
+            if(byteRead)
+                {
+                TChar ch(gScreenBuffer[0]);
+                gScreenBuffer.Delete(0, 1);
+                *ptr = ch.GetNumericValue();
+                }
+            else
+                {
+                parser.Val(*ptr);
+                gScreenBuffer.Zero();
+                }
+            break;
+            }
+        case EFloat:
+            {
+            float* ptr = VA_ARG(list, float*);
+            parser.Val(*ptr);
+            gScreenBuffer.Zero();
+            break;
+            }
+        case EUnknownType:
+            {
+            User::Panic(_L("NIST TestSuit Error"), KErrArgument);
+            }
+        }
+
+    return 1;
+    }
+
+int sprintf(char *aBuffer, const char* aFormatString, ...)
+    {
+    TUint length = User::StringLength((TUint8*)aFormatString) + 100;
+    TPtr8 aTargetPtr((TUint8*)aBuffer, length);
+    TPtrC8 formatPtr((TUint8*)aFormatString);
+
+    VA_LIST list;
+    VA_START(list, aFormatString);
+    
+    aTargetPtr.FormatList(formatPtr, list);
+    aTargetPtr.ZeroTerminate();
+
+    return User::StringLength((TUint8*)aBuffer);;
+    }
+
+int GetFileMode(const char* aModeStr, TFileMode& aFileMode, TBool& aIsAppend)
+    {
+    aIsAppend = EFalse;
+    switch (*aModeStr)
+        {
+        case 'r':
+            aFileMode = EFileRead;
+            break;
+            
+        case 'w':
+            aFileMode = EFileWrite;
+            break;
+            
+        case 'a':
+            aFileMode = EFileWrite;
+            aIsAppend = ETrue;
+            break;
+            
+        default:
+            return KErrArgument;
+        } 
+      
+    return KErrNone;
+    }
+
+FILE *fopen(const char *aFileName, const char *aMode)
+    {
+    TPtrC8 fileNamePtr(reinterpret_cast<const unsigned char*>(aFileName));
+    TFileName fileName;
+    fileName.Copy(fileNamePtr);
+    RFile* file = new RFile;
+    if(NULL == file)
+        {
+        return NULL;
+        }
+
+    TFileMode mode = EFileRead;
+    TBool isAppend = EFalse;
+    GetFileMode(aMode, mode, isAppend);
+    int err = KErrArgument;
+    switch(mode)
+        {
+        case EFileRead:
+            {
+            err = file->Open(gFileSession, fileName, mode);
+            break;
+            }
+        case EFileWrite:
+            {
+            if(isAppend)
+                {
+                err = file->Open(gFileSession, fileName, mode);
+                if(err == KErrNone)
+                    {
+                    TInt offset = 0;
+                    err = file->Seek(ESeekEnd, offset);
+                    break;
+                    }
+                }
+            
+            err = file->Replace(gFileSession, fileName, mode);
+            break;
+            }
+        default:
+            err = KErrArgument;
+        }
+
+    if(KErrNone != err)
+        {
+        file->Close();
+        delete file;
+        file = NULL;
+        }
+    return file;
+    }
+
+
+
+int fclose(FILE *aFp)
+    {
+    if(NULL != aFp)
+        {
+        aFp->Close();
+        delete aFp;
+        }
+    return KErrNone;
+    }
+
+int fprintf(FILE* aFile, const char* aFormatString, ...)
+    {
+    TUint length = User::StringLength((TUint8*)aFormatString) + 100;
+    HBufC8* buffer = HBufC8::New(length);
+    if(NULL == buffer)
+        {
+        return KErrNoMemory;
+        }
+    
+    TPtr8 targetPtr = buffer->Des();
+    TPtrC8 formatPtr((TUint8*)aFormatString);
+
+    VA_LIST list;
+    VA_START(list, aFormatString);
+    
+    targetPtr.FormatList(formatPtr, list);
+    targetPtr.ZeroTerminate();
+    
+    aFile->Write(targetPtr);
+    
+    delete buffer;
+
+    return targetPtr.Length();
+    }
+
+int fscanf(FILE* aFp, const char * aFormatString, ...)
+    {
+    TDataType type = EUnknownType;
+    TBool byteRead = EFalse;
+    
+    if(Mem::Compare((const unsigned char*)aFormatString, 2, (const unsigned char*)"%d", 2) == 0)
+        {
+        type = EInteger;
+        }
+    else if(Mem::Compare((const unsigned char*)aFormatString, 2, (const unsigned char*)"%f", 2) == 0)
+        {
+        type = EFloat;
+        }
+    else if(Mem::Compare((const unsigned char*)aFormatString, 3, (const unsigned char*)"%1d", 3) == 0)
+        {
+        type = EInteger;
+        byteRead = ETrue;
+        }
+    else
+        {
+        User::Panic(_L("NIST TestSuit Error"), KErrArgument);
+        }
+    
+    TInt initialOffset = 0;
+    aFp->Seek(ESeekCurrent, initialOffset);
+    TBuf8<KMaxReadSize + 1> readBuffer;
+    aFp->Read(readBuffer, KMaxReadSize);
+    readBuffer.ZeroTerminate();
+    TLex8 parser(readBuffer);
+    parser.SkipSpace();
+    
+    VA_LIST list;
+    VA_START(list, aFormatString);
+
+    switch(type)
+        {
+        case EInteger:
+            {
+            TInt* ptr = VA_ARG(list, TInt*);
+            TChar ch = parser.Peek();
+            
+            if(!ch.IsDigit())
+                {
+                break;
+                }
+            
+            if(byteRead)
+                {
+                ch = parser.Get();
+                *ptr = ch.GetNumericValue();
+                }
+            else
+                {
+                parser.Val(*ptr);
+                }
+
+            break;
+            }
+        case EFloat:
+            {
+            float* ptr = VA_ARG(list, float*);
+            parser.Val(*ptr);
+            break;
+            }
+        case EUnknownType:
+            {
+            User::Panic(_L("NIST TestSuit Error"), KErrArgument);
+            }
+        }
+
+    TInt len = initialOffset + parser.Offset();
+    aFp->Seek(ESeekStart, len);
+    
+    return 1;
+    }
+
+TUint32 fread(void* aPtr, TUint32 aSize, TUint32 aCount, FILE* aFile)
+    {
+    TUint32 size = aSize * aCount;
+    TPtr8 dataPtr((TUint8*)aPtr, size);
+    TInt err = aFile->Read(dataPtr);
+    if(KErrNone != err)
+        {
+        size = (TUint32)dataPtr.Length();
+        }
+    return size;
+    }
+
+int fseek(FILE* aFile, long aOffset, int aWhence)
+    {
+    int ret = KErrNone;
+    int fileOffset = aOffset;
+    switch(aWhence)
+        {
+        case SEEK_SET:
+            {
+            ret = aFile->Seek(ESeekStart, fileOffset);
+            break;
+            }
+        case SEEK_CUR:
+            {
+            ret = aFile->Seek(ESeekCurrent, fileOffset);
+            break;
+            }
+        case SEEK_END:
+            {
+            ret = aFile->Seek(ESeekEnd, fileOffset);
+            break;
+            }
+        default:
+            User::Panic(_L("NIST TestSuit Error"), KErrArgument);
+        }
+    
+    return ret;
+    }
+
+
+
+int fflush(FILE *aFile)
+    {
+    TInt err = aFile->Flush();
+    if(err != KErrNone)
+        {
+        err = EOF;
+        }
+    return err;
+    }
+
+
+// Conio functions
+void* calloc(TUint32 aElementCount, TUint32 aSize)
+    {
+    aSize *= aElementCount;
+    return User::AllocZ(aSize);
+    }
+
+void free(void *aMemory)
+    {
+    User::Free(aMemory);
+    }
+
+TBool IsCharacterKey(TKeyCode aKey)
+    {
+    if(aKey > EKeyEscape && aKey < EKeyDelete)
+        {
+        return ETrue;
+        }
+    
+    return EFalse;
+    }
+
+_LIT(KLineBreaker, "\r\n");
+
+void ReadStringFromConsole(TDes& aString)
+    {
+    // This infinte loop terminates when user hits an "enter" key
+    FOREVER
+        {
+        // Get a key(character) from the console
+        TKeyCode ch = gConsole->Getch();
+        
+        switch(ch)
+            {
+            case EKeyEnter:
+                {
+                if(aString.Length() == 0)
+                    {
+                    break;// At least one character should be read.
+                    }
+                gConsole->Printf(KLineBreaker);
+                return;
+                }
+            case EKeyBackspace:
+                {
+                if(0 != aString.Length())
+                    {
+                    // Back-space only takes the cursor one position back
+                    // So to delete a character blank-space is inserted at
+                    // that position and later cursor is again adjusted.
+                    gConsole->Printf(_L("%c%c%c"), EKeyBackspace, 
+                                                   EKeySpace, 
+                                                   EKeyBackspace);
+                    // Delete the character from the target string also. 
+                    aString.Delete(aString.Length() - 1, 1);
+                    }
+                break;
+                }
+            default:
+                {
+                TInt maxBufferLength = aString.MaxLength();
+                // IsCharacterKey will return true if ch is a displayable
+                // character else it will return false.
+                if(IsCharacterKey(ch) && aString.Length() != maxBufferLength)
+                    {
+                    gConsole->Printf(_L("%c"), ch);
+                    aString.Append(ch);
+                    }
+                }
+            }
+        }
+    }
+  
+TInt ReadIntL(TInt& aValue)
+    {
+    TBuf<KIntStringLen> string;
+    ReadStringFromConsole(string);
+    TLex lexObj(string);
+    return lexObj.Val(aValue);
+    }
+
+int PrintToScreen(const char* aString)
+    {
+    TUint length = User::StringLength((TUint8*)aString);
+    HBufC* buffer = HBufC::New(length);
+    if(NULL == buffer)
+        {
+        return EOF;
+        }
+    
+    TPtr targetPtr = buffer->Des();
+
+    TPtrC8 stringPtr((TUint8*)aString);
+
+    targetPtr.Copy(stringPtr);
+    gConsole->Printf(targetPtr);
+    
+    delete buffer;
+    
+    return KErrNone;
+    }
+
+void exit ( int status )
+    {
+    User::Exit(status);
+    for(;;){} // So that GCC compiler don't complain about noreturn function returns.
+    }
+
+//------------------------------------------  E  O  F -----------------------------------------------------
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/e32utils/nistsecurerng/src/utils/qsort.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/e32utils/nistsecurerng/src/utils/qsort.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,203 @@
+/*
+* Copyright (c) 1997-2009 Nokia Corporation and/or its subsidiary(-ies).
+* All rights reserved.
+* This component and the accompanying materials are made available
+* under the terms of "Eclipse Public License v1.0"
+* which accompanies this distribution, and is available
+* at the URL "http://www.eclipse.org/legal/epl-v10.html".
+*
+* Initial Contributors:
+* Nokia Corporation - initial contribution.
+*
+* Contributors:
+*
+* Description:
+* Map ANSI bsearch and qsort onto EPOC32 functions 
+*/
+
+#include <e32std.h>
+#include "openc.h"
+
+NONSHARABLE_CLASS(TAnsiKey) : public TKey
+	{
+public:
+	TAnsiKey(const TAny* key, const TAny* base, TInt length, TInt (*compar)(const TAny*, const TAny*))
+		: iSearchKey(key), iCmp(compar)
+		{ SetPtr(base); iKeyLength=length; }
+
+	virtual TInt Compare(TInt aLeft,TInt aRight) const;
+	virtual TAny *At(TInt anIndex) const;
+private:
+	const TAny* iSearchKey;
+	TInt (*iCmp)(const TAny*, const TAny*);
+	};
+
+TInt TAnsiKey::Compare (TInt aLeft,TInt aRight) const
+	{
+	if (aRight==KIndexPtr)
+		return (*iCmp)(At(aLeft),iSearchKey);
+	else
+		return (*iCmp)(At(aLeft),At(aRight));
+	}
+
+TAny* TAnsiKey::At (TInt aPos) const
+	{
+	return (TUint8*)iPtr+(aPos*iKeyLength);
+	}
+
+NONSHARABLE_CLASS(TAnsiSwap) : public TSwap
+	{
+public:
+	TAnsiSwap(const TAny* base, TInt length) : iPtr(base), iLength(length) {}
+
+	virtual void Swap(TInt aLeft,TInt aRight) const;
+private:
+	TUint8* At(TInt aPos) const {return (TUint8*)iPtr+(aPos*iLength);}
+
+	const TAny* iPtr;
+	TInt  iLength;
+	};
+
+void TAnsiSwap::Swap(TInt aLeft,TInt aRight) const
+	{
+	TUint8* left=At(aLeft);
+	TUint8* right=At(aRight);
+	TUint8 tmp;
+
+	for (TInt i=iLength; i>0; i--)
+		{
+		tmp=*left;
+		*left++=*right;
+		*right++=tmp;
+		}
+	}
+
+/*
+FUNCTION
+<<bsearch>>---binary search
+
+INDEX
+	bsearch
+
+ANSI_SYNOPSIS
+	#include <stdlib.h>
+	void *bsearch(const void *<[key]>, const void *<[base]>,
+		size_t <[nmemb]>, size_t <[size]>,
+		int (*<[compar]>)(const void *, const void *));
+
+TRAD_SYNOPSIS
+	#include <stdlib.h>
+	char *bsearch(<[key]>, <[base]>, <[nmemb]>, <[size]>, <[compar]>)
+	char *<[key]>;
+	char *<[base]>;
+	size_t <[nmemb]>, <[size]>;
+	int (*<[compar]>)();
+
+DESCRIPTION
+<<bsearch>> searches an array beginning at <[base]> for any element
+that matches <[key]>, using binary search.  <[nmemb]> is the element
+count of the array; <[size]> is the size of each element.
+
+The array must be sorted in ascending order with respect to the
+comparison function <[compar]> (which you supply as the last argument of
+<<bsearch>>).
+
+You must define the comparison function <<(*<[compar]>)>> to have two
+arguments; its result must be negative if the first argument is
+less than the second, zero if the two arguments match, and
+positive if the first argument is greater than the second (where
+``less than'' and ``greater than'' refer to whatever arbitrary
+ordering is appropriate).
+
+RETURNS
+Returns a pointer to an element of <[array]> that matches <[key]>.  If
+more than one matching element is available, the result may point to
+any of them. Returns NULL if no matching element is found.
+
+PORTABILITY
+<<bsearch>> is ANSI.
+
+No supporting OS subroutines are required.
+*/
+
+/**
+searches an array beginning at <[base]> for any element
+that matches <[key]>, using binary search
+@return a pointer to an element of <[array]> that matches <[key]>.  If
+more than one matching element is available, the result may point to
+any of them. Returns NULL if no matching element is found.
+@param key
+@param base
+@param nmemb
+@param size
+*/
+void* bsearch (const void* key, const void* base, TUint32 nmemb, TUint32 size,
+	int (*compar)(const void*, const void*))
+	{
+	TAnsiKey searchMe(key, base, size, compar);
+	TInt result=KIndexPtr;
+	TInt r=User::BinarySearch(nmemb, searchMe, result);
+	if (r==0)
+		return searchMe.At(result);
+	else
+		return NULL;
+	}
+
+/*
+FUNCTION
+<<qsort>>---sort an array
+
+INDEX
+	qsort
+
+ANSI_SYNOPSIS
+	#include <stdlib.h>
+	void qsort(void *<[base]>, size_t <[nmemb]>, size_t <[size]>,
+		   int (*<[compar]>)(const void *, const void *) );
+
+TRAD_SYNOPSIS
+	#include <stdlib.h>
+	qsort(<[base]>, <[nmemb]>, <[size]>, <[compar]> )
+	char *<[base]>;
+	size_t <[nmemb]>;
+	size_t <[size]>;
+	int (*<[compar]>)();
+
+DESCRIPTION
+<<qsort>> sorts an array (beginning at <[base]>) of <[nmemb]> objects.
+<[size]> describes the size of each element of the array.
+
+You must supply a pointer to a comparison function, using the argument
+shown as <[compar]>.  (This permits sorting objects of unknown
+properties.)  Define the comparison function to accept two arguments,
+each a pointer to an element of the array starting at <[base]>.  The
+result of <<(*<[compar]>)>> must be negative if the first argument is
+less than the second, zero if the two arguments match, and positive if
+the first argument is greater than the second (where ``less than'' and
+``greater than'' refer to whatever arbitrary ordering is appropriate).
+
+The array is sorted in place; that is, when <<qsort>> returns, the
+array elements beginning at <[base]> have been reordered.
+
+RETURNS
+<<qsort>> does not return a result.
+
+PORTABILITY
+<<qsort>> is required by ANSI (without specifying the sorting algorithm).
+*/
+
+/**
+Sort an array.
+@param base 
+@param nmemb
+@param size describes the size of each element of the array
+*/
+void qsort (void* base, TUint32 nmemb, TUint32 size,
+	int (*compar)(const void*, const void*))
+	{
+	TAnsiKey  searchMe(NULL, base, size, compar);
+	TAnsiSwap swapUs(base,size);
+	User::QuickSort(nmemb, searchMe, swapUs);
+	return;
+	}
+
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/concur/t_cfsbench.cpp
--- a/kerneltest/f32test/concur/t_cfsbench.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/concur/t_cfsbench.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -17,6 +17,7 @@
 
 //! @file f32test\concur\t_cfsbench.cpp
 
+#define	__E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <f32dbg.h>
@@ -118,7 +119,7 @@
 		return EFalse;
 	TDriveInfo info;
 	r=TheFs.Drive(info,drv);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return (info.iDriveAtt != 0 && !(info.iDriveAtt & KDriveAttRom));
 	}
 
@@ -131,19 +132,19 @@
 	TBuf<64> b;
 	TChar c;
 	r=TheFs.DriveToChar(aDrive,c);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	b.Format(_L("Mount test file system on %c:"),(TUint)c);
 	test.Next(b);
 
 	r=TheFs.AddFileSystem(KFsFile);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 
 	r=TheFs.FileSystemName(gOldFsName,aDrive);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	TDriveInfo drv;
 	r = TheFs.Drive(drv, aDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	gNoMedia = (drv.iType == EMediaUnknown || drv.iType == EMediaNotPresent);
 
@@ -151,14 +152,14 @@
 		{
 		TTest::Printf(_L("Dismount %C: %S"), (TUint)c, &gOldFsName);
 		r=TheFs.DismountFileSystem(gOldFsName,aDrive);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 
 	r=TheFs.MountFileSystem(KFsName,aDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.FileSystemName(gNewFsName,aDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(gNewFsName.CompareF(KFsName)==0);
 	return c;
 	}
@@ -168,9 +169,9 @@
 	{
 	TChar c;
 	TInt r=TheFs.DriveToChar(aDrive,c);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.DismountFileSystem(gNewFsName,aDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// if there's no media present, don't try to mount it
 	if (gNoMedia)
 		{
@@ -180,7 +181,7 @@
 		{
 		test.Printf(_L("Mount    %C: %S"), (TUint)c, &gOldFsName);
 		r=TheFs.MountFileSystem(gOldFsName,aDrive);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	if (r != KErrNone)
 		test.Printf(_L("Error %d remounting %S on %C\n"), r, &gOldFsName, (TUint)c);
@@ -195,16 +196,12 @@
 	TChar c;
 	TInt r=TheFs.DriveToChar(aDrive,c);
 	r=TheFs.FileSystemName(gFsName, aDrive);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	if (gFsName.Length() > 0)
 		{
 		r=TheFs.DismountFileSystem(gFsName, aDrive);
-		if(r!=KErrNone)
-			{
-			test.Printf(_L("Error = %d"),r);
-			test(EFalse);
-			}
+		test_KErrNone(r);
 		}
 
 	TBufC<16> type = _L("asynchronous");
@@ -218,7 +215,7 @@
 	r=TheFs.MountFileSystem(gFsName, aDrive);
 #endif
 
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 enum TOper
@@ -867,7 +864,7 @@
 //
 	{
 	TInt r = TTest::Init();
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	TChar drvch0 = TTest::DefaultDriveChar();
 	TChar drvch1 = 0;
@@ -887,7 +884,7 @@
 		drvch2 = User::UpperCase(argv[3][0]);
 
 	r = TheFs.CharToDrive(drvch0, drive0);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	if (TheFs.IsValidDrive(drive0))
 		MountTestFileSystem(drive0);
@@ -902,14 +899,14 @@
 		}
 
 	r = TheFs.CharToDrive(drvch1, drive1);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = TheFs.CharToDrive(drvch2, drive2);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	r = TheFs.FileSystemName(gFsName1, drive1);
-	test(r == KErrNone || r == KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 	r = TheFs.FileSystemName(gFsName2, drive2);
-	test(r == KErrNone || r == KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 
 	gDataLock.CreateLocal();
 
@@ -1039,7 +1036,7 @@
 	gDataLock.Close();
 
 	UnmountFileSystem(drive0);
-	test(r == 0);
+	test_Value(r, r == 0);
 	}
 
 
@@ -1058,7 +1055,7 @@
     test.Start(_L("Starting tests..."));
 
     r=TheFs.Connect();
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     // TheFs.SetAllocFailure(gAllocFailOn);
     TTime timerC;
@@ -1074,7 +1071,7 @@
     endTimeC.HomeTime();
     TTimeIntervalSeconds timeTakenC;
     r=endTimeC.SecondsFrom(timerC,timeTakenC);
-    test(r==KErrNone);
+    test_KErrNone(r);
     test.Printf(_L("Time taken for test = %d seconds\n"),timeTakenC.Int());
     // TheFs.SetAllocFailure(gAllocFailOff);
     TheFs.Close();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/concur/t_cfsmain.cpp
--- a/kerneltest/f32test/concur/t_cfsmain.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/concur/t_cfsmain.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -130,7 +130,7 @@
 	{
 	TFileName f;
 	TInt r=aFsSession.FileSystemName(f,aDrive);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	return (f.CompareF(KFatName)==0);
 	}
 
@@ -219,7 +219,7 @@
 
 	TEntry entry;
 	TInt r=TheFs.Entry(aName,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iAtt==anAttributes);
 	if (aModified!=TTime(0))
 		test(entry.iModified==aModified);
@@ -284,20 +284,20 @@
 
 	RFile file;
 	TInt r=file.Replace(TheFs,aFileName,0);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	if (r==KErrPathNotFound)
 		{
 		r=TheFs.MkDirAll(aFileName);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.Replace(TheFs,aFileName,0);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	TCheckedUid checkedUid(aUidType);
 	TPtrC8 uidData((TUint8*)&checkedUid,sizeof(TCheckedUid));
 	r=file.Write(uidData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(aFileContents);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	}
 
@@ -314,16 +314,16 @@
 		test.Printf(_L("ERROR: r=%d"),r);
 		test(EFalse);
 		}
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	if (r==KErrPathNotFound)
 		{
 		r=TheFs.MkDirAll(aFileName);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.Replace(TheFs,aFileName,0);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	r=file.Write(aFileContents);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	}
 
@@ -335,17 +335,17 @@
 
 	RFile file;
 	TInt r=file.Replace(TheFs,aFileName,0);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	if (r==KErrPathNotFound)
 		{
 		r=TheFs.MkDirAll(aFileName);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.Replace(TheFs,aFileName,0);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	file.Close();
 	r=TheFs.SetAtt(aFileName,anAttributes,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 GLDEF_C void SetSessionPath(const TDesC& aPathName)
@@ -355,9 +355,9 @@
 	{
 
 	TInt r=TheFs.SetSessionPath(aPathName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 GLDEF_C void MakeFile(const TDesC& aFileName)
@@ -376,7 +376,7 @@
 	{
 
 	TInt r=TheFs.MkDirAll(aDirName);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	}
 
 GLDEF_C TInt CheckFileExists(const TDesC& aName,TInt aResult,TBool aCompRes/*=ETrue*/)
@@ -387,7 +387,7 @@
 
 	TEntry entry;
 	TInt r=TheFs.Entry(aName,entry);
-	test(r==aResult);
+	test_Value(r, r == aResult);
 	if (aResult!=KErrNone)
 		return(0);
 	TParsePtrC nameParse(aName);
@@ -406,15 +406,15 @@
 
 	RFile f;
 	TInt r=f.Open(TheFs,aName,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	HBufC8* testBuf=HBufC8::NewL(aContents.Length());
 	test(testBuf!=NULL);
 	TPtr8 bufPtr(testBuf->Des());
 	r=f.Read(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(bufPtr==aContents);
 	r=f.Read(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(bufPtr.Length()==0);
 	f.Close();
 	User::Free(testBuf);
@@ -433,12 +433,12 @@
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	test(fMan!=NULL);
 	TInt r=TheFs.SessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.CheckDisk(gSessionPath);
 	if (r!=KErrNone && r!=KErrNotSupported)
 		ReportCheckDiskFailure(r);
 	r=fMan->RmDir(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	delete fMan;
 	}
 
@@ -451,11 +451,11 @@
 	test(path.DrivePresent()==EFalse);
 
 	TInt r=TheFs.SetSessionPath(aSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MkDirAll(gSessionPath);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	}
 
 GLDEF_C TInt CurrentDrive()
@@ -466,7 +466,7 @@
 
 	TInt driveNum;
 	TInt r=TheFs.CharToDrive(gSessionPath[0],driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return(driveNum);
 	}
 
@@ -482,11 +482,11 @@
 	RFormat format;
 	TInt count;
 	TInt r=format.Open(TheFs,driveBuf,EHighDensity,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	while(count)
 		{
 		TInt r=format.Next(count);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	format.Close();
 	}
@@ -512,10 +512,10 @@
 	gSessionPath=_L("?:\\F32-TST\\");
 	TChar driveLetter;
 	TInt r=TheFs.DriveToChar(aDrive,driveLetter);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	gSessionPath[0]=(TText)driveLetter;
 	r=TheFs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 // !!! Disable platform security tests until we get the new APIs
 //	if(User::Capability() & KCapabilityRoot)
@@ -624,7 +624,7 @@
 	test.Start(_L("Starting tests..."));
 
 	r=TheFs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	ParseCommandArguments(); //need this for drive letter to test
 
@@ -649,7 +649,7 @@
 
 	TInt theDrive;
 	r=TheFs.CharToDrive(gDriveToTest,theDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	// set up debug register
 	test.Printf(_L("debug register = 0x%X"), gDebugFlags);
@@ -665,7 +665,7 @@
 	endTimeC.HomeTime();
 	TTimeIntervalSeconds timeTakenC;
 	r=endTimeC.SecondsFrom(timerC,timeTakenC);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("Time taken for test = %d seconds\n"),timeTakenC);
 	TheFs.SetAllocFailure(gAllocFailOff);
 	TheFs.Close();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/concur/t_cfsperform.cpp
--- a/kerneltest/f32test/concur/t_cfsperform.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/concur/t_cfsperform.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -17,6 +17,7 @@
 
 //! @file f32test\concur\t_cfsbench.cpp
 
+#define	__E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <f32dbg.h>
@@ -82,7 +83,7 @@
 		return EFalse;
 	TDriveInfo info;
 	r=TheFs.Drive(info,drv);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return (info.iDriveAtt != 0 && !(info.iDriveAtt & KDriveAttRom));
 	}
 
@@ -95,19 +96,19 @@
 	TBuf<64> b;
 	TChar c;
 	r=TheFs.DriveToChar(aDrive,c);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	b.Format(_L("Mount test file system on %c:"),(TUint)c);
 	test.Next(b);
 
 	r=TheFs.AddFileSystem(KFsFile);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	
 	r=TheFs.FileSystemName(gOldFsName,aDrive);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	TDriveInfo drv;
 	r = TheFs.Drive(drv, aDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	gNoMedia = (drv.iType == EMediaUnknown || drv.iType == EMediaNotPresent);
 
@@ -115,14 +116,14 @@
 		{
 		TTest::Printf(_L("Dismount %C: %S"), (TUint)c, &gOldFsName);
 		r=TheFs.DismountFileSystem(gOldFsName,aDrive);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 
 	r=TheFs.MountFileSystem(KFsName,aDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.FileSystemName(gNewFsName,aDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(gNewFsName.CompareF(KFsName)==0);
 	return c;
 	}
@@ -132,9 +133,9 @@
 	{
 	TChar c;
 	TInt r=TheFs.DriveToChar(aDrive,c);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.DismountFileSystem(gNewFsName,aDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// if there's no media present, don't try to mount it
 	if (gNoMedia)
 		{
@@ -144,7 +145,7 @@
 		{
 		test.Printf(_L("Mount    %C: %S"), (TUint)c, &gOldFsName);
 		r=TheFs.MountFileSystem(gOldFsName,aDrive);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	if (r != KErrNone)
 		test.Printf(_L("Error %d remounting %S on %C\n"), r, &gOldFsName, (TUint)c);
@@ -159,7 +160,7 @@
 	TChar c;
 	TInt r=TheFs.DriveToChar(aDrive,c);
 	r=TheFs.FileSystemName(gFsName, aDrive);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	if (gFsName.Length() > 0)
 		{
@@ -183,7 +184,7 @@
 	r=TheFs.MountFileSystem(gFsName, aDrive);
 #endif
 
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 enum TOper
@@ -357,7 +358,7 @@
 
 		TInt sizeFile = 0;
 		r = iF.Size(sizeFile);
-		test(r == KErrNone);
+		test_KErrNone(r);
         if (gVerbose)
 			{
 			test.Printf(_L("File Size = %d, %d buffers of size %d\n"), sizeFile, iMax, iBufSize);
@@ -468,10 +469,7 @@
 	for (TInt pos=0; pos<iFileSize; pos+= buf->Length())
 		{
 		r = iF.Write(pos, bufptr);
-		if (r != KErrNone)
-			test.Printf(_L("Write() returned %d\n"), r);
-
-		test(r == KErrNone);
+		test_KErrNone(r);
 		}
 	delete buf; buf = NULL;
 
@@ -652,15 +650,15 @@
 
 
 	r = TheFs.DriveToChar(aDrive1, dc1);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = TheFs.DriveToChar(aDrive2, dc2);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	// allocate buffers
 	r = f1.Init(dc1, aBufSize1);
-		test(r == KErrNone);
+	test_KErrNone(r);
 	r = f2.Init(dc2, aBufSize2);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	
 	_LIT(KSync, " sync");
@@ -686,21 +684,21 @@
 		if (aBufSize1 > 0)
 			{
 			r = f1.CreateReadFile();
-			test(r == KErrNone);
+			test_KErrNone(r);
 			}
 		if (aBufSize2 > 0)
 			{
 			r = f2.CreateReadFile();
-			test(r == KErrNone);
+			test_KErrNone(r);
 			}
 
 		if (aBufSize1 > 0)
 			r = f1.Open(RFileOps::ERead);
-		test(r == KErrNone);
+		test_KErrNone(r);
 		
 		if (aBufSize2 > 0)
 			r = f2.Open(RFileOps::ERead);
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 
 		timer.After(tstat, KTimeBM * KSecond);
@@ -740,13 +738,13 @@
 		if (aBufSize1 > 0)
 			{
 			r = f1.Open(RFileOps::EWrite);
-			test(r == KErrNone);
+			test_KErrNone(r);
 			}
 	
 		if (aBufSize2 > 0)
 			{
 			r = f2.Open(RFileOps::EWrite);
-			test(r == KErrNone);
+			test_KErrNone(r);
 			}
 
 		timer.After(tstat, KTimeBM * KSecond);
@@ -904,7 +902,7 @@
 GLDEF_C void CallTestsL()
 	{
 	TInt r = TTest::Init();
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	TChar drvch1 = 0;
 	TChar drvch2 = 0;
@@ -963,14 +961,14 @@
 		}
 
 	r = TheFs.CharToDrive(drvch1, drive1);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = TheFs.CharToDrive(drvch2, drive2);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	r = TheFs.FileSystemName(gFsName1, drive1);
-	test(r == KErrNone || r == KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 	r = TheFs.FileSystemName(gFsName2, drive2);
-	test(r == KErrNone || r == KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 
 	if (testFs)
 		{
@@ -1051,7 +1049,7 @@
 		UnmountFileSystem(drive1);
 		UnmountFileSystem(drive2);
 		}
-	test(r == 0);
+	test_Value(r, r == 0);
 	}
 
 
@@ -1069,7 +1067,7 @@
     test.Start(_L("Starting tests..."));
 
     r=TheFs.Connect();
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     // TheFs.SetAllocFailure(gAllocFailOn);
     TTime timerC;
@@ -1084,7 +1082,7 @@
     endTimeC.HomeTime();
     TTimeIntervalSeconds timeTakenC;
     r=endTimeC.SecondsFrom(timerC,timeTakenC);
-    test(r==KErrNone);
+    test_KErrNone(r);
     test.Printf(_L("Time taken for test = %d seconds\n"),timeTakenC.Int());
     // TheFs.SetAllocFailure(gAllocFailOff);
     TheFs.Close();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/fileshare/handshare.cpp
--- a/kerneltest/f32test/fileshare/handshare.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/fileshare/handshare.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -16,6 +16,7 @@
 //
 
 #include <e32svr.h>
+#define __E32TEST_EXTENSION__
 #include <e32test.h>
 #include "handshare.h"
 
@@ -151,9 +152,9 @@
 			// stop server2
 			RFileHandleSharer2 handsvr2;
 			TInt r=handsvr2.Connect();
-			test(r==KErrNone);
+			test_KErrNone(r);
 			r = handsvr2.Exit();
-			test(r==KErrNone || r == KErrServerTerminated);
+			test_Value(r, r ==KErrNone || r == KErrServerTerminated);
 			handsvr2.Close();
 
 			aMessage.Complete(KErrNone);	
@@ -190,29 +191,29 @@
 	RFs fs;
 	TInt r=fs.Connect();
 	r=fs.CreatePrivatePath(gTestDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionToPrivate(gTestDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.ShareProtected();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFile file1;
 	r=file1.Create(fs,KSvrFileName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r ==KErrNone || r==KErrAlreadyExists);
 	if (r==KErrAlreadyExists)
 		{
 		r=file1.Open(fs,KSvrFileName, EFileWrite);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	r=file1.Write(KTestData1());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(fs,KSvrFileName, fileMode);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TInt fssh=file1.SubSessionHandle();
 	r=aMsg.Write(0, TPckgC<TInt>(fssh));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	aMsg.Complete(fs);
 	fs.Close();
 	}
@@ -232,32 +233,32 @@
 
 	RFileHandleSharer2 handsvr2;
 	TInt r = handsvr2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TInt ssh;
 	TInt fsh = handsvr2.GetFileHandle(ssh, TFileMode(fileMode));
-	test(fsh >= 0);
+	test_Value(fsh, fsh >= 0);
 
 	// adopt the file from FHServer2
 	RFile file;
 	r=file.AdoptFromServer(fsh, ssh);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("RFile::TransferToClient()"));
 
 	// transfer the file to the client
 	r = file.TransferToClient(aMsg, 0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// test we can still use the file
 	TInt pos = 0;
 	r = file.Seek(ESeekStart, pos);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<100> rbuf;
 	r=file.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData1());
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	handsvr2.Close();
 
@@ -277,28 +278,28 @@
 	// connect to FHServer2
 	RFileHandleSharer2 handsvr2;
 	TInt r = handsvr2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile file;
 
 	// Message slot 0 is a RFs handle
 	// Message slot 1 is a RFile Subsession handle (RFile::SubSessionHandle())
 	r = file.AdoptFromClient(aMsg, 0, 1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 
 	TBuf8<100> rbuf;
 	r=file.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(KTestData1());
-	test(r==KErrAccessDenied);
+	test_Value(r, r ==KErrAccessDenied);
 	r=file.ChangeMode(EFileWrite);
-	test(r==KErrArgument);
+	test_Value(r, r ==KErrArgument);
 	r=file.Rename(_L("\\newname.txt"));
-	test(r==KErrPermissionDenied || r==KErrAccessDenied);
+	test_Value(r, r ==KErrPermissionDenied || r==KErrAccessDenied);
 //	should try a delete
 
 	// pass the file handle to FHServer2
@@ -307,15 +308,15 @@
 	TIpcArgs ipcArgs;
 	file.TransferToServer(ipcArgs, 0, 1);
 	r = handsvr2.PassFileHandle(ipcArgs);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TInt pos = 0;
 	r = file.Seek(ESeekStart, pos);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	file.Close();
 
@@ -334,33 +335,33 @@
 
 	RFile file;
 	TInt r = file.AdoptFromCreator(1, 2);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	TBuf8<100> rbuf;
 	r=file.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData());
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("RFile::Rename()"));
 
 	// define a filename in our private path
 	RFs fs;
 	r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TFileName sessionp;
 	fs.SessionPath(sessionp);
 	r = fs.MkDirAll(sessionp);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r ==KErrNone || r==KErrAlreadyExists);
 
 	r=fs.ShareProtected();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=fs.CreatePrivatePath(gTestDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionToPrivate(gTestDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TPath newPath;
 	fs.PrivatePath(newPath);
@@ -370,10 +371,10 @@
 	
 	// delete the file before we try to rename anything to it
 	r = fs.Delete(newFileName);
-	test(r == KErrNone || r == KErrNotFound);
+	test_Value(r, r  == KErrNone || r == KErrNotFound);
 
 	r=file.Rename(newFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	file.Close();
 
@@ -381,7 +382,7 @@
 	// have been moved to our private directory)
 	test.Next(_L("RFs::Delete()"));
 	r = fs.Delete(newFileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	fs.Close();
 
@@ -402,7 +403,7 @@
 	// Message slot 0 is a RFs handle
 	// Message slot 1 is a RFile Subsession handle (RFile::SubSessionHandle())
 	TInt r = file.AdoptFromClient(aMsg, 0, 1);
-	test(r==KErrBadHandle);
+	test_Value(r, r ==KErrBadHandle);
 
 
 	aMsg.Complete(r);
@@ -647,10 +648,10 @@
 	// Sanity check for open handles
 	TInt end_thc, end_phc;
 	RThread().HandleCount(end_phc, end_thc);
-	test(start_thc == end_thc);
+	test_Value(start_thc, start_thc == end_thc);
 //	test(start_phc == end_phc);
 	// and also for pending requests ...
-	test(RThread().RequestCount() == 0);
+	test_Value(RThread().RequestCount(), RThread().RequestCount() == 0);
 
 	
 	return KErrNone;
@@ -689,7 +690,7 @@
 	// start server2 in a seperate thread
 	RThread server2Thread;
 	TInt r = server2Thread.Create(_L("FHServer2"), FHServer2, KDefaultStackSize, KHeapSize, KHeapSize, NULL);	
-	test(r==KErrNone);	
+	test_KErrNone(r);	
 	TRequestStatus statq;
 	server2Thread.Logon(statq);
 	server2Thread.Resume();
@@ -699,17 +700,17 @@
 
 	// wait for server2's thread to end gracefully
 	User::WaitForRequest(statq);
-	test(statq == KErrNone);
+	test_KErrNone(statq.Int());
 
 	server2Thread.Close();
 
 	RFs cleanupfs;
 	r = cleanupfs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=cleanupfs.SetSessionToPrivate(gTestDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=cleanupfs.Delete(KSvrFileName);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r ==KErrNone || r==KErrNotFound);
 	cleanupfs.Close();
 
 
@@ -722,9 +723,9 @@
 	// Sanity check for open handles and pending requests
 	TInt end_thc, end_phc;
 	RThread().HandleCount(end_phc, end_thc);
-	test(start_thc == end_thc);
-	test(start_phc == end_phc);
-	test(RThread().RequestCount() == 0);
+	test_Value(start_thc, start_thc == end_thc);
+	test_Value(start_phc, start_phc == end_phc);
+	test_Value(RThread().RequestCount(), RThread().RequestCount() == 0);
 	
 	return 0;
 	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/fileshare/handshare64bit.cpp
--- a/kerneltest/f32test/fileshare/handshare64bit.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/fileshare/handshare64bit.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -18,7 +18,7 @@
 // 
 //
 
-
+#define __E32TEST_EXTENSION__
 #include <e32svr.h>
 #include <e32test.h>
 #include "handshare64bit.h"
@@ -162,7 +162,7 @@
 	if (r == KErrNone)
 	r = file1.Replace(fs,KServerFileName,EFileWrite);
 	r=file1.SetSize(K4GB-1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = file1.Write(K4GB-10,KTestData4());
 		
 	file1.Close();
@@ -178,17 +178,17 @@
 
 	// transfer the file to the client
 	r = file1.TransferToClient(aMsg, 0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// test we can still use the file
 	TInt64 pos = 0;
 	r = file1.Seek(ESeekStart, pos);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	TBuf8<9> rbuf;
 	r=file1.Read(K4GB-10,rbuf);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData4());
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	file1.Close();
 	fs.Close();
@@ -209,19 +209,19 @@
 	// Message slot 0 is a RFs handle
 	// Message slot 1 is a RFile Subsession handle (RFile::SubSessionHandle())
 	TInt r = file.AdoptFromClient(aMsg, 0, 1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TBuf8<9> rbuf;
 	r=file.Read(K4GB-10,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData3());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(KTestData1());
-	test(r==KErrAccessDenied);
+	test_Value(r, r==KErrAccessDenied);
 	r=file.ChangeMode(EFileWrite);
-	test(r==KErrArgument);
+	test_Value(r, r==KErrArgument);
 	r=file.Rename(_L("\\newname.txt"));
-	test(r==KErrPermissionDenied || r==KErrAccessDenied);
+	test_Value(r, r==KErrPermissionDenied || r==KErrAccessDenied);
 	file.Close();
 
 	aMsg.Complete(KErrNone);
@@ -237,33 +237,33 @@
 
 	RFile64 file;
 	TInt r = file.AdoptFromCreator(1, 2);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	TBuf8<3> rbuf;
 	r=file.Read(K4GB-10,rbuf,3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData2());
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("RFile::Rename()"));
 
 	// define a filename in our private path
 	RFs fs;
 	r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TFileName sessionp;
 	fs.SessionPath(sessionp);
 	r = fs.MkDirAll(sessionp);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r==KErrNone || r==KErrAlreadyExists);
 
 	r=fs.ShareProtected();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=fs.CreatePrivatePath(gTestDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionToPrivate(gTestDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TPath newPath;
 	fs.PrivatePath(newPath);
@@ -273,14 +273,14 @@
 	
 	// delete the file before we try to rename anything to it
 	r = fs.Delete(newFileName);
-	test(r == KErrNone || r == KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 
 	TFileName fileName;
 	r = file.FullName(fileName);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	
 	r=file.Rename(newFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	file.Close();
 
@@ -288,7 +288,7 @@
 	// have been moved to our private directory)
 	test.Next(_L("RFs::Delete()"));
 	r = fs.Delete(newFileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	fs.Close();
 
@@ -376,11 +376,11 @@
 
 	RFs cleanupfs;
 	TInt r = cleanupfs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=cleanupfs.SetSessionToPrivate(gTestDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=cleanupfs.Delete(KSvrFileName);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r==KErrNone || r==KErrNotFound);
 	cleanupfs.Close();
 
 
@@ -393,9 +393,9 @@
 	// Sanity check for open handles and pending requests
 	TInt end_thc, end_phc;
 	RThread().HandleCount(end_phc, end_thc);
-	test(start_thc == end_thc);
-	test(start_phc == end_phc);
-	test(RThread().RequestCount() == 0);
+	test_Value(start_thc, start_thc == end_thc);
+	test_Value(start_phc, start_phc == end_phc);
+	test_Value(RThread().RequestCount(), RThread().RequestCount() == 0);
 	
 	return 0;
 	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/fileshare/t_handshare.cpp
--- a/kerneltest/f32test/fileshare/t_handshare.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/fileshare/t_handshare.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define	__E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -41,49 +42,49 @@
 		r=handsvr.Connect();
 		}
 		while(r==KErrNotFound);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=handsvr.SetTestDrive(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt ssh;
 	RFs fs1;
 	TInt fsh = handsvr.GetFileHandle(ssh, EFileRead);
 
 	r = fs1.SetReturnedHandle(fsh);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	RFile file;
 	r=file.Adopt(fs1,ssh);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TBuf8<100> rbuf;
 	r=file.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=rbuf.CompareF(KTestData1());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file.Write(KTestData());
-	test(r==KErrAccessDenied);
+	test_Value(r, r==KErrAccessDenied);
 	
 	r=file.ChangeMode(EFileWrite);
-	test(r==KErrArgument);
+	test_Value(r, r==KErrArgument);
 	
 	r=file.Rename(_L("\\newname.txt"));
-	test(r==KErrPermissionDenied || r==KErrAccessDenied);
+	test_Value(r, r==KErrPermissionDenied || r==KErrAccessDenied);
 
 	file.Close();
 
 	fsh = handsvr.GetFileHandle(ssh, EFileRead);
 	r = fs1.SetReturnedHandle(fsh);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Adopt a bad sub-session handle
 
 	r=file.Adopt(fs1, KNullHandle);
-	test(r==KErrBadHandle);
+	test_Value(r, r==KErrBadHandle);
 
 	r=file.Adopt(fs1, -1);
-	test(r==KErrBadHandle);
+	test_Value(r, r==KErrBadHandle);
 
 
 	handsvr.Close();
@@ -101,43 +102,43 @@
 
 	RFs fs;
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Check the number of open file handles
 	TInt resCount = fs.ResourceCount();
-	test(resCount == 0);
+	test_Value(resCount, resCount == 0);
 
 	// create a file & fill it with data	
 	RFile file1;
 	r=file1.Replace(fs,KCliFileName,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file1.Write(KTestData());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	// open the file for read
 	r = file1.Open(fs,KCliFileName,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<100> rbuf;
 	r = file1.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 	// clone the file
 	RFile file2;
 	r = file2.Duplicate(file1);
-	test(r==0);
+	test_Value(r, r==0);
 
 	// make sure file positions are the same
 	TInt pos1 = 0;
 	r = file1.Seek(ESeekCurrent, pos1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt pos2 = 0;
 	r = file2.Seek(ESeekCurrent, pos2);
-	test(r==KErrNone);
-	test(pos1 == pos2);
+	test_KErrNone(r);
+	test_Value(pos1, pos1 == pos2);
 
 	// change the position on the duplcated file handle & 
 	// verify that the original file handle's position is unchanged
@@ -146,25 +147,25 @@
 	const TInt newPos2 = 5;
 	pos2 = newPos2;
 	r = file2.Seek(ESeekStart, pos2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	pos1 = 0;
 	r = file1.Seek(ESeekCurrent, pos1);
-	test(r==KErrNone);
-	test(pos1 == oldPos1);
+	test_KErrNone(r);
+	test_Value(pos1, pos1 == oldPos1);
 	
 	pos2 = 0;
 	r = file2.Seek(ESeekCurrent, pos2);
-	test(r==KErrNone);
-	test(pos2 == newPos2);
-	test(pos1 != pos2);
+	test_KErrNone(r);
+	test_Value(pos2, pos2 == newPos2);
+	test_Value(pos1, pos1 != pos2);
 
 	// close the parent file and check we can still use the duplicated one.
 	file1.Close();
 
 	// Check the number of open file handles - should be 1 (the duplicated one)
 	resCount = fs.ResourceCount();
-	test(resCount == 1);
+	test_Value(resCount, resCount == 1);
 
 	fs.Close();
 
@@ -173,36 +174,36 @@
 	// reset to pos 0
 	pos2 = 0;
 	r = file2.Seek(ESeekStart, pos2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file2.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file2.Close();
 
 	// start again - this time we're going to close the duplicated file first
 	// and check we can still use the parent file
 
 	r = fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Make a note of the number of open resources
 	fs.ResourceCountMarkStart();
 
 	// open the file for read
 	r = file1.Open(fs,KCliFileName,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 	// clone the file & check we can read it
 	r = file2.Duplicate(file1, EOwnerThread);
-	test(r==0);
+	test_Value(r, r==0);
 	rbuf.FillZ();
 	r = file2.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 	// close the duplicated file and check we can still use the parent one.
@@ -212,9 +213,9 @@
 
 	// check we can read the parent file
 	r=file1.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// close the parent
 	file1.Close();
@@ -222,7 +223,7 @@
 	// Check the number of open file handles
 	fs.ResourceCountMarkEnd();
 	resCount = fs.ResourceCount();
-	test(resCount == 0);
+	test_Value(resCount, resCount == 0);
 
 	fs.Close();
 	}
@@ -239,10 +240,10 @@
 		r=handsvr.Connect();
 		}
 	while(r==KErrNotFound);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=handsvr.SetTestDrive(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TInt ssh;
 	TInt fsh = handsvr.GetFileHandle2(ssh, EFileWrite);
@@ -260,57 +261,57 @@
 
 	RFile file;
 	r=file.AdoptFromServer(fsh, ssh);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TBuf8<100> rbuf;
 	r=file.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// server should write KTestData1 ("Server Write Server Write") to file
 	r=rbuf.CompareF(KTestData1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// reset to pos 0
 	TInt pos = 0;
 	r = file.Seek(ESeekStart, pos);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	// overwrite with KTestData ("Client Write Client Write") to file
 	r=file.Write(KTestData());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	rbuf.FillZ();
 	r=file.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 // !!! Disable platform security tests until we get the new APIs
 //	r=file.Rename(_L("\\newname.txt"));
-//	test(r==KErrPermissionDenied);
+//	test_Value(r, r==KErrPermissionDenied);
 
 	test.Next(_L("RFile::Name()"));
 
 	// retrieve the file name from the server
 	TFileName name;
 	r = file.Name(name);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = name.Compare(KSvrFileName());
-	test(r==0);
+	test_Value(r, r==0);
 	
 
 	test.Next(_L("RFile::Duplicate()"));
 	RFile file2;
 	r = file2.Duplicate(file);
-	test(r==0);
+	test_Value(r, r==0);
 
 
 	TInt pos1 = 0;
 	r = file.Seek(ESeekCurrent, pos1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt pos2 = 0;
 	r = file2.Seek(ESeekCurrent, pos2);
-	test(r==KErrNone);
-	test(pos1 == pos2);
+	test_KErrNone(r);
+	test_Value(pos1, pos1 == pos2);
 
 	// close the parent file and check we can still use the duplicated one.
 	file.Close();
@@ -320,12 +321,12 @@
 	// reset to pos 0
 	pos2 = 0;
 	r = file2.Seek(ESeekStart, pos2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file2.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file2.Close();
 	}
 
@@ -339,9 +340,9 @@
 
 	RFs fs;
 	r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.ShareProtected();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	
 	// define a filename in our private path
@@ -352,7 +353,7 @@
 	newFileName.Append(_L("newname.txt"));
 	
 	r=fs.CreatePrivatePath(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionToPrivate(drivenum);
 
 	RFileHandleSharer handsvr;
@@ -361,10 +362,10 @@
 		r=handsvr.Connect();
 		}
 	while(r==KErrNotFound);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=handsvr.SetTestDrive(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Next verify that we can copy a file retrieved from the server
 	// using CFileMan::Copy()
@@ -377,35 +378,35 @@
 
 	RFile file;
 	r=file.AdoptFromServer(fsh, ssh);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 	CFileMan* fileMan = NULL;
 	TRAP(r, fileMan = CFileMan::NewL(fs));
-	test(r == KErrNone && fileMan != NULL);
+	test_Value(r, r ==  KErrNone && fileMan != NULL);
 
 	// copy to file, overwrite 
 	r = fileMan->Copy(file, newFileName, CFileMan::EOverWrite);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	// copy to file, don't overwrite 
 	r = fileMan->Copy(file, newFileName, 0);	
-	test(r == KErrAlreadyExists);
+	test_Value(r, r ==  KErrAlreadyExists);
 
 	// copy to file, overwrite
 	r = fileMan->Copy(file, newFileName, CFileMan::EOverWrite);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	// copy to path
 	r = fileMan->Copy(file, newPath, CFileMan::EOverWrite);	
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	// copy to file, overwrite, asynchnonous
 	TRequestStatus status(KRequestPending);
 	r = fileMan->Copy(file, newFileName, CFileMan::EOverWrite, status);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(status);
-	test(status == KErrNone);
+	test_KErrNone(status.Int());
 
 
 	// Negative tests...
@@ -418,7 +419,7 @@
 	for (len=newLongPath.Length(); len< KMaxPath -4; len = newLongPath.Length())
 		newLongPath.Append(_L("x\\"));
 	r = fileMan->Copy(file, newLongPath, CFileMan::EOverWrite);	
-	test(r == KErrBadName);
+	test_Value(r, r ==  KErrBadName);
 
 	// copy to very long but valid path (no filename) which will overflow
 	// when drive letter is pre-pended to it
@@ -426,25 +427,25 @@
 	for (len=newLongPath.Length(); len< KMaxPath -2; len = newLongPath.Length())
 		newLongPath.Append(_L("x\\"));
 	r = fileMan->Copy(file, newLongPath, CFileMan::EOverWrite);	
-	test(r == KErrBadName);
+	test_Value(r, r ==  KErrBadName);
 
 	// copy to very long but valid path and filename which will overflow
 	// when drive letter is pre-pended to it
 	newLongPath.Append(_L("y"));
 	r = fileMan->Copy(file, newLongPath, CFileMan::EOverWrite);	
-	test(r == KErrBadName);
+	test_Value(r, r ==  KErrBadName);
 
 	// copy to badly formed path 
 	newLongPath = newPath;
 	newLongPath.Append(_L("\\y"));
 	r = fileMan->Copy(file, newLongPath, CFileMan::EOverWrite);	
-	test(r == KErrBadName);
+	test_Value(r, r ==  KErrBadName);
 
 	// copy to correctly formed path which doesn't exist
 	newLongPath = newPath;
 	newLongPath.Append(_L("x\\y\\z"));
 	r = fileMan->Copy(file, newLongPath, CFileMan::EOverWrite);	
-	test(r == KErrPathNotFound);
+	test_Value(r, r ==  KErrPathNotFound);
 
 	delete fileMan; fileMan = NULL;
 
@@ -461,17 +462,17 @@
 
 	// adopt the file handle from FHServer
 	r=file.AdoptFromServer(fsh, ssh);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file.Rename(_L("newname.txt"));
-	test(r==KErrPermissionDenied || r==KErrAccessDenied);
+	test_Value(r, r==KErrPermissionDenied || r==KErrAccessDenied);
 
 	// delete the file before we try to rename anything to it
 	r = fs.Delete(newFileName);
-	test(r == KErrNone || r == KErrNotFound);
+	test_Value(r, r ==  KErrNone || r == KErrNotFound);
 
 	r=file.Rename(newFileName);
-	test(r==KErrPermissionDenied || r==KErrAccessDenied);
+	test_Value(r, r==KErrPermissionDenied || r==KErrAccessDenied);
 
 	file.Close();
 
@@ -485,14 +486,14 @@
 	test (fsh >= 0);
 
 	r=file.AdoptFromServer(fsh, ssh);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// delete the file before we try to rename anything to it
 	r = fs.Delete(newFileName);
-	test(r == KErrNone || r == KErrNotFound);
+	test_Value(r, r ==  KErrNone || r == KErrNotFound);
 
 	r=file.Rename(newFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	file.Close();
 
@@ -500,7 +501,7 @@
 	// have been moved to our private directory)
 	test.Next(_L("RFs::Delete()"));
 	r = fs.Delete(newFileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	handsvr.Close();
 
@@ -515,25 +516,25 @@
 	{
 	RFs fs;
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Check the number of open file handles
 	TInt resCount = fs.ResourceCount();
-	test(resCount == 0);
+	test_Value(resCount, resCount == 0);
 
 	r=fs.ShareProtected();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=fs.CreatePrivatePath(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionToPrivate(drivenum);
 	
 	
 	RFile file1;
 	r=file1.Replace(fs,KCliFileName,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file1.Write(KTestData());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	RFileHandleSharer handsvr;
@@ -542,16 +543,16 @@
 		r=handsvr.Connect();
 		}
 	while(r==KErrNotFound);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=handsvr.SetTestDrive(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=fs.SetSessionToPrivate(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Open(fs,KCliFileName,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	// pass the file handle to FHServer
 	test.Next(_L("RFile::TransferToServer()"));
@@ -565,13 +566,13 @@
 	// verify that the original file handle's position is unchanged
 	TInt pos = 0;
 	r = file1.Seek(ESeekCurrent, pos);
-	test(r==KErrNone);
-	test(pos == 0);
+	test_KErrNone(r);
+	test_Value(pos, pos == 0);
 
 	// make sure we can still use it
 	TBuf8<100> rbuf;
 	r=file1.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Close the file
 	file1.Close();	
@@ -579,11 +580,11 @@
 	handsvr.Close();
 
 	r=fs.MkDir(_L("C:\\mdir"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r==KErrNone || r==KErrAlreadyExists);
 	
 	// Check the number of open file handles
 	resCount = fs.ResourceCount();
-	test(resCount == 0);
+	test_Value(resCount, resCount == 0);
 
 	fs.Close();
 	}
@@ -598,25 +599,25 @@
 
 	RFs fs;
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Check the number of open file handles
 	TInt resCount = fs.ResourceCount();
-	test(resCount == 0);
+	test_Value(resCount, resCount == 0);
 
 	r=fs.ShareProtected();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=fs.CreatePrivatePath(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionToPrivate(drivenum);
 	
 	
 	RFile file1;
 	r=file1.Replace(fs,KCliFileName,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file1.Write(KTestData());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	RFileHandleSharer handsvr;
@@ -625,20 +626,20 @@
 		r=handsvr.Connect();
 		}
 	while(r==KErrNotFound);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=handsvr.SetTestDrive(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=fs.SetSessionToPrivate(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Open(fs,KCliFileName,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	// check the resoure count - there should be 1 open file handle
 	resCount = fs.ResourceCount();
-	test(resCount == 1);
+	test_Value(resCount, resCount == 1);
 
 	// pass an invalid file handle to FHServer
 	// by overwriting the IPC slots
@@ -651,35 +652,35 @@
 
 	// check the resoure count - there should be 2 open file handles
 	resCount = fs.ResourceCount();
-	test(resCount == 2);
+	test_Value(resCount, resCount == 2);
 
 	ipcArgs.Set(0, 0);	// invalidate the RFs handle
 	r = handsvr.PassInvalidFileHandle(ipcArgs);
-	test (r == KErrBadHandle);
+	test_Value(r, r == KErrBadHandle);
 
 	// Pass a bad RFile handle
 	file1.TransferToServer(ipcArgs, 0, 1);
 
 	// check the resoure count - there should be 3 open file handles
 	resCount = fs.ResourceCount();
-	test(resCount == 3);
+	test_Value(resCount, resCount == 3);
 
 	ipcArgs.Set(1, 0);	// invalidate the RFile handle
 	r = handsvr.PassInvalidFileHandle(ipcArgs);
-	test (r == KErrBadHandle);
+	test_Value(r, r == KErrBadHandle);
 
 	// Pass bad RFs and RFile handles
 	file1.TransferToServer(ipcArgs, 0, 1);
 
 	// check the resoure count - there should be 4 open file handles
 	resCount = fs.ResourceCount();
-	test(resCount == 4);
+	test_Value(resCount, resCount == 4);
 
 
 	ipcArgs.Set(0, 0);	// invalidate the RFs handle
 	ipcArgs.Set(1, 0);	// invalidate the RFile handle
 	r = handsvr.PassInvalidFileHandle(ipcArgs);
-	test (r == KErrBadHandle);
+	test_Value(r, r == KErrBadHandle);
 
 	// Close the file
 	handsvr.Close();
@@ -687,7 +688,7 @@
 
 	// Check the number of open file handles
 	resCount = fs.ResourceCount();
-	test(resCount == 3);
+	test_Value(resCount, resCount == 3);
 
 	fs.Close();
 	}
@@ -702,30 +703,30 @@
 	
 	RFs fs;
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Check the number of open file handles
 	TInt resCount = fs.ResourceCount();
-	test(resCount == 0);
+	test_Value(resCount, resCount == 0);
 
 	r=fs.ShareProtected();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=fs.CreatePrivatePath(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionToPrivate(drivenum);
 	
 	
 	RFile file1;
 	r=file1.Replace(fs,KCliFileName,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file1.Write(KTestData());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(fs, KCliFileName, EFileWrite);
 
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	// NB slot 0 is reserved for the command line
 
@@ -734,26 +735,26 @@
 	r = file1.TransferToProcess(aProcess, 1, 2);
 
 	r = aProcess.SetParameter(3, drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=fs.SetSessionToPrivate(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// make sure we can still read from the file
 	TBuf8<100> rbuf;
 	r=file1.Read(0,rbuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rbuf.CompareF(KTestData());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=fs.MkDir(_L("C:\\mdir"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r==KErrNone || r==KErrAlreadyExists);
 	
 	// Check the number of open file handles - 
 	// should be 1 (the one duplicated for the other process)
 	resCount = fs.ResourceCount();
-	test(resCount == 1);
+	test_Value(resCount, resCount == 1);
 
 	fs.Close();
 
@@ -769,15 +770,15 @@
 		r=handsvr.Connect();
 		}
 	while(r==KErrNotFound);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 	r=handsvr.SetTestDrive(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// wait for server to read the file
 	r = handsvr.PassFileHandleProcess();
-	test (r == KErrNone);
+	test_KErrNone(r);
 	
 	handsvr.Close();
 	}
@@ -791,12 +792,12 @@
 	// make sure the session path exists
 	RFs fs;
 	TInt r = fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TFileName sessionp;
 	fs.SessionPath(sessionp);
 	r = fs.MkDirAll(sessionp);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r==KErrNone || r==KErrAlreadyExists);
 	fs.Close();
 
 	// Remember the number of open handles. Just for a sanity check ....
@@ -807,7 +808,7 @@
 	//create test server
 	RProcess p;
 	r = p.Create(_L("FHServer.exe"), KNullDesC);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// RFile::Duplicate() tests
 	Duplicate();
@@ -825,7 +826,6 @@
 	// Get an open writeable file from FHServer2 via FHServer 
 	// using RFile::AdoptFromServer()
 	RequestFileWrite();
-
 	// Deprecated RFile::Adopt() test
 	RequestFileDeprecatedAdopt();
 
@@ -842,19 +842,19 @@
 	// stop the servers
 	RFileHandleSharer handsvr;
 	r=handsvr.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = handsvr.Exit();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	handsvr.Close();
 	
 	// delete the test file
 	RFs cleanupfs;
 	r=cleanupfs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=cleanupfs.SetSessionToPrivate(drivenum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=cleanupfs.Delete(KCliFileName);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r==KErrNone || r==KErrNotFound);
 	cleanupfs.Close();
 
 
@@ -872,11 +872,11 @@
 	RThread().HandleCount(end_phc, end_thc);
 	test.Printf(_L("Handles: end_phc %d, end_thc %d\n"), end_phc, end_thc);
 
-	test(start_thc == end_thc);
-	test(start_phc == end_phc);
+	test_Value(start_thc, start_thc == end_thc);
+	test_Value(start_phc, start_phc == end_phc);
 	
 	// and also for pending requests ...
-	test(RThread().RequestCount() == 0);
+	test_Value(RThread().RequestCount(), RThread().RequestCount() == 0);
 	
 	
 	RDebug::Print(_L("End Of Tests"));
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/filesystem/fat/b_fat32.cpp
--- a/kerneltest/f32test/filesystem/fat/b_fat32.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/filesystem/fat/b_fat32.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 //
 //
 
+#define	__E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32math.h>
@@ -148,10 +149,10 @@
         {
         pos += TheBootSector.ReservedSectors() * TheBootSector.BytesPerSector();
         TInt r=TheDisk.Open(TheFs,gSessionPath[0]-'A');
-        test(r==KErrNone);
+        test_KErrNone(r);
         TPtr8 buf(&data[0], 4);
         r=TheDisk.Read(pos, buf);
-        test(r==KErrNone);
+        test_KErrNone(r);
         TheDisk.Close();
         }
 
@@ -185,15 +186,15 @@
     pos += TheBootSector.ReservedSectors() * TheBootSector.BytesPerSector();
 
     TInt r=TheDisk.Open(TheFs,gSessionPath[0]-'A');
-    test(r==KErrNone);
+    test_KErrNone(r);
     TUint8  data[4];
     TPtr8 buf(&data[0], 4);
     r=TheDisk.Read(pos, buf);
-    test(r==KErrNone);
+    test_KErrNone(r);
     data[3] &= 0x0F;
     data[3] |= 0xA0;
     r=TheDisk.Write(pos, buf);
-    test(r==KErrNone);
+    test_KErrNone(r);
     TheDisk.Close();
         }
 
@@ -468,9 +469,9 @@
             test(buf!=NULL);
             TPtr8 ptr=buf->Des();
             TInt r=TheDisk.Open(TheFs,gSessionPath[0]-'A');
-            test(r==KErrNone);
+            test_KErrNone(r);
             r=TheDisk.Read(ClusterToByte(cluster), ptr);
-            test(r==KErrNone);
+            test_KErrNone(r);
             TheDisk.Close();
             RDebug::Print(_L("Cluster %d @ 0x%08X:"), cluster, ClusterToByte(cluster));
             DumpDirCluster(ptr.Ptr());
@@ -499,12 +500,12 @@
         test(buf!=NULL);
         TPtr8 ptr=buf->Des();
         TInt r=TheDisk.Open(TheFs,gSessionPath[0]-'A');
-        test(r==KErrNone);
+        test_KErrNone(r);
         RDebug::Print(_L("--------------- ROOT DIR ------------------"));
         for (TInt i = 0; i < num; i++)
             {
             r=TheDisk.Read(pos, ptr);
-            test(r==KErrNone);
+            test_KErrNone(r);
             if (!DumpDirEntry(ent, ptr.Ptr()))
                 break;
             pos += KSizeOfFatDirEntry;
@@ -763,7 +764,7 @@
         }
 
     TInt r=TheDisk.Open(TheFs,CurrentDrive());
-    test(r==KErrNone);
+    test_KErrNone(r);
     test(ReadWriteDWord(pos,mask,aValue)==KErrNone);
     TheDisk.Close();
     }
@@ -1083,7 +1084,7 @@
         Error(_L("Error deleting file"),r);
     RDebug::Print(_L("File removed"));
     r=TheFs.CheckDisk(gSessionPath);
-    test(r==KErrNone);
+    test_KErrNone(r);
     }
 
 static  void TestFatEntry(TUint16 aFileSize,TInt aCorruptFatCluster)
@@ -1096,22 +1097,22 @@
     FormatPack();
 
     r=TheFile.Replace(TheFs,_L("\\CORRUPT2.TMP"),EFileRead|EFileWrite);
-    test(r==KErrNone);
+    test_KErrNone(r);
     TheBuffer.SetLength(aFileSize);
     Mem::Fill(&TheBuffer[0],aFileSize,'A');
     r=TheFile.Write(TheBuffer);
-    test(r==KErrNone);
+    test_KErrNone(r);
     TheFile.Close();
 
     FatWrite(gFirstDataCluster,aCorruptFatCluster);
 
     TInt pos=0;
     r=TheFile.Open(TheFs,_L("\\CORRUPT2.TMP"),EFileRead|EFileWrite);
-    test(r==KErrNone || r==KErrCorrupt);
+    test_Value(r, r == KErrNone || r==KErrCorrupt);
     if (r==KErrNone)
         {
         r=TheFile.Seek(ESeekStart,pos);
-        test(r==KErrNone);
+        test_KErrNone(r);
         r=TheFile.Write(TheBuffer);
 
         if ((gDriveCacheFlags & EFileCacheWriteOn) && (r == KErrNone))
@@ -1129,9 +1130,9 @@
 
     pos=0;
     r=TheFile.Open(TheFs,_L("\\CORRUPT2.TMP"),EFileRead|EFileWrite);
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=TheFile.Seek(ESeekStart,pos);
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=TheFile.Write(TheBuffer);
 
     if ((gDriveCacheFlags & EFileCacheWriteOn) && (r == KErrNone))
@@ -1171,15 +1172,15 @@
     TheBuffer.SetLength(anInitialSize);
     Mem::Fill(&TheBuffer[0],anInitialSize,'A');
     r=TheFile.Write(TheBuffer);
-    test(r==KErrNone);
+    test_KErrNone(r);
     TheFile.Close();
 
     r=TheDisk.Open(TheFs,CurrentDrive());
-    test(r==KErrNone);
+    test_KErrNone(r);
     TPtr8 sectorBuf((TUint8*)pBuffer1->Ptr(),TheBootSector.BytesPerSector());
     TInt pos = gRootDirStart;
     r=TheDisk.Read(pos,sectorBuf);
-    test(r==KErrNone);
+    test_KErrNone(r);
     TFatDirEntry* pE=(TFatDirEntry*)pBuffer1->Ptr();
     while (pE->IsVFatEntry())   //  UNICODE entries are VFat by definition
         pE++;
@@ -1193,16 +1194,16 @@
     //-- the data
     TheDisk.Close();
     r=TheDisk.Open(TheFs,CurrentDrive());
-    test(r==KErrNone);
+    test_KErrNone(r);
 
 
     pos=0;
     TPtr8 buffer1(pBuffer1->Des());
     r=TheDisk.Read(pos,buffer1);
-    test(r==KErrNone);
+    test_KErrNone(r);
     TheDisk.Close();
     r=TheFs.Entry(_L("\\CORRUPT1.TMP"),TheEntry);
-    test(r==KErrNone || r==KErrCorrupt);
+    test_Value(r, r == KErrNone || r==KErrCorrupt);
     TTime saveTime=TheEntry.iModified;
     if (r!=KErrNone)
         saveTime.HomeTime();
@@ -1221,11 +1222,11 @@
         }
 
     r=TheDisk.Open(TheFs,CurrentDrive());
-    test(r==KErrNone);
+    test_KErrNone(r);
     pos=0;
     TPtr8 buffer2(pBuffer2->Des());
     r=TheDisk.Read(pos,buffer2);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     //-- this bit is dodgy. The buffers may differ because of volume finalisation stuff
     //-- FAT[1] and FSInfo sectors
@@ -1233,9 +1234,9 @@
     TheDisk.Close();
 
     r=TheFs.SetModified(_L("\\CORRUPT1.TMP"),saveTime);
-    test(r==KErrNone || r==KErrCorrupt);
+    test_Value(r, r == KErrNone || r==KErrCorrupt);
     r=TheFs.Entry(_L("\\CORRUPT1.TMP"),TheEntry);
-    test(r==KErrNone || r==KErrCorrupt);
+    test_Value(r, r == KErrNone || r==KErrCorrupt);
     }
 
 static  void TestBounds()
@@ -1247,7 +1248,7 @@
     test(TheFs.Volume(TheVolumeInfo,CurrentDrive())==KErrNone);
     TInt64 size=TheVolumeInfo.iSize;
     TInt r=TheDisk.Open(TheFs,CurrentDrive());
-    test(r==KErrNone);
+    test_KErrNone(r);
     TPtr8 buffer(pBuffer1->Des());
     TInt64 pos=size - 2*buffer.MaxLength();
     TInt inc=buffer.MaxLength();
@@ -1256,7 +1257,7 @@
         TPtr8 tempbuf((TUint8*)pBuffer1->Ptr(),inc);
         r=TheDisk.Read(pos,tempbuf);
         test.Printf(_L("Read %08X:%08X len %d r %d\r"), I64HIGH(pos),I64LOW(pos), inc, r);
-        test(r==KErrNone || r==KErrCorrupt);
+        test_Value(r, r == KErrNone || r==KErrCorrupt);
         if (r==KErrNone)
             pos+=inc;
         else
@@ -1294,7 +1295,7 @@
                 TInt expect = (lpos+bsize-1 < maxpos ? KErrNone : KErrCorrupt);
                 r=TheDisk.Read(lpos, temp);
                 RDebug::Print(_L("Read %08X:%08X result %d     \r"), I64HIGH(lpos), I64LOW(lpos), r);
-                test(r==expect);
+                test_Value(r, r == expect);
                 }
             }
         }
@@ -1390,37 +1391,37 @@
     TInt r;
 
     r=f.Replace(TheFs,_L("\\GOBLIN.TMP"),EFileRead|EFileWrite);
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.SetSize(4*gBytesPerCluster); // 4 Clusters
     f.Close();
 
     r=f.Replace(TheFs,_L("\\WIZARD.TMP"),EFileRead|EFileWrite);
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.SetSize(5*gBytesPerCluster); // 5 Clusters
     f.Close();
 
     r=f.Replace(TheFs,_L("\\TROLL.TMP"),EFileRead|EFileWrite);
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.SetSize(3*gBytesPerCluster); // 3 Clusters
     f.Close();
 
     r=f.Replace(TheFs,_L("\\GNOME.TMP"),EFileRead|EFileWrite);
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.SetSize(10*gBytesPerCluster); // 10 Clusters
     f.Close();
 
     r=f.Replace(TheFs,_L("\\CYCLOPS.TMP"),EFileRead|EFileWrite);
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.SetSize(gBytesPerCluster); // 1 Cluster
     f.Close();
 
     r=f.Replace(TheFs,_L("\\PIXIE.TMP"),EFileRead|EFileWrite);
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.SetSize(gBytesPerCluster); // 1 Cluster
     f.Close();
 
     r=TheDisk.Open(TheFs,CurrentDrive());
-    test(r==KErrNone);
+    test_KErrNone(r);
     TPtr8 sectorBuf((TUint8*)pBuffer1->Ptr(),TheBootSector.BytesPerSector());
     TInt pos = gRootDirStart;
     test(TheDisk.Read(pos,sectorBuf)==KErrNone);
@@ -1479,17 +1480,17 @@
     test(name==_L8("PIXIE   TMP"));
 
     r=TheFs.Delete(_L("\\GOBLIN.TMP"));
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=TheFs.Delete(_L("\\WIZARD.TMP"));
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=TheFs.Delete(_L("\\TROLL.TMP"));
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=TheFs.Delete(_L("\\GNOME.TMP"));
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=TheFs.Delete(_L("\\CYCLOPS.TMP"));
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=TheFs.Delete(_L("\\PIXIE.TMP"));
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     FormatPack();
 
@@ -1504,7 +1505,7 @@
     test.Printf(_L("Checking cluster %02d, parent %d: \"%S\"\n"), aNewClust, aParentClust, &aName);
 
     TInt r=TheFs.MkDir(aName);
-    test(r==KErrNone || r==KErrAlreadyExists);
+    test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 
     TInt pos=ClusterToByte(aNewClust);
     TPtr8 sectorBuf((TUint8*)pBuffer1->Ptr(),gBytesPerCluster);
@@ -1670,7 +1671,7 @@
         }
 
     r = f.Create(TheFs, _L("\\123456.78"), EFileRead|EFileWrite);
-    test(r==KErrDirFull);
+    test_Value(r, r == KErrDirFull);
     f.Close();
 
 
@@ -1678,22 +1679,22 @@
     for (i=0;i<KMaxFiles;i++)
         {
         r=TheFs.Delete(fileName[i]);
-        test(r==KErrNone);
+        test_KErrNone(r);
         }
 
     r=TheFs.SetSessionPath(_L("\\"));
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     TInt nameLength=(KMaxFiles-1)*13;   // -1 for zero terminator
     CreateLongName(tempName,gSeed,nameLength*2);
     r=f.Create(TheFs,tempName,0);       //  Needs 9 free entries - there are only 5 available
-    test(r==KErrDirFull);
+    test_Value(r, r == KErrDirFull);
     tempName.SetLength(nameLength+1);
     r=f.Create(TheFs,tempName,0);       //  Needs 6 free entries - there are only 5 available
-    test(r==KErrDirFull);
+    test_Value(r, r == KErrDirFull);
     tempName.SetLength(nameLength);
     r=f.Create(TheFs,tempName,0);       //  Needs 5 free entries - there are 5 available
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.Close();
 
 #if 0       // This is the old test that assumed UNICODE builds
@@ -1702,54 +1703,54 @@
     for (i=0;i<KMaxFiles-2;i++)
         {
         r=TheFs.Delete(fileName[i]);    //  UNICODE build - free 6 entries (delete 3 files)
-        test(r==KErrNone);
+        test_KErrNone(r);
         }
 
     r=TheFs.SetSessionPath(_L("\\"));
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     TInt vFatUnitNameSize=13;
     TInt nameLength=(KMaxFiles-1)*vFatUnitNameSize-1;   //
     CreateLongName(tempName,gSeed,nameLength*2);
     r=f.Create(TheFs,tempName,0);                       //  Needs 9 free entries
-    test(r==KErrDirFull);
+    test_Value(r, r == KErrDirFull);
 
     nameLength=(KMaxFiles)*vFatUnitNameSize;
     tempName.SetLength(nameLength+1);
     r=f.Create(TheFs,tempName,0);                       //  Needs 7 free entries
-    test(r==KErrDirFull);
+    test_Value(r, r == KErrDirFull);
     tempName.SetLength(nameLength);
     r=f.Create(TheFs,tempName,0);                       //  Needs 6 free entries
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.Close();
 #endif
 
     TheFs.Delete(tempName);
     tempName.SetLength(nameLength-7);
     r=f.Create(TheFs,tempName,0);
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.Close();
 
     r=f.Create(TheFs,_L("ASDF"),0);
-    test(r==KErrDirFull);
+    test_Value(r, r == KErrDirFull);
 
     TheFs.Delete(tempName);
     tempName.SetLength(nameLength-15);
     r=f.Create(TheFs,tempName,0);
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.Close();
 
     tempName=_L("testname");
     r=f.Create(TheFs,tempName,0);
-    test(r==KErrDirFull);
+    test_Value(r, r == KErrDirFull);
     tempName.UpperCase();
     r=f.Create(TheFs,tempName,0);
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.Close();
 
 
     r=TheFs.SetSessionPath(gSessionPath);
-    test(r==KErrNone);
+    test_KErrNone(r);
     }
 
 static  void TestVolumeSize()
@@ -1762,7 +1763,7 @@
 
     TVolumeInfo volInfo;
     TInt r=TheFs.Volume(volInfo);
-    test(r==KErrNone);
+    test_KErrNone(r);
     TInt64 calcsize = MAKE_TINT64(0, gClusterCount)*gBytesPerCluster;
     if (volInfo.iSize > calcsize)
         {
@@ -1794,7 +1795,7 @@
         fileName=_L("\\File");
         fileName.AppendNum(i);
         r=f[i].Create(TheFs,fileName,0);
-        test(r==KErrNone);
+        test_KErrNone(r);
         }
 
     TInt maxTotalSize=1048576;
@@ -1807,7 +1808,7 @@
             {
             TInt randSize=Math::Rand(gSeed)%maxFileSize;
             r=f[i].SetSize(randSize);
-            test(r==KErrNone);
+            test_KErrNone(r);
             }
         test.Printf(_L("Countdown .. %d   \r"),maxIterations);
         }
@@ -1820,12 +1821,12 @@
         {
         TInt size=0;
         r=f[i].Size(size);
-        test(r==KErrNone);
+        test_KErrNone(r);
         totalSize+=((size+gBytesPerCluster-1)/gBytesPerCluster)*gBytesPerCluster;
         }
 
     r=TheFs.Volume(volInfo);
-    test(r==KErrNone);
+    test_KErrNone(r);
     if (gDiskType == EFat32)
         volInfo.iSize -= gBytesPerCluster; // root dir is part of the 'size'
     if (volInfo.iSize-volInfo.iFree!=totalSize)
@@ -1846,13 +1847,13 @@
         fileName=_L("\\File");
         fileName.AppendNum(i);
         r=TheFs.Delete(fileName);
-        test(r==KErrNone);
+        test_KErrNone(r);
         }
 
     r=TheFs.Volume(volInfo);
     if (gDiskType == EFat32)
         volInfo.iSize -= gBytesPerCluster; // root dir is part of the 'size'
-    test(r==KErrNone);
+    test_KErrNone(r);
     test(volInfo.iSize-volInfo.iFree==0);
 
     MakeDir(gSessionPath);
@@ -1870,7 +1871,7 @@
 
 
     r=TheFs.Volume(volInfo);
-    test(r==KErrNone);
+    test_KErrNone(r);
     if (gDiskType == EFat32)
         volInfo.iSize -= gBytesPerCluster; // root dir is part of the 'size'
     test.Printf(_L("volInfo.iSize = %ld\n"), volInfo.iSize);
@@ -1886,7 +1887,7 @@
     CreateFatEntry(gSessionPath, EFalse);
 
     r=TheFs.Volume(volInfo);
-    test(r==KErrNone);
+    test_KErrNone(r);
     if (gDiskType == EFat32)
         volInfo.iSize -= gBytesPerCluster; // root dir is part of the 'size'
     test.Printf(_L("volInfo.iSize = %ld\n"), volInfo.iSize);
@@ -1900,10 +1901,10 @@
 
     CFileMan* fMan=CFileMan::NewL(TheFs);
     r=fMan->RmDir(gSessionPath);
-    test(r==KErrNone);
+    test_KErrNone(r);
     delete fMan;
     r=TheFs.Volume(volInfo);
-    test(r==KErrNone);
+    test_KErrNone(r);
     if (gDiskType == EFat32)
         volInfo.iSize -= gBytesPerCluster; // root dir is part of the 'size'
     if (volInfo.iSize-volInfo.iFree!=0)
@@ -1935,22 +1936,22 @@
     buffer.Replace(0,11,_L8("TEST1      "));
 
     TInt r=TheDisk.Open(TheFs,CurrentDrive());
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=TheDisk.Write(pos,buffer);
-    test(r==KErrNone);
+    test_KErrNone(r);
     TheDisk.Close();
 
     r=TheDir.Open(TheFs,_L("\\"),KEntryAttMaskSupported);
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=TheDir.Read(TheEntry);
-    test(r==KErrNone);
+    test_KErrNone(r);
     test(TheEntry.iName==_L("TEST1"));
     r=TheDir.Read(TheEntry);
-    test(r==KErrEof);
+    test_Value(r, r == KErrEof);
     TheDir.Close();
 
     r=TheFs.SetSessionPath(_L("\\"));
-    test(r==KErrNone);
+    test_KErrNone(r);
     TEntry e;
     r=TheFs.Entry(_L("TEST1"),e);
     if(e.iName!=_L("TEST1"))
@@ -1985,9 +1986,9 @@
     TInt r=TheDisk.Open(TheFs,CurrentDrive());
     if (r != KErrNone)
         test.Printf(_L("Error %d opening on %C"), r, (TUint)gDriveToTest);
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=TheDisk.Read(0, boot);
-    test(r==KErrNone);
+    test_KErrNone(r);
     TUint32 val = GetValue(boot, 510, 2);
     RDebug::Print(_L("BPB magic number = 0x%X\n"), val);
     test(aTestOnly || val == 0xAA55);
@@ -2113,7 +2114,7 @@
     for(i=0; i<=20; i++)
         {
         r = TheFile.Write(TheBuffer);
-        test(r==KErrNone);
+        test_KErrNone(r);
         }
 
     TheFile.Close();
@@ -2470,7 +2471,7 @@
             testVal.iSectorsPerCluster,
             testVal.iRootDirEntries);
         TInt r = fatAlignment.AdjustFirstDataSectorAlignment(testVal.iBlockSize);
-        test (r == KErrNone);
+        test_KErrNone(r);
         fatAlignment.Display();
         }
 
@@ -2583,7 +2584,7 @@
 
     TVolumeInfo volInfo;
     r=TheFs.Volume(volInfo);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     TInt64 spaceToUse = volInfo.iFree - gBytesPerCluster; // whole disk except 1 cluster
 
@@ -2597,42 +2598,42 @@
         {
         TFileName tempName;
         r=f.Temp(TheFs,_L("\\"),tempName,EFileRead|EFileWrite);
-        test(r==KErrNone);
+        test_KErrNone(r);
         r=f.SetSize(K1GigaByte);
-        test(r==KErrNone);
+        test_KErrNone(r);
         f.Close();
         spaceToUse -= K1GigaByte;
         tempfiles++;
         }
 
     r=f.Replace(TheFs,_L("\\USESPACE.TMP"),EFileRead|EFileWrite);
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=f.SetSize((TInt)spaceToUse);
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.Close();
 
     r=TheFs.Volume(volInfo);
-    test(r==KErrNone);
+    test_KErrNone(r);
     test.Printf(_L("After fill, volInfo.iSize %ld volInfo.iFree %ld\n"), volInfo.iSize, volInfo.iFree);
 
     test(volInfo.iFree==gBytesPerCluster); // check we have 1 cluster free
 
     r=f.Replace(TheFs,_L("\\FILE.TMP"),EFileRead|EFileWrite);
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=f.SetSize(2*gBytesPerCluster); // 2 clusters (will fail since there's not space)
-    test(r==KErrDiskFull);
+    test_Value(r, r == KErrDiskFull);
     f.Close();
 
     r=TheFs.Volume(volInfo);
-    test(r==KErrNone);
+    test_KErrNone(r);
     test(volInfo.iFree==gBytesPerCluster); // check we still have 1 cluster free
 
     r=f.Replace(TheFs,_L("\\USESPACE.TMP"),EFileRead|EFileWrite); // truncate file to 0
-    test(r==KErrNone);
+    test_KErrNone(r);
     f.Close();
 
     r=TheFs.Volume(volInfo);
-    test(r==KErrNone);
+    test_KErrNone(r);
     test(volInfo.iFree==(spaceToUse+gBytesPerCluster)); // check we've freed up the space from USESPACE plus one cluster
 
     
@@ -2642,7 +2643,7 @@
     
     //-- read 1 sector of the root dir.
     r = MediaRawRead(TheFs, CurrentDrive(), rootDirpos, TheBootSector.BytesPerSector(), TheBuffer);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
     const TFatDirEntry* pE=(TFatDirEntry*)TheBuffer.Ptr();
     while (tempfiles-- > 0)
@@ -2689,7 +2690,7 @@
 
     TInt drvNum;
     TInt r=TheFs.CharToDrive(gDriveToTest,drvNum);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     if (!Is_Fat(TheFs,drvNum))
         {
@@ -2704,7 +2705,7 @@
     // check this is not the internal ram drive
     TVolumeInfo v;
     r=TheFs.Volume(v, drvNum);
-    test(r==KErrNone);
+    test_KErrNone(r);
     TBool isRamDrive = v.iDrive.iMediaAtt&KMediaAttVariableSize;
 
     gSessionPath[0] = (TText)gDriveToTest;
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/filesystem/fat/group/fatfs.inf
--- a/kerneltest/f32test/filesystem/fat/group/fatfs.inf	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/filesystem/fat/group/fatfs.inf	Thu Jun 10 11:48:01 2010 +0100
@@ -11,7 +11,7 @@
 // Contributors:
 //
 // Description:
-// f32test/group/bld.inf
+// f32test/filesystem/fat/group/fatfs.inf
 // Test code for file server
 // 
 //
@@ -37,6 +37,7 @@
 //b_fat //obsolete
 t_mount
 t_fatcache_bm
-t_raw   
+t_raw
 t_fatcorrupt
+t_nonrugged
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/filesystem/fat/group/t_nonrugged.mmp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/f32test/filesystem/fat/group/t_nonrugged.mmp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,32 @@
+// Copyright (c) 2009-2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// f32test/filesystem/fat/group/t_nonrugged.mmp
+//
+//
+
+target			t_nonrugged.exe        
+targettype		exe
+sourcepath		..
+source			t_nonrugged.cpp
+source			t_main.cpp
+sourcepath		../../../fileutils/src
+source			fat_utils.cpp f32_test_utils.cpp
+library			euser.lib efsrv.lib hal.lib btracec.lib
+
+OS_LAYER_SYSTEMINCLUDE_SYMBIAN
+userinclude		../../../fileutils/inc
+capability		tcb diskadmin allfiles
+vendorid		0x70000001
+
+SMPSAFE
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/filesystem/fat/t_compat32.cpp
--- a/kerneltest/f32test/filesystem/fat/t_compat32.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/filesystem/fat/t_compat32.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -98,13 +98,13 @@
 
 	RFile file;
 	TInt r=file.Create(TheFs,fileName,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 //	Assume this file is the first entry in the root directory
 
 
 	r=TheDisk.Open(TheFs,CurrentDrive());
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     //-- read 1st dir. entry it can be FAT or VFat , depending on the filename
     const TInt posEntry1=gBootSector.RootDirStartSector() << KDefaultSectorLog2; //-- dir entry1 position
@@ -169,16 +169,16 @@
     TInt r;
 
 	r=file.Replace(TheFs,_L("\\FILE.TMP"),EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(_L8("Hello World"));
 	file.Close();
 
 	r=TheFs.Replace(_L("\\File.tmp"),_L("\\Word"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	CDir* entryCount;
 	r=TheFs.GetDir(_L("\\*.*"),KEntryAttMaskSupported,ESortNone,entryCount);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=entryCount->Count();
 
 	test(count==1);
@@ -202,17 +202,17 @@
     DoFiddleWithFileNames(aCase);
 
 	r=file.Create(TheFs,_L("\\TEST"),EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	r=TheFs.Rename(_L("\\TEST"),_L("\\Word"));
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 	r=TheFs.Delete(_L("\\TEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	CDir* entryCount;
 	r=TheFs.GetDir(_L("\\*.*"),KEntryAttMaskSupported,ESortNone,entryCount);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=entryCount->Count();
 	test(count==1);
 	delete entryCount;
@@ -241,14 +241,14 @@
     fn.Format(_L("%c:\\\x60\x60\x60.TXT"), (TUint8)gDriveToTest);
 
     r = TheFs.Delete(fn);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	r = file.Create(TheFs, fn, EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	r=TheDisk.Open(TheFs,CurrentDrive());
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     //-- read 1st dir. it should be DOS Entry
     const TInt posEntry1=gBootSector.RootDirStartSector() << KDefaultSectorLog2; //-- dir entry1 position
@@ -261,11 +261,11 @@
     // tests short name
     TFileName sn;
     r = TheFs.GetShortName(fn, sn);
-    test(r==KErrNone);
+    test_KErrNone(r);
     test(sn.Compare(_L("```.TXT"))==0);
 
     r = TheFs.Delete(fn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 #if defined(_DEBUG) || defined(_DEBUG_RELEASE)
@@ -295,23 +295,23 @@
     TInt drvNum;
 
     r = TheFs.CharToDrive(gDriveToTest,drvNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     // turn on FatUtilityFunctions
     r = TheFs.ControlIo(drvNum, KControlIoEnableFatUtilityFunctions);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// load cp932 codepage dll
 	r = UserSvr::ChangeLocale(KTestLocale);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     // create file "\x65B0\x6587\x4EF6", check DOS entry & VFat entry
 	r = file.Create(TheFs, KTestUnicodeFileName, EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	r=TheDisk.Open(TheFs,CurrentDrive());
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     //-- read 1st dir. it should be VFat
 //    const TInt posEntry1=gRootDirStart; //-- dir entry1 position
@@ -339,11 +339,11 @@
     // delete file
     TheDisk.Close();
     r = TheFs.Delete(KTestUnicodeFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// turn off FatUtilityFunctions
 	r = TheFs.ControlIo(drvNum, KControlIoDisableFatUtilityFunctions);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 #else
 	test.Printf(_L("Test only runs on DEBUG builds, see test logs of debug builds for details."));
@@ -607,7 +607,7 @@
 
 	TInt drvNum;
 	TInt r=TheFs.CharToDrive(gDriveToTest,drvNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     if (!Is_Fat(TheFs,drvNum))
 		{
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/filesystem/fat/t_fatcorrupt.cpp
--- a/kerneltest/f32test/filesystem/fat/t_fatcorrupt.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/filesystem/fat/t_fatcorrupt.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -28,6 +28,7 @@
 //! @See EFat and EFat32 components
 //! @file f32test\server\t_fatcorrupt.cpp
 
+#define	__E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32math.h>
@@ -102,9 +103,9 @@
     test.Printf(_L("RestoreEnv()\n"));
 
     TInt r = TheFs.DismountExtension(KExtName, gDrive);
-    test(r==KErrNone);
+    test_KErrNone(r);
     r = TheFs.RemoveExtension(KExtName);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     if(gExtExists)      // remount existing secondary extension
         {
@@ -114,7 +115,7 @@
 
     //-- We need a full format, because quick format preserves bad sectors marked in FAT
     r = FormatFatDrive(TheFs, gDrive, EFalse);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
     }
 
@@ -126,7 +127,7 @@
     test.Printf(_L("PrepareMountL(), drive:%d \n"),gDrive);
 
     TInt r = TheFs.AddExtension(KExtName);
-    test(r==KErrNone || r==KErrAlreadyExists);
+    test_Value(r, r == KErrNone || r==KErrAlreadyExists);
     r = TheFs.ExtensionName(gExtName,gDrive,0);
     if (r == KErrNone)              // an extension already exists -> dismount it
         {
@@ -138,14 +139,14 @@
             test(TheFs.RemoveExtension(KExtName) == KErrNone);
             return EFalse;
             }
-        test(r==KErrNone);
+        test_KErrNone(r);
         gExtExists=ETrue;
         }
-    test(r == KErrNone || r==KErrNotFound);
+    test_Value(r, r == KErrNone || r==KErrNotFound);
     r = TheFs.MountExtension(KExtName, gDrive);
     if (r != KErrNone)
         test(TheFs.RemoveExtension(KExtName) == KErrNone);
-    test(r==KErrNone);
+    test_KErrNone(r);
     return ETrue;
     }
 
@@ -560,7 +561,7 @@
     RRawDisk rawDisk;
 
     TInt r=rawDisk.Open(TheFs,gSessionPath[0]-'A');
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     //Mark Cluster 2  & 3 as bad
     const TInt fatStartPos = BootSector.FirstFatSector() * BootSector.BytesPerSector();
@@ -573,17 +574,17 @@
     data[3] = 0x0F;
 
     r=rawDisk.Write(pos, data);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     pos += 4;
     r = rawDisk.Write(pos, data);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     rawDisk.Close();
 
     //-- quick format the drive
     r = FormatFatDrive(TheFs, gDrive, ETrue);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     const TUint oldClusterNum = BootSector.RootClusterNum();
     ReadBootSector();
@@ -608,14 +609,14 @@
     WriteVersionNumber();
 
     TInt r = TheFs.FileSystemName(name, gDrive);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
     r = DismountFileSystem(TheFs, name, gDrive);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
     r = MountFileSystem(TheFs, name, gDrive);
 
-    test(r == KErrCorrupt);
+    test_Value(r, r == KErrCorrupt);
 
 }
 
@@ -635,22 +636,22 @@
     // Test quick format
     RFormat formatQuick;
     TInt r = formatQuick.Open(TheFs, gDriveName, EQuickFormat, count);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
     r = DoFormatSteps(formatQuick, count);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
     formatQuick.Close();
 
     ReadBootSector();
     r = TheFs.FileSystemName(name, gDrive);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
     r = DismountFileSystem(TheFs, name, gDrive);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
     r = MountFileSystem(TheFs, name, gDrive);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
 }
 
@@ -734,10 +735,10 @@
 
     //Mini SD cards works properly only with ESpecialFormat. Fix for Defect DEF091659
     TInt r = formatFull.Open(TheFs, gDriveName, ESpecialFormat, count);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
     r = DoFormatSteps(formatFull, count);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
     formatFull.Close();
 
@@ -762,7 +763,7 @@
     // Only test FAT filesystem
     TInt r;
     r = TheFs.CharToDrive(gDriveToTest, gDrive);
-    test(r == KErrNone);
+    test_KErrNone(r);
     gDriveName[0] = (TText)gDriveToTest;
     gDriveName[1] = ':';
 
@@ -781,7 +782,7 @@
     // No need for variable size disk
     TDriveInfo info;
     r = TheFs.Drive(info, gDrive);
-    test(r == KErrNone);
+    test_KErrNone(r);
     if (info.iMediaAtt & KMediaAttVariableSize)
         {
         test.Printf(_L("Drive %d is variable-size disk, skip\n"),gDrive);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/filesystem/fat/t_nonrugged.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/kerneltest/f32test/filesystem/fat/t_nonrugged.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -0,0 +1,295 @@
+// Copyright (c) 2009-2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
+// f32test\filesystem\fat\t_nonrugged.cpp
+// Functional tests for the non-Rugged file mode (also called the File Sequential mode)
+// Only perform tests on the Rugged FAT file system
+//
+
+#define __E32TEST_EXTENSION__
+
+#include <f32file.h>
+#include <e32test.h>
+
+#include "t_server.h"
+#include "fat_utils.h"
+using namespace Fat_Test_Utils;
+
+
+RTest test(_L("T_NONRUGGED"));
+
+TInt gDriveNum;
+
+_LIT(KTestPath, ":\\F32-TST\\T_NONRUGGED\\");	// 22
+
+
+enum TNonRuggedFileMode
+	{
+	ENormalFileMode,	// File is in normal (Rugged) mode
+	ENonRuggedFileMode	// File is in non-Rugged file mode (EFileSequential)
+	};
+
+enum TNonRuggedControlIO
+/*
+ * ControlIo enum values
+ */
+    {
+    EControlIOIsRuggedFSys		= 4,			// Defined as EIsRuggedFSys in \fileserver\sfat32\common_constants.h
+    EControlIOIsFileSequential	= KMaxTInt-23	// Defined as KControlIoIsFileSequential in \fileserver\inc\f32dbg.h
+    };
+
+
+void CreateFile(RFile& aFile, const TDesC& aPath, TUint aFileMode)
+/*
+ * Creates/opens a file in Rugged/non-Rugged mode after emptying the trace buffer
+ */
+	{
+	TInt r = TheFs.MkDirAll(aPath);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
+	r = aFile.Replace(TheFs, aPath, aFileMode);
+	test_KErrNone(r);
+	}
+
+
+void DeleteFileAndDir(const TDesC& aPath)
+/*
+ * Deletes a single file and the directory containing it
+ */
+	{
+	TInt r = TheFs.Delete(aPath);
+	test_KErrNone(r);
+	r = TheFs.RmDir(aPath);
+	test_KErrNone(r);
+	}
+
+
+void SingleClientTest()
+/*
+ * Unit test for Non-Rugged File mode with a single client
+	 ***********************************************************************************
+	 * 1. Create a file in non-Rugged file mode and then close the file.
+	 * 2. Open the file in normal Rugged file mode and then close it.
+	 * 3. Open the file in non-Rugged file mode again and then close it.
+	 * Expected Results:
+	 * 1. File is in non-Rugged file mode.
+	 * 2. File is in normal Rugged file mode.
+	 * 3. File is in non-Rugged file mode.
+	 ***********************************************************************************
+ */
+	{
+	test.Next(_L("Test single client"));
+
+	TBuf<34> singleFile;
+	singleFile.Append(gDriveToTest);		//  1
+	singleFile.Append(KTestPath);			// 22
+	singleFile.Append(_L("file.single"));	// 11
+	TInt r = TheFs.Delete(singleFile);
+	test_Value(r, r == KErrNone || r == KErrNotFound || r == KErrPathNotFound);
+	TBuf8<KMaxPath> singleFilePkg;
+	singleFilePkg.Copy(singleFile.Mid(2));
+	TUint8 fileMode = 0;
+	TPtr8 fileModePkg(&fileMode, 1, 1);
+
+	test.Printf(_L("Create file in non-Rugged file mode\n"));
+	RFile file;
+	CreateFile(file, singleFile, (EFileWrite | EFileSequential));
+	r = TheFs.ControlIo(gDriveNum, EControlIOIsFileSequential, singleFilePkg, fileModePkg);
+	test_KErrNone(r);
+	test_Equal(ENonRuggedFileMode, fileMode);
+	file.Close();
+
+	test.Printf(_L("Open file in normal mode\n"));
+	CreateFile(file, singleFile, EFileWrite);
+	r = TheFs.ControlIo(gDriveNum, EControlIOIsFileSequential, singleFilePkg, fileModePkg);
+	test_KErrNone(r);
+	test_Equal(ENormalFileMode, fileMode);
+	file.Close();
+
+	test.Printf(_L("Open file in non-Rugged file mode again\n"));
+	CreateFile(file, singleFile, (EFileWrite | EFileSequential));
+	r = TheFs.ControlIo(gDriveNum, EControlIOIsFileSequential, singleFilePkg, fileModePkg);
+	test_KErrNone(r);
+	test_Equal(ENonRuggedFileMode, fileMode);
+	file.Close();
+
+	DeleteFileAndDir(singleFile);
+	}
+
+
+void MultipleClientsTest()
+/*
+ * Unit tests for Non-Rugged File mode with multiple clients accessing the same file
+ */
+	{
+	/***********************************************************************************
+	 * Use Case 1:
+	 * 1. Client1 opens a file in non-Rugged file mode.
+	 * 2. Client2 then opens the same file in normal Rugged file mode.
+	 * Expected Results:
+	 * 1. File is in non-Rugged file mode.
+	 * 2. File changed to normal Rugged file mode.
+	 ***********************************************************************************
+	 */
+	test.Next(_L("Test multiple clients - Use case 1"));
+
+	TBuf<33> fileName1;
+	fileName1.Append(gDriveToTest);		//  1
+	fileName1.Append(KTestPath);		// 22
+	fileName1.Append(_L("file1.mult"));	// 10
+	TInt r = TheFs.Delete(fileName1);
+	test_Value(r, r == KErrNone || r == KErrNotFound || r == KErrPathNotFound);
+	TBuf8<31> fileName1Pkg;
+	fileName1Pkg.Copy(fileName1.Mid(2));
+	TUint8 fileMode = 0;
+	TPtr8 fileModePkg(&fileMode, 1, 1);
+
+
+	// Use Case 1.1, Client 1 (Non-Rugged Client) ------------------------------------
+	test.Printf(_L("Client1 create file in non-Rugged file mode\n"));
+
+	RFile file1;
+	CreateFile(file1, fileName1, (EFileWrite | EFileSequential | EFileShareAny));
+	r = TheFs.ControlIo(gDriveNum, EControlIOIsFileSequential, fileName1Pkg, fileModePkg);
+	test_KErrNone(r);
+	test_Equal(ENonRuggedFileMode, fileMode);
+
+
+	// Use Case 1.2, Client 2 (Rugged Client) ----------------------------------------
+	test.Printf(_L("Client2 open file in 'normal' Rugged file mode\n"));
+
+	RFile file2;
+	CreateFile(file2, fileName1, (EFileWrite | EFileShareAny));
+	r = TheFs.ControlIo(gDriveNum, EControlIOIsFileSequential, fileName1Pkg, fileModePkg);
+	test_KErrNone(r);
+	test_Equal(ENormalFileMode, fileMode);
+
+
+	file1.Close();
+	file2.Close();
+	r = TheFs.Delete(fileName1);
+	test_KErrNone(r);
+
+
+	/***********************************************************************************
+	 * Use Case 2:
+	 * 1. Client1 opens a file in normal Rugged file mode.
+	 * 2. Client2 then opens the same file in non-Rugged file mode.
+	 * Expected Results:
+	 * 1. File is in normal Rugged file mode.
+	 * 2. File does not change to non-Rugged file mode.
+	 ***********************************************************************************
+	 */
+	test.Next(_L("Test multiple clients - Use case 2"));
+
+	TBuf<34> fileName2;
+	fileName2.Append(gDriveToTest);		//  1
+	fileName2.Append(KTestPath);		// 22
+	fileName2.Append(_L("file2.mult"));	// 10
+	r = TheFs.Delete(fileName2);
+	test_Value(r, r == KErrNone || r == KErrNotFound || r == KErrPathNotFound);
+	TBuf8<KMaxPath> fileName2Pkg;
+	fileName2Pkg.Copy(fileName2.Mid(2));
+
+
+	// Use Case 2.1, Client 1 (Rugged Client) ----------------------------------------
+	test.Printf(_L("Client1 create file in 'normal' Rugged file mode\n"));
+
+	CreateFile(file1, fileName2, (EFileWrite | EFileShareAny));
+	r = TheFs.ControlIo(gDriveNum, EControlIOIsFileSequential, fileName2Pkg, fileModePkg);
+	test_KErrNone(r);
+	test_Equal(ENormalFileMode, fileMode);
+
+
+	// Use Case 2.2, Client 2 (Non-Rugged Client) ------------------------------------
+	test.Printf(_L("Client2 open file in non-Rugged file mode\n"));
+
+	CreateFile(file2, fileName2, (EFileWrite | EFileSequential | EFileShareAny));
+	r = TheFs.ControlIo(gDriveNum, EControlIOIsFileSequential, fileName2Pkg, fileModePkg);
+	test_KErrNone(r);
+	test_Equal(ENormalFileMode, fileMode);
+
+
+	file1.Close();
+	file2.Close();
+	DeleteFileAndDir(fileName2);
+	}
+
+
+
+void CallTestsL()
+/*
+ * Start point of T_NONRUGGED
+ */
+	{
+#ifndef _DEBUG
+    test.Printf(_L("T_NONRUGGED skipped. To run only on debug builds.\n"));
+    return;
+#else
+    
+	TInt r = TheFs.CharToDrive(gDriveToTest, gDriveNum);
+	test_KErrNone(r);
+	
+	// Currently only FAT file system supports Rugged drive
+    if (!Is_Fat(TheFs, gDriveNum))
+		{
+		test.Printf(_L("T_NONRUGGED skipped. Requires FAT filesystem to run.\n"));
+		return;
+		}
+
+// Use this to set filesystem to Rugged if it is not set as such
+#if(0)
+	{
+	// Ensure that the FAT filesystem is Rugged
+	TUint8 ruggedVal = 0;
+	TPtr8 ruggedPkg(&ruggedVal, 1, 1);
+	r = TheFs.ControlIo(gDriveNum, EControlIOIsRuggedFSys, ruggedPkg);
+	test_KErrNone(r);
+	if (!ruggedVal)
+		{
+		r = TheFs.ControlIo(gDriveNumber, KControlIoRuggedOn);
+		test_KErrNone(r);
+		}
+	}
+#endif
+	
+    // Test to run only on a rugged FAT drive
+    TUint8 ruggedVal = 0;
+    TPtr8 ruggedPkg(&ruggedVal, 1, 1);
+    r = TheFs.ControlIo(gDriveNum, EControlIOIsRuggedFSys, ruggedPkg);
+    test_KErrNone(r);
+    if (!ruggedVal)
+    	{
+		test.Printf(_L("T_NONRUGGED skipped. Requires Rugged FAT to run.\n"));
+		return;
+    	}
+
+	test.Start(_L("T_NONRUGGED Test Start"));
+	
+	// Run tests
+	SingleClientTest();
+	MultipleClientsTest();
+	
+// Use this to unset filesystem to non-Rugged if it has been set above
+#if(0)
+	// Set filesystem back to non-Rugged
+	if (!ruggedVal)
+		{
+		r = TheFs.ControlIo(gDriveNumber, KControlIoRuggedOff);
+		test_KErrNone(r);
+		}
+#endif
+	
+	test.End();
+	test.Close();
+#endif
+	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/filesystem/fat/t_raw.cpp
--- a/kerneltest/f32test/filesystem/fat/t_raw.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/filesystem/fat/t_raw.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -39,12 +39,12 @@
 	test.Start(_L("Test all methods"));
 	RRawDisk rd;
 	TInt r=rd.Open(TheFs,gDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<16> buf;
 	r=rd.Read(0,buf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rd.Write(0,buf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	rd.Close();
 	test.End();
 	}
@@ -60,49 +60,49 @@
 
 	RFile f;
 	TInt r=f.Open(TheFs,_L("TRAW.TST"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RRawDisk rd;
 	r=rd.Open(TheFs,gDrive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	f.Close();
 	r=rd.Open(TheFs,gDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	rd.Close();
 
 	TFileName fileName;
 	r=f.Temp(TheFs,_L(""),fileName,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rd.Open(TheFs,gDrive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	f.Close();
 	r=rd.Open(TheFs,gDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	rd.Close();
 
 	RDir d;
 	r=d.Open(TheFs,_L("TRAWTEST"),KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=rd.Open(TheFs,gDrive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	d.Close();
 	r=rd.Open(TheFs,gDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	rd.Close();
 
     RFormat fmt;
     TInt count;
     r=fmt.Open(TheFs,gSessionPath,EQuickFormat,count);
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=rd.Open(TheFs,gDrive); // Raw disk access ok during formatting
     test.Printf(_L("open rd when fmt opn r=%d"),r);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
     fmt.Close();
     r=rd.Open(TheFs,gDrive);
 	test.Printf(_L("open rd when fmt closed r=%d"),r);
-    test(r==KErrNone);
+    test_KErrNone(r);
 	RRawDisk rd2;
 	r=rd2.Open(TheFs,gDrive);	//should only have one Raw object open
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	rd2.Close();
     rd.Close();
 	}
@@ -118,34 +118,34 @@
 
 	RRawDisk rd;
 	TInt r=rd.Open(TheFs,gDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile f;
 	TFileName fileName;
 	r=f.Open(TheFs,_L("TRAW.TST"),EFileWrite);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=f.Temp(TheFs,_L(""),fileName,EFileWrite);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	RDir d;
 	r=d.Open(TheFs,_L("TRAW"),KEntryAttNormal);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	RFormat fmt;
 	TInt count;
 	r=fmt.Open(TheFs,gSessionPath,EQuickFormat,count);
     if (r != KErrInUse)
         test.Printf(_L("Error %d. Sess = %S"), r, &gSessionPath);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	CDir* dir=(CDir*)0x05;
 	r=TheFs.GetDir(_L("\\F32-TST\\*.*"),KEntryAttNormal,ESortNone,dir);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	test(dir==NULL);
 
 	RRawDisk rd2;
 	r=rd2.Open(TheFs,gDrive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 //	fmt.Close();
 	rd.Close();
@@ -163,7 +163,7 @@
 
 	RRawDisk rd;
 	TInt r=rd.Open(TheFs,gDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TBuf8<32> textBuf;
 	TInt64 pos=0;
@@ -190,14 +190,14 @@
 
 	TBuf8<32> contents2=_L8("This File says MOO");
 	r=rd.Write(pos,contents2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	rd.Close();
 
 	RFile f;
 	r=f.Open(TheFs,_L("TRAW.TST"),EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Read(textBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(textBuf==contents2);
 	f.Close();
 	}
@@ -260,7 +260,7 @@
 
 	RThread thread;
 	TInt r=thread.Create(_L("MyThread"),MyThreadFunction,0x1000,0x1000,0x1000,(TAny*)EThreadForgetToCloseSession);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TRequestStatus reqStat;
 	thread.Logon(reqStat);
 	thread.Resume();
@@ -274,11 +274,11 @@
 
 	RFile f;
 	r=f.Open(TheFs,_L("TEST.FILE"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 
 	r=thread.Create(_L("MyThread"),MyThreadFunction,0x1000,0x1000,0x1000,(TAny*)EThreadForgetToCloseRaw);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(reqStat);
 	thread.Resume();
 	User::WaitForRequest(reqStat);
@@ -290,19 +290,19 @@
 	FsBarrier();
 
 	r=f.Open(TheFs,_L("TEST.FILE"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 
 	r=gSemaphore.CreateGlobal(_L("MySemaphore"),0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=thread.Create(_L("MyThread"),MyThreadFunction,0x1000,0x1000,0x1000,(TAny*)EThreadHang);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Resume();
 	gSemaphore.Wait();
 	gSemaphore.Close();
 
 	r=f.Open(TheFs,_L("TEST.FILE"),EFileWrite);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	TBool jit = User::JustInTime();
 	User::SetJustInTime(EFalse);
 	thread.Kill(KErrGeneral);
@@ -315,7 +315,7 @@
 	FsBarrier();
 
 	r=f.Open(TheFs,_L("TEST.FILE"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	}
 
@@ -330,7 +330,7 @@
     Fat_Test_Utils::SetConsole(test.Console());
 
 	TInt r=TheFs.CharToDrive(gSessionPath[0],gDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     PrintDrvInfo(TheFs, gDrive);
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/filesystem/fat/t_scn32dr2.cpp
--- a/kerneltest/f32test/filesystem/fat/t_scn32dr2.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/filesystem/fat/t_scn32dr2.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -11,9 +11,10 @@
 // Contributors:
 //
 // Description:
-// f32test\scndrv\t_scn32dr2.cpp
+// f32test\filesystem\fat\t_scn32dr2.cpp
 //
-//
+
+#define __E32TEST_EXTENSION__
 
 #include <f32file.h>
 #include <e32test.h>
@@ -71,7 +72,7 @@
     TInt gDriveNumber;
 
     TInt r = TheFs.CharToDrive( gSessionPath[0], gDriveNumber );
-    test( KErrNone == r );
+    test_KErrNone(r);
 
     //-- set up console output
     Fat_Test_Utils::SetConsole(test.Console());
@@ -95,18 +96,18 @@
     TUint8 oldFsys;
     TPtr8 pRugged(&oldFsys,1,1);
     r=TheFs.ControlIo(gDriveNumber,KControlIoIsRugged,pRugged);
-    test(r==KErrNone);
+    test_KErrNone(r);
     if(oldFsys==0)
         {
         r=TheFs.ControlIo(gDriveNumber,KControlIoRuggedOn);
-        test(r==KErrNone);
+        test_KErrNone(r);
         }
     DoTests();
     // if nec, set filing system back to !rugged
     if(oldFsys==0)
         {
         r=TheFs.ControlIo(gDriveNumber,KControlIoRuggedOff);
-        test(r==KErrNone);
+        test_KErrNone(r);
         }
 
     return;
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/filesystem/fat/t_scn32dr3.cpp
--- a/kerneltest/f32test/filesystem/fat/t_scn32dr3.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/filesystem/fat/t_scn32dr3.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 //
 //
 
+#define	__E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32svr.h>
@@ -74,23 +75,23 @@
             tempDirName = _L("?:\\SYSTEM\\BIN\\");
         tempDirName[0] = gSessionPath[0];
         r=TheFs.MkDirAll(tempDirName);
-        test(r==KErrNone||r==KErrAlreadyExists);
+        test_Value(r, r == KErrNone||r==KErrAlreadyExists);
         CFileMan* fileMan=NULL;
         TRAP(r,fileMan = CFileMan::NewL(TheFs));
-        test(r==KErrNone);
+        test_KErrNone(r);
         //Copy the test from Z drive.
         TFileName temp=_L("Z:\\SYS\\BIN\\T_SCN32DR3.EXE");
         r = fileMan->Copy(temp, TestExeName, CFileMan::EOverWrite);
-        test(r==KErrNone);
+        test_KErrNone(r);
         r = fileMan->Copy(TestExeName, StartupExeName, CFileMan::EOverWrite);
-        test(r == KErrNone);
+        test_KErrNone(r);
         //Mask read attribute. Fix for DEF081323
         r = fileMan->Attribs(StartupExeName, 0, KEntryAttReadOnly, 0);
-        test(r == KErrNone);
+        test_KErrNone(r);
         r = fileMan->Attribs(TestExeName, 0, KEntryAttReadOnly, 0);
-        test(r == KErrNone);
+        test_KErrNone(r);
         r = logFile.Replace(TheFs,LogFileName,EFileShareExclusive|EFileWrite);
-        test(r == KErrNone);
+        test_KErrNone(r);
         logFile.Close();
         delete fileMan;
         }
@@ -123,11 +124,11 @@
     TUint8 oldFsys;
     TPtr8 pRugged(&oldFsys,1,1);
     r=TheFs.ControlIo(gSessionPath[0]-'A',KControlIoIsRugged,pRugged);
-    test(r==KErrNone);
+    test_KErrNone(r);
     if(oldFsys==0)
         {
         r=TheFs.ControlIo(gSessionPath[0]-'A',KControlIoRuggedOn);
-        test(r==KErrNone);
+        test_KErrNone(r);
         }
     TheFunctionNumber=0;
     TheOpNumber=0;
@@ -138,14 +139,14 @@
     OverrideEShell();
     ReadLogFile();
     r=TheFs.ScanDrive(gSessionPath);
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=TheFs.CheckDisk(gSessionPath);
-    test(r==KErrNone);
+    test_KErrNone(r);
     DoTests();
     r=TheFs.Delete(LogFileName);
-    test(r==KErrNone);
+    test_KErrNone(r);
     r=TheFs.Delete(StartupExeName);
-    test(r==KErrNone);
+    test_KErrNone(r);
     // return file system to original state
     if(oldFsys==0)
         r=TheFs.ControlIo(gSessionPath[0]-'A',KControlIoRuggedOff);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/filesystem/fat/t_server.h
--- a/kerneltest/f32test/filesystem/fat/t_server.h	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/filesystem/fat/t_server.h	Thu Jun 10 11:48:01 2010 +0100
@@ -11,7 +11,7 @@
 // Contributors:
 //
 // Description:
-// f32test\server\t_server.h
+// f32test\filesystem\fat\t_server.h
 //
 //
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/fsstress/t_ramstr.cpp
--- a/kerneltest/f32test/fsstress/t_ramstr.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/fsstress/t_ramstr.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define	__E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32math.h>
@@ -83,12 +84,12 @@
 	TBuf<128> fileName=aBaseName;
 	fileName.AppendNum(aX);
 	TInt r=TheFs.Delete(fileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	r=TheFs.CheckDisk(fileName);
 //	if (r!=KErrNone && r!=KErrNotSupported)
 //		{
 //		test.Printf(_L("ERROR:: CheckDisk returned %d\n"),r);
-//		test(r==KErrNone);
+//		test_KErrNone(r);
 //		}
 	test.Printf(_L("Deleted File %d\n"),aX);
 	return(KErrNone);
@@ -103,7 +104,7 @@
 	testBuf.SetLength(testBuf.MaxSize());
 	Mem::Fill(bufPtr,testBuf.MaxSize(),aCluster);
 	TInt r=aFile.Write(testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void SeekToCluster(RFile& aFile,TInt aCluster)
@@ -113,7 +114,7 @@
 	{
 	TBuf8<508> seekBuf(508);
 	TInt r=aFile.Read(aCluster*testBuf.MaxSize(),seekBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(seekBuf[0]==(TUint8)aCluster && seekBuf[507]==(TUint8)aCluster);
 	}
 
@@ -124,10 +125,10 @@
 	{
 	TBuf8<508> seekBuf(508);
 	TInt r=aFile.Read(aCluster1*testBuf.MaxSize(),seekBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(seekBuf[0]==(TUint8)aCluster1 && seekBuf[507]==(TUint8)aCluster1);
 	r=aFile.Read(aCluster2*testBuf.MaxSize(),seekBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(seekBuf[0]==(TUint8)aCluster2 && seekBuf[507]==(TUint8)aCluster2);
 	}
 
@@ -158,9 +159,9 @@
 	RFile f1,f2;
 
 	TInt r=f1.Replace(TheFs,_L("BIGFILE1.TST"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f2.Replace(TheFs,_L("BIGFILE2.TST"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TInt maxListLength=4;
 	TInt i=0,k=0;
@@ -205,9 +206,9 @@
 	f1.Close();
 	f2.Close();
 	r=TheFs.Delete(_L("BIGFile1.tst"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("BIGFile2.tst"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckDisk();
 	}
 
@@ -220,9 +221,9 @@
 	RFile f1,f2;
 
 	TInt r=f1.Replace(TheFs,_L("BIGFILE1.TST"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f2.Replace(TheFs,_L("BIGFILE2.TST"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	WriteCluster(f1,0);
 	WriteCluster(f1,1);
@@ -239,9 +240,9 @@
 	f1.Close();
 	f2.Close();
 	r=TheFs.Delete(_L("BIGFile1.tst"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("BIGFile2.tst"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckDisk();
 	}
 
@@ -256,10 +257,10 @@
 	TheSeed=917824;
 	TInt i=0,j=0;
 	TInt r=f1.Replace(TheFs,_L("BIGFILE1.TST"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=f1.SetSize(65534);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	for(i=0;i<=15;i++)
 		WriteCluster(f1,i);
@@ -273,7 +274,7 @@
 
 	test.Next(_L("Increase Size"));
 	r=f1.SetSize(1048577);
-	test(r==KErrNone || r==KErrDiskFull);
+	test_Value(r, r == KErrNone || r==KErrDiskFull);
 	if (r==KErrDiskFull)
 		{
 		test.Printf(_L("File too big\n"));
@@ -291,7 +292,7 @@
 
 	TInt newPos=8192;
 	r=f1.Seek(ESeekStart,newPos);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Write more data"));
 	for(i=16;i<83;i++)
@@ -307,7 +308,7 @@
 
 	test.Next(_L("Reduce file size"));
 	r=f1.SetSize(135000);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Test data still present"));
 	for (j=0;j<200;j++)
@@ -340,7 +341,7 @@
 	{
 
 	TInt r=iFile.Read(0,iData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 void TFileReader::Next(TUint8& aVal,TInt& aLength)
@@ -352,7 +353,7 @@
 	if (iPos==iData.Length())
 		{
 		TInt r=iFile.Read(iData);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		iPos=0;
 		if (iData.Length()==0)
 			{
@@ -476,13 +477,13 @@
 	HBufC8* dataBuf=HBufC8::NewL(KMaxBufferLength);
 
 	TInt r=f[0].Replace(TheFs,_L("TEST1.DAT"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f[1].Replace(TheFs,_L("TEST2.DAT"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f[2].Replace(TheFs,_L("TEST3.DAT"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f[3].Replace(TheFs,_L("TEST4.DAT"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TInt size=0;
 	TInt iteration=0;
@@ -507,7 +508,7 @@
 			TInt s=len*mult[fileNum];
 			TInt filePos=pos*mult[fileNum];
 			r=f[fileNum].Seek(ESeekStart,filePos);
-			test(r==KErrNone);
+			test_KErrNone(r);
 
 			while(s>0)
 				{
@@ -516,7 +517,7 @@
 				r=f[fileNum].Write(*dataBuf);
 				if (r==KErrDiskFull)
 					goto End;
-				test(r==KErrNone);
+				test_KErrNone(r);
 				s-=l;
 				}
 			
@@ -537,7 +538,7 @@
 				{
 				TInt fileNum=(order+i)%KMaxFiles;
 				r=f[fileNum].SetSize(size*mult[fileNum]);
-				test(r==KErrNone);
+				test_KErrNone(r);
 				}
 			CheckFileContents(&f[0]);
 			}
@@ -556,10 +557,10 @@
 	{
 	test.Start(_L("Test multiple file creation, deletion and resize operations"));
 	TInt r=TheFs.MkDirAll(_L("\\F32-TST\\BIGDIRECTORY\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	TFileName sessionPath;
 	r=TheFs.SessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TInt index=0;
 	TBuf<128> fileName=_L("\\F32-TST\\BIGDIRECTORY\\FILE");
@@ -570,7 +571,7 @@
 		if (r!=KErrNone)
 			break;
 
-		test(r==KErrNone);
+		test_KErrNone(r);
 		
 #if defined(__WINS__)
 		if (index==32 && sessionPath[0]=='C')
@@ -601,7 +602,7 @@
 		baseName=fileName;
 		baseName.AppendNum(index);
 		r=file.Open(TheFs,baseName,EFileRead|EFileWrite);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test.Printf(_L("Resized %S from %d to %d\n"),&baseName,anInitialSize,anInitialSize*2);		
 		r=file.SetSize(2*anInitialSize);
 		test((r==KErrNone)||(r==KErrDiskFull));
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/fsstress/t_remote.cpp
--- a/kerneltest/f32test/fsstress/t_remote.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/fsstress/t_remote.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -19,6 +19,7 @@
 #include <f32file.h>
 #endif
 #if !defined(__E32TEST_H__)
+#define	__E32TEST_EXTENSION__
 #include <e32test.h>
 #endif
 #if !defined(__T_STD_H__)
@@ -108,15 +109,15 @@
 	fn = _L("Z:\\TEST\\T_FSRV.CPP");
 	fn[0] = gExeFileName[0];
 	TInt r=file1.Open(TheFs,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fn = _L("Z:\\TEST\\T_FILE.CPP");
 	fn[0] = gExeFileName[0];
 	r=file2.Open(TheFs,fn,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fn = _L("Z:\\TEST\\T_FSRV.CPP");
 	fn[0] = gExeFileName[0];
 	r=file3.Open(TheFs,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	CFileList* list;
 	TOpenFileScan fileScan(TheFs);
@@ -164,28 +165,28 @@
 
 	RFs fs1,fs2,fs3,fs4;
 	TInt r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs3.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs4.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile file1,file2,file3;
 	TFileName fn;
 	fn = _L("Z:\\TEST\\T_FSRV.CPP");
 	fn[0] = gExeFileName[0];
 	r=file1.Open(fs2,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fn = _L("Z:\\TEST\\T_FILE.CPP");
 	fn[0] = gExeFileName[0];
 	r=file2.Open(fs2,fn,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fn = _L("Z:\\TEST\\T_FSRV.CPP");
 	fn[0] = gExeFileName[0];
 	r=file3.Open(fs2,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	CFileList* list;
 	TOpenFileScan fileScan(TheFs);
@@ -237,39 +238,39 @@
 
 	RFs fs1,fs2,fs3,fs4;
 	TInt r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs3.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs4.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile file1,file2,file3;
 	TFileName fn;
 	fn = _L("Z:\\TEST\\T_FSRV.CPP");
 	fn[0] = gExeFileName[0];
 	r=file1.Open(fs2,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fn = _L("Z:\\TEST\\T_FILE.CPP");
 	fn[0] = gExeFileName[0];
 	r=file2.Open(fs2,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fn = _L("Z:\\TEST\\T_FSRV.CPP");
 	fn[0] = gExeFileName[0];
 	r=file3.Open(fs2,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Open(fs4,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fn = _L("Z:\\TEST\\T_FILE.CPP");
 	fn[0] = gExeFileName[0];
 	r=file2.Open(fs4,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fn = _L("Z:\\TEST\\T_FSRV.CPP");
 	fn[0] = gExeFileName[0];
 	r=file3.Open(fs4,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	CFileList* list;
 	TOpenFileScan fileScan(TheFs);
@@ -337,51 +338,51 @@
 	RFs fs1,fs2,fs3,fs4;
 	TFileName fn;
 	TInt r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs3.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs4.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RDir dir1,dir2,dir3,dir4;
 	fn = _L("Z:\\TEST\\*.XDE");
 	fn[0] = gExeFileName[0];
 	r=dir1.Open(TheFs,fn,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir2.Open(TheFs,fn,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir3.Open(TheFs,fn,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir4.Open(TheFs,fn,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile file1,file2,file3;
 	fn = _L("Z:\\TEST\\T_FSRV.CPP");
 	fn[0] = gExeFileName[0];
 	r=file1.Open(fs2,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fn = _L("Z:\\TEST\\T_FILE.CPP");
 	fn[0] = gExeFileName[0];
 	r=file2.Open(fs2,fn,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fn = _L("Z:\\TEST\\T_FSRV.CPP");
 	fn[0] = gExeFileName[0];
 	r=file3.Open(fs2,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	RDir dir5,dir6,dir7,dir8;
 	fn = _L("Z:\\TEST\\*.XDE");
 	fn[0] = gExeFileName[0];
 	r=dir5.Open(fs4,fn,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir6.Open(fs4,fn,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir7.Open(fs4,fn,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir8.Open(fs4,fn,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	CFileList* list;
 	TOpenFileScan fileScan(TheFs);
@@ -439,27 +440,27 @@
 	fn = _L("Z:\\TEST\\T_FSRV.CPP");
 	fn[0] = gExeFileName[0];
 	TInt r=file1.Open(TheFs,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fn = _L("Z:\\TEST\\T_FILE.CPP");
 	fn[0] = gExeFileName[0];
 	r=file2.Open(TheFs,fn,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fn = _L("Z:\\TEST\\T_FSRV.CPP");
 	fn[0] = gExeFileName[0];
 	r=file3.Open(TheFs,fn,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	RDir dir1,dir2,dir3,dir4;
 	fn = _L("Z:\\TEST\\*.XDE");
 	fn[0] = gExeFileName[0];
 	r=dir1.Open(TheFs,fn,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir2.Open(TheFs,fn,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir3.Open(TheFs,fn,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir4.Open(TheFs,fn,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	CFileList* list;
 	TOpenFileScan fileScan(TheFs);
@@ -525,7 +526,7 @@
 	for (; i<maxNumberSessions; i++)
 		{
 		r=session[i].Connect();
-		test(r==KErrNone);
+		test_KErrNone(r);
 		testObject[i].Initialise(session[i]);
 		testObject[i].SetSessionPath(aDrive);
 		testObject[i].RunTests(aTest);		//	Run the set of tests for each session
@@ -551,7 +552,7 @@
 		testObject[i+1].testDriveList(aTest);
 	//	Reconnect session[i]	
 		r=session[i].Connect();
-		test(r==KErrNone);
+		test_KErrNone(r);
 		testObject[i].Initialise(session[i]);
 		testObject[i].SetSessionPath(aDrive);
 		testObject[i].testSetVolume(aTest);
@@ -569,7 +570,7 @@
 		testObject[i].testDriveList(aTest);
 	//	Reconnect session[i+1]	
 		r=session[i+1].Connect();
-		test(r==KErrNone);
+		test_KErrNone(r);
 		testObject[i+1].Initialise(session[i+1]);
 		testObject[i+1].SetSessionPath(aDrive);
 		testObject[i].testSetVolume(aTest);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/fsstress/t_rmain.cpp
--- a/kerneltest/f32test/fsstress/t_rmain.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/fsstress/t_rmain.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -19,6 +19,7 @@
 #include <f32file.h>
 #endif
 #if !defined(__E32TEST_H__)
+#define	__E32TEST_EXTENSION__
 #include <e32test.h>
 #endif
 #if !defined(__E32HAL_H__)
@@ -77,11 +78,11 @@
 	RFormat format;
 	TInt count;
 	TInt r=format.Open(TheFs,driveBuf,EHighDensity,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	while(count)
 		{
 		TInt r=format.Next(count);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	format.Close();
 	}
@@ -107,12 +108,12 @@
 	gSessionPath=_L("?:\\F32-TST\\");
 	TChar driveLetter;
 	TInt r=TheFs.DriveToChar(aDrive,driveLetter);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	gSessionPath[0]=(TText)driveLetter;
 	r=TheFs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MkDirAll(gSessionPath);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	TheFs.ResourceCountMarkStart();
 	
 	switch(aDrive)
@@ -269,7 +270,7 @@
 	test.Title();
 	test.Start(_L("Starting tests..."));
 	r=TheFs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	TheFs.SetAllocFailure(gAllocFailOn);
 
 //	Default drive testing
@@ -278,7 +279,7 @@
 //	Remote drive testing
 	RThread clientThreadQ;
 	r=clientThreadQ.Create(_L("TestRemoteDrive"), TestRemoteDrive, KDefaultStackSize,KHeapSize,KHeapSize,NULL);	
-	test(r==KErrNone);	
+	test_KErrNone(r);	
 	TRequestStatus statq;
 	clientThreadQ.Logon(statq);
 	test.Next(_L("Resume clientThreadQ"));	
@@ -287,7 +288,7 @@
 //	MARM CF card drive testing (WINS emulates CF card on X)
 	RThread clientThreadX;
 	r=clientThreadX.Create(_L("TestXDrive"), TestXDrive, KDefaultStackSize,KHeapSize,KHeapSize,NULL);	
-	test(r==KErrNone);	
+	test_KErrNone(r);	
 	TRequestStatus statx;
 	clientThreadX.Logon(statx);
 	test.Next(_L("Resume clientThreadX"));	
@@ -296,7 +297,7 @@
 //	MARM RAM drive testing (WINS emulates FAT filesystem on Y)  	
 	RThread clientThreadY;
 	r=clientThreadY.Create(_L("TestYDrive"), TestYDrive, KDefaultStackSize,KHeapSize,KHeapSize,NULL);	
-	test(r==KErrNone);	
+	test_KErrNone(r);	
 	TRequestStatus staty;
 	clientThreadY.Logon(staty);
 	test.Next(_L("Resume clientThreadY"));	
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/fsstress/t_sesfs.cpp
--- a/kerneltest/f32test/fsstress/t_sesfs.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/fsstress/t_sesfs.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -262,20 +262,24 @@
 	test(w.iDrive.iDriveAtt==KDriveAttSubsted);
 	test(w.iDrive.iMediaAtt==v.iDrive.iMediaAtt);
 	test(w.iUniqueID==v.iUniqueID);
-	test(w.iSize==v.iSize);
 
-// If this test is being run under windows using drive C then skip free space comparison
-// as it is likely to fail as the windows file system is unlike to have static freespace
+    if(v.iDrive.iType != EMediaRam) // We can't assume that RAM disk will be the same size since last recorded...
+    {
+	    test(w.iSize==v.iSize);
+
+    // If this test is being run under windows using drive C then skip free space comparison
+    // as it is likely to fail as the windows file system is unlike to have static freespace
 #ifdef __WINS__
-	if(User::UpperCase(gTestSessionPath[0]) != 'C')
-		{
+	    if(User::UpperCase(gTestSessionPath[0]) != 'C')
+		    {
 #endif
-		test(w.iFree==v.iFree);
+		    test(w.iFree==v.iFree);
 
 #ifdef __WINS__
-		}
+		    }
 #endif
-	
+    }
+
 	test(w.iName==v.iName);
 	TDriveList driveList;
 	r=iFs.DriveList(driveList);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/group/base_f32test.mrp
--- a/kerneltest/f32test/group/base_f32test.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/group/base_f32test.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "File Server Tests"
 
 component	base_f32test
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/group/f32test.bld
--- a/kerneltest/f32test/group/f32test.bld	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/group/f32test.bld	Thu Jun 10 11:48:01 2010 +0100
@@ -1,5 +1,5 @@
-
-!EXPLICIT
-!INCREMENTAL
-
-f32test		f32test\group
+
+!EXPLICIT
+!INCREMENTAL
+
+f32test		f32test\group
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/group/wintest.bat
--- a/kerneltest/f32test/group/wintest.bat	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/group/wintest.bat	Thu Jun 10 11:48:01 2010 +0100
@@ -28,6 +28,9 @@
 call :GetParentDirPath F32TEST_PATH
 echo F32TEST_PATH = %F32TEST_PATH%
 set EPOC32_DIR=%EPOCROOT%EPOC32\
+set F32TEST_BUILD_PATH=%EPOC32_DIR%BUILD%F32TEST_PATH%GROUP\
+if exist %EPOC32_DIR%data\z\test\f32test set F32TEST_BUILD_PATH=%EPOC32_DIR%data\z\test\f32test\
+echo F32TEST_BUILD_PATH = %F32TEST_BUILD_PATH%
 echo EPOC32_DIR = %EPOC32_DIR%
 set EMUL_MEDIA_PATH=%EPOC32_DIR%DATA\MEDIA\
 echo EMUL_MEDIA_PATH = %EMUL_MEDIA_PATH%
@@ -100,7 +103,7 @@
 copy %F32TEST_PATH%\SERVER\T_FILE.CPP %EMUL_Z%\TEST\T_FILE.CPP
 copy %F32TEST_PATH%\SERVER\T_FSRV.CPP %EMUL_Z%\TEST\T_FSRV.CPP
 copy %F32TEST_PATH%\SERVER\T_RDSECT.TXT %EMUL_Z%\TEST\T_RDSECT.TXT
-copy %EPOC32_DIR%BUILD%F32TEST_PATH%\GROUP\%1.AUTO.BAT %EMUL_Z%\TEST\%1.AUTO.BAT
+copy %F32TEST_BUILD_PATH%\%1.AUTO.BAT %EMUL_Z%\TEST\%1.AUTO.BAT
 copy %REL_DIR%\T_CHKUID.EXE %EMUL_Z%\TEST\T_CHKUID.EXE
 
 REM Use both Sys and System directories until the switch has been made
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/loader/base_loader.mrp
--- a/kerneltest/f32test/loader/base_loader.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/loader/base_loader.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,16 +1,1 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # dummy MRP so that the tools put the build output directory in a place consistant with other components
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/loader/dlltree.pl
--- a/kerneltest/f32test/loader/dlltree.pl	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/loader/dlltree.pl	Thu Jun 10 11:48:01 2010 +0100
@@ -57,6 +57,16 @@
 my $copy_end=$year+1900;
 
 my $argc=scalar(@ARGV);
+
+# check whether its raptor specific  
+my $is_raptor = 0;
+if ($ARGV[$argc-1] eq "raptor") # change "raptor" to something you want.
+{
+	pop(@ARGV);
+	$is_raptor = 1;
+	$argc--;
+}
+
 ($argc==1 or $argc==2 or $argc==3) or die "Usage: perl dlltree.pl <filename> <dir> [-allowbad]\n";
 my $infile=$ARGV[0];
 open IN, $infile or die "Cannot open input file $infile\n";
@@ -795,13 +805,20 @@
 open OUT, ">$dlltreename" or die "Could not open $dlltreename for output\n";
 print OUT @dlltree;
 close OUT;
-my $testbatch = "$ENV{EPOCROOT}epoc32\\build";
-$destpath =~ s/\//\\/go;
-$testbatch.="\\" unless ($destpath =~ /^\\/);
-$testbatch.=$destpath;
-$testbatch.="##MAIN##.auto.bat";
-if (!$allowbad) {
-	push @iby, "data=$testbatch\t\ttest\\loader.auto.bat\n";
+
+my $testbatch ='';
+if($is_raptor) {
+	$testbatch="$ENV{EPOCROOT}\\epoc32\\data\\z\\test\\gen\\##MAIN##.auto.bat";
+}
+else {
+	$testbatch = "$ENV{EPOCROOT}epoc32\\build";
+	$destpath =~ s/\//\\/go;
+	$testbatch.="\\" unless ($destpath =~ /^\\/);
+	$testbatch.=$destpath;
+	$testbatch.="##MAIN##.auto.bat";
+	}
+if (!$allowbad){
+	push @iby, "data=$testbatch\t\ttest\\loader.auto.bat\n";	
 }
 open OUT, ">$ibyname" or die "Could not open $ibyname for output\n";
 print OUT @iby;
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/loader/ldrtst.flm
--- a/kerneltest/f32test/loader/ldrtst.flm	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/loader/ldrtst.flm	Thu Jun 10 11:48:01 2010 +0100
@@ -20,7 +20,7 @@
 	cp -u $$(filter-out %generated,$$^) $$@
 
 $(TO_BLDINF)/$(GDIR)/generated: $(TO_BLDINF)/dlltree.pl $(TO_BLDINF)/dlltree.txt
-	perl $(TO_BLDINF)/dlltree.pl $(TO_BLDINF)/dlltree.txt $(TO_BLDINF)/$(GDIR)
+	perl $(TO_BLDINF)/dlltree.pl $(TO_BLDINF)/dlltree.txt $(TO_BLDINF)/$(GDIR) raptor
 	touch $$@
 endif
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/loader/t_ldrtst.cpp
--- a/kerneltest/f32test/loader/t_ldrtst.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/loader/t_ldrtst.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -338,7 +338,7 @@
 		}
 	TCodeSegCreateInfo info;
 	TInt r=iDev.GetCodeSegInfo(h, info);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName fn;
 	fn.Copy(info.iFileName);
 	test.Printf(_L("DCodeSeg@%08x Data=%08x+%x,%x File %S,attr=0x%x\n"),h,info.iDataRunAddress,info.iDataSize,info.iBssSize,&fn,info.iAttr);
@@ -418,21 +418,23 @@
 	test(expected == isCodePaged);
 #endif
 	if ((flags & KModuleFlagXIP) && mmtype!=EMemModelTypeEmul)
-		test(IsRomAddress(aInfo.iEntryPointAddress));
+		{
+		test_Value(aInfo.iEntryPointAddress, IsRomAddress(aInfo.iEntryPointAddress));
+		}
 	else
 		{
-		test(IsRamCodeAddress(aInfo.iEntryPointAddress));
+		test_Value(aInfo.iEntryPointAddress, IsRamCodeAddress(aInfo.iEntryPointAddress));
 		if(mmtype==EMemModelTypeFlexible)
 			{
 			// can't make assumtions about current processes address space
 			}
 		else if (mmtype==EMemModelTypeMultiple)
 			{
-			test(!AddressReadable(aInfo.iEntryPointAddress));
+			test_Value(aInfo.iEntryPointAddress, !AddressReadable(aInfo.iEntryPointAddress));
 			}
 		else
 			{
-			test(AddressReadable(aInfo.iEntryPointAddress));
+			test_Value(aInfo.iEntryPointAddress, AddressReadable(aInfo.iEntryPointAddress));
 			}
 		}
 
@@ -473,20 +475,20 @@
 				{
 				if (!(GetModuleFlags(deps[j])&KModuleFlagExe))
 					{
-					test(aList.iInfo[i].iDllNum==deps[j]);
+					test_Value(aList.iInfo[i].iDllNum, aList.iInfo[i].iDllNum==deps[j]);
 					++i;
 					}
 				++j;
 				}
 			else if (j==ndeps)
 				{
-				test(aList.iInfo[i].iDllNum==aRoot);
+				test_Value(aList.iInfo[i].iDllNum, aList.iInfo[i].iDllNum==aRoot);
 				++i;
 				++j;
 				}
 			else
 				{
-				test(aList.iInfo[i].iDllNum<0);
+				test_Value(aList.iInfo[i].iDllNum, aList.iInfo[i].iDllNum<0);
 				++i;
 				}
 			}
@@ -508,13 +510,17 @@
 		{
 		if (i<nd)
 			{
-			test(aList.iInfo[i].iDllNum>=0);
+			test_Value(aList.iInfo[i].iDllNum, aList.iInfo[i].iDllNum>=0);
 			ml.Remove(aList.iInfo[i].iDllNum);
 			}
 		else if (i==nd && !root_included)
-			test(aList.iInfo[i].iDllNum==aRoot);
+			{
+			test_Value(aList.iInfo[i].iDllNum, aList.iInfo[i].iDllNum == aRoot);
+			}
 		else
-			test(aList.iInfo[i].iDllNum<0);
+			{
+			test_Value(aList.iInfo[i].iDllNum, aList.iInfo[i].iDllNum<0);
+			}
 		}
 	test(ml.iCount==0);
 	}
@@ -536,11 +542,11 @@
 	{
 	test.Next(_L("Load device driver"));
 	TInt r=User::LoadLogicalDevice(_L("D_LDRTST"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r==KErrNone || r==KErrAlreadyExists);
 	r=iDev.Open();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=iFs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TBuf<256> cmdline;
 	User::CommandLine(cmdline);
@@ -599,14 +605,14 @@
 		r=LoadExe(x, 0, p, tt);
 		test.Printf(_L("LoadExe(%d)->%d\n"),x,r);
 		test.Printf(_L("BENCHMARK: LoadExe(%d)->%dms\n"),x,tt);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		RLoaderTest lt;
 		r=lt.Connect(x);
 		test.Printf(_L("Connect(%d)->%d\n"),x,r);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TModuleList exe_info;
 		r=lt.GetExeDepList(exe_info.iInfo);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		exe_info.SetCount();
 		DumpModuleList(exe_info, x);
 		CheckModuleList(x, exe_info);
@@ -675,7 +681,7 @@
 				test(r==y);
 				r=lt.CloseDll(h);
 				test.Printf(_L("CloseDll(%d)->%d\n"),h,r);
-				test(r==KErrNone);
+				test_KErrNone(r);
 				test(lt.GetCDList(dll_d_info.iInfo)==KErrNone);
 				dll_d_info.SetCount();
 				dll_d_info.Display(_L("Destruct:  "));
@@ -744,10 +750,10 @@
 		r=LoadExe(x, 0, p1, tt);
 		test.Printf(_L("LoadExe1(%d)->%d\n"),x,r);
 		test.Printf(_L("BENCHMARK: LoadExe1(%d)->%dms\n"),x,tt);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=lt1.Connect(x, 0);
 		test.Printf(_L("Connect1(%d)->%d\n"),x,r);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TInt s=DetermineLoadExe2Result(x);
 		r=LoadExe(x, 1, p2, tt);
 		test.Printf(_L("LoadExe2(%d)->%d (%d)\n"),x,r,s);
@@ -759,13 +765,13 @@
 			{
 			r=lt2.Connect(x, 1);
 			test.Printf(_L("Connect2(%d)->%d\n"),x,r);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			r=lt1.GetExeDepList(exe_info1.iInfo);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			exe_info1.SetCount();
 			DumpModuleList(exe_info1, x);
 			r=lt2.GetExeDepList(exe_info2.iInfo);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			exe_info2.SetCount();
 			DumpModuleList(exe_info2, x);
 
@@ -852,7 +858,7 @@
 
 						r=lt2.CloseDll(h2);
 						test.Printf(_L("CloseDll2(%d)->%d\n"),h2,r);
-						test(r==KErrNone);
+						test_KErrNone(r);
 						test(lt2.GetCDList(dll_d_info2.iInfo)==KErrNone);
 						dll_d_info2.SetCount();
 						dll_d_info2.Display(_L("Destruct2:  "));
@@ -863,7 +869,7 @@
 
 					r=lt1.CloseDll(h1);
 					test.Printf(_L("CloseDll1(%d)->%d\n"),h1,r);
-					test(r==KErrNone);
+					test_KErrNone(r);
 					test(lt1.GetCDList(dll_d_info1.iInfo)==KErrNone);
 					dll_d_info1.SetCount();
 					dll_d_info1.Display(_L("Destruct1:  "));
@@ -1010,22 +1016,20 @@
 			{
 			r=LoadExe(x, 0, p, tt);
 			test.Printf(_L("LoadExe(%d)->%d\n"),x,r);
-			test(r==KErrNone || (loom.iState!=TLoopOOM::ERFsError && r==KErrNoMemory) || 
+			test_Value(r, r==KErrNone || (loom.iState!=TLoopOOM::ERFsError && r==KErrNoMemory) || 
 				(loom.iState==TLoopOOM::ERFsError && r==KRFsError));
-			if (r==KErrNone)
-				{
-				TInt s=lt.Connect(x);
-				test.Printf(_L("Connect(%d)->%d\n"),x,s);
-				test(s==KErrNone);
-				lt.Exit();
-				p.Close();
-				}
+			if (r != KErrNone)
+				continue;
+			r = lt.Connect(x);
+			test_KErrNone(r);
+			lt.Exit();
+			p.Close();
 			}
 		SetLoaderFail(0,0);
 		r=LoadExe(x, 0, p, tt);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=lt.Connect(x);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		const TInt* tests=TC_DllOOM;
 		TInt ntests=*tests++;
 		TModuleList list;
@@ -1045,14 +1049,13 @@
 				r=Min(h,0);
 				test.Printf(_L("%d:LoadDll(%d)->%d\n"),x,m,h);
 				
-				test(r==KErrNone || r==KErrNotSupported || KErrNoMemory || 
+				test_Value(r, r==KErrNone || r==KErrNotSupported || r==KErrNoMemory || 
 					(loom.iState==TLoopOOM::ERFsError && r==KRFsError) );
-					
-				if (r==KErrNone)
-					{
-					TInt s=lt.CloseDll(h);
-					test(s==KErrNone);
-					}
+				if (r!=KErrNone)
+					continue;
+
+				r=lt.CloseDll(h);
+				test_KErrNone(r);
 				}
 			}
 		lt.Exit();
@@ -1120,7 +1123,7 @@
 		TUint32 tt;
 		r=LoadExe(x, 0, p, tt);
 		test.Printf(_L("LoadCorruptExe(%d)->%d\n"),x,r);
-		test(r==KErrCorrupt);
+		test_Value(r,r==KErrCorrupt);
 		}
 	}
 
@@ -1153,7 +1156,7 @@
 	hashDir[0] = (TUint8) RFs::GetSystemDriveChar();
 
 	TInt r = Fs.MkDirAll(hashDir);
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 
 	for (TInt d = 0; d <= (TInt)sizeof(SpecialDriveList); ++d)
 		{
@@ -1190,7 +1193,7 @@
 		fn.Append(_L(":\\sys\\bin\\"));
 		r = Fs.MkDirAll(fn);
 		test.Printf(_L("MkDirAll %S returns %d\n"), &fn, r);
-		test(r == KErrNone || r == KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 		}
 	}
 
@@ -1279,17 +1282,17 @@
 		const TParsePtrC sppc(fnSrc);
 		TBuf<MAX_PATH> sName;
 		r = MapEmulatedFileName(sName, sppc.NameAndExt());
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 		TBuf<MAX_PATH> dName;
 		r = MapEmulatedFileName(dName, fnDest);
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 		BOOL b = Emulator::CopyFile((LPCTSTR)sName.PtrZ(),(LPCTSTR)dName.PtrZ(),FALSE);
 		test(b);
 #else
 		r = fm->Copy(fnSrc, fnDest);
-		test(r == KErrNone);
+		test_KErrNone(r);
 #endif
 
 		r = Fs.SetAtt(fnDest, 0, KEntryAttReadOnly);
@@ -1439,7 +1442,7 @@
 
 		r = Fs.Delete(fnDest);
 		test.Printf(_L("DeleteExecutables:fnDest=%S,del=%d\n"), &fnDest, r);
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 		// only need to delete hash files for binaries copied to removable media,
 		// but simpler to delete and test for KErrNotFound
@@ -1447,7 +1450,7 @@
 		GetHashFileName(fnDest, fnHash);
 		r = Fs.Delete(fnHash);
 		test.Printf(_L("DeleteExecutables,h=%S,hdel=%d\n"), &fnHash, r);
-		test(r == KErrPathNotFound || r == KErrNotFound || r == KErrNone);
+		test_Value(r, r == KErrPathNotFound || r == KErrNotFound || r == KErrNone);
 
 		if (aCorruptMode)
 			++numCorruptFiles;
@@ -1483,7 +1486,7 @@
 	test.Printf(_L("CopyExecutablesL()\n"));
 	CTrapCleanup* cleanup=CTrapCleanup::New();
 	TRAPD(r, CopyExecutablesL());
-	test(r == KErrNone);
+	test_KErrNone(r);
 	delete cleanup;
 
 	if (tm&1)
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/locl/CodepageUtils/src/t_cputils_cp932.cpp
--- a/kerneltest/f32test/locl/CodepageUtils/src/t_cputils_cp932.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/locl/CodepageUtils/src/t_cputils_cp932.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,3 +1,16 @@
+// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
+// All rights reserved.
+// This component and the accompanying materials are made available
+// under the terms of the License "Eclipse Public License v1.0"
+// which accompanies this distribution, and is available
+// at the URL "http://www.eclipse.org/legal/epl-v10.html".
+//
+// Initial Contributors:
+// Nokia Corporation - initial contribution.
+//
+// Contributors:
+//
+// Description:
 //
 // Auto-generated by the FatConversiontable tool - Do not edit!!!
 //
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/locl/localeutils/elocl32_japan/src/t_tlocl32_lat1.cpp
--- a/kerneltest/f32test/locl/localeutils/elocl32_japan/src/t_tlocl32_lat1.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/locl/localeutils/elocl32_japan/src/t_tlocl32_lat1.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -2,7 +2,7 @@
 * Copyright (c) 1995-1999 Nokia Corporation and/or its subsidiary(-ies).
 * All rights reserved.
 * This component and the accompanying materials are made available
-* under the terms of "Eclipse Public License v1.0"
+* under the terms of the License "Eclipse Public License v1.0"
 * which accompanies this distribution, and is available
 * at the URL "http://www.eclipse.org/legal/epl-v10.html".
 *
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/manager/t_clobbr.cpp
--- a/kerneltest/f32test/manager/t_clobbr.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/manager/t_clobbr.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define	__E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -30,55 +31,55 @@
 
 	RFile file;
 	TInt r=file.Replace(TheFs,_L("test.dat"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file.Write(0,_L8("ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<0x40> buf1;
 	r=file.Read(0,buf1);
-	test(r==KErrNone&&buf1.Length()==36);
+	test_Value(r, r == KErrNone&&buf1.Length()==36);
 	if (buf1!=_L8("ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"))
 		test.Printf(_L("1). *BAD*\n"));
 	
 	r=file.SetSize(511);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<0x40> buf2;
 	r=file.Read(0,buf2);
-	test(r==KErrNone&&buf2.Length()==0x40);
+	test_Value(r, r == KErrNone&&buf2.Length()==0x40);
 	buf2.SetLength(36);
 	if (buf2!=_L8("ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"))
 		test.Printf(_L("2). *BAD*\n"));
 	
 	r=file.SetSize(512);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<0x40> buf3;
 	r=file.Read(0,buf3);
-	test(r==KErrNone&&buf3.Length()==0x40);
+	test_Value(r, r == KErrNone&&buf3.Length()==0x40);
 	buf3.SetLength(36);
 	if (buf3!=_L8("ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"))
 		test.Printf(_L("3). *BAD*\n"));
 	
 	r=file.Write(0,_L8("ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<0x40> buf4;
 	r=file.Read(0,buf4);
-	test(r==KErrNone&&buf4.Length()==0x40);
+	test_Value(r, r == KErrNone&&buf4.Length()==0x40);
 	buf4.SetLength(36);
 	if (buf4!=_L8("ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"))
 		test.Printf(_L("4). *BAD*\n"));
 	r=file.SetSize(511);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<0x40> buf5;
 	r=file.Read(0,buf5);
-	test(r==KErrNone&&buf5.Length()==0x40);
+	test_Value(r, r == KErrNone&&buf5.Length()==0x40);
 	buf5.SetLength(36);
 	if (buf5!=_L8("ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"))
 		test.Printf(_L("5). *BAD*\n"));
 	r=file.SetSize(512);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<0x40> buf6;
 	r=file.Read(0,buf6);
-	test(r==KErrNone&&buf6.Length()==0x40);
+	test_Value(r, r == KErrNone&&buf6.Length()==0x40);
 	buf6.SetLength(36);
 	if (buf6!=_L8("ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"))
 		test.Printf(_L("6). *BAD*\n"));
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/manager/t_oom.cpp
--- a/kerneltest/f32test/manager/t_oom.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/manager/t_oom.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define	__E32TEST_EXTENSION__
 #include <hal.h>
 #include <f32file.h>
 #include <e32test.h>
@@ -32,10 +33,10 @@
 	RFormat format;
 	TFileName sessionPath;
 	TInt r=TheFs.SessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count;
 	r=format.Open(TheFs,sessionPath,EHighDensity,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	test(count==100);
 //	TRequestStatus status;
 //	TPckgBuf<TInt> step;
@@ -67,14 +68,14 @@
 	test.Printf(_L("FileSize = 0x%x\n"),size);
 	RFile file;
 	TInt r=file.Replace(TheFs,_L("\\F32-TST\\GOBBLE.DAT"),EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.SetSize(size);
-	test(r==KErrNone || r==KErrDiskFull);
+	test_Value(r, r == KErrNone || r==KErrDiskFull);
 	if (r==KErrDiskFull)
 		{
 		TFileName sessionPath;
 		r=TheFs.SessionPath(sessionPath);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test.Printf(_L("Error %S diskfull\n"),&sessionPath);
 // Reintroduce when we can detect that the test is being run manually
 //		test.Getch();
@@ -125,7 +126,7 @@
 			bfDir.Append(KTstDir);
 			test.Printf(_L("creating directory \"%S\".\n"), &bfDir);
 			r = TheFs.MkDir(bfDir);
-			test(r == KErrNone);
+			test_KErrNone(r);
 
 			TBuf<3 + 3 + 8 + 1 + 3> bfFlNm(bfDir);
 			TInt ctr = 0;						// create files until KErrDiskFull
@@ -140,11 +141,11 @@
 
 				RFile f;
 				r = f.Create(TheFs, bfFlNm, EFileShareExclusive | EFileStream | EFileWrite);
-				test(r == KErrNone || r == KErrDiskFull);
+				test_Value(r, r == KErrNone || r == KErrDiskFull);
 				if (r == KErrNone)
 					{
 					r = f.SetSize(KFileSize);
-					test(r == KErrNone || r == KErrDiskFull);
+					test_Value(r, r == KErrNone || r == KErrDiskFull);
 					}
 				f.Close();
 
@@ -184,7 +185,7 @@
 
 	TDriveInfo driveInfo;
 	TInt r=TheFs.Drive(driveInfo);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if (driveInfo.iType==EMediaNotPresent)
 		{
 		test.Printf(_L("ERROR: MEDIA NOT PRESENT\n"));
@@ -195,9 +196,9 @@
 
 	TFileName sessionPath;
 	r=TheFs.SessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MkDirAll(sessionPath);
-	test(r==KErrCorrupt || r==KErrAlreadyExists || r==KErrNone);
+	test_Value(r, r == KErrCorrupt || r==KErrAlreadyExists || r==KErrNone);
 	if (r==KErrCorrupt)
 		FormatFat();
 	if (r==KErrAlreadyExists)
@@ -205,13 +206,13 @@
 		test.Next(_L("Remove test directory"));
 		CFileMan* fman=CFileMan::NewL(TheFs);
 		TInt ret=fman->RmDir(sessionPath);
-		test(ret==KErrNone);
+		test_KErrNone(ret);
 		delete fman;
 		}
 	if (r!=KErrNone)
 		{
 		r=TheFs.MkDirAll(sessionPath);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 
 	Test1();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/manager/t_romg.cpp
--- a/kerneltest/f32test/manager/t_romg.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/manager/t_romg.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define	__E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32rom.h>
@@ -452,12 +453,12 @@
 //
 	test.Next(_L("Create root mem dir"));
 	TRAPD(r,TheRootDir=CMemDir::NewL());
-	test(r==KErrNone);
+	test_KErrNone(r);
 //
 	test.Next(_L("Load directory structure"));
 	TheLevel=(-1);
 	TRAP(r,TheRootDir->LoadDirL(n));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(TheLevel==(-1));
 //
 	delete buf;
@@ -553,11 +554,11 @@
 		test.End();
 		return;
 		}
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 //
 	test.Next(_L("Generating ROM image"));
 	TRAP(r,buildRomImageL());
-	test(r==KErrNone);
+	test_KErrNone(r);
 //
 	test.Next(_L("Basing the rom image"));
 	baseRomImage();
@@ -566,7 +567,7 @@
 	b+=TheFileName;
 	test.Next(b);
 	r=TheFile.Replace(TheFs,TheFileName,EFileStream|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	writeRomImage();
 	TheFile.Close();
 	delete TheRootDir;
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/plugins/version_2/crypto_encryption/src/t_encrypt.cpp
--- a/kerneltest/f32test/plugins/version_2/crypto_encryption/src/t_encrypt.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/plugins/version_2/crypto_encryption/src/t_encrypt.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -290,7 +290,7 @@
 	ret=file.Open(TheFs,filename,EFileRead);
 	safe_test(ret,__LINE__,(TText*)Expand("t_encrypt.cpp"));
 	ret=file.Seek(ESeekCurrent,seekpos);
-	safe_test(ret,__LINE__,(TText*)Expand("t_encrypt.cpp"));
+
	safe_test(ret,__LINE__,(TText*)Expand("t_encrypt.cpp"));
 	safe_check(seekpos,__LINE__,(TText*)Expand("t_encrypt.cpp"),(TInt)file_start);
 	file.Close();
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/b_file.cpp
--- a/kerneltest/f32test/server/b_file.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/b_file.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32math.h>
 #include <e32test.h>
@@ -72,7 +73,7 @@
     TInt pos=0; // Relative position zero
     aret=TheFile.Seek(ESeekCurrent,pos);
     test.Printf(_L("bwrite2,pos=%u\n"),pos);
-    test(aret==KErrNone);
+    test_KErrNone(aret);
     TInt count=pos&0xff;
 	tbuf.SetLength(aLength);
 	TText8* p=(TText8*)tbuf.Ptr();
@@ -98,7 +99,7 @@
 	CheckDisk();
     TInt pos=0; // Relative position zero
     aret=TheFile.Seek(ESeekCurrent,pos);
-    test(aret==KErrNone);
+    test_KErrNone(aret);
     TInt count=pos&0xff;
     aret=TheFile.Read(tbuf,aLength);
     if (bret<KErrNone)
@@ -127,7 +128,7 @@
 	CheckDisk();
     TInt newpos=aPos;
     aret=TheFile.Seek(ESeekStart,newpos);
-    test(aret==KErrNone);
+    test_KErrNone(aret);
     test(newpos==aPos);
 	CheckDisk();
     }
@@ -165,7 +166,7 @@
     bret=KErrAccessDenied; bwrite(1); bret=0;
     bclose();
 	aret=TheFile.Open(TheFs,tzzz,EFileRead);
-	test(aret==KErrNotFound);
+	test_Value(aret, aret == KErrNotFound);
 	test.End();
     }
 
@@ -199,15 +200,15 @@
     bposa(0);
     bret=1100; bread(1100); bret=0;
     aret=TheFile.Flush();
-    test(aret==KErrNone);
+    test_KErrNone(aret);
     aret=TheFile.SetSize(2000);
-    test(aret==KErrNone);
+    test_KErrNone(aret);
     TInt pos=0;
     aret=TheFile.Seek(ESeekCurrent,pos);
-    test(aret==KErrNone && pos==1100);
+    test_Value(aret, aret == KErrNone && pos==1100);
     pos=0;
     aret=TheFile.Seek(ESeekEnd,pos);
-    test(aret==KErrNone && pos==2000);
+    test_Value(aret, aret == KErrNone && pos==2000);
     bclose();
 	test.End();
     }
@@ -225,32 +226,32 @@
     test.Start(_L("RNDTEST..."));
     TInt64 seed(0),zero(0);
 	aret=TheFile.Replace(TheFs,rndm,EFileWrite|aMode);
-	test(aret==KErrNone);
+	test_KErrNone(aret);
     for (cnt=0;cnt<KRandomNumbers;cnt++)
         {
 		TBuf8<0x10> b;
 		b.Format(TPtrC8((TUint8*)"%8x"),Math::Rand(seed));
 		aret=TheFile.Write(b);
-		test(aret==KErrNone);
+		test_KErrNone(aret);
         }
 	TheFile.Close();
 //
     test.Next(_L("Reading back"));
     seed=zero;
 	aret=TheFile.Open(TheFs,rndm,aMode);
-	test(aret==KErrNone);
+	test_KErrNone(aret);
     for (cnt=0;cnt<KRandomNumbers;cnt++)
         {
 		TBuf8<8> b;
 		b.Format(TPtrC8((TUint8*)"%8x"),Math::Rand(seed));
 		TBuf8<8> r;
 		aret=TheFile.Read(r);
-		test(aret==KErrNone);
+		test_KErrNone(aret);
 		test(b==r);
         }
 	TheFile.Close();
     aret=TheFs.Delete(rndm);
-	test(aret==KErrNone);
+	test_KErrNone(aret);
 //
 	test.End();
     }
@@ -264,14 +265,14 @@
     test.Start(_L("TAutoClose..."));
 	TAutoClose<RFile> f;
 	aret=f.iObj.Replace(TheFs,rndm,EFileWrite);
-	test(aret==KErrNone);
+	test_KErrNone(aret);
     TInt64 seed;
     for (TInt cnt=0;cnt<KRandomNumbers;cnt++)
         {
 		TBuf8<0x10> b;
 		b.Format(TPtrC8((TUint8*)"%8x"),Math::Rand(seed));
 		aret=f.iObj.Write(b);
-		test(aret==KErrNone);
+		test_KErrNone(aret);
         }
 	test.End();
     }
@@ -283,7 +284,7 @@
 	TRequestStatus status = KRequestPending;
 	TheFile.Open(TheFs,tbin,EFileRead);
  	ret = TheFile.Read(0,tbuf,-1);			// sync
- 	test ( ret == KErrArgument);
+ 	test_Value(ret, ret == KErrArgument);
  	TheFile.Read(0,tbuf,-1,status);		// async
  	User::WaitForRequest(status);
  	test(status.Int() == KErrArgument);
@@ -299,16 +300,16 @@
 	RFile f;             
 	MakeFile(_L("C:\\F32-TST\\TFILE\\hello2.txt"));
 	TInt r=f.Open(TheFs,_L("C:\\F32-TST\\TFILE\\hello2.txt"),EFileRead); 
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TBuf8<0x100> a;
 	test.Next(_L("Check Negative length when file is empty"));
 	r=f.Read(a, -10);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	r=f.Read(0,a, -1);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	r=f.Read(0,a, -10);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	TRequestStatus	stat1;
 	f.Read(0,a,-5,stat1);
 	User::WaitForRequest(stat1);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/b_gen.cpp
--- a/kerneltest/f32test/server/b_gen.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/b_gen.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -13,6 +13,7 @@
 // Description:
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32math.h>
@@ -136,7 +137,7 @@
 	TChar drive(aDirName[0]);
 	TInt driveNo;
 	c=RFs::CharToDrive(drive,driveNo);
-	test(c==KErrNone);
+	test_KErrNone(c);
 	if ((c=TheFs.Volume(volInfo,driveNo))!=KErrNone)
 		Error(_L("Device info 1000"),c);
     }
@@ -175,7 +176,7 @@
 	if (aDeviceName.Length())
 		{
 		c=RFs::CharToDrive(aDeviceName[0],drive);
-		test(c==KErrNone);
+		test_KErrNone(c);
 		}		
 	if ((c=TheFs.Volume(volInfo,drive))!=anErr)
 		Error(_L("Device info"),c);
@@ -283,11 +284,11 @@
 	dirname.Append(KPathDelimiter);
 	MakeDir(dirname);
 	TInt err = TheFs.Rename(KDir1, KDir2);
-	test(err == KErrNone);
+	test_KErrNone(err);
 	err = TheFs.RmDir(dirname);
-	test(err == KErrNone);
+	test_KErrNone(err);
 	err = TheFs.RmDir(KDir1);
-	test(err == KErrNone);
+	test_KErrNone(err);
 	}
 	
 static void testRename()
@@ -592,7 +593,7 @@
 		{
         TParse parse;
         c=TheFs.Parse(aDirName,parse);
-        test(c==KErrNone);
+        test_KErrNone(c);
         buf=parse.Path();
         buf.Append(_L("*"));
         if (buf.Length()<=64)
@@ -688,7 +689,7 @@
     F32_Test_Utils::SetConsole(test.Console());
 
     TInt nRes=TheFs.CharToDrive(gDriveToTest, gDriveNum);
-    test(nRes==KErrNone);
+    test_KErrNone(nRes);
     
     PrintDrvInfo(TheFs, gDriveNum);
 
@@ -696,7 +697,7 @@
     if(!Is_Win32(TheFs, gDriveNum))
     {
         nRes = FormatDrive(TheFs, gDriveNum, ETrue); 
-        test(nRes==KErrNone);
+        test_KErrNone(nRes);
     }
 
     //-----------------------------------
@@ -1251,11 +1252,11 @@
          //-- This behaviour can be an optimisation to reduce number of media writes due to updating file timestamps.
          gFile.Close();
          nRes = gFile.Open(TheFs, gNameOut, EFileWrite);
-         test(nRes == KErrNone);
+         test_KErrNone(nRes);
          //-- restore the expected position in the file
          TInt pos1 = 0;
          nRes = gFile.Seek(ESeekEnd, pos1);
-         test(nRes == KErrNone);
+         test_KErrNone(nRes);
          //------------------------------------ 
          */
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/b_mtst.cpp
--- a/kerneltest/f32test/server/b_mtst.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/b_mtst.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -16,6 +16,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -52,20 +53,20 @@
     {
     test.Printf(_L("Opening: %S\n"),&nameBuf1);
     TInt r=file1.Open(TheFs,nameBuf1,EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
     test.Printf(_L("Opening: %S\n"),&nameBuf2);
 	r=file2.Open(TheFs,nameBuf2,EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
     test.Printf(_L("Checking test pattern...\n"));
 	for (TInt i=0 ; i<nTimes ; i++)
         {
         r=file1.Read(buf,len1);
-		test(r==KErrNone);
+		test_KErrNone(r);
         TInt j;
 		for (j=0 ; j< len1 ; j++)
             test(buf[j]==j);
         r=file2.Read(buf,len2);
-		test(r==KErrNone);
+		test_KErrNone(r);
         for (j=0 ; j< len2 ; j++)
             test(buf[j]=='A');
         }
@@ -91,34 +92,34 @@
         buf5.Append('D');       
 
     TInt r=file1.Create(TheFs,nameBuf1,EFileStream|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
     test.Printf(_L("Created: %S\n"),&nameBuf1);
     r=file2.Create(TheFs,nameBuf2,EFileStream|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
     test.Printf(_L("Created: %S\n"),&nameBuf2);
     r=file3.Create(TheFs,nameBuf3,EFileStream|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
     test.Printf(_L("Created: %S\n"),&nameBuf3);
     r=file4.Create(TheFs,nameBuf4,EFileStream|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
     test.Printf(_L("Created: %S\n"),&nameBuf4);
     r=file5.Create(TheFs,nameBuf5,EFileStream|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
     test.Printf(_L("Created: %S\n"),&nameBuf5);
     
     test.Next(_L("Writing test pattern..."));
     for (i=0 ; i<nTimes ; i++)
         {
         r=file1.Write(buf1,len1);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file2.Write(buf2,len2);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file3.Write(buf3,len3);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file4.Write(buf4,len4);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file5.Write(buf5,len5);
-		test(r==KErrNone);
+		test_KErrNone(r);
         }
     file1.Close();
 	file2.Close();
@@ -129,10 +130,10 @@
     test.Next(_L("Delete"));
     test.Printf(_L("Deleting: %S\n"),&nameBuf1);
     r=TheFs.Delete(nameBuf1);
-	test(r==KErrNone);
+	test_KErrNone(r);
     test.Printf(_L("Deleting: %S\n"),&nameBuf2);
 	r=TheFs.Delete(nameBuf2);
-	test(r==KErrNone);
+	test_KErrNone(r);
     
     file3.Close();
     file4.Close();
@@ -140,13 +141,13 @@
     
     test.Printf(_L("Deleting: %S\n"),&nameBuf3);
     r=TheFs.Delete(nameBuf3);
-	test(r==KErrNone);
+	test_KErrNone(r);
     test.Printf(_L("Deleting: %S\n"),&nameBuf4);
 	r=TheFs.Delete(nameBuf4);
-	test(r==KErrNone);
+	test_KErrNone(r);
     test.Printf(_L("Deleting: %S\n"),&nameBuf5);
 	r=TheFs.Delete(nameBuf5);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	test.Close();
     }
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/b_osfil.cpp
--- a/kerneltest/f32test/server/b_osfil.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/b_osfil.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -47,18 +48,18 @@
 	{
 	TEntry entry;
 	TInt r=TheFs.Entry(noDevice,entry);
-	test((r==KErrNotReady)||(r==KErrPathNotFound));
+	test_Value(r, (r == KErrNotReady)||(r==KErrPathNotFound));
 	r=TheFs.Entry(noDirectory,entry);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=TheFs.Entry(noFile,entry);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.Entry(existsFile,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iSize==KSizeExistsFile);
 	test(!entry.IsDir());
 	test(!(entry.iAtt&KEntryAttDir));
 	r=TheFs.Entry(existsFile2,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iSize==KSizeExistsFile2);
 	test(!entry.IsDir());
 	test(!(entry.iAtt&KEntryAttDir));
@@ -70,20 +71,20 @@
 */
 	{
 	TInt r=TheFs.Delete(noDevice);
-	test((r==KErrNotReady)||(r==KErrPathNotFound));
+	test_Value(r, (r == KErrNotReady)||(r==KErrPathNotFound));
 	r=TheFs.Delete(noDirectory);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=TheFs.Delete(noFile);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.Delete(existsFile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(existsFile2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TEntry entry;
 	r=TheFs.Entry(existsFile,entry);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.Entry(existsFile2,entry);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	}
 
 LOCAL_C void TestRename()
@@ -92,50 +93,50 @@
 */
 	{
 	TInt r=TheFs.Rename(noDevice,fileName);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	r=TheFs.Rename(noDirectory,fileName);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=TheFs.Rename(noFile,fileName);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.Rename(existsFile,existsFile2);
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 	r=TheFs.Delete(existsFile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(existsFile,existsFile);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.Rename(existsFile2,existsFile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TEntry entry;
 	r=TheFs.Entry(existsFile2,entry);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.Entry(existsFile,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(existsFile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void TestMkDir()
 	{
 	TParse fparse;
 	TInt r=TheFs.MkDirAll(directoryFile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TEntry entry;
 	r=TheFs.Entry(directoryFile.Left(directoryFile.Length()-1),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.IsDir());
 	test(entry.iAtt&KEntryAttDir);
 	r=TheFs.RmDir(directoryFile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fparse.Set(directoryFile,NULL,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fparse.PopDir();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(fparse.DriveAndPath());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fparse.PopDir();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(fparse.DriveAndPath());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -148,108 +149,108 @@
 	RFile p2;
 
 	TInt r=p1.Open(TheFs,noDevice,EFileStreamText);
-	test((r==KErrNotReady)||(r==KErrPathNotFound));
+	test_Value(r, (r == KErrNotReady)||(r==KErrPathNotFound));
 	r=p1.Open(TheFs,noDirectory,EFileStreamText);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	TFileName generated1;
 	r=p1.Temp(TheFs,noDevicePath,generated1,EFileStreamText);
-	test((r==KErrNotReady)||(r==KErrPathNotFound));
+	test_Value(r, (r == KErrNotReady)||(r==KErrPathNotFound));
 	r=p1.Temp(TheFs,noDirectoryPath,generated1,EFileStreamText);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 
 	r=p1.Temp(TheFs,_L(""),generated1,EFileStreamText);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName generated2;
 	r=p2.Temp(TheFs,_L(""),generated2,EFileStreamText);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(generated1!=generated2);
 	p1.Close();
 	TFileName generated3;
 	r=p1.Temp(TheFs,_L(""),generated3,EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(generated3!=generated2);
 	test(generated3!=generated1);
 	p2.Close();
 	p1.Close();
 
 	r=TheFs.Delete(generated1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(generated2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(generated3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=p1.Temp(TheFs,_L(""),generated1,EFileStreamText);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=p2.Temp(TheFs,_L(""),generated2,EFileStreamText);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(generated1!=generated2);
 	p1.Close();
 	r=p1.Temp(TheFs,_L(""),generated3,EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(generated3!=generated2);
 	test(generated3!=generated1);
 	p2.Close();
 	p1.Close();
 
 	r=TheFs.Delete(generated1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(generated2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(generated3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.MkDir(openUniqueDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=p1.Temp(TheFs,openUniqueDir,generated1,EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=p2.Temp(TheFs,openUniqueDir,generated2,EFileStreamText|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=p1.Write(_L8("junk"),4);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt pos=0;
 	r=p1.Seek(ESeekCurrent,pos);//P_FSET
-	test(r==KErrNone);
+	test_KErrNone(r);
 	p1.Close();
 	p2.Close();
 	
 	r=TheFs.Delete(generated1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(generated2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=p1.Temp(TheFs,openUniqueDir,generated1,EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=p2.Temp(TheFs,openUniqueDir,generated2,EFileStreamText);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	p1.Close();
 
 	pos=0;
 	r=p2.Seek(ESeekStart,pos);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	p2.Close();
 	r=TheFs.Delete(generated1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(generated2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(openUniqueDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void TestPaths()
 	{
 	TFileName path1;
 	TInt r=TheFs.SessionPath(path1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetSessionPath(path1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName path2;
 	r=TheFs.SessionPath(path2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(path1==path2);
 	RDir dir;
 	r=dir.Open(TheFs,path1,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	}
 
@@ -257,7 +258,7 @@
 	{
 	TEntry blk;
 	TInt r=TheFs.Entry(existsFile,blk);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TEntry blk1=blk;
 
 /* Toggle the write attribute */
@@ -273,9 +274,9 @@
 		set=KEntryAttReadOnly;
 		}
 	r=TheFs.SetEntry(existsFile,blk1.iModified,set,clear);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(existsFile,blk);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if (blk1.IsReadOnly())
 		test(!blk.IsReadOnly());
 	else
@@ -283,9 +284,9 @@
 
 /* set write attrib back */
 	r=TheFs.SetEntry(existsFile,blk1.iModified,clear,set);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(existsFile,blk);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if (blk1.IsReadOnly())
 		test(blk.IsReadOnly());
 	else
@@ -303,18 +304,18 @@
 		set=KEntryAttArchive;
 		}
 	r=TheFs.SetEntry(existsFile,blk1.iModified,set,clear);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(existsFile,blk);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if (blk1.IsArchive())
 		test(!blk.IsArchive());
 	else
 		test(blk.IsArchive());
 /* set archive attrib back */
 	r=TheFs.SetEntry(existsFile,blk1.iModified,clear,set);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(existsFile,blk);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if (blk1.IsArchive())
 		test(blk.IsArchive());
 	else
@@ -332,18 +333,18 @@
 		set=KEntryAttHidden;
 		}
 	r=TheFs.SetEntry(existsFile,blk1.iModified,set,clear);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(existsFile,blk);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if (blk1.IsHidden())
 		test(!blk.IsHidden());
 	else
 		test(blk.IsHidden());
 /* set hidden attrib back */
 	r=TheFs.SetEntry(existsFile,blk1.iModified,clear,set);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(existsFile,blk);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if (blk1.IsHidden())
 		test(blk.IsHidden());
 	else
@@ -361,26 +362,26 @@
 		set=KEntryAttSystem;
 		}
 	r=TheFs.SetEntry(existsFile,blk1.iModified,set,clear);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(existsFile,blk);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if (blk1.IsSystem())
 		test(!blk.IsSystem());
 	else
 		test(blk.IsSystem());
 /* set system attrib back */
 	r=TheFs.SetEntry(existsFile,blk1.iModified,clear,set);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(existsFile,blk);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if (blk1.IsSystem())
 		test(blk.IsSystem());
 	else
 		test(!blk.IsSystem());
 	r=TheFs.Delete(existsFile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(existsFile2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -388,15 +389,15 @@
 	{
 	RFile fcb;
 	TInt r=fcb.Replace(TheFs,existsFile,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fcb.Write(_L8("ABCDEFGHIJKLMNOPQRSTUVWXYZ"),KSizeExistsFile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fcb.Close();
 
 	r=fcb.Replace(TheFs,existsFile2,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fcb.Write(_L8("bcdefghijklmnopqrstuvwxyz"),KSizeExistsFile2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fcb.Close();
 	}
 
@@ -409,7 +410,7 @@
 
 	TVolumeInfo di;
 	TInt r=TheFs.Volume(di);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Start(_L("Info()"));
 	CreateTestFiles();
 	TestInfo();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/b_rand.cpp
--- a/kerneltest/f32test/server/b_rand.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/b_rand.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32math.h>
 #include <e32test.h>
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/b_rep.cpp
--- a/kerneltest/f32test/server/b_rep.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/b_rep.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -42,43 +43,43 @@
 
         // Replace file and write data
 		r=TheFile.Replace(TheFs,nameBuf1,EFileStream);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFile.Write(testPat1);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		
 		Mem::Copy(&buf[0],&numb,sizeof(TInt));
 		r=TheFile.Write(buf);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
         // Seek to 0 and check data
 		TInt pos=0; 
 		r=TheFile.Seek(ESeekStart,pos);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(pos==0);
 		r=TheFile.Read(chkPat1,len);
-        test(r==KErrNone);
+        test_KErrNone(r);
         test(chkPat1==testPat1);
 		r=TheFile.Read(testBuf,sizeof(TInt));
-        test(r==KErrNone);
+        test_KErrNone(r);
 		TInt chkNumb=*((TInt*)testBuf.Ptr());
         test(chkNumb==numb);
 
         // Close, then re-open file and check data
 		TheFile.Close();
 		r=TheFile.Open(TheFs,nameBuf1,EFileStream);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFile.Read(chkPat1,len);
-        test(r==KErrNone);
+        test_KErrNone(r);
         test(chkPat1==testPat1);
 		r=TheFile.Read(testBuf,sizeof(TInt));
-        test(r==KErrNone);
+        test_KErrNone(r);
 		chkNumb=*((TInt*)testBuf.Ptr());
         test(chkNumb==numb);
 		TheFile.Close();
 		}
 	test.Printf(_L("\n"));
 	r=TheFs.Delete(nameBuf1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 GLDEF_C void CallTestsL(void)
@@ -101,9 +102,9 @@
 	test.Next(_L("Subdirectory"));
 	gSessionPath=_L("\\F32-TST\\TEST1\\");
 	TInt r=TheFs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MkDirAll(gSessionPath);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 
 	DoTest();
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/clean_prepdc.cpp
--- a/kerneltest/f32test/server/clean_prepdc.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/clean_prepdc.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -18,6 +18,7 @@
 //
 
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32std.h>
@@ -56,11 +57,11 @@
 	{
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	TInt r=fMan->RmDir(_L("\\Resource\\"));
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	r=fMan->RmDir(_L("\\Sys\\"));
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	r=fMan->RmDir(_L("\\Private\\"));
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	delete fMan;
 	}
 
@@ -70,12 +71,12 @@
 //
 	{
 	TInt r=TheFs.MkDir(_L("\\Resource\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MkDir(_L("\\Sys\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFile f;
 	r=f.Create(TheFs,_L("\\Resource\\resourcefile.txt"),EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	f.Close();
 	}	
 
@@ -86,7 +87,7 @@
 	{
 	TBuf<30> tmp;
 	TInt r= TheFs.SessionPath(tmp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RDebug::Print(_L("sessp=%S"),&tmp);
 	CleanupL();
 	TestSetup();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_alert.cpp
--- a/kerneltest/f32test/server/t_alert.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_alert.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32math.h>
@@ -163,7 +164,7 @@
 	
 	RThread clientThread;
 	TInt r=clientThread.Create(_L("TALERT_Thread0"),FileAccess,0x4000,KHeapSize,KHeapSize,(TAny*)&gPathThread0,EOwnerThread);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.Resume();
 	clientThread.Close();
 	}
@@ -176,7 +177,7 @@
 	
 	RThread clientThread;
 	TInt r=clientThread.Create(_L("TALERT_Thread1"),FileAccess,0x4000,KHeapSize,KHeapSize,(TAny*)&gPathThread1,EOwnerThread);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.Resume();
 	clientThread.Close();
 	}
@@ -189,7 +190,7 @@
 	
 	RThread clientThread;
 	TInt r=clientThread.Create(_L("TALERT_Thread2"),FileAccess,0x4000,KHeapSize,KHeapSize,(TAny*)&gPathThread2,EOwnerThread);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.Resume();
 	clientThread.Close();
 	}
@@ -247,7 +248,7 @@
 	
 	RThread clientThread;
 	TInt r=clientThread.Create(_L("TALERT_Thread3"),NotifyAccess,0x4000,KHeapSize,KHeapSize,NULL,EOwnerThread);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.Resume();
 	clientThread.Close();
 	}
@@ -277,7 +278,7 @@
 	
 	RThread clientThread;
 	TInt r=clientThread.Create(_L("TALERT_Thread4"),MediaChange,0x4000,KHeapSize,KHeapSize,NULL,EOwnerThread);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.SetPriority(EPriorityMore);
 	clientThread.Resume();
 	clientThread.Close();
@@ -324,7 +325,7 @@
 		t.Close();
 	}
 	else 
-		test(r==KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 
 	r=t.Open(_L("TALERT_Thread1"),EOwnerThread);
 	if(r==KErrNone)
@@ -333,7 +334,7 @@
 		t.Close();
 	}
 	else 
-		test(r==KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 
 	r=t.Open(_L("TALERT_Thread2"),EOwnerThread);
 	if(r==KErrNone)
@@ -342,7 +343,7 @@
 		t.Close();
 	}
 	else 
-		test(r==KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 
 	r=t.Open(_L("TALERT_Thread3"),EOwnerThread);
 	if(r==KErrNone)
@@ -351,7 +352,7 @@
 		t.Close();
 	}
 	else 
-		test(r==KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 	
 	r=t.Open(_L("TALERT_Thread4"),EOwnerThread);
 	if(r==KErrNone)
@@ -360,7 +361,7 @@
 		t.Close();
 	}
 	else 
-		test(r==KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 	
 /*	TFindThread threadFinder(_L("TALERT_*"));
 	FOREVER
@@ -370,11 +371,11 @@
 		test.Printf(_L("r=%d"),r);
 		if (r==KErrNotFound)
 			break;
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test.Printf(_L("Killing Thread %S\n"),&threadName);
 		RThread t;
 		r=t.Open(threadName,EOwnerThread);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		t.Kill(KErrCancel);
 		t.Close();
 		} */
@@ -388,9 +389,9 @@
 	{
 	test.Next(_L("Create lots of threads and change notifiers"));
 	TInt r=TheFs.MkDirAll(gPathThread1);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	r=TheFs.MkDir(gPathThread2);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 
 	StartThread0(); // Read and write to D:
 	StartThread1(); // Read and write to C:
@@ -437,12 +438,12 @@
 
 	test.Next(_L("Create a hung server and kill the thread it is writing to"));
 	TInt r=TheFs.MkDir(gPathThread0);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	StartThread4(); // Generate media changes
 
 	RThread clientThread;
 	r=clientThread.Create(_L("TALERT_ThreadHangTest"),ThreadHangTest,0x4000,KHeapSize,KHeapSize,NULL,EOwnerThread);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TRequestStatus status;
 	clientThread.Logon(status);
 	clientThread.Resume();
@@ -476,7 +477,7 @@
 	r=TheFs.MkDir(gPathThread0); // Check fileserver ok
 	if(r!=KErrNone && r!=KErrAlreadyExists)
 		test.Printf(_L("r=%d"),r);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	
 	}		
 
@@ -513,7 +514,7 @@
 	FileMan=CFileMan::NewL(TheFs);
 	TInt r=FileMan->RmDir(_L("\\F32-TST\\TALERT\\"));
 	test.Printf(_L("r=%d"),r);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	delete FileMan;
 */
 	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_appins.cpp
--- a/kerneltest/f32test/server/t_appins.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_appins.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <hal.h>
@@ -53,11 +54,11 @@
 	path=_L("?:\\F32-TST\\T_APPINS\\");
 		
 	TInt r=TheNotifyFs.SessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TChar driveChar;
 	r=RFs::DriveToChar(RemovableDrive,driveChar);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	if (gSessionPath[0]=='C')
 		(gSessionPath[0] == (TText)gDriveToTest)? (path[0] = (TText)driveChar):(path[0] = (TText)gDriveToTest);
@@ -76,7 +77,7 @@
 	TRequestStatus statWilder(KRequestPending);
 
 	r=TheFs.RmDir(path);
-	test((r==KErrNone)||(r==KErrNotFound)||(r==KErrPathNotFound));
+	test_Value(r, (r == KErrNone)||(r==KErrNotFound)||(r==KErrPathNotFound));
 
 	test.Printf(_L("Notify Session Path %S\n"),&gSessionPath);
 
@@ -89,7 +90,7 @@
 	TheNotifyFs.NotifyChange(ENotifyEntry,statWilder,_L("*:\\"));
 
 	r=TheFs.MkDir(path);	
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 	User::WaitForAnyRequest();
 	test(statEntry==KErrNone);
 	test(statFile==KErrNone);
@@ -112,7 +113,7 @@
 	r=file.Replace(TheFs,filePath,EFileRead|EFileWrite);
 	file.Close();
 	User::WaitForAnyRequest();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test (statEntry==KErrNone);
 	test(statFile==KErrNone);
 	test(statDir==KRequestPending);
@@ -127,7 +128,7 @@
 	TheNotifyFs.NotifyChange(ENotifyEntry,statWilder,_L("*:\\"));
 	
 	r=TheFs.Delete(filePath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForAnyRequest();
 	test (statEntry==KErrNone);
 	test(statFile==KErrNone);
@@ -143,7 +144,7 @@
 	TheNotifyFs.NotifyChange(ENotifyFile,statWilder,_L("*:\\"));
 
 	r=TheFs.RmDir(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForAnyRequest();
 	test (statEntry==KErrNone);
 	test(statFile==KRequestPending);
@@ -166,7 +167,7 @@
 		
 	TChar driveChar;
 	TInt err=RFs::DriveToChar(RemovableDrive,driveChar);
-	test(err==KErrNone);
+	test_KErrNone(err);
 
 	if (gSessionPath[0]=='C')
 		(gSessionPath[0] == (TText)gDriveToTest)? (sessionPath[0] = (TText)driveChar):(sessionPath[0] = (TText)gDriveToTest);
@@ -179,13 +180,13 @@
 		//return;
 	
 	TInt r=TheFs.SetSessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TFileName path;
 	path=_L("\\F32-TST\\T_APPINS\\");	//	Takes drive implicitly from associated session path
 						
 	r=TheFs.RmDir(path);
-	test((r==KErrNone)||(r==KErrNotFound)||(r==KErrPathNotFound));
+	test_Value(r, (r == KErrNone)||(r==KErrNotFound)||(r==KErrPathNotFound));
 	
 	TRequestStatus statEntry(KRequestPending);
 	TRequestStatus statFile(KRequestPending);
@@ -206,7 +207,7 @@
 	TheNotifyFs.NotifyChange(ENotifyAll,statWilder,_L("*:\\"));
 
 	r=TheFs.MkDir(path);										//	Creates the directory on the drive
-	test((r==KErrNone)||(r==KErrAlreadyExists));				//	associated with TheFs session path
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));				//	associated with TheFs session path
 	test (statEntry==KRequestPending);
 	test(statFile==KRequestPending);
 	test(statDir==KRequestPending);	//	No notification because it's watching a different drive!
@@ -224,7 +225,7 @@
 	RFile file;
 	r=file.Replace(TheFs,filePath,EFileRead|EFileWrite);
 	file.Close();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test (statEntry==KRequestPending);	//	No notification!
 	test(statFile==KRequestPending);
@@ -237,7 +238,7 @@
 	TheNotifyFs.NotifyChange(ENotifyDir,statWilder,_L("*:\\"));
 
 	r=TheFs.Delete(filePath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	Still no notification	
 	test (statEntry==KRequestPending);
 	test(statFile==KRequestPending);
@@ -250,7 +251,7 @@
 	TheNotifyFs.NotifyChange(ENotifyDir,statWild,_L("?:\\F32-TST\\T_APPINS\\"));
 //	TheNotifyFs.NotifyChange(ENotifyDir,statWilder,_L("*:\\"));
 	r=TheFs.RmDir(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	Still no notification	
 	test (statEntry==KRequestPending);
 	test(statFile==KRequestPending);
@@ -271,7 +272,7 @@
 	TFileName path;
 	path=_L("\\F32-TST\\T_APPINS\\");
 	TInt r=TheFs.RmDir(path);
-	test((r==KErrNone)||(r==KErrNotFound)||(r==KErrPathNotFound));
+	test_Value(r, (r == KErrNone)||(r==KErrNotFound)||(r==KErrPathNotFound));
 	
 	TRequestStatus statEntry(KRequestPending);
 	TRequestStatus statFile(KRequestPending);
@@ -283,7 +284,7 @@
 //	Set the session path of the session	which creates the file/directory to be
 //	the same as the notification session's session path
 	r=TheFs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	Submit notify change requests (requesting ahead)
 	test.Printf(_L("Create a directory %S\n"),&path);
@@ -294,7 +295,7 @@
 	TheNotifyFs.NotifyChange(ENotifyEntry,statWilder,_L("*:\\"));
 
 	r=TheFs.MkDir(path);	
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 	User::WaitForAnyRequest();
 	test (statEntry==KErrNone);
 	test(statFile==KErrNone);
@@ -318,7 +319,7 @@
 	r=file.Replace(TheFs,filePath,EFileRead|EFileWrite);
 	file.Close();
 	User::WaitForAnyRequest();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test (statEntry==KErrNone);
 	test(statFile==KErrNone);
 	test(statDir==KRequestPending);	
@@ -333,7 +334,7 @@
 	TheNotifyFs.NotifyChange(ENotifyEntry,statWilder,_L("*:\\"));
 
 	r=TheFs.Delete(filePath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForAnyRequest();
 	test (statEntry==KErrNone);
 	test(statFile==KErrNone);
@@ -349,7 +350,7 @@
 	TheNotifyFs.NotifyChange(ENotifyEntry,statWilder,_L("*:\\"));
 
 	r=TheFs.RmDir(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForAnyRequest();
 	test (statEntry==KErrNone);
 	test(statFile==KRequestPending);
@@ -374,7 +375,7 @@
 	
 	TChar driveChar;
 	TInt r=RFs::DriveToChar(RemovableDrive,driveChar);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	if (gDriveToTest =='C')
 		pathBuf[0]=driveChar;
@@ -383,21 +384,21 @@
 	
 	path = pathBuf;
 	r=TheFs.RmDir(path);
-	test((r==KErrNone)||(r==KErrNotFound)||(r==KErrPathNotFound));
+	test_Value(r, (r == KErrNone)||(r==KErrNotFound)||(r==KErrPathNotFound));
 		
 	TInt result;
 	result=TheFs.MkDir(_L("C:\\SILLY\\"));
-	test((result==KErrNone)||(result==KErrAlreadyExists));
+	test_Value(result, (result == KErrNone)||(result==KErrAlreadyExists));
 	result=TheFs.MkDir(_L("C:\\SILLY\\SILLIER\\"));
-	test((result==KErrNone)||(result==KErrAlreadyExists));
+	test_Value(result, (result == KErrNone)||(result==KErrAlreadyExists));
 	result=TheFs.MkDir(_L("C:\\SILLY\\SILLIER\\SILLIEST\\"));
-	test((result==KErrNone)||(result==KErrAlreadyExists));
+	test_Value(result, (result == KErrNone)||(result==KErrAlreadyExists));
 
 	result=TheNotifyFs.SetSessionPath(_L("C:\\SILLY\\SILLIER\\SILLIEST\\"));
-	test(result==KErrNone);
+	test_KErrNone(result);
 	
 	result=TheNotifyFs.SessionPath(gSessionPath);
-	test(result==KErrNone);
+	test_KErrNone(result);
 	test.Printf(_L("Session Path %S\n"),&gSessionPath);
 
 	TRequestStatus statEntry(KRequestPending);
@@ -411,7 +412,7 @@
 	TheNotifyFs.NotifyChange(ENotifyDir,statDir,path);
 
 	r=TheFs.MkDir(path);	
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 	User::WaitForAnyRequest();
 	test (statEntry==KErrNone);
 	test(statFile==KErrNone);
@@ -430,7 +431,7 @@
 	r=file.Replace(TheFs,filePath,EFileRead|EFileWrite);
 	file.Close();
 	User::WaitForAnyRequest();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test (statEntry==KErrNone);
 	test(statFile==KErrNone);
 	test(statDir==KRequestPending);
@@ -441,7 +442,7 @@
 	TheNotifyFs.NotifyChange(ENotifyFile,statFile,path);
 	
 	r=TheFs.Delete(filePath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForAnyRequest();
 	test (statEntry==KErrNone);
 	test(statFile==KErrNone);
@@ -452,18 +453,18 @@
 	TheNotifyFs.NotifyChange(ENotifyEntry,statEntry,path);
 	TheNotifyFs.NotifyChange(ENotifyFile,statFile,path);
 	r=TheFs.RmDir(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForAnyRequest();
 	test (statEntry==KErrNone);
 	test(statFile==KRequestPending);
 	test(statDir==KErrNone);
 
 	result=TheFs.RmDir(_L("C:\\SILLY\\SILLIER\\SILLIEST\\"));
-	test((result==KErrNone)||(result==KErrAlreadyExists));
+	test_Value(result, (result == KErrNone)||(result==KErrAlreadyExists));
 	result=TheFs.RmDir(_L("C:\\SILLY\\SILLIER\\"));
-	test((result==KErrNone)||(result==KErrAlreadyExists));
+	test_Value(result, (result == KErrNone)||(result==KErrAlreadyExists));
 	result=TheFs.RmDir(_L("C:\\SILLY\\"));
-	test((result==KErrNone)||(result==KErrAlreadyExists));	
+	test_Value(result, (result == KErrNone)||(result==KErrAlreadyExists));	
 	}
 
 #endif
@@ -498,7 +499,7 @@
 
 	test.Start(_L("Testing filesystem"));
 	TInt r=TheNotifyFs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName sessionPath;
 	TInt uid;
 	test(HAL::Get(HAL::EMachineUid,uid)==KErrNone);
@@ -511,7 +512,7 @@
 #if !defined(__WINS__)
 //	MARM TESTS
 	r=TheFs.MkDir(_L("C:\\F32-TST\\"));
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 
 	if(KErrNone == TheFs.DriveList(drvList))
 		{
@@ -543,7 +544,7 @@
 		}
 	
 	r=RFs::DriveToChar(RemovableDrive,driveChar);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	if(gDriveToTest == 'C')
 		dirBuf[0] = (TText)driveChar;
@@ -558,12 +559,12 @@
 		//test.Getch();
 		r=TheFs.MkDir(dirBuf);
 		}
-	test((r==KErrNone)||(r==KErrAlreadyExists));	
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));	
 		
 //	Set the notification session path to the test directory on C drive
 	sessionPath=_L("C:\\F32-TST\\");
 	r=TheNotifyFs.SetSessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	Run tests
 	TRAP(r,DoTests());
 	if (r!=KErrNone)
@@ -579,9 +580,9 @@
 		
 
 	r=TheNotifyFs.SetSessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TRAP(r,DoTests());
 	if (r!=KErrNone)
 		test.Printf(_L("Error: %d\n"),r);
@@ -589,12 +590,12 @@
 	CheckDisk();
 #elif defined (__WINS__)
 	r=TheFs.MkDir(_L("X:\\F32-TST\\"));
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 	r=TheFs.MkDir(_L("Y:\\F32-TST\\"));
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 //	Set session path to test directory on Y drive
 	r=TheNotifyFs.SetSessionPath(_L("Y:\\F32-TST\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TRAP(r,DoTests());
 	if (r!=KErrNone)
 		test.Printf(_L("Error: %d\n"),r);
@@ -604,7 +605,7 @@
 	//we have no X drive on eka2 yet
 //	Set session path to test directory on X drive	
 //	r=TheNotifyFs.SetSessionPath(_L("X:\\F32-TST\\"));
-//	test(r==KErrNone);
+//	test_KErrNone(r);
 //	TRAP(r,DoTests());
 
 	if (r!=KErrNone)
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_bigfile.cpp
--- a/kerneltest/f32test/server/t_bigfile.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_bigfile.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -34,6 +34,7 @@
 //
 
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32svr.h>
@@ -168,27 +169,27 @@
 	test.Next(_L("2GBMinusOne File: Open"));
 
 	r = f.Open(TheFs, fname, EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	testSize = K2GbMinusOne;
 	
 	test.Next(_L("2GBMinusOne File: Read"));
 
 	r=f.Size((TInt&) size);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(size == testSize);
 	
 	r = TheFs.Entry(fname, entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test ((TUint) entry.iSize == testSize);
 
 	// seek to just below 2GB
 	testPos = (K2GbMinusOne - K1Kb) & KPosMask;
 	r = f.Seek(ESeekStart, (TInt&) testPos);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r = f.Read(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TUint posRead =  * ((TUint*) &bufPtr[0]);
 	test.Printf(_L("position read %08X, expected %08X\n"), posRead, testPos);
@@ -221,13 +222,13 @@
 
 	test.Next(_L("2GB File: Test the size with RFs::Entry"));
 	r = TheFs.Entry(fname, entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test ((TUint) entry.iSize == testSize);
 
 	test.Next(_L("2GB File: Attempt to open (should fail with KErrToBig)"));
 
 	r = f.Open(TheFs, fname, EFileRead);
-	test(r==KErrTooBig);
+	test_Value(r, r == KErrTooBig);
 	}
 
 //----------------------------------------------------------------------------------------------
@@ -254,13 +255,13 @@
 
 	test.Next(_L("3GB File: Test the size with RFs::Entry"));
 	r = TheFs.Entry(fname, entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test ((TUint) entry.iSize == testSize);
 
 	test.Next(_L("3GB File: Attempt to open (should fail with KErrToBig)"));
 
 	r = f.Open(TheFs, fname, EFileRead);
-	test(r==KErrTooBig);
+	test_Value(r, r == KErrTooBig);
 	}
 
 //----------------------------------------------------------------------------------------------
@@ -288,13 +289,13 @@
 	test.Next(_L("4GB File: Test the size with RFs::Entry"));
 	r = TheFs.Entry(fname, entry);
 	
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test ((TUint) entry.iSize == testSize);
 
 	test.Next(_L("4GB File: Attempt to open (should fail with KErrToBig)"));
 
 	r = f.Open(TheFs, fname, EFileRead);
-	test(r==KErrTooBig);
+	test_Value(r, r == KErrTooBig);
 	}
 
 //----------------------------------------------------------------------------------------------
@@ -324,27 +325,27 @@
 	test.Next(_L("2GBMinusOne File: Open"));
 
 	r = f.Open(TheFs, fname, EFileRead | EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	
 	test.Next(_L("2GBMinusOne File: Attempt to extend"));
 
 	r=f.Size((TInt&) size);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(size == testSize);
 	
 	r = TheFs.Entry(fname, entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test ((TUint) entry.iSize == testSize);
 
 	// seek to end
 	testPos = 0;
 	r = f.Seek(ESeekEnd, (TInt&) testPos);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	bufPtr.SetLength(1);
 	r = f.Write(bufPtr);
-	test(r==KErrTooBig);
+	test_Value(r, r == KErrTooBig);
 
 	f.Close();
 	}
@@ -365,7 +366,7 @@
 	test.Printf(_L("Deleting %S\n"), &aFileName);
 
 	TInt r = TheFs.Delete(aFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	CheckDisk();
 	}
@@ -388,11 +389,11 @@
 
 	RDir dir;
 	TInt r = dir.Open(TheFs, _L("*.*"), KEntryAttNormal);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	
 	TEntryArray entryArray;
 	r = dir.Read(entryArray);
-	test (r == KErrEof);
+	test_Value(r, r == KErrEof);
 
 	test(entryArray.Count() == gFilesInDirectory);
 
@@ -425,7 +426,7 @@
 	test.Next(_L("Read a directory containing large files using CDir & sort by size"));
 	CDir* dirList;
 	r=TheFs.GetDir(_L("*.*"), KEntryAttMaskSupported, ESortBySize, dirList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dirList->Count() == gFilesInDirectory);
 	for (n=0; n<dirList->Count(); n++)
 		{
@@ -483,16 +484,16 @@
 	TPath filePathNew =	_L("?:\\TEST\\");
 	TChar driveLetter;
 	TInt r=TheFs.DriveToChar(gDrive,driveLetter);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	filePathNew[0] = (TText) driveLetter;
 
 	// move to new directory
 	r = fileMan->Move(filePathOld, filePathNew, CFileMan::ERecurse | CFileMan::EOverWrite);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	// then move back again
 	r = fileMan->Move(filePathNew, filePathOld);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	delete fileMan;
 	}
@@ -522,7 +523,7 @@
 	TPath filePathNew =	_L("?:\\TEST\\");
 	TChar driveLetter;
 	TInt r = TheFs.DriveToChar(gDrive,driveLetter);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	filePathNew[0] = (TText) driveLetter;
 
 	// create some small files in the source directory 
@@ -532,47 +533,47 @@
 	_LIT(KFileSmall2, "FileSmallTwo.txt");
 	_LIT(KFileSmall3, "FileSmallThree.txt");
 	r = file.Create(TheFs, KFileSmall1(), EFileWrite | EFileShareAny);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = file.Write(_L8("1"));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	r = file.Create(TheFs, KFileSmall2(), EFileWrite | EFileShareAny);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = file.Write(_L8("12"));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	r = file.Create(TheFs, KFileSmall3(), EFileWrite | EFileShareAny);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = file.Write(_L8("123"));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	// copy to new directory
 	r = fileMan->Copy(filePathOld, filePathNew, CFileMan::ERecurse | CFileMan::EOverWrite);
-	test(r == KErrNone || r == KErrTooBig);
+	test_Value(r, r == KErrNone || r == KErrTooBig);
 
 
 	// check SMALL files have been copied
 	RDir dir;
 	r = dir.Open(TheFs, filePathNew, KEntryAttNormal);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	TEntryArray entryArray;
 	r = dir.Read(entryArray);
-	test (r == KErrEof);
+	test_Value(r, r == KErrEof);
 	test(entryArray.Count() == 3);
 	dir.Close();
 	
 	// then delete the new directory
 	r = fileMan->Delete(filePathNew);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	
 	// attempt to copy to new directory again - this time with an observer
 	fileMan->SetObserver(observer);
 	r = fileMan->Copy(filePathOld, filePathNew, CFileMan::ERecurse | CFileMan::EOverWrite);
-	test(r == KErrNone || r == KErrTooBig);
+	test_Value(r, r == KErrNone || r == KErrTooBig);
 	
 	// test that 3 small files were copied and 1 or 2 large files failed to copy
 	// (For 8 GB disk, the 4GB file is missing)
@@ -581,15 +582,15 @@
 
 	// check SMALL files have been copied
 	r = dir.Open(TheFs, filePathNew, KEntryAttNormal);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	r = dir.Read(entryArray);
-	test (r == KErrEof);
+	test_Value(r, r == KErrEof);
 	test(entryArray.Count() == 3);
 	dir.Close();
 	
 	// then delete the new directory
 	r = fileMan->Delete(filePathNew);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	delete observer;
 	delete fileMan;
@@ -612,17 +613,17 @@
 
 	CDirScan* scanner = NULL;
 	TRAP(r, scanner = CDirScan::NewL(TheFs));
-	test(r == KErrNone && scanner);
+	test_Value(r, r == KErrNone && scanner);
 
 	TRAP(r, scanner->SetScanDataL(aName,KEntryAttDir,ESortByName|EAscending,aDirection));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	CDir *entryList=NULL;
 	TInt filesFound = 0;
 	for (;;)
 		{
 		TRAP(r, scanner->NextL(entryList));
-		test(r == aError);
+		test_Value(r, r == aError);
 		if (entryList==NULL)
 			break;
 		TInt count = entryList->Count();
@@ -669,11 +670,11 @@
 	TInt r;
 
 	r = TheFs.CharToDrive(gDriveToTest, gDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 #ifdef __MOUNT_RAW_EXT__
 	r=TheFs.FileSystemName(gOldFsName, gDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	if (gOldFsName.CompareF(KFATName) != 0)
 		{
@@ -682,9 +683,9 @@
 		}
 
     r = TheFs.AddExtension(KExtName);
-    test(r==KErrNone || r==KErrAlreadyExists);
+    test_Value(r, r == KErrNone || r==KErrAlreadyExists);
     r = TheFs.MountExtension(KExtName, gDrive);
-    test(r==KErrNone || r==KErrAlreadyExists);
+    test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 #endif
 
 	TVolumeInfo vi;
@@ -715,7 +716,7 @@
 		
 		test.Next(_L("Scan Drive"));
 		r = TheFs.ScanDrive(gSessionPath);
-		test (r == KErrNone);
+		test_KErrNone(r);
 
 		// NB the 4GB file will not be present unless the disk is > 8GB (because it doesn't fit)
 		if (!FilePresent(KFile4GBMinusOne()))
@@ -761,10 +762,10 @@
 
 #ifdef __MOUNT_RAW_EXT__
 	r = TheFs.DismountExtension(KExtName, gDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r = TheFs.RemoveExtension(KExtName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 #endif
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_blockmap.cpp
--- a/kerneltest/f32test/server/t_blockmap.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_blockmap.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -33,6 +33,7 @@
 //! @SYMTestStatus          Implemented
 
 
+#define __E32TEST_EXTENSION__
 #include <e32test.h>
 #include <e32svr.h>
 #include <f32file.h>
@@ -80,12 +81,12 @@
 	r = fMan->Delete(name);
 
 	r = fMan->Copy(KTestFile, name);
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 	TInt localDriveNum = 0;
 	RFile testFile;
 	r = testFile.Open( TheFs, name, EFileRead );
-	test( r == KErrNone );
+	test_KErrNone(r);
 	
 	RArray<SBlockMapInfo> map;	// From RArray<TBlockMapEntry> map; to RArray<SBlockMapInfo> map;
 	SBlockMapInfo info;
@@ -102,9 +103,9 @@
 			map.Close();
 			testFile.Close();
 			r = fMan->Attribs(name, 0, KEntryAttReadOnly, 0);
-			test( r == KErrNone );
+			test_KErrNone(r);
 			r = fMan->Delete(name);
-			test( r == KErrNone );
+			test_KErrNone(r);
 			delete fMan;
 			return bmErr;
 			}
@@ -117,7 +118,7 @@
 
 	TInt size;
 	r = testFile.Size(size);
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 	TBuf8<KReadBufferSize> buf1;
 	TBuf8<KReadBufferSize> buf2;
@@ -144,7 +145,7 @@
 
 	const TInt KTotalSegments = totalSegments;
 	r = localDrive.Connect( localDriveNum, changed );
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 //	For each SBlockMapInfo object in RArray map
 	for ( c = 0; c < map.Count(); c++ )
@@ -175,7 +176,7 @@
 					testFile.Read( startPos + amountRead, buf1, KReadBufferSize );
 					localDrive.Read( map[c].iStartBlockAddress + myBlockMapEntry->iStartBlock * map[c].iBlockGranularity + (c2 == 1?map[c].iBlockStartOffset:0) + myCounter*KReadBufferSize, KReadBufferSize, buf2);
 					r = buf1.Compare( buf2 );
-					test( r == 0 );
+					test_Value(r, r == 0 );
 					buf1.Zero();
 					buf2.Zero();
 					myCounter++;
@@ -188,7 +189,7 @@
 					testFile.Read(startPos + amountRead, buf1, miniLength);
 					localDrive.Read( map[c].iStartBlockAddress + myBlockMapEntry->iStartBlock * map[c].iBlockGranularity + (c2 == 1?map[c].iBlockStartOffset:0) + myCounter*KReadBufferSize, miniLength, buf2);
 					r = buf1.Compare( buf2 );
-					test( r == 0 );
+					test_Value(r, r == 0 );
 					amountRead += miniLength;
 					length -= miniLength;
 					miniLength = 0;
@@ -201,9 +202,9 @@
 
 	testFile.Close();
 	r=fMan->Attribs(name, 0, KEntryAttReadOnly, 0);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	r = fMan->Delete(name);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	delete fMan;
 	return bmErr;
 	}
@@ -216,7 +217,7 @@
 	TInt localDriveNum = 0;
 	RFile testFile;
 	TInt r = testFile.Open( TheFs, KTestFileFAT, EFileRead );
-	test( r == KErrNone );
+	test_KErrNone(r);
 	
 	RArray<SBlockMapInfo> map;	// From RArray<TBlockMapEntry> map; to RArray<SBlockMapInfo> map;
 	SBlockMapInfo info;
@@ -243,7 +244,7 @@
 
 	TInt size;
 	r = testFile.Size(size);
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 	TBuf8<KReadBufferSize> buf1;
 	TBuf8<KReadBufferSize> buf2;
@@ -268,7 +269,7 @@
 
 	const TInt KTotalSegments = totalSegments;
 	r = localDrive.Connect( localDriveNum, changed );
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 //	For each SBlockMapInfo object in RArray map
 	for ( c = 0; c < map.Count(); c++ )
@@ -300,7 +301,7 @@
 					testFile.Read( startPos + amountRead, buf1, KReadBufferSize );
 					localDrive.Read( map[c].iStartBlockAddress + myBlockMapEntry->iStartBlock * map[c].iBlockGranularity + (c2 == 1?map[c].iBlockStartOffset:0) + myCounter*KReadBufferSize, KReadBufferSize, buf2);
 					r = buf1.Compare( buf2 );
-					test( r == 0 );
+					test_Value(r, r == 0 );
 					buf1.Zero();
 					buf2.Zero();
 					myCounter++;
@@ -313,7 +314,7 @@
 					testFile.Read(startPos + amountRead, buf1, miniLength);
 					localDrive.Read( map[c].iStartBlockAddress + myBlockMapEntry->iStartBlock * map[c].iBlockGranularity + (c2 == 1?map[c].iBlockStartOffset:0) + myCounter*KReadBufferSize, miniLength, buf2);
 					r = buf1.Compare( buf2 );
-					test( r == 0 );
+					test_Value(r, r == 0 );
 					amountRead += miniLength;
 					length -= miniLength;
 					miniLength = 0;
@@ -335,7 +336,7 @@
 	TInt localDriveNum = 0;
 	RFile testFile;
 	TInt r = testFile.Open( TheFs, KTestFile, EFileRead );
-	test( r == KErrNone );
+	test_KErrNone(r);
 	
 	RArray<SBlockMapInfo> map;	// From RArray<TBlockMapEntry> map; to RArray<SBlockMapInfo> map;
 	SBlockMapInfo info;
@@ -362,7 +363,7 @@
 
 	TInt size;
 	r = testFile.Size(size);
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 	TBuf8<KReadBufferSize> buf1;
 	TBuf8<KReadBufferSize> buf2;
@@ -384,7 +385,7 @@
 		totalSegments += granularity;
 		}
 	r = localDrive.Connect( localDriveNum, changed );
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 //	For each SBlockMapInfo object in RArray map
 	for ( c = 0; c < map.Count(); c++ )
@@ -412,7 +413,7 @@
 					testFile.Read( startPos + amountRead, buf1, KReadBufferSize );
 					localDrive.Read( map[c].iStartBlockAddress + myBlockMapEntry->iStartBlock * map[c].iBlockGranularity + (c2 == 1?map[c].iBlockStartOffset:0) + myCounter*KReadBufferSize, KReadBufferSize, buf2);
 					r = buf1.Compare( buf2 );
-					test( r == 0 );
+					test_Value(r, r == 0 );
 					buf1.Zero();
 					buf2.Zero();
 					myCounter++;
@@ -425,7 +426,7 @@
 					testFile.Read(startPos + amountRead, buf1, miniLength);
 					localDrive.Read( map[c].iStartBlockAddress + myBlockMapEntry->iStartBlock * map[c].iBlockGranularity + (c2 == 1?map[c].iBlockStartOffset:0) + myCounter*KReadBufferSize, miniLength, buf2);
 					r = buf1.Compare( buf2 );
-					test( r == 0 );
+					test_Value(r, r == 0 );
 					amountRead += miniLength;
 					length -= miniLength;
 					miniLength = 0;
@@ -455,12 +456,12 @@
 	r = fMan->Delete(name);
 
 	r = fMan->Copy(KTestFile, name);
-	test( r == KErrNone  || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone  || r == KErrAlreadyExists);
 
 	TInt localDriveNum = 0;
 	RFile testFile;
 	r = testFile.Open( TheFs, name, EFileRead );
-	test( r == KErrNone );
+	test_KErrNone(r);
 	
 	RArray<SBlockMapInfo> map;	// From RArray<TBlockMapEntry> map; to RArray<SBlockMapInfo> map;
 	SBlockMapInfo info;
@@ -477,9 +478,9 @@
 			map.Close();
 			testFile.Close();
 			r = fMan->Attribs(name, 0, KEntryAttReadOnly, 0);
-			test( r == KErrNone );
+			test_KErrNone(r);
 			r = fMan->Delete(name);
-			test( r == KErrNone );
+			test_KErrNone(r);
 			delete fMan;
 			return bmErr;
 			}
@@ -492,7 +493,7 @@
 
 	TInt size;
 	r = testFile.Size(size);
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 	TBuf8<KReadBufferSize> buf1;
 	TBuf8<KReadBufferSize> buf2;
@@ -520,7 +521,7 @@
 	const TInt KTotalSegments = totalSegments;
 
 	r = localDrive.Connect( localDriveNum, changed );
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 //	For each SBlockMapInfo object in RArray map
 	for ( c = 0; c < map.Count(); c++ )
@@ -552,7 +553,7 @@
 					testFile.Read( startPos + amountRead, buf1, KReadBufferSize );
 					localDrive.Read( map[c].iStartBlockAddress + myBlockMapEntry->iStartBlock * map[c].iBlockGranularity + (c2 == 1?map[c].iBlockStartOffset:0) + myCounter*KReadBufferSize, KReadBufferSize, buf2);
 					r = buf1.Compare( buf2 );
-					test( r == 0 );
+					test_Value(r, r == 0 );
 					buf1.Zero();
 					buf2.Zero();
 					myCounter++;
@@ -565,7 +566,7 @@
 					testFile.Read(startPos + amountRead, buf1, miniLength);
 					localDrive.Read( map[c].iStartBlockAddress + myBlockMapEntry->iStartBlock * map[c].iBlockGranularity + (c2 == 1?map[c].iBlockStartOffset:0) + myCounter*KReadBufferSize, miniLength, buf2);
 					r = buf1.Compare( buf2 );
-					test( r == 0 );
+					test_Value(r, r == 0 );
 					amountRead += miniLength;
 					length -= miniLength;
 					miniLength = 0;
@@ -578,9 +579,9 @@
 
 	testFile.Close();
 	r=fMan->Attribs(name, 0, KEntryAttReadOnly, 0);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	r = fMan->Delete(name);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	delete fMan;
 	return bmErr;
 	}
@@ -600,11 +601,11 @@
 	r = fMan->Delete(name);
 
 	r = fMan->Copy(KTestFile, name);
-	test( r == KErrNone  || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone  || r == KErrAlreadyExists);
 
 	RFile testFile;
 	r = testFile.Open( TheFs, name, EFileRead );
-	test( r == KErrNone );
+	test_KErrNone(r);
 	
 	RArray<SBlockMapInfo> map;	// From RArray<TBlockMapEntry> map; to RArray<SBlockMapInfo> map;
 	SBlockMapInfo info;
@@ -616,9 +617,9 @@
 
 	testFile.Close();
 	r = fMan->Attribs(name, 0, KEntryAttReadOnly, 0);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	r = fMan->Delete(name);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	delete fMan;
 	return bmErr;
 	}
@@ -635,11 +636,11 @@
 	name.Append( KTestFileName );
 
 	TInt r=fMan->Copy(KTestFile, name);
-	test( r == KErrNone  || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone  || r == KErrAlreadyExists);
 
 	RFile testFile;
 	r = testFile.Open( TheFs, name, EFileRead );
-	test( r == KErrNone );
+	test_KErrNone(r);
 	
 	RArray<SBlockMapInfo> map;	// From RArray<TBlockMapEntry> map; to RArray<SBlockMapInfo> map;
 	SBlockMapInfo info;
@@ -648,9 +649,9 @@
 
 	testFile.Close();
 	r=fMan->Attribs(name, 0, KEntryAttReadOnly, 0);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	r = fMan->Delete(name);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	delete fMan;
 	return bmErr;
 	}
@@ -667,12 +668,12 @@
 	name.Append( KTestFileName );
 
 	TInt r=fMan->Copy(KTestFile, name);
-	test( r == KErrNone  || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone  || r == KErrAlreadyExists);
 
 	TInt localDriveNum = 0;
 	RFile testFile;
 	r = testFile.Open( TheFs, name, EFileRead );
-	test( r == KErrNone );
+	test_KErrNone(r);
 	
 	RArray<SBlockMapInfo> map;	// From RArray<TBlockMapEntry> map; to RArray<SBlockMapInfo> map;
 	SBlockMapInfo info;
@@ -689,9 +690,9 @@
 			map.Close();
 			testFile.Close();
 			r = fMan->Attribs(name, 0, KEntryAttReadOnly, 0);
-			test( r == KErrNone );
+			test_KErrNone(r);
 			r = fMan->Delete(name);
-			test( r == KErrNone );
+			test_KErrNone(r);
 			delete fMan;
 			return bmErr;
 			}
@@ -704,7 +705,7 @@
 
 	TInt size;
 	r = testFile.Size(size);
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 	TBuf8<KReadBufferSize> buf1;
 	TBuf8<KReadBufferSize> buf2;
@@ -732,7 +733,7 @@
 	const TInt KTotalSegments = totalSegments;
 
 	r = localDrive.Connect( localDriveNum, changed );
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 //	For each SBlockMapInfo object in RArray map
 	for ( c = 0; c < map.Count(); c++ )
@@ -764,7 +765,7 @@
 					testFile.Read( startPos + amountRead, buf1, KReadBufferSize );
 					localDrive.Read( map[c].iStartBlockAddress + myBlockMapEntry->iStartBlock * map[c].iBlockGranularity + (c2 == 1?map[c].iBlockStartOffset:0) + myCounter*KReadBufferSize, KReadBufferSize, buf2);
 					r = buf1.Compare( buf2 );
-					test( r == 0 );
+					test_Value(r, r == 0 );
 					buf1.Zero();
 					buf2.Zero();
 					myCounter++;
@@ -777,7 +778,7 @@
 					testFile.Read(startPos + amountRead, buf1, miniLength);
 					localDrive.Read( map[c].iStartBlockAddress + myBlockMapEntry->iStartBlock * map[c].iBlockGranularity + (c2 == 1?map[c].iBlockStartOffset:0) + myCounter*KReadBufferSize, miniLength, buf2);
 					r = buf1.Compare( buf2 );
-					test( r == 0 );
+					test_Value(r, r == 0 );
 					amountRead += miniLength;
 					length -= miniLength;
 					miniLength = 0;
@@ -790,9 +791,9 @@
 
 	testFile.Close();
 	r=fMan->Attribs(name, 0, KEntryAttReadOnly, 0);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	r = fMan->Delete(name);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	delete fMan;
 	return bmErr;
 	}
@@ -814,7 +815,7 @@
 	TInt localDriveNum = 0;
 	RFile testFile;
 	TInt r = testFile.Open( TheFs, name, EFileRead );
-	test( r == KErrNone );
+	test_KErrNone(r);
 	RArray<SBlockMapInfo> map;	// From RArray<TBlockMapEntry> map; to RArray<SBlockMapInfo> map;
 	SBlockMapInfo info;
 	TInt counter = 0;
@@ -832,9 +833,9 @@
 			if ( Finished )
 				{
 				r = fMan->Attribs(name, 0, KEntryAttReadOnly, 0);
-				test( r == KErrNone );
+				test_KErrNone(r);
 				r = fMan->Delete(name);
-				test( r == KErrNone );
+				test_KErrNone(r);
 				}
 			delete fMan;
 			return bmErr;
@@ -847,7 +848,7 @@
 	TInt granularity;
 	TInt size;
 	r = testFile.Size(size);
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 	TBuf8<KReadBufferSize> buf1;
 	TBuf8<KReadBufferSize> buf2;
@@ -874,7 +875,7 @@
 
 	const TInt KTotalSegments = totalSegments;
 	r = localDrive.Connect( localDriveNum, changed );
-	test( r == KErrNone );
+	test_KErrNone(r);
 
 //	For each SBlockMapInfo object in RArray map
 	for ( c = 0; c < map.Count(); c++ )
@@ -906,7 +907,7 @@
 					testFile.Read( startPos + amountRead, buf1, KReadBufferSize );
 					localDrive.Read( map[c].iStartBlockAddress + myBlockMapEntry->iStartBlock * map[c].iBlockGranularity + (c2 == 1?map[c].iBlockStartOffset:0) + myCounter*KReadBufferSize, KReadBufferSize, buf2);
 					r = buf1.Compare( buf2 );
-					test( r == 0 );
+					test_Value(r, r == 0 );
 					buf1.Zero();
 					buf2.Zero();
 					myCounter++;
@@ -919,7 +920,7 @@
 					testFile.Read(startPos + amountRead, buf1, miniLength );
 					localDrive.Read( map[c].iStartBlockAddress + myBlockMapEntry->iStartBlock * map[c].iBlockGranularity + (c2 == 1?map[c].iBlockStartOffset:0) + myCounter*KReadBufferSize, miniLength, buf2);
 					r = buf1.Compare( buf2 );
-					test( r == 0 );
+					test_Value(r, r == 0 );
 					amountRead += miniLength;
 					length -= miniLength;
 					miniLength = 0;
@@ -934,9 +935,9 @@
 	if ( Finished )
 		{
 		r=fMan->Attribs(name, 0, KEntryAttReadOnly, 0);
-		test( r == KErrNone );
+		test_KErrNone(r);
 		r = fMan->Delete(name);
-		test( r == KErrNone );
+		test_KErrNone(r);
 		}
 	delete fMan;
 	return bmErr;	
@@ -957,7 +958,7 @@
 	name1.Append( KFragmentedFileName1 );
 	RFile file1;
 	r = file1.Create(TheFs, name1, EFileWrite);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	file1.Close();
 
 	TFileName name2(KDriveBase);
@@ -972,7 +973,7 @@
 	name2.Append( KFragmentedFileName2 );
 	RFile file2;
 	r = file2.Create(TheFs, name2, EFileWrite);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	file2.Close();
 	TInt64 randomSeed;
 	TBuf8<KMaxFragmentSize> tempBuf;	
@@ -999,31 +1000,31 @@
 			*buf++ = (TUint8)('A' + (Math::Rand(randomSeed) % ('Z' - 'A')));
 			}
 		r = file1.Open( TheFs, name1, EFileWrite );
-		test( r == KErrNone );
+		test_KErrNone(r);
 		r = file1.Seek( ESeekEnd, pos1 );
-		test( r == KErrNone );
+		test_KErrNone(r);
 		r = file1.Write( pos1, tempBuf );
-		test( r == KErrNone );
+		test_KErrNone(r);
 		r = file1.Flush();
-		test( r == KErrNone );		
+		test_KErrNone(r);		
 		file1.Close();
 		if ( mycount++ < 6 )
 			{
 			r = file2.Open( TheFs, name2, EFileWrite );
-			test( r == KErrNone );
+			test_KErrNone(r);
 			r = file2.Seek( ESeekEnd, pos2 );
-			test( r == KErrNone );
+			test_KErrNone(r);
 			r = file2.Write( pos2, tempBuf );
-			test( r == KErrNone );
+			test_KErrNone(r);
 			r = file2.Flush();
-			test( r == KErrNone );
+			test_KErrNone(r);
 			file2.Close();
 			}
 		} while ( fileSize < KMaxFileSize );
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	test(fMan!=NULL);
 	r = fMan->Delete(name2);
-	test( r == KErrNone );
+	test_KErrNone(r);
 	delete fMan;
 	}
 
@@ -1037,7 +1038,7 @@
 		TInt r = TheFs.Drive(info, i);
 		if ( r != KErrNone )
 			continue;
-		test( r == KErrNone );
+		test_KErrNone(r);
 		if ( aDriveType == EDriveNand )	
 			{
 			c++ == 0 ? test.Printf( _L("Searching for NAND drive.")) : test.Printf( _L("."));
@@ -1120,9 +1121,9 @@
 	TInt testFileSize = 0;
 	RFile testFile;
 	TInt r = testFile.Open(TheFs, KTestFile, EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = testFile.Size(testFileSize);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testFileSize>16384);
 	testFile.Close();
 
@@ -1130,7 +1131,7 @@
 		{
 		TInt value;
 		r = HAL::Get( HAL::EMachineUid, value );
-		test( r == KErrNone );
+		test_KErrNone(r);
 		if ( value != HAL::EMachineUid_Lubbock )	// Lubbock cannot run FindDrive as it doesn't support the NAND API
 			{
 			test.Next(_L("Test BlockMap retrieval on NAND FAT."));
@@ -1138,184 +1139,184 @@
 			if ( NandDrive > -1 )	// not finding a NAND drive isn't an error as only NAND builds have one
 				{
 				r = TestBlockMapNandFATUserData(0, -1);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFATUserData(1024, 4096);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFATUserData(1020, 4100);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFATUserData(1024, 4100);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFATUserData(1020, 4096);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFATUserData(1025, 1200);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFATUserData(0, testFileSize+100);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFATUserData(-5, -1);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFATUserData(-5, testFileSize+100);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFATUserData(0, 0);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFATUserData(testFileSize, -1);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFATUserData(0, -1);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFATUserData(2000, 2001);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFATUserData(0, 0);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFATUserData(2000, 2000);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFATUserData(2048, 2048);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				test.Printf(_L("Generating Fragmented File..."));
 				GenerateFragmentedFiles(EDriveNand);
 				test.Printf(_L("Done!\n"));
 				test.Next(_L("Test BlockMap retrieval on NAND FAT (User area) (fragmented)."));	
 				r = TestBlockMapFragmented(EDriveNand, 0, -1);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveNand, 1024, 4096);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveNand, 1020, 4100);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveNand, 1024, 4100);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveNand, 1020, 4096);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveNand, 1025, 1200);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveNand, 0, testFileSize+100);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapFragmented(EDriveNand, -5, -1);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapFragmented(EDriveNand, -5, testFileSize+100);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapFragmented(EDriveNand, 0, 0);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapFragmented(EDriveNand, testFileSize, -1);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapFragmented(EDriveNand, 0, -1);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveNand, 2000, 2001);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveNand, 0, 0);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapFragmented(EDriveNand, 2000, 2000);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				Finished = ETrue;
 				r = TestBlockMapFragmented(EDriveNand, 2048, 2048);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				test.Next(_L("Test BlockMap retrieval on NAND FAT."));	
 				r = TestBlockMapNandFAT(0, -1);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFAT(1024, 4096);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFAT(1020, 4100);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFAT(1024, 4100);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFAT(1020, 4096);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFAT(1025, 1200);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFAT(0, testFileSize+100);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFAT(-5, -1);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFAT(-5, testFileSize+100);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFAT(0, 0);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFAT(testFileSize, -1);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFAT(0, -1);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFAT(2000, 2001);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandFAT(0, 0);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFAT(2000, 2000);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandFAT(2048, 2048);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				test.Next(_L("Test BlockMap retrieval on NAND ROFS."));
 				r = TestBlockMapNandROFS(0, -1);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandROFS(1024, 4096);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandROFS(1020, 4100);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandROFS(1024, 4100);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandROFS(1020, 4096);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandROFS(1025, 1200);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandROFS(0, testFileSize+100);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandROFS(-5, -1);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandROFS(-5, testFileSize+100);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandROFS(0, 0);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandROFS(testFileSize, -1);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandROFS(0, -1);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandROFS(2000, 2001);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapNandROFS(0, 0);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandROFS(2000, 2000);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapNandROFS(2048, 2048);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				test.Next(_L("Test BlockMap retrieval on RAM FAT."));
 				FindDrive(EDriveRam);
 				test( RamFatDrive > -1 );
 				r = TestBlockMapRamFAT(0, -1);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapRamFAT(1024, 4096);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapRamFAT(1020, 4100);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapRamFAT(1024, 4100);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapRamFAT(1020, 4096);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapRamFAT(1025, 1200);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapRamFAT(0, testFileSize+100);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapRamFAT(-5, -1);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapRamFAT(-5, testFileSize+100);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapRamFAT(0, 0);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapRamFAT(testFileSize, -1);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapRamFAT(0, -1);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapRamFAT(2000, 2001);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapRamFAT(0, 0);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapRamFAT(2000, 2000);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapRamFAT(2048, 2048);
-				test( r == KErrArgument ); 
+				test_Value(r, r == KErrArgument ); 
 				test.Next(_L("Test BlockMap retrieval on Ram FAT (2)."));
 				r = TestBlockMapRamFAT2(0, -1);
-				test( r == KErrNotSupported );
+				test_Value(r, r == KErrNotSupported );
 				FindDrive(EDriveRemovable);
 				if ( RemovableFatDrive > -1)
 					{
 					test.Next(_L("Test BlockMap retrieval on removable FAT."));
 					r = TestBlockMapRemovableFAT(0, -1);
-					Pageable?test( r == KErrNotSupported ):test( r == KErrCompletion );
+					test_Value(r, r == Pageable ? KErrNotSupported : KErrCompletion);
 					}
 				else
 					{
@@ -1323,37 +1324,37 @@
 					FindDrive(EDriveInternalRemovable);
 					test( InternalRemovableFatDrive > -1);
 					r = TestBlockMapInternalRemovableFAT(0, -1);
-					test( r == KErrCompletion );
+					test_Value(r, r == KErrCompletion );
 					r = TestBlockMapInternalRemovableFAT(1024, 4096);
-					test( r == KErrCompletion );
+					test_Value(r, r == KErrCompletion );
 					r = TestBlockMapInternalRemovableFAT(1020, 4100);
-					test( r == KErrCompletion );
+					test_Value(r, r == KErrCompletion );
 					r = TestBlockMapInternalRemovableFAT(1024, 4100);
-					test( r == KErrCompletion );
+					test_Value(r, r == KErrCompletion );
 					r = TestBlockMapInternalRemovableFAT(1020, 4096);
-					test( r == KErrCompletion );
+					test_Value(r, r == KErrCompletion );
 					r = TestBlockMapInternalRemovableFAT(1025, 1200);
-					test( r == KErrCompletion );
+					test_Value(r, r == KErrCompletion );
 					r = TestBlockMapInternalRemovableFAT(0, testFileSize+100);
-					test( r == KErrArgument );
+					test_Value(r, r == KErrArgument );
 					r = TestBlockMapInternalRemovableFAT(-5, -1);
-					test( r == KErrArgument );
+					test_Value(r, r == KErrArgument );
 					r = TestBlockMapInternalRemovableFAT(-5, testFileSize+100);
-					test( r == KErrArgument );
+					test_Value(r, r == KErrArgument );
 					r = TestBlockMapInternalRemovableFAT(0, 0);
-					test( r == KErrArgument );
+					test_Value(r, r == KErrArgument );
 					r = TestBlockMapInternalRemovableFAT(testFileSize, -1);
-					test( r == KErrArgument );
+					test_Value(r, r == KErrArgument );
 					r = TestBlockMapInternalRemovableFAT(0, -1);
-					test( r == KErrCompletion );
+					test_Value(r, r == KErrCompletion );
 					r = TestBlockMapInternalRemovableFAT(2000, 2001);
-					test( r == KErrCompletion );
+					test_Value(r, r == KErrCompletion );
 					r = TestBlockMapInternalRemovableFAT(0, 0);
-					test( r == KErrArgument );
+					test_Value(r, r == KErrArgument );
 					r = TestBlockMapInternalRemovableFAT(2000, 2000);
-					test( r == KErrArgument );
+					test_Value(r, r == KErrArgument );
 					r = TestBlockMapInternalRemovableFAT(2048, 2048);
-					test( r == KErrArgument );
+					test_Value(r, r == KErrArgument );
 					}
 				test.Next(_L("Test BlockMap retrieval on Ram FAT (fragmented)."));	
 				test.Printf(_L("Generating Fragmented File..."));
@@ -1361,38 +1362,38 @@
 				test.Printf(_L("Done!\n"));
 				Finished = EFalse;
 				r = TestBlockMapFragmented(EDriveRam, 0, -1);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveRam, 1020, 4100);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveRam, 2049, 4096);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveRam, 1024, 4100);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveRam, 1020, 4096);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveRam, 1025, 1200);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveRam, 0, testFileSize+100);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapFragmented(EDriveRam, -5, -1);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapFragmented(EDriveRam, -5, testFileSize+100);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapFragmented(EDriveRam, 0, 0);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapFragmented(EDriveRam, testFileSize, -1);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapFragmented(EDriveRam, 0, -1);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveRam, 2000, 2001);
-				test( r == KErrCompletion );
+				test_Value(r, r == KErrCompletion );
 				r = TestBlockMapFragmented(EDriveRam, 0, 0);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				r = TestBlockMapFragmented(EDriveRam, 2000, 2000);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				Finished = ETrue;
 				r = TestBlockMapFragmented(EDriveRam, 2048, 2048);
-				test( r == KErrArgument );
+				test_Value(r, r == KErrArgument );
 				}
 			else
 				{
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_chkuid.cpp
--- a/kerneltest/f32test/server/t_chkuid.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_chkuid.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 //
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -37,67 +38,67 @@
     // Create \\gSessionPath\\UIDCHKNO.SHT - no uid, zero length
 	RFile file;
 	TInt r=file.Replace(TheFs,_L("UIDCHKNO.SHT"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
     // Create \\gSessionPath\\UIDCHKNO.LNG - no uid, long length
 	r=file.Replace(TheFs,_L("UIDCHKNO.LNG"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(_L8("Hello World needs to be over 16 bytes"));
 	file.Close();
 
     // Create \\gSessionPath\\UIDCHK.BLG - with uid no data
 	r=file.Replace(TheFs,_L("UIDCHK.BLG"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TUidType uidType(TUid::Uid('U'),TUid::Uid('I'),TUid::Uid('D'));
 	TCheckedUid checkedUid(uidType);
 	TPtrC8 buf((TUint8*)&checkedUid,sizeof(TCheckedUid));
 	r=file.Write(buf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
     // Create \\gSessionPath\\UIDCHK.MSG - with uid and data
 	r=file.Replace(TheFs,_L("UIDCHK.MSG"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TUidType uidType2(TUid::Uid('X'),TUid::Uid('Y'),TUid::Uid('Z'));
 	checkedUid.Set(uidType2);
 	buf.Set((TUint8*)&checkedUid,sizeof(TCheckedUid));
 	r=file.Write(buf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(_L8("More file data"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
     // Create \\gSessionPath\\UIDCHK.DAT - uid stored only in the file
 	r=file.Replace(TheFs,_L("UIDCHK.DAT"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TUidType uidType3(TUid::Uid('D'),TUid::Uid('A'),TUid::Uid('T'));
 	checkedUid.Set(uidType3);
 	buf.Set((TUint8*)&checkedUid,sizeof(TCheckedUid));
 	r=file.Write(buf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(_L8("More file data"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
     // Create \\gSessionPath\\UIDCHK.PE - uid stored in WINS PE file header
 	r=file.Replace(TheFs,_L("UIDWINS.PE"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 #if defined(__WINS__)
     if (!IsTestingLFFS())
         {
 	    RFile fileSource;
 	    r=fileSource.Open(TheFs,_L("Z:\\TEST\\T_CHKUID.EXE"),EFileShareReadersOnly|EFileRead);
-	    test(r==KErrNone);
+	    test_KErrNone(r);
 
 	    TBuf8<0x100> buffer;
 	    do
 		    {
 		    r=fileSource.Read(buffer);
-		    test(r==KErrNone);
+		    test_KErrNone(r);
 		    r=file.Write(buffer);
-		    test(r==KErrNone);
+		    test_KErrNone(r);
 		    }
 	    while (buffer.Length()==buffer.MaxLength());
 
@@ -106,11 +107,11 @@
     else
         {
 	    r=file.Write(_L8("Some zany stuff here!"));
-	    test(r==KErrNone);
+	    test_KErrNone(r);
         }
 #else
 	r=file.Write(_L8("Some zany stuff here!"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 #endif
 	file.Close();
 	}
@@ -125,7 +126,7 @@
 	CDir* dum=NULL;
 	TInt r=TheFs.GetDir(_L("UID*"),KEntryAttAllowUid,ESortByName,dum);
 	CDir& dir=*dum;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=dir.Count();
 	test(count==6);
 
@@ -180,7 +181,7 @@
 	CDir* dum=NULL;
 	TInt r=TheFs.GetDir(_L("UID*"),0,ESortByName,dum);
 	CDir& dir=*dum;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=dir.Count();
 	test(count==6);
 
@@ -219,35 +220,35 @@
 	test.Next(_L("Use RFs::EntryL() to check files"));
 	TEntry entry;
 	TInt r=TheFs.Entry(_L("UIDCHKNO.SHT"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("UIDCHKNO.SHT"));
 	test(entry.IsTypeValid()==EFalse);
 
 	r=TheFs.Entry(_L("UIDCHKNO.LNG"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("UIDCHKNO.LNG"));
 	test(entry.IsTypeValid()==EFalse);
 
 	r=TheFs.Entry(_L("UIDCHK.MSG"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("UIDCHK.MSG"));
 	test(entry.IsTypeValid());
 	test(entry.iType[0]==TUid::Uid('X') && entry.iType[1]==TUid::Uid('Y') && entry.iType[2]==TUid::Uid('Z'));
 
 	r=TheFs.Entry(_L("UIDCHK.BLG"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("UIDCHK.BLG"));
 	test(entry.IsTypeValid());
 	test(entry.iType[0]==TUid::Uid('U') && entry.iType[1]==TUid::Uid('I') && entry.iType[2]==TUid::Uid('D'));
 
 	r=TheFs.Entry(_L("UIDCHK.DAT"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("UIDCHK.DAT"));
 	test(entry.IsTypeValid());
 	test(entry.iType[0]==TUid::Uid('D') && entry.iType[1]==TUid::Uid('A') && entry.iType[2]==TUid::Uid('T'));
 
 	r=TheFs.Entry(_L("UIDWINS.PE"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("UIDWINS.PE"));
 #if defined(__WINS__)
 	TFileName sessionPath;
@@ -278,34 +279,34 @@
 	RFile f;
 	TEntry entry;
 	TInt r=f.Open(TheFs,_L("UIDCHK.DAT"),EFileShareExclusive|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("UIDCHK.DAT"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("UIDCHK.DAT"));
 	test(entry.IsTypeValid());
 	test(entry.iType[0]==TUid::Uid('D') && entry.iType[1]==TUid::Uid('A') && entry.iType[2]==TUid::Uid('T'));
 	f.Close();
 
 	r=f.Open(TheFs,_L("UIDCHK.DAT"),EFileShareExclusive|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("UIDCHK.DAT"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("UIDCHK.DAT"));
 	test(entry.IsTypeValid());
 	test(entry.iType[0]==TUid::Uid('D') && entry.iType[1]==TUid::Uid('A') && entry.iType[2]==TUid::Uid('T'));
 
 	r=f.SetSize(256);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<16> des;
 	r=TheFs.ReadFileSection(_L("UIDCHK.DAT"),0,des,16);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	f.Close();
 
 	r=f.Open(TheFs,_L("UIDCHK.DAT"),EFileShareReadersOnly|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("UIDCHK.DAT"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("UIDCHK.DAT"));
 	test(entry.IsTypeValid());
 	test(entry.iType[0]==TUid::Uid('D') && entry.iType[1]==TUid::Uid('A') && entry.iType[2]==TUid::Uid('T'));
@@ -314,27 +315,27 @@
 //	EFileShareReadersOnly|EFileWrite is illegal
 
 	r=f.Open(TheFs,_L("UIDCHK.DAT"),EFileShareAny|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("UIDCHK.DAT"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("UIDCHK.DAT"));
 	test(entry.IsTypeValid());
 	test(entry.iType[0]==TUid::Uid('D') && entry.iType[1]==TUid::Uid('A') && entry.iType[2]==TUid::Uid('T'));
 	f.Close();
 
 	r=f.Open(TheFs,_L("UIDCHK.DAT"),EFileShareAny|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile secondFile;
 	r=secondFile.Open(TheFs,_L("UIDCHK.DAT"),EFileShareAny|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile thirdFile;
 	r=thirdFile.Open(TheFs,_L("UIDCHK.DAT"),EFileShareAny|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Entry(_L("UIDCHK.DAT"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("UIDCHK.DAT"));
 	test(entry.IsTypeValid());
 	test(entry.iType[0]==TUid::Uid('D') && entry.iType[1]==TUid::Uid('A') && entry.iType[2]==TUid::Uid('T'));
@@ -343,10 +344,10 @@
 	thirdFile.Close();
 
 	r=f.Open(TheFs,_L("UIDWINS.PE"),EFileShareAny|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Entry(_L("UIDWINS.PE"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("UIDWINS.PE"));
 #if defined(__WINS__)
 	TFileName sessionPath;
@@ -379,7 +380,7 @@
 		test.Printf(_L("Error: Unable to open Z:\n"));
 		return;
 		}
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CDir& dir=*dum;
 	TInt count=dir.Count();
 	if (count==0)
@@ -413,7 +414,7 @@
 	TFileName sessionPath;
 
 	TInt r=TheFs.SessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TChar driveLetter=sessionPath[0];
 	b.Format(_L("Testing filesystem on %c:"),(TText)driveLetter);
 	test.Next(b);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_corruptlog.cpp
--- a/kerneltest/f32test/server/t_corruptlog.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_corruptlog.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -24,6 +24,7 @@
 //! @SYMCreationDate 1/11/04
 //! @SYMTestCaseDesc Check trap action of CorruptFileNames.lst
 
+#define __E32TEST_EXTENSION__
 #include <e32test.h>
 RTest test(_L("t_corruptlog"));
 
@@ -106,7 +107,7 @@
 	// Note that C: is used in the IoControl call, which requires a valid drive, but has no other relevance
 	TInt numberOfRecords;
 	TInt r=controlIo(TheFs, EDriveC, KControlIoGetNumberOfCorruptLogRecords, numberOfRecords);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return numberOfRecords;
 	}
 
@@ -115,7 +116,7 @@
 	// fetchs a trap record
 	// Note that C: is used in the IoControl call, which requires a valid drive, but has no other relevance
 	TInt r=controlIo(TheFs, EDriveC, KControlIoGetCorruptLogRecord, alogRec, aRecordNumber);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return r;
 	}
 
@@ -125,7 +126,7 @@
 	// the corrupt files list.
 	// Note that C: is used in the IoControl call, which requires a valid drive, but has no other relevance
 	TInt r=controlIo(TheFs, EDriveC, KControlIoGetCorruptListFile, aFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return r;
 	}
 
@@ -136,22 +137,22 @@
 	const TInt attribs=EFileShareExclusive|EFileStreamText|EFileRead;
 	// File1 
 	TInt r=f.Open(TheFs,KTestFile1,attribs);
-	test(r==KTestFile1Error1);
+	test_Value(r, r == KTestFile1Error1);
 	f.Close();
 	numberOfTraps+=(r==KErrNone?0:1);
 	// try again
 	r=f.Open(TheFs,KTestFile1,attribs);
-	test(r==KTestFile1Error2);
+	test_Value(r, r == KTestFile1Error2);
 	f.Close();
 	numberOfTraps+=(r==KErrNone?0:1);
 	// File2 
 	r=f.Open(TheFs,KTestFile2,attribs);
-	test(r==KTestFile2Error1);
+	test_Value(r, r == KTestFile2Error1);
 	f.Close();
 	numberOfTraps+=(r==KErrNone?0:1);
 	// try again
 	r=f.Open(TheFs,KTestFile2,attribs);
-	test(r==KTestFile2Error2);
+	test_Value(r, r == KTestFile2Error2);
 	f.Close();
 	numberOfTraps+=(r==KErrNone?0:1);
 	}
@@ -161,7 +162,7 @@
 	TFileName corruptFileNamesList;
     test.Next(_L("Get name of file with list of nominated files"));
 	TInt r=GetCorruptFileListFile(corruptFileNamesList);
-    test(r==KErrNone);
+    test_KErrNone(r);
  	test.Printf(_L("Using %S\n"),&corruptFileNamesList);
 
 	AccessFiles();
@@ -174,9 +175,9 @@
 	for (TInt i=1;i<=nRecs;i++)
 		{ // fetch record #i
 		TInt r=GetTrapLogRecord(logRec,i);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=logRec().iProcessName.CompareF(_L("t_corruptlog.exe"));
-		test(r==KErrNone);
+		test_KErrNone(r);
 		PrintLogRecord(logRec,i);
 		}
 	}
@@ -194,7 +195,7 @@
     test.Start(_L("Corrupt File trap log"));
 #if defined(_DEBUG) || defined(_DEBUG_RELEASE)
 	TInt r=TheFs.Connect();
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     TheFs.ResourceCountMarkStart();
     
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_cp_plugintest.cpp
--- a/kerneltest/f32test/server/t_cp_plugintest.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_cp_plugintest.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -45,7 +45,7 @@
 void ReadBootSector(TFatBootSector& aBootSector)
 	{
     TInt nRes = ReadBootSector(TheFs, CurrentDrive(), KBootSectorNum<<KDefaultSectorLog2, aBootSector);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     if(!aBootSector.IsValid())
         {
@@ -73,32 +73,32 @@
 
 	// Create new directory and check creation
 	TInt r = TheFs.MkDir(longDirNamePath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TUint dumUint=0;
 	CDir* dumDir;
 	r= TheFs.GetDir(longDirNamePath, dumUint, dumUint, dumDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test_NotNull(dumDir);
 	delete dumDir;
 
 	// Check short name
 	r = TheFs.GetShortName(longDirNamePath, shortName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = shortName.Compare(aShortName);
-	test(r==0);
+	test_Value(r, r == 0);
 	
 	// Check long name
 	shortDirNamePath = gSessionPath;
 	shortDirNamePath += shortName;
 	shortDirNamePath.Append('\\');
 	r = TheFs.GetLongName(shortDirNamePath, longName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = longName.Compare(aLongName);
-	test(r==0);
+	test_Value(r, r == 0);
 
 	r = TheFs.RmDir(longDirNamePath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 void doFileNameTest(const TDesC& aLongName, const TDesC& aShortName)
@@ -109,28 +109,28 @@
 	TFileName shn;
 
 	TInt r = TheFs.SessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	lgnFullPath = gSessionPath;
 	lgnFullPath += aLongName;
 	
 	MakeFile_CPTest(lgnFullPath);
 	// Check short name	
 	r = TheFs.GetShortName(lgnFullPath, shn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = shn.Compare(aShortName);
-	test(r==0);
+	test_Value(r, r == 0);
 
 	// Check long name	
 	shnFullPath = gSessionPath;
 	shnFullPath += aShortName;
 
 	r = TheFs.GetLongName(shnFullPath, lgn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = lgn.Compare(aLongName);
-	test(r==0);
+	test_Value(r, r == 0);
 
 	r = TheFs.Delete(lgnFullPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 #endif //_DEBUG || _DEBUG_RELEASE
@@ -160,10 +160,10 @@
 #if defined(_DEBUG) || defined(_DEBUG_RELEASE)
 
 	TInt r = TheFs.SessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt driveNum;
 	r = TheFs.CharToDrive(gSessionPath[0], driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Retrieves the original volume label
 	TVolumeInfo vInfo;
@@ -175,24 +175,24 @@
 	_LIT(KUnicodeVolumeLabel, 		"\x65B0\x65B0\x65B0");
 
 	r = TheFs.SetVolumeLabel(KUnicodeVolumeLabel, driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = TheFs.Volume(vInfo, driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = vInfo.iName.Compare(KUnicodeVolumeLabel);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Tests setting volume label with unicode characters that bigger than 11 bytes
 	_LIT(KVolumeLabelOverflow,		"\x65B0\x65B0\x65B0\x65B0\x65B0\x65B0");
 	r = TheFs.SetVolumeLabel(KVolumeLabelOverflow, driveNum);
-	test(r==KErrOverflow);
+	test_Value(r, r == KErrOverflow);
 
 	// Sets back the original volume label
 	r = TheFs.SetVolumeLabel(originalVolumeLabel, driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = TheFs.Volume(vInfo, driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = vInfo.iName.Compare(originalVolumeLabel);
-	test(r==0);
+	test_Value(r, r == 0);
 #else
 	test.Printf(_L("Test only runs on DEBUG builds, see test logs of debug builds for details."));
 #endif  // _DEBUG) || _DEBUG_RELEASE
@@ -432,25 +432,25 @@
 	MakeFile_CPTest(KTestFileName4C8B);
 	MakeFile_CPTest(KTestFileName7C11B);
 	r = TheFs.GetShortName(KTestFileName7C11B, sn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = sn.Compare(KTestFileName7C11B_short);
-	test(r==0);
+	test_Value(r, r == 0);
 
 
 	MakeFile_CPTest(KTestFileName8C12B);
 	r = TheFs.GetShortName(KTestFileName8C12B, sn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = sn.Compare(KTestFileName8C12B_short);
-	test(r==0);
+	test_Value(r, r == 0);
 
 	r = TheFs.Delete(KTestFileName4C8B);
-	test(r==KErrNone);
+	test_KErrNone(r);
 		
 	r = TheFs.Delete(KTestFileName7C11B);
-	test(r==KErrNone);
+	test_KErrNone(r);
 		
 	r = TheFs.Delete(KTestFileName8C12B);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 #else
 	test.Printf(_L("Test only runs on DEBUG builds, see test logs of debug builds for details."));
@@ -509,15 +509,15 @@
 	TFileName sn;
 	
 	r = TheFs.GetShortName(KTestDirName7C11B, sn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = sn.Compare(KTestDirName7C11B_short);
-	test(r==0);
+	test_Value(r, r == 0);
 
 	MakeDir(KTestDirName8C12B);
 	r = TheFs.GetShortName(KTestDirName8C12B, sn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = sn.Compare(KTestDirName8C12B_short);
-	test(r==0);
+	test_Value(r, r == 0);
 
 #else
 	test.Printf(_L("Test only runs on DEBUG builds, see test logs of debug builds for details."));
@@ -552,9 +552,9 @@
 	MakeFile_CPTest(KTestFilePathAndName);
 	TFileName sn;
 	r = TheFs.GetShortName(KTestFilePathAndName, sn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = sn.Compare(KTestFileShortName);
-	test(r==0);
+	test_Value(r, r == 0);
 
 #else
 	test.Printf(_L("Test only runs on DEBUG builds, see test logs of debug builds for details."));
@@ -587,14 +587,14 @@
 	
 	TFileName sn;
 	r = TheFs.GetShortName(KTestFilePathAndName, sn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = sn.Compare(KTestFileName);
-	test(r==0);
+	test_Value(r, r == 0);
 	TFileName ln;
 	r = TheFs.GetLongName(KTestFilePathAndName, ln);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = ln.Compare(KTestFileName);
-	test(r==0);
+	test_Value(r, r == 0);
 
 #else
 	test.Printf(_L("Test only runs on DEBUG builds, see test logs of debug builds for details."));
@@ -624,12 +624,12 @@
 	TFileName fn = _L("\\ABCD");
 	
 	TInt r=file.Create(TheFs,fn,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	//	Assume this file is the first entry in the root directory
 	r=TheDisk.Open(TheFs,CurrentDrive());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
     //-- read the 1st dir entry, it should be a DOS entry 
     const TInt posEntry1=gBootSector.RootDirStartSector() << KDefaultSectorLog2; //-- dir entry1 position
@@ -665,9 +665,9 @@
 	
 	TEntry entry;
 	TInt err = TheFs.Entry(fn, entry);
-	test(err==KErrNone);
+	test_KErrNone(err);
 	err = TheFs.Delete(fn);
-	test(err==KErrNone);
+	test_KErrNone(err);
 #else
 	test.Printf(_L("Test only runs on DEBUG builds, see test logs of debug builds for details."));
 #endif  // _DEBUG) || _DEBUG_RELEASE
@@ -697,13 +697,13 @@
 	
 	test.Next(_L("create file \"AB\" under root directory"));
 	TInt r=file.Create(TheFs,fn,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	test.Next(_L("manually change file name to \"0x7F0x450x7F0x45\" via raw disk accessing"));
 	//	Assume this file is the first entry in the root directory
 	r=TheDisk.Open(TheFs,CurrentDrive());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
     //-- read the first dir entry, it should be a DOS entry 
     const TInt posEntry1=gBootSector.RootDirStartSector() << KDefaultSectorLog2; //-- dir entry1 position
@@ -783,15 +783,15 @@
 	_LIT(KShortName, "\x3055\x307E\x3056~1");
 	TFileName sn;
 	r = TheFs.GetShortName(fn, sn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = sn.Compare(KShortName);
-	test(r==0);
+	test_Value(r, r == 0);
 	
 	r = TheFs.ScanDrive(_L("gSessionPath"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r = TheFs.Delete(fn);
-	test(r == KErrNone);
+	test_KErrNone(r);
 #else
 	test.Printf(_L("Test only runs on DEBUG builds, see test logs of debug builds for details."));
 #endif  // _DEBUG) || _DEBUG_RELEASE
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_dcallcaps.cpp
--- a/kerneltest/f32test/server/t_dcallcaps.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_dcallcaps.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -13,6 +13,7 @@
 // Description:
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32std.h>
@@ -105,22 +106,22 @@
 	mkdirname.Append(systestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(systestname,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(_L(""),EDriveO); //to unsubst
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat1,systestname);
 	test(aStat1==KRequestPending);
@@ -135,29 +136,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(systestfile, shortfilename);
-	test(r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(systestfile1, longfilename);
-	test(r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,systestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(systestfile,systestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(systestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(systestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(systestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void ResourceRFsTest()
@@ -172,22 +173,22 @@
 	mkdirname.Append(restestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(restestname,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(_L(""),EDriveO); 
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat4,restestname);
 	test(aStat4==KRequestPending);
@@ -202,29 +203,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(restestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(restestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,restestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(restestfile,restestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(restestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(restestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(restestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -243,22 +244,22 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(pritestfalseidname,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(_L(""),EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestfalseidname);
 	test(aStat2==KRequestPending);
@@ -274,29 +275,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -316,22 +317,22 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(pritestname,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(_L(""),EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestname);
 	test(aStat2==KRequestPending);
@@ -347,29 +348,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -383,22 +384,22 @@
 	mkdirname.Append(theprivatepath);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(theprivatepath,EDriveO);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(_L(""),EDriveO);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(theprivatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat3,theprivatepath);
 	test(aStat3==KRequestPending);
@@ -413,29 +414,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -446,29 +447,29 @@
 	{
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,systestname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFileSys,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileSys,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileSys,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,KFileSys,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFileSys3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
     TFindFile finder(TheFs);
@@ -476,7 +477,7 @@
     r=finder.FindWildByDir(KWildFile, KWildPath, dir);
 	if (!(r==KErrNone))
         test.Printf(_L("T_DCALLCAPS: test find wildcards r = %d (expected KErrNone)\n"), r);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	delete dir;
 	}
 
@@ -486,40 +487,40 @@
 //
 	{
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,restestname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFileRes,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileWrite|EFileShareExclusive );
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFileRes3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes3,EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes3,EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes3,EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.ChangeMode(EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Replace(TheFs,KFileRes,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();	
 	}
 
@@ -530,29 +531,29 @@
 //
 	{
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,pritestfalseidname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	}
 
@@ -562,29 +563,29 @@
 //
 	{
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,pritestname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	}
 
@@ -596,29 +597,29 @@
 //
 	{
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Temp(TheFs,theprivatepath,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	}
 
@@ -633,30 +634,30 @@
 	TBuf<30> dirNameBuf(KSystemPath);
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Private//falseID
 	dirNameBuf=KPrivateFalseID;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Private
 	dirNameBuf=KPrivatePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Private/uid
@@ -664,19 +665,19 @@
 	dirNameBuf.Insert(0,_L("?:"));
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Resource
 	dirNameBuf=KResourcePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	delete dirEntries;
 	}
@@ -688,20 +689,20 @@
 //
 	{
 	r=TheFs.FileSystemName(fsname,gTheDriveNum);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	r=DismountFileSystem(TheFs, fsname,gTheDriveNum);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 //	r=TheFs.RemoveFileSystem(fsname);	//can not test due to bug else where fix exists
-//	test(r==KErrNone);
+//	test_KErrNone(r);
 //	r=TheFs.AddFileSystem(fsname);
-//	test(r==KErrNone);
+//	test_KErrNone(r);
 	r=MountFileSystem(TheFs,fsname,gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetDriveName(gTheDriveNum,KDriveName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #ifndef __WINS__
  	r=TheFs.SetVolumeLabel(KVolLable, gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #endif
 
 	systemRFsTest();
@@ -727,11 +728,11 @@
 	test(aStat4==KErrNone);
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 //Test RRawDisk class
 	r=rawdisk.Open(TheFs,gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	rawdisk.Close();
 
 	RDirtest();
@@ -742,21 +743,21 @@
 		{
 		//Test RFormat class
 		r=format.Open(TheFs,driveBuf,EHighDensity,count);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		while(count)	
 			{
 			TInt r=format.Next(count);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			}
 		format.Close();
 		}
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.ScanDrive(driveBuf);
-	test(r==KErrNone || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotSupported);
 	r=TheFs.CheckDisk(driveBuf);
-	test(r==KErrNone || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotSupported);
 	}
 
 LOCAL_C void TestCaps()
@@ -777,16 +778,16 @@
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.SessionPath(temp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("Session path: %S"),&temp);
 
 	r=TheFs.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone || r== KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r== KErrAlreadyExists);
 
 	TBuf<18> tempPri;
 	r=TheFs.PrivatePath(tempPri);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	theprivatepath = _L("?:");
 	theprivatepath.Append(tempPri);
 
@@ -795,9 +796,9 @@
 	TFileName thesessionpath;
 
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(thesessionpath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	test(thesessionpath == theprivatepath);
 	}
@@ -810,7 +811,7 @@
 	test.Next(_L("Delete test directory"));
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	TInt r=fMan->RmDir(gSessionPath);
-	test(r==KErrNone || KErrPathNotFound);
+	test_Value(r, r == KErrNone || r == KErrPathNotFound);
 	delete fMan;
 	}
 
@@ -827,7 +828,7 @@
 	sesspath[0] = (TText)gDriveToTest;
 
 	TInt r= TheFs.SetSessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	//cleanup from previous run of this test
 	TBuf<20> delDir;
@@ -835,15 +836,15 @@
 	delDir=KResourcePath;
 	delDir[0]=(TText)gDriveToTest;
 	r=fMan->RmDir(delDir);
-	test(r==KErrNone || KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 	delDir=KSystemPath;
 	delDir[0]=(TText)gDriveToTest;
 	r=fMan->RmDir(delDir);
-	test(r==KErrNone || KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 	delDir=KPrivatePath;
 	delDir[0]=(TText)gDriveToTest;
 	r=fMan->RmDir(delDir);
-	test(r==KErrNone || KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 	delete fMan;
 
 	//check double mode ie that Defpath still works	
@@ -851,30 +852,30 @@
 	RFs fs2;
 	
 	r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session1 Path=%S"),&sesspath);
 
 	TBuf<30> privatepath;
 	r=fs1.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.PrivatePath(privatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(KExpectedPrivatePath());
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(sesspath.Mid(KPathPosition));
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs1.Close();
 
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session2 Path=%S"),&sesspath);
 	fs2.Close();
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_dcallfiles.cpp
--- a/kerneltest/f32test/server/t_dcallfiles.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_dcallfiles.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -13,6 +13,7 @@
 // Description:
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32std.h>
@@ -113,13 +114,13 @@
 //
     {
     TInt r = TheFs.Rename(_L("\\sys"), _L("\\sysbad"));
-    test(r == KErrPermissionDenied);
+    test_Value(r, r == KErrPermissionDenied);
     r = TheFs.Rename(_L("\\resource"), _L("\\resourcebad"));
-    test(r == KErrPermissionDenied);
+    test_Value(r, r == KErrPermissionDenied);
     r = TheFs.Rename(_L("\\private"), _L("\\privatebad"));
-    test(r == KErrNone);
+    test_KErrNone(r);
     r = TheFs.Rename(_L("\\privatebad"), _L("\\private"));
-    test(r == KErrNone);
+    test_KErrNone(r);
     }
 
 LOCAL_C void systemRFstest()
@@ -135,16 +136,16 @@
 	mkdirname.Append(systestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(systestname,EDriveO);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat1,systestname);
 	test(aStat1==KRequestPending);		
@@ -159,29 +160,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(systestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(systestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,systestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(systestfile,systestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(systestfile1,entry);
-	test(r==KErrNone || r==KErrNotFound);	
+	test_Value(r, r == KErrNone || r==KErrNotFound);	
 
 	r=TheFs.SetEntry(systestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(systestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	}
 
@@ -199,20 +200,20 @@
 	mkdirname.Append(restestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 
 	r=TheFs.SetSubst(restestname,EDriveO);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat4,restestname);
 	test(aStat4==KRequestPending);
@@ -228,29 +229,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(restestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(restestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,restestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(restestfile,restestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(restestfile1,entry);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	r=TheFs.SetEntry(restestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(restestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	}
 
@@ -269,19 +270,19 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone );
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone );
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(pritestfalseidname,EDriveO);
-	test(r==KErrPermissionDenied); 
+	test_Value(r, r == KErrPermissionDenied); 
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestfalseidname);
 	test(aStat2==KRequestPending);
@@ -296,29 +297,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -337,19 +338,19 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone );
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone );
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(pritestname,EDriveO);
-	test(r==KErrPermissionDenied); 
+	test_Value(r, r == KErrPermissionDenied); 
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestname);
 	test(aStat2==KRequestPending);
@@ -364,29 +365,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -405,19 +406,19 @@
 	mkdirname.Append(theprivatepath);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(theprivatepath,EDriveO);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(theprivatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat3,theprivatepath);
 	test(aStat3==KRequestPending);
@@ -432,29 +433,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -467,10 +468,10 @@
 
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,systestname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 
 	TBuf<25> sysfilename;
@@ -478,36 +479,36 @@
 	sysfilename.Append(KFileSys);
 
 	r=file1.Create(TheFs,sysfilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Open(TheFs,sysfilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	// DEF113117
 	r=file1.Open(TheFs, KSysBinFile, EFileShareReadersOnly | EFileRead | EFileReadBuffered);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs, KSysBinFile, EFileStreamText | EFileReadBuffered | EFileReadAheadOn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs, KSysBinFile, EFileStreamText | EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,sysfilename,EFileRead);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	r=file1.Replace(TheFs,sysfilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
     TFindFile finder(TheFs);
     CDir* dir = NULL;
     r=finder.FindWildByDir(KWildFile, KWildPath, dir);
 	if (!(r==KErrNone))
         test.Printf(_L("T_DCALLFILES: test find wildcards r = %d (expected KErrNone)\n"), r);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	delete dir;
 	}
 
@@ -519,45 +520,45 @@
 	{
 
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,restestname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFileRes,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileShareReadersOnly);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	r=file1.ChangeMode(EFileShareExclusive);	//this is not illegal though will prevent shared access to resource which is nit my fault but may be desirable to prevent
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	//this operation is prevented as you can not open a file for write access in the resource directory
 	r=file1.Rename(KFileRes3);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Replace(TheFs,KFileRes,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();	
 
 	}
@@ -570,29 +571,29 @@
 	{
 
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,pritestfalseidname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 		
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone || r== KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r== KErrAlreadyExists);
 	file1.Close();
 	}
 
@@ -605,29 +606,29 @@
 	{
 
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,pritestname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone || r== KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r== KErrAlreadyExists);
 	file1.Close();
 	}
 
@@ -640,29 +641,29 @@
 //Rfile Testing with session path set to //Private//UID//
 
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 		
 	r=file1.Temp(TheFs,theprivatepath,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 		
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	}
@@ -678,11 +679,11 @@
 	dirNameBuf = KSystemPath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	dir.Close();
 
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	delete dirEntries;
 
 	dirNameBuf.Zero();
@@ -690,20 +691,20 @@
 	dirNameBuf=KPrivateFalseID;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Private
 	dirNameBuf=KPrivatePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Private/uid
@@ -711,20 +712,20 @@
 	dirNameBuf.Insert(0,_L("?:"));
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Resource
 	dirNameBuf=KResourcePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	delete dirEntries;
 	dir.Close();
 	}
@@ -739,19 +740,19 @@
 //
 	{
 	r=TheFs.FileSystemName(fsname,gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.DismountFileSystem(fsname,gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 //	r=TheFs.RemoveFileSystem(fsname);	//can not test due to bug else where fix exists
-//	test(r==KErrPermissionDenied);
+//	test_Value(r, r == KErrPermissionDenied);
 //	r=TheFs.AddFileSystem(fsname);
-//	test(r==KErrPermissionDenied);
+//	test_Value(r, r == KErrPermissionDenied);
 	r=TheFs.MountFileSystem(fsname,gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r=TheFs.SetDriveName(gTheDriveNum,KDriveName);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 //	r=TheFs.SetVolumeLabel(KVolLable, gTheDriveNum);
-//	test(r==KErrNone);
+//	test_KErrNone(r);
 
 	systemRFstest();
 	resourceRFstest();
@@ -781,22 +782,22 @@
 	
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 //Test RRawDisk class
 	r=rawdisk.Open(TheFs,gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=format.Open(TheFs,driveBuf,EHighDensity,count);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	RDirtest();
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.ScanDrive(driveBuf);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r=TheFs.CheckDisk(driveBuf);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	}
 
 LOCAL_C void TestCaps()
@@ -812,16 +813,16 @@
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.SessionPath(temp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("Session path: %S"),&temp);
 
 	r=TheFs.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone || r== KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r== KErrAlreadyExists);
 
 	TBuf<18> tempPri;
 	r=TheFs.PrivatePath(tempPri);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	theprivatepath = _L("?:");
 	theprivatepath.Append(tempPri);
 
@@ -829,9 +830,9 @@
 
 	TFileName thesessionpath;
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(thesessionpath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(thesessionpath == theprivatepath);
 	}
 
@@ -841,16 +842,16 @@
 	{
 	CDirScan* scanner = NULL;
 	TRAP(r, scanner = CDirScan::NewL(TheFs));
-	test(r == KErrNone && scanner);
+	test_Value(r, r == KErrNone && scanner);
 
 	TRAP(r, scanner->SetScanDataL(aName,KEntryAttDir,ESortByName|EAscending,aDirection));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	CDir *entryList=NULL;
 	for (;;)
 		{
 		TRAP(r, scanner->NextL(entryList));
-		test(r == aError);
+		test_Value(r, r == aError);
 		if (entryList==NULL)
 			break;
 		TInt count=entryList->Count();
@@ -888,11 +889,11 @@
 		test.Printf(_L("Private Path is=%S"),&privatepath);
 		
 		r = TheFs.MkDir(_L("\\Caged\\"));
-		test(r==KErrNone || r==KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 		
 		CDir* entryCount=NULL;
 		r=TheFs.GetDir(_L("\\*.*"),KEntryAttNormal,ESortNone,entryCount);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TInt rootCount= entryCount->Count();
 		
 		delete entryCount;
@@ -902,12 +903,12 @@
 		//Testing Copy
 		CDir* entryCount2=NULL;
 		r=fMan->Copy(_L("\\sys\\"),_L("\\Caged\\"));
-		test(r == KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		r=fMan->Copy(_L("\\*"),_L("\\Caged\\"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		
 		r=TheFs.GetDir(_L("\\Caged\\*.*"),KEntryAttNormal,ESortNone,entryCount2);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TInt cagedCount= entryCount2->Count();
 		
 		test(cagedCount==rootCount);
@@ -917,12 +918,12 @@
 
 	
 		r=fMan->Copy(_L("\\private\\two\\moo"),_L("\\private\\two\\mew")); 
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 	
 		// Create a test file
 		RFile testFile;
 		r = testFile.Replace(TheFs, _L("\\capTest"),EFileWrite);
-		test(r==KErrNone || r==KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 		testFile.Close();
 		
 		TFileName name;
@@ -930,90 +931,90 @@
 		name.Append(_L("privateFile.tst"));
 		RFile privateFile;
 		r = privateFile.Replace(TheFs, name,EFileWrite);
-		test(r==KErrNone || r==KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 		privateFile.Close();
 
 	
 		r=fMan->Copy(_L("\\capTest"),_L("\\private\\to\\moo")); 
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Copy(_L("\\capTest"),_L("\\sys\\bin\\moo")); 
-		test(r == KErrPermissionDenied); 
+		test_Value(r, r == KErrPermissionDenied); 
 		r=fMan->Copy(_L("\\sys\\bin\\capTest"),_L("\\sys\\bin\\moo"));
-		test(r == KErrPathNotFound); 
+		test_Value(r, r == KErrPathNotFound); 
 		r=fMan->Copy(_L("\\sys\\*"),_L("\\"));
-		test (r==KErrNone || r==KErrNotFound);
+		test_Value(r, r == KErrNone || r==KErrNotFound);
 		r=fMan->Copy(name,_L("\\sys\\"));
-		test(r==KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		
 		// Testing Move
 		r=fMan->Move(_L("\\capTest"),_L("\\private\\wst\\moo"), CFileMan::ERecurse); // Recurse flag needed as destination path does not exist.
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Move(_L("\\sys\\bin\\capTest"),_L("\\sys\\bin\\moo"));
-		test(r == KErrPathNotFound); 
+		test_Value(r, r == KErrPathNotFound); 
 		r=fMan->Move(_L("\\sys\\*"),_L("\\"));
-		test (r==KErrNone || r==KErrNotFound);
+		test_Value(r, r == KErrNone || r==KErrNotFound);
 		r=fMan->Move(name,_L("\\sys\\"));
-		test(r==KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(_L("\\private\\two\\moo"),_L("\\private\\one\\moo"));
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Move(_L("\\private\\two\\moo.."),_L("\\private\\one\\moo"));
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Move(_L("\\private\\two\\moo"),_L("\\private\\one\\moo.."));
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Move(name,_L("\\privateFile.tst"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Move(_L("\\privateFile.tst"),name);
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 		
 		// Testing Attribs
 		r=fMan->Attribs(_L("\\private\\two\\moo"),KEntryAttReadOnly,0,TTime(0)); 
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Attribs(_L("\\private\\moo"),KEntryAttReadOnly,0,TTime(0)); 
-		test(r == KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		r=fMan->Attribs(name,KEntryAttReadOnly,0,TTime(0));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Attribs(name,0,KEntryAttReadOnly,TTime(0));
-		test(r == KErrNone);		
+		test_KErrNone(r);		
 
 		// Testing RmDir
 		r=fMan->RmDir(_L("\\private\\"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		// put it back where it was
 		r = TheFs.MkDirAll(_L("\\private\\00000001\\"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->RmDir(_L("\\private\\two\\"));
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->RmDir(_L("\\private\\tw?\\"));
-		test(r == KErrBadName);
+		test_Value(r, r == KErrBadName);
 		r=fMan->RmDir(_L("\\sys\\"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		
 		// Testing Rename
 		r=fMan->Rename(_L("\\private\\two\\moo"),_L("\\private\\two\\mew")); 
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		
 		// Testing Delete
 		r=fMan->Delete(_L("\\private\\two\\test")); 
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Delete(_L("\\private\\moo")); 
-		test(r == KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		
 		//Something that actually exists in Private
 		r=fMan->Rename(name,_L("\\private\\00000001\\moo")); 
-		test(r == KErrNotFound); //deleted the file previously
+		test_Value(r, r == KErrNotFound); //deleted the file previously
 		r=fMan->Rename(_L("\\private\\00000001\\moo"),name); 
-		test(r == KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		r=fMan->Copy(name,_L("\\private\\00000001\\moo")); 
-		test(r == KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		r=fMan->Delete(_L("\\private\\00000001\\moo")); 
-		test(r == KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 
 		// Clean up the test data
 		r=fMan->RmDir(_L("\\Caged\\")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Delete(_L("\\capTest")); 
-		test(r == KErrNone || KErrNotFound);
+		test_Value(r, r == KErrNone || r == KErrNotFound);
 		delete(fMan);
 		}
 	
@@ -1034,7 +1035,7 @@
 	test.Next(_L("Delete test directory"));
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	TInt r=fMan->RmDir(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	delete fMan;
 	}
 
@@ -1058,14 +1059,14 @@
 	sesspath[0] = (TText)gDriveToTest;
 
 	TInt r= TheFs.SetSessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TBuf<2> cmd;
 	cmd.SetLength(1);
 	cmd[0] = (TText)gDriveToTest;
 	RProcess tp;
 	r=tp.Create(_L("clean_prepdc.exe"),sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	{
 	TRequestStatus ps;
 	tp.Logon(ps);
@@ -1079,30 +1080,30 @@
 	RFs fs2;
 	
 	r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session1 Path=%S"),&sesspath);
 
 	TBuf<30> privatepath;
 	r=fs1.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.PrivatePath(privatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(KExpectedPrivatePath());
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(sesspath.Mid(KPathPosition));
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs1.Close();
 
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session2 Path=%S"),&sesspath);
 	fs2.Close();
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_dcdiskadmin.cpp
--- a/kerneltest/f32test/server/t_dcdiskadmin.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_dcdiskadmin.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32std.h>
@@ -108,16 +109,16 @@
 	mkdirname.Append(systestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(systestname,EDriveS);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.NotifyChange(ENotifyAll,aStat1,systestname);
 	test(aStat1==KErrPermissionDenied);
@@ -132,29 +133,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(systestfile, shortfilename);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.GetLongName(systestfile1, longfilename);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,systestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(systestfile,systestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(systestfile1,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetEntry(systestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(systestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 
 	// DEF141257: Security Issue in File Server 
@@ -168,24 +169,24 @@
 	SysTestFileDot.Append(KFileSys);
 	RFile file;
 	r = file.Replace(TheFs, SysTestFileDot, EFileWrite);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 
 	// try creating a subst drive for "\.SYS"...
 	TBuf<40> SysTestNameDot;
 	SysTestNameDot=KSystemPathDot;
 	SysTestNameDot[0]=(TText)('A' + gTheDriveNum);
 	r=TheFs.SetSubst(SysTestNameDot,EDriveA);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// try creating a file using substituted drive...
 	TBuf<40> SubstTestFile = _L("A:\\");
 	SubstTestFile.Append(KFileSys);
 
 	r = file.Replace(TheFs, SubstTestFile, EFileWrite);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 
 	r = TheFs.SetSubst(_L(""),EDriveA);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 
@@ -194,7 +195,7 @@
 	TFindFile finder(TheFs);
 	CDir* dir = NULL;
 	r=finder.FindWildByDir(KWildFile, KWildPathDot, dir);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	delete dir;
 
 	// Deliberately create a directory called "\.SYS"
@@ -203,17 +204,17 @@
 	mkdirname.Append(KSystemPathDot);
 	mkdirname[0]=(TText)('A' + gTheDriveNum);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.GetShortName(mkdirname, shortfilename);
-	test(r==KErrNone || r==KErrNotSupported);	// short names not supported on LFFS
+	test_Value(r, r == KErrNone || r==KErrNotSupported);	// short names not supported on LFFS
 //	r = shortfilename.Compare(_L("SYS~1"));
-//	test(r==KErrNone);
+//	test_KErrNone(r);
 	r = shortfilename.Compare(_L("SYS"));
 	test (r != 0);
 
 	r = TheFs.RmDir(mkdirname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Deliberately create a directory called "\..SYS"
 	// and verify shortname is NOT the same as "SYS"
@@ -222,17 +223,17 @@
 	mkdirname.Append(KSystemPathDotDot);
 	mkdirname[0]=(TText)('A' + gTheDriveNum);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.GetShortName(mkdirname, shortfilename);
-	test(r==KErrNone || r==KErrNotSupported);	// short names not supported on LFFS
+	test_Value(r, r == KErrNone || r==KErrNotSupported);	// short names not supported on LFFS
 //	r = shortfilename.Compare(_L("_.SYS"));
-//	test(r==KErrNone);
+//	test_KErrNone(r);
 	r = shortfilename.Compare(_L("SYS"));
 	test (r != 0);
 
 	r = TheFs.RmDir(mkdirname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -249,26 +250,26 @@
 	mkdirname.Append(restestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	// Change due to defect DEF099546 fix
 	// TCB capability is required for following operation.
 	r=TheFs.SetSubst(restestname,EDriveS);
-	//test(r==KErrNone);
-	test(r==KErrPermissionDenied);
+	//test_KErrNone(r);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	// SetSubst will fail.
 	//r=TheFs.RealName(_L("S:\\File.XXX"),realName);
-	//test(r==KErrNone);
+	//test_KErrNone(r);
 
 	//r=TheFs.SetSubst(_L(""),EDriveS); 
-	//test(r==KErrNone);
+	//test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat4,restestname);
 	test(aStat4==KRequestPending);
@@ -284,29 +285,32 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(restestfile, shortfilename);
-	test(r==KErrNone || KErrPathNotFound);
+	test(r == KErrNone || KErrPathNotFound);
+//	test_Value(r, r == KErrNone || r == KErrPathNotFound);
 
 	r=TheFs.GetLongName(restestfile1, longfilename);
-	test(r==KErrNone || KErrPathNotFound);
+	test(r == KErrNone || KErrPathNotFound);
+//	test_Value(r, r == KErrNone || r == KErrPathNotFound);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,restestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(restestfile,restestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(restestfile1,entry);
-	test(r==KErrNone || KErrPathNotFound);
+	test(r == KErrNone || KErrPathNotFound);
+//	test_Value(r, r == KErrNone || r == KErrPathNotFound);
 
 	r=TheFs.SetEntry(restestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(restestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	}
 
 
@@ -323,16 +327,16 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(pritestfalseidname,EDriveS);
-	test(r==KErrPermissionDenied); 
+	test_Value(r, r == KErrPermissionDenied); 
 	
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestfalseidname);
 	test(aStat2==KErrPermissionDenied);
@@ -347,29 +351,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	}
 
@@ -389,16 +393,16 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(pritestname,EDriveS);
-	test(r==KErrPermissionDenied); 
+	test_Value(r, r == KErrPermissionDenied); 
 	
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestname);
 	test(aStat2==KErrPermissionDenied);
@@ -413,29 +417,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	}
 
@@ -453,22 +457,22 @@
 	mkdirname.Append(theprivatepath);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(theprivatepath,EDriveS);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RealName(_L("S:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(_L(""),EDriveS);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.SetSessionPath(theprivatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat3,theprivatepath);
 	test(aStat3==KRequestPending);
@@ -483,29 +487,31 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || KErrPathNotFound);
+	test(r == KErrNone || KErrPathNotFound);
+//	test_Value(r, r == KErrNone || r == KErrPathNotFound);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || KErrPathNotFound);
+	test(r == KErrNone || KErrPathNotFound);
+//	test_Value(r, r == KErrNone || r == KErrPathNotFound);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void systemRFiletest()
@@ -516,32 +522,32 @@
 //RFile testing with session path set to //system//
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Temp(TheFs,systestname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TBuf<25> sysfilename;
 	sysfilename.Append(systestname);
 	sysfilename.Append(KFileSys);
 	r=file1.Create(TheFs,sysfilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Open(TheFs,sysfilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Open(TheFs,sysfilename,EFileRead);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Replace(TheFs,sysfilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
     TFindFile finder(TheFs);
     CDir* dir = NULL;
     r=finder.FindWildByDir(KWildFile, KWildPath, dir);
 	if (!(r==KErrPermissionDenied))
         test.Printf(_L("T_DCDISKADMIN: test find wildcards r = %d (expected KErrPermissionDenied)\n"), r);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	delete dir;
 	}
 
@@ -552,45 +558,45 @@
 	{
 //RFile testing with session path set to //resource//
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,restestname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFileRes,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.ChangeMode(EFileShareExclusive);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	//this operation is prevented as you can not open a file for write access in the resource directory
 	r=file1.Rename(KFileRes3);
-	test(r==KErrPermissionDenied || r==KErrAccessDenied);
+	test_Value(r, r == KErrPermissionDenied || r==KErrAccessDenied);
 	file1.Close();
 
 	r=file1.Replace(TheFs,KFileRes,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	}
@@ -602,26 +608,26 @@
 //
 	{
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Temp(TheFs,pritestfalseidname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TBuf<25> prifilename;
 	prifilename.Append(pritestname);
 	prifilename.Append(KFileSys);
 
 	r=file1.Create(TheFs,prifilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Open(TheFs,prifilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Open(TheFs,prifilename,EFileRead);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Replace(TheFs,prifilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	}
 
 
@@ -631,26 +637,26 @@
 //
 	{
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Temp(TheFs,pritestname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TBuf<25> prifilename;
 	prifilename.Append(pritestname);
 	prifilename.Append(KFileSys);
 
 	r=file1.Create(TheFs,prifilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Open(TheFs,prifilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=file1.Open(TheFs,prifilename,EFileRead);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Replace(TheFs,prifilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	}
 
 
@@ -660,29 +666,29 @@
 //
 	{
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 		
 	r=file1.Temp(TheFs,theprivatepath,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 	}
 
@@ -697,30 +703,30 @@
 	dirNameBuf = KSystemPath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Private//falseid
 	dirNameBuf=KPrivateFalseID;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Private
 	dirNameBuf=KPrivatePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Private/uid
@@ -728,19 +734,19 @@
 	dirNameBuf.Insert(0,_L("?:"));
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Resource
 	dirNameBuf=KResourcePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone || r==KErrPathNotFound || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound || r==KErrNotFound);
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone || r==KErrPathNotFound || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound || r==KErrNotFound);
 	dir.Close();
 	delete dirEntries;
 	}
@@ -752,19 +758,19 @@
 //
 	{
 	r=TheFs.FileSystemName(fsname,gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = DismountFileSystem(TheFs, fsname, gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	r=TheFs.RemoveFileSystem(fsname);	//can not test due to bug else where fix exists
-//	test(r==KErrPermissionDenied);
+//	test_Value(r, r == KErrPermissionDenied);
 //	r=TheFs.AddFileSystem(fsname);
-//	test(r==KErrPermissionDenied);
+//	test_Value(r, r == KErrPermissionDenied);
 	r = MountFileSystem(TheFs, fsname, gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetDriveName(gTheDriveNum,KDriveName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetVolumeLabel(KVolLable, gTheDriveNum);
-	test(r==KErrNone || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotSupported);
 
 	systemRFstest();
 	resourceRFstest();
@@ -789,11 +795,11 @@
 	test(aStat3==KErrNone);
 	
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 //Test RRawDisk class
 	r=rawdisk.Open(TheFs,gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	rawdisk.Close();
 
 	RDirtest();
@@ -804,21 +810,21 @@
 		{
 		//Test RFormat class
 		r=format.Open(TheFs,driveBuf,EHighDensity,count);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		while(count)
 			{
 			TInt r=format.Next(count);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			}
 		format.Close();
 		}
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.ScanDrive(driveBuf);
-	test(r==KErrNone || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotSupported);
 	r=TheFs.CheckDisk(driveBuf);
-	test(r==KErrNone || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotSupported);
 	}
 
 
@@ -830,16 +836,16 @@
 	{
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.SessionPath(temp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("Session path: %S"),&temp);
 
 	r=TheFs.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone || r== KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r== KErrAlreadyExists);
 
 	TBuf<18> tempPri;
 	r=TheFs.PrivatePath(tempPri);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	theprivatepath = _L("?:");
 	theprivatepath.Append(tempPri);
 	
@@ -848,9 +854,9 @@
 	TFileName thesessionpath;
 
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(thesessionpath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test(thesessionpath == theprivatepath);
 	}
@@ -864,7 +870,8 @@
 	test.Next(_L("Delete test directory"));
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	TInt r=fMan->RmDir(gSessionPath);
-	test(r==KErrNone || KErrPathNotFound);
+	test(r == KErrNone || KErrPathNotFound);
+//	test_Value(r, r == KErrNone || r == KErrPathNotFound);
 	delete fMan;
 	}
 
@@ -888,7 +895,7 @@
 	sesspath[0] = (TText)gDriveToTest;
 
 	TInt r= TheFs.SetSessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	//cleanup from previous run of this test
 	TBuf<2> cmd;
@@ -896,7 +903,7 @@
 	cmd[0] = (TText)gDriveToTest;
 	RProcess tp;
 	r=tp.Create(_L("clean_prepdc.exe"),sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	{
 	TRequestStatus ps;
 	tp.Logon(ps);
@@ -910,30 +917,30 @@
 	RFs fs2;
 	
 	r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session1 Path=%S"),&sesspath);
 
 	TBuf<30> privatepath;
 	r=fs1.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.PrivatePath(privatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(KExpectedPrivatePath());
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(sesspath.Mid(KPathPosition));
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs1.Close();
 
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session2 Path=%S"),&sesspath);
 	fs2.Close();
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_dcdiskadminallfiles.cpp
--- a/kerneltest/f32test/server/t_dcdiskadminallfiles.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_dcdiskadminallfiles.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32std.h>
@@ -113,16 +114,16 @@
 	mkdirname.Append(systestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(systestname,EDriveO);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat1,systestname);
 	test(aStat1==KRequestPending);
@@ -137,29 +138,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(systestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(systestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,systestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(systestfile,systestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(systestfile1,entry);
-	test(r==KErrNone || KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 
 	r=TheFs.SetEntry(systestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(systestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	}
 
 LOCAL_C void ResourceRFsTest()
@@ -174,26 +175,26 @@
 	mkdirname.Append(restestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	// Change due to defect DEF099546 fix
 	// TCB capability is required for following operation.
 	r=TheFs.SetSubst(restestname,EDriveO);
-	//test(r==KErrNone);
-	test(r==KErrPermissionDenied);
+	//test_KErrNone(r);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	// SetSubst will fail.
 	//r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	//test(r==KErrNone);
+	//test_KErrNone(r);
 
 	//r=TheFs.SetSubst(_L(""),EDriveO); 
-	//test(r==KErrNone);
+	//test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat4,restestname);
 	test(aStat4==KRequestPending);
@@ -208,29 +209,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(restestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(restestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,restestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(restestfile,restestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(restestfile1,entry);
-	test(r==KErrNone || r==KErrPathNotFound || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound || r==KErrNotFound);
 
 	r=TheFs.SetEntry(restestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(restestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	}
 
@@ -248,22 +249,22 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(pritestfalseidname,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(_L(""),EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestfalseidname);
 	test(aStat2==KRequestPending);
@@ -279,29 +280,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -320,22 +321,22 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(pritestname,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(_L(""),EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestname);
 	test(aStat2==KRequestPending);
@@ -351,29 +352,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -387,22 +388,22 @@
 	mkdirname.Append(theprivatepath);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(theprivatepath,EDriveO);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(_L(""),EDriveO);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(theprivatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat3,theprivatepath);
 	test(aStat3==KRequestPending);
@@ -417,29 +418,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -450,33 +451,33 @@
 	{
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,systestname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 	
 	systestfile=systestname;
 	systestfile.Append(KFileSys);
 	r=file1.Create(TheFs,systestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,systestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Open(TheFs,systestfile,EFileRead);
-	test(r==KErrNone|| r==KErrNotFound);
+	test_Value(r, r == KErrNone|| r==KErrNotFound);
 	
 	r=file1.Replace(TheFs,systestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
     TFindFile finder(TheFs);
     CDir* dir = NULL;
     r=finder.FindWildByDir(KWildFile, KWildPath, dir);
 	if (!(r==KErrNone))
         test.Printf(_L("T_DCDISKADMINALLFILES: test find wildcards r = %d (expected KErrNone)\n"), r);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	delete dir;
 	}
 
@@ -486,33 +487,33 @@
 //
 	{
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,restestname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFileRes,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileWrite|EFileShareExclusive );
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=file1.Open(TheFs,KFileRes,EFileShareReadersOnly);
-	test(r==KErrNone || KErrPathNotFound || KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrPathNotFound || r == KErrNotFound);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone || KErrPathNotFound || KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrPathNotFound || r == KErrNotFound);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,KFileRes3,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 	}
 
@@ -523,29 +524,29 @@
 //
 	{
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,pritestfalseidname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	}
 
@@ -556,29 +557,29 @@
 //
 	{
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,pritestname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	}
 
@@ -589,30 +590,30 @@
 //
 	{
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Temp(TheFs,theprivatepath,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	}
 
@@ -627,12 +628,12 @@
 	TBuf<30> dirNameBuf(KSystemPath);
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone || r==KErrPathNotFound || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound || r==KErrNotFound);
 	dir.Close();
 	if(r==KErrNone)
 		{
 		r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		delete dirEntries;
 		}
 	dirNameBuf.Zero();
@@ -640,20 +641,20 @@
 	dirNameBuf=KPrivateFalseID;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Private
 	dirNameBuf=KPrivatePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Private/uid
@@ -661,21 +662,21 @@
 	dirNameBuf.Insert(0,_L("?:"));
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Resource
 	dirNameBuf=KResourcePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	if(r==KErrNone)
 		{
 		r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		dir.Close();
 		delete dirEntries;
 		}
@@ -688,20 +689,20 @@
 //
 	{
 	r=TheFs.FileSystemName(fsname,gTheDriveNum);
-	test(r==KErrNone);	
+	test_KErrNone(r);	
 	r = DismountFileSystem(TheFs, fsname, gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	r=TheFs.RemoveFileSystem(fsname);	//can not test due to bug else where fix exists
-//	test(r==KErrNone);
+//	test_KErrNone(r);
 //	r=TheFs.AddFileSystem(fsname);
-//	test(r==KErrNone);
+//	test_KErrNone(r);
 	r = MountFileSystem(TheFs, fsname, gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetDriveName(gTheDriveNum,KDriveName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #ifndef __WINS__
  	r=TheFs.SetVolumeLabel(KVolLable, gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #endif
 
 	systemRFsTest();
@@ -733,11 +734,11 @@
 	test(aStat4==KErrCancel);
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 //Test RRawDisk class
 	r=rawdisk.Open(TheFs,gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	rawdisk.Close();
 
 	RDirtest();
@@ -748,20 +749,20 @@
 		{
 		//Test RFormat class
 		r=format.Open(TheFs,driveBuf,EHighDensity,count);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		while(count)	
 			{
 			TInt r=format.Next(count);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			}
 		format.Close();
 		}
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.ScanDrive(driveBuf);
-	test(r==KErrNone || r==KErrNotSupported || KErrInUse);
+	test_Value(r, r == KErrNone || r==KErrNotSupported || r == KErrInUse);
 	r=TheFs.CheckDisk(driveBuf);
-	test(r==KErrNone || r==KErrNotSupported || KErrInUse);
+	test_Value(r, r == KErrNone || r==KErrNotSupported || r == KErrInUse);
 	}
 
 LOCAL_C void TestCaps()
@@ -779,16 +780,16 @@
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.SessionPath(temp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("Session path: %S"),&temp);
 
 	r=TheFs.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone || r== KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r== KErrAlreadyExists);
 
 	TBuf<18> tempPri;
 	r=TheFs.PrivatePath(tempPri);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	theprivatepath = _L("?:");
 	theprivatepath.Append(tempPri);
 
@@ -796,9 +797,9 @@
 	
 	TFileName thesessionpath;
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(thesessionpath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(thesessionpath == theprivatepath);
 	}
 
@@ -811,7 +812,7 @@
 	test.Next(_L("Delete test directory"));
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	TInt r=fMan->RmDir(gSessionPath);
-	test(r==KErrNone || KErrPathNotFound);
+	test_Value(r, r == KErrNone || r == KErrPathNotFound);
 	delete fMan;
 	}
 
@@ -835,14 +836,14 @@
 	sesspath[0] = (TText)gDriveToTest;
 
 	TInt r= TheFs.SetSessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TBuf<2> cmd;
 	cmd.SetLength(1);
 	cmd[0] = (TText)gDriveToTest;
 	RProcess tp;
 	r=tp.Create(_L("clean_prepdc.exe"),sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	{
 	TRequestStatus ps;
 	tp.Logon(ps);
@@ -856,30 +857,30 @@
 	RFs fs2;
 	
 	r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session1 Path=%S"),&sesspath);
 
 	TBuf<30> privatepath;
 	r=fs1.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.PrivatePath(privatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(KExpectedPrivatePath());
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(sesspath.Mid(KPathPosition));
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs1.Close();
 
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session2 Path=%S"),&sesspath);
 	fs2.Close();
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_dcnone.cpp
--- a/kerneltest/f32test/server/t_dcnone.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_dcnone.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -13,6 +13,7 @@
 // Description:
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32std.h>
@@ -119,11 +120,11 @@
 //
     {
     TInt r = TheFs.Rename(_L("\\sys"), _L("\\sysbad"));
-    test(r == KErrPermissionDenied);
+    test_Value(r, r == KErrPermissionDenied);
     r = TheFs.Rename(_L("\\resource"), _L("\\resourcebad"));
-    test(r == KErrPermissionDenied);
+    test_Value(r, r == KErrPermissionDenied);
     r = TheFs.Rename(_L("\\private"), _L("\\privatebad"));
-    test(r == KErrPermissionDenied);
+    test_Value(r, r == KErrPermissionDenied);
     }
 
 LOCAL_C void systemRFstest()
@@ -138,16 +139,16 @@
 	mkdirname.Append(systestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(systestname,EDriveP);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.NotifyChange(ENotifyAll,aStat1,systestname);
 	test(aStat1==KErrPermissionDenied);
@@ -162,42 +163,42 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(systestfile, shortfilename);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.GetLongName(systestfile1, longfilename);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,systestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(systestfile,systestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	// check that the entry for the system directory itself can be retrieved with no error
 	// - with or without a slash
 	TPtrC restrictedDir(systestname.Ptr(), systestname.Length());
 	r=TheFs.Entry(restrictedDir, entry);
 	test.Printf(_L("RFs::Entry(%S) returned %d"), &restrictedDir, r);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test (entry.iAtt & KEntryAttDir);
 
 	TPtrC restrictedDirWithNoBackSlash(restrictedDir.Ptr(), restrictedDir.Length()-1);
 	r=TheFs.Entry(restrictedDirWithNoBackSlash,entry);
 	test.Printf(_L("RFs::Entry(%S) returned %d"), &restrictedDirWithNoBackSlash, r);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Entry(systestfile1,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.SetEntry(systestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(systestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	}
 
@@ -215,19 +216,19 @@
 	mkdirname.Append(restestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(restestname,EDriveP);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.RealName(_L("P:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat4,restestname);
 	test(aStat4==KRequestPending);
@@ -243,42 +244,44 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(restestfile, shortfilename);
-	test(r==KErrNone || KErrPathNotFound);
+//	test_Value(r, r == KErrNone || r == KErrPathNotFound);
+	test(r == KErrNone || KErrPathNotFound);
 
 	r=TheFs.GetLongName(restestfile1, longfilename);
-	test(r==KErrNone || KErrPathNotFound);
+//	test_Value(r, r == KErrNone || r == KErrPathNotFound);
+	test(r == KErrNone || KErrPathNotFound);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,restestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(restestfile,restestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	// check that the entry for the resource directory itself can be retrieved with no error
 	// - with or without a slash
 	TPtrC restrictedDir(restestname.Ptr(), restestname.Length());
 	r=TheFs.Entry(restrictedDir, entry);
 	test.Printf(_L("RFs::Entry(%S) returned %d"), &restrictedDir, r);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test (entry.iAtt & KEntryAttDir);
 
 	TPtrC restrictedDirWithNoBackSlash(restrictedDir.Ptr(), restrictedDir.Length()-1);
 	r=TheFs.Entry(restrictedDirWithNoBackSlash,entry);
 	test.Printf(_L("RFs::Entry(%S) returned %d"), &restrictedDirWithNoBackSlash, r);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Entry(restestfile1,entry);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	r=TheFs.SetEntry(restestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(restestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	}
 
@@ -296,13 +299,13 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(pritestfalseidname,EDriveP);
-	test(r==KErrPermissionDenied); 
+	test_Value(r, r == KErrPermissionDenied); 
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestfalseidname);
 	test(aStat2==KErrPermissionDenied);
@@ -318,29 +321,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	}
 
@@ -359,13 +362,13 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(pritestname,EDriveP);
-	test(r==KErrPermissionDenied); 
+	test_Value(r, r == KErrPermissionDenied); 
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestname);
 	test(aStat2==KErrPermissionDenied);
@@ -381,42 +384,42 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	// check that the entry for the private directory itself can be retrieved with no error
 	// - with or without a slash
 	TPtrC restrictedDir(pritestname.Ptr(), pritestname.Length());
 	r=TheFs.Entry(restrictedDir, entry);
 	test.Printf(_L("RFs::Entry(%S) returned %d"), &restrictedDir, r);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test (entry.iAtt & KEntryAttDir);
 
 	TPtrC restrictedDirWithNoBackSlash(restrictedDir.Ptr(), restrictedDir.Length()-1);
 	r=TheFs.Entry(restrictedDirWithNoBackSlash,entry);
 	test.Printf(_L("RFs::Entry(%S) returned %d"), &restrictedDirWithNoBackSlash, r);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	}
 
@@ -433,19 +436,19 @@
 	mkdirname.Append(theprivatepath);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(theprivatepath,EDriveP);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RealName(_L("P:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.SetSessionPath(theprivatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat3,theprivatepath);
 	test(aStat3==KRequestPending);
@@ -461,45 +464,47 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || KErrPathNotFound);
+//	test_Value(r, r == KErrNone || r == KErrPathNotFound);
+	test(r == KErrNone || KErrPathNotFound);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || KErrPathNotFound);
+//	test_Value(r, r == KErrNone || r == KErrPathNotFound);
+	test(r == KErrNone || KErrPathNotFound);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	//Test Entry with correct SID
 	r=TheFs.Entry(theprivatepath,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	//Test Entry with correct SID and without "//" appended
 	r=TheFs.Entry(KPrivatePathTest1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	//Test Entry with invalid SID, without // appended
 	r=TheFs.Entry(KPrivatePathTest2,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	//Test Entry with invalid SID
 	r=TheFs.Entry(KPrivatePathTest3,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -510,10 +515,10 @@
 //
 	{
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Temp(TheFs,systestname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 
 	TBuf<25> sysfilename;
@@ -521,23 +526,23 @@
 	sysfilename.Append(KFileSys);
 
 	r=file1.Create(TheFs,sysfilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Open(TheFs,sysfilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=file1.Open(TheFs,sysfilename,EFileRead);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=file1.Replace(TheFs,sysfilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TFindFile finder(TheFs);
 	CDir* dir = NULL;
 	r=finder.FindWildByDir(KWildFile, KWildPath, dir);
 	if (!(r==KErrPermissionDenied))
 		test.Printf(_L("T_DCNONE: test find wildcards r = %d (expected KErrPermissionDenied)\n"), r);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	delete dir;
 	}
 
@@ -547,46 +552,46 @@
 //
 	{
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,restestname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFileRes,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileShareReadersOnly);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 
 	r=file1.ChangeMode(EFileShareExclusive);	//this is not illegal though will prevent shared access to resource which is nit my fault but may be desirable to prevent
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 
 	//this operation is prevented as you can not open a file for write access in the resource directory
 	r=file1.Rename(KFileRes3);
-	test(r==KErrPermissionDenied || r==KErrAccessDenied);
+	test_Value(r, r == KErrPermissionDenied || r==KErrAccessDenied);
 
 	file1.Close();
 
 	r=file1.Replace(TheFs,KFileRes,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	}
@@ -599,28 +604,28 @@
 	{
 
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Temp(TheFs,pritestfalseidname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TBuf<25> prifilename;
 	prifilename.Append(pritestname);
 	prifilename.Append(KFileSys);
 
 	r=file1.Create(TheFs,prifilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 
 	r=file1.Open(TheFs,prifilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Open(TheFs,prifilename,EFileRead);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	
 	r=file1.Replace(TheFs,prifilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	}
 
@@ -633,29 +638,29 @@
 	{
 
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Temp(TheFs,pritestname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TBuf<25> prifilename;
 	prifilename.Append(pritestname);
 	prifilename.Append(KFileSys);
 
 	r=file1.Create(TheFs,prifilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 
 	r=file1.Open(TheFs,prifilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	
 	r=file1.Open(TheFs,prifilename,EFileRead);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 
 	r=file1.Replace(TheFs,prifilename,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	}
 
@@ -666,24 +671,24 @@
 	{
 
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 		
 	r=file1.Temp(TheFs,theprivatepath,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	}
@@ -699,20 +704,20 @@
 	TBuf<30> dirNameBuf(KSystemPath);
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	
 	dirNameBuf=KPrivateFalseID;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dirNameBuf.Zero();
 	delete dirEntries;
 
@@ -720,10 +725,10 @@
 	dirNameBuf=KPrivatePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Private/uid
@@ -731,19 +736,19 @@
 	dirNameBuf.Insert(0,_L("?:"));
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Resource
 	dirNameBuf=KResourcePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	delete dirEntries;
 	}
@@ -755,19 +760,19 @@
 //
 	{
 	r=TheFs.FileSystemName(fsname,gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = DismountFileSystem(TheFs, fsname, gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 //	r=TheFs.RemoveFileSystem(fsname);	//can not test due to bug elsewhere fix exists
-//	test(r==KErrPermissionDenied);
+//	test_Value(r, r == KErrPermissionDenied);
 //	r=TheFs.AddFileSystem(fsname);
-//	test(r==KErrPermissionDenied);
+//	test_Value(r, r == KErrPermissionDenied);
 	r = MountFileSystem(TheFs, fsname, gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r=TheFs.SetDriveName(gTheDriveNum,KDriveName);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 //	r=TheFs.SetVolumeLabel(KVolLable, gTheDriveNum);	//broken on wins C:
-//	test(r==KErrPermissionDenied);
+//	test_Value(r, r == KErrPermissionDenied);
 
 	systemRFstest();
 	resourceRFstest();
@@ -792,24 +797,24 @@
 	test(aStat3==KErrNone);
 	
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	
 //Test RRawDisk class
 	r=rawdisk.Open(TheFs,gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 //	rawdisk.Close();
 
 	r=format.Open(TheFs,driveBuf,EHighDensity,count);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	RDirtest();
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.ScanDrive(driveBuf);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r=TheFs.CheckDisk(driveBuf);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	}
 
 LOCAL_C void TestCaps()
@@ -831,14 +836,14 @@
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.SessionPath(temp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone || r== KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r== KErrAlreadyExists);
 
 	TBuf<18> tempPri;
 	r=TheFs.PrivatePath(tempPri);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	theprivatepath = _L("?:");
 	theprivatepath.Append(tempPri);
 
@@ -846,9 +851,9 @@
 
 	TFileName thesessionpath;
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(thesessionpath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	test(thesessionpath == theprivatepath);
 
@@ -862,25 +867,25 @@
 	{
 	TInt r;
 	r = TheFs.MkDir(_L("\\normal\\"));
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	r = TheFs.MkDir(_L("\\normal\\one\\"));
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	r = TheFs.MkDir(_L("\\normal\\two\\"));
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	r = TheFs.MkDir(_L("\\sys\\"));
-	test(r == KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = TheFs.MkDir(_L("\\sys\\one\\"));
-	test(r == KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = TheFs.MkDir(_L("\\sys\\two\\"));
-	test(r == KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = TheFs.MkDir(_L("\\private\\"));
-	test(r == KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = TheFs.MkDir(_L("\\private\\one\\"));
-	test(r == KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = TheFs.MkDir(_L("\\private\\two\\"));
-	test(r == KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = TheFs.MkDir(_L("\\ZZZZZZ\\"));
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	}
 
 TFileName dirName;
@@ -889,16 +894,16 @@
 	{
 	CDirScan* scanner = NULL;
 	TRAP(r, scanner = CDirScan::NewL(TheFs));
-	test(r == KErrNone && scanner);
+	test_Value(r, r == KErrNone && scanner);
 
 	TRAP(r, scanner->SetScanDataL(aName,KEntryAttDir,ESortByName|EAscending,aDirection));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	CDir *entryList=NULL;
 	for (;;)
 		{
 		TRAP(r, scanner->NextL(entryList));
-		test(r == aError);
+		test_Value(r, r == aError);
 		if (entryList==NULL)
 			break;
 		TInt count=entryList->Count();
@@ -937,11 +942,11 @@
 		test.Printf(_L("Private Path is=%S"),&privatepath);
 		
 		r = TheFs.MkDir(_L("\\Caged\\"));
-		test(r==KErrNone || r==KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 		
 		CDir* entryCount=NULL;
 		r=TheFs.GetDir(_L("\\*.*"),KEntryAttNormal,ESortNone,entryCount);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TInt rootCount= entryCount->Count();
 		
 		delete entryCount;
@@ -951,12 +956,12 @@
 		//Testing Copy
 		CDir* entryCount2=NULL;
 		r=fMan->Copy(_L("\\sys\\"),_L("\\Caged\\"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Copy(_L("\\*"),_L("\\Caged\\"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		
 		r=TheFs.GetDir(_L("\\Caged\\*.*"),KEntryAttNormal,ESortNone,entryCount2);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TInt cagedCount= entryCount2->Count();
 		
 		test(cagedCount==rootCount);
@@ -967,24 +972,24 @@
 		// Check if both copied sys and private are empty (no information is exposed)
 		CDir* entryCount3=NULL;
 		r=TheFs.GetDir(_L("\\Caged\\private\\*.*"),KEntryAttNormal|KEntryAttDir,ESortNone,entryCount3);
-		test(r==KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		delete entryCount3;
 		entryCount3=NULL;
 		
 		CDir* entryCount4=NULL;
 		r=TheFs.GetDir(_L("\\Caged\\sys\\*.*"),KEntryAttNormal|KEntryAttDir,ESortNone,entryCount4);
-		test(r==KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		delete entryCount4;
 		entryCount4=NULL;
 
 	
 		r=fMan->Copy(_L("\\private\\two\\moo"),_L("\\private\\two\\mew")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 	
 		// Create a test file
 		RFile testFile;
 		r = testFile.Replace(TheFs, _L("\\capTest"),EFileWrite);
-		test(r==KErrNone || r==KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 		testFile.Close();
 		
 		TFileName name;
@@ -992,96 +997,96 @@
 		name.Append(_L("privateFile.tst"));
 		RFile privateFile;
 		r = privateFile.Replace(TheFs, name,EFileWrite);
-		test(r==KErrNone || r==KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 		privateFile.Close();
 
 	
 		r=fMan->Copy(_L("\\capTest"),_L("\\private\\two\\moo")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Copy(_L("\\capTest"),_L("\\sys\\bin\\moo")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Copy(_L("\\sys\\bin\\capTest"),_L("\\sys\\bin\\moo"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Copy(_L("\\sys\\*"),_L("\\"));
-		test (r==KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Copy(name,_L("\\sys\\"));
-		test(r==KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 
 		// Testing Move
 		r=fMan->Move(_L("\\private\\two\\moo"),_L("\\private\\one\\moo"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(_L("\\private\\two\\moo.."),_L("\\private\\one\\moo"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(_L("\\private\\two\\moo"),_L("\\private\\one\\moo.."));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(name,_L("\\privateFile.tst"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Move(_L("\\privateFile.tst"),name);
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Move(_L("\\capTest"),_L("\\private\\two\\moo")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(_L("\\capTest"),_L("\\sys\\bin\\moo")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(_L("\\sys\\bin\\capTest"),_L("\\sys\\bin\\moo"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(_L("\\sys\\*"),_L("\\"));
-		test (r==KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(name,_L("\\sys\\"));
-		test(r==KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 
 
 		// Testing Attribs
 		r=fMan->Attribs(_L("\\private\\two\\moo"),KEntryAttReadOnly,0,TTime(0)); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Attribs(_L("\\private\\moo"),KEntryAttReadOnly,0,TTime(0)); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Attribs(name,KEntryAttReadOnly,0,TTime(0));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Attribs(name,0,KEntryAttReadOnly,TTime(0));
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 
 		// Testing RmDir
 		r=fMan->RmDir(_L("\\private\\"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->RmDir(_L("\\private\\two\\"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->RmDir(_L("\\private\\tw?\\"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->RmDir(_L("\\sys\\"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		
 		
 		// Testing Rename
 		r=fMan->Rename(_L("\\private\\two\\moo"),_L("\\private\\two\\mew")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		
 		// Testing Delete
 		r=fMan->Delete(_L("\\private\\two\\test")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Delete(_L("\\private\\moo")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Delete(_L("\\sys\\moo")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		
 
 		//Something that actually exists in Private
 		r=fMan->Rename(name,_L("\\private\\00000001\\moo")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Rename(_L("\\private\\00000001\\moo"),name); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Copy(name,_L("\\private\\00000001\\moo")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Delete(_L("\\private\\00000001\\moo")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 		// Clean up the test data
 		r=fMan->RmDir(_L("\\Caged\\")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Delete(_L("\\capTest")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Delete(name); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		delete(fMan);
 		}
 	
@@ -1101,25 +1106,25 @@
 	{
 	TInt r;
 	r = TheFs.RmDir(_L("\\normal\\one\\"));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = TheFs.RmDir(_L("\\normal\\two\\"));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = TheFs.RmDir(_L("\\normal\\"));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = TheFs.RmDir(_L("\\sys\\one\\"));
-	test(r == KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = TheFs.RmDir(_L("\\sys\\two\\"));
-	test(r == KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = TheFs.RmDir(_L("\\sys\\"));
-	test(r == KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = TheFs.RmDir(_L("\\private\\one\\"));
-	test(r == KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = TheFs.RmDir(_L("\\private\\two\\"));
-	test(r == KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = TheFs.RmDir(_L("\\private\\"));
-	test(r == KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = TheFs.RmDir(_L("\\ZZZZZZ\\"));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 TFileName gDirList[100];
@@ -1135,11 +1140,11 @@
 	CDirScan* scanner = NULL;
 	TInt r;
 	TRAP(r, scanner = CDirScan::NewL(TheFs));
-	test(r == KErrNone && scanner);
+	test_Value(r, r == KErrNone && scanner);
 	TParse dirName;
 	TheFs.Parse(_L("\\"),dirName);
 	TRAP(r, scanner->SetScanDataL(dirName.FullName(),KEntryAttDir,ESortByName|EAscending));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	CDir *entryList;
 	test.Printf(_L("------ ALL DIRECTORIES ------\n"));
 	for (;;)
@@ -1176,11 +1181,11 @@
 	CDirScan* scanner = NULL;
 	TInt r;
 	TRAP(r, scanner = CDirScan::NewL(TheFs));
-	test(r == KErrNone && scanner);
+	test_Value(r, r == KErrNone && scanner);
 	TParse dirName;
 	TheFs.Parse(_L("\\"),dirName);
 	TRAP(r, scanner->SetScanDataL(dirName.FullName(),KEntryAttDir,ESortByName|EAscending));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	CDir *entryList = NULL;
 	TInt  num = 0;
 	test.Printf(_L("------ ACCESSIBLE DIRECTORIES ------\n"));
@@ -1215,7 +1220,7 @@
 		}
 	delete scanner;
 	CleanDirs();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	if (num < gDirNum)
 		{
 		test.Printf(_L("Directory not as expected (%d found < %d expected\n"), num, gDirNum);
@@ -1246,7 +1251,7 @@
 	test.Next(_L("Delete test directory"));
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	TInt r=fMan->RmDir(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	delete fMan;
 	}
 
@@ -1271,14 +1276,14 @@
 	sesspath[0] = (TText)gDriveToTest;
 
 	TInt r= TheFs.SetSessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TBuf<2> cmd;
 	cmd.SetLength(1);
 	cmd[0] = (TText)gDriveToTest;
 	RProcess tp;
 	r=tp.Create(_L("clean_prepdc.exe"),sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	{
 	TRequestStatus ps;
 	tp.Logon(ps);
@@ -1292,30 +1297,30 @@
 	RFs fs2;
 	
 	r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session1 Path=%S"),&sesspath);
 
 	TBuf<30> privatepath;
 	r=fs1.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.PrivatePath(privatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(KExpectedPrivatePath());
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(sesspath.Mid(KPathPosition));
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs1.Close();
 
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session2 Path=%S"),&sesspath);
 	fs2.Close();
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_dctcb.cpp
--- a/kerneltest/f32test/server/t_dctcb.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_dctcb.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -13,6 +13,7 @@
 // Description:
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32std.h>
@@ -111,15 +112,15 @@
 //
     {
     TInt r = TheFs.Rename(_L("\\sys"), _L("\\sysbad"));
-    test(r == KErrNone);
+    test_KErrNone(r);
     r = TheFs.Rename(_L("\\resource"), _L("\\resourcebad"));
-    test(r == KErrNone);
+    test_KErrNone(r);
     r = TheFs.Rename(_L("\\sysbad"), _L("\\sys"));
-    test(r == KErrNone);
+    test_KErrNone(r);
     r = TheFs.Rename(_L("\\resourcebad"), _L("\\resource"));
-    test(r == KErrNone);
+    test_KErrNone(r);
     r = TheFs.Rename(_L("\\private"), _L("\\privatebad"));
-    test(r == KErrPermissionDenied);
+    test_Value(r, r == KErrPermissionDenied);
     }
 
 LOCAL_C void systemRFsTest()
@@ -135,19 +136,19 @@
 	mkdirname.Append(systestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(systestname,EDriveO);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat1,systestname);
 	test(aStat1==KErrPermissionDenied);
@@ -162,32 +163,32 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(systestfile, shortfilename);
-	test(r==KErrPermissionDenied || r==KErrNotSupported);
+	test_Value(r, r == KErrPermissionDenied || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(systestfile1, longfilename);
-	test(r==KErrPermissionDenied || r==KErrNotSupported);
+	test_Value(r, r == KErrPermissionDenied || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,systestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Delete(systestfile1);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	r=TheFs.Rename(systestfile,systestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(systestfile1,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetEntry(systestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(systestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	__UHEAP_MARKEND;
 
@@ -207,19 +208,19 @@
 	mkdirname.Append(restestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(restestname,EDriveO);
-	test(r==KErrPermissionDenied || r==KErrGeneral);
+	test_Value(r, r == KErrPermissionDenied || r==KErrGeneral);
 	
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat4,restestname);
 	test(aStat4==KRequestPending);
@@ -234,29 +235,31 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(restestfile, shortfilename);
-	test(r==KErrNone || KErrNotFound || r==KErrNotSupported);
+//	test_Value(r, r == KErrNone || r == KErrNotFound || r==KErrNotSupported);
+	test(r == KErrNone || KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(restestfile1, longfilename);
-	test(r==KErrNone || KErrNotFound || r==KErrNotSupported);
+//	test_Value(r, r == KErrNone || r == KErrNotFound || r==KErrNotSupported);
+	test(r == KErrNone || KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,restestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(restestfile,restestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(restestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(restestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(restestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	__UHEAP_MARK;
 
@@ -278,22 +281,22 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(pritestfalseidname,EDriveO);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestfalseidname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 
 	pritestfile=KPrivateFalseID;
@@ -306,29 +309,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrPermissionDenied || r==KErrNotSupported);
+	test_Value(r, r == KErrPermissionDenied || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrPermissionDenied || r==KErrNotSupported);
+	test_Value(r, r == KErrPermissionDenied || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	__UHEAP_MARKEND;
 	}
@@ -350,22 +353,22 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(pritestname,EDriveO);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 
 	pritestfile=KPrivatePath;
@@ -378,29 +381,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrPermissionDenied || r==KErrNotSupported);
+	test_Value(r, r == KErrPermissionDenied || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrPermissionDenied || r==KErrNotSupported);
+	test_Value(r, r == KErrPermissionDenied || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	__UHEAP_MARKEND;
 	}
@@ -417,19 +420,19 @@
 	mkdirname.Append(theprivatepath);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(theprivatepath,EDriveO);	
-	test(r==KErrPermissionDenied || r==KErrGeneral); // Drive may already be substituted
+	test_Value(r, r == KErrPermissionDenied || r==KErrGeneral); // Drive may already be substituted
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(theprivatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat3,theprivatepath);
 	test(aStat3==KRequestPending);
@@ -444,29 +447,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	__UHEAP_MARKEND;
 	}
@@ -480,10 +483,10 @@
 	__UHEAP_MARK;
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Temp(TheFs,systestname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	TBuf<25> sysfilename;
@@ -491,26 +494,26 @@
 	sysfilename.Append(KFileSys);
 
 	r=file1.Create(TheFs,sysfilename,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,sysfilename,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,sysfilename,EFileRead);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,sysfilename,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TBuf<25> sysfilename2;
 	sysfilename2.Append(systestname);
 	sysfilename2.Append(KFileSys3);
 		
 	r=file1.Rename(sysfilename2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
     TFindFile finder(TheFs);
@@ -518,7 +521,7 @@
     r=finder.FindWildByDir(KWildFile, KWildPath, dir);
 	if (!(r==KErrPermissionDenied))
         test.Printf(_L("T_DCTCB: test find wildcards r = %d (expected KErrPermissionDenied)\n"), r);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	delete dir;
 
 	__UHEAP_MARKEND;
@@ -532,40 +535,40 @@
 	__UHEAP_MARK;
 
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,restestname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFileRes,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileWrite|EFileShareExclusive );
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFileRes3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes3,EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes3,EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes3,EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.ChangeMode(EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Replace(TheFs,KFileRes,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();	
 	
 	__UHEAP_MARKEND;
@@ -581,10 +584,10 @@
 	__UHEAP_MARK;
 
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Temp(TheFs,pritestfalseidname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	// Since can't set session path create explicit path
@@ -593,23 +596,23 @@
 	pritestfile.Append(KFilePri);
 
 	r=file1.Create(TheFs,pritestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,pritestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 	
 	r=file1.Open(TheFs,pritestfile,EFileRead);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 		
 	r=file1.Replace(TheFs,pritestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	// File does not exist so can't rename it	
 /*	r=file1.Rename(KFilePri3);
-	test(r==KErrAlreadyExists || r==KErrNone);
+	test_Value(r, r == KErrAlreadyExists || r==KErrNone);
 	file1.Close();
 */	__UHEAP_MARKEND;
 	}
@@ -623,10 +626,10 @@
 	__UHEAP_MARK;
 
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Temp(TheFs,pritestname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	// Since can't set session path create explicit path
@@ -635,23 +638,23 @@
 	pritestfile.Append(KFilePri);
 
 	r=file1.Create(TheFs,pritestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,pritestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 	
 	r=file1.Open(TheFs,pritestfile,EFileRead);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,pritestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	// File does not exist so can't be renamed	
 /*	r=file1.Rename(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 */
 	__UHEAP_MARKEND;
@@ -665,29 +668,29 @@
 	{
 	__UHEAP_MARK;
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Temp(TheFs,theprivatepath,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	__UHEAP_MARKEND;
 	}
@@ -704,10 +707,10 @@
 	TBuf<30> dirNameBuf(KSystemPath);
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dirNameBuf.Zero();
 	delete dirEntries;
 
@@ -715,10 +718,10 @@
 	dirNameBuf=KPrivatePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dirNameBuf.Zero();
 	delete dirEntries;
 
@@ -726,10 +729,10 @@
 	dirNameBuf=KPrivateFalseID;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dirNameBuf.Zero();
 	delete dirEntries;
 
@@ -738,19 +741,19 @@
 	dirNameBuf.Insert(0,_L("?:"));
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Resource
 	dirNameBuf=KResourcePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	delete dirEntries;
 	__UHEAP_MARKEND;
@@ -764,16 +767,16 @@
 	{
 	__UHEAP_MARK;
 	r=TheFs.FileSystemName(fsname,gTheDriveNum);
-	test(r==KErrNone);	
+	test_KErrNone(r);	
 	r = DismountFileSystem(TheFs, fsname, gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r = MountFileSystem(TheFs, fsname, gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r=TheFs.SetDriveName(gTheDriveNum,KDriveName);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 #ifndef __WINS__
  	r=TheFs.SetVolumeLabel(KVolLable, gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 #endif
 
 	systemRFsTest();
@@ -800,11 +803,11 @@
 	test(aStat4==KErrNone);
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 //Test RRawDisk class
 	r=rawdisk.Open(TheFs,gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
     rawdisk.Close();
 
 	RDirtest();
@@ -815,21 +818,21 @@
 		{
 		//Test RFormat class
 		r=format.Open(TheFs,driveBuf,EHighDensity,count);
-		test(r==KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 
 		while(count)	
 			{
 			TInt r=format.Next(count);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			}
 		format.Close();
 		}
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.ScanDrive(driveBuf);
-	test((r==KErrPermissionDenied)||(r==KErrNotSupported));
+	test_Value(r, (r == KErrPermissionDenied)||(r==KErrNotSupported));
 	r=TheFs.CheckDisk(driveBuf);
-	test((r==KErrPermissionDenied)||(r==KErrNotSupported));
+	test_Value(r, (r == KErrPermissionDenied)||(r==KErrNotSupported));
 	__UHEAP_MARKEND;
 	}
 
@@ -847,14 +850,14 @@
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.SessionPath(temp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("Session path: %S"),&temp);
 	r=TheFs.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone || r== KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r== KErrAlreadyExists);
 
 	TBuf<18> tempPri;
 	r=TheFs.PrivatePath(tempPri);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	theprivatepath = _L("?:");
 	theprivatepath.Append(tempPri);
 
@@ -862,9 +865,9 @@
 
 	TFileName thesessionpath;
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(thesessionpath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(thesessionpath == theprivatepath);
 	__UHEAP_MARKEND;
 	}
@@ -876,16 +879,16 @@
 	{
 	CDirScan* scanner = NULL;
 	TRAP(r, scanner = CDirScan::NewL(TheFs));
-	test(r == KErrNone && scanner);
+	test_Value(r, r == KErrNone && scanner);
 
 	TRAP(r, scanner->SetScanDataL(aName,KEntryAttDir,ESortByName|EAscending,aDirection));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	CDir *entryList=NULL;
 	for (;;)
 		{
 		TRAP(r, scanner->NextL(entryList));
-		test(r == aError);
+		test_Value(r, r == aError);
 		if (entryList==NULL)
 			break;
 		TInt count=entryList->Count();
@@ -924,11 +927,11 @@
 		test.Printf(_L("Private Path is=%S"),&privatepath);
 		
 		r = TheFs.MkDir(_L("\\Caged\\"));
-		test(r==KErrNone || r==KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 		
 		CDir* entryCount=NULL;
 		r=TheFs.GetDir(_L("\\*.*"),KEntryAttNormal,ESortNone,entryCount);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TInt rootCount= entryCount->Count();
 		
 		delete entryCount;
@@ -938,12 +941,12 @@
 		//Testing Copy
 		CDir* entryCount2=NULL;
 		r=fMan->Copy(_L("\\sys\\"),_L("\\Caged\\"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Copy(_L("\\*"),_L("\\Caged\\"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		
 		r=TheFs.GetDir(_L("\\Caged\\*.*"),KEntryAttNormal,ESortNone,entryCount2);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TInt cagedCount= entryCount2->Count();
 		
 		test(cagedCount==rootCount);
@@ -952,12 +955,12 @@
 		entryCount2=NULL;
 	
 		r=fMan->Copy(_L("\\private\\two\\moo"),_L("\\private\\two\\mew")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 	
 		// Create a test file
 		RFile testFile;
 		r = testFile.Replace(TheFs, _L("\\capTest"),EFileWrite);
-		test(r==KErrNone || r==KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 		testFile.Close();
 		
 		TFileName name;
@@ -965,99 +968,99 @@
 		name.Append(_L("privateFile.tst"));
 		RFile privateFile;
 		r = privateFile.Replace(TheFs, name,EFileWrite);
-		test(r==KErrNone || r==KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 		privateFile.Close();
 
 	
 		r=fMan->Copy(_L("\\capTest"),_L("\\private\\two\\moo")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Copy(_L("\\capTest"),_L("\\sys\\bin\\moo")); 
-		test(r == KErrPathNotFound); 
+		test_Value(r, r == KErrPathNotFound); 
 		r=fMan->Copy(_L("\\sys\\bin\\capTest"),_L("\\sys\\bin\\moo")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Copy(_L("\\capTest"),_L("\\sys\\capTest")); 
-		test(r == KErrNone || r==KErrAlreadyExists); 
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists); 
 		r=fMan->Copy(_L("\\sys\\*"),_L("\\"));
-		test (r==KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Copy(name,_L("\\sys\\"));
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		// Testing Move
 		r=fMan->Move(_L("\\private\\two\\moo"),_L("\\private\\one\\moo"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(_L("\\private\\two\\moo.."),_L("\\private\\one\\moo"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(_L("\\private\\two\\moo"),_L("\\private\\one\\moo.."));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(name,_L("\\privateFile.tst"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Move(_L("\\privateFile.tst"),name);
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 
 		// Testing Attribs
 		r=fMan->Attribs(_L("\\private\\two\\moo"),KEntryAttReadOnly,0,TTime(0)); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Attribs(_L("\\private\\moo"),KEntryAttReadOnly,0,TTime(0)); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Attribs(name,KEntryAttReadOnly,0,TTime(0));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Attribs(name,0,KEntryAttReadOnly,TTime(0));
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 		// Testing Move
 		r=fMan->Move(_L("\\private\\two\\moo"),_L("\\private\\one\\moo"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(_L("\\private\\two\\moo.."),_L("\\private\\one\\moo"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(_L("\\private\\two\\moo"),_L("\\private\\one\\moo.."));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Move(name,_L("\\privateFile.tst"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Move(_L("\\privateFile.tst"),name);
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 
 		// Testing RmDir
 		r=fMan->RmDir(_L("\\private\\"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->RmDir(_L("\\private\\two\\"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->RmDir(_L("\\private\\tw?\\"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->RmDir(_L("\\sys\\"));
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		
 		
 		// Testing Rename
 		r=fMan->Rename(_L("\\private\\two\\moo"),_L("\\private\\two\\mew")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		
 		// Testing Delete
 		r=fMan->Delete(_L("\\private\\two\\test")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Delete(_L("\\private\\moo")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 		r=fMan->Delete(_L("\\sys\\")); 
-		test(r == KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 
 		//Something that actually exists in Private
 		r=fMan->Rename(name,_L("\\private\\00000001\\moo")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Rename(_L("\\private\\00000001\\moo"),name); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Copy(name,_L("\\private\\00000001\\moo")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Delete(_L("\\private\\00000001\\moo")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 		// Clean up the test data
 		r=fMan->RmDir(_L("\\Caged\\")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Delete(_L("\\capTest")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Delete(name); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		delete(fMan);
 		}
 	
@@ -1088,14 +1091,14 @@
 					test.Printf(_L("Setting %c:"), 'A'+i);
 					TInt ret = TheFs.SetSystemDrive((TDriveNumber)i);
 					test.Printf(_L("%d\n"), ret);
-					test(ret == KErrNone || ret == KErrAlreadyExists);
+					test_Value(ret, ret == KErrNone || ret == KErrAlreadyExists);
 					if(ret == KErrNone)
 						{
 						drive = (TDriveNumber)i;
 						test.Printf(_L("Re-setting %c:"), 'A'+i);
 						ret = TheFs.SetSystemDrive(drive);
 						test.Printf(_L("%d\n"), ret);
-						test(ret == KErrAlreadyExists);
+						test_Value(ret, ret == KErrAlreadyExists);
 						}
 					}
 				}
@@ -1114,7 +1117,8 @@
 	test.Next(_L("Delete test directory"));
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	TInt r=fMan->RmDir(gSessionPath);
-	test(r==KErrNone || KErrPathNotFound);
+//	test_Value(r, r == KErrNone || r == KErrPathNotFound);
+	test(r == KErrNone || KErrPathNotFound);
 	delete fMan;
 	}
 
@@ -1138,7 +1142,7 @@
 	sesspath[0] = (TText)gDriveToTest;
 
 	TInt r= TheFs.SetSessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	//cleanup from previous run of this test
 	TBuf<20> delDir;
@@ -1146,15 +1150,18 @@
 	delDir=KResourcePath;
 	delDir[0]=(TText)gDriveToTest;
 	r=fMan->RmDir(delDir);
-	test(r==KErrNone || KErrNotFound);
+//	test_Value(r, r == KErrNone || r == KErrNotFound);
+	test(r == KErrNone || KErrNotFound);
 	delDir=KSystemPath;
 	delDir[0]=(TText)gDriveToTest;
 	r=fMan->RmDir(delDir);
-	test(r==KErrNone || KErrNotFound);
+//	test_Value(r, r == KErrNone || r == KErrNotFound);
+	test(r == KErrNone || KErrNotFound);
 	delDir=KPrivatePath;
 	delDir[0]=(TText)gDriveToTest;
 	r=fMan->RmDir(delDir);
-	test(r==KErrNone || KErrNotFound);
+//	test_Value(r, r == KErrNone || r == KErrNotFound);
+	test(r == KErrNone || KErrNotFound);
 	delete fMan;
 
 	//check double mode ie that Defpath still works	
@@ -1162,30 +1169,30 @@
 	RFs fs2;
 	
 	r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session1 Path=%S"),&sesspath);
 
 	TBuf<30> privatepath;
 	r=fs1.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.PrivatePath(privatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(KExpectedPrivatePath());
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(sesspath.Mid(KPathPosition));
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs1.Close();
 
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session2 Path=%S"),&sesspath);
 	fs2.Close();
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_dctcballfiles.cpp
--- a/kerneltest/f32test/server/t_dctcballfiles.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_dctcballfiles.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -13,6 +13,7 @@
 // Description:
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32std.h>
@@ -106,19 +107,19 @@
 	mkdirname.Append(systestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(systestname,EDriveO);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat1,systestname);
 	test(aStat1==KRequestPending);
@@ -133,29 +134,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(systestfile, shortfilename);
-	test(r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(systestfile1, longfilename);
-	test(r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,systestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(systestfile,systestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(systestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(systestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(systestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void ResourceRFsTest()
@@ -170,19 +171,19 @@
 	mkdirname.Append(restestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(restestname,EDriveO);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat4,restestname);
 	test(aStat4==KRequestPending);
@@ -197,29 +198,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(restestfile, shortfilename);
-	test(r==KErrNone || KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r == KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(restestfile1, longfilename);
-	test(r==KErrNone || KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r == KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,restestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(restestfile,restestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(restestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(restestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(restestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -237,19 +238,19 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(pritestfalseidname,EDriveO);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestfalseidname);
 	test(aStat2==KRequestPending);
@@ -265,29 +266,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -306,19 +307,19 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(pritestname,EDriveO);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestname);
 	test(aStat2==KRequestPending);
@@ -334,29 +335,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -370,19 +371,19 @@
 	mkdirname.Append(theprivatepath);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(theprivatepath,EDriveO);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(theprivatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat3,theprivatepath);
 	test(aStat3==KRequestPending);
@@ -397,29 +398,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -430,29 +431,29 @@
 	{
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,systestname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFileSys,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileSys,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFileSys,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Replace(TheFs,KFileSys,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFileSys3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
     TFindFile finder(TheFs);
@@ -460,7 +461,7 @@
     r=finder.FindWildByDir(KWildFile, KWildPath, dir);
 	if (!(r==KErrNone))
         test.Printf(_L("T_DCTCBALLFILES: test find wildcards r = %d (expected KErrNone)\n"), r);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	delete dir;
 	}
 
@@ -470,40 +471,40 @@
 //
 	{
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,restestname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFileRes,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileWrite|EFileShareExclusive );
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFileRes3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes3,EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes3,EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes3,EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.ChangeMode(EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Replace(TheFs,KFileRes,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();	
 	}
 
@@ -514,29 +515,29 @@
 //
 	{
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,pritestfalseidname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	}
 
@@ -547,29 +548,29 @@
 //
 	{
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,pritestname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	}
 
@@ -580,29 +581,29 @@
 //
 	{
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Temp(TheFs,theprivatepath,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	}
 
@@ -617,10 +618,10 @@
 	TBuf<30> dirNameBuf(KSystemPath);
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 
@@ -628,10 +629,10 @@
 	dirNameBuf=KPrivatePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 
@@ -639,10 +640,10 @@
 	dirNameBuf=KPrivateFalseID;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 
@@ -651,19 +652,19 @@
 	dirNameBuf.Insert(0,_L("?:"));
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Resource
 	dirNameBuf=KResourcePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	delete dirEntries;
 	}
@@ -675,21 +676,21 @@
 //
 	{
 	r=TheFs.FileSystemName(fsname,gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = DismountFileSystem(TheFs, fsname, gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 //	r=TheFs.RemoveFileSystem(fsname);	//can not test due to bug else where fix exists
-//	test(r==KErrNone);
+//	test_KErrNone(r);
 //	r=TheFs.AddFileSystem(fsname);
-//	test(r==KErrNone);
+//	test_KErrNone(r);
 	r = MountFileSystem(TheFs, fsname, gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	test.Printf(_L("r=%d"),r);
 	r=TheFs.SetDriveName(gTheDriveNum,KDriveName);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 #ifndef __WINS__
  	r=TheFs.SetVolumeLabel(KVolLable, gTheDriveNum);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 #endif
 
 	systemRFsTest();
@@ -715,11 +716,11 @@
 	test(aStat4==KErrNone);
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 //Test RRawDisk class
 	r=rawdisk.Open(TheFs,gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	rawdisk.Close();
 
 	RDirtest();
@@ -730,12 +731,12 @@
 		{
 		//Test RFormat class
 		r=format.Open(TheFs,driveBuf,EHighDensity,count);
-		test(r==KErrPermissionDenied);
+		test_Value(r, r == KErrPermissionDenied);
 
 		while(count)	
 			{
 			TInt r=format.Next(count);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			}
 		format.Close();
 		}
@@ -743,9 +744,9 @@
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.ScanDrive(driveBuf);
 	RDebug::Print(_L("r=%d"),r);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	r=TheFs.CheckDisk(driveBuf);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	}
 
 LOCAL_C void TestCaps()
@@ -763,16 +764,16 @@
 	
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.SessionPath(temp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("Session path: %S"),&temp);
 
 	r=TheFs.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone || r== KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r== KErrAlreadyExists);
 
 	TBuf<18> tempPri;
 	r=TheFs.PrivatePath(tempPri);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	theprivatepath = _L("?:");
 	theprivatepath.Append(tempPri);
 
@@ -780,9 +781,9 @@
 	
 	TFileName thesessionpath;
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(thesessionpath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test(thesessionpath == theprivatepath);
 	}
@@ -794,16 +795,16 @@
 	{
 	CDirScan* scanner = NULL;
 	TRAP(r, scanner = CDirScan::NewL(TheFs));
-	test(r == KErrNone && scanner);
+	test_Value(r, r == KErrNone && scanner);
 
 	TRAP(r, scanner->SetScanDataL(aName,KEntryAttDir,ESortByName|EAscending,aDirection));
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	CDir *entryList=NULL;
 	for (;;)
 		{
 		TRAP(r, scanner->NextL(entryList));
-		test(r == aError);
+		test_Value(r, r == aError);
 		if (entryList==NULL)
 			break;
 
@@ -845,11 +846,11 @@
 		test.Printf(_L("Private Path is=%S"),&privatepath);
 		
 		r = TheFs.MkDir(_L("\\Caged\\"));
-		test(r==KErrNone || r==KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 		
 		CDir* entryCount=NULL;
 		r=TheFs.GetDir(_L("\\*.*"),KEntryAttNormal|KEntryAttDir,ESortNone,entryCount);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		
 		delete entryCount;
 		entryCount=NULL;
@@ -858,23 +859,23 @@
 		//Testing Copy
 		CDir* entryCount2=NULL;
 		r=fMan->Copy(_L("\\sys\\"),_L("\\Caged\\"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Copy(_L("\\*"),_L("\\Caged\\"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		
 		r=TheFs.GetDir(_L("\\Caged\\*.*"),KEntryAttNormal|KEntryAttDir,ESortNone,entryCount2);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		
 		delete entryCount2;
 		entryCount2=NULL;
 	
 		r=fMan->Copy(_L("\\private\\two\\moo"),_L("\\private\\two\\mew")); 
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 	
 		// Create a test file
 		RFile testFile;
 		r = testFile.Replace(TheFs, _L("\\capTest"),EFileWrite);
-		test(r==KErrNone || r==KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 		testFile.Close();
 		
 		TFileName name;
@@ -882,88 +883,88 @@
 		name.Append(_L("privateFile.tst"));
 		RFile privateFile;
 		r = privateFile.Replace(TheFs, name,EFileWrite);
-		test(r==KErrNone || r==KErrAlreadyExists);
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 		privateFile.Close();
 
 	
 		r=fMan->Copy(_L("\\capTest"),_L("\\private\\two\\moo")); 
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Copy(_L("\\capTest"),_L("\\sys\\bin\\moo")); 
-		test(r == KErrPathNotFound); 
+		test_Value(r, r == KErrPathNotFound); 
 		r=fMan->Copy(_L("\\sys\\bin\\capTest"),_L("\\sys\\bin\\moo")); 
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Copy(_L("\\capTest"),_L("\\sys\\capTest")); 
-		test(r == KErrNone || r==KErrAlreadyExists); 
+		test_Value(r, r == KErrNone || r==KErrAlreadyExists); 
 		r=fMan->Copy(_L("\\sys\\*"),_L("\\"));
-		test (r==KErrNone);
+		test_KErrNone(r);
 		r=fMan->Copy(name,_L("\\sys\\"));
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		// Testing Attribs
 		r=fMan->Attribs(_L("\\private\\two\\moo"),KEntryAttReadOnly,0,TTime(0)); 
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Attribs(_L("\\private\\moo"),KEntryAttReadOnly,0,TTime(0)); 
-		test(r == KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		r=fMan->Attribs(name,KEntryAttReadOnly,0,TTime(0));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Attribs(name,0,KEntryAttReadOnly,TTime(0));
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 		// Testing Move
 		r=fMan->Move(_L("\\private\\two\\moo"),_L("\\private\\one\\moo"));
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Move(_L("\\private\\two\\moo.."),_L("\\private\\one\\moo"));
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Move(_L("\\private\\two\\moo"),_L("\\private\\one\\moo.."));
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Move(name,_L("\\privateFile.tst"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Move(_L("\\privateFile.tst"),name);
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 
 		// Testing RmDir
 		r=fMan->RmDir(_L("\\private\\"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		// put it back where it was
 		r = TheFs.MkDirAll(_L("\\private\\00000001\\"));
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->RmDir(_L("\\private\\two\\"));
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->RmDir(_L("\\private\\tw?\\"));
-		test(r == KErrBadName);
+		test_Value(r, r == KErrBadName);
 
 		r=fMan->RmDir(_L("\\private\\two\\"));
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->RmDir(_L("\\private\\tw?\\"));
-		test(r == KErrBadName);
+		test_Value(r, r == KErrBadName);
 		
 		
 		// Testing Rename
 		r=fMan->Rename(_L("\\private\\two\\moo"),_L("\\private\\two\\mew")); 
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		
 		// Testing Delete
 		r=fMan->Delete(_L("\\private\\two\\test")); 
-		test(r == KErrPathNotFound);
+		test_Value(r, r == KErrPathNotFound);
 		r=fMan->Delete(_L("\\private\\moo")); 
-		test(r == KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		
 		//Something that actually exists in Private
 		r=fMan->Rename(name,_L("\\private\\00000001\\moo")); 
-		test(r == KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		r=fMan->Rename(_L("\\private\\00000001\\moo"),name); 
-		test(r == KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		r=fMan->Copy(name,_L("\\private\\00000001\\moo")); 
-		test(r == KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		r=fMan->Delete(_L("\\private\\00000001\\moo")); 
-		test(r == KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 
 		// Clean up the test data
 		r=fMan->RmDir(_L("\\Caged\\")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		r=fMan->Delete(_L("\\capTest")); 
-		test(r == KErrNone);
+		test_KErrNone(r);
 		delete(fMan);
 		}
 	
@@ -984,7 +985,7 @@
 	test.Next(_L("Delete test directory"));
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	TInt r=fMan->RmDir(gSessionPath);
-	test(r==KErrNone || KErrPathNotFound);
+	test_Value(r, r == KErrNone || r == KErrPathNotFound);
 	delete fMan;
 	}
 
@@ -1008,7 +1009,7 @@
 	sesspath[0] = (TText)gDriveToTest;
 
 	TInt r= TheFs.SetSessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	//cleanup from previous run of this test
 	TBuf<20> delDir;
@@ -1016,15 +1017,15 @@
 	delDir=KResourcePath;
 	delDir[0]=(TText)gDriveToTest;
 	r=fMan->RmDir(delDir);
-	test(r==KErrNone || KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound || r == KErrPathNotFound);
 	delDir=KSystemPath;
 	delDir[0]=(TText)gDriveToTest;
 	r=fMan->RmDir(delDir);
-	test(r==KErrNone || KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound || r == KErrPathNotFound);
 	delDir=KPrivatePath;
 	delDir[0]=(TText)gDriveToTest;
 	r=fMan->RmDir(delDir);
-	test(r==KErrNone || KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound || r == KErrPathNotFound);
 	delete fMan;
 
 	//check double mode ie that Defpath still works	
@@ -1032,30 +1033,30 @@
 	RFs fs2;
 	
 	r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session1 Path=%S"),&sesspath);
 
 	TBuf<30> privatepath;
 	r=fs1.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.PrivatePath(privatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(KExpectedPrivatePath());
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(sesspath.Mid(KPathPosition));
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs1.Close();
 
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session2 Path=%S"),&sesspath);
 	fs2.Close();
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_dctcbdiskadmin.cpp
--- a/kerneltest/f32test/server/t_dctcbdiskadmin.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_dctcbdiskadmin.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -13,6 +13,7 @@
 // Description:
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32std.h>
@@ -109,19 +110,19 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(pritestfalseidname,EDriveO);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestfalseidname);
 	test(aStat2==KErrPermissionDenied);
@@ -137,32 +138,32 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrPermissionDenied || r==KErrNotSupported);
+	test_Value(r, r == KErrPermissionDenied || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrPermissionDenied || r==KErrNotSupported);
+	test_Value(r, r == KErrPermissionDenied || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(oldName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	__UHEAP_MARKEND;
 	}
@@ -180,22 +181,22 @@
 	mkdirname.Append(systestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(systestname,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(_L(""),EDriveO); //to unsubst
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat1,systestname);
 	test(aStat1==KErrPermissionDenied);
@@ -210,32 +211,32 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(systestfile, shortfilename);
-	test(r==KErrPermissionDenied || r==KErrNotSupported);
+	test_Value(r, r == KErrPermissionDenied || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(systestfile1, longfilename);
-	test(r==KErrPermissionDenied || r==KErrNotSupported);
+	test_Value(r, r == KErrPermissionDenied || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,systestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Delete(systestfile1);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	r=TheFs.Rename(systestfile,systestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(systestfile1,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetEntry(systestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(systestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	__UHEAP_MARKEND;
 	}
@@ -254,22 +255,22 @@
 	mkdirname.Append(restestname);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.RmDir(mkdirname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(restestname,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(_L(""),EDriveO); //to unsubst
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TheFs.NotifyChange(ENotifyAll,aStat4,restestname);
 	test(aStat4==KRequestPending);
@@ -284,32 +285,32 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(restestfile, shortfilename);
-	test(r==KErrNone || KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r == KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(restestfile1, longfilename);
-	test(r==KErrNone || KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r == KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,restestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Delete(restestfile1);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	r=TheFs.Rename(restestfile,restestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Entry(restestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(restestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(restestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 	__UHEAP_MARKEND;
@@ -331,19 +332,19 @@
 	mkdirname.Append(KMkDirSub);
 
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetSubst(pritestname,EDriveO);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	TheFs.NotifyChange(ENotifyAll,aStat2,pritestname);
 	test(aStat2==KErrPermissionDenied);
@@ -359,29 +360,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrPermissionDenied || r==KErrNotSupported);
+	test_Value(r, r == KErrPermissionDenied || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrPermissionDenied || r==KErrNotSupported);
+	test_Value(r, r == KErrPermissionDenied || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 
 	__UHEAP_MARKEND;
@@ -399,22 +400,22 @@
 	mkdirname.Append(theprivatepath);
 	mkdirname.Append(KMkDirSub);
 	r=TheFs.MkDirAll(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.RmDir(mkdirname);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(theprivatepath,EDriveO);	
-	test(r==KErrNone); 
+	test_KErrNone(r); 
 
 	r=TheFs.RealName(_L("O:\\File.XXX"),realName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSubst(_L(""),EDriveO);	 //to unsubst
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetSessionPath(theprivatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAll,aStat3,theprivatepath);
 	test(aStat3==KRequestPending);
@@ -429,29 +430,29 @@
 	oldName[0]=(TText)gDriveToTest;
 
 	r=TheFs.GetShortName(pritestfile, shortfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=TheFs.GetLongName(pritestfile1, longfilename);
-	test(r==KErrNone || r==KErrNotFound || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrNotSupported);
 
 	r=file1.Create(TheFs,oldName,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=TheFs.Replace(oldName,pritestfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=TheFs.Rename(pritestfile,pritestfile1);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	
 	r=TheFs.Entry(pritestfile1,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.SetEntry(pritestfile1,testtime,KEntryAttNormal,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(pritestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	__UHEAP_MARKEND;
 	}
@@ -465,10 +466,10 @@
 	__UHEAP_MARK;
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Temp(TheFs,systestname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	systestfile=KSystemPath;
@@ -478,22 +479,22 @@
 	systestfile1.Append(KFileSys3);
 
 	r=file1.Create(TheFs,systestfile,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,systestfile,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,systestfile,EFileRead);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Replace(TheFs,systestfile,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(systestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
     TFindFile finder(TheFs);
@@ -501,14 +502,14 @@
     r=finder.FindWildByDir(KWildFile, KWildPath, dir);
 	if (!(r==KErrPermissionDenied))
         test.Printf(_L("T_DCTCBDISKADMIN: test find wildcards r = %d (expected KErrPermissionDenied)\n"), r);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 //	delete dir;
 
 	r=TheFs.Delete(fromTemp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(systestfile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 
 	__UHEAP_MARKEND;
@@ -522,50 +523,50 @@
 	__UHEAP_MARK;
 
 	r=TheFs.SetSessionPath(restestname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.Temp(TheFs,restestname,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFileRes,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes,EFileWrite|EFileShareExclusive );
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFileRes3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes3,EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes3,EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFileRes3,EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file1.ChangeMode(EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Replace(TheFs,KFileRes,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();	
 
 	r=TheFs.Delete(KFileRes);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(KFileRes3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(fromTemp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	__UHEAP_MARKEND;
 	}
@@ -579,7 +580,7 @@
 	__UHEAP_MARK;
 
 	r=TheFs.SetSessionPath(pritestfalseidname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	// Since can't set the session path to what is required, so use
 	// an explicit path
@@ -588,23 +589,23 @@
 	pritestfile.Append(KFilePri);
 
 	r=file1.Temp(TheFs,pritestfalseidname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Create(TheFs,pritestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,pritestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,pritestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	// Can't perform this operation since file1 has not been created
 /*	r=file1.Rename(KFilePri3);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 */
 	__UHEAP_MARKEND;
@@ -620,10 +621,10 @@
 	__UHEAP_MARK;
 
 	r=TheFs.SetSessionPath(pritestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	r=file1.Temp(TheFs,pritestname,fromTemp,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	// Since can't set session path create explicit path
@@ -632,28 +633,28 @@
 	pritestfile.Append(KFilePri);
 
 	r=file1.Create(TheFs,pritestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=file1.Open(TheFs,pritestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 	
 	r=file1.Open(TheFs,pritestfile,EFileRead);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,pritestfile,EFileWrite);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 
 	// Can't rename nor delete since file1 not created
 /*
 	r=file1.Rename(KFilePri3);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	file1.Close();
 
 	r=TheFs.Delete(fromTemp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 */
 
 	__UHEAP_MARKEND;
@@ -669,36 +670,36 @@
 	__UHEAP_MARK;
 
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Temp(TheFs,theprivatepath,fromTemp,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=file1.Create(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	file1.Close();
 
 	r=file1.Open(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Open(TheFs,KFilePri,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	
 	r=file1.Replace(TheFs,KFilePri,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Rename(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r=TheFs.Delete(KFilePri3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Delete(fromTemp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	__UHEAP_MARKEND;
 	}
@@ -716,10 +717,10 @@
 	TBuf<30> dirNameBuf(KSystemPath);
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dirNameBuf.Zero();
 	delete dirEntries;
 
@@ -727,10 +728,10 @@
 	dirNameBuf=KPrivatePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dirNameBuf.Zero();
 	delete dirEntries;
 
@@ -738,10 +739,10 @@
 	dirNameBuf=KPrivateFalseID;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	dirNameBuf.Zero();
 	delete dirEntries;
 
@@ -750,10 +751,10 @@
 	dirNameBuf.Insert(0,_L("?:"));
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dirNameBuf.Zero();
 	delete dirEntries;
 	//Resource
@@ -761,9 +762,9 @@
 	dirNameBuf=KResourcePath;
 	dirNameBuf[0]=(TText)gDriveToTest;
 	r=dir.Open(TheFs,dirNameBuf,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.GetDir(dirNameBuf,KEntryAttMatchMask,ESortByName,dirEntries);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	delete dirEntries;
 
@@ -779,20 +780,20 @@
 	__UHEAP_MARK;
 
 	r=TheFs.FileSystemName(fsname,gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = DismountFileSystem(TheFs, fsname, gTheDriveNum);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 //	r=TheFs.RemoveFileSystem(fsname);	//can not test due to bug else where fix exists
-//	test(r==KErrNone);
+//	test_KErrNone(r);
 //	r=TheFs.AddFileSystem(fsname);
-//	test(r==KErrNone);
+//	test_KErrNone(r);
 	r = MountFileSystem(TheFs, fsname, gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetDriveName(gTheDriveNum,KDriveName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #ifndef __WINS__
  	r=TheFs.SetVolumeLabel(KVolLable, gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #endif
 
 	systemRFsTest();
@@ -818,11 +819,11 @@
 	test(aStat4==KErrNone);
 
 	r=TheFs.SetSessionPath(systestname);
-	test(r==KErrPermissionDenied);
+	test_Value(r, r == KErrPermissionDenied);
 	
 //Test RRawDisk class
 	r=rawdisk.Open(TheFs,gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	rawdisk.Close();
 
 	RDirtest();
@@ -833,21 +834,21 @@
 		{
 		//Test RFormat class
 		r=format.Open(TheFs,driveBuf,EHighDensity,count);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		while(count)	
 			{
 			TInt r=format.Next(count);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			}
 		format.Close();
 		}
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.ScanDrive(driveBuf);
-	test(r==KErrNone || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotSupported);
 	r=TheFs.CheckDisk(driveBuf);
-	test(r==KErrNone || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotSupported);
 
 	__UHEAP_MARKEND;
 	}
@@ -867,16 +868,16 @@
 
 	driveBuf[0]=(TText)gDriveToTest;
 	r=TheFs.SessionPath(temp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("Session path: %S"),&temp);
 
 	r=TheFs.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone || r== KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r== KErrAlreadyExists);
 
 	TBuf<18> tempPri;
 	r=TheFs.PrivatePath(tempPri);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	theprivatepath = _L("?:");
 	theprivatepath.Append(tempPri);
 
@@ -885,9 +886,9 @@
 	TFileName thesessionpath;
 
 	r=TheFs.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(thesessionpath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	test(thesessionpath == theprivatepath);
 
@@ -902,19 +903,19 @@
 	test.Next(_L("Delete test directory"));
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	TInt r=fMan->RmDir(gSessionPath);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 
 	TBuf<20> delDir;
 	delDir=KResourcePath;
 	delDir[0]=(TText)gDriveToTest;
 	r=fMan->RmDir(delDir);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	delete fMan;
 
 	delDir=KSystemPath;
 	delDir[0]=(TText)gDriveToTest;
 	r=TheFs.RmDir(delDir);
-	test(r==KErrNone || r==KErrPathNotFound || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound || r==KErrNotFound);
 	}
 
 GLDEF_C void CallTestsL(/*TChar aDriveLetter*/)
@@ -941,12 +942,12 @@
 	sesspath[0] = (TText)gDriveToTest;
 
 	TInt r= TheFs.SetSessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	//cleanup from previous run of this test
 	RProcess tp;
 	r=tp.Create(_L("clean_prepdc.exe"),sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	{
 	TRequestStatus ps;
 	tp.Logon(ps);
@@ -960,30 +961,30 @@
 	RFs fs2;
 	
 	r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session1 Path=%S"),&sesspath);
 
 	TBuf<30> privatepath;
 	r=fs1.SetSessionToPrivate(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.PrivatePath(privatepath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(KExpectedPrivatePath());
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=privatepath.Compare(sesspath.Mid(KPathPosition));
-	test(r==0);
+	test_Value(r, r == 0);
 	r=fs1.CreatePrivatePath(gTheDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs1.Close();
 
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SessionPath(sesspath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("session2 Path=%S"),&sesspath);
 	fs2.Close();
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_dirs.cpp
--- a/kerneltest/f32test/server/t_dirs.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_dirs.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -41,20 +42,20 @@
 	test.Next(_L("Create a directory with 55 entries"));
 	TFileName sessionPath;
 	TInt r=TheFs.SessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MkDir(_L("\\F32-TST\\"));
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 	r=TheFs.MkDir(_L("\\F32-TST\\TDIRS\\"));
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 	
 	for (TInt i=0;i<maxEntry;i++)
 		{
 		TFileName baseName=_L("\\F32-TST\\TDIRS\\FILE");
 		baseName.AppendNum(i);
 		r=f.Replace(TheFs,baseName,EFileRead);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=f.Write(_L8("Hello World"));
-		test(r==KErrNone);
+		test_KErrNone(r);
 		f.Close();
 		}
 	test.Next(_L("Test all entries have been created successfully."));
@@ -65,12 +66,12 @@
 		TInt r=f.Open(TheFs,baseName,EFileRead);
 		if (r!=KErrNone)
 			{
-			test(r==KErrNotFound && j==maxEntry);
+			test_Value(r, r == KErrNotFound && j==maxEntry);
 			return;
 			}
 		TBuf8<16> data;
 		r=f.Read(data);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(data==_L8("Hello World"));
 		f.Close();
 		}
@@ -115,10 +116,10 @@
 	RDir d;
 	
 	TInt r=d.Open(TheFs,PlatSec::ConfigSetting(PlatSec::EPlatSecEnforceSysBin)?_L("\\Sys\\Bin\\ESHELL.EXE\\*"):_L("\\System\\Bin\\ESHELL.EXE\\*"),KEntryAttMaskSupported);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	
 	r=d.Open(TheFs,PlatSec::ConfigSetting(PlatSec::EPlatSecEnforceSysBin)?_L("\\Sys\\Bin\\ESHELL.EXE"):_L("\\System\\Bin\\ESHELL.EXE"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=d.Read(entry);
 	if (r==KErrEof)
@@ -128,21 +129,21 @@
 		}
 	else
 		{
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(entry.iName.FindF(_L("ESHELL.EXE"))>=0);
 		r=d.Read(entry);
-		test(r==KErrEof);
+		test_Value(r, r == KErrEof);
 		}
 	d.Close();
 
 	r=d.Open(TheFs,_L("\\*.XQP"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=d.Read(entry);
-	test(r==KErrEof);
+	test_Value(r, r == KErrEof);
 	d.Close();
 
 	r=d.Open(TheFs,PlatSec::ConfigSetting(PlatSec::EPlatSecEnforceSysBin)?_L("\\Sys\\Bin\\"):_L("\\System\\Bin\\"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=d.Read(entry);
 	
 	if (r==KErrEof)
@@ -152,19 +153,19 @@
 		}
 	else
 		{
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test.Printf(_L("First Entry = %S\n"),&entry.iName);
 		r=d.Read(entry);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test.Printf(_L("Second Entry = %S\n"),&entry.iName);
 		d.Close();
 		}
 
 	r=d.Open(TheFs,_L("\\*"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	d.Close();
 	r=d.Open(TheFs,PlatSec::ConfigSetting(PlatSec::EPlatSecEnforceSysBin)?_L("\\Sys\\Bin\\*"):_L("\\System\\Bin\\*"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	d.Close();
 	}
 
@@ -178,39 +179,39 @@
 	TEntry entry;
 	RFile f;
 	TInt r=f.Replace(TheFs,_L("\\F32-TST\\TDIRS\\TESTFILEORISITA.DIR"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Write(_L8("TESTDATATESTDATATESTDATATESTDATATESTDATATESTDATATESTDATATESTDATATESTDATATESTDATATESTDATATESTDATA"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("\\F32-TST\\TDIRS\\TESTFILEORISITA.DIR"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	f.Close();
 	RDir d;
 	r=d.Open(TheFs,_L("\\F32-TST\\TDIRS\\TESTFILEORISITA.DIR\\*"),KEntryAttMaskSupported);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=d.Open(TheFs,_L("\\F32-TST\\TDIRS\\*.XQP"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=d.Read(entry);
-	test(r==KErrEof);
+	test_Value(r, r == KErrEof);
 	d.Close();
 	r=d.Open(TheFs,_L("\\F32-TST\\TDIRS\\TESTFILEORISITA.DIR"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=d.Read(entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName.FindF(_L("TESTFILEORISITA.DIR"))>=0);
 	r=d.Read(entry);
-	test(r==KErrEof);
+	test_Value(r, r == KErrEof);
 	d.Close();
 	r=d.Open(TheFs,_L("\\"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	d.Close();
 	r=d.Open(TheFs,_L("\\F32-TST\\"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	d.Close();
 	r=d.Open(TheFs,_L("\\*"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	d.Close();
 	r=d.Open(TheFs,_L("\\F32-TST\\*"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	d.Close();
 	
 	// create a small file on the root
@@ -226,20 +227,20 @@
 	
 	
 	r=TheFs.MkDir(_L("\\F32-TST\\EMPTY\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	r=d.Open(TheFs,_L("\\F32-TST\\EMPTY\\*"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	r=TheFs.RmDir(_L("\\F32-TST\\EMPTY\\"));
 	r=d.Read(entry);
-	test(r==KErrEof);
+	test_Value(r, r == KErrEof);
 //	r=TheFs.RmDir(_L("\\F32-TST\\EMPTY\\"));
-//	test(r==KErrInUse);
+//	test_Value(r, r == KErrInUse);
 	r=d.Read(entry);
 	r=d.Read(entry);
 	r=d.Read(entry);
 	d.Close();
 	r=TheFs.RmDir(_L("\\F32-TST\\EMPTY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -256,21 +257,21 @@
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	test(fMan!=NULL);
 	TInt r=fMan->RmDir(_L("\\F32-TST\\TDIRS\\SORT_NONE\\"));
-	test((r==KErrNone)||(r==KErrPathNotFound));
+	test_Value(r, (r == KErrNone)||(r==KErrPathNotFound));
 	delete fMan;	
 
 	gTimeNow.HomeTime();	//	Set global TTime gTimeNow to time now - for later tests
 	r=TheFs.MkDirAll(_L("\\F32-TST\\TDIRS\\SORT_NONE\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	MakeFile(_L("\\f32-tst\\tdirs\\sort_none\\file1.txt"));
 	r=TheFs.MkDir(_L("\\F32-TST\\TDIRS\\SORT_NONE\\FILE_DIR1.APP\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	MakeFile(_L("\\f32-tst\\tdirs\\sort_none\\file1.app"));
 	r=TheFs.MkDir(_L("\\F32-TST\\TDIRS\\SORT_NONE\\FILE_DIR2.TXT\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	MakeFile(_L("\\f32-tst\\tdirs\\sort_none\\file2.txt"));
 	r=TheFs.MkDir(_L("\\F32-TST\\TDIRS\\SORT_NONE\\FILE_DIR3.APP\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	MakeFile(_L("\\f32-tst\\tdirs\\sort_none\\ZZZZ"));
 	MakeFile(_L("\\f32-tst\\tdirs\\sort_none\\AAAA"));
 	MakeFile(_L("\\f32-tst\\tdirs\\sort_none\\WWWW"));
@@ -299,33 +300,33 @@
 	TheFs.SetAllocFailure(gAllocFailOff);
 
 	TInt r=TheFs.GetDir(_L("\\f32-tst\\tdirs\\sort_none\\*"),KEntryAttMaskSupported,ESortNone,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=dir->Count();
 	test(count==15);
 	r=TheFs.GetDir(_L("\\f32-tst\\tdirs\\sort_none\\*"),KEntryAttMaskSupported,ESortByName,dirSorted);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dirSorted->Count()==15);
 	delete dirSorted;
 	delete dir;
 
 	r=TheFs.GetDir(_L("\\f32-tst\\tdirs\\sort_none\\*.txt"),KEntryAttNormal,ESortNone,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count()==3);
 	delete dir;
 	r=TheFs.GetDir(_L("\\f32-tst\\tdirs\\sort_none\\*.app"),KEntryAttNormal,ESortNone,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count()==3);
 	delete dir;
 	r=TheFs.GetDir(_L("\\f32-tst\\tdirs\\sort_none\\*.app"),KEntryAttNormal|KEntryAttDir,ESortNone,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count()==5);
 	delete dir;
 	r=TheFs.GetDir(_L("\\f32-tst\\tdirs\\sort_none\\*.app"),KEntryAttNormal|KEntryAttDir,ESortNone|EDirsFirst,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count()==5);
 	delete dir;
 	r=TheFs.GetDir(_L("\\f32-tst\\tdirs\\sort_none\\*.app"),KEntryAttNormal|KEntryAttDir,ESortNone|EDirsLast,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count()==5);
 	delete dir;
 
@@ -341,9 +342,9 @@
 	test.Next(_L("Test return values"));
 	RDir dir;
 	TInt r=dir.Open(TheFs,_L("\\DoesNotExist\\*"),KEntryAttMaskSupported);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=dir.Open(TheFs,_L("\\"),KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir.Close();
 	}
 
@@ -357,7 +358,7 @@
 	test.Next(_L("Test *.* matches all files"));
 	CDir* dirList;
 	TInt r=TheFs.GetDir(_L("\\f32-tst\\tdirs\\sort_none\\*.*"),KEntryAttNormal|KEntryAttDir,ESortByName|EDirsLast,dirList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=dirList->Count();
 	test(count==15);
 	TEntry entry=(*dirList)[0];
@@ -394,7 +395,7 @@
 
 	RDir dir;
 	r=dir.Open(TheFs,_L("\\f32-tst\\tdirs\\sort_none\\*.*"),KEntryAttNormal|KEntryAttDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TTime time;
 	TInt64 difference;
@@ -405,14 +406,14 @@
 	for (TInt i=0; i<15; i++)
 		{
 		r=dir.Read(entry);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		time=entry.iModified;
 		difference=time.Int64()-gTimeNow.Int64();
 		test(difference<maxOK);
 		}
 
 	r=dir.Read(entry);
-	test(r==KErrEof);
+	test_Value(r, r == KErrEof);
 	dir.Close();
 
 	TheFs.SetAllocFailure(gAllocFailOn);
@@ -433,7 +434,7 @@
         }    
 
     TInt r = FormatDrive(TheFs, gDriveNum, ETrue);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
 	TBuf<32> baseName=_L("\\RD");
 	TBuf<32> id;
@@ -453,7 +454,7 @@
 			{
 			break;
 			}
-		test(r==KErrNone);
+		test_KErrNone(r);
 		f.Close();
 		count++;
 		if(count >= 1000)
@@ -471,7 +472,7 @@
 		fileName+=baseName;
 		fileName+=id;
 		TInt r=TheFs.Delete(fileName);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test.Printf(_L("DeleteFile	:	%d	: %S\r"),count,&fileName);
 		--count;
 		}
@@ -485,34 +486,34 @@
 	longFileName[0]='\\';
 	longFileName[253]='\\';
 	r=TheFs.MkDir(longFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CDir* dirList=NULL;
 	r=TheFs.GetDir(longFileName,KEntryAttMaskSupported,ESortByName,dirList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dirList->Count();
 	test(count==0);
 	delete dirList;
 	TParse parse;
 	r=TheFs.Parse(longFileName,parse);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TEntry entry;
 	r=TheFs.Entry(longFileName,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetSessionPath(longFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.GetDir(longFileName,KEntryAttMaskSupported,ESortByName,dirList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dirList->Count();
 	test(count==0);
 	delete dirList;
 	r=TheFs.Parse(longFileName,_L("*"),parse);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=f.Open(TheFs,_L("asdf.asdf"),0);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.Entry(longFileName,entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(longFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 static void Test8()
@@ -525,21 +526,21 @@
 	MakeDir(_L("C:\\MOON\\"));
 	RDir dir;
 	TInt r=dir.Open(TheFs,_L("C:\\MOON\\"),0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName driveName;
 	r=TheFs.GetDriveName(11,driveName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TEntryArray entryArray;
 	r=dir.Read(entryArray);
-	test(r==KErrEof);
+	test_Value(r, r == KErrEof);
 	test(entryArray.Count()==0);
 	dir.Close();
 	r=TheFs.RmDir(_L("C:\\MOON\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("MkDir all on nonexistent drive"));
 	r=TheFs.MkDirAll(_L("L:\\MOON"));
-	test((r==KErrNotReady)||(r==KErrPathNotFound));
+	test_Value(r, (r == KErrNotReady)||(r==KErrPathNotFound));
 	}
 
 static void CleanupL()
@@ -551,9 +552,9 @@
 	test.Next(_L("Delete test directory"));
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	TInt r=fMan->RmDir(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fMan->Delete(_L("\\Filluptherootdir*"));
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	delete fMan;
 	}
 
@@ -566,15 +567,15 @@
 	test.Next(_L("Testing directory names with trailing dots"));
 	TInt r;
 	r=TheFs.MkDir(_L("\\test9..\\"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.MkDir(_L("\\test9\\"));
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 	r=TheFs.Rename(_L("\\test9\\"),_L("\\test9..\\"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r= TheFs.RmDir(_L("\\test9\\"));
-	test((r==KErrNone));
+	test_KErrNone(r);
 	r=TheFs.MkDir(_L("\\t.\\"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	}
 
 
@@ -605,7 +606,7 @@
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	test(fMan!=NULL);
 	TInt r=fMan->RmDir(aPath);
-	test((r==KErrNone)||(r==KErrPathNotFound));
+	test_Value(r, (r == KErrNone)||(r==KErrPathNotFound));
 	delete fMan;	
 	}
 
@@ -619,7 +620,7 @@
 
 	gTimeNow.HomeTime();	//	Set global TTime gTimeNow to time now - for later tests
 	TInt r=TheFs.MkDirAll(aPath);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 
 	TBuf<128> fileName;
 	for (TInt i = 0; i < aNumFiles; i++)
@@ -645,7 +646,7 @@
 	TBuf<128> sortSpec(KSortByNamePath);
 	sortSpec.Append(KSortAll);
 	TInt r=TheFs.GetDir(sortSpec, KEntryAttNormal | KEntryAttDir, ESortByName | EDirsLast, dirList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=dirList->Count();
 	test(count==numFiles);
 
@@ -670,7 +671,7 @@
 
 
 	r=TheFs.GetDir(sortSpec, KEntryAttNormal | KEntryAttDir, ESortByName | EDirsLast | EDescending, dirList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dirList->Count();
 	test(count==numFiles);
 
@@ -737,7 +738,7 @@
 	TBuf<128> sortSpec(KSortByExtPath);
 	sortSpec.Append(KSortAll);
 	TInt r=TheFs.GetDir(sortSpec, KEntryAttNormal | KEntryAttDir, ESortByExt | EDirsLast, dirList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=dirList->Count();
 	test(count==numFiles);
 
@@ -773,7 +774,7 @@
 	test.Next(_L("Test ESortByExt (descending)"));
 
 	r=TheFs.GetDir(sortSpec, KEntryAttNormal | KEntryAttDir, ESortByExt | EDirsLast | EDescending, dirList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dirList->Count();
 	test(count==numFiles);
 
@@ -857,55 +858,55 @@
 	dirTest6 = _L("\\F32-TST\\TDIRS\\test6. .\\");
 
     TInt err = TheFs.MkDir(dirTest1);
-    test(err == KErrNone);
+    test_KErrNone(err);
     err = TheFs.MkDir(dirTest2);
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
     err = TheFs.MkDir(dirTest3);
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
     err = TheFs.MkDir(dirTest4);
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
     err = TheFs.MkDir(dirTest5);
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
     err = TheFs.MkDir(dirTest6);
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
 
     RDir rdir;
     err = rdir.Open(TheFs, dirTest1, 0);
     rdir.Close();
-    test(err == KErrNone);
+    test_KErrNone(err);
 
     err = rdir.Open(TheFs, dirTest2, 0);
     rdir.Close();
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
 
     err = rdir.Open(TheFs, dirTest3, 0);
     rdir.Close();
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
 
     err = rdir.Open(TheFs, dirTest4, 0);
     rdir.Close();
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
 
     err = rdir.Open(TheFs, dirTest5, 0);
     rdir.Close();
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
 
     err = rdir.Open(TheFs, dirTest6, 0);
     rdir.Close();
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
 
     err = TheFs.RmDir(dirTest1);
-    test(err == KErrNone);
+    test_KErrNone(err);
     err = TheFs.RmDir(dirTest2);
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
     err = TheFs.RmDir(dirTest3);
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
     err = TheFs.RmDir(dirTest4);
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
     err = TheFs.RmDir(dirTest5);
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
     err = TheFs.RmDir(dirTest6);
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
 	}
 
 void CallTestsL()
@@ -918,7 +919,7 @@
     F32_Test_Utils::SetConsole(test.Console()); 
     
     TInt nRes=TheFs.CharToDrive(gDriveToTest, gDriveNum);
-    test(nRes==KErrNone);
+    test_KErrNone(nRes);
     
     PrintDrvInfo(TheFs, gDriveNum);
 
@@ -928,11 +929,11 @@
 	if (!gTestedZ)
 		{
 		TInt r=TheFs.SetSessionPath(_L("Z:\\"));
-		test(r==KErrNone);
+		test_KErrNone(r);
 		Test2();
 		TestZ();
 		r=TheFs.SetSessionPath(gSessionPath);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test.Next(_L("Run all other tests from \\F32-TST\\TDIRS\\"));
 		gTestedZ=ETrue;
 		}
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_dspace.cpp
--- a/kerneltest/f32test/server/t_dspace.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_dspace.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 //
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -104,7 +105,7 @@
 	{
 	TVolumeInfo v;
 	TInt r=TheFs.Volume(v,aDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return(v.iFree);
 	}
 
@@ -115,7 +116,7 @@
 	{
 	TVolumeInfo v;
 	TInt r=TheFs.Volume(v,aDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return(v.iSize);
 	}
 
@@ -126,7 +127,7 @@
 LOCAL_C TInt MinimumFileSize(TInt aDrive)
 	{
 	TInt r = TheFs.Delete(KTestFile1);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	TInt64 freeSpace = FreeDiskSpace(aDrive);
 
@@ -134,15 +135,15 @@
 
 
 	r=file.Create(TheFs,KTestFile1,EFileShareAny|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r = file.Write(TheBuffer,1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	TInt64 newSpace = FreeDiskSpace(aDrive);
 
 	r = TheFs.Delete(KTestFile1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 	TInt64 minFileSize = freeSpace - newSpace;
@@ -216,7 +217,7 @@
 	// initialise removable drive descriptor
 	TChar c;
 	TInt r=RFs::DriveToChar(RemovableDrive,c);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RemovableDriveBuf[0]=(TText)c;
 
 	if( !LffsDrive )
@@ -230,7 +231,7 @@
 	// better format the default drive as long as not WINS c drive
 	TInt drive;
 	r= RFs::CharToDrive(gSessionPath[0],drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #if defined(__WINS__)
 	if(drive!=EDriveC)
 		Format(drive);
@@ -242,18 +243,18 @@
 	TheDiskSize=DiskSize(KDefaultDrive);
 	// and set the default directory
 	r=TheFs.MkDirAll(gSessionPath);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 
 	r=TheFs.Delete(KFileFiller);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	r=TheFs.Delete(KTestFile1);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	r=TheFs.Delete(KTestFile2);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	r=TheFs.RmDir(KTestDir1);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	r=TheFs.RmDir(KTestDir2);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 
 	gMinFileSize = MinimumFileSize(drive);
 	}
@@ -271,7 +272,7 @@
 		TInt r=aFile.Write(TheBuffer,s);
 		if( !LffsDrive )
 			{
-			test(r==KErrNone);
+			test_KErrNone(r);
 			}
 		else
 			{
@@ -326,7 +327,7 @@
 
 		if( !LffsDrive )
 			{
-			test(r==KErrNone);
+			test_KErrNone(r);
 			}
 		else
 			{
@@ -353,17 +354,17 @@
 		{
 		case ETaskMkDir:
 			r=TheFs.RmDir(KTestDir1);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			break;
 		case ETaskRmDir: break;
 		case ETaskDelete: break;
 		case ETaskReplace:
 			r=TheFs.Delete(KTestFile2);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			break;
 		case ETaskFileReplace:
 			r=TheFs.Delete(KTestFile1);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			break;
 		case ETaskFileWrite:
 		case ETaskFileWrite4KB:
@@ -396,15 +397,15 @@
 		case ETaskMkDir:	break;
 		case ETaskRmDir:
 			r=TheFs.MkDir(KTestDir1);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			break;
 		case ETaskDelete:
 			r=file.Create(TheFs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			if( !LffsDrive )
 				{
 				r=file.SetSize(KFileSize1);
-				test(r==KErrNone);
+				test_KErrNone(r);
 				}
 			else
 				{
@@ -416,11 +417,11 @@
 			break;
 		case ETaskReplace:
 			r=file.Create(TheFs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			if( !LffsDrive )
 				{
 				r=file.SetSize(KFileSize1);
-				test(r==KErrNone);
+				test_KErrNone(r);
 				}
 			else
 				{
@@ -428,11 +429,11 @@
 				}
 			file.Close();
 			r=file2.Create(TheFs,KTestFile2,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			if( !LffsDrive )
 				{
 				r=file2.SetSize(KFileSize3);
-				test(r==KErrNone);
+				test_KErrNone(r);
 				}
 			else
 				{
@@ -442,7 +443,7 @@
 			break;
 		case ETaskFileReplace:
 			r=file.Create(TheFs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			if( !LffsDrive )
 				{
 				r=file.SetSize(KFileSize3*2);
@@ -451,7 +452,7 @@
 				{
 				WriteToFile( file, KFileSize3 );
 				}
-			test(r==KErrNone);
+			test_KErrNone(r);
 			file.Close();
 			break;
 		case ETaskFileWrite:
@@ -459,16 +460,16 @@
 		case ETaskFileWrite64KB:
 		case ETaskFileSetSize:
 			r=file.Create(TheFs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			file.Close();
 			break;
 		case ETaskNoChange1:
 			r=file.Create(TheFs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			if( !LffsDrive )
 				{
 				r=file.SetSize(KFileSize1);
-				test(r==KErrNone);
+				test_KErrNone(r);
 				}
 			else
 				{
@@ -478,7 +479,7 @@
 			break;
 		case ETaskNoChange2:
 			r=file.Create(TheFs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			file.Close();
 			break;
 		case ETaskFileCreateLffs:
@@ -497,37 +498,37 @@
 	RTest test(_L("T_DSPACE_ThreadFunction"));
 	RFs fs;
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TThreadTask task=*(TThreadTask*)&aThreadTask;
 	RFile file;
 	switch(task)
 		{
 		case ETaskMkDir:
 			r=fs.MkDir(KTestDir1);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			break;
 		case ETaskRmDir:
 			r=fs.RmDir(KTestDir1);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			break;
 		case ETaskDelete:
 			r=fs.Delete(KTestFile1);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			break;
 		case ETaskReplace:
 			r=fs.Replace(KTestFile1,KTestFile2);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			break;
 		case ETaskFileReplace:
 			r=file.Replace(fs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			file.Close();
 			break;
 		case ETaskFileWrite:
 			r=file.Open(fs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 #if defined(__WINS__)
 			WriteToFile( file, gMinFileSize << 4);	// 512 * 16 = 8K
 #else
@@ -537,35 +538,35 @@
 			break;
 		case ETaskFileWrite4KB:
 			r=file.Open(fs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			WriteToFile(file,gMinFileSize << 3);	// 512 * 2^3 = 512 * 8 = 4K
 			file.Close();
 			break;
 		case ETaskFileWrite64KB:
 			r=file.Open(fs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			WriteToFile(file,gMinFileSize<<7);	// 512 * 2^7 = 512 * 128 = 64K
 			file.Close();
 			break;
 		case ETaskFileSetSize:
 			r=file.Open(fs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			r=file.SetSize(KFileSize3);
 			file.Close();
 			break;
 		case ETaskFileCreateLffs:
 			r=file.Create(fs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			file.Close();
 			break;
 		case ETaskNoChange1:
 			{
 			r=file.Open(fs,KTestFile1,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			TTime time;
 			time.HomeTime();
 			r=file.SetModified(time);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			file.Close();
 			break;
 			}
@@ -573,7 +574,7 @@
 			{
 			TEntry e;
 			r=fs.Entry(KTestFile1,e);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			break;
 			}
 		case ETaskSpin:
@@ -732,13 +733,13 @@
 	// make default directory
 	_LIT(defaultDir,"C:\\F32-TST\\");
 	TInt r=TheFs.MkDirAll(defaultDir);
-	test(r==KErrNone||r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone||r==KErrAlreadyExists);
 	// create the filler file
 	RFile file;
 	TFileName fileName=_L("C:");
 	fileName+=KFileFiller;
 	r=file.Create(TheFs,fileName,EFileShareAny|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt64 free=FreeDiskSpace(EDriveC);
 	// use up 16KB
 	FillDisk(file,free-16384,EDriveC);
@@ -754,11 +755,11 @@
 	RFormat f;
 	TInt count;
 	r=f.Open(TheFs,RemovableDriveBuf,EQuickFormat,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	while(count)
 		{
 		r=f.Next(count);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	f.Close();
 	User::After(1000000);
@@ -772,7 +773,7 @@
 	fName+=RemovableDriveBuf;
 	fName+=_L("F32-TST\\");
 	r=TheFs.MkDirAll(fName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// test that a media change notifies clients on all drives
 	test.Next(_L("media change"));
@@ -806,7 +807,7 @@
 	test.Next(_L("scandrive"));
 	// first test that scandrive does not find any problems on the removable media
 	r=TheFs.ScanDrive(RemovableDriveBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// now set up disk space notification
 	freeC=FreeDiskSpace(EDriveC);
 	freeD=FreeDiskSpace(RemovableDrive);
@@ -816,7 +817,7 @@
 	TheFs.NotifyDiskSpace(freeD-8192,RemovableDrive,stat2);
 	test(stat1==KRequestPending && stat2==KRequestPending);
 	r=TheFs.ScanDrive(RemovableDriveBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::After(1000000);
 	User::WaitForRequest(stat2);
 	test(stat1==KRequestPending && stat2==KErrNone);
@@ -825,11 +826,11 @@
 
 	file.Close();
 	r=TheFs.Delete(fileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if(gSessionPath[0]!=(TText)'C')
 		{
 		r=TheFs.RmDir(defaultDir);
-		test(r==KErrNone||r==KErrInUse);
+		test_Value(r, r == KErrNone||r==KErrInUse);
 		}
 
 	}
@@ -845,7 +846,7 @@
 	// create the filler file
 	RFile file;
 	TInt r=file.Create(TheFs,KFileFiller,EFileShareAny|EFileWrite|EFileWriteDirectIO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt64 newSpace = FreeDiskSpace(KDefaultDrive)-8192;
 	FillDisk(file,newSpace,KDefaultDrive);
 
@@ -860,7 +861,7 @@
 	test(stat1==KRequestPending);
 	RThread thread;
 	r=thread.Create(_L("thread1"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Resume();
 	User::WaitForRequest(stat1);
 	test(stat1==KErrNone);
@@ -885,7 +886,7 @@
 		TheFs.NotifyDiskSpace(threshold,KDefaultDrive,stat1);
 		test(stat1==KRequestPending);
 		r=thread.Create(_L("thread2"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TRequestStatus deathStat;
 		thread.Logon( deathStat );
 		thread.Resume();
@@ -911,7 +912,7 @@
 	TheFs.NotifyDiskSpace(threshold,KDefaultDrive,stat1);
 	test(stat1==KRequestPending);
 	r=thread.Create(_L("thread3"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon( deathStat );
 	thread.Resume();
 
@@ -944,7 +945,7 @@
 	TheFs.NotifyDiskSpace(threshold,KDefaultDrive,stat1);
 	test(stat1==KRequestPending);
 	r=thread.Create(_L("thread4"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon( deathStat );
 	thread.Resume();
 	User::WaitForRequest(stat1);
@@ -980,7 +981,7 @@
 	    test(stat1==KRequestPending);
 
 	    r=thread.Create(_L("thread5"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	    test(r==KErrNone);
+	    test_KErrNone(r);
 	    thread.Logon( deathStat );
 	    thread.Resume();
 
@@ -1004,7 +1005,7 @@
 	    TheFs.NotifyDiskSpace(threshold,KDefaultDrive,stat1);
 	    test(stat1==KRequestPending);
 	    r=thread.Create(_L("thread6"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	    test(r==KErrNone);
+	    test_KErrNone(r);
 	    thread.Logon( deathStat );
 	    thread.Resume();
 	    User::WaitForRequest(stat1);
@@ -1033,15 +1034,15 @@
 		TBuf<10> someFile=_L("?:\\abcdef");
 		TChar c;
 		TInt r=RFs::DriveToChar(RemovableDrive,c);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		someFile[0]=(TText)c;
 #endif
 		_LIT(someDir,"C:\\1234\\");
 
 		r=f2.Create(TheFs,someFile,EFileShareAny|EFileWrite);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFs.MkDir(someDir);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TRequestStatus stat2;
 		TInt64 freeC=FreeDiskSpace(EDriveC);
 		TInt64 freeD=FreeDiskSpace(RemovableDrive);
@@ -1051,7 +1052,7 @@
 		// before fix this would result in iTheDrive not being updated in next subsession call
 		// therefore this could would not result in a disk space notification
 		r=f2.SetSize(8192);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		User::After(1000000);
 		User::WaitForRequest(stat2);
 
@@ -1066,14 +1067,14 @@
 		TheFs.NotifyDiskSpaceCancel();
 		test(stat1==KErrCancel);
 		r=TheFs.Delete(someFile);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFs.RmDir(someDir);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 
 	file.Close();
 	r=TheFs.Delete(KFileFiller);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -1089,7 +1090,7 @@
 	// create the filler file
 	RFile file;
 	TInt r=file.Create(TheFs,KFileFiller,EFileShareAny|EFileWrite|EFileWriteDirectIO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt64 newSpace = FreeDiskSpace(KDefaultDrive)-8192;
 	FillDisk(file,newSpace,KDefaultDrive);
 
@@ -1108,7 +1109,7 @@
 	test(stat1==KRequestPending && stat2==KRequestPending);
 	RThread thread;
 	r=thread.Create(_L("thread7"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TRequestStatus deathStat;
 	thread.Logon( deathStat );
 	thread.Resume();
@@ -1143,7 +1144,7 @@
 	TheFs.NotifyDiskSpace(threshold3,KDefaultDrive,stat3);
 	test(stat1==KRequestPending && stat2==KRequestPending && stat3==KRequestPending);
 	r=thread.Create(_L("thread8"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon( deathStat );
 	thread.SetPriority( EPriorityLess );
 	thread.Resume();	// start spinning, blocks background thread
@@ -1158,7 +1159,7 @@
 	test( KErrNone==r );
 	// create a  file to force some roll-forward
 	r=file2.Create(TheFs,KTestFile1,EFileShareAny|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(stat1);
 	test(stat1==KErrNone);
 	test(stat2==KRequestPending);
@@ -1193,13 +1194,13 @@
 	TheFs.NotifyDiskSpace(threshold3,KDefaultDrive,stat3);
 	test(stat1==KRequestPending && stat2==KRequestPending && stat3==KRequestPending);
 	r=thread.Create(_L("thread9"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon( deathStat );
 	thread.SetPriority( EPriorityLess );
 	thread.Resume();	// start spinning, blocks background thread
 	// create a  file to force some roll-forward
 	r=file2.Create(TheFs,KTestFile1,EFileShareAny|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(stat1);
 	test(stat1==KErrNone);
 	test(stat2==KRequestPending);
@@ -1224,7 +1225,7 @@
 
 	file.Close();
 	r=TheFs.Delete(KFileFiller);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -1236,13 +1237,13 @@
 	// create the filler file
 	RFile file;
 	TInt r=file.Create(TheFs,KFileFiller,EFileShareAny|EFileWrite|EFileWriteDirectIO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt64 free=FreeDiskSpace(KDefaultDrive);
 	TInt64 freeSpaceLeft = gMinFileSize << 4;	// 512 * 2^4 = 512 * 16 = 8K
 	FillDisk(file,free-freeSpaceLeft,KDefaultDrive);
 	TInt size;
 	r=file.Size(size);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(size>1024);
 	test.Printf(_L("filler file size=0x%x\n"),size);
 
@@ -1265,7 +1266,7 @@
 	test(stat1==KRequestPending&&stat2==KRequestPending&&stat3==KRequestPending);
 	RThread thread;
 	r=thread.Create(_L("thread1"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TRequestStatus deathStat;
 	thread.Logon( deathStat );
 	thread.Resume();
@@ -1302,7 +1303,7 @@
 		TheFs.NotifyDiskSpace(threshold3,KDefaultDrive,stat3);
 		test(stat1==KRequestPending&&stat2==KRequestPending&&stat3==KRequestPending);
 		r=thread.Create(_L("thread2"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		thread.Logon( deathStat );
 		thread.Resume();
 		User::After(10000);
@@ -1339,13 +1340,13 @@
 	test.Next(_L("test multiple sessions on same drive"));
 	RFs ses2,ses3;
 	r=ses2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=ses3.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=ses2.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=ses3.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	task=ETaskFileReplace;
 	InitialiseForThread(task);
 	free=FreeDiskSpace(KDefaultDrive);
@@ -1358,7 +1359,7 @@
 	ses3.NotifyDiskSpace(threshold3,KDefaultDrive,stat3);
 	test(stat1==KRequestPending&&stat2==KRequestPending&&stat3==KRequestPending);
 	r=thread.Create(_L("thread3"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon( deathStat );
 	thread.Resume();
 	User::After(1000000);
@@ -1390,7 +1391,7 @@
 		{
 		TInt sessionDrive;
 		r=RFs::CharToDrive(gSessionPath[0],sessionDrive);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		if(sessionDrive!=RemovableDrive)
 			{
 			// first create a file on the removable drive
@@ -1399,9 +1400,9 @@
 			file2name+=_L("F32-TST\\testfile1");
 			TheFs.Delete(file2name);
 			r=file2.Create(TheFs,file2name,EFileShareAny|EFileWrite);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			r=file2.SetSize(KFileSize3);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			// test multiple sessions not notified on disk space change on wrong drive
 			test.Next(_L("test multiple sessions on different drives"));
 			task=ETaskFileReplace;
@@ -1414,7 +1415,7 @@
 			ses2.NotifyDiskSpace(threshold2,RemovableDrive,stat2);
 			test(stat1==KRequestPending&&stat2==KRequestPending);
 			r=thread.Create(_L("thread4"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			thread.Logon( deathStat );
 			thread.Resume();
 			User::After(1000000);
@@ -1431,7 +1432,7 @@
 			test(stat2==KErrCancel);
 			file2.Close();
 			r=TheFs.Delete(file2name);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			}
 		}
 
@@ -1441,7 +1442,7 @@
 
 	file.Close();
 	r=TheFs.Delete(KFileFiller);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -1454,12 +1455,12 @@
 	// create the filler file
 	RFile file;
 	TInt r=file.Create(TheFs,KFileFiller,EFileShareAny|EFileWrite|EFileWriteDirectIO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt64 free=FreeDiskSpace(KDefaultDrive);
 	FillDisk(file,free-8192,KDefaultDrive);
 	TInt size;
 	r=file.Size(size);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("filler file size=0x%x\n"),size);
 
 
@@ -1480,7 +1481,7 @@
 	test(stat1==KRequestPending&&stat2==KRequestPending&&stat3==KRequestPending);
 	RThread thread;
 	r=thread.Create(_L("thread10"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TRequestStatus deathStat;
 	thread.Logon( deathStat );
 //	test.Printf(_L("Resuming other thread"));
@@ -1511,7 +1512,7 @@
 
 	TInt sessionDrive;
 	r=RFs::CharToDrive(gSessionPath[0],sessionDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if(sessionDrive!=EDriveC)
 		{
 		// test multiple sessions not notified on disk space change on wrong drive
@@ -1519,13 +1520,13 @@
 
 		RFs ses2,ses3;
 		r=ses2.Connect();
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=ses3.Connect();
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=ses2.SetSessionPath(gSessionPath);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=ses3.SetSessionPath(gSessionPath);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		// first create a file on the C:\ drive
 		RFile file2;
@@ -1536,7 +1537,7 @@
 		file2name+=_L("testfile1");
 		TheFs.Delete(file2name);
 		r=file2.Create(TheFs,file2name,EFileShareAny|EFileWrite);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		WriteToFile( file2, KFileSize3 );
 
 		task=ETaskFileReplace;
@@ -1549,7 +1550,7 @@
 		ses2.NotifyDiskSpace(threshold2,EDriveC,stat2);
 		test(stat1==KRequestPending&&stat2==KRequestPending);
 		r=thread.Create(_L("thread11"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		thread.Logon( deathStat );
 		thread.Resume();
 		User::After(1000000);
@@ -1567,7 +1568,7 @@
 		test(stat2==KErrCancel);
 		file2.Close();
 		r=TheFs.Delete(file2name);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		ses2.Close();
 		ses3.Close();
 		}
@@ -1576,7 +1577,7 @@
 
 	file.Close();
 	r=TheFs.Delete(KFileFiller);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -1589,7 +1590,7 @@
 	// create a filler file
 	RFile file;
 	TInt r=file.Create(TheFs,KFileFiller,EFileShareAny|EFileWrite|EFileWriteDirectIO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt64 free=FreeDiskSpace(KDefaultDrive);
 	// use 8KB in filler file
 	FillDisk(file,free-8192,KDefaultDrive);
@@ -1608,7 +1609,7 @@
 	test(stat1==KRequestPending&&stat2==KRequestPending&&stat3==KRequestPending);
 	RThread thread;
 	r=thread.Create(_L("thread1"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TRequestStatus deathStat;
 	thread.Logon( deathStat );
 	thread.Resume();
@@ -1635,13 +1636,13 @@
 	test.Next(_L(" test change notification and disk space notification"));
 	RFs session2,session3;
 	r=session2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=session3.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=session2.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=session3.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	task=ETaskFileWrite;
 	InitialiseForThread(task);
 	free=FreeDiskSpace(KDefaultDrive);
@@ -1651,7 +1652,7 @@
 	session3.NotifyChange(ENotifyAll,stat3,KTestFile1);
 	test(stat1==KRequestPending&&stat2==KRequestPending&&stat3==KRequestPending);
 	r=thread.Create(_L("thread2"),ThreadFunction,KStackSize,KHeapSize,KHeapSize,(TAny*)task);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon( deathStat );
 	thread.Resume();
 	User::After(1000000);
@@ -1692,7 +1693,7 @@
 
 	file.Close();
 	r=TheFs.Delete(KFileFiller);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -1734,7 +1735,7 @@
 		}
 	//Test uses C drive as secondary drive so test can't be tested on that drive
 	r = TheFs.CharToDrive(gSessionPath[0], driveNumber);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	if(driveNumber == EDriveC)
 		{
 		test.Printf(_L("Test uses C drive as secondary drive so test can't be test on C drive, test will exit"));
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_ext1.cpp
--- a/kerneltest/f32test/server/t_ext1.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_ext1.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32svr.h>
@@ -46,17 +47,17 @@
 	test.Next(_L("TestSecondaryExtensions()"));
 	TInt drive;
 	TInt err=RFs::CharToDrive(gDriveToTest,drive);
-	test(err==KErrNone);
+	test_KErrNone(err);
 	
 	TPckgBuf<TBool> drvSyncBuf;
 	err = TheFs.QueryVolumeInfoExt(drive, EIsDriveSync, drvSyncBuf);
-	test(err==KErrNone);
+	test_KErrNone(err);
 	const TBool bDrvSync = drvSyncBuf();
 			
 
 	TFullName fsName;
 	TInt r=TheFs.FileSystemName(fsName,drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("fsName=%S\n"),&fsName);
 
 #if defined(__WINS__)
@@ -64,11 +65,11 @@
 		{
 		// check that the extension cannot be mounted since not supported by the file system
 		r=TheFs.AddExtension(KExtensionLog);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFs.MountExtension(KExtensionLogName,drive);
-		test(r==KErrNotSupported);
+		test_Value(r, r == KErrNotSupported);
 		r=TheFs.RemoveExtension(KExtensionLogName);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		return;
 		}
 #endif
@@ -76,68 +77,68 @@
 	test.Next(_L("RFs::AddExtension()"));
 	r=TheFs.AddExtension(KExtensionLog);
 	RDebug::Print(_L("addext=%d"),r);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.AddExtension(KExtensionLog);
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 	r=TheFs.AddExtension(KExtensionRubbish);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.AddExtension(KExtensionEmpty);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("RFs::MountExtension()"));
 #if !defined(__WINS__)
 	// check that the extension cannot be mounted on file system that does not support extensions
 	r=TheFs.MountExtension(KExtensionLogName,EDriveZ);
-	test(r==KErrNotSupported);
+	test_Value(r, r == KErrNotSupported);
 #endif
 	// test mounting on drive with no file system
 	r=TheFs.DismountFileSystem(fsName,drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MountExtension(KExtensionLogName,drive);
-	test(r==KErrNotReady);
+	test_Value(r, r == KErrNotReady);
 	r=TheFs.MountFileSystem(fsName,drive,bDrvSync);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// test with a resource open
 	_LIT(KFileName,"testing.doc");
 	RFile file;
 	r=file.Replace(TheFs,KFileName,EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MountExtension(KExtensionLogName,drive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	file.Close();
 	r=TheFs.Delete(KFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// test with a format open
 	TBuf<4> driveBuf=_L("?:\\");
 	driveBuf[0]=(TText)(drive+'A');
 	RFormat format;
 	TInt count;
 	r=format.Open(TheFs,driveBuf,EHighDensity,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MountExtension(KExtensionLogName,drive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	format.Close();
 	// get the extension name
 	TFullName extName;
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	// now load the extension
 	r=TheFs.MountExtension(KExtensionLogName,drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNone && extName==KExtensionLogName);
+	test_Value(r, r == KErrNone && extName==KExtensionLogName);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	// try remounting the same extension
 	r=TheFs.MountExtension(KExtensionLogName,drive);
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 	// mount a second extension
 	r=TheFs.MountExtension(KExtensionEmptyName,drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNone && extName==KExtensionLogName);
+	test_Value(r, r == KErrNone && extName==KExtensionLogName);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNone && extName==KExtensionEmptyName);
+	test_Value(r, r == KErrNone && extName==KExtensionEmptyName);
 	
     // force a remount on a removable media and check that extensions both exist
     test.Printf(_L("Test forcing remount\n"));
@@ -153,7 +154,7 @@
 
         test.Printf(_L("Remounting the drive\n"), r);
         r = TheFs.RemountDrive(drive, NULL, (TUint) KMediaRemountForceMediaChange);
-        test(r == KErrNotReady || r == KErrNone);
+        test_Value(r, r == KErrNotReady || r == KErrNone);
         
         do
         {
@@ -181,7 +182,7 @@
     	RLocalDrive d;
 		TBool flag=EFalse;
 		r=d.Connect(1,flag);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		d.ForceMediaChange();
 		d.Close();
 //#if defined(__WINS__)
@@ -195,9 +196,9 @@
 
 
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNone && extName==KExtensionLogName);
+	test_Value(r, r == KErrNone && extName==KExtensionLogName);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNone && extName==KExtensionEmptyName);
+	test_Value(r, r == KErrNone && extName==KExtensionEmptyName);
 
     test.Printf(_L("Accessing media...\n"));
 	// and now do some file system operations
@@ -207,64 +208,64 @@
     test.Printf(_L("res=%d\n"), r);
 
 
-	test(r==KErrNone||r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone||r==KErrAlreadyExists);
 	RFile file1;
 	r=file1.Replace(TheFs,file1Name,EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file1.Write(toWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file1.Read(0,readBuf);
 	test(readBuf==toWrite);
 	r=file1.SetSize(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	r=TheFs.Delete(file1Name);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(dir1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("RFs::DismountExtension()"));
 	// test with a resource open
 	r=file.Replace(TheFs,KFileName,EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.DismountExtension(KExtensionLogName,drive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	file.Close();
 	r=TheFs.Delete(KFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// test with a format open
 	r=format.Open(TheFs,driveBuf,EHighDensity,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.DismountExtension(KExtensionLogName,drive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	format.Close();
 	// now dismount an extension
 	r=TheFs.DismountExtension(KExtensionLogName,drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNone && extName==KExtensionEmptyName);
+	test_Value(r, r == KErrNone && extName==KExtensionEmptyName);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	// try to dismount an extension that is not mounted
 	r=TheFs.DismountExtension(KExtensionLogName,drive);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNone && extName==KExtensionEmptyName);
+	test_Value(r, r == KErrNone && extName==KExtensionEmptyName);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	// dismount the remaining extension
 	r=TheFs.DismountExtension(KExtensionEmptyName,drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 
 	test.Next(_L("RFs::RemoveExtension()"));
 	r=TheFs.RemoveExtension(KExtensionLogName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RemoveExtension(KExtensionEmptyName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 void TestPrimaryExtensions()
@@ -276,7 +277,7 @@
 	test.Next(_L("TestPrimaryExtensions()"));
 	TInt drive;
 	TInt err=RFs::CharToDrive(gDriveToTest,drive);
-	test(err==KErrNone);
+	test_KErrNone(err);
 
 #if defined(__WINS__)
 	if(drive==EDriveC)
@@ -285,7 +286,7 @@
 
 	TPckgBuf<TBool> drvSyncBuf;
 	err = TheFs.QueryVolumeInfoExt(drive, EIsDriveSync, drvSyncBuf);
-	test(err==KErrNone);
+	test_KErrNone(err);
     const TBool bDrvSync = drvSyncBuf();
 
 	// don't test on ram drive since accesses memory directly
@@ -296,142 +297,142 @@
 
 	TFullName fsName;
 	r=TheFs.FileSystemName(fsName,drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("fsName=%S\n"),&fsName);
 
 	test.Next(_L("RFs::AddExtension()"));
 	r=TheFs.AddExtension(KExtensionLog);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.AddExtension(KExtensionEmpty);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.AddExtension(KExtensionBit);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("RFs::MountFileSystem()"));
 	// test with file system that already exists
 	r=TheFs.MountFileSystem(fsName,KExtensionBitName,drive,bDrvSync);
-	test(r==KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 	// unmount drive and mount primary extension along with file system
 	r=TheFs.DismountFileSystem(fsName,drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     //-- !! N.B this extension mangles data read/written ftom/to the media, for some file systems it is OK and mounting succeeds
     //-- for others - this will result in KErrCorrupt
 	r=TheFs.MountFileSystem(fsName,KExtensionBitName,drive,bDrvSync);
-	test(r==KErrNone||r==KErrCorrupt);
+	test_Value(r, r == KErrNone||r==KErrCorrupt);
 	
     // and now format
 	Format(drive);
 	TFullName extName;
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNone && extName==KExtensionBitName);
+	test_Value(r, r == KErrNone && extName==KExtensionBitName);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	
 	// and now do some file system operations
 	TBuf8<16> readBuf;
 	r=TheFs.MkDir(dir1);
-	test(r==KErrNone||r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone||r==KErrAlreadyExists);
 	RFile file1;
 	r=file1.Replace(TheFs,file1Name,EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file1.Write(toWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file1.Read(0,readBuf);
 	test(readBuf==toWrite);
 	r=file1.SetSize(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	r=TheFs.Delete(file1Name);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(dir1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// add a secondary extension
 	test.Printf(_L("RFs::MountExtension()"));
 	r=TheFs.MountExtension(KExtensionLogName,drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNone && extName==KExtensionBitName);
+	test_Value(r, r == KErrNone && extName==KExtensionBitName);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNone && extName==KExtensionLogName);
+	test_Value(r, r == KErrNone && extName==KExtensionLogName);
 	// try to add the same extension
 	r=TheFs.MountExtension(KExtensionBitName,drive);
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNone && extName==KExtensionBitName);
+	test_Value(r, r == KErrNone && extName==KExtensionBitName);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNone && extName==KExtensionLogName);
+	test_Value(r, r == KErrNone && extName==KExtensionLogName);
 	// try to add a third extension
 	r=TheFs.MountExtension(KExtensionEmptyName,drive);
-	test(r==KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNone && extName==KExtensionBitName);
+	test_Value(r, r == KErrNone && extName==KExtensionBitName);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNone && extName==KExtensionLogName);
+	test_Value(r, r == KErrNone && extName==KExtensionLogName);
 
 	// and now do some file system operations
 	r=TheFs.MkDir(dir1);
-	test(r==KErrNone||r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone||r==KErrAlreadyExists);
 	r=file1.Replace(TheFs,file1Name,EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file1.Write(toWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file1.Read(0,readBuf);
 	test(readBuf==toWrite);
 	r=file1.SetSize(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 	r=TheFs.Delete(file1Name);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(dir1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("RFs::DismountExtension()"));
 	// test that can't dismount a primary extension via this method
 	r=TheFs.DismountExtension(KExtensionLogName,drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNone && extName==KExtensionBitName);
+	test_Value(r, r == KErrNone && extName==KExtensionBitName);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.DismountExtension(KExtensionBitName,drive);
-	test(r==KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNone && extName==KExtensionBitName);
+	test_Value(r, r == KErrNone && extName==KExtensionBitName);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	
 	test.Printf(_L("RFs::DismountFileSystem()"));
 	r=TheFs.MountExtension(KExtensionLogName,drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNone && extName==KExtensionBitName);
+	test_Value(r, r == KErrNone && extName==KExtensionBitName);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNone && extName==KExtensionLogName);
+	test_Value(r, r == KErrNone && extName==KExtensionLogName);
 	// and now dismount
 	r=TheFs.DismountFileSystem(fsName,drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNotReady);
+	test_Value(r, r == KErrNotReady);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNotReady);
+	test_Value(r, r == KErrNotReady);
 	// remount the file system
 	r=TheFs.MountFileSystem(fsName,drive,bDrvSync);
-	test(r==KErrNone||r==KErrCorrupt);
+	test_Value(r, r == KErrNone||r==KErrCorrupt);
 	r=TheFs.ExtensionName(extName,drive,0);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.ExtensionName(extName,drive,1);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	Format(drive);
 
 	test.Next(_L("RFs::RemoveExtension()"));
 	r=TheFs.RemoveExtension(KExtensionLogName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RemoveExtension(KExtensionEmptyName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RemoveExtension(KExtensionBitName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -446,8 +447,21 @@
     TInt drive;
 	TInt err=RFs::CharToDrive(gDriveToTest,drive);
 	test.Start(_L("Starting Test - T_EXT1"));
-	test(err==KErrNone);
+	test_KErrNone(err);
 
+	// Check that the drive supports extensions.
+	TBool extensionsSupported = EFalse;
+	TPckg<TBool> dataBuf(extensionsSupported);
+	err = TheFs.QueryVolumeInfoExt(drive,EFSysExtensionsSupported,dataBuf);
+	test_KErrNone(err);
+	if(!extensionsSupported)
+	    {
+        test.Printf(_L("Drive %d does not support file sys extensions. Skipping test."), drive);
+        test.End();
+        test.Close();
+        return;
+	    }
+	
     PrintDrvInfo(TheFs, drive);
 
 //Do not run this test on the NAND drive, as
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_fatcharsetconv_aux.cpp
--- a/kerneltest/f32test/server/t_fatcharsetconv_aux.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_fatcharsetconv_aux.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -50,11 +50,11 @@
 	RFormat format;
 	TInt count;
 	TInt r=format.Open(TheFs,driveBuf,EQuickFormat,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	while(count)
 		{
 		TInt r=format.Next(count);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	format.Close();
 	}
@@ -65,7 +65,7 @@
 //
 	{
 	TInt r=TheFs.MkDirAll(aDirName);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	}
 
 
@@ -94,11 +94,11 @@
 	TParsePtrC path(aSessionPath);
 	test(path.DrivePresent()==EFalse);
 	TInt r=TheFs.SetSessionPath(aSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MkDirAll(gSessionPath);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	}
 
 TInt CurrentDrive(TChar aDriveChar)
@@ -108,7 +108,7 @@
 	{
 	TInt driveNum;
 	TInt r = TheFs.CharToDrive(aDriveChar,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	gDriveToTest = gSessionPath[0] = (TText)aDriveChar;
 	return(driveNum);
 	}
@@ -120,7 +120,7 @@
 	{
 	TInt driveNum;
 	TInt r = TheFs.CharToDrive(gSessionPath[0],driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return(driveNum);
 	}
 
@@ -131,20 +131,20 @@
 	{
 	RFile file;
 	TInt r=file.Replace(TheFs,aFileName,0);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	if (r==KErrPathNotFound)
 		{
 		r=TheFs.MkDirAll(aFileName);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.Replace(TheFs,aFileName,0);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	TCheckedUid checkedUid(aUidType);
 	TPtrC8 uidData((TUint8*)&checkedUid,sizeof(TCheckedUid));
 	r=file.Write(uidData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(aFileContents);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	}
 
@@ -160,16 +160,16 @@
 		test.Printf(_L("ERROR: r=%d"),r);
 		test(EFalse);
 		}
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	if (r==KErrPathNotFound)
 		{
 		r=TheFs.MkDirAll(aFileName);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.Replace(TheFs,aFileName,0);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	r=file.Write(aFileContents);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	}
 
@@ -180,17 +180,17 @@
 	{
 	RFile file;
 	TInt r=file.Replace(TheFs,aFileName,0);
-	test(r==KErrNone || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);
 	if (r==KErrPathNotFound)
 		{
 		r=TheFs.MkDirAll(aFileName);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.Replace(TheFs,aFileName,0);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	file.Close();
 	r=TheFs.SetAtt(aFileName,anAttributes,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 void MakeFile(const TDesC& aFileName)
@@ -210,7 +210,7 @@
 void ReadBootSector(TFatBootSector& aBootSector)
 	{
     TInt r = ReadBootSector(TheFs, CurrentDrive(), KBootSectorNum<<KDefaultSectorLog2, aBootSector);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     if(!aBootSector.IsValid())
         {
@@ -558,9 +558,9 @@
 	TFileName filename_dir = aDirName;
 	TInt r = 0;
 	r = TheFs.SetAtt(filename_dir, 0, KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=gFileMan->RmDir(filename_dir);
-	test(r==KErrNone || r==KErrNotFound || r==KErrPathNotFound || r==KErrInUse);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrPathNotFound || r==KErrInUse);
 	}
 
 // Cleanup test variables
@@ -788,7 +788,7 @@
 	logFileName.Append(KExtension);
 
 	TInt r = file.Create(TheFs, logFileName, EFileRead|EFileWrite);
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 
 	if (r == KErrNone)
 		{
@@ -799,10 +799,10 @@
 	if (r == KErrAlreadyExists)
 		{
 		r = file.Open(TheFs, logFileName, EFileRead|EFileWrite);
-		test(r == KErrNone);
+		test_KErrNone(r);
 		TInt start = 0;
 		r=file.Seek(ESeekEnd,start);
-		test(r == KErrNone);
+		test_KErrNone(r);
 		}
 	
 	tempBuf.SetLength(0);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_fatcharsetconv_aux.h
--- a/kerneltest/f32test/server/t_fatcharsetconv_aux.h	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_fatcharsetconv_aux.h	Thu Jun 10 11:48:01 2010 +0100
@@ -17,7 +17,7 @@
 
 #ifndef T_FATCHARSETCONV_AUX_H
 #define T_FATCHARSETCONV_AUX_H
-
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <hal.h>
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_fatcharsetconv_main.cpp
--- a/kerneltest/f32test/server/t_fatcharsetconv_main.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_fatcharsetconv_main.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1188,11 +1188,11 @@
 	{
 	// Enables codepage dll implementation of LocaleUtils functions for this test only
 	TInt r = TheFs.ControlIo(CurrentDrive(), KControlIoEnableFatUtilityFunctions);
-	test(r == KErrNone);
+	test_KErrNone(r);
 		
 	test.Printf(_L("Load the Code Page DLL"));
 	r = UserSvr::ChangeLocale(KTestLocale);
-	test(r == KErrNone);
+	test_KErrNone(r);
 			
 	test.Next(_L("Test Unitary APIs with only Sync Variant with DLL"));
 	gLogFailureData.iFuncName = KDoAllBasicUnitaryTestsL;
@@ -1204,7 +1204,7 @@
 	
 	// Disables codepage dll implementation of LocaleUtils functions for other base tests
 	r = TheFs.ControlIo(CurrentDrive(), KControlIoDisableFatUtilityFunctions);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 	
 void TestMainWithoutDLLL(TTestSwitches& aSwitches)
@@ -1213,7 +1213,7 @@
 
 	// Disables codepage dll implementation of LocaleUtils functions
 	TInt r = TheFs.ControlIo(CurrentDrive(), KControlIoDisableFatUtilityFunctions);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	gLogFailureData.iFuncName = KDoAllBasicUnitaryTestsL;
 	DoAllBasicUnitaryTestsL(gBasicUnitaryTestCases, aSwitches, EFalse);
@@ -1410,10 +1410,10 @@
 	gSessionPath=_L("?:\\F32-TST\\");
 	TChar driveLetter;
 	TInt r=TheFs.DriveToChar(aDrive,driveLetter);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	gSessionPath[0]=(TText)driveLetter;
 	r=TheFs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("gSessionPath = \"%S\"\n"), &gSessionPath);
 
 // !!! Disable platform security tests until we get the new APIs
@@ -1429,7 +1429,7 @@
 		{
 		Format(aDrive);
 		r=TheFs.MkDirAll(gSessionPath);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	if (r!=KErrNone && r!=KErrAlreadyExists)
 		{
@@ -1469,7 +1469,7 @@
 	ParseCommandArguments(testSwitches);
 
 	r=TheFs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TheFs.SetAllocFailure(gAllocFailOn);
 
 	TTime timerC;
@@ -1477,13 +1477,13 @@
 
 	TInt theDrive;
 	r=TheFs.CharToDrive(gDriveToTest,theDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 #if defined(_DEBUG) || defined(_DEBUG_RELEASE)
 	TPckgBuf<TIOCacheValues> pkgOrgValues;
 	TIOCacheValues& orgValues=pkgOrgValues();
 	r = controlIo(TheFs,theDrive, KControlIoCacheCount, orgValues);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("\n"));
 	test.Printf(_L("Requests on close queue at start=%d\n"),orgValues.iCloseCount);
@@ -1498,7 +1498,7 @@
 	endTimeC.HomeTime();
 	TTimeIntervalSeconds timeTakenC;
 	r=endTimeC.SecondsFrom(timerC,timeTakenC);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("Time taken for test = %d seconds\n"),timeTakenC.Int());
 	TheFs.SetAllocFailure(gAllocFailOff);
@@ -1507,7 +1507,7 @@
 	TPckgBuf<TIOCacheValues> pkgValues;
 	TIOCacheValues& values=pkgValues();
 	r = controlIo(TheFs,theDrive, KControlIoCacheCount, values);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	test.Printf(_L("Requests on close queue at end=%d\n"),values.iCloseCount);
 	test.Printf(_L("Requests on free queue at end=%d\n"),values.iFreeCount);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_file.cpp
--- a/kerneltest/f32test/server/t_file.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_file.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -50,10 +50,10 @@
 
 	RFile f1;
 	TInt r=f1.Open(TheFs,_L("TESTER"),EFileRead|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFile f2;
 	r=f2.Open(TheFs,_L("TESTER"),EFileWrite|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=f2.Write(_L("0"));
 	test.Printf(_L("returned %d"),r);
@@ -62,49 +62,49 @@
 	f2.Close();
 
 	r=TheFs.Delete(_L("TESTER"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 */
 
 	RFile f1;
 	TInt r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFile f2;
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareExclusive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareAny);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	f1.Close();
 	r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileWrite|EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f1.Close();
 
 	test.Next(_L("Test readers only sharing"));
 	r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileWrite|EFileShareReadersOnly);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareExclusive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareAny);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileWrite|EFileShareReadersOnly);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f1.Close();
 	f2.Close();
 
 	test.Next(_L("Test any sharing"));
 	r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileWrite|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareExclusive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f1.Close();
 	f2.Close();
 
@@ -121,63 +121,63 @@
 	RFile f1;
 	RFile f2;
 	TInt r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareExclusive);
-	test(r==KErrNone); // Opened exclusive
+	test_KErrNone(r); // Opened exclusive
 	r=f1.ChangeMode(EFileShareReadersOnly);
-	test(r==KErrNone); // Change to readers only
+	test_KErrNone(r); // Change to readers only
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone); // Open as reader
+	test_KErrNone(r); // Open as reader
 	r=f1.ChangeMode(EFileShareExclusive);
-	test(r==KErrAccessDenied); // Change back to exclusive fails
+	test_Value(r, r == KErrAccessDenied); // Change back to exclusive fails
 	r=f2.ChangeMode(EFileShareExclusive);
-	test(r==KErrAccessDenied); // Change to exclusive fails
+	test_Value(r, r == KErrAccessDenied); // Change to exclusive fails
 	f1.Close(); // Close other reader
 	r=f2.ChangeMode(EFileShareExclusive);
-	test(r==KErrNone); // Change to exclusive succeeds.
+	test_KErrNone(r); // Change to exclusive succeeds.
 	f2.Close();
 
 	r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone); // Opened readers only
+	test_KErrNone(r); // Opened readers only
 	r=f1.ChangeMode(EFileShareExclusive);
-	test(r==KErrNone); // Change to exclusive
+	test_KErrNone(r); // Change to exclusive
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrInUse); // Open as reader fails
+	test_Value(r, r == KErrInUse); // Open as reader fails
 	r=f1.ChangeMode(EFileShareReadersOnly);
-	test(r==KErrNone); // Change to readers only
+	test_KErrNone(r); // Change to readers only
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone); // Open as reader
+	test_KErrNone(r); // Open as reader
 	r=f1.ChangeMode(EFileShareExclusive);
-	test(r==KErrAccessDenied); // Change back to exclusive fails
+	test_Value(r, r == KErrAccessDenied); // Change back to exclusive fails
 	r=f2.ChangeMode(EFileShareExclusive);
-	test(r==KErrAccessDenied); // Change to exclusive fails
+	test_Value(r, r == KErrAccessDenied); // Change to exclusive fails
 	f1.Close(); // Close other reader
 	r=f2.ChangeMode(EFileShareExclusive);
-	test(r==KErrNone); // Change to exclusive succeeds.
+	test_KErrNone(r); // Change to exclusive succeeds.
 	f2.Close();
 
 	r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileWrite|EFileShareExclusive);
-	test(r==KErrNone); // Opened exclusive for writing
+	test_KErrNone(r); // Opened exclusive for writing
 	r=f1.ChangeMode(EFileShareReadersOnly);
-	test(r==KErrAccessDenied); // Change to readers fails
+	test_Value(r, r == KErrAccessDenied); // Change to readers fails
 	r=f1.ChangeMode(EFileShareExclusive);
-	test(r==KErrNone); // No change ok
+	test_KErrNone(r); // No change ok
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrInUse); // Open as reader fails
+	test_Value(r, r == KErrInUse); // Open as reader fails
 	f1.Close();
 
 	r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareAny);
-	test(r==KErrNone); // Opened share any
+	test_KErrNone(r); // Opened share any
 	r=f1.ChangeMode(EFileShareExclusive);
-	test(r==KErrAccessDenied); // Change to exclusive fails
+	test_Value(r, r == KErrAccessDenied); // Change to exclusive fails
 	r=f1.ChangeMode(EFileShareReadersOnly);
-	test(r==KErrAccessDenied); // Change to readers only fails
+	test_Value(r, r == KErrAccessDenied); // Change to readers only fails
 	f1.Close();
 
 	r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareExclusive);
-	test(r==KErrNone); // Opened exclusive
+	test_KErrNone(r); // Opened exclusive
 	r=f1.ChangeMode(EFileShareAny);
-	test(r==KErrArgument); // Change to share any fails KErrArgument
+	test_Value(r, r == KErrArgument); // Change to share any fails KErrArgument
 	r=f1.ChangeMode((TFileMode)42);
-	test(r==KErrArgument); // Change to random value fails
+	test_Value(r, r == KErrArgument); // Change to random value fails
 	f1.Close();
 	test.End();
 	}
@@ -191,44 +191,44 @@
 	test.Start(_L("Test read file"));
 	RFile f,ZFile;
 	TInt r=f.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName fn = _L("Z:\\TEST\\T_FILE.CPP");
 	fn[0] = gExeFileName[0];
 	r=ZFile.Open(TheFs,fn,EFileStreamText);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Read file"));
 	TBuf8<0x100> a,b;
 	FOREVER
 		{
 		r=f.Read(b);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=ZFile.Read(a);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(a==b);
 		if (b.Length()<b.MaxLength())
 			break;
 		}
 	b.SetLength(10);
 	r=f.Read(b);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(b.Length()==0);
 	f.Close();
 	ZFile.Close();
 
 	test.Next(_L("Read way beyond the end of the file"));
 	r=f.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Read(3000000,gBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 
 	test.Next(_L("Write way beyond the end of the file"));
 	r=f.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	gBuf.SetLength(10);
 	r=f.Write(3000000,gBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	test.End();
 	}
@@ -242,20 +242,20 @@
 	test.Start(_L("Test multiple read file"));
 	RFile f1;
 	TInt r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFile f2;
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Read file"));
 	FOREVER
 		{
 		TBuf8<0x100> b1;
 		r=f1.Read(b1);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TBuf8<0x100> b2;
 		r=f2.Read(b2);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(b1==b2);
 		if (b1.Length()<b1.MaxLength())
 			break;
@@ -280,68 +280,68 @@
 
 	// write test 1
 	TInt r=file.Replace(TheFs,fn,EFileStreamText);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Write file"));
 
 	r=file.Write(testData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	file.Close();
 
 	// test write modes
 	// test writing with EFileRead
 	r=file.Open(TheFs,fn,EFileStreamText|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Write file"));
 	r=file.Write(testData);
-	test(r==KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 	file.Close();
 
 	// test writing with EFileWrite
 	r=file.Open(TheFs,fn,EFileStreamText|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Write file"));
 	r=file.Write(testData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	// test writing with share mode EFileShareExclusive
 	r=file.Open(TheFs,fn,EFileStreamText|EFileWrite|EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Write file"));
 	r=file.Write(testData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	// test writing with share mode EFileShareReadersOnly (fails with KErrArgument)
 	r=file.Open(TheFs,fn,EFileStreamText|EFileWrite|EFileShareReadersOnly);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 
 	// test writing with share mode EFileShareReadersOrWriters
 	r=file.Open(TheFs,fn,EFileStreamText|EFileWrite|EFileShareReadersOrWriters);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Write file"));
 	r=file.Write(testData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	// test writing with share mode EFileShareAny
 	r=file.Open(TheFs,fn,EFileStreamText|EFileWrite|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Write file"));
 	r=file.Write(testData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	// tidy up
 	r=TheFs.Delete(fn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.End();
 	}
@@ -357,30 +357,30 @@
 	TParse f;
 	TInt r;
 	r=TheFs.Parse(fn,f);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TParse fCopy;
 	r=TheFs.Parse(f.NameAndExt(),fCopy);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile f1;
 	r=f1.Open(TheFs,f.FullName(),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFile f2;
 	r=f2.Replace(TheFs,fCopy.FullName(),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<512> copyBuf;
 	TInt rem;
 	r=f1.Size(rem);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt pos=0;
 	while (rem)
 		{
 		TInt s=Min(rem,copyBuf.MaxSize());
 		r=f1.Read(pos,copyBuf,s);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(copyBuf.Length()==s);
 		r=f2.Write(pos,copyBuf,s);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		pos+=s;
 		rem-=s;
 		}
@@ -404,26 +404,26 @@
 
 	RFile f;
 	TInt r=f.Replace(TheFs,_L("TEXTFILE.TXT"),0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileText textFile;
 	textFile.Set(f);
 	TInt i=0;
 	for (i=0;i<5;i++)
 		{
 		r=textFile.Write(record[i]);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	r=textFile.Seek(ESeekStart);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf<16> recBuf;
 	for(i=0;i<5;i++)
 		{
 		r=textFile.Read(recBuf);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(recBuf==record[i]);
 		}
 	r=textFile.Read(recBuf);
-	test(r==KErrEof);
+	test_Value(r, r == KErrEof);
 	test(recBuf.Length()==0);
 	f.Close();
 
@@ -445,36 +445,36 @@
 	trecord[5].Set((TUint8*)tTextrecord[5].Ptr(),tTextrecord[5].Length()*sizeof(TText));
 	trecord[6].Set((TUint8*)tTextrecord[6].Ptr(),tTextrecord[6].Length()*sizeof(TText));
 	r=f.Replace(TheFs,_L("TEXTFILE.TXT"),0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	for(i=0;i<7;i++)
 		{
 		TBuf8<256> buf;
 		buf.Copy(trecord[i]);
 		r=f.Write(buf);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	textFile.Set(f);
 	textFile.Seek(ESeekStart);
 	for(i=0;i<5;i++)
 		{
 		r=textFile.Read(recBuf);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(recBuf==record[i]);
 		}
 	r=textFile.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf==_L("Sixth record"));
 	r=textFile.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf==_L("\rSeventh record"));
 	r=textFile.Read(recBuf);
-	test(r==KErrEof);
+	test_Value(r, r == KErrEof);
 	test(recBuf.Length()==0);
 	f.Close();
 
 	test.Next(_L("Test read with bufferSize == dataSize"));
 	r=f.Replace(TheFs,_L("TEXTFILE.TXT"),0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	record[0].Set(_L("1234567890123456"));
 //	trecord[0].Set(_L8("1234567890123456\r\n"));
 //	trecord[1].Set(_L8("1234567890123456\n"));
@@ -489,37 +489,37 @@
 	for (i=0;i<2;i++)
 		{
 		r=f.Write(trecord[i]);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	textFile.Set(f);
 	textFile.Seek(ESeekStart);
 	for(i=0;i<2;i++)
 		{
 		r=textFile.Read(recBuf);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(recBuf==record[0]);
 		}
 	r=textFile.Read(recBuf);
-	test(r==KErrEof);
+	test_Value(r, r == KErrEof);
 	test(recBuf.Length()==0);
 	f.Close();
 
 	test.Next(_L("Read into a buffer < recordSize"));
 	TBuf<8> smallBuf;
 	r=f.Open(TheFs,_L("TEXTFILE.txt"),0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	textFile.Set(f);
 	for(i=0;i<2;i++)
 		{
 		r=textFile.Read(smallBuf);
-		test(r==KErrTooBig);
+		test_Value(r, r == KErrTooBig);
 		test(smallBuf==_L("12345678"));
 		}
 	f.Close();
 
 	test.Next(_L("Nasty cases: 1) \\r \\n split over buffer boundary"));
 	r=f.Replace(TheFs,_L("TEXTFILE.txt"),0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	HBufC* largeRecord=HBufC::NewL(600);
 	largeRecord->Des().SetLength(250);
 	largeRecord->Des().Fill('A');
@@ -527,96 +527,96 @@
 	TPtrC8 bufPtr;
 	bufPtr.Set((TUint8*)largeRecord->Ptr(),largeRecord->Size()); // Size() returns length in bytes
 	r=f.Write(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf<16> boundaryBuf=_L("12345\r\n");
 	bufPtr.Set((TUint8*)boundaryBuf.Ptr(),boundaryBuf.Size());
 	r=f.Write(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Write(trecord[0]);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	textFile.Set(f);
 	textFile.Seek(ESeekStart);
 	r=textFile.Read(recBuf);
-	test(r==KErrTooBig);
+	test_Value(r, r == KErrTooBig);
 	test(recBuf==_L("AAAAAAAAAAAAAAAA"));
 	r=textFile.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf==_L("12345"));
 	r=textFile.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf==record[0]);
 	f.Close();
 
 	test.Next(_L("Nasty cases: 2) \\r on buffer boundary"));
 	r=f.Replace(TheFs,_L("TEXTFILE.txt"),0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	largeRecord->Des().SetLength(250);
 	largeRecord->Des().Fill('A');
 	largeRecord->Des()[249]='\n';
 	bufPtr.Set((TUint8*)largeRecord->Ptr(),largeRecord->Size());
 	r=f.Write(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	boundaryBuf=_L("12345\rxyz\n");
 	bufPtr.Set((TUint8*)boundaryBuf.Ptr(),boundaryBuf.Size());
 	r=f.Write(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Write(trecord[0]);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	textFile.Set(f);
 	textFile.Seek(ESeekStart);
 	r=textFile.Read(recBuf);
-	test(r==KErrTooBig);
+	test_Value(r, r == KErrTooBig);
 	test(recBuf==_L("AAAAAAAAAAAAAAAA"));
 	r=textFile.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf==_L("12345\rxyz"));
 	r=textFile.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf==record[0]);
 	f.Close();
 
 	test.Next(_L("Nasty cases: 3) record size > buffer size"));
 	r=f.Replace(TheFs,_L("TEXTFILE.txt"),0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	largeRecord->Des().SetLength(600);
 	largeRecord->Des().Fill('Z');
 	largeRecord->Des()[511]='\r';
 	largeRecord->Des()[599]='\n';
 	bufPtr.Set((TUint8*)largeRecord->Ptr(),largeRecord->Size());
 	r=f.Write(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	boundaryBuf=_L("12345\rxyz\n");
 	bufPtr.Set((TUint8*)boundaryBuf.Ptr(),boundaryBuf.Size());
 	r=f.Write(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Write(trecord[0]);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	textFile.Set(f);
 	textFile.Seek(ESeekStart);
 	r=textFile.Read(recBuf);
-	test(r==KErrTooBig);
+	test_Value(r, r == KErrTooBig);
 	test(recBuf==_L("ZZZZZZZZZZZZZZZZ"));
 	r=textFile.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf==_L("12345\rxyz"));
 	r=textFile.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf==record[0]);
 
 	TBuf<601> bigBuf;
 	TPtrC largePtr((TText*)largeRecord->Ptr(),(largeRecord->Length()-1));
 	textFile.Seek(ESeekStart);
 	r=textFile.Read(bigBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(bigBuf==largePtr);
 	r=textFile.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf==_L("12345\rxyz"));
 	r=textFile.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf==record[0]);
 	f.Close();
 
@@ -632,60 +632,60 @@
 	test.Next(_L("Test FileText last record has no terminator"));
 	RFile f;
 	TInt r=f.Replace(TheFs,_L("TextFile"),0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TPtrC8 bufPtr;
 	TBuf<16>boundaryBuf=_L("Record1\n");
 	bufPtr.Set((TUint8*)boundaryBuf.Ptr(),boundaryBuf.Size());
 	r=f.Write(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	boundaryBuf=_L("Record2\n");
 	bufPtr.Set((TUint8*)boundaryBuf.Ptr(),boundaryBuf.Size());
 	r=f.Write(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	boundaryBuf=_L("Record3\n");
 	bufPtr.Set((TUint8*)boundaryBuf.Ptr(),boundaryBuf.Size());
 	r=f.Write(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TFileText fText;
 	fText.Set(f);
 	r=fText.Seek(ESeekStart);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf<32> recBuf;
 	r=fText.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf.MatchF(_L("record1"))!=KErrNotFound);
 	r=fText.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf.MatchF(_L("record2"))!=KErrNotFound);
 	r=fText.Read(recBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(recBuf.MatchF(_L("record3"))!=KErrNotFound);
 	r=fText.Read(recBuf);
-	test(r==KErrEof);
+	test_Value(r, r == KErrEof);
 	test(recBuf.Length()==0);
 	f.Close();
 
 	TBuf<0x100> bigBuf(0x100);
 	bigBuf.Fill('A');
 	r=f.Replace(TheFs,_L("TextFile"),0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     bufPtr.Set((TUint8*)bigBuf.Ptr(),bigBuf.Size());
 	r=f.Write(bufPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	fText.Set(f);
 	r=fText.Seek(ESeekStart);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	bigBuf.SetLength(0);
 	r=fText.Read(bigBuf);
 	test.Printf(_L("fText.Read returns %d\n"),r);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("BigBuf.Length()==%d\n"),bigBuf.Length());
 	test(bigBuf.Length()==0x100);
 	r=fText.Read(bigBuf);
-	test(r==KErrEof);
+	test_Value(r, r == KErrEof);
 	test(bigBuf.Length()==0);
 	f.Close();
 	}
@@ -700,7 +700,7 @@
 	TFileName tempFileName;
 	RFile f;
 	TInt r=f.Temp(TheFs,_L(""),tempFileName,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TParse p;
 	p.Set(tempFileName,NULL,NULL);
 	test(p.DrivePresent());
@@ -710,10 +710,10 @@
 	f.Close();
 
 	r=f.Replace(TheFs,_L("WELCOMETO"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	r=f.Replace(TheFs,_L("WELCOMETO.WRD"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	}
 
@@ -732,189 +732,189 @@
 	test.Next(_L("Archive att is set after creation"));
 	RFile f;
 	TInt r=TheFs.Delete(_L("FILEATT.ARC"));
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	r=f.Create(TheFs,_L("FILEATT.ARC"),EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TUint atts;
 	r=f.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test((atts&ATT_MASK)==KEntryAttArchive);
 	TEntry fileAtt;
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==KEntryAttArchive);
 	f.Close();
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==KEntryAttArchive);
 
 	test.Next(_L("Archive att is set after a write"));
 	TheFs.SetAtt(_L("FILEATT.ARC"),0,KEntryAttArchive);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==0);
 	r=f.Open(TheFs,_L("FILEATT.ARC"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Write(_L8("Hello World"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test((atts&ATT_MASK)==KEntryAttArchive);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==KEntryAttArchive);
 	f.Close();
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==KEntryAttArchive);
 
 	test.Next(_L("Archive att is set after setsize"));
 	TheFs.SetAtt(_L("FILEATT.ARC"),0,KEntryAttArchive);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==0);
 	r=f.Open(TheFs,_L("FILEATT.ARC"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.SetSize(447);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt size;
 	r=f.Size(size);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(size==447);
 	r=f.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test((atts&ATT_MASK)==KEntryAttArchive);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==KEntryAttArchive);
 	f.Close();
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==KEntryAttArchive);
 
 	test.Next(_L("Archive att is not set after open"));
 	r=TheFs.SetAtt(_L("FILEATT.ARC"),0,KEntryAttArchive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Open(TheFs,_L("FILEATT.ARC"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test((atts&ATT_MASK)==0);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==0);
 	f.Close();
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==0);
 
 	test.Next(_L("Archive att is not set after a read"));
 	TheFs.SetAtt(_L("FILEATT.ARC"),0,KEntryAttArchive);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==0);
 	r=f.Open(TheFs,_L("FILEATT.ARC"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<16> readBuf;
 	r=f.Read(readBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test((atts&ATT_MASK)==0);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==0);
 	f.Close();
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==0);
 
 	test.Next(_L("Archive att is set after replace"));
 	r=f.Replace(TheFs,_L("FILEATT.ARC"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test((atts&ATT_MASK)==KEntryAttArchive);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==KEntryAttArchive);
 	f.Close();
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==KEntryAttArchive);
 
 	test.Next(_L("Read only bit can be unset"));
 	r=TheFs.SetAtt(_L("FILEATT.ARC"),KEntryAttReadOnly|KEntryAttHidden,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==(KEntryAttReadOnly|KEntryAttHidden|KEntryAttArchive));
 
 	r=TheFs.SetAtt(_L("FILEATT.ARC"),0,KEntryAttHidden);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==(KEntryAttReadOnly|KEntryAttArchive));
 
 	r=TheFs.SetAtt(_L("FILEATT.ARC"),0,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==(KEntryAttArchive));
 
 	r=TheFs.SetAtt(_L("FILEATT.ARC"),KEntryAttReadOnly|KEntryAttHidden,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==(KEntryAttReadOnly|KEntryAttHidden|KEntryAttArchive));
 
 	r=TheFs.SetAtt(_L("FILEATT.ARC"),0,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==(KEntryAttHidden|KEntryAttArchive));
 
 	r=TheFs.SetAtt(_L("FILEATT.ARC"),0,KEntryAttHidden);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==(KEntryAttArchive));
 
 	TTime time(0);
 	r=TheFs.SetEntry(_L("FILEATT.ARC"),time,KEntryAttReadOnly|KEntryAttHidden,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==(KEntryAttReadOnly|KEntryAttHidden|KEntryAttArchive));
 
 	r=TheFs.SetEntry(_L("FILEATT.ARC"),time,0,KEntryAttHidden);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==(KEntryAttReadOnly|KEntryAttArchive));
 
 	r=TheFs.SetEntry(_L("FILEATT.ARC"),time,0,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==(KEntryAttArchive));
 
 	r=TheFs.SetEntry(_L("FILEATT.ARC"),time,KEntryAttReadOnly|KEntryAttHidden,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==(KEntryAttReadOnly|KEntryAttHidden|KEntryAttArchive));
 
 	r=TheFs.SetEntry(_L("FILEATT.ARC"),time,0,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==(KEntryAttHidden|KEntryAttArchive));
 
 	r=TheFs.SetEntry(_L("FILEATT.ARC"),time,0,KEntryAttHidden);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("FILEATT.ARC"),fileAtt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fileAtt.iAtt==(KEntryAttArchive));
 
 	test.Next(_L("Cashing the 'read-only' attribute"));
@@ -922,42 +922,42 @@
 
 	// Test RO attribute after creating a file
 	r=f.Create(TheFs,fname,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.SetAtt(KEntryAttReadOnly,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Write(_L8("Hello World"));
-	test(r==KErrNone);					// <-- here!
+	test_KErrNone(r);					// <-- here!
 	f.Close();
 
 	// Test we can't open for write or delete a RO file
 	r=f.Open(TheFs,fname,EFileWrite);
-	test(r==KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 	r=TheFs.Delete(fname);
-	test(r==KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 
 	// Tidy up and re-create test file
 	r=TheFs.SetAtt(fname,0,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(fname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Create(TheFs,fname,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 
 	// Test RO attribute after opening a file
 	r=f.Open(TheFs,fname,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.SetAtt(KEntryAttReadOnly,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Write(_L8("Hello World"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 
 	// Tidy up
 	r=TheFs.SetAtt(fname,0,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(fname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 static void testShortNameAccessorFunctions()
@@ -976,21 +976,21 @@
 
 	TBuf<64> sessionPath;
 	TInt r=TheFs.SessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFile f;
 	r=TheFs.MkDirAll(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\RANDOM.ENDBIT"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	r=f.Replace(TheFs,_L("LONGFILENAME.LONGEXT"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	r=f.Replace(TheFs,_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\LONGFILENAME.LONGEXT"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	r=f.Replace(TheFs,_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\BAD CHAR"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	r=f.Replace(TheFs,_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\GoodCHAR.TXT"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	TBuf<12> shortName1;
 	TBuf<12> shortName2;
@@ -998,15 +998,15 @@
 	TBuf<12> shortName4;
 	TBuf<12> shortName5;
 	r=TheFs.GetShortName(_L("LONGFILENAME.LONGEXT"),shortName1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.GetShortName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\LONGFILENAME.LONGEXT"),shortName2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.GetShortName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\BAD CHAR"),shortName3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.GetShortName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\GOODCHAR.TXT"),shortName4);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.GetShortName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY"),shortName5);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	if(Is_Win32(TheFs, gDriveNum))
 		{
@@ -1035,48 +1035,48 @@
 	if (Is_Win32(TheFs, gDriveNum))
 		{
 		r=TheFs.GetLongName(_L("LONGFI~1.LON"),longName1);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFs.GetLongName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\LONGFI~1.LON"),longName2);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFs.GetLongName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\BADCHA~1"),longName3);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFs.GetLongName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\GOODCHAR.TXT"),longName4);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFs.GetLongName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE~1"),longName5);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	else if (!IsTestingLFFS())
 		{
 		r=TheFs.GetLongName(_L("LONGFI~1.LON"),longName1);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFs.GetLongName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\LONGFI~1.LON"),longName2);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFs.GetLongName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\BAD_CHAR"),longName3);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFs.GetLongName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\GOODCHAR.TXT"),longName4);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFs.GetLongName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE~1"),longName5);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
     else
     	{
 		// LFFS longname tests
         r=TheFs.GetLongName(shortName1,longName1);
-        test(r==KErrNone);
+        test_KErrNone(r);
         r=TheFs.SetSessionPath(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-DIRECTORY\\LASTDIR\\"));
-        test(r==KErrNone);
+        test_KErrNone(r);
         r=TheFs.GetLongName(shortName2,longName2);
-        test(r==KErrNone);
+        test_KErrNone(r);
         r=TheFs.GetLongName(shortName3,longName3);
-        test(r==KErrNone);
+        test_KErrNone(r);
         r=TheFs.GetLongName(shortName4,longName4);
-        test(r==KErrNone);
+        test_KErrNone(r);
         r=TheFs.SetSessionPath(_L("\\F32-TST\\TFILE\\TOPLEVEL\\"));
-        test(r==KErrNone);
+        test_KErrNone(r);
         r=TheFs.GetLongName(shortName5,longName5);
-        test(r==KErrNone);
+        test_KErrNone(r);
         r=TheFs.SetSessionPath(sessionPath);
-        test(r==KErrNone);
+        test_KErrNone(r);
     	}
 
 	test(longName1==_L("LONGFILENAME.LONGEXT"));
@@ -1086,16 +1086,16 @@
 	test(longName5==_L("MIDDLE-DIRECTORY"));
 
 	r=TheFs.GetShortName(_L("XXX.YYY"),shortName1);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.GetShortName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-YROTCERID\\LASTDIR\\BAD-CHAR"),shortName1);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=TheFs.GetLongName(_L("XXX.YYY"),longName1);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.GetLongName(_L("\\F32-TST\\TFILE\\TOPLEVEL\\MIDDLE-YROTCERID\\LASTDIR\\BAD-CHAR"),longName1);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 
 	r=TheFs.Delete(_L("LONGFILENAME.LONGEXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TEntry romEntry;
 	r=TheFs.Entry(_L("Z:\\System"),romEntry);
@@ -1105,13 +1105,13 @@
 		//test.Getch();
 		//return;
 		}
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf<64> romFileName=_L("Z:\\");
 	romFileName.Append(romEntry.iName);
 	r=TheFs.GetShortName(romFileName,shortName1);
-	test(r==KErrNotSupported);
+	test_Value(r, r == KErrNotSupported);
 	r=TheFs.GetLongName(_L("Z:\\system"),longName1);
-	test(r==KErrNotSupported);
+	test_Value(r, r == KErrNotSupported);
 	}
 
 static void RmDir(const TDesC& aDirName)
@@ -1122,7 +1122,7 @@
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	test(fMan!=NULL);
 	TInt r=TheFs.SessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.CheckDisk(gSessionPath);
 	if (r!=KErrNone && r!=KErrNotSupported)
 		ReportCheckDiskFailure(r);
@@ -1132,7 +1132,7 @@
 
 	fMan->Attribs(removeDirName, 0, KEntryAttReadOnly, 0, CFileMan::ERecurse);
 	r=fMan->RmDir(removeDirName);
-	test(r==KErrNone || r==KErrNotFound || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrPathNotFound);
 
 	delete fMan;
 	}
@@ -1173,7 +1173,7 @@
 	// Check the generated shortname of the original file
 	TBuf<12> shortName;
 	err = TheFs.GetShortName(KOrigFileName, shortName);
-	test(err==KErrNone);
+	test_KErrNone(err);
 
 	// Validate the generated shorname against the original filename.
 	if (Is_Win32(TheFs, gDriveNum))
@@ -1191,7 +1191,7 @@
 	CheckFileExists(KOrigFileShortName, KErrNone, EFalse);
 
 	err = TheFs.Rename(KOrigFileName,KDestinationFileName);
-	test(err==KErrNone);
+	test_KErrNone(err);
 
 	// Clean up before leaving
 	RmDir(_L("INC112803\\"));
@@ -1206,43 +1206,43 @@
 	test.Next(_L("Test IsFileOpen"));
 	TBool answer;
 	TInt r=TheFs.IsFileOpen(_L("OPEN.FILE"),answer);
-	test(r==KErrNotFound || (r==KErrNone && answer==EFalse));
+	test_Value(r, r == KErrNotFound || (r==KErrNone && answer==EFalse));
 	RFile f;
 	r=f.Replace(TheFs,_L("OPEN.FILE"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.IsFileOpen(_L("OPEN.FILE"),answer);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(answer!=EFalse);
 	f.Close();
 	r=TheFs.IsFileOpen(_L("OPEN.FILE"),answer);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(answer==EFalse);
 	r=TheFs.Delete(_L("OPEN.FILE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile f2;
 	r=f2.Replace(TheFs,_L("AnotherOpen.File"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.IsFileOpen(_L("AnotherOpen.File"),answer);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(answer!=EFalse);
 	r=f.Replace(TheFs,_L("OPEN.FILE"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.IsFileOpen(_L("OPEN.FILE"),answer);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(answer!=EFalse);
 	f2.Close();
 	r=TheFs.IsFileOpen(_L("OPEN.FILE"),answer);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(answer!=EFalse);
 	f.Close();
 	r=TheFs.IsFileOpen(_L("OPEN.FILE"),answer);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(answer==EFalse);
 	r=TheFs.Delete(_L("AnotherOpen.File"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("OPEN.FILE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 static void testDeleteOpenFiles()
@@ -1255,99 +1255,99 @@
 	RFile f;
 	f.Close();
 	TInt r=f.Replace(TheFs,_L("Open.File"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("OPEN.FILE"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	f.Close();
 	f.Close();
 	f.Close();
 	r=TheFs.Delete(_L("Open.FILe"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TFileName fileName;
 	r=f.Temp(TheFs,_L(""),fileName,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(fileName);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	f.Close();
 	r=TheFs.Delete(fileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	MakeFile(_L("\\Documents\\TEstfile.txt"));
 	r=f.Open(TheFs,_L("\\Documents\\TEstfile.txt"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("\\Documents\\TEstfile.txt"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.Delete(_L("\\documents\\TEstfile.txt"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.Delete(_L("\\Documents.\\TEstfile.txt"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.Delete(_L("\\documents.\\TEstfile.txt"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.Delete(_L("\\Documents\\Testfile.txt"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.Delete(_L("\\documents\\testfile.txt"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.Delete(_L("\\Documents.\\TEstfile.TXT"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.Delete(_L("\\docUMENTS.\\TESTFILE.TXT"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	f.Close();
 	r=TheFs.Delete(_L("\\Documents\\TEstfile.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	MakeFile(_L("\\Documents\\Documents\\TEstfile.txt"));
 	r=f.Open(TheFs,_L("\\Documents\\Documents\\TEstfile.txt"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("\\Documents\\documents.\\TEstfile.txt"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.Delete(_L("\\documents\\Documents.\\TEstfile.txt"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.Delete(_L("\\Documents.\\documents\\TEstfile.txt"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.Delete(_L("\\documents.\\Documents\\TEstfile.txt"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.Delete(_L("\\Documents\\Documents\\Testfile.txt"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.Delete(_L("\\documents\\documents\\testfile.txt"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.Delete(_L("\\Documents.\\Documents.\\TEstfile.TXT"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.Delete(_L("\\docUMENTS.\\docUMENTS.\\TESTFILE.TXT"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 
 
 	r=TheFs.RmDir(_L("\\Documents\\"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.RmDir(_L("\\documents\\"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.RmDir(_L("\\Documents.\\"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.RmDir(_L("\\documents.\\"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.RmDir(_L("\\Documents\\documents\\"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.RmDir(_L("\\documents\\documents.\\"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.RmDir(_L("\\Documents.\\Documents\\"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.RmDir(_L("\\documents.\\Documents.\\"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.RmDir(_L("\\Documents\\TestFile.TXT"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.RmDir(_L("\\documents\\TestFile"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.RmDir(_L("\\Documents.\\Testfile."));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.RmDir(_L("\\documents.\\t"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	f.Close();
 	r=TheFs.Delete(_L("\\Documents\\documents\\TEstfile.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\Documents\\documents.\\"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.RmDir(_L("\\Documents.\\"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	}
 
 static void testFileSeek()
@@ -1358,7 +1358,7 @@
 	test.Next(_L("Test file seek"));
 	RFile f;
 	TInt r=f.Open(TheFs,_L("T_File.cpp"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TBuf8<20> text1;TInt pos1=0;
 	TBuf8<20> text2;TInt pos2=510;
@@ -1367,67 +1367,67 @@
 	TBuf8<20> text5;TInt pos5=4999;
 
 	r=f.Read(pos1,text1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Read(pos2,text2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Read(pos3,text3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Read(pos4,text4);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Read(pos5,text5);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TBuf8<20> testBuf;
 
 	r=f.Read(pos3,testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==text3);
 
 	r=f.Read(pos1,testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==text1);
 
 	r=f.Read(pos4,testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==text4);
 
 	r=f.Read(pos2,testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==text2);
 
 	r=f.Read(pos5,testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==text5);
 
 	r=f.Read(pos2,testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==text2);
 	r=f.SetSize(1023);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Read(pos2,testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==text2);
 	r=f.SetSize(1024);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Read(pos1,testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==text1);
 	r=f.Read(pos2,testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==text2);
 
 	r=f.Read(pos1,testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==text1);
 	r=f.SetSize(511);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Read(pos1,testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==text1);
 	r=f.SetSize(512);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Read(pos1,testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==text1);
 	f.Close();
 	}
@@ -1440,60 +1440,60 @@
 //	Create a zero length file
 	RFile file;
 	TInt r=file.Replace(TheFs,_L("\\F32-TST\\TFILE\\seektest"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.SetSize(20);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	Seek beyond the length of the file
 	TInt seekPos;
 	seekPos = 80;								//	Pick a likely offset
     TInt err = file.Seek(ESeekEnd, seekPos);	//	and go there
-    test(err==KErrNone);
+    test_KErrNone(err);
 	test(seekPos==20);							//	Somewhat non-intuitive?
 
 	r=file.Write(_L8("A Devil's Haircut"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt newFileSize;
 	r=file.Size(newFileSize);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	seekPos = 0;
     err = file.Seek(ESeekCurrent, seekPos);		//	Find out where we ended up?
-	test(err==KErrNone);
+	test_KErrNone(err);
 	test(seekPos==37);
 
 	file.SetSize(512);
 	seekPos=513;
 	err=file.Seek(ESeekStart, seekPos);
-	test(err==KErrNone);
+	test_KErrNone(err);
 	test(seekPos==513);
 
 	err=file.Seek(ESeekEnd, seekPos);
-	test(err==KErrNone);
+	test_KErrNone(err);
 	test(seekPos==512);
 
 	seekPos=-530;
 	err=file.Seek(ESeekEnd, seekPos);
-	test(err==KErrNone);
+	test_KErrNone(err);
 	test(seekPos==0);
 
 	seekPos=-10;
 	err=file.Seek(ESeekEnd, seekPos);
-	test(err==KErrNone);
+	test_KErrNone(err);
 	test(seekPos==502);
 
 	seekPos=-10;
 	err=file.Seek(ESeekStart,seekPos);
-	test(err==KErrArgument);
+	test_Value(err, err == KErrArgument);
 	test(seekPos==-10);
 
 	seekPos=0;
 	err=file.Seek(ESeekEnd,seekPos);
-	test(err==KErrNone);
+	test_KErrNone(err);
 	test(seekPos==512);
 
 	file.Close();
 	r=TheFs.Delete(_L("\\F32-TST\\TFILE\\seektest"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 static void testSetSize()
@@ -1506,18 +1506,18 @@
 	RFile f1;
 	TInt i=0;
 	TInt r=f1.Replace(TheFs,_L("File.File"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	gBuf.SetLength(32);
 	for(i=0;i<32;i++)
 		gBuf[i]=(TUint8)i;
 	r=f1.Write(gBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	gBuf.SetLength(1334);
 	for(i=64;i<1334+64;i++)
 		gBuf[i-64]=(TUint8)i;
 	r=f1.Write(30,gBuf);
 	r=f1.Read(30,gBuf,1000);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(gBuf[0]==64);
 	test(gBuf[1]==65);
 	test(gBuf[2]==66);
@@ -1525,23 +1525,23 @@
 
 	test.Next(_L("Open a large file"));
 	r=f1.Replace(TheFs,_L("File.File"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckDisk();
 	r=f1.SetSize(131072); // 128K
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<16> testData=_L8("testData");
 	r=f1.Write(131060,testData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f1.Close();
 	r=f1.Open(TheFs,_L("File.File"),EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt size;
 	r=f1.Size(size);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(size==131072);
 	TBuf8<16> testData2;
 	r=f1.Read(131060,testData2,8);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testData==testData2);
 	f1.Close();
 	TheFs.Delete(_L("File.file"));
@@ -1552,10 +1552,10 @@
 	{
 	RFile f;
 	TInt r=f.Open(TheFs, PlatSec::ConfigSetting(PlatSec::EPlatSecEnforceSysBin)?_L("Z:\\Sys\\Bin\\eshell.exe"):_L("Z:\\System\\Bin\\eshell.exe"), EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt anAddress=0;
 	r=f.Seek(ESeekAddress, anAddress);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #if !defined(__WINS__)
 	test(RFs::IsRomAddress((TAny *)anAddress)); // Always returns EFalse if WINS
 #endif
@@ -1576,25 +1576,25 @@
 	RFile f1;
 	TInt temp;
 	TInt r=f1.Replace(TheFs,_L("File.File"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f1.Size(temp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(temp==0);
 	TUint data=0;
 	TPtrC8 buf((TText8*)&data,1);
 	r=f1.Write(buf);
 //	r=f1.Write(_L("\0"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f1.Size(temp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(temp==1);
 	temp=0;
 	r=f1.Seek(ESeekStart,temp);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(temp==0);
 	TBuf8<32> testBuf;
 	r=f1.Read(testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(testBuf==buf);
 	f1.Close();
 
@@ -1607,15 +1607,15 @@
 
 	RHackFile f2;
 	f2.Open(TheFs, _L("File.File"), EFileRead);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = f2.SendReceive(/*47*/ EFsFileChangeMode, TIpcArgs(EFileRead | EFileWrite));	// <- must fail!
-	test(r == KErrArgument);
+	test_Value(r, r == KErrArgument);
 	r = f2.Write(_L8("Hacked!"));	// <- must fail!
-	test(r == KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 	f2.Close();
 
 	r=TheFs.Delete(_L("File.FIle"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 static void testFileRename()
@@ -1635,46 +1635,46 @@
 
     //-- test renaming a file to a non-existing directory
     r = TheFs.MkDir(_L("\\temp\\"));
-    test(r==KErrNone || r==KErrAlreadyExists);
+    test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 
     r = f1.Replace(TheFs, _L("\\temp\\file1"), 0);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
     r = f1.Rename(_L("\\temp\\temp\\file1"));
-    test(r == KErrPathNotFound);
+    test_Value(r, r == KErrPathNotFound);
 
     f1.Close();
 
 
 	r=f1.Replace(TheFs,name2,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f1.Write(_L8("1234"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt len=CheckFileExists(name2,KErrNone);
 	test(len==4);
 	r=f1.Rename(name1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=f1.Read(0,contents);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(contents==_L8("1234"));
 	r=f1.Write(4,_L8("5678"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	len=CheckFileExists(name1,KErrNone);
 	test(len==8);
 	CheckFileExists(name2,KErrNotFound);
 	r=f1.Write(8,_L8("90"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f1.Close();
 	len=CheckFileExists(name1,KErrNone);
 	test(len==10);
 
 	test.Next(_L("Test can change case using rename"));
 	r=f1.Open(TheFs,name1,EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f1.Rename(name3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileExists(name1,KErrNone,EFalse);
 	len=CheckFileExists(name3,KErrNone);
 	test(len==10);
@@ -1685,9 +1685,9 @@
 
 	test.Next(_L("Test can rename to an identical filename"));
 	r=f1.Open(TheFs,name3,EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f1.Rename(name3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	len=CheckFileExists(name3,KErrNone);
 	test(len==10);
 	f1.Close();
@@ -1696,20 +1696,20 @@
 
 	test.Next(_L("Test rename to a name containing a wildcard is rejected"));
 	r=f1.Open(TheFs,name3,EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f1.Rename(_L("asdf*ASDF"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=f1.Rename(_L("asdf?AF"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	f1.Close();
 
 	r=f1.Open(TheFs,name3,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f1.Read(contents);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(contents==_L8("1234567890"));
 	r=f1.Read(contents);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(contents.Length()==0);
 	f1.Close();
 
@@ -1717,26 +1717,26 @@
 	TDateTime dateTime(1995,(TMonth)10,19,23,0,0,0);
 	TTime oldTime(dateTime);
 	r=TheFs.SetEntry(name3,oldTime,0,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f1.Open(TheFs,name3,EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TTime check;
 	r=f1.Modified(check);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(check==oldTime);
 
 	r=f1.Rename(_L("OldFile.Old"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=f1.Modified(check);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(check==oldTime);
 	r=TheFs.Modified(_L("oldfile.old"),check);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(check==oldTime);
 	f1.Close();
 	r=TheFs.Modified(_L("oldfile.old"),check);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(check==oldTime);
 	}
 
@@ -1754,20 +1754,20 @@
 
 	TEntry e;
 	TInt r=TheFs.Entry(_L("Tmp04005.$$$"),e);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(uidData==e.iType);
 	r=TheFs.Entry(_L("Sketch(01)"),e);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(uidData1==e.iType);
 
 	test.Next(_L("Test replace preserves UIDs"));
 	r=TheFs.Replace(_L("Tmp04005.$$$"),_L("Sketch(01)"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Entry(_L("Tmp04005.$$$"),e);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.Entry(_L("Sketch(01)"),e);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(uidData==e.iType);
 	}
 
@@ -1789,10 +1789,10 @@
 	bigName[0]='\\';
 	RFile f;
 	TInt r=f.Create(TheFs,bigName,EFileRead);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	bigName.SetLength(254);
 	r=f.Create(TheFs,bigName,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 
 	TInt count;
@@ -1805,35 +1805,35 @@
 		if (r==KErrDirFull)
 			{
 			r=TheFs.Delete(countedBigName);
-			test(r==KErrNotFound);
+			test_Value(r, r == KErrNotFound);
 			break;
 			}
 		if (r!=KErrNone)
 			test.Printf(_L("File create failed:%d"),r);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		f.Close();
 		}
 	while(count--)
 		{
 		countedBigName[2]=(TText)('A'+count);
 		r=TheFs.Delete(countedBigName);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 
 	r=TheFs.Delete(bigName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TFileName subDirFileName=_L("\\F32-TST\\TFILE");
 	bigName.SetLength(241);
 	subDirFileName.Append(bigName);
 	r=f.Create(TheFs,subDirFileName,EFileRead);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	subDirFileName.SetLength(254);
 	r=f.Create(TheFs,subDirFileName,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	r=TheFs.Delete(subDirFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -1851,30 +1851,30 @@
 	// Open a file in EFileShareReadersOnly mode
 	RFile f1;
 	TInt r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Opening a share in EFileShareReadersOnly mode should succeed
 	RFile f2;
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	// Opening a share in EFileShareReadersOrWriters mode with EFileRead access should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	// Opening a share in EFileShareReadersOrWriters mode with EFileWrite access should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	// Opening a share in EFileShareReadersOrWriters mode with EFileRead|EFileWrite access should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileRead|EFileWrite);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	// Opening a share in EShareAny mode should fail
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareAny);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	f1.Close();
 
@@ -1882,36 +1882,36 @@
 
 	// Open a file in EFileShareReadersOrWriters mode for reading
 	r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Opening a share in EFileShareExclusive mode should fail
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareExclusive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	// Opening a share in EFileShareReadersOnly mode should succeed
 	// (the share doesn't care if the file is opened for reading or writing)
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	// Opening a share in EFileShareReadersOnly mode with EFileRead accesss should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	// Opening a share in EFileShareReadersOnly mode with EFileWrite accesss should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	// Opening a share in EFileShareReadersOnly mode with EFileRead|EFileWrite accesss should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	// Opening a share in EFileShareAny mode should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	f1.Close();
@@ -1920,34 +1920,34 @@
 
 	// Open a file in EFileShareReadersOrWriters mode for writing
 	r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Opening a share in EFileShareExclusive mode should fail
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareExclusive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	// Opening a share in EFileShareReadersOnly mode should fail
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	// Opening a share in EFileShareReadersOrWriters mode with EFileRead access should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	// Opening a share in EFileShareReadersOrWriters mode with EFileWrite access should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	// Opening a share in EFileShareReadersOrWriters mode with EFileRead|EFileWrite access should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	// Opening a share in EFileShareAny mode should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	f1.Close();
@@ -1956,34 +1956,34 @@
 
 	// Open a file in EFileShareAny mode
 	r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Opening a share in EFileShareExclusive mode should fail
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareExclusive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	// Opening a share in EFileShareReadersOnly mode should fail
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	// Opening a share in EFileShareReadersOrWriters mode with EFileRead access should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	// Opening a share in EFileShareReadersOrWriters mode with EFileWrite access should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	// Opening a share in EFileShareReadersOrWriters mode with EFileRead|EFileWrite access should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	// Opening a share in EFileShareAny mode with should succeed
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f2.Close();
 
 	f1.Close();
@@ -1992,12 +1992,12 @@
 
 	// Open a file in EFileShareReadersOrWriters mode for reading
 	r=f1.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Opening a share in EFileShareReadersOnly mode should succeed
 	//  - The share should now be promoted to EFileShareReadersOnly mode
 	r=f2.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TInt pass = 2;
 	while(pass--)
@@ -2005,7 +2005,7 @@
 		RFile f3;
 		// Opening a share in EFileShareReadersOnly mode with EFileRead accesss should succeed
 		r=f3.Open(TheFs,_L("T_FILE.CPP"),EFileStreamText|EFileShareReadersOrWriters|EFileRead);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		f3.Close();
 
 		// Opening a share in EFileShareReadersOnly mode with EFileWrite accesss should fail
@@ -2013,12 +2013,12 @@
 		if(pass == 1)
 			{
 			// The share is promoted - should obey EFileShareReadersOnly rules
-			test(r==KErrInUse);
+			test_Value(r, r == KErrInUse);
 			}
 		else
 			{
 			// The share is demoted - should obey EFileShareReadersOrWriters rules
-			test(r==KErrNone);
+			test_KErrNone(r);
 			f3.Close();
 			}
 
@@ -2027,12 +2027,12 @@
 		if(pass == 1)
 			{
 			// The share is promoted - should obey EFileShareReadersOnly rules
-			test(r==KErrInUse);
+			test_Value(r, r == KErrInUse);
 			}
 		else
 			{
 			// The share is demoted - should obey EFileShareReadersOrWriters rules
-			test(r==KErrNone);
+			test_KErrNone(r);
 			f3.Close();
 			}
 
@@ -2041,13 +2041,13 @@
 		if(pass == 1)
 			{
 			// The share is promoted - should obey EFileShareReadersOnly rules
-			test(r==KErrInUse);
+			test_Value(r, r == KErrInUse);
 			f2.Close();
 			}
 		else
 			{
 			// The share is demoted - should obey EFileShareReadersOrWriters rules
-			test(r==KErrNone);
+			test_KErrNone(r);
 			f3.Close();
 			}
 		}
@@ -2150,7 +2150,7 @@
 	createTestFile(TheFile);
 
 	r=TheFile.Write(gBuf, -1);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 
 	removeTestFile(TheFile);
 
@@ -2167,7 +2167,7 @@
 // EXPORT_C TInt RFile::Write(TInt aPos,const TDesC8& aDes,TInt aLength)
 	createTestFile(TheFile);
 	r = TheFile.Write(0,gBuf,-1);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	removeTestFile(TheFile);
 
 
@@ -2285,7 +2285,7 @@
 
 	test.Next(_L("Execute sync call RFile::Write(const TDesC8& aDes) with zero length aDes"));
 	TInt r=TheFile.Write(gLongBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("Test case passed\n"));
 
@@ -2352,7 +2352,7 @@
 #else
 
 	r=TheFile.Write(gLongBuf, 0x80000);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #endif
 
 	test.Printf(_L("Test case passed\n"));
@@ -2404,7 +2404,7 @@
 
 	test.Next(_L("Execute sync call RFile::Write(TInt aPos, const TDesC8& aDes) with zero length aDes"));
 	r=TheFile.Write(0, gLongBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("Test case passed\n"));
 
@@ -2455,7 +2455,7 @@
 
 	test.Next(_L("Execute sync call RFile::Write(TInt aPos, const TDesC8& aDes, TInt aLength) with zero length aDes"));
 	r=TheFile.Write(0, gLongBuf, 0x80000);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("Test case passed\n"));
 
@@ -2519,7 +2519,7 @@
 
 // EXPORT_C TInt RFile::Read(TDes8& aDes,TInt aLength) const
 	err = file.Read(buf8,5);
-	test(err==KErrOverflow);
+	test_Value(err, err == KErrOverflow);
 	err = KErrNone;
 
 // EXPORT_C void RFile::Read(TDes8& aDes,TInt aLength,TRequestStatus& aStatus) const
@@ -2529,7 +2529,7 @@
 
 // EXPORT_C TInt RFile::Read(TInt aPos,TDes8& aDes,TInt aLength) const
 	err = file.Read(0,buf8,5);
-	test(err==KErrOverflow);
+	test_Value(err, err == KErrOverflow);
 
 // EXPORT_C void RFile::Read(TInt aPos,TDes8& aDes,TInt aLength,TRequestStatus& aStatus) const
 	file.Read(0,buf8,5,status);
@@ -2555,13 +2555,13 @@
 	RFile file;
 
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if (testMode & EDoCDeleteOnClose)
 		fileMode|=EDeleteOnClose;
 	r=file.Temp(fs,_L(""),gLastTempFileName,fileMode);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// Signal controlling thread and pause for panic where requested
 	// by caller.
 	if (testMode & EDoCPanic)
@@ -2607,11 +2607,11 @@
 //! 	1.	The temporary file is successfully created and deleted.
 //---------------------------------------------------------------------------------------------------------------------
 	r=clientThread.Create(_L("DeleteOnCloseClientThread 1"),DeleteOnCloseClientThread,KDefaultStackSize,0x2000,0x2000,(TAny*)0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.Resume();
 	gSleepThread.Wait();
 	r=TheFs.Delete(gLastTempFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.Close();
 
 //
@@ -2634,11 +2634,11 @@
 //---------------------------------------------------------------------------------------------------------------------
 	test.Next(_L("RFile::Temp EDeleteOnClose behaviour"));
 	r=clientThread.Create(_L("DeleteOnCloseClientThread 2"),DeleteOnCloseClientThread,KDefaultStackSize,0x2000,0x2000,(TAny*)EDoCDeleteOnClose);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.Resume();
 	gSleepThread.Wait();
 	r=TheFs.Delete(gLastTempFileName);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	clientThread.Close();
 
 //
@@ -2659,7 +2659,7 @@
 //---------------------------------------------------------------------------------------------------------------------
 	test.Next(_L("RFile::Temp default panic behaviour"));
 	r=clientThread.Create(_L("DeleteOnCloseClientThread 3"),DeleteOnCloseClientThread,KDefaultStackSize,0x2000,0x2000,(TAny*)EDoCPanic);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.Resume();
 	gSleepThread.Wait();
 	User::SetJustInTime(EFalse);
@@ -2668,7 +2668,7 @@
 	CLOSE_AND_WAIT(clientThread);
 	FsBarrier();
 	r=TheFs.Delete(gLastTempFileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //
 //---------------------------------------------------------------------------------------------------------------------
@@ -2690,7 +2690,7 @@
 //---------------------------------------------------------------------------------------------------------------------
 	test.Next(_L("RFile::Temp EDeleteOnClose panic behaviour"));
 	r=clientThread.Create(_L("DeleteOnCloseClientThread 4"),DeleteOnCloseClientThread,KDefaultStackSize,0x2000,0x2000,(TAny*)(EDoCPanic|EDoCDeleteOnClose));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.Resume();
 	gSleepThread.Wait();
 	User::SetJustInTime(EFalse);
@@ -2699,7 +2699,7 @@
 	CLOSE_AND_WAIT(clientThread);
 	FsBarrier();
 	r=TheFs.Delete(gLastTempFileName);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 
 //
 //---------------------------------------------------------------------------------------------------------------------
@@ -2719,10 +2719,10 @@
 //---------------------------------------------------------------------------------------------------------------------
 	test.Next(_L("RFile::Create EDeleteOnClose behaviour"));
  	r=file.Create(TheFs,_L("DoC5"),EFileRead|EFileWrite|EDeleteOnClose);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	r=TheFs.Delete(filename);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 
 //
 //---------------------------------------------------------------------------------------------------------------------
@@ -2746,16 +2746,16 @@
 //---------------------------------------------------------------------------------------------------------------------
 	test.Next(_L("DoC 6 - Multiple subsessions"));
  	r=file.Create(TheFs,filename,EFileShareAny|EFileRead|EFileWrite|EDeleteOnClose);
-	test(r==KErrNone);
+	test_KErrNone(r);
  	r=file2.Open(TheFs,filename,EFileShareAny|EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(filename);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	file2.Close();
 	r=TheFs.Delete(filename);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 
 //
 //---------------------------------------------------------------------------------------------------------------------
@@ -2773,10 +2773,10 @@
 //---------------------------------------------------------------------------------------------------------------------
 	test.Next(_L("RFile::Create existing file behaviour"));
  	r=file.Create(TheFs,filename,EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
  	r=file.Create(TheFs,filename,EFileRead|EFileWrite|EDeleteOnClose);
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 
 //
 //---------------------------------------------------------------------------------------------------------------------
@@ -2793,9 +2793,9 @@
 //---------------------------------------------------------------------------------------------------------------------
 	test.Next(_L("RFile::Open EDeleteOnClose flag validation"));
 	r=file.Open(TheFs,filename,EFileRead|EFileWrite|EDeleteOnClose);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	r=TheFs.Delete(filename);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	gSleepThread.Close();
 	test.End();
@@ -2824,21 +2824,21 @@
 
     //-- 1. create test file
     nRes = CreateEmptyFile(TheFs, KFile, 33);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     //-- 2. open it for write
     RFile file;
     nRes = file.Open(TheFs, KFile, EFileWrite);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     //-- 3. write a couple of bytes there. This must cause 'Archive' attribute set
     nRes = file.Write(0, _L8("a"));
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     nRes = file.Write(10, _L8("b"));
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     nRes = TheFs.Entry(KFile, entry);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     test(entry.IsArchive());  //-- 'A' attribute must be set.
 
@@ -2846,23 +2846,23 @@
     //-- 4. set new file attributes (w/o 'A') and creation time
     const TUint newAtt = KEntryAttSystem ;
     nRes = file.SetAtt(newAtt, ~newAtt & KEntryAttMaskSupported);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     TTime newTime;
     nRes = newTime.Set(_L("19970310:101809.000000"));
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     nRes = file.SetModified(newTime);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     //-- 5. wait 5 seconds. file server shall flush dirty data during this period.
     User::After(5*K1Sec);
 
     //-- 6. check that attributes haven't chanded because of flush
     nRes = file.Flush(); //-- this will flush attributes to the media
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     nRes = TheFs.Entry(KFile, entry);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     test(entry.iAtt == newAtt);
     test(entry.iModified.DateTime().Year() == 1997);
@@ -2871,12 +2871,12 @@
 
     //-- 7. write some data and ensure that 'A' attribute is set now and 'modified' time updated
     nRes = file.Write(12, _L8("c"));
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     file.Close(); //-- this will flush attributes to the media
 
     nRes = TheFs.Entry(KFile, entry);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(entry.iAtt == (newAtt | KEntryAttArchive));
     test(entry.iModified.DateTime().Year() != 1997);
 
@@ -2905,7 +2905,7 @@
     //-- check disk space, it shall be > 4G
     TVolumeInfo volInfo;
     nRes = TheFs.Volume(volInfo, gDriveNum);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     const TUint32 KMaxFAT32FileSize = 0xFFFFFFFF; // 4GB-1
 
@@ -2923,17 +2923,17 @@
     //-- this file has enabled write caching by default
     test.Printf(_L("creating maximal length file, size = 0x%x\n"),KMaxFAT32FileSize);
     nRes = file64.Replace(TheFs, KFileName, EFileWrite);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     const TInt64 fileSize = KMaxFAT32FileSize;
 
     nRes = file64.SetSize(fileSize);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     test.Printf(_L("seeking to the file end...\n"));
     TInt64 filePos = 0;
     nRes = file64.Seek(ESeekEnd, filePos);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
 
     test.Printf(_L("test writing to the last bytes of the file (rel pos addressing) \n"));
@@ -2941,31 +2941,31 @@
     //-- 1. writing using relative position
     filePos = -1;
     nRes = file64.Seek(ESeekEnd, filePos);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(filePos == fileSize-1);
 
     nRes = file64.Write(_L8("z")); //-- write 1 byte a pos 0xFFFFFFFE, this is the last allowed position of the FAT32 file
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     nRes = file64.Write(_L8("x")); //-- write 1 byte a pos 0xFFFFFFFF, beyond the max. allowed file size, this shall fail
-    test(nRes == KErrNotSupported);
+    test_Value(nRes, nRes == KErrNotSupported);
 
     nRes = file64.Flush();
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     //-- 1.1 check the result by reading data using rel. pos
     filePos = -1;
     nRes = file64.Seek(ESeekEnd, filePos);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(filePos == fileSize-1);
 
     test.Printf(_L("reading 1 byte at pos: 0x%x\n"), filePos);
     nRes = file64.Read(buf, 1); //-- read 1 byte a pos 0xFFFFFFFE, this is the last allowed position of the FAT32 file
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(buf.Length() == 1 && buf[0]=='z');
 
     nRes = file64.Read(buf, 1); //-- read 1 byte a pos 0xFFFFFFFF, beyond the max. allowed file size, this shall fail
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(buf.Length() == 0);
 
     file64.Close();
@@ -2973,45 +2973,45 @@
     test.Printf(_L("test writing to the last bytes of the file (absolute pos addressing) \n"));
     //-- 2. writing using absolute position
     nRes = file64.Open(TheFs, KFileName, EFileWrite);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     filePos = fileSize-1;
 
     nRes = file64.Write(filePos-2, _L8("0"), 1); //-- write 1 byte a pos 0xFFFFFFFC
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     nRes = file64.Write(filePos, _L8("a"), 1);   //-- write 1 byte a pos 0xFFFFFFFE, this is the last allowed position of the FAT32 file
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     nRes = file64.Write(filePos+1, _L8("b"), 1); //-- write 1 byte a pos 0xFFFFFFFF, beyond the max. allowed file size, this shall fail
-    test(nRes == KErrNotSupported);
+    test_Value(nRes, nRes == KErrNotSupported);
 
     nRes = file64.Flush();
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     //-- 1.1 check the result by reading data absolute rel. position
 
     nRes = file64.Read(filePos-2, buf, 1); //-- read 1 byte a pos 0xFFFFFFFD
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(buf.Length() == 1 && buf[0]=='0');
 
     nRes = file64.Read(filePos, buf, 1);   //-- read 1 byte a pos 0xFFFFFFFE, this is the last allowed position of the FAT32 file
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(buf.Length() == 1 && buf[0]=='a');
 
     nRes = file64.Read(filePos+1, buf, 1);  //-- read 1 byte a pos 0xFFFFFFFF, beyond the max. allowed file size
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(buf.Length() == 0);
 
     nRes = file64.Read(filePos+2, buf, 1); //buf.Len must be 0
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(buf.Length() == 0);
 
     file64.Close();
 
     test.Printf(_L("deleting the huge file.\n"));
     nRes = TheFs.Delete(KFileName);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
 #else
 
@@ -3031,7 +3031,7 @@
     F32_Test_Utils::SetConsole(test.Console());
 
     TInt nRes=TheFs.CharToDrive(gDriveToTest, gDriveNum);
-    test(nRes==KErrNone);
+    test_KErrNone(nRes);
     
     PrintDrvInfo(TheFs, gDriveNum);
 
@@ -3044,21 +3044,21 @@
         
         _LIT(KLongFN, "\\this is a long file name");
         nRes = CreateEmptyFile(TheFs, KLongFN, 10);   
-        test(nRes==KErrNone);
+        test_KErrNone(nRes);
 
 	    TBuf<12> shortName;
 	    nRes = TheFs.GetShortName(KLongFN, shortName);
 	    gShortFileNamesSupported = (nRes == KErrNone);
         
         nRes = TheFs.Delete(KLongFN);
-        test(nRes==KErrNone);
+        test_KErrNone(nRes);
 
         DeleteTestDirectory();
     }
     else
     {
         nRes = FormatDrive(TheFs, gDriveNum, ETrue);
-        test(nRes==KErrNone);
+        test_KErrNone(nRes);
     }
 
 	CreateTestDirectory(_L("\\F32-TST\\TFILE\\"));
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_file64bit.cpp
--- a/kerneltest/f32test/server/t_file64bit.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_file64bit.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -25,6 +25,7 @@
 //
 
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32svr.h>
@@ -57,7 +58,7 @@
     RBuf8 buf;
     
     r = buf.CreateMax(KBufSize);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
     RFile64 file;
 	TFileName fileName;
@@ -65,10 +66,10 @@
 	fileName.Append(KTestPath);
 	fileName.Append(_L("File4GBMinusOne.txt"));
 	r = file.Replace(TheFs,fileName, EFileWrite);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
     r = file.SetSize(K4GBMinusOne);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	TInt64 nNumberOfBytesToWrite = 0;
 	TInt64 nNumberOfBytesWritten = 0;
@@ -89,7 +90,7 @@
 		}
 	
 	r = file.Flush();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("\nFile writing is completed!!"));
 	
 	
@@ -177,7 +178,7 @@
 	{
 	test.Printf(_L("%S File Replaced with %S\n"),&anOldName,&aNewName);\
 	TInt r = TheFs.Replace(anOldName,aNewName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 	
@@ -190,20 +191,9 @@
 	TInt r = TheFs.ReadFileSection(aName,aPos,aBuffer,aLen);
 	TInt len = aBuffer.Length();
 	
-	if(KFileSizeMaxLargerThan4GBMinusOne == EFalse)
-		{
-		if(aPos < K4GB) 
-			test(r == KErrNone);
-		else
-			{
-			test(r == KErrNone);
-			test(len == 0);				
-			}
-		}
-	else
-		{
-		test (r == KErrNone);	
-		}
+	test_KErrNone(r);
+	if(KFileSizeMaxLargerThan4GBMinusOne == EFalse && aPos >= K4GB) 
+		test(len == 0);
 	return(*this);
 	}
 	
@@ -215,7 +205,7 @@
 	{
 	test.Printf(_L("Name of the directory for which listing is required %S\n"),&aName);	
 	TInt r = TheFs.GetDir(aName,anEntryAttMask,anEntrySortKey,anEntryList);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -226,7 +216,7 @@
 	{
 	test.Printf(_L("Name of the directory for which directory and file listing is required %S\n"),&aName);	
 	TInt r = TheFs.GetDir(aName,anEntryAttMask,anEntrySortKey,anEntryList,aDirList);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -237,7 +227,7 @@
 	{
 	test.Printf(_L("Name of the directory for which listing is required %S\n"),&aName);	
 	TInt r = TheFs.GetDir(aName,anEntryUid,anEntrySortKey,aFileList);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);	
 	}
 		
@@ -256,7 +246,7 @@
 	{
 	test.Printf(_L("%S create %S in %d Mode\n"),&iName,&aName,aFileMode);
 	TInt r = RFile64::Create(TheFs,aName,aFileMode);
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	return(*this);		
 	}
 	
@@ -268,7 +258,7 @@
 	{
 	test.Printf(_L("%S replace %S\n"),&iName,&aName);
 	TInt r = RFile64::Replace(TheFs,aName,EFileStream|EFileWrite);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -280,10 +270,7 @@
 	{
 	test.Printf(_L("%S replace %S in %d Mode\n"),&iName,&aName, aFileMode);
 	TInt r = RFile64::Replace(TheFs,aName,aFileMode);
-	if (r == KErrNone)
-		test(r == KErrNone);
-	else
-		test(r == KErrBadName);
+	test_Value(r, r == KErrNone || r == KErrBadName);
 	return(*this);		
 	}
 	
@@ -294,7 +281,7 @@
 	{
 	test.Printf(_L("%S open %S\n"),&iName,&aName);
 	TInt r = RFile64::Open(TheFs,aName,EFileWrite|EFileShareAny);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -305,7 +292,7 @@
 	{
 	test.Printf(_L("%S open %S in %d Mode\n"),&iName,&aName, aFileMode);
 	TInt r = RFile64::Open(TheFs,aName,aFileMode);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -316,7 +303,7 @@
 	{
 	test.Printf(_L("%S Temp file %S in %d Mode\n"),&iName,&aName, aFileMode);
 	TInt r = RFile64::Temp(TheFs,aPath,aName,aFileMode);	
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 	
@@ -335,7 +322,7 @@
 	{
 	test.Printf(_L("%S lock   0x%lx-0x%lx\n"),&iName,aPos,aPos+aLen-1);
 	TInt r = RFile64::Lock(aPos,aLen);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -346,7 +333,7 @@
 	{
 	test.Printf(_L("%S lockE  0x%lx-0x%lx\n"),&iName,aPos,aPos+aLen-1);
 	TInt r = RFile64::Lock(aPos,aLen);
-	test(r == KErrLocked);
+	test_Value(r, r == KErrLocked);
 	return(*this);
 	}
 
@@ -357,7 +344,7 @@
 	{
 	test.Printf(_L("%S ulock  0x%lx-0x%lx\n"),&iName,aPos,aPos+aLen-1);
 	TInt r = RFile64::UnLock(aPos,aLen);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -368,7 +355,7 @@
 	{
 	test.Printf(_L("%S ulockE 0x%lx-0x%lx\n"),&iName,aPos,aPos+aLen-1);
 	TInt r = RFile64::UnLock(aPos,aLen);
-	test(r == KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	return(*this);
 	}
 
@@ -391,13 +378,17 @@
 	if(KFileSizeMaxLargerThan4GBMinusOne == EFalse)
 		{
 		if((seekPos + aDes.Length()) < K4GB)
-			test(r == KErrNone);
+			{
+			test_KErrNone(r);
+			}
 		else
-			test(r == KErrNotSupported);
+			{
+			test_Value(r, r == KErrNotSupported);
+			}
 		}
 	else
 		{
-		test (r == KErrNone);	
+		test_KErrNone(r);	
 		}
 	return(*this);
 	}
@@ -423,10 +414,13 @@
 	if(KFileSizeMaxLargerThan4GBMinusOne == EFalse)
 		{
 		if((seekPos + aDes.Length()) < K4GB)
+			{
 			test(aStatus.Int() == KErrNone);
+			}
 		else
+			{
 			test(aStatus.Int() == KErrNotSupported);
-		
+			}
 		}
 	else
 		{
@@ -452,13 +446,17 @@
 	if(KFileSizeMaxLargerThan4GBMinusOne == EFalse)
 		{
 		if((seekPos + aLength) < K4GB)
-			test(r == KErrNone);
+			{
+			test_KErrNone(r);
+			}
 		else
-			test(r == KErrNotSupported);
+			{
+			test_Value(r, r == KErrNotSupported);
+			}
 		}
 	else
 		{
-		test(r == KErrNone);
+		test_KErrNone(r);
 		}
 	return(*this);	
 	}	
@@ -508,13 +506,17 @@
 	if(KFileSizeMaxLargerThan4GBMinusOne == EFalse)
 		{
 		if ((aPos + aDes.Length()) < K4GB)
-			test(r == KErrNone);
+			{
+			test_KErrNone(r);
+			}
 		else
-			test(r == KErrNotSupported);
+			{
+			test_Value(r, r == KErrNotSupported);
+			}
 		}
 	else
 		{
-		test(r == KErrNone);
+		test_KErrNone(r);
 		}
 	return(*this);
 	}
@@ -529,7 +531,7 @@
 	TInt r = RFile64::Write(aPos,aDes);
 	if( KErrNone == r)	// this is to ensure that the written data is committed and not cached.
 		r = RFile64::Flush();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -548,19 +550,29 @@
 		if ((aPos + aLen) < K4GB)
 			{
 			if (aLen < 0)
-				test(r == KErrArgument);
+				{
+				test_Value(r, r == KErrArgument);
+				}
 			else
-				test(r == KErrNone);
+				{
+				test_KErrNone(r);
+				}
 			}
 		else
-			test(r == KErrNotSupported);
+			{
+			test_Value(r, r == KErrNotSupported);
+			}
 		}
 	else
 		{
 		if (aLen < 0)
-			test(r == KErrArgument);
+			{
+			test_Value(r, r == KErrArgument);
+			}
 		else
-			test(r == KErrNone);
+			{
+			test_KErrNone(r);
+			}
 		}
 	return(*this);
 	}
@@ -575,7 +587,7 @@
 	TInt r = RFile64::Write(aPos,aDes,aLen);
 	if( KErrNone == r)	// this is to ensure that the written data is committed and not cached.
 		r = RFile64::Flush();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -587,10 +599,7 @@
 	{
 	test.Printf(_L("%S writeE 0x%lx-0x%lx\n"),&iName,aPos,aPos+aLen-1);
 	TInt r = RFile64::Write(aPos,aDes,aLen);
-	if (aLen < 0)
-		test(r == KErrArgument);
-	else
-		test(r == KErrLocked);
+	test_Value(r, r == (aLen < 0) ? KErrArgument : KErrLocked);
 	return(*this);
 	}
 
@@ -701,7 +710,7 @@
 	{
 	test.Printf(_L("%S read \n"),&iName);
 	TInt r = RFile64::Read(aDes);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -770,10 +779,7 @@
 	{
 	test.Printf(_L("%S read 0x%08x bytes\n"),&iName,aLen);
 	TInt r = RFile64::Read(aDes,aLen);
-	if(aLen < 0)
-		test(r == KErrArgument);
-	else
-		test(r == KErrNone);
+	test_Value(r, r == (aLen < 0) ? KErrArgument : KErrNone);
 	return(*this);
 	}
 	
@@ -785,10 +791,7 @@
 	test.Printf(_L("%S read   0x%lx-0x%lx\n"),&iName,aPos,aPos+aLen-1);
 	TInt r = RFile64::Read(aPos,aDes,aLen);
 	TInt len = aDes.Length();
-	if(aLen < 0)
-		test(r == KErrArgument);
-	else 
-		test(r == KErrNone);
+	test_Value(r, r == (aLen < 0) ? KErrArgument : KErrNone);
 	if(KFileSizeMaxLargerThan4GBMinusOne == EFalse)
 		{	
 		if(aPos >= K4GB) 
@@ -804,7 +807,7 @@
 	{
 	test.Printf(_L("%S readE  0x%lx-0x%lx\n"),&iName,aPos,aPos+aLen-1);
 	TInt r = RFile64::Read(aPos,aDes,aLen);
-	test(r == KErrLocked);
+	test_Value(r, r == KErrLocked);
 	return(*this);
 	}
 
@@ -836,7 +839,7 @@
 	{
 	test.Printf(_L("%S read   0x%lx\n"),&iName,aPos);
 	TInt r = RFile64::Read(aPos,aDes);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);	
 	}
 
@@ -848,7 +851,7 @@
 	{
 	test.Printf(_L("%S read   0x%lx\n"),&iName,aPos);
 	TInt r = RFile64::Read(aPos,aDes);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	return(*this);	
 	}
 
@@ -873,10 +876,7 @@
 	{
 	test.Printf(_L("%S read   0x%lx-0x%lx\n"),&iName,aPos,aPos+aLen-1);
 	TInt r = RFile64::Read(aPos,aDes,aLen);
-	if(aLen < 0)
-		test(r == KErrArgument);
-	else 
-		test(r == KErrNone);
+	test_Value(r, r == (aLen < 0) ? KErrArgument : KErrNone);
 	return(*this);
 	}
 
@@ -919,13 +919,17 @@
 	if(KFileSizeMaxLargerThan4GBMinusOne == EFalse)
 		{
 		if(aSize < K4GB)
-			test(r == KErrNone);
+			{
+			test_KErrNone(r);
+			}
 		else
-			test(r == KErrNotSupported);
+			{
+			test_Value(r, r == KErrNotSupported);
+			}
 		}
 	else
 		{
-		test(r == KErrNone);
+		test_KErrNone(r);
 		}
 	return(*this);
 	}
@@ -937,7 +941,7 @@
 	{
 	test.Printf(_L("%S sizeE: 0x%lx\n"),&iName,aSize);
 	TInt r = RFile64::SetSize(aSize);
-	test(r == KErrLocked);
+	test_Value(r, r == KErrLocked);
 	return(*this);
 	}
 
@@ -952,13 +956,17 @@
     if(KFileSizeMaxLargerThan4GBMinusOne == EFalse)
 		{
 		if(aSize < K4GB)
-			test(r == KErrNone);
+			{
+			test_KErrNone(r);
+			}
 		else
-			test(r == KErrTooBig);
+			{
+			test_Value(r, r == KErrTooBig);
+			}
 		}
 	else
 		{
-		test(r == KErrNone);
+		test_KErrNone(r);
 		}
 	return(*this);	
 
@@ -970,10 +978,7 @@
 	{
 	test.Printf(_L("Seek to pos %LD in %d Mode\n"),aPos, aMode);
 	TInt r = RFile64::Seek(aMode, aPos);
-	if(aPos < 0)
-		test(r == KErrArgument);
-	else
-		test(r == KErrNone);
+	test_Value(r, r == (aPos < 0) ? KErrArgument : KErrNone);
 	return(*this);	
 	}
 
@@ -1012,7 +1017,7 @@
 	
 	test.Next(_L("2GB File: Open"));
 	TInt r = TheFs.Entry(fileName, entry);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test((TUint) entry.iSize == testSize);
 
     TestRFile1.Open(fileName, EFileRead);
@@ -1023,7 +1028,7 @@
 	
 	TestRFile1.Close();
 	r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 /**
@@ -1060,7 +1065,7 @@
 		
 	test.Next(_L("3GB File: Open"));
 	r = TheFs.Entry(fileName, entry);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test((TUint) entry.iSize == testSize);
 	
 	TestRFile1.Open(fileName,EFileRead);
@@ -1070,7 +1075,7 @@
 	TestRFile1.Close();
 	
 	r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 /**
@@ -1107,7 +1112,7 @@
 	
 	test.Next(_L("4GB-1 File: Open"));
 	r = TheFs.Entry(fileName, entry);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	test((TUint) entry.iSize == testSize);
 	
@@ -1119,7 +1124,7 @@
 	TestRFile1.Close();
 	
 	r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 	
 /**
@@ -1156,7 +1161,7 @@
 	
 	test.Next(_L("4GB File: Open"));
 	r = TheFs.Entry(fileName, entry);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	if ((TUint) entry.iSize == testSize)
 		{
@@ -1167,7 +1172,7 @@
 		}
 	
 	r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 		
 	}	
 	
@@ -1254,10 +1259,10 @@
 	
 	RFile64 file64;
 	TInt r = file64.Open(TheFs,fileName,EDeleteOnClose);
-	test (r == KErrArgument);
+	test_Value(r, r == KErrArgument);
 	
 	r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	}
 
@@ -1310,7 +1315,7 @@
 	
 	test.Start(_L("Test opening a file using RFile and RFile64 in file sharing mode\n"));
 	TInt r = file.Replace(TheFs,fileName,EFileShareAny|EFileWrite);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	TBuf8<100> writeBuf;
 	TBuf8<100> readBuf;
@@ -1322,11 +1327,11 @@
 		
    	test.Next(_L("Write 100 bytes to the file\n"));
 	r = file.Write(0, writeBuf, 100);	
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	test.Next(_L("Read 100 bytes from position 0"));
 	r = file.Read(0, readBuf, 100); 
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	test.Next(_L("Compare the read data to the written data"));
 	test(readBuf == writeBuf);
@@ -1340,13 +1345,13 @@
 	
 	test.Next(_L("Query the file size using Rfile::Size()\n"));
 	r = file.Size(size);
-	test (r == KErrTooBig);
+	test_Value(r, r == KErrTooBig);
 	
 	test.Next(_L("Seek to the file position using 2GB+5 using RFile::Seek()\n"));
 	TUint seekPos1 = K2GB + 5;
 	TInt seekPos  = (TInt)seekPos1;
 	r = file.Seek(ESeekStart,seekPos);
-	test(r == KErrArgument);
+	test_Value(r, r == KErrArgument);
 	
 	test.Next(_L("Get the file size using RFile64::Size()\n"));
 	TestRFile1.Size(size64);
@@ -1374,14 +1379,14 @@
 	
 	test.Next(_L("Open the file using Rfile::Open()\n"));
 	r = file.Open(TheFs,fileName,EFileShareAny|EFileWrite);
-	test(r == KErrTooBig);
+	test_Value(r, r == KErrTooBig);
 	
 	test.Next(_L("Open the file using Rfile64::Open() and close\n"));
 	TestRFile1.Open(fileName,EFileShareAny|EFileWrite);
 	TestRFile1.Close();
 	
 	r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 /**
@@ -1425,7 +1430,7 @@
 	testDir.Append(KTestPath);
 	
 	TInt r = TheFs.MkDir(testDir);
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	
 	TFileName fileName;
 	TestRFile1.Temp(testDir, fileName, EFileWrite|EDeleteOnClose);
@@ -1486,7 +1491,7 @@
 	
 	test.Next(_L("Delete the temporary file\n"));
 	r = TheFs.Delete(fileName);
-	test(r == KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	
 	test.Next(_L("Create a temporary file using RFile64::Temp without EDeleteOnClose flag\n"));
 	TestRFile1.Temp(testDir, fileName, EFileWrite);
@@ -1496,7 +1501,7 @@
 	
 	test.Next(_L("Delete the temporary the file\n"));	
 	r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	}
 
@@ -1625,10 +1630,10 @@
 	test.Next(_L("create a file with InvalidPath and fileName\n"));	
 	RFile64 file64;
 	TInt r = file64.Create(TheFs, _L("C:\\InvalidPathName\\FileName"),EFileWrite);
-	test(r == KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	
 	r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}	
 	
 /**
@@ -1775,10 +1780,10 @@
 	test.Next(_L("Replace a file FileLargeOne.txt with invalid path\n"));	
 	RFile64 file64;
 	TInt r = file64.Replace(TheFs,_L("C:\\InvalidPath\\FileLargeOne.Txt"),EFileWrite);
-	test (r == KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	
 	r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 /**
@@ -1870,7 +1875,7 @@
 	test.Next(_L("Close the file and delete\n"));
 	TestRFile1.Close();
 	TInt r = TheFs.Delete(fileNameReplace);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 /**
@@ -1901,39 +1906,39 @@
 
 	RProcess p;
 	TInt r = p.Create(_L("FHServer64Bit.exe"), KNullDesC);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	
 	test.Next(_L("Connect to the File server \n"));
 	RFs fs;
 	r = fs.Connect();
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	// Check the number of open file handles
 	TInt resCount = fs.ResourceCount();
 	test(resCount == 0);
 
 	r = fs.ShareProtected();
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	r = fs.CreatePrivatePath(gDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = fs.SetSessionToPrivate(gDrive);
 	
 	test.Next(_L("Create a file and set the file size to 4GB-1\n"));
 	RFile64 file1;
 	r = file1.Replace(fs,KClientFileName,EFileWrite);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = file1.SetSize(K4GB-1);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	test.Next(_L("Write few bytes to the location 4GB-10, length = 9bytes\n"));
 	r = file1.Write(K4GB-10,KTestData3(),9);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r = p.SetParameter(3, gDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	p.Resume();
 	
@@ -1945,39 +1950,39 @@
 		r = handsvr.Connect();
 		}
 	while(r == KErrNotFound);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	r = handsvr.SetTestDrive(gDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	r = fs.SetSessionToPrivate(gDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	r = file1.Open(fs,KClientFileName,EFileRead);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	// pass the file handle to FHServer
 	test.Next(_L("RFile::TransferToServer()"));
 
 	TIpcArgs ipcArgs;
 	r = file1.TransferToServer(ipcArgs, 0, 1);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	test.Next(_L("Adopt the already open file from a client using RFile64::AdoptFromClient()\n"));
 	r = handsvr.PassFileHandleProcessLargeFileClient(ipcArgs);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	// verify that the original file handle's position is unchanged
 	TInt64 pos = 0;
 	r = file1.Seek(ESeekCurrent, pos);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test(pos == 0);
 	// make sure we can still use it
 
 	test.Next(_L("Read the file from position 4GB-10 and compare the data\n"));
 	TBuf8<9> rbuf;
 	r = file1.Read(K4GB-10,rbuf);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test (rbuf == KTestData3);
 
 	// Close the file
@@ -1985,14 +1990,14 @@
 	handsvr.Exit();
 	handsvr.Close();
 	r = fs.MkDir(_L("C:\\mdir"));
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 		
 	// Check the number of open file handles
 	resCount = fs.ResourceCount();
 	test(resCount == 0);
 
 	r = fs.Delete(KClientFileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	fs.Close();
 	}
 
@@ -2031,39 +2036,39 @@
 	test.Next(_L("Create a process named FHServer64Bit.exe\n"));
 	RProcess p;
 	r = p.Create(_L("FHServer64Bit.exe"), KNullDesC);
-	test(r == KErrNone);
+	test_KErrNone(r);
 		
 	test.Next(_L("Connect to the file server\n"));
 	RFs fs;
 	r = fs.Connect();
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	// Check the number of open file handles
 	TInt resCount = fs.ResourceCount();
 	test(resCount == 0);
 
 	r = fs.ShareProtected();
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	r = fs.CreatePrivatePath(gDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = fs.SetSessionToPrivate(gDrive);
 	
 	test.Next(_L("Create a file and set the file size to 4GB-1\n"));
 	RFile64 file1;
 	r = file1.Replace(fs,KClientFileName,EFileWrite);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = file1.SetSize(K4GB-1);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	test.Next(_L("Write few bytes to the location 4GB-10, length = 3bytes\n"));
 	r = file1.Write(K4GB-10,KTestData2(),3);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r = file1.Open(fs, KClientFileName, EFileWrite);
 
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	// NB slot 0 is reserved for the command line
 
@@ -2072,21 +2077,21 @@
 	r = file1.TransferToProcess(p, 1, 2);
 
 	r = p.SetParameter(3, gDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	r = fs.SetSessionToPrivate(gDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	// make sure we can still read from the file
 	TBuf8<3> rbuf;
 	r = file1.Read(K4GB-10,rbuf,3);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = rbuf.CompareF(KTestData2());
-	test(r == KErrNone);
+	test_KErrNone(r);
 	file1.Close();
 
 	r = fs.MkDir(_L("C:\\mdir"));
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	
 	// Check the number of open file handles - 
 	// should be 1 (the one duplicated for the other process)
@@ -2106,13 +2111,13 @@
 		r = handsvr.Connect();
 		}
 	while(r == KErrNotFound);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = handsvr.SetTestDrive(gDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	// wait for server to read the file
 	r = handsvr.PassFileHandleProcessLargeFileCreator();
-	test (r == KErrNone);
+	test_KErrNone(r);
 	
 	
 	// cleanup	
@@ -2151,37 +2156,37 @@
 	test.Next(_L("Connect to the file server\n"));
 	RFs fs;
 	r = fs.Connect();
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	// Check the number of open file handles
 	TInt resCount = fs.ResourceCount();
 	test(resCount == 0);
 
 	r = fs.ShareProtected();
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	r = fs.CreatePrivatePath(gDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = fs.SetSessionToPrivate(gDrive);
 	
 	test.Next(_L("Create a file and set the file size to 4GB-1\n"));
 	RFile64 file1;
 	r = file1.Replace(fs,KClientFileName,EFileWrite);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = file1.SetSize(K4GB-1);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	
 	r = file1.Write(K4GB-10,KTestData3(),9);
-	test(r == KErrNone);
+	test_KErrNone(r);
 		
 	file1.Close();
 	r = fs.Delete(KClientFileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	RProcess p;
 	r = p.Create(_L("FHServer64Bit.exe"), KNullDesC);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	// Request an open file (write mode) from the server
 	// using RFile64::AdoptFromServer()
 	
@@ -2193,10 +2198,10 @@
 		r = handsvr.Connect();
 		}
 	while(r == KErrNotFound);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	r = handsvr.SetTestDrive(gDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	TInt ssh;
 	TInt fsh = handsvr.GetFileHandleLargeFile2(ssh, EFileWrite);
@@ -2215,30 +2220,30 @@
 
 	RFile64 file;
 	r = file.AdoptFromServer(fsh, ssh);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Read the file from position 4GB-10 and compare the data\n"));
 	TBuf8<9> rbuf;
 	r = file.Read(K4GB-10,rbuf);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	// server should write KTestData1 ("Server!!!") to file
 	test (rbuf == KTestData4);
 
 	TFileName fileName;
 	r = file.FullName(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	file.Close();
 	//cleanup
 	r = fs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 		
 	TFileName sessionPath;
 	r = fs.SessionPath(sessionPath);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	r = fs.RmDir(sessionPath);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	fs.Close();
 	
@@ -2271,7 +2276,7 @@
 	TBuf8<KBufSize> readBuf2;
 	TUint i;
 	TInt r = GenerateBigFileContents();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	test.Next(_L("Open & Read Synchronously Large File From Diff Offset:"));
 
@@ -2901,7 +2906,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}	
 
 /**
@@ -3038,7 +3043,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 /**
@@ -3177,7 +3182,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 /**
@@ -3342,7 +3347,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 		
 /**
@@ -3522,7 +3527,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 			
 /**
@@ -3594,7 +3599,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -3703,7 +3708,7 @@
 
     TestRFile2.Close();
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 /**
@@ -3797,7 +3802,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 /**
@@ -3904,7 +3909,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 }
 
 /**
@@ -4011,7 +4016,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 /**
@@ -4048,9 +4053,9 @@
 	fileName.Append(_L("File4GBMinusOne.txt"));
 	
 	TInt r = file.Replace(TheFs,fileName,EFileWrite);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = file.SetSize(K4GBMinusOne);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 	test.Next(_L("Read from a big file using RFs::ReadFileSection() from position 3GB-1,52byte lengths of data\n"));
@@ -4081,7 +4086,7 @@
 		}
 		
 	r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 	
 /**
@@ -4145,11 +4150,11 @@
 	test.Next(_L("Get the directory listing, sort by size\n"));
 	RDir dir;
 	TInt r = dir.Open(TheFs, dirName, KEntryAttNormal);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	
 	TEntryArray entryArray;
 	r = dir.Read(entryArray);
-	test (r == KErrEof);
+	test_Value(r, r == KErrEof);
 
 	test.Next(_L("Check the files count in the directory. Number of files in a directory is 4\n"));
 	test(entryArray.Count() == gFilesInDirectory);
@@ -4297,12 +4302,12 @@
 	test.Next(_L("Open the directory containing large file, using RDir open()\n"));
 	RDir dir;
 	TInt r = dir.Open(TheFs, dirName, KEntryAttNormal);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	
 	test.Next(_L("Read the directory entry using TEntryArray as parameter\n"));
 	TEntryArray entryArray;
 	r = dir.Read(entryArray);
-	test (r == KErrEof);
+	test_Value(r, r == KErrEof);
 	
 	test.Next(_L("Check the count\n"));
 	test(entryArray.Count() == gFilesInDirectory);
@@ -4341,7 +4346,7 @@
 	testDir0.Append(_L("F32-TEST"));
 	
 	TInt r = TheFs.MkDir(testDir0);
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	
 	test.Next(_L("Sort with number of entries =0\n"));
 	TestRFs.GetDir(testDir0, KEntryAttMaskSupported, ESortBySize, anEntryList);
@@ -4468,13 +4473,13 @@
 	file3GB.Append(_L("File3GB.txt"));
 	
 	TInt r = TheFs.Delete(file4GBMinusOne);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = TheFs.Delete(file2GBMinusOne);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = TheFs.Delete(file2GB);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = TheFs.Delete(file3GB);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 	
 /**
@@ -4521,20 +4526,20 @@
 	
 	test.Next(_L("Open test file and get the file size using RFile64::Size() and set the file handle to TFileText object\n"));
 	r = file64.Replace(TheFs,fileName,EFileRead|EFileWrite);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = file64.SetSize(sizeK3GB);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	TFileText fileText;
 	fileText.Set(file64);
 	
 	test.Next(_L("Seek to the file end using TFileText::Seek()\n"));
 	r = fileText.Seek(ESeekEnd);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	test.Next(_L("Get current file position using RFile64::Seek() and verify it is at file end.\n"));
 	TInt64 pos = 0;
 	r = file64.Seek(ESeekCurrent, pos);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test(pos == sizeK3GB);
 	
 	test.Next(_L("Write data to the file using RFile64::Write\n"));
@@ -4544,7 +4549,7 @@
 	TPtrC8 bufPtr;
 	bufPtr.Set((TUint8*)record->Ptr(),record->Size()); // Size() returns length in bytes
 	r = file64.Write(pos,bufPtr);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	test.Next(_L("Read data using TFileText::Read\n"));
 	TBuf<20> fileTextReadBuf;
@@ -4554,26 +4559,26 @@
 	
 	test.Next(_L("Seek to the file end using TFileText::Seek(ESeekEnd)\n"));
 	r = fileText.Seek(ESeekEnd);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	test.Next(_L("Write known data using TFileText::Write\n"));
 	TBuf<20> fileTextWriteBuf(_L("AAAAAAAAAA"));
 	pos = 0;
 	r = file64.Seek(ESeekCurrent,pos);
 	r = fileText.Write(fileTextWriteBuf);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	test.Next(_L("Read the data using RFile64::Read\n"));
 	TBuf8<20> file64ReadBuf;
 	file64ReadBuf.Zero();
 	r = file64.Read(pos,file64ReadBuf);
 	r = bufPtr.Compare(file64ReadBuf);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	
 	file64.Close();
 	
 	r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	User::Free(record);
 	}
 
@@ -4666,7 +4671,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test.End();
 	}
 
@@ -4746,13 +4751,13 @@
 	fileName1.Append(_L("File2GB.txt"));
 	RFile64 file;
 	TInt r = file.Replace(TheFs, fileName1, EFileWrite);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	file.SetSize(K2GB);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	TestRFs.ReadFileSection(fileName1,0,readBuf,100);
 	r = TheFs.Delete(fileName1);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test.Next(_L("Creating test pattern"));
 	
 	TBuf8<0x63> writeBuf63;
@@ -4786,7 +4791,7 @@
 	TestRFile1.Close();
 	
 	r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test.End();
 	}
 
@@ -4937,7 +4942,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test.End();	
 	}	
 
@@ -5076,7 +5081,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test.End();	
 	}	
 
@@ -5223,7 +5228,7 @@
 	TestRFile1.Close();
 	
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test.End();	
 	}	
 /**
@@ -5375,7 +5380,7 @@
 		}
 	TestRFile1.Close();
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test.End();	
 	}	
 /**
@@ -5459,7 +5464,7 @@
 		}
 	TestRFile1.Close();
 	TInt r = TheFs.Delete(fileName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 /**
 @SYMTestCaseID      PBASE-T_FILE64BIT-2354
@@ -5587,20 +5592,20 @@
 
 	test.Next(_L("Copy the files from one folder to another using CFileMan::Copy()\n"));
 	TInt r = fileMan->Copy(filePathOld, filePathNew, CFileMan::ERecurse | CFileMan::EOverWrite);
-	test(r == KErrNone || r == KErrTooBig);
+	test_Value(r, r == KErrNone || r == KErrTooBig);
 
 	test.Next(_L("Get the directory entry and find how many files are copied\n"));
 	// check SMALL and LARGE files have been copied
 	r = dir.Open(TheFs, filePathNew, KEntryAttNormal);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	r = dir.Read(entryArray);
-	test (r == KErrEof);
+	test_Value(r, r == KErrEof);
 	test(entryArray.Count() == gFilesInDirectory);
 	dir.Close();
 	
 	// then delete the new directory
 	r = fileMan->Delete(filePathNew);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Set file man observer\n"));
 	// attempt to copy to new directory again - this time with an observer
@@ -5608,7 +5613,7 @@
 	
 	test.Next(_L("Copy the files from one folder to another, source folder has 3 small files and a large file\n"));
 	r = fileMan->Copy(filePathOld, filePathNew, CFileMan::ERecurse | CFileMan::EOverWrite);
-	test(r == KErrNone || r == KErrTooBig);
+	test_Value(r, r == KErrNone || r == KErrTooBig);
 	
 	test.Next(_L("Check observer for number of successful copy and failed copy\n"));
 	// test that 3 small files and 1 large file were copied
@@ -5619,28 +5624,28 @@
 	test.Next(_L("Get the directory entry and find how many files copied\n"));
 	// check SMALL files have been copied
 	r = dir.Open(TheFs, filePathNew, KEntryAttNormal);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	r = dir.Read(entryArray);
-	test (r == KErrEof);
+	test_Value(r, r == KErrEof);
 
 	test(entryArray.Count() == gFilesInDirectory); 
 	dir.Close();
 	
 	// then delete the new directory
 	r = fileMan->Delete(filePathNew);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	delete observer;
 	delete fileMan;
 	
 	r = TheFs.Delete(fileSmall1);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = TheFs.Delete(fileSmall2);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = TheFs.Delete(fileSmall3);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = TheFs.Delete(fileLarge1);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 /**
 @SYMTestCaseID      PBASE-T_FILE64BIT-2355
@@ -5718,21 +5723,21 @@
 
 	// move to new directory
 	TInt r = fileMan->Move(filePathOld, filePathNew, CFileMan::ERecurse | CFileMan::EOverWrite);
-	test(r == KErrNone || r == KErrTooBig);
+	test_Value(r, r == KErrNone || r == KErrTooBig);
 
 	// check SMALL and LARGE files have been moved
 	RDir dir;
 	r = dir.Open(TheFs, filePathNew, KEntryAttNormal);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	TEntryArray entryArray;
 	r = dir.Read(entryArray);
-	test (r == KErrEof);
+	test_Value(r, r == KErrEof);
 	test(entryArray.Count() == 4);
 	dir.Close();
 	
 	// then delete the new directory
 	r = fileMan->Delete(filePathNew);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	delete fileMan;
 	}
 
@@ -5756,13 +5761,13 @@
 	TInt r;
 	RFs fs;
 	r = fs.Connect();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = fs.ShareProtected();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	TFileName sessionp;
 	fs.SessionPath(sessionp);
 	r = fs.MkDirAll(sessionp);
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	fs.Close();
 	TestRFile64AdoptFromCreator();
 	TestRFile64AdoptFromClient();
@@ -5902,11 +5907,11 @@
 	
 	// If a zero length is passed into the Write function, KErrNone should be returned. 
 	r=aFile.Write(aPos,gBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	// If the length is a negative, KErrArgument should be returned. 
 	r=aFile.Write(aPos,gBuf,aLen);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	
 	// Test the asynchronous requests
 	aFile.Write(aPos,gBuf,aLen,status1);
@@ -5918,7 +5923,7 @@
 	
 	aFile.Close();
 	r = TheFs.Delete(_L("\\testRFile64NegLen.txt"));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test.End();	
 	}
 //-------------------------------------------------------------------------------------------------------------------
@@ -5980,7 +5985,7 @@
 	{
 	TInt r;
 	r = RFs::CharToDrive(gDriveToTest, gDrive);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
     //-- set up console output 
     F32_Test_Utils::SetConsole(test.Console()); 
@@ -6029,7 +6034,7 @@
 	dirName.Append(gDriveToTest);
 	dirName.Append(KTestPath);
 	r = TheFs.RmDir(dirName);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	}
 
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_findcapall.cpp
--- a/kerneltest/f32test/server/t_findcapall.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_findcapall.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -20,6 +20,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <e32test.h>
 #include <f32file.h>
 
@@ -47,7 +48,7 @@
 	
 	Err=FileServer.Connect();
 	
-	test(Err==KErrNone);
+	test_KErrNone(Err);
 	
     // RTest.Next is called from function "TestFind()".
     // RTest.Start is called here to start the test.
@@ -64,7 +65,7 @@
 			     _L("z:\\sys\\bin\\"),
 			     _L("nonexistingfile.txt"));
 	
-	test(Err==KErrNotFound);
+	test_Value(Err, Err == KErrNotFound);
 	
 	// Test: Find existing file in existing /sys folder
 	//
@@ -77,7 +78,7 @@
 			     _L("z:\\sys\\bin\\"),
 			     _L("t_findcaptestfile.txt"));
 	
-	test(Err==KErrNone);
+	test_KErrNone(Err);
 	
 	// Test: Find non existing file in existing / non existing /sys folder
 	//
@@ -90,7 +91,7 @@
 			     _L("c:\\sys\\"),
 			     _L("nonexisting.txt"));
 	
-	test(Err==KErrNotFound);
+	test_Value(Err, Err == KErrNotFound);
 	
 	// Test: Find existing file in /sys folder without specifying the path
 	//
@@ -103,7 +104,7 @@
 			     _L("\\sys\\bin\\"),
 			     _L("t_findcaptestfile.txt"));
 	
-	test(Err==KErrNone);
+	test_KErrNone(Err);
 	
 	// Test: Find non existing file in /sys folder without specifying the path
 	//
@@ -116,7 +117,7 @@
 			     _L("\\sys\\"),
 			     _L("nonexisting.txt"));
 	
-	test(Err==KErrNotFound);
+	test_Value(Err, Err == KErrNotFound);
 	
 	FileServer.Close();
 	
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_findcapnone.cpp
--- a/kerneltest/f32test/server/t_findcapnone.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_findcapnone.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -22,6 +22,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <e32test.h>
 #include <f32file.h>
 
@@ -49,7 +50,7 @@
 	
 	Err=FileServer.Connect();
 	
-	test(Err==KErrNone);
+	test_KErrNone(Err);
     
     // RTest.Next is called from function "TestFind()".
     // RTest.Start is called here to start the test.
@@ -66,7 +67,7 @@
 		         _L("z:\\sys\\bin\\"),
 		         _L("nonexistingfile.txt"));
 	
-	test(Err==KErrPermissionDenied);
+	test_Value(Err, Err == KErrPermissionDenied);
 	
 	// Test: Find existing file in existing /sys folder
 	//
@@ -79,7 +80,7 @@
 		         _L("z:\\sys\\bin\\"),
 		         _L("t_findcaptestfile.txt"));
 	
-	test(Err==KErrPermissionDenied);
+	test_Value(Err, Err == KErrPermissionDenied);
 	
 	// Test: Find non existing file in existing / non existing /sys folder
 	//
@@ -92,7 +93,7 @@
 		         _L("c:\\sys\\"),
 		         _L("nonexisting.txt"));
 	
-	test(Err==KErrPermissionDenied);
+	test_Value(Err, Err == KErrPermissionDenied);
 	
 	// Test: Find existing file in /sys folder without specifying the path
 	//
@@ -105,7 +106,7 @@
 		         _L("\\sys\\bin\\"),
 		         _L("t_findcaptestfile.txt"));
 	
-	test(Err==KErrPermissionDenied);
+	test_Value(Err, Err == KErrPermissionDenied);
 	
 	// Test: Find non existing file in /sys folder without specifying the path
 	//
@@ -118,7 +119,7 @@
 		         _L("\\sys\\"),
 		         _L("nonexisting.txt"));
 	
-	test(Err==KErrPermissionDenied);
+	test_Value(Err, Err == KErrPermissionDenied);
 	
 	FileServer.Close();
 	
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_fman.cpp
--- a/kerneltest/f32test/server/t_fman.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_fman.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -3926,7 +3926,7 @@
 	MakeDir(_L("C:\\F32-TST\\TFMAN\\DRIVEMOVE\\"));
 	TInt r=gFileMan->Move(_L("C:\\F32-TST\\TFMAN\\DRIVEMOVE\\*"),trgDrive,CFileMan::ERecurse);
 	test.Printf(_L("TestMoveEmptyDirectory(),gFileMan->Move(),r=%d\n"),r);
-	test (r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	}
 
 LOCAL_C void TestCopyAndRename()
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_fname.cpp
--- a/kerneltest/f32test/server/t_fname.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_fname.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <e32test.h>
 #include <f32dbg.h>
 #include <e32debug.h>
@@ -33,7 +34,7 @@
 	path[0] = xfn[0];
 	RLibrary lib;
 	TInt r=lib.Load(_L("t_start1.dll"), path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName name;
 	name=lib.FileName();
 	path += _L("t_start1.dll");
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_fnames.cpp
--- a/kerneltest/f32test/server/t_fnames.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_fnames.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -45,7 +46,7 @@
 	TBuf<32> badName=_L("\\< > : \" / |");
 	TParse parser;
 	TInt r=parser.Set(aName,NULL,NULL);
-	test(r==KErrNone || r==anError);
+	test_Value(r, r == KErrNone || r==anError);
 	goodName.Insert(0,parser.Drive());
 	badName.Insert(0,parser.Drive());
 	
@@ -167,7 +168,7 @@
     //-- TParse shall work correctly
     TParse parse;
     TInt err = parse.Set(dirName,NULL,NULL);
-    test( err == KErrNone );
+    test_KErrNone(err);
     
     //-- try to access a directory with a long name. This just shall not panic.
     //-- The return code can be any, on the emulator it's very likely to be KErrBadname
@@ -191,7 +192,7 @@
     //-- create a dir c:\a
     _LIT(dirName, "C:\\a\\");
     TInt err = rfs.MkDir(dirName);
-    test(err == KErrNone || err == KErrAlreadyExists);
+    test_Value(err, err == KErrNone || err == KErrAlreadyExists);
     
     if(err == KErrAlreadyExists)
         bDirExisted = ETrue;
@@ -202,7 +203,7 @@
     
     //-- try to create a directory with a very long name, checking that it doesn't get truncated to the "c:\a"
     err = rfs.MkDir(longDirName);
-    test(err == KErrBadName);
+    test_Value(err, err == KErrBadName);
 
     //-- clean up, remove created directory, otherwise some ill-designed tests can fail
     if(!bDirExisted)
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_format.cpp
--- a/kerneltest/f32test/server/t_format.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_format.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -40,7 +40,7 @@
 	RFormat format;
 	TInt count;
 	TInt r=format.Open(TheFs,b,EHighDensity,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	format.Close();
 	}
 
@@ -96,9 +96,9 @@
 
 	RFs fs;
 	TInt ret=fs.Connect();
-	test(ret==KErrNone);
+	test_KErrNone(ret);
 	ret=fs.SetSessionPath(gSessionPath);
-	test(ret==KErrNone);
+	test_KErrNone(ret);
 	TTestCode testCode=*(TTestCode*)&aTestCode;
 	TInt count;
 	RFormat format;
@@ -107,10 +107,10 @@
 		case ETest3:
 			{
 			ret=format.Open(fs,gSessionPath,EQuickFormat,count);
-			test(ret==KErrNone);
+			test_KErrNone(ret);
 			
             ret = DoFormatSteps(format, count);
-            test(ret==KErrNone);
+            test_KErrNone(ret);
 	
             format.Close();
 			break;
@@ -118,7 +118,7 @@
 		case ETest5:
 			{
 			ret=format.Open(fs,gSessionPath,EFullFormat,count);
-			test(ret==KErrNone);
+			test_KErrNone(ret);
 			gSleepThread.Signal();
 			User::After(100000000);		
 			break;
@@ -139,7 +139,7 @@
     
 	RRawDisk raw;
 	TInt r=raw.Open(TheFs,CurrentDrive());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if (!Is_Lffs(TheFs, gDrive))
 		{
 		TBuf8<KSectorSize> zeroBuf(KSectorSize);
@@ -151,7 +151,7 @@
         for(TInt i=0; i<KMaxSectors; ++i)
             {
             r=raw.Write(i*KSectorSize, zeroBuf);
-		    test(r==KErrNone);
+		    test_KErrNone(r);
             }
 		}
 	else
@@ -174,7 +174,7 @@
 				// aligned 32-byte blocks, we don't need to bother that much.
 				// The device driver writes the block but fails when reading
 				// it back.
-				// test(r==KErrNone);
+				// test_KErrNone(r);
 				}
 			}
 		else if(cntlModeSize>0)
@@ -238,16 +238,16 @@
 	RFormat format;
 
 	TInt r=format.Open(TheFs,gSessionPath,EFullFormat,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     r = DoFormatSteps(format, count);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
 	format.Close();
 	
 	TVolumeInfo volInfo;
 	r=TheFs.Volume(volInfo);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	if (volInfo.iSize-volInfo.iFree!=0)
 		{
@@ -258,15 +258,15 @@
 		
 	test.Next(_L("Test EQuickFormat"));
 	r=format.Open(TheFs,gSessionPath,EQuickFormat,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     r = DoFormatSteps(format, count);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
 	format.Close();
 
 	r=TheFs.Volume(volInfo);
-	test(r==KErrNone);
+	test_KErrNone(r);
 		
 	if (volInfo.iSize-volInfo.iFree!=0)
 		{
@@ -288,16 +288,16 @@
 	test.Next(_L("Test disk cannot be formatted while a file is open"));
 	RFile f;
 	TInt r=f.Replace(TheFs,_L("BLARGME.BLARG"),EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TInt count;
 	RFormat format;
 	r=format.Open(TheFs,gSessionPath,EFullFormat,count);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	f.Close();
 	r=format.Open(TheFs,gSessionPath,EFullFormat,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	format.Close();
 
 	CheckFileExists(_L("BLARGME.BLARG"),KErrNone);
@@ -318,7 +318,7 @@
 	RThread clientThread;
 	TInt r=clientThread.Create(_L("ClientThread"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest3);
 	test.Printf(_L("Created helper thread #1, res=%d\n"),r);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	clientThread.Logon(gThreadLogon);
 	clientThread.Resume();
@@ -336,7 +336,7 @@
 	TheFs.NotifyChange(ENotifyAll,reqStat);
 	r=clientThread.Create(_L("ClientThread"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest3);
     test.Printf(_L("Created helper thread #2, res=%d\n"),r);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 	clientThread.Logon(gThreadLogon);
@@ -375,15 +375,15 @@
 
 	RFormat format;
 	TInt r=format.Open(TheFs,gSessionPath,EFullFormat,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	while(count)
 		{
 		RDir dir;
 		r=dir.Open(TheFs,_L("\\*.*"),KEntryAttNormal);
-		test(r==KErrInUse);
+		test_Value(r, r == KErrInUse);
 		r=format.Next(count);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	format.Close();
 
@@ -418,7 +418,7 @@
 	RThread clientThread;
 	TInt r=clientThread.Create(_L("ClientThread"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest5);
 	test.Printf(_L("Created helper thread #1, res=%d\n"),r);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     test.Printf(_L("Panicing formatting thread #1\n"));	
 	clientThread.Resume();
@@ -438,7 +438,7 @@
 //	}
 //	else
 //	{
-	test(r==KErrCorrupt);
+	test_Value(r, r == KErrCorrupt);
 //	}
 
     test.Printf(_L("Formatting the drive...\n"));	
@@ -446,10 +446,10 @@
 	TInt count;
 	RFormat format;
 	r=format.Open(TheFs,gSessionPath,EQuickFormat,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
     r = DoFormatSteps(format, count);
-    test(r==KErrNone);
+    test_KErrNone(r);
 	
     format.Close();
 
@@ -469,51 +469,51 @@
 	test.Next(_L("Test ramdrive shrinks after formatting"));
 	TVolumeInfo volInfo;
 	TInt r=TheFs.Volume(volInfo);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if ((volInfo.iDrive.iMediaAtt&KMediaAttVariableSize)==0)
 		return;
 
 	TInt64 used=volInfo.iSize-volInfo.iFree;
 	RFile f;
 	r=f.Replace(TheFs,_L("BIGFILE.SIZE"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.SetSize(0x100000); // 1MB
 	f.Close();
 
 	r=TheFs.Volume(volInfo);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt64 used2=volInfo.iSize-volInfo.iFree;
 	test(used<used2);
 
 	r=TheFs.Delete(_L("BIGFILE.SIZE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Volume(volInfo);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	used2=volInfo.iSize-volInfo.iFree;
 	test(used==used2);
 
 	r=f.Replace(TheFs,_L("BIGFILE.SIZE"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.SetSize(0x100000); // 1MB
 	f.Close();
 
 	r=TheFs.Volume(volInfo);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	used2=volInfo.iSize-volInfo.iFree;
 	test(used<used2);
 
 	TInt count;
 	RFormat format;
 	r=format.Open(TheFs,gSessionPath,EQuickFormat,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
     r = DoFormatSteps(format, count);
-    test(r==KErrNone);
+    test_KErrNone(r);
 	
     format.Close();
 
 	r=TheFs.Volume(volInfo);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	used2=volInfo.iSize-volInfo.iFree;
 	test(used>=used2);
 	}
@@ -535,7 +535,7 @@
 	
     TVolumeInfo volInfo;
 	TInt r=TheFs.Volume(volInfo);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
     if (volInfo.iDrive.iMediaAtt&KMediaAttVariableSize)
 		return; // Don't bother on internal disk
@@ -550,10 +550,10 @@
 	TInt count;
 	RFormat format;
 	r=format.Open(TheFs,gSessionPath,EQuickFormat,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     r = DoFormatSteps(format, count);
-    test(r==KErrNone);
+    test_KErrNone(r);
 
 	format.Close();
 	}
@@ -585,33 +585,33 @@
 	
     TVolumeInfo volInfo;
 	TInt r=TheFs.Volume(volInfo);
-//	test(r==KErrCorrupt);
+//	test_Value(r, r == KErrCorrupt);
 	TInt count;
 	RFormat format;
 	r=format.Open(TheFs,gSessionPath,EQuickFormat,count);
 	r=TheFs.Volume(volInfo);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=format.Next(count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TDriveList driveList;
 	r=TheFs.DriveList(driveList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
     if(gDrive == EDriveC)
     {
 		r=TheFs.Volume(volInfo, gDrive);
-		test(r==KErrInUse);
+		test_Value(r, r == KErrInUse);
     } 
     else
     {
 		r=TheFs.Volume(volInfo,EDriveC);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		r=TheFs.Volume(volInfo,gDrive);	
-		test(r==KErrInUse);
+		test_Value(r, r == KErrInUse);
 
     	r=TheFs.Volume(volInfo,gDrive);	
-		test(r==KErrInUse);
+		test_Value(r, r == KErrInUse);
     }
 
     
@@ -664,7 +664,7 @@
     fmtMode = EQuickFormat;
 
     nRes = format.Open(TheFs, drivePath, fmtMode, fmtCnt);
-    test(nRes == KErrInUse);
+    test_Value(nRes, nRes == KErrInUse);
     format.Close();
 
     buf8.SetLength(22);
@@ -679,7 +679,7 @@
 
     fmtMode = EQuickFormat;
     nRes = format.Open(TheFs, drivePath, fmtMode, fmtCnt);
-    test(nRes == KErrInUse);
+    test_Value(nRes, nRes == KErrInUse);
     format.Close();
 
     dir.Close();
@@ -707,11 +707,11 @@
 
  
 	nRes=TheFs.CheckDisk(gSessionPath);
-	test(nRes==KErrNone||nRes==KErrNotSupported);
+	test_Value(nRes, nRes == KErrNone||nRes==KErrNotSupported);
 
     buf8.SetLength(22);
     nRes = file1.Write(buf8);
-    test(nRes == KErrDisMounted);
+    test_Value(nRes, nRes == KErrDisMounted);
     file1.Close();  //-- this will make the previously "Dismounted" mount die.
     dir.Close();
 
@@ -734,11 +734,11 @@
     format.Close();
 
 	nRes=TheFs.CheckDisk(gSessionPath);
-	test(nRes==KErrNone||nRes==KErrNotSupported);
+	test_Value(nRes, nRes == KErrNone||nRes==KErrNotSupported);
 
     buf8.SetLength(22);
     nRes = file1.Write(buf8);
-    test(nRes == KErrDisMounted);
+    test_Value(nRes, nRes == KErrDisMounted);
     file1.Close();  //-- this will make the previously "Dismounted" mount die.
 
     //---------------------------------------------------------------------------------
@@ -754,7 +754,7 @@
 
     fmtMode = EQuickFormat;
     nRes = format.Open(TheFs, drivePath, fmtMode, fmtCnt);
-    test(nRes == KErrInUse);
+    test_Value(nRes, nRes == KErrInUse);
     format.Close();
 
     test(stat1.Int() == KRequestPending);
@@ -769,7 +769,7 @@
 
     buf8.SetLength(22);
     nRes = file1.Write(buf8);
-    test(nRes == KErrDisMounted);
+    test_Value(nRes, nRes == KErrDisMounted);
     file1.Close();  
 
     //---------------------------------------------------------------------------------
@@ -789,7 +789,7 @@
     format.Close();
 
     nRes = file1.Write(buf8);
-    test(nRes == KErrDisMounted);
+    test_Value(nRes, nRes == KErrDisMounted);
     file1.Close();  
 
 
@@ -801,11 +801,11 @@
     RFormat     format1;
 
     nRes = format1.Open(TheFs, drivePath, fmtMode, fmtCnt);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     
     fmtMode = EQuickFormat | EForceFormat; 
     nRes = format.Open(TheFs, drivePath, fmtMode, fmtCnt); 
-    test(nRes == KErrInUse);
+    test_Value(nRes, nRes == KErrInUse);
     format.Close();
 
     format1.Close();
@@ -813,11 +813,11 @@
     //-- 5.1 check that forced formatting will fail when there are "disk access" objects opened RRawDisk
     RRawDisk    rawDisk;
     nRes = rawDisk.Open(TheFs, gDrive);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     fmtMode = EQuickFormat | EForceFormat; 
     nRes = format.Open(TheFs, drivePath, fmtMode, fmtCnt); 
-    test(nRes == KErrInUse);
+    test_Value(nRes, nRes == KErrInUse);
     format.Close();
 
     rawDisk.Close();
@@ -847,7 +847,7 @@
     {
         fmtMode = EQuickFormat | EForceFormat; 
         nRes = format.Open(TheFs, drivePath, fmtMode, fmtCnt); 
-        test(nRes == KErrInUse);
+        test_Value(nRes, nRes == KErrInUse);
         format.Close();
     }
     
@@ -867,13 +867,13 @@
 
     TInt r;
     r = TheFs.CharToDrive(gDriveToTest, gDrive);
-    test(r == KErrNone);
+    test_KErrNone(r);
 
     //-- set up console output 
     F32_Test_Utils::SetConsole(test.Console()); 
     
     TInt nRes=TheFs.CharToDrive(gDriveToTest, gDrive);
-    test(nRes==KErrNone);
+    test_KErrNone(nRes);
     
     PrintDrvInfo(TheFs, gDrive);
 
@@ -894,7 +894,7 @@
     TestFormat_ForceDismount();
 
 	r=TheFs.CheckDisk(gSessionPath);
-	test(r==KErrNone||r==KErrNotSupported);
+	test_Value(r, r == KErrNone||r==KErrNotSupported);
 	}
 
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_fsched.cpp
--- a/kerneltest/f32test/server/t_fsched.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_fsched.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1277,7 +1277,7 @@
 	
 	TBool simulatelockFailureMode = EFalse;
 	r = controlIo(TheFs, gDrive, KControlIoSimulateLockFailureMode, simulatelockFailureMode);
-	test (r == KErrNone  ||  r == KErrNotSupported);
+	test_Value(r, r == KErrNone  ||  r == KErrNotSupported);
 #endif
 
 	// FileNames/File generation
@@ -1366,7 +1366,7 @@
 	// turn lock failure mode back ON (if cache is enabled)
 	simulatelockFailureMode = ETrue;
 	r = controlIo(TheFs, gDrive, KControlIoSimulateLockFailureMode, simulatelockFailureMode);
-    test (r == KErrNone  ||  r == KErrNotSupported);
+    test_Value(r, r == KErrNone  ||  r == KErrNotSupported);
 #endif
 
 	test.End();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_fsrv.cpp
--- a/kerneltest/f32test/server/t_fsrv.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_fsrv.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -99,9 +99,9 @@
 	test.Start(_L("Path test thread"));
 	RFs f;
 	TInt r=f.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.SessionPath(tPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 
 	return(KErrNone);
@@ -209,59 +209,55 @@
  	 
  	test.Printf(_L("Dismounting the Remote Drive returned %d\n"),r);
  	
- 	test(r==KErrNone );
+ 	test_Value(r, r == KErrNone );
 	}
 
 
 LOCAL_C void CreateSubstDrive()
 	{
-     test.Printf(_L("Create Substitute Drive \n"));
-    
-    TDriveList driveList;   
-    TInt i ;
-      
-    TInt r=TheFs.SessionPath(gTestSessionPath);
-	test(r==KErrNone);  
+	test.Printf(_L("Create Substitute Drive \n"));
+
+	TDriveList driveList;   
+
+	TInt r=TheFs.SessionPath(gTestSessionPath);
+	test_KErrNone(r);
  	
  	r=TheFs.DriveList(driveList, KDriveAttExclude|KDriveAttLocal);
-   	test( r==KErrNone );
+   	test_KErrNone(r);
    
 
-   	for ( i = EDriveO; i < KMaxDrives; i++) 
-      	{
-    
-      	if ( driveList[i] == 0) 
-          	{
-          	if (i == EDriveQ) continue;  // Q reserved to mount a virtual Remote Drive, as part of the test.
-        	substDrive = i;
-          	break;          
-          	}
-      	}
-           
-   
+	for (TInt i = EDriveO; i < KMaxDrives; i++)
+		{
+		if (driveList[i] == 0)
+			{
+			if (i == EDriveQ)
+				continue;  // Q reserved to mount a virtual Remote Drive, as part of the test.
+			substDrive = i;
+			break;
+			}
+		}
+
    	if (substDrive)
    		{
  		TDriveInfo driveInfo;
 		r=TheFs.Drive(driveInfo,substDrive);
-		test(r==KErrNone);
+		test_KErrNone(r);
 	
 		if (driveInfo.iDriveAtt==KDriveAttLocal)
-			{	
+			{
 			return;	//	Subst local drives fails
 			}
 	
 		TFileName n;
 		r=TheFs.Subst(n,substDrive);
-		test(r==KErrNone);
-		test(n.Length()==0);	
+		test_KErrNone(r);
+		test_Value(n.Length(), n.Length() == 0);
 		r=TheFs.SetSubst(gTestSessionPath,substDrive);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=TheFs.Subst(n,substDrive);
-		test(r==KErrNone);
-		test(n==gTestSessionPath);   		
+		test_KErrNone(r);
+		test(n==gTestSessionPath);
    		}
-
-	
 	}
 
 		
@@ -269,9 +265,9 @@
 	{
 	 	if( substDrive)
 	 		{
-	 		test.Printf(_L("Removing Substitute Drive \n"));	 	 
-	 		TInt r =TheFs.SetSubst(_L(""),substDrive);	
-			test(r ==KErrNone);	 		
+	 		test.Printf(_L("Removing Substitute Drive \n"));
+	 		TInt r =TheFs.SetSubst(_L(""),substDrive);
+			test_KErrNone(r);
 	 		}
 
 	}
@@ -284,16 +280,16 @@
 //
 	{
 
-	test(anInfo.iConnectionBusType==EConnectionBusInternal || anInfo.iConnectionBusType==EConnectionBusUsb);
+	test_Value(anInfo.iConnectionBusType, anInfo.iConnectionBusType==EConnectionBusInternal || anInfo.iConnectionBusType==EConnectionBusUsb);
 	
 	if (aDrive==EDriveZ)
 		{
 		if (anInfo.iType==EMediaNotPresent)
 			return;
 		
-		test(anInfo.iMediaAtt==KMediaAttWriteProtected);
-		test(anInfo.iDriveAtt==(KDriveAttRom|KDriveAttInternal));
-		test(anInfo.iType==EMediaRom);
+		test_Value(anInfo.iMediaAtt, anInfo.iMediaAtt==KMediaAttWriteProtected);
+		test_Value(anInfo.iDriveAtt, anInfo.iDriveAtt==(KDriveAttRom|KDriveAttInternal));
+		test_Value(anInfo.iType, anInfo.iType==EMediaRom);
 		}
 
 	else if (GetDriveLFFS()==aDrive)
@@ -301,9 +297,9 @@
         if (anInfo.iType==EMediaNotPresent)
             return;
 
-		test(anInfo.iDriveAtt&(KDriveAttLocal|KDriveAttInternal)==KDriveAttLocal|KDriveAttInternal);	// LFFS sets KDriveAttTransaction as well
-        test(anInfo.iType==EMediaFlash);
-        test(anInfo.iMediaAtt==KMediaAttFormattable);
+		test_Value(anInfo.iDriveAtt, anInfo.iDriveAtt&(KDriveAttLocal|KDriveAttInternal)==KDriveAttLocal|KDriveAttInternal);	// LFFS sets KDriveAttTransaction as well
+        test_Value(anInfo.iType, anInfo.iType==EMediaFlash);
+        test_Value(anInfo.iMediaAtt, anInfo.iMediaAtt==KMediaAttFormattable);
 		}
 /*
 Why assume certain drive letters can only refer to certain drive types?
@@ -381,17 +377,17 @@
     test.Printf(_L("Test existing DriveList \n"));
     
     err = TheFs.DriveList(driveList);
-    test( err == KErrNone );
+	test_KErrNone(err);
     
     for ( i = 0; i < KMaxDrives; i++) 
         {
         if (driveList[i]) 
             {
             err = TheFs.Drive(info, i);
-            test( err == KErrNone );
-            test( info.iType  !=  EMediaRemote  );
-            test( !(info.iDriveAtt & KDriveAttRemote ) ); 
-			test( !(info.iDriveAtt & KDriveAttHidden ) );
+			test_KErrNone(err);
+            test_Value(info.iType, info.iType != EMediaRemote);
+            test_Value(info.iDriveAtt, !(info.iDriveAtt & KDriveAttRemote)); 
+			test_Value(info.iDriveAtt, !(info.iDriveAtt & KDriveAttHidden));
             drivecount++; 
             
             if( info.iDriveAtt  & KDriveAttRemovable) 
@@ -430,13 +426,13 @@
    flags = KDriveAttAll;
    err = TheFs.DriveList(driveList, flags);
 
-   test( err == KErrNone );
+	test_KErrNone(err);
    for ( i = 0; i < KMaxDrives; i++) 
        {
        if (driveList[i]) 
            {
            err = TheFs.Drive(info,i);
-           test( err == KErrNone );
+			test_KErrNone(err);
            allDrivecount++;
            
            if( info.iDriveAtt  & KDriveAttSubsted ) 
@@ -462,9 +458,6 @@
            }
         }  
 
- 	test(allDrivecount == drivecount + hiddenOrRemoteDriveCount);
-	test(hiddenOrRemoteDriveCount - hiddenDriveCount == 1);
-
 	test.Printf(_L("Found %d substitute drives\n"), substDriveCount);
 	test.Printf(_L("Found %d exclusively substitute  drives \n"),exclusiveSubstDriveCount);
 	test.Printf(_L("Found %d hidden drives\n"), hiddenDriveCount);
@@ -475,6 +468,9 @@
 	test.Printf(_L("Found %d physically removable drives \n"),physicallyRemovable);
 	test.Printf(_L("Found %d logically removable drives \n"),logicallyRemovableDriveCount);
   
+ 	test(allDrivecount == drivecount + hiddenOrRemoteDriveCount);
+	test(hiddenOrRemoteDriveCount - hiddenDriveCount == 1);
+
   
   	//--------------------------------------------- 
 	//! @SYMTestCaseID			PBASE-T_FSRV-0546
@@ -495,22 +491,22 @@
 	
     flags = KDriveAttRemovable;
     err = TheFs.DriveList(driveList, flags);
-    test( err == KErrNone );
+	test_KErrNone(err);
     for ( i = 0; i < KMaxDrives; i++) 
         {
         if (driveList[i]) 
             {
             err = TheFs.Drive(info, i);
-            test( err == KErrNone );
-            test( info.iDriveAtt & KDriveAttRemovable );
-            drivecount++; 
+			test_KErrNone(err);
+            test_Value(info.iDriveAtt, info.iDriveAtt & KDriveAttRemovable);
+            drivecount++;
       
             printDriveAtt(i,info.iDriveAtt);
             }
 
         }
 
-    test( drivecount == removableDriveCount ); // no removable drive was added
+	test_Value(drivecount, drivecount == removableDriveCount); // no removable drive was added
 
 
   	//--------------------------------------------- 
@@ -531,14 +527,14 @@
     drivecount = 0;
     flags = KDriveAttRemovable | KDriveAttRemote;
     err = TheFs.DriveList(driveList, flags);
-    test( err == KErrNone );
+	test_KErrNone(err);
     for ( i = 0; i < KMaxDrives; i++) 
         {
         if (driveList[i]) 
             {
             err = TheFs.Drive(info, i);
-            test( err == KErrNone );
-            test( (info.iDriveAtt & KDriveAttRemovable ) || (info.iDriveAtt & KDriveAttRemote)); 
+			test_KErrNone(err);
+            test_Value(info.iDriveAtt, (info.iDriveAtt & KDriveAttRemovable ) || (info.iDriveAtt & KDriveAttRemote)); 
             drivecount++; 
            
            	printDriveAtt(i,info.iDriveAtt);
@@ -546,7 +542,7 @@
             }
 
         }
-    test( drivecount == removableDriveCount + 1 );  //contains the remote drive we mounted
+	test_Value(drivecount, drivecount == removableDriveCount + 1 );  //contains the remote drive we mounted
     
 
   	//--------------------------------------------- 
@@ -568,21 +564,21 @@
     flags = KDriveAttExclusive | KDriveAttRemote;
     TUint match = KDriveAttRemote;
     err = TheFs.DriveList(driveList, flags);
-    test( err == KErrNone );
+	test_KErrNone(err);
     for ( i = 0; i < KMaxDrives; i++) 
         {
         if (driveList[i]) 
             {
             err = TheFs.Drive(info, i);
-            test( err == KErrNone );
-            test( (info.iDriveAtt == match)); 
+			test_KErrNone(err);
+            test_Value(info.iDriveAtt, (info.iDriveAtt == match)); 
             drivecount++;
             
             printDriveAtt(i,info.iDriveAtt);
             }
 
         }
-   	test( drivecount == 1 ); //The remote drive we mounted.
+   	test_Value(drivecount, drivecount == 1); //The remote drive we mounted.
 
 
   	//--------------------------------------------- 
@@ -603,22 +599,22 @@
    drivecount = 0; 	
    flags = KDriveAttExclude | KDriveAttRemovable;
    err = TheFs.DriveList(driveList, flags);
-   test( err == KErrNone );
+	test_KErrNone(err);
    for (i = 0; i < KMaxDrives; i++) 
        {
        if (driveList[i]) 
            {
            err = TheFs.Drive(info, i);
-           test( err == KErrNone );
-           test( (!(info.iDriveAtt & KDriveAttRemovable ) )); 
+			test_KErrNone(err);
+           test_Value(info.iDriveAtt, (!(info.iDriveAtt & KDriveAttRemovable ) )); 
            drivecount++;
            
            printDriveAtt(i,info.iDriveAtt);
            }
 
        }  
-     test ( drivecount == allDrivecount - removableDriveCount); 
-	 test ( drivecount == nonRemovables + hiddenDriveCount + 1) ;   //The remote drive we added is non removable  
+     test_Value(drivecount, drivecount == allDrivecount - removableDriveCount); 
+	 test_Value (drivecount, drivecount == nonRemovables + hiddenDriveCount + 1) ;   //The remote drive we added is non removable  
 
 
 
@@ -643,21 +639,21 @@
    flags = KDriveAttExclude | KDriveAttRemovable | KDriveAttRemote;
    err = TheFs.DriveList(driveList, flags);
    
-   test( err == KErrNone );
+	test_KErrNone(err);
    
    for ( i = 0; i < KMaxDrives; i++) 
        {
        if (driveList[i]) 
            {
            err = TheFs.Drive(info,i);
-           test( err == KErrNone );
-           test( (!(info.iDriveAtt & KDriveAttRemovable ) && (!(info.iDriveAtt & KDriveAttRemote ))));
+			test_KErrNone(err);
+           test_Value(info.iDriveAtt, (!(info.iDriveAtt & KDriveAttRemovable ) && (!(info.iDriveAtt & KDriveAttRemote ))));
            drivecount++;
            
            printDriveAtt(i,info.iDriveAtt);
            }
        }
-   test(drivecount == (allDrivecount - removableDriveCount - 1)  ); // also excluding the removables and the remote drive   
+	test_Value(drivecount, drivecount == (allDrivecount - removableDriveCount - 1)  ); // also excluding the removables and the remote drive   
   
   
 
@@ -687,21 +683,21 @@
    		flags = KDriveAttExclude | KDriveAttRemote | KDriveAttSubsted;
    		err = TheFs.DriveList(driveList, flags);
    
-   		test( err == KErrNone );
+		test_KErrNone(err);
    
    		for ( i = 0; i < KMaxDrives; i++) 
        		{
        		if (driveList[i]) 
            		{
            		err = TheFs.Drive(info,i);
-           		test( err == KErrNone );
-           		test( (!(info.iDriveAtt & KDriveAttRemote )  && (!(info.iDriveAtt & KDriveAttSubsted ))));
+			test_KErrNone(err);
+           		test_Value(info.iDriveAtt, (!(info.iDriveAtt & KDriveAttRemote )  && (!(info.iDriveAtt & KDriveAttSubsted ))));
            		drivecount++;
            
            		printDriveAtt(i,info.iDriveAtt);
            		}
        		}
-    	test(drivecount == (allDrivecount - substDriveCount- 1)  );    
+		test_Value(drivecount, drivecount == (allDrivecount - substDriveCount- 1)  );    
 
 
 		
@@ -711,15 +707,15 @@
    		flags = KDriveAttExclusive | KDriveAttExclude | KDriveAttSubsted;
    		err = TheFs.DriveList(driveList, flags);
    
-   		test( err == KErrNone );
+		test_KErrNone(err);
    
    		for ( i = 0; i < KMaxDrives; i++) 
        		{
        		if (driveList[i]) 
            		{
            		err = TheFs.Drive(info,i);
-           		test( err == KErrNone );
-           		test( info.iDriveAtt != KDriveAttSubsted );
+				test_KErrNone(err);
+           		test_Value(info.iDriveAtt, info.iDriveAtt != KDriveAttSubsted);
            		drivecount++;
            
            		printDriveAtt(i,info.iDriveAtt);
@@ -727,7 +723,7 @@
    		    
    		    }
     
-		test(drivecount == (allDrivecount - exclusiveSubstDriveCount)  );        
+		test_Value(drivecount, drivecount == (allDrivecount - exclusiveSubstDriveCount)  );        
 		
 		}
 
@@ -767,14 +763,14 @@
 
 	TDriveList fullDriveList;
 	err = TheFs.DriveList(fullDriveList, KDriveAttAll);
-	test( err == KErrNone );
+	test_KErrNone(err);
 
 	for ( i = 0; i < KMaxDrives; i++) 
 		{
 		if (driveList[i]) 
 			{
 			err = TheFs.Drive(info,i);
-			test( err == KErrNone );
+			test_KErrNone(err);
 			printDriveAtt(i,info.iDriveAtt);
 			}
 		}
@@ -794,14 +790,14 @@
 			//test.Printf(_L("Expected Result : %d     \n"), testAtt == 0 ? testCombinations[matchIdx].iExpectedResultNoAtts : testCombinations[matchIdx].iExpectedResultWithAtts);
 			//test.Printf(_L("  Actual Result : 0x%08x \n"), err);
 
-			test( err == (testAtt == 0 ? testCombinations[matchIdx].iExpectedResultNoAtts : testCombinations[matchIdx].iExpectedResultWithAtts) );
+			test_Value(err, err == (testAtt == 0 ? testCombinations[matchIdx].iExpectedResultNoAtts : testCombinations[matchIdx].iExpectedResultWithAtts));
 
 			if(err == KErrNone)
 				{
 				//printDriveAtt(0, testAtt);  //Prints attributes   
 				for ( i = 0; i < KMaxDrives; i++) 
 					{
-					TBool expectMatch = EFalse;                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             
+					TBool expectMatch = EFalse;
 
 					switch(testCombinations[matchIdx].iMatchMask)
 						{
@@ -813,11 +809,11 @@
 							expectMatch = ETrue;
 							break;
 
-						case KDriveAttExclude :
+						case KDriveAttExclude:
 							expectMatch = (fullDriveList[i] & testAtt) == 0;
 							break;
 
-						case KDriveAttExclusive :
+						case KDriveAttExclusive:
 							expectMatch = (fullDriveList[i] == testAtt);
 							break;
 
@@ -825,20 +821,14 @@
 							expectMatch = (fullDriveList[i] != testAtt);
 							break;
 	
-						case KDriveAttAll | KDriveAttExclude :
-							test(0);	// Invalid - should never get here as this returns KErrArgument for all cases
-							break;
-
-						case KDriveAttAll | KDriveAttExclusive :
-							test(0);	// Invalid - should never get here as this returns KErrArgument for all cases
-							break;
-
-						case KDriveAttAll | KDriveAttExclude | KDriveAttExclusive :
-							test(0);	// Invalid - should never get here as this returns KErrArgument for all cases
-							break;
-
+						case KDriveAttAll | KDriveAttExclude:
+							// Invalid - should never get here as this returns KErrArgument for all cases
+						case KDriveAttAll | KDriveAttExclusive:
+							// Invalid - should never get here as this returns KErrArgument for all cases
+						case KDriveAttAll | KDriveAttExclude | KDriveAttExclusive:
+							// Invalid - should never get here as this returns KErrArgument for all cases
 						default:
-							test.Printf(_L("Unexpected Match Mask %08x"), testCombinations[matchIdx].iMatchMask);
+							test.Printf(_L("Unexpected or invalid Match Mask %08x"), testCombinations[matchIdx].iMatchMask);
 							test(0);
 							break;
 						}
@@ -846,7 +836,7 @@
 					if(expectMatch) 
 						{
 						//test.Printf(_L(" %c MATCHED OK "), 'A' + i);
-						test(newDriveList[i] == fullDriveList[i]);
+						test_Value(newDriveList[i], newDriveList[i] == fullDriveList[i]);
 						}
 					else
 						{
@@ -859,7 +849,7 @@
 							test.Printf(_L(" %c NOT MATCHED "), 'A' + i);
 							}
 						*/
-						test(newDriveList[i] == 0);
+						test_Value(newDriveList[i], newDriveList[i] == 0);
 						}
 					}
 				}
@@ -885,14 +875,14 @@
  	drivecount = 0;
     flags = KDriveAttLogicallyRemovable;
     err = TheFs.DriveList(driveList, flags);
-    test( err == KErrNone );
+	test_KErrNone(err);
     for ( i = 0; i < KMaxDrives; i++) 
         {
         if (driveList[i]) 
             {
             err = TheFs.Drive(info, i);
-            test( err == KErrNone );
-            test( info.iDriveAtt & KDriveAttLogicallyRemovable );
+			test_KErrNone(err);
+            test_Value(info.iDriveAtt, info.iDriveAtt & KDriveAttLogicallyRemovable);
             drivecount++; 
       
             printDriveAtt(i,info.iDriveAtt);
@@ -900,8 +890,7 @@
 
         }
 
-    test( drivecount == logicallyRemovableDriveCount ); // no logically removable drive was added
- 
+    test_Value(drivecount, drivecount == logicallyRemovableDriveCount); // no logically removable drive was added
 
 	test.End();
 	}
@@ -921,7 +910,7 @@
 	test.Start(_L("The drive info"));
 	TDriveList list;
 	TInt r=TheFs.DriveList(list);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	for (TInt i=0;i<KMaxDrives;i++)
 		{
 		TInt att=list[i];
@@ -929,7 +918,7 @@
 			{
 			TDriveInfo d;
 			r=TheFs.Drive(d,i);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			printDriveInfo(i,d);
 			test.Printf(_L("\n"));
 			testDriveInfo(i,d);
@@ -948,7 +937,7 @@
 	test.Start(_L("The volume info"));
 	TDriveList list;
 	TInt r=TheFs.DriveList(list);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	for (TInt i=0;i<KMaxDrives;i++)
 		{
 		TVolumeInfo v;
@@ -1012,7 +1001,7 @@
 			}
 		else
 			r=f.Set(name,NULL,NULL);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(TPtrC(p.fullName)==f.FullName());
 		test(TPtrC(p.drive)==f.Drive());
 		test(TPtrC(p.path)==f.Path());
@@ -1032,28 +1021,28 @@
 	test.Start(_L("Test path handling"));
 	TFileName p;
 	TInt r=TheFs.SessionPath(p);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("SESSION=\"%S\"\n"),&p);
 	r=TheFs.SetSessionPath(_L("A:\\TEST\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(p);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(p==_L("A:\\TEST\\"));
 	r=TheFs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 	TheFs.SetAllocFailure(gAllocFailOff);
 
 	RThread t;
 	r=t.Create(_L("PathTest"),pathTestThread,KDefaultStackSize,KHeapSize,KHeapSize,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TRequestStatus tStat;
 	t.Logon(tStat);
 	t.Resume();
 	User::WaitForRequest(tStat);
-	test(tStat==KErrNone);
-	test(r==KErrNone);
+	r = tStat.Int();
+	test_KErrNone(r);
 	t.Close();
 
 	TheFs.SetAllocFailure(gAllocFailOn);
@@ -1071,9 +1060,9 @@
 
 	TFileName old;
 	TInt r=TheFs.SessionPath(old);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetSessionPath(_L("C:\\ABCDEF\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	for (TInt i=0;i<KMaxParses;i++)
 		{
 		TInt r;
@@ -1084,7 +1073,7 @@
 			r=TheFs.Parse(name,TPtrC(p.rel),f);
 		else
 			r=TheFs.Parse(name,f);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(TPtrC(p.fullName)==f.FullName());
 		test(TPtrC(p.drive)==f.Drive());
 		test(TPtrC(p.path)==f.Path());
@@ -1092,7 +1081,7 @@
 		test(TPtrC(p.ext)==f.Ext());
 		}
 	r=TheFs.SetSessionPath(old);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.End();
 	}
@@ -1106,14 +1095,14 @@
 	test.Printf(_L("Test subst"));
 	TVolumeInfo v;
 	TInt r=TheFs.Volume(v);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TDriveInfo origDI;
 	r=TheFs.Drive(origDI);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TDriveInfo driveInfo;
 	r=TheFs.Drive(driveInfo,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	if (driveInfo.iDriveAtt==KDriveAttLocal)
 		{	
@@ -1122,40 +1111,40 @@
 	
 	TFileName n;
 	r=TheFs.Subst(n,EDriveO);
-	test(r==KErrNone);
-	test(n.Length()==0);
+	test_KErrNone(r);
+	test_Value(n.Length(), n.Length()==0);
 	r=TheFs.SetSubst(gSessionPath,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Subst(n,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(n==gSessionPath);
 	TVolumeInfo w;
 	r=TheFs.Volume(w,EDriveO);
-	test(r==KErrNone);
-	test(w.iDrive.iType==v.iDrive.iType);
-	test(w.iDrive.iConnectionBusType==v.iDrive.iConnectionBusType);
-	test(w.iDrive.iDriveAtt==KDriveAttSubsted);
-	test(w.iDrive.iMediaAtt==v.iDrive.iMediaAtt);
+	test_KErrNone(r);
+	test_Value(w.iDrive.iType, w.iDrive.iType==v.iDrive.iType);
+	test_Value(w.iDrive.iConnectionBusType, w.iDrive.iConnectionBusType==v.iDrive.iConnectionBusType);
+	test_Value(w.iDrive.iDriveAtt, w.iDrive.iDriveAtt==KDriveAttSubsted);
+	test_Value(w.iDrive.iMediaAtt, w.iDrive.iMediaAtt==v.iDrive.iMediaAtt);
 	test(w.iUniqueID==v.iUniqueID);
 	test(w.iSize==v.iSize);
 	test(w.iFree==v.iFree);
 	test(w.iName==v.iName);
 	TDriveList driveList;
 	r=TheFs.DriveList(driveList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(driveList[EDriveO]==KDriveAttSubsted);
 	TDriveInfo d;
 	r=TheFs.Drive(d,EDriveO);
-	test(r==KErrNone);
-	test(d.iDriveAtt==KDriveAttSubsted);
-	test(d.iMediaAtt==origDI.iMediaAtt);
-	test(d.iType==origDI.iType);
-	test(d.iConnectionBusType==origDI.iConnectionBusType);
+	test_KErrNone(r);
+	test_Value(d.iDriveAtt, d.iDriveAtt==KDriveAttSubsted);
+	test_Value(d.iMediaAtt, d.iMediaAtt==origDI.iMediaAtt);
+	test_Value(d.iType, d.iType==origDI.iType);
+	test_Value(d.iConnectionBusType, d.iConnectionBusType==origDI.iConnectionBusType);
 
 
 	test.Next(_L("Test real name"));
 	r=TheFs.RealName(_L("O:\\FILE.XXX"),n);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName substedPath=gSessionPath;
 	substedPath.Append(_L("FILE.XXX"));
 	test(n.CompareF(substedPath)==KErrNone);
@@ -1165,25 +1154,25 @@
 	TFileName dir=gSessionPath;
 	dir+=KTurgid;
 	r=TheFs.MkDirAll(dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dir+=_L("subdir\\");
 	r=TheFs.MkDir(dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("O:\\turgid\\subdir\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(_L("O:\\turgid"), _L("O:\\facile"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MkDir(_L("O:\\insipid\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(_L("O:\\insipid"), _L("O:\\glib"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("O:\\facile\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	_LIT(KGlib,"glib\\");
 	dir=gSessionPath;
 	dir+=KGlib;
 	r=TheFs.RmDir(dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	
 	test.Next(_L("Test file operations on Substed drive"));
 	_LIT(File1,"File1.txt");
@@ -1195,21 +1184,21 @@
 	name1+=File1;
 	RFile f1;
 	r=f1.Replace(TheFs,name1,EFileShareExclusive|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	name2=SubstRoot;
 	name2+=File2;
 	TBool isValid=TheFs.IsValidName(name2);
 	test(isValid);
 	r=f1.Rename(name2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f1.Close();
 	r=f1.Create(TheFs,name1,EFileShareExclusive|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f1.Close();
 	r=TheFs.Replace(name2,name1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(name1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Next(_L("Test notifications on Substed drive"));
 	name1=gSessionPath;
 	name1+=Subdir;
@@ -1220,58 +1209,62 @@
 	TRequestStatus status2;
 	TRequestStatus status3;
 	TheFs.NotifyChange(ENotifyDir,status1,name1);
-	test(status1==KRequestPending);
+	test_Value(status1.Int(), status1==KRequestPending);
 	TheFs.NotifyChange(ENotifyDir,status2,name2);
-	test(status2==KRequestPending);
+	test_Value(status2.Int(), status2==KRequestPending);
 	r=TheFs.MkDirAll(name1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(status1);
 	User::WaitForRequest(status2);
-	test(status1==KErrNone && status2==KErrNone);
+	test_KErrNone(status1.Int());
+	test_KErrNone(status2.Int());
 	TheFs.NotifyChange(ENotifyDir,status1,name1);
-	test(status1==KRequestPending);
+	test_Value(status1.Int(), status1==KRequestPending);
 	TheFs.NotifyChange(ENotifyDir,status2,name2);
-	test(status2==KRequestPending);
+	test_Value(status2.Int(), status2==KRequestPending);
 	TheFs.NotifyChange(ENotifyAll,status3,name2);
-	test(status3==KRequestPending);
+	test_Value(status3.Int(), status3==KRequestPending);
 	r=f1.Temp(TheFs,name2,n,EFileShareAny|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(status3);
-	test(status3==KErrNone && status1==KRequestPending && status2==KRequestPending);
+	test_KErrNone(status3.Int());
+	test_Value(status1.Int(), status1==KRequestPending);
+	test_Value(status2.Int(), status2==KRequestPending);
 	f1.Close();
 	TheFs.NotifyChangeCancel();
-	test(status1==KErrCancel && status2==KErrCancel);
+	test_Value(status1.Int(), status1==KErrCancel);
+       	test_Value(status2.Int(), status2==KErrCancel);
 	r=TheFs.Delete(n);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(name1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //
 	test.Next(_L("Test file systems on Substed drive"));
 	// test cannot mount file system on substituted drive
 	TInt sessionDrv;
 	r=TheFs.CharToDrive(gSessionPath[0],sessionDrv);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.FileSystemName(n,sessionDrv);
-	test(r==KErrNone || r==KErrNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound);
 	r=TheFs.MountFileSystem(n,EDriveO);
-	test(r==KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 	// test file system name on substitued drive is null
 	r=TheFs.FileSystemName(n,EDriveO);
-	test(r==KErrNotFound && n==KNullDesC);
+	test_Value(r, r == KErrNotFound && n==KNullDesC);
 	// test cannot format a substitued drive
 	RFormat format;
 	TInt count;
 	r=format.Open(TheFs,SubstRoot,EHighDensity,count);
-	test(r==KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 	
 	r=TheFs.SetSubst(_L(""),EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Subst(n,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(n==_L(""));
 	r=TheFs.Drive(d,EDriveO);
-	test(r==KErrNone);
-	test(d.iDriveAtt==0);
+	test_KErrNone(r);
+	test_Value(d.iDriveAtt, d.iDriveAtt==0);
 	}
 
 LOCAL_C void testSetVolume()
@@ -1286,7 +1279,7 @@
 
 	TVolumeInfo v;
 	TInt r=TheFs.Volume(v,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName n=v.iName;
 	test.Printf(_L("VOL=\"%S\"\n"),&n);
 
@@ -1300,27 +1293,27 @@
 		return;
 		}
 
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Volume(v,driveNum);
-	test(r==KErrNone );
+	test_Value(r, r == KErrNone );
+	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 	test(v.iName==_L(""));
-	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 
 	test.Next(_L("Set volume label to ABCDEFGHIJK"));
 	r=TheFs.SetVolumeLabel(_L("ABCDEFGHIJK"),driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Volume(v,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
+	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 	test(v.iName==_L("ABCDEFGHIJK"));
-	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 
 	test.Next(_L("Set volume label to ABCDE"));
 	r=TheFs.SetVolumeLabel(_L("ABCDE"),driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Volume(v,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
+	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 	test(v.iName==_L("ABCDE"));
-	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 
 
 	test.Next(_L("Test replacement of non-ascii chars"));
@@ -1338,7 +1331,7 @@
 	uBuf[9]=0x104;
 	uBuf[10]='f';
 	r=TheFs.SetVolumeLabel(uBuf,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName drive=_L("?:");
 	drive[0]=gSessionPath[0];
 
@@ -1348,56 +1341,54 @@
 
 	TFileName sess;
 	r=TheFs.SessionPath(sess);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Volume(v,driveNum);
-	test(r==KErrNone);
-
+	test_KErrNone(r);
+	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 	if(Is_Fat(TheFs, gDrive)) //-- FAT doesn't support normal UNICODE in volume labels
 		test(v.iName==_L("a_b_c_d_e_f"));
 	else
 		test(v.iName == uBuf);
 
-
-	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
-
-
 	test.Next(_L("Set volume label back to nothing"));
 	r=TheFs.SetVolumeLabel(_L(""),driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Volume(v,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
+	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 	test(v.iName==_L(""));
-	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 
 	test.Next(_L("Attempt to set volume label containing illegal characters"));
 	r=TheFs.SetVolumeLabel(_L("abc>def"),driveNum);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.SetVolumeLabel(_L("ghi*jkl"),driveNum);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.SetVolumeLabel(_L("mno?pqr"),driveNum);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.SetVolumeLabel(_L("stu|vwx"),driveNum);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.SetVolumeLabel(_L("yz<abc"),driveNum);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.SetVolumeLabel(_L("def//ghi"),driveNum);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 
 	r=TheFs.Volume(v,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
+	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 	test(v.iName==_L(""));
-	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 
 	// test volume label after remount (for removable media only)
 	test.Next(_L("Test volume label after remount"));
 
 	TDriveInfo info;
-	test(TheFs.Drive(info, driveNum) == KErrNone);
+	r = TheFs.Drive(info, driveNum);
+	test_KErrNone(r);
 
 	if((info.iDriveAtt & KDriveAttRemovable) != 0)
 		{
 		// 1. set volume label
-		test(TheFs.SetVolumeLabel(_L("XXX"), driveNum) == KErrNone);
+		r = TheFs.SetVolumeLabel(_L("XXX"), driveNum);
+		test_KErrNone(r);
 
 		// 2. change bootsector volume label
 		const TInt	offset = IsFileSystemFAT32(TheFs, driveNum)? 
@@ -1408,15 +1399,20 @@
 		RRawDisk	rdisk;
 		TPtrC8		label(_S8("Z"), 1);
 
-		test(rdisk.Open(TheFs, driveNum) == KErrNone);
-		test(rdisk.Write(offset, label) == KErrNone);
+		r = rdisk.Open(TheFs, driveNum);
+		test_KErrNone(r);
+		r = rdisk.Write(offset, label);
+		test_KErrNone(r);
 		rdisk.Close();
 
 		// 3. remount the drive
-		test(TheFs.RemountDrive(driveNum) == KErrNone);
+		r = TheFs.RemountDrive(driveNum);
+		test_KErrNone(r);
 
 		// 4. check volume label
-		test(TheFs.Volume(v, driveNum) == KErrNone);
+		r = TheFs.Volume(v, driveNum);
+		test_KErrNone(r);
+		test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 		test(v.iName == _L("XXX"));
 		test.Printf(_L("- Passed.\n"));
 		}
@@ -1426,11 +1422,11 @@
 	// clean up
 	test.Next(_L("Set volume label to original"));
 	r=TheFs.SetVolumeLabel(n,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Volume(v,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
+	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 	test(v.iName==n);
-	test.Printf(_L("VOL=\"%S\"\n"),&v.iName);
 
 	test.End();
 	}
@@ -1444,45 +1440,46 @@
 	test.Start(_L("Test modified/SetModified functions"));
 	TTime savedTime;
 	TInt r=TheFs.Modified(_L("\\F32-TST\\TFSRV\\T_FSRV.CPP"),savedTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TDateTime dateTime=savedTime.DateTime();
 	test.Printf(_L("T_FSRV.CPP last modified %d/%d/%d %d:%d:%d.%-06d\n"),dateTime.Day()+1,dateTime.Month()+1,dateTime.Year(),dateTime.Hour(),dateTime.Minute(),dateTime.Second(),dateTime.MicroSecond());
 	test.Next(_L("Set modified"));
 	dateTime.Set(1993,EAugust,23,1,13,54,123456);
 	TTime newTime(dateTime);
 	r=TheFs.SetModified(_L("\\F32-TST\\TFSRV\\T_FSRV.CPP"),newTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TTime checkTime;
 	r=TheFs.Modified(_L("\\XXXX\\YYYY\\ZZZZ.CPP"),checkTime);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=TheFs.Modified(_L("\\F32-TST\\TFSRV\\T_FSRV.CPP"),checkTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dateTime=checkTime.DateTime();	
+	test.Printf(_L("T_FSRV.CPP last modified %d/%d/%d %d:%d:%d.%-06d\n"),dateTime.Day()+1,dateTime.Month()+1,dateTime.Year(),dateTime.Hour(),dateTime.Minute(),dateTime.Second(),dateTime.MicroSecond());
 	test(dateTime.Year()==1993);
 	test(dateTime.Month()==EAugust);
 	test(dateTime.Day()==23);
 	test(dateTime.Hour()==1);
 	test(dateTime.Minute()==13);
 	test(dateTime.Second()==54);
-	test.Printf(_L("T_FSRV.CPP last modified %d/%d/%d %d:%d:%d.%-06d\n"),dateTime.Day()+1,dateTime.Month()+1,dateTime.Year(),dateTime.Hour(),dateTime.Minute(),dateTime.Second(),dateTime.MicroSecond());
 //		test(dateTime.MicroSecond()==123456); // dos is not accurate enough
 	r=TheFs.SetModified(_L("\\F32-TST\\TFSRV\\T_FSRV.CPP"),savedTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Modified(_L("\\F32-TST\\TFSRV\\T_FSRV.CPP"),checkTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(checkTime==savedTime);
 
 	RFile f;
 	r=f.Open(TheFs,_L("\\F32-TST\\TFSRV\\T_FSRV.CPP"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	dateTime.Set(1997,EJanuary,1,2,55,51,999999);
 	newTime=dateTime;
 	r=f.SetModified(newTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Modified(_L("\\F32-TST\\TFSRV\\T_FSRV.CPP"),checkTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	dateTime=checkTime.DateTime();	
+	test.Printf(_L("T_FSRV.CPP last modified via RFs::Modified() %d/%d/%d %d:%d:%d.%-06d\n"),dateTime.Day()+1,dateTime.Month()+1,dateTime.Year(),dateTime.Hour(),dateTime.Minute(),dateTime.Second(),dateTime.MicroSecond());
 	test(dateTime.Year()==1997);
 	test(dateTime.Month()==EJanuary);
 	test(dateTime.Day()==1);
@@ -1491,9 +1488,10 @@
 	test(dateTime.Second()>=50 && dateTime.Second()<=51); // Dos stores seconds %2
 
 	r=f.Modified(checkTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	dateTime=checkTime.DateTime();	
+	test.Printf(_L("T_FSRV.CPP last modified via RFile::Modified() %d/%d/%d %d:%d:%d.%-06d\n"),dateTime.Day()+1,dateTime.Month()+1,dateTime.Year(),dateTime.Hour(),dateTime.Minute(),dateTime.Second(),dateTime.MicroSecond());
 	test(dateTime.Year()==1997);
 	test(dateTime.Month()==EJanuary);
 	test(dateTime.Day()==1);
@@ -1503,9 +1501,10 @@
 	f.Close();
 
 	r=TheFs.Modified(_L("\\F32-TST\\TFSRV\\T_FSRV.CPP"),checkTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	dateTime=checkTime.DateTime();	
+	test.Printf(_L("T_FSRV.CPP last modified via RFs::Modified() %d/%d/%d %d:%d:%d.%-06d\n"),dateTime.Day()+1,dateTime.Month()+1,dateTime.Year(),dateTime.Hour(),dateTime.Minute(),dateTime.Second(),dateTime.MicroSecond());
 	test(dateTime.Year()==1997);
 	test(dateTime.Month()==EJanuary);
 	test(dateTime.Day()==1);
@@ -1529,23 +1528,27 @@
 	RFile file;
 	
 	TInt r=file.Open(TheFs, KFileName, 0 );
-	if (r!=KErrNone)
-		{
-		test.Printf(_L("Error %d opening file %S\n"), r, &KFileName);
-		test(0);
-		}
+	test_KErrNone(r);
 	
 	TFileName fileName;
 
 	// Check RFile::Name just retuns the file name, without path and drive
 	r=file.Name(fileName);
-	test(r==KErrNone);
-	test(fileName==KFileName());
+	test_KErrNone(r);
+	if (fileName != KFileName)
+		{
+		test.Printf(_L("%S\n"), &fileName);
+		test(0);
+		}
 
 	// Check RFile::FullName returns the complete file name and path
 	r=file.FullName(fileName);
-	test(r==KErrNone);
-	test(fileName.Mid(2)==KFileNameAndPath); // chop off drive letter + ':'
+	test_KErrNone(r);
+	if (fileName.Mid(2)!=KFileNameAndPath)	// chop off drive letter + ':'
+		{
+		test.Printf(_L("%S\n"), &fileName);
+		test(0);
+		}
 	
 	file.Close();
 	
@@ -1565,13 +1568,7 @@
 	TInt r=file.Replace(TheFs,fileName,EFileWrite);
 	if (r==KErrDiskFull)
 		return(r);
-	if (r!=KErrNone)
-		{
-		test.Printf(_L("ERROR:: Replace returned %d\n"),r);
-		test(0);
-		//test.Getch();
-		return(KErrDiskFull);
-		}
+	test_KErrNone(r);
 
 	if (!IsTestingLFFS())
 		r=file.SetSize(LargeFileSize);
@@ -1588,14 +1585,7 @@
 		file.Close();
 		return(r);
 		}
-	if (r!=KErrNone)
-		{
-		test.Printf(_L("ERROR:: SetSize/Write returned %d\n"),r);
-		test(0);
-		//test.Getch();
-		file.Close();
-		return(KErrDiskFull);
-		}
+	test_KErrNone(r);
 
 	file.Close();
 //	r=TheFs.CheckDisk(fileName);
@@ -1618,12 +1608,12 @@
 	TBuf<128> fileName=aBaseName;
 	fileName.AppendNum(aX);
 	TInt r=TheFs.Delete(fileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	r=TheFs.CheckDisk(fileName);
 //	if (r!=KErrNone && r!=KErrNotSupported)
 //		{
 //		test.Printf(_L("ERROR:: CheckDisk returned %d\n"),r);
-//		test(r==KErrNone);
+//		test_KErrNone(r);
 //		}
 	test.Printf(_L("Deleted File %d\n"),aX);
 	return(KErrNone);
@@ -1637,43 +1627,37 @@
 
 	test.Start(_L("Create and delete large files"));
 	TInt r=TheFs.MkDirAll(_L("\\F32-TST\\SMALLDIRECTORY\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	TBuf<128> fileName=_L("\\F32-TST\\SMALLDIRECTORY\\FILE");
 	r=CreateFileX(fileName,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=CreateFileX(fileName,1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=DeleteFileX(fileName,0);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=CreateFileX(fileName,2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=CreateFileX(fileName,1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=CreateFileX(fileName,3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=DeleteFileX(fileName,1);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=CreateFileX(fileName,4);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=DeleteFileX(fileName,2);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=DeleteFileX(fileName,3);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=DeleteFileX(fileName,4);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=CreateFileX(fileName,1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=DeleteFileX(fileName,1);	
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.CheckDisk(fileName);
-	if (r!=KErrNone && r!=KErrNotSupported)
-		{
-		test.Printf(_L("ERROR:: CheckDisk returned %d\n"),r);
-		test(0);
-		//test.Getch();
-		}
-	
+	test_Value(r, r == KErrNone || r == KErrNotSupported);
 	test.End();
 	}
 
@@ -1685,18 +1669,18 @@
 
 	test.Start(_L("Fill disk to capacity"));
 	TInt r=TheFs.MkDirAll(_L("\\F32-TST\\BIGDIRECTORY\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	TInt count=0;
 	TFileName sessionPath;
 	r=TheFs.SessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf<128> fileName=_L("\\F32-TST\\BIGDIRECTORY\\FILE");
 	FOREVER
 		{
 		TInt r=CreateFileX(fileName,count);
 		if (r==KErrDiskFull)
 			break;
-		test(r==KErrNone);
+		test_KErrNone(r);
 		count++;
 #if defined(__WINS__)
 		if (count==32 && sessionPath[0]=='C')
@@ -1705,23 +1689,13 @@
 		}
 
 	r=TheFs.CheckDisk(fileName);
-	if (r!=KErrNone && r!=KErrNotSupported)
-		{
-		test.Printf(_L("ERROR:: CheckDisk returned %d\n"),r);
-		test(0);
-		//test.Getch();
-		}
+	test_Value(r, r == KErrNone || r == KErrNotSupported);
 
 	while(count--)
 		DeleteFileX(fileName,count);
 
 	r=TheFs.CheckDisk(fileName);
-	if (r!=KErrNone && r!=KErrNotSupported)
-		{
-		test.Printf(_L("ERROR:: CheckDisk returned %d\n"),r);
-		test(0);
-		//test.Getch();
-		}
+	test_Value(r, r == KErrNone || r == KErrNotSupported);
 
 	test.End();
 	}
@@ -1736,31 +1710,31 @@
 	fn[0] = gExeFileName[0];
 	TParse f;
 	TInt r=TheFs.Parse(fn,f);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Next(_L("Copying file to test directory"));
 	TParse fCopy;
 	r=TheFs.Parse(f.NameAndExt(),fCopy);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile f1;
 	r=f1.Open(TheFs,f.FullName(),EFileStreamText|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFile f2;
 	r=f2.Replace(TheFs,fCopy.FullName(),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<512> copyBuf;
 	TInt rem;
 	r=f1.Size(rem);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt pos=0;
 	while (rem)
 		{
 		TInt s=Min(rem,copyBuf.MaxSize());
 		r=f1.Read(pos,copyBuf,s);
-		test(r==KErrNone);
-		test(copyBuf.Length()==s);
+		test_KErrNone(r);
+		test_Value(copyBuf.Length(), copyBuf.Length() == s);
 		r=f2.Write(pos,copyBuf,s);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		pos+=s;
 		rem-=s;
 		}
@@ -1790,26 +1764,26 @@
     
     //==========  just create a file
     nRes = TheFs.SetErrorCondition(KMyError,0); //-- set up FS error simulation
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     //-- this shall fail immediately 
     nRes = file.Replace(TheFs, KFileName, EFileWrite);
-    test(nRes == KMyError);
+    test_Value(nRes, nRes == KMyError);
 
     nRes = TheFs.SetErrorCondition(KErrNone); //-- disable FS error simulation
     file.Close();
 
     //========== create file & duplicate a handle #1
     nRes = TheFs.SetErrorCondition(KMyError,1); //-- set up FS error simulation
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     //-- this shall succeed
     nRes = file.Replace(TheFs, KFileName, EFileWrite); //-- err cnt -> 0
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     //-- this shall fail inside RFile::Duplicate() half way through in the RFile::DuplicateHandle()
     nRes = file1.Duplicate(file);
-    test(nRes == KMyError);
+    test_Value(nRes, nRes == KMyError);
     file1.Close();
     
     nRes = TheFs.SetErrorCondition(KErrNone); //-- disable FS error simulation
@@ -1817,19 +1791,19 @@
 
     //-- check that the file isn't locked
     nRes = TheFs.Delete(KFileName);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     //========== create file & duplicate a handle #2
     nRes = TheFs.SetErrorCondition(KMyError,2); //-- set up FS error simulation
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     //-- this shall succeed
     nRes = file.Replace(TheFs, KFileName, EFileWrite); //-- err cnt -> 1
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     //-- this must not fail, because EFsFileAdopt is excluded from the erros simulation
     nRes = file1.Duplicate(file);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     file1.Close();
     
     nRes = TheFs.SetErrorCondition(KErrNone); //-- disable FS error simulation
@@ -1837,7 +1811,7 @@
 
     //-- check that the file isn't locked
     nRes = TheFs.Delete(KFileName);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     //========== crazy loop, for DEF103757
 
@@ -1859,7 +1833,7 @@
 
     //-- check that the file isn't locked
     nRes = TheFs.Delete(KFileName);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
 
 #endif
@@ -1877,14 +1851,14 @@
     F32_Test_Utils::SetConsole(test.Console()); 
     
     TInt nRes=TheFs.CharToDrive(gDriveToTest, gDrive);
-    test(nRes==KErrNone);
+    test_KErrNone(nRes);
     
     PrintDrvInfo(TheFs, gDrive);
 
 
 	TVolumeInfo v;
 	TInt r=TheFs.Volume(v, CurrentDrive());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	LargeFileSize=Max((TUint32)I64LOW(v.iFree >> 7), (TUint32)65536u);
 
     if (gFirstTime)
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_fsy2k.cpp
--- a/kerneltest/f32test/server/t_fsy2k.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_fsy2k.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -36,11 +37,11 @@
 	MakeFile(_L("Y2KTEST.tst"));
 	
 	TInt r=TheFs.SetEntry(_L("Y2KTEST.tst"),*aTime,KEntryAttHidden,KEntryAttArchive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TEntry entry;
 	r=TheFs.Entry(_L("Y2KTEST.tst"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TDateTime checkDateTime=(entry.iModified).DateTime();
 	test(checkDateTime.Year()==aDateTime->Year());
@@ -59,14 +60,14 @@
 	test.Printf(_L("Valid date: %S\n"),&gDateBuf);
 		
 	r=TheFs.Delete(_L("Y2KTEST.tst"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	MakeDir(_L("\\Y2KTEST\\"));
 	r=TheFs.SetEntry(_L("\\Y2KTEST\\"),*aTime,KEntryAttHidden,KEntryAttArchive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Entry(_L("\\Y2KTEST\\"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	checkDateTime=(entry.iModified).DateTime();
 	test(checkDateTime.Year()==aDateTime->Year());
@@ -85,7 +86,7 @@
 	test.Printf(_L("Valid date: %S\n"),&gDateBuf);
 
 	r=TheFs.RmDir(_L("\\Y2KTEST\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	}
 
@@ -98,11 +99,11 @@
 	MakeFile(_L("Y2KTEST.tst"));
 	
 	TInt r=TheFs.SetModified(_L("Y2KTEST.tst"),*aTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TTime check;
 	r=TheFs.Modified(_L("Y2KTEST.tst"),check);
-	test(r==KErrNone);
+	test_KErrNone(r);
 		
 	TDateTime checkDateTime=check.DateTime();
 	
@@ -123,14 +124,14 @@
 	test.Printf(_L("Valid date: %S\n"),&gDateBuf);
 		
 	r=TheFs.Delete(_L("Y2KTEST.tst"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	MakeDir(_L("\\Y2KTEST\\"));
 	r=TheFs.SetModified(_L("\\Y2KTEST\\"),*aTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Modified(_L("\\Y2KTEST\\"),check);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	checkDateTime=check.DateTime();
 	test(checkDateTime.Year()==aDateTime->Year());
@@ -149,7 +150,7 @@
 	test.Printf(_L("Valid date: %S\n"),&gDateBuf);
 
 	r=TheFs.RmDir(_L("\\Y2KTEST\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 	
@@ -160,16 +161,16 @@
 	{
 	RFile file;
 	TInt r=file.Replace(TheFs,_L("Y2KTEST.tst"),0);
-	test(r==KErrNone || r==KErrPathNotFound);	
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);	
 		
 	r=file.Set(*aTime,KEntryAttHidden,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 	TTime check;
 	file.Open(TheFs,_L("Y2KTEST.tst"),EFileWrite);
 	r=file.Modified(check);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 		
 	test.Printf(_L("Date set to "));
@@ -223,16 +224,16 @@
 	{
 	RFile file;
 	TInt r=file.Replace(TheFs,_L("Y2KTEST.tst"),0);
-	test(r==KErrNone || r==KErrPathNotFound);	
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);	
 
 	r=file.SetModified(*aTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 	TTime check;
 	file.Open(TheFs,_L("Y2KTEST.tst"),EFileWrite);
 	r=file.Modified(check);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 		
 	TDateTime checkDateTime=check.DateTime();
@@ -266,11 +267,11 @@
 	CFileMan* fileMan=CFileMan::NewL(TheFs);
 		
 	TInt r=fileMan->Attribs(_L("Y2KTEST.tst"),KEntryAttHidden,KEntryAttNormal,*aTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 		
 	TEntry entry;
 	r=TheFs.Entry(_L("Y2KTEST.tst"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TTime check=entry.iModified;	
 	TDateTime checkDateTime=check.DateTime();
@@ -292,7 +293,7 @@
 	test.Printf(_L("Valid date: %S\n"),&gDateBuf);
 
 	r=TheFs.Delete(_L("Y2KTEST.tst"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	delete fileMan;
 	}
@@ -493,7 +494,7 @@
 	for (i=0;i<KMaxValidDateTimes;i++)
 		{
 		TRAPD(error,testCFileManAttribsL(tempDateTime, tempTime, ETrue));
-		test(error==KErrNone);
+		test_KErrNone(error);
 		tempDateTime++;
 		tempTime++;
 		}
@@ -566,7 +567,7 @@
 		{
 		test.Printf(_L("Invalid date: %S\n"),&invalidDates[i]);
 		TRAPD(error,testCFileManAttribsL(tempDateTime, tempTime, EFalse));	
-		test(error==KErrNone);
+		test_KErrNone(error);
 		tempDateTime++;
 		tempTime++;
 		}
@@ -590,13 +591,13 @@
 		{
 	//	Dummy time is used to initialise validDateTime[i] before calling SetX()
 		r=validDateTime[i].Set(1998,EJune,23,11,11,11,0);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=validDateTime[i].SetYear(testYearValid[i]);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=validDateTime[i].SetMonth(testMonthValid[i]);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=validDateTime[i].SetDay(testDayValid[i]);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		validTime[i]=validDateTime[i];
 		}
 
@@ -610,15 +611,15 @@
 		{
 	//	Dummy time is used to initialise validDateTime[i] before calling SetX()
 		r=invalidDateTime[i].Set(1998,EJune,22,11,11,11,0);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=invalidDateTime[i].SetYear(testYearInvalid[i]);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=invalidDateTime[i].SetMonth(testMonthInvalid[i]);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=invalidDateTime[i].SetDay(testDayInvalid[i]);
-		test(r==KErrGeneral);		//	This will fail because it is an invalid date
+		test_Value(r, r == KErrGeneral);		//	This will fail because it is an invalid date
 		r=invalidDateTime[i].SetDay(testDayInvalid[i]-1);
-		test(r==KErrNone);			//	Set it one day less 
+		test_KErrNone(r);			//	Set it one day less 
 		invalidTime[i]=invalidDateTime[i];
 		invalidTime[i]+=extraDay;	//	Add on an extra day.  This should bump the
 		}							//	date onto the next month, NOT set the day
@@ -635,7 +636,7 @@
 	{
 
 	TInt r=TheFs.MkDirAll(_L("\\F32-TST\\YEAR 2000 TESTS\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	TRAP(r,CallTests());
 	if (r==KErrNone)
 		TheFs.ResourceCountMarkEnd();
@@ -645,5 +646,5 @@
 		test(0);
 		}
 	r=TheFs.RmDir(_L("\\F32-TST\\YEAR 2000 TESTS\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_gdir.cpp
--- a/kerneltest/f32test/server/t_gdir.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_gdir.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -13,6 +13,7 @@
 // Description:
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -110,13 +111,13 @@
 	TPtrC fileName(aFileName.iFileName);
 	TAutoClose<RFile> file;
 	TInt r=file.iObj.Replace(TheFs,fileName,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TPtrC8 uidBuf((TUint8*)&checkedUid,sizeof(TCheckedUid));
 	r=file.iObj.Write(uidBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TPtrC8 contents(aFileName.iContents);
 	r=file.iObj.Write(contents);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void createFile(TInt anIndex)
@@ -134,11 +135,11 @@
 //
 	TAutoClose<RFile> file;
 	TInt r=file.iObj.Replace(TheFs,fName,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<36> b((TUint8*)"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ");
 	b.SetLength(anIndex+1);
 	r=file.iObj.Write(b);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void createDir(TInt anIndex)
@@ -155,7 +156,7 @@
     test.Next(mes);
 //
 	TInt r=TheFs.MkDir(dName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void testSetup()
@@ -167,7 +168,7 @@
 	test.Next(_L("Remove test directory"));
 	CDir* pD;
 	TInt r=TheFs.GetDir(test_dir_1,KEntryAttMaskSupported,EDirsLast,pD);
-	test(r==KErrNone || r==KErrNotFound || r==KErrPathNotFound);
+	test_Value(r, r == KErrNone || r==KErrNotFound || r==KErrPathNotFound);
 	if (r==KErrNone)
 		{
 		TInt count=pD->Count();
@@ -180,14 +181,14 @@
 				TFileName name;
 				name.Format(_L("%S%S\\"),&test_dir,&e.iName);
 				r=TheFs.RmDir(name);
-				test(r==KErrNone);
+				test_KErrNone(r);
 				}
 			else
 				{
 				TFileName name;
 				name.Format(_L("%S%S"),&test_dir,&e.iName);
 				r=TheFs.Delete(name);
-				test(r==KErrNone);
+				test_KErrNone(r);
 				}
 			}
 		}
@@ -216,28 +217,28 @@
 	test.Next(_L("Test directory handling"));
 	CDir* pD;
 	TInt r=TheFs.GetDir(test_dir_1,KEntryAttMaskSupported,EDirsLast,pD);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	displayDir(*pD,dCount,fCount);
 	test(dCount==4 && fCount==9);
 	delete pD;
 //
 	test.Next(_L("Attributes: NULL"));
 	r=TheFs.GetDir(test_dir_1,NULL,EDirsLast,pD);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	displayDir(*pD,dCount,fCount);
 	test(dCount==0 && fCount==9);
 	delete pD;
 //
 	test.Next(_L("Attributes: KEntryAttDir & EDescending sort"));
 	r=TheFs.GetDir(test_dir_1,KEntryAttDir,ESortByName|EDescending,pD);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	displayDir(*pD,dCount,fCount);
 	test(dCount==4 && fCount==9);
 	delete pD;
 //	
 	test.Next(_L("Attributes: Excl,Dir"));
 	r=TheFs.GetDir(test_dir_1,KEntryAttMatchExclusive|KEntryAttDir,ESortByName|EDescending,pD);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	displayDir(*pD,dCount,fCount);
 	test(dCount==4 && fCount==0);
 	delete pD;
@@ -246,7 +247,7 @@
 //
 	test.Next(_L("Test split directories and files"));
 	r=TheFs.GetDir(test_dir_1,KEntryAttMaskSupported,ESortByName,pD,pD2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("FileList:\n"));
 	displayDir(*pD,dCount,fCount);
 	test(dCount==4 && fCount==9);
@@ -258,7 +259,7 @@
 //
 	test.Next(_L("Attributes: NULL"));
 	r=TheFs.GetDir(test_dir_1,NULL,ESortByName,pD,pD2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("FileList:\n"));
 	displayDir(*pD,dCount,fCount);
 	test(dCount==0 && fCount==9);
@@ -270,7 +271,7 @@
 //
 	test.Next(_L("Attributes: KEntryAttDir"));
 	r=TheFs.GetDir(test_dir_1,KEntryAttDir,ESortByName,pD,pD2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("FileList:\n"));
 	displayDir(*pD,dCount,fCount);
 	test(dCount==4 && fCount==9);
@@ -282,7 +283,7 @@
 //
 	test.Next(_L("Attributes: Excl,Dir"));
 	r=TheFs.GetDir(test_dir_1,KEntryAttMatchExclusive|KEntryAttDir,ESortByName,pD,pD2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("FileList:\n"));
 	displayDir(*pD,dCount,fCount);
 	test(dCount==4 && fCount==0);
@@ -303,7 +304,7 @@
 	TInt dCount,fCount;
 	CDir* pD;
 	TInt r=TheFs.GetDir(_L("Z:\\*"),KEntryAttMaskSupported,EDirsFirst,pD);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	displayDir(*pD,dCount,fCount);
 	delete pD;
 	}
@@ -317,7 +318,7 @@
 	test.Next(_L("Display contents of current directory"));
 	CDir* pD;
 	TInt r=TheFs.GetDir(gSessionPath,KEntryAttMaskSupported,EDirsFirst,pD);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt dCount,fCount;
 	displayDir(*pD,dCount,fCount);
 	delete pD;
@@ -327,7 +328,7 @@
 	TBuf<16> noName=_L("asdf.idd");
 	parser.Set(session.Drive(),&noName,NULL);
 	r=TheFs.GetDir(parser.FullName(),KEntryAttMaskSupported,EDirsFirst,pD);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(pD->Count()==0);
 	delete pD;
 	}
@@ -349,14 +350,14 @@
 
 	RFile f;
 	TInt r=f.Open(TheFs,entry.iName,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<256> contents;
 	r=f.Read(sizeof(TCheckedUid),contents);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TPtrC8 uidFileContents(uidFiles[aUidFile].iContents);
 	test(contents==uidFileContents);
 	r=f.Read(contents);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(contents.Length()==0);
 	f.Close();
 	}
@@ -389,7 +390,7 @@
 	TUidType matchUid(TUid::Null(),TUid::Uid(2),TUid::Null());
 	CDir* fileList;
 	TInt r=TheFs.GetDir(matchName,matchUid,EAscending,fileList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=fileList->Count();
 	test(count==1);
 	MatchUidFile(0,0,fileList);
@@ -398,7 +399,7 @@
 	matchName=_L("*.*");
 	matchUid=TUidType(TUid::Uid(1),TUid::Uid(2),TUid::Uid(731));
 	r=TheFs.GetDir(matchName,matchUid,EAscending,fileList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=fileList->Count();
 	test(count==1);
 	MatchUidFile(0,0,fileList);
@@ -407,7 +408,7 @@
 	matchName=_L("*.*");
 	matchUid=TUidType(TUid::Null(),TUid::Uid(2),TUid::Null());
 	r=TheFs.GetDir(matchName,matchUid,ESortByName|EAscending,fileList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=fileList->Count();
 	test(count==3);
 	MatchUidFile(0,2,fileList);
@@ -418,7 +419,7 @@
 	matchName=_L("*.*");
 	matchUid=TUidType(TUid::Null(),TUid::Null(),TUid::Uid(731));
 	r=TheFs.GetDir(matchName,matchUid,ESortByName|EAscending,fileList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=fileList->Count();
 	test(count==3);
 	MatchUidFile(2,0,fileList);
@@ -428,7 +429,7 @@
 
 	matchName=_L("*.*");
 	r=TheFs.GetDir(matchName,KEntryAttNormal,ESortByUid|EAscending,fileList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=fileList->Count();
 	MatchUidFile(4,0,fileList);
 	MatchUidFile(1,1,fileList);
@@ -457,7 +458,7 @@
 	TUidType matchUid(TUid::Null(),TUid::Uid(0x1000008c),TUid::Null());
 	CDir* fileList;
 	TInt r=TheFs.GetDir(PlatSec::ConfigSetting(PlatSec::EPlatSecEnforceSysBin)?_L("Z:\\SYS\\BIN\\"):_L("Z:\\SYSTEM\\BIN\\"),matchUid,EAscending,fileList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=fileList->Count();
 #if defined(__WINS__)
 	test(count==0);
@@ -490,7 +491,7 @@
 	TUint onlyRO=KEntryAttReadOnly|KEntryAttMatchExclusive;
 	CDir* fileList;
 	TInt r=TheFs.GetDir(_L("\\F32-TST\\GDIR\\*.CCC"),onlyRO,EAscending,fileList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=fileList->Count();
 	test(count==2);
 
@@ -504,7 +505,7 @@
 	test.Next(_L("Can match everything except read only files"));
 	TUint excludeRO=KEntryAttReadOnly|KEntryAttMatchExclude;
 	r=TheFs.GetDir(_L("\\F32-TST\\GDIR\\*.CCC"),excludeRO,EAscending,fileList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=fileList->Count();
 	test(count==4);
 
@@ -521,7 +522,7 @@
 	test.Next(_L("Can match everything except system and readonly files"));
 	TUint excludeSystemAndRO=KEntryAttReadOnly|KEntryAttSystem|KEntryAttMatchExclude;
 	r=TheFs.GetDir(_L("\\F32-TST\\GDIR\\*.CCC"),excludeSystemAndRO,EAscending,fileList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=fileList->Count();
 	test(count==2);
 
@@ -532,9 +533,9 @@
 	delete fileList;
 
 	r=TheFs.SetAtt(_L("\\F32-TST\\GDIR\\RONLY1.CCC"),0,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetAtt(_L("\\F32-TST\\GDIR\\RONLY2.CCC"),0,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void testGetHidden()
@@ -554,22 +555,22 @@
 	MakeDir(_L("\\F32-TST\\GDIR\\Dirhiddensystem.qqq\\"));
 
 	TInt r=TheFs.SetAtt(_L("FileHidden.qqq"),KEntryAttHidden,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetAtt(_L("Filesystem.qqq"),KEntryAttSystem,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetAtt(_L("FilehiddenSystem.qqq"),KEntryAttSystem|KEntryAttHidden,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetAtt(_L("dirhidden.qqq"),KEntryAttHidden,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetAtt(_L("dirsystem.qqq"),KEntryAttSystem,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetAtt(_L("dirhiddensystem.qqq"),KEntryAttSystem|KEntryAttHidden,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 // Files and directories not hidden or system
 	CDir* dir;
 	r=TheFs.GetDir(_L("*.qqq"),KEntryAttDir,ESortByName,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=dir->Count();
 	test(count==2);
 	TEntry entry;
@@ -581,7 +582,7 @@
 	
 // Files only
 	r=TheFs.GetDir(_L("*.qqq"),KEntryAttNormal,ESortByName,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==1);
 	entry=(*dir)[0];
@@ -590,7 +591,7 @@
 
 // Directories only
 	r=TheFs.GetDir(_L("*.qqq"),KEntryAttDir|KEntryAttMatchExclusive,ESortByName,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==1);
 	entry=(*dir)[0];
@@ -599,7 +600,7 @@
 
 // Files + hidden
 	r=TheFs.GetDir(_L("*.qqq"),KEntryAttHidden,ESortByName,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==2);
 	entry=(*dir)[0];
@@ -610,7 +611,7 @@
 
 // Files + system
 	r=TheFs.GetDir(_L("*.qqq"),KEntryAttHidden,ESortByName,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==2);
 	entry=(*dir)[0];
@@ -621,7 +622,7 @@
 
 // Files + hidden + system
 	r=TheFs.GetDir(_L("*.qqq"),KEntryAttHidden|KEntryAttSystem,ESortByName,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==4);
 	entry=(*dir)[0];
@@ -636,7 +637,7 @@
 
 // Dirs + hidden
 	r=TheFs.GetDir(_L("*.qqq"),KEntryAttHidden|KEntryAttDir|KEntryAttMatchExclusive,ESortByName,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==2);
 	entry=(*dir)[0];
@@ -647,7 +648,7 @@
 
 // Dirs + system
 	r=TheFs.GetDir(_L("*.qqq"),KEntryAttSystem|KEntryAttDir|KEntryAttMatchExclusive,ESortByName,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==2);
 	entry=(*dir)[0];
@@ -658,7 +659,7 @@
 
 // Dirs + hidden + system
 	r=TheFs.GetDir(_L("*.qqq"),KEntryAttHidden|KEntryAttSystem|KEntryAttDir|KEntryAttMatchExclusive,ESortByName,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==4);
 	entry=(*dir)[0];
@@ -674,7 +675,7 @@
 
 // Files + Dirs + hidden
 	r=TheFs.GetDir(_L("*.qqq"),KEntryAttHidden|KEntryAttDir,ESortByName,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==4);
 	entry=(*dir)[0];
@@ -689,7 +690,7 @@
 
 // Files + Dirs + system
 	r=TheFs.GetDir(_L("*.qqq"),KEntryAttSystem|KEntryAttDir,ESortByName,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==4);
 	entry=(*dir)[0];
@@ -704,7 +705,7 @@
 
 // Files + Dirs + hidden + system
 	r=TheFs.GetDir(_L("*.qqq"),KEntryAttHidden|KEntryAttSystem|KEntryAttDir,ESortByName,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==8);
 	entry=(*dir)[0];
@@ -781,7 +782,7 @@
 	CDir* dir;
 	TUint sortOrder=ESortByName|EDirsFirst|EDescending;
 	TInt r=TheFs.GetDir(gDirDescendingBaseName,KEntryAttMaskSupported,sortOrder,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	TBuf8<16> result=_L("2,1,0,3,4,5");
 	TBuf<16> result=_L("2,1,0,3,4,5");
 
@@ -790,7 +791,7 @@
 // Test DirFirst - EAscending
 	sortOrder=ESortByName|EDirsFirst;
 	r=TheFs.GetDir(gDirDescendingBaseName,KEntryAttMaskSupported,sortOrder,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	result=_L("3,4,5,0,1,2");
 	TestDirDescendingOrder(result,*dir);
 	delete dir;
@@ -798,14 +799,14 @@
 // Test DirLast - EDescending
 	sortOrder=ESortByName|EDirsLast|EDescending;
 	r=TheFs.GetDir(gDirDescendingBaseName,KEntryAttMaskSupported,sortOrder,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	result=_L("3,4,5,2,1,0");
 	TestDirDescendingOrder(result,*dir);
 	delete dir;
 // Test DirLast - EAscending
 	sortOrder=ESortByName|EDirsLast;
 	r=TheFs.GetDir(gDirDescendingBaseName,KEntryAttMaskSupported,sortOrder,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	result=_L("0,1,2,3,4,5");
 	TestDirDescendingOrder(result,*dir);
 	delete dir;
@@ -813,14 +814,14 @@
 // Test DirFirst - EDirDescending
 	sortOrder=ESortByName|EDirsFirst|EDirDescending;
 	r=TheFs.GetDir(gDirDescendingBaseName,KEntryAttMaskSupported,sortOrder,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	result=_L("5,4,3,0,1,2");
 	TestDirDescendingOrder(result,*dir);
 	delete dir;
 // Test DirLast - EDirDescending
 	sortOrder=ESortByName|EDirsLast|EDirDescending;
 	r=TheFs.GetDir(gDirDescendingBaseName,KEntryAttMaskSupported,sortOrder,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	result=_L("0,1,2,5,4,3");
 	TestDirDescendingOrder(result,*dir);
 	delete dir;
@@ -828,14 +829,14 @@
 // Test DirFirst - EDescending|EDirDescending
 	sortOrder=ESortByName|EDirsFirst|EDescending|EDirDescending;
 	r=TheFs.GetDir(gDirDescendingBaseName,KEntryAttMaskSupported,sortOrder,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	result=_L("2,1,0,5,4,3");
 	TestDirDescendingOrder(result,*dir);
 	delete dir;
 // Test DirLast - EDescending|EDirDescending
 	sortOrder=ESortByName|EDirsLast|EDirDescending|EDescending;
 	r=TheFs.GetDir(gDirDescendingBaseName,KEntryAttMaskSupported,sortOrder,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	result=_L("5,4,3,2,1,0");
 	TestDirDescendingOrder(result,*dir);
 	delete dir;
@@ -843,21 +844,21 @@
 // Test DirNoOrder - EDescending|EDirDescending
 	sortOrder=ESortByName|EDescending|EDirDescending;
 	r=TheFs.GetDir(gDirDescendingBaseName,KEntryAttMaskSupported,sortOrder,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	result=_L("5,2,4,1,3,0");
 	TestDirDescendingOrder(result,*dir);
 	delete dir;
 // Test DirNoOrder - EDescending
 	sortOrder=ESortByName|EDescending;
 	r=TheFs.GetDir(gDirDescendingBaseName,KEntryAttMaskSupported,sortOrder,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	result=_L("5,2,4,1,3,0");
 	TestDirDescendingOrder(result,*dir);
 	delete dir;
 // Test DirNoOrder - EAscending
 	sortOrder=ESortByName;
 	r=TheFs.GetDir(gDirDescendingBaseName,KEntryAttMaskSupported,sortOrder,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	result=_L("0,3,1,4,2,5");
 	TestDirDescendingOrder(result,*dir);
 	delete dir;
@@ -881,7 +882,7 @@
 	MakeFile(_L("\\F32-TST\\GDIR\\DEF122894\\Xxxxxxxx1.dat"));
 	CDir* dir;
 	TInt r=TheFs.GetDir(_L("\\F32-TST\\GDIR\\DEF122894\\"),KEntryAttMaskSupported,ESortByName|EAscending,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count() == 2);
 	TEntry entry1, entry2;
 	entry1 = (*dir)[0];
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_hungfs.cpp
--- a/kerneltest/f32test/server/t_hungfs.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_hungfs.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -18,6 +18,7 @@
 //
 
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -149,7 +150,7 @@
 	{
 	RFs fs;
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TInt drive;
 #if defined(__WINS__)
@@ -193,7 +194,7 @@
 //
 	{
 	TInt r=aThread.Create(_L("ThreadNC"),ThreadFunctionNC,KDefaultStackSize,KMinHeapSize,KMinHeapSize,aInfo);
-	test(r==KErrNone);	
+	test_KErrNone(r);	
 	aThread.SetPriority(EPriorityMore);
 	aThread.Resume();
 	HungSemaphoreNC.Wait();
@@ -207,7 +208,7 @@
 //
 	{
 	TInt r=aThread.Create(_L("ThreadC"),ThreadFunctionC,KDefaultStackSize,KMinHeapSize,KMinHeapSize,&aBool);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	aThread.SetPriority(EPriorityMore);
 	aThread.Resume();
 	User::After(1000000);
@@ -253,18 +254,18 @@
 	// used for EFsSubClose
 	RFile file;
 	TInt r=file.Create(TheFs,File1,EFileShareAny|EFileWrite);
-	test(r==KErrNone||KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	if(r==KErrAlreadyExists)
 		{
 		r=file.Open(TheFs,File1,EFileShareAny|EFileWrite);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	TBuf8<16> buf=_L8("abcdefghijklmnop");
 	r=file.Write(buf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.MkDir(NotifyDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RThread thread;
 	PutCriticalNotifier(ETrue,thread);
@@ -300,17 +301,17 @@
 	// EFsFileOpen
 	test.Next(_L("test functions that are not supported with critical notifier"));
 	r=file.Open(TheFs,File2,EFileShareAny);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// EFsFileCreate
 	r=file.Create(TheFs,File2,EFileShareAny);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// EFsMkDir
 	r=TheFs.MkDir(Dir1);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// EFsVolume
 	TVolumeInfo info;
 	r=TheFs.Volume(info,gSessionDrive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	// get rid of critical notifier
 	test.Printf(_L("Press escape on the critical notifier\n"));
@@ -329,16 +330,16 @@
 	TFileName notDir=gLockedBase;
 	notDir+=NotifyDir;
 	r=TheFs.MkDir(notDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(status==KRequestPending&&status2==KErrNone);
 	TheFs.NotifyChangeCancel();
 	test(status==KErrCancel);
 	r=TheFs.Delete(File1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(notDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(NotifyDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 void TestParsingFunctions()	
@@ -357,50 +358,50 @@
 	TFileName dir=gLockedBase;
 	dir+=Dir1;
 	TInt r=TheFs.MkDir(dir);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	TFileName file=gLockedPath;
 	file+=File1;
 	RFile f;
 	r=f.Create(TheFs,file,EFileShareAny);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// Using ParsePathPtr0
 	r=TheFs.SetSubst(gLockedPath,EDriveO);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// ValidateDrive
 	TVolumeInfo info;
 	r=TheFs.Volume(info,gLockedDrive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	TFileName origSessPath;
 	r=TheFs.SessionPath(origSessPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// test these work ok
 	r=TheFs.SetSessionPath(gLockedPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetSessionPath(origSessPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// test on different drive from notifier - the session path
 	test.Next(_L("test parsing functions on a different drive"));
 	// Using ParseSubst
 	r=TheFs.MkDir(Dir1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(Dir1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Create(TheFs,File1,EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	r=TheFs.Delete(File1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// Using ParsePathPtr0
 	r=TheFs.SetSubst(gSessionPath,EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetSubst(_L(""),EDriveO);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// ValidateDrive
 	r=TheFs.Volume(info,gSessionDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// get rid of non-critical notifier
 	test.Printf(_L("Enter %S on the notifier\n"),&KPassword);
@@ -423,9 +424,9 @@
 	test.Next(_L("TestTFsFunctions"));
 	TFileName sessName,lockedName;
 	TInt r=TheFs.FileSystemName(sessName,gSessionDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.FileSystemName(lockedName,gLockedDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RThread thread;
 	PutNonCriticalNotifier(NULL,thread);
@@ -434,13 +435,13 @@
 	test.Next(_L("test TFs functions on hung drive"));
 	// TFsDismountFileSystem
 	r=TheFs.DismountFileSystem(lockedName,gLockedDrive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// TFsMountFileSystem
 	r=TheFs.MountFileSystem(lockedName,gLockedDrive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// TFsFileSystemName
 	r=TheFs.FileSystemName(lockedName,gLockedDrive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	// test functions on drive other than hung drive
 	test.Next(_L("test TFs functions on drive that is not hung"));
@@ -451,17 +452,17 @@
 		{
 #endif
 	r=TheFs.DismountFileSystem(sessName,gSessionDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// TFsMountFileSystem
 	r=TheFs.MountFileSystem(sessName,gSessionDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #if defined(__WINS__)
 		}
 #endif
 	// TFsFileSystemName
 	TFileName fsName;
 	r=TheFs.FileSystemName(fsName,gSessionDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(fsName==sessName);
 
 	// test functions that fail on all drives
@@ -470,16 +471,16 @@
 	CFileList* list=NULL;
 	TOpenFileScan fileScan(TheFs);
 	TRAP(r,fileScan.NextL(list));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	// test functions that should pass on any drive
 	test.Next(_L("test TFs functions that pass on all drives"));
 	// TFsSetDefaultPath
 	// TFsSetSessionPath
 	r=TheFs.SetSessionPath(gLockedPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// get rid of non-critical notifier
 	test.Printf(_L("Enter %S on the notifier\n"),&KPassword);
@@ -509,20 +510,20 @@
 	TFileName fileName=gLockedPath;
 	fileName+=File1;
 	TInt r=file.Create(TheFs,fileName,EFileShareAny);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// EFsFormatOpen
 	RFormat format;
 	TInt count;
 	r=format.Open(TheFs,gLockedPath,EHighDensity,count);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// EFsDirOpen
 	RDir dir;
 	r=dir.Open(TheFs,gLockedPath,KEntryAttMaskSupported);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// EFsRawDiskOpen
 	RRawDisk raw;
 	r=raw.Open(TheFs,gLockedDrive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	// get rid of non-critical notifier
 	test.Printf(_L("Enter %S on the notifier\n"),&KPassword);
@@ -535,14 +536,14 @@
 
 	// now open the subsessions
 	r=file.Create(TheFs,fileName,EFileShareAny);
-	test(r==KErrNone||KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	if(r==KErrAlreadyExists)
 		{
 		r=file.Open(TheFs,fileName,EFileShareAny);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	r=dir.Open(TheFs,gLockedPath,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	// put notifier back up
 	PutNonCriticalNotifier(NULL,thread);
@@ -552,16 +553,16 @@
 	// EFsFileRead
 	TBuf8<16> readBuf;
 	r=file.Read(readBuf);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// subsession should be able to be closed ok
 	file.Close();
 	// EFsDelete
 	r=TheFs.Delete(fileName);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// EFsDirRead
 	TEntry entry;
 	r=dir.Read(entry);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// subsession should be able to be closed ok
 	dir.Close();
 
@@ -577,7 +578,7 @@
 	thread.Close();
 
 	r=TheFs.Delete(fileName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	test.End();
 	}
 
@@ -590,7 +591,7 @@
 
 	RFile file;
 	TInt r=file.Create(TheFs,File1,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// put notifier up using TheFs session
 	SNonCriticalInfo info={ETrue,0};
@@ -622,12 +623,12 @@
 	TFileName defPath;
 	// EFsCheckDisk
 	r=TheFs.CheckDisk(gSessionPath);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// EFsFileWrite
 	_LIT8(buffer,"abc");
 	TBuf8<8> buf(buffer);
 	r=file.Write(buf);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 
 	// this file should be able to be closed
 	file.Close();
@@ -643,7 +644,7 @@
 	thread.Close();
 
 	r=TheFs.Delete(File1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	test.End();
 	}
 
@@ -658,7 +659,7 @@
 	_LIT(file4Name,"\\SubFile4");
 	TFileName origSession;
 	TInt r=TheFs.SessionPath(origSession);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName file1Path(gLockedBase);
 	file1Path+=file1Name;
 	TFileName file2Path(file2Name);
@@ -667,24 +668,24 @@
 	TFileName file4Path(file4Name);
 	// create file that will be used to hang file server
 	r=SubFile1.Create(TheFs,file1Path,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// create file with same session but on different drive
 	RFile subfile2;
 	r=subfile2.Create(TheFs,file2Path,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// create file on unhung drive and with different session
 	RFs fs2;
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SetSessionPath(origSession);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFile subfile3;
 	r=subfile3.Create(fs2,file3Path,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// create file on unhung drive and with different session
 	RFile subfile4;
 	r=subfile4.Create(fs2,file4Path,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// in a different thread cause the server to hang using one of the File1 subsession
 	// put notifier up using TheFs session
 	SNonCriticalInfo info={ETrue,ETrue};
@@ -696,16 +697,16 @@
 	TBuf8<8> buf(buffer);
 	// File1 caused hung file server
 	r=SubFile1.Write(buf);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// file2 is same session as subsession that caused hung file server
 	r=subfile2.Write(buf);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// file3 is opened on hung drive
 	r=subfile3.Write(buf);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	// file4 should be ok
 	r=subfile4.Write(buf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// hard to test EFsSubClose since does not return an error value
 	test.Next(_L("test closing down the subsessions"));
 	subfile4.Close();
@@ -727,13 +728,13 @@
 	// clean up
 	fs2.Close();
 	r=TheFs.Delete(file1Path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(file2Path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(file3Path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(file4Path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 void TestExtendedNotifier()
@@ -751,9 +752,9 @@
 	test(status==KRequestPending);
 	// now do an operation on c: and test no notification
 	TInt r=TheFs.MkDir(NotifyDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(NotifyDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::After(1000000);
 	test(status==KRequestPending);
 	TheFs.NotifyChangeCancel(status);
@@ -771,15 +772,15 @@
 	test(status==KRequestPending);
 	// test notification does not go off with wrong path
 	r=TheFs.MkDir(NotifyDir2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(NotifyDir2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(status==KRequestPending);
 	// now do an operation on c: and test there has been a notification
 	r=TheFs.MkDir(NotifyDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(NotifyDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::After(1000000);
 	// request should be completed this time
 	test(status==KErrNone);
@@ -792,17 +793,17 @@
 	TRequestStatus status2;
 	TFileName origSession;
 	r=TheFs.SessionPath(origSession);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFs fs2;
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SetSessionPath(origSession);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	_LIT(notifyDirZ,"z:\\test\\");
 	_LIT(notifyDirSess,"\\test\\");
 	// notifyDirZ already exists, create test dir in session path
 	r=fs2.MkDir(notifyDirSess);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs2.NotifyChange(ENotifyDir,status2,notifyDirZ);
 	test(status2==KRequestPending);
 	TRequestStatus status3;
@@ -810,7 +811,7 @@
 	test(status3==KRequestPending);
 	// now delete session dir and test no notification
 	r=TheFs.RmDir(notifyDirSess);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(status2==KRequestPending && status3==KErrNone);
 
 	// get rid of non-critical notifier
@@ -841,11 +842,11 @@
 	test(status==KRequestPending);
 	// create directory on locked drive
 	r=TheFs.MkDir(notDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// test notifier goes off
 	test(status==KErrNone);
 	r=TheFs.RmDir(notDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// get rid of critical notifier
 	}	
 
@@ -856,15 +857,15 @@
 	{
 #if defined(__WINS__)
 	TInt r=TheFs.CharToDrive(gSessionPath[0],gSessionDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if(gSessionDrive==EDriveX)
 		return(EFalse);
 #else
 	TInt r=TheFs.CharToDrive(gSessionPath[0],gSessionDrive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TDriveList list;
 	r=TheFs.DriveList(list);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	if((list[gSessionDrive])&KDriveAttRemovable)
 		return(EFalse);
 #endif
@@ -905,9 +906,9 @@
 		isSecureMmc=EFalse;
 
 	TInt r=HungSemaphoreC.CreateLocal(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=HungSemaphoreNC.CreateLocal(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// create sharable session
 	TheFs.ShareAuto();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_localeutils_cp932.cpp
--- a/kerneltest/f32test/server/t_localeutils_cp932.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_localeutils_cp932.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -43,7 +43,7 @@
 	{
 
     TInt nRes = ReadBootSector(TheFs, CurrentDrive(), KBootSectorNum<<KDefaultSectorLog2, aBootSector);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
     if(!aBootSector.IsValid())
         {
@@ -254,7 +254,7 @@
 	_LIT(KVolumeLabelOverflow,		"\x65B0\x65B0\x65B0\x65B0\x65B0\x65B0");
 	r = TheFs.SetVolumeLabel(KVolumeLabelOverflow, driveNum);
 	// locale dll and codepage dll both return diff retrun values so check against both cases.
-	test((r == KErrBadName) || (r == KErrOverflow));
+	test_Value(r, (r == KErrBadName) || (r == KErrOverflow));
 
 	r = TheFs.Volume(vInfo, driveNum);
 	test_KErrNone(r);
@@ -702,12 +702,12 @@
 	TFileName fn = _L("\\ABCD");
 	
 	TInt r=file.Create(TheFs,fn,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	//	Assume this file is the first entry in the root directory
 	r=TheDisk.Open(TheFs,CurrentDrive());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
     //-- read the 1st dir entry, it should be a DOS entry 
     const TInt posEntry1=gBootSector.RootDirStartSector() << KDefaultSectorLog2; //-- dir entry1 position
@@ -747,9 +747,9 @@
 	
 	TEntry entry;
 	TInt err = TheFs.Entry(fn, entry);
-	test(err==KErrNone);
+	test_KErrNone(err);
 	err = TheFs.Delete(fn);
-	test(err==KErrNone);
+	test_KErrNone(err);
 #else
 	test.Printf(_L("Test only runs on DEBUG builds, see test logs of debug builds for details."));
 #endif  // _DEBUG) || _DEBUG_RELEASE
@@ -779,13 +779,13 @@
 	
 	test.Next(_L("create file \"AB\" under root directory"));
 	TInt r=file.Create(TheFs,fn,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	test.Next(_L("manually change file name to \"0x7F0x450x7F0x45\" via raw disk accessing"));
 	//	Assume this file is the first entry in the root directory
 	r=TheDisk.Open(TheFs,CurrentDrive());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
     //-- read the first dir entry, it should be a DOS entry 
     const TInt posEntry1=gBootSector.RootDirStartSector() << KDefaultSectorLog2; //-- dir entry1 position
@@ -870,15 +870,15 @@
 	_LIT(KShortName, "\x3055\x307E\x3056~1");
 	TFileName sn;
 	r = TheFs.GetShortName(fn, sn);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = sn.Compare(KShortName);
-	test(r==0);
+	test_Value(r, r == 0);
 	
 	r = TheFs.ScanDrive(_L("gSessionPath"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r = TheFs.Delete(fn);
-	test(r == KErrNone);
+	test_KErrNone(r);
 #else
 	test.Printf(_L("Test only runs on DEBUG builds, see test logs of debug builds for details."));
 #endif  // _DEBUG) || _DEBUG_RELEASE
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_locate.cpp
--- a/kerneltest/f32test/server/t_locate.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_locate.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -101,15 +101,15 @@
 	for (TInt i=0;i<5;i++)
 		{
 		TInt r=TheFs.Drive(drive);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	TInt r=TheFs.MkDirAll(_L("alskdjfl"));
-	test(r==-47);
+	test_Value(r, r == -47);
 	r=TheFs.MkDirAll(_L("alskdjfl"));
-	test(r==-47);
+	test_Value(r, r == -47);
 	TheFs.SetErrorCondition(KErrNone);
 	r=TheFs.Drive(drive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #endif
 //
 	test.Next(_L("Create LOCTEST files"));
@@ -152,7 +152,7 @@
     TDriveInfo info;
 
 	 err = TheFs.DriveList(driveList);
-    test( err == KErrNone );
+    test_KErrNone(err);
     
     for (TInt i = 0; i < KMaxDrives; i++) 
         {
@@ -160,7 +160,7 @@
         if (driveList[i]) 
             {
             err = TheFs.Drive(info, i);
-            test( err == KErrNone ); 
+            test_KErrNone(err); 
                         
             if(( info.iDriveAtt  & KDriveAttRemovable ) && !( info.iDriveAtt  & KDriveAttLogicallyRemovable ))  
             	{
@@ -198,7 +198,7 @@
     TDriveInfo info;
 
 	 err = TheFs.DriveList(driveList);
-    test( err == KErrNone );
+    test_KErrNone(err);
     
     for (TInt i = 0; i < KMaxDrives; i++) 
         {
@@ -206,7 +206,7 @@
         if (driveList[i]) 
             {
             err = TheFs.Drive(info, i);
-            test( err == KErrNone ); 
+            test_KErrNone(err); 
                         
             if( info.iDriveAtt  & KDriveAttInternal  ) 
             	{			
@@ -248,7 +248,7 @@
 		gPathRem.Append (removableDriveLetter);
 		gPathRem.Append (_L(":\\F32-TST\\") );
 		TInt r=fMan->RmDir(gPathRem);
-		test(r==KErrNone);
+		test_KErrNone(r);
 	
 		delete fMan;
 		}
@@ -269,7 +269,7 @@
 		gPathInt.Append (internalDriveLetter);
 		gPathInt.Append (_L(":\\F32-TST\\") );
 		TInt r=fMan->RmDir(gPathInt);
-		test(r==KErrNone);
+		test_KErrNone(r);
 	
 		delete fMan;
 		}
@@ -285,7 +285,7 @@
 	TInt r=TheFs.AddFileSystem(_L("CFAFSDLY"));
 	test.Printf(_L("Add remote file system\n"));
 	test.Printf(_L("AddFileSystem returned %d\n"),r);
-	test (r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 
 
 	r=TheFs.MountFileSystem(_L("DELAYFS"),EDriveQ);
@@ -293,7 +293,7 @@
 	
 	test.Printf(_L("Mount remote file system\n"));
 	test.Printf(_L("MountFileSystem returned %d\n"),r);
-	test(r==KErrNone || r==KErrCorrupt || r==KErrNotReady || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrCorrupt || r==KErrNotReady || r==KErrAlreadyExists);
 
 	
 	Mf(_L("Q:\\F32-TST\\LOCTEST\\BIN\\FINDFILE.AAA"));
@@ -311,7 +311,7 @@
  	 
  	test.Printf(_L("Dismounting the Remote Drive returned %d\n"),r);
  	
- 	test(r==KErrNone );
+ 	test_KErrNone(r);
 	}
 
 
@@ -326,41 +326,41 @@
 	
 	TAutoClose<RFs> fs;
 	TInt r=fs.iObj.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFindFile finder(fs.iObj);
 	TPtrC path=gPath1;
 	r=finder.FindByPath(_L("file1.aaa"),&path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TParse fileParse;
 	fileParse.Set(finder.File(),NULL,NULL);
 	test(fileParse.Path()==_L("\\F32-TST\\LOCTEST\\BIN1\\"));
 	test(fileParse.NameAndExt()==_L("file1.aaa"));
 	r=finder.Find();
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 
 
 	path.Set(gPath2);
 	r=finder.FindByPath(_L("file1.aaa"),&path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileParse.Set(finder.File(),NULL,NULL);
 	test(fileParse.Path()==_L("\\F32-TST\\LOCTEST\\BIN1\\"));
 	test(fileParse.NameAndExt()==_L("file1.aaa"));
 	r=finder.Find();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileParse.Set(finder.File(),NULL,NULL);
 	test(fileParse.Path()==_L("\\F32-TST\\LOCTEST\\BIN1\\BIN4\\"));
 	test(fileParse.NameAndExt()==_L("file1.aaa"));
 	r=finder.Find();
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 //
 	test.Next(_L("Test FindByDir"));
 	TPtrC dir=_L("\\F32-TST\\LOCTEST\\BIN2\\");
 	r=finder.FindByDir(_L("file2.bbb"),dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName defaultPath;
 	r=TheFs.SessionPath(defaultPath);
 	defaultPath.SetLength(2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileParse.Set(finder.File(),NULL,NULL);
 	test(fileParse.Drive()==defaultPath);
 	test(fileParse.Path()==_L("\\F32-TST\\LOCTEST\\BIN2\\"));
@@ -377,7 +377,7 @@
 		test(_L("file2.bbb").MatchF(fileParse.NameAndExt())!=KErrNotFound);
 		r=finder.Find();
 		}
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	}
 
 LOCAL_C void Test2()
@@ -389,36 +389,36 @@
 	test.Next(_L("Test extremes"));
 	TAutoClose<RFs> fs;
 	TInt r=fs.iObj.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf<4> temp=_L("");
 	TFindFile finder(fs.iObj);
 	r=finder.FindByPath(_L("file1.aaa"),&temp);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=finder.Find();
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 //
 	TPtrC path=_L("blarg.7");
 	r=finder.FindByPath(_L(""),&path);	
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	r=finder.FindByPath(_L("*"),&path);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=finder.FindByPath(_L("xmvid"),&path);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=finder.Find();
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 //
 	path.Set(_L("C:\\F32-TST\\LOCTEST\\BIN1\\;\\F32-TST\\LOCTEST\\BIN2\\;Z:\\F32-TST\\LOCTEST\\BIN1\\BIN4\\;\\F32-TST\\LOCTEST\\BIN3\\;"));
 	r=finder.FindByPath(_L(""),&path);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	r=finder.FindByPath(_L("xyz.abc"),&path);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=finder.Find();
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	
 	test.Next(_L("Test FindByDir with empty file spec"));
 	TPtrC dir2=_L("\\F32-TST\\LOCTEST\\");
 	r=finder.FindByDir(_L(""),dir2);
-	test(r==KErrArgument);		
+	test_Value(r, r == KErrArgument);		
 	
 	}
 
@@ -436,23 +436,23 @@
 //
 	TAutoClose<RFs> fs;
 	r=fs.iObj.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFindFile finder(fs.iObj);
 	r=finder.FindByPath(_L("file1.aaa"),&path);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=finder.Find();
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 //
 	path.Set(_L("\\F32-TST\\LOCTEST\\BIN2\\"));
 	r=finder.FindByPath(_L("file2.bbb"),&path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TParse fileParse;
 	fileParse.Set(finder.File(),NULL,NULL);
 	test(fileParse.Drive()==defaultPath);
 	test(fileParse.Path()==_L("\\F32-TST\\LOCTEST\\BIN2\\"));
 	test(fileParse.NameAndExt()==_L("file2.bbb"));
 	r=finder.Find();
-	test(r==KErrNotFound || r==KErrNone);
+	test_Value(r, r == KErrNotFound || r==KErrNone);
 	if (r==KErrNone)
 		{
 		fileParse.Set(finder.File(),NULL,NULL);
@@ -460,23 +460,23 @@
 		test(fileParse.Path()==_L("\\F32-TST\\LOCTEST\\BIN2\\"));
 		test(fileParse.NameAndExt()==_L("file2.bbb"));
 		r=finder.Find();
-		test(r==KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		}
 //
 	path.Set(_L("C:\\F32-TST\\LOCTEST\\BIN1\\;;\\F32-TST\\LOCTEST\\BIN2\\;Z:\\F32-TST\\LOCTEST\\BIN1\\BIN4\\;\\F32-TST\\LOCTEST\\BIN3\\;"));
 	r=finder.FindByPath(_L("xyz.abc"),&path);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=finder.Find();
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 //
 	r=finder.FindByPath(_L("file2.bbb"),&path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileParse.Set(finder.File(),NULL,NULL);
 	test(fileParse.Drive()==defaultPath);
 	test(fileParse.Path()==_L("\\F32-TST\\LOCTEST\\BIN2\\"));
 	test(fileParse.NameAndExt()==_L("file2.bbb"));
 	r=finder.Find();
-	test(r==KErrNotFound || r==KErrNone);
+	test_Value(r, r == KErrNotFound || r==KErrNone);
 	if (r==KErrNone)
 		{
 		fileParse.Set(finder.File(),NULL,NULL);
@@ -484,7 +484,7 @@
 		test(fileParse.Path()==_L("\\F32-TST\\LOCTEST\\BIN2\\"));
 		test(fileParse.NameAndExt()==_L("file2.bbb"));
 		r=finder.Find();
-		test(r==KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		}
 	}
 
@@ -502,7 +502,7 @@
 	TFileName path;
 
 	TInt r=finder.FindWildByPath(_L("*.aaa"),&gPath3,dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==3);
 	entry=(*dir)[0];
@@ -518,7 +518,7 @@
 	delete dir;
 
 	r=finder.FindWild(dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==2);
 	entry=(*dir)[0];
@@ -531,26 +531,26 @@
 	delete dir;
 
 	r=finder.FindWild(dir);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=finder.FindWild(dir);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 
 	r=finder.FindWildByPath(_L("*FILE.AAA*"), &gPath1, dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count()==1);
 	entry=(*dir)[0];
 	test(entry.iName.MatchF(_L("FILE.AAA"))!=KErrNotFound);
 	delete dir;
 	
 	r=finder.FindWildByPath(_L("*FILE.AAA"), &gPath1, dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count()==1);
 	entry=(*dir)[0];
 	test(entry.iName.MatchF(_L("FILE.AAA"))!=KErrNotFound);
 	delete dir;
 	
 	r=finder.FindWildByPath(_L("FILE.AAA*"), &gPath1, dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count()==1);
 	entry=(*dir)[0];
 	test(entry.iName.MatchF(_L("FILE.AAA"))!=KErrNotFound);
@@ -558,26 +558,26 @@
 
     
 	r=finder.FindWildByPath(_L("CONFUSED.DOG"), &gPath1, dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count()==1);
 	entry=(*dir)[0];
 	test(entry.iName.MatchF(_L("CONFUSED.DOG"))!=KErrNotFound);
 	delete dir;
 
 	r=finder.FindWildByPath(_L("*CONFUSED.DOG"), &gPath1, dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count()==1);
 	entry=(*dir)[0];
 	test(entry.iName.MatchF(_L("CONFUSED.DOG"))!=KErrNotFound);
 	delete dir;
 	r=finder.FindWildByPath(_L("CONFUSED.DOG*"), &gPath1, dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count()==1);
 	entry=(*dir)[0];
 	test(entry.iName.MatchF(_L("CONFUSED.DOG"))!=KErrNotFound);
 	delete dir;
 	r=finder.FindWildByPath(_L("*CONFUSED.DOG*"), &gPath1, dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dir->Count()==1);
 	entry=(*dir)[0];
 	test(entry.iName.MatchF(_L("CONFUSED.DOG"))!=KErrNotFound);
@@ -598,7 +598,7 @@
 	TFileName path;
 
 	TInt r=finder.FindWildByDir(_L("FILE*"),_L("\\F32-TST\\LOCTEST\\BIN3\\"),dir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=dir->Count();
 	test(count==1);
 	entry=(*dir)[0];
@@ -614,7 +614,7 @@
 	r=finder.FindWild(dir);
 	if (r==KErrNotFound)
 		return;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	entry=(*dir)[0];
 	test(entry.iName.MatchF(_L("FILE3.CCC"))!=KErrNotFound);
 	fileParse.Set(finder.File(),NULL,NULL);
@@ -623,9 +623,9 @@
 	delete dir;
 
 	r=finder.FindWild(dir);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=finder.FindWild(dir);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	}
 
 LOCAL_C void Test6()
@@ -637,7 +637,7 @@
 	test.Next(_L("Test file not found"));
 	TFindFile ff(TheFs);
 	TInt r=ff.FindByDir(_L("NOEXIST.EXE"),_L("\\System\\Programs\\"));
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	}
 
 
@@ -676,7 +676,7 @@
 	
 	TAutoClose<RFs> fs;
 	TInt r=fs.iObj.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFindFile finder(fs.iObj);
 	TPtrC path=gPath4;
 	r=finder.FindByPath(_L("findfile.aaa"),&path); 	
@@ -687,16 +687,16 @@
 	
 	if (removableFlag == 1)
 		{
-			test(r==KErrNone); 
+			test_KErrNone(r); 
 			fileParse.Set(finder.File(),NULL,NULL);
 			test(fileParse.Path()==_L("\\F32-TST\\LOCTEST\\BIN\\"));
 			test(fileParse.NameAndExt()==_L("findfile.aaa")); //The filename.aaa in the removable Drive
 			r=finder.Find();
-			test(r==KErrNotFound);     //remote drives are excluded by default
+			test_Value(r, r == KErrNotFound);     //remote drives are excluded by default
 		
 		}
 	else
-		test(r==KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 
 	
 
@@ -704,9 +704,9 @@
 
 
 	r=finder.SetFindMask(	KDriveAttAll) ;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=finder.FindByPath(_L("findfile.aaa"),&path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileParse.Set(finder.File(),NULL,NULL);
 	test(fileParse.Path()==_L("\\F32-TST\\LOCTEST\\BIN\\"));   
 	test(fileParse.NameAndExt()==_L("findfile.aaa"));      //either the remote or removable one.
@@ -715,7 +715,7 @@
 	
 	if (removableFlag == 1)
 		{	
-		test(r==KErrNone);
+		test_KErrNone(r);
 	
 		fileParse.Set(finder.File(),NULL,NULL);
 
@@ -723,11 +723,11 @@
 		test(fileParse.NameAndExt()==_L("findfile.aaa"));         //either the remote or removable one.
 
 		r=finder.Find();
-		test(r==KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		}
 	else 
 		{
-		test(r==KErrNotFound);	
+		test_Value(r, r == KErrNotFound);	
 			
 		}
 		
@@ -735,30 +735,30 @@
 	test.Next(_L("Search exclusively in remote drives \n"));
 
 	r=finder.SetFindMask(	KDriveAttExclusive| KDriveAttRemote); 
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=finder.FindByPath(_L("findfile.aaa"),&path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileParse.Set(finder.File(),NULL,NULL);
 	test(fileParse.Path()==_L("\\F32-TST\\LOCTEST\\BIN\\"));
 	test(fileParse.NameAndExt()==_L("findfile.aaa"));
 	r=finder.Find();
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 
 	
 	test.Next(_L("Search excluding removables and remote \n"));
 
 	r=finder.SetFindMask(	KDriveAttExclude | KDriveAttRemovable |KDriveAttRemote ); 
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=finder.FindByPath(_L("findfile.aaa"),&path);   
-	test(r==KErrNotFound);   //filename.aaa exists in the remote drive and if present to the removable one
+	test_Value(r, r == KErrNotFound);   //filename.aaa exists in the remote drive and if present to the removable one
 
 
 	test.Next(_L("Search in Internal Drives \n"));
 
 	r=finder.SetFindMask(KDriveAttInternal ) ;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=finder.FindByPath(_L("findfile.aaa"),&path);   
-	test(r==KErrNotFound);   //filename.aaa exists only in the Removable drive and the remote one.
+	test_Value(r, r == KErrNotFound);   //filename.aaa exists only in the Removable drive and the remote one.
 
 
 	}
@@ -789,16 +789,16 @@
 	
 	TAutoClose<RFs> fs;
 	TInt r=fs.iObj.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFindFile finder(fs.iObj);
 	TPtrC path=gPath4;	
 	TParse fileParse;
 		
 
 	r=finder.SetFindMask(KDriveAttAll) ;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=finder.FindByPath(_L("findfile.aaa"),&path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileParse.Set(finder.File(),NULL,NULL);
 	test(fileParse.Path()==_L("\\F32-TST\\LOCTEST\\BIN\\"));   
 	test(fileParse.NameAndExt()==_L("findfile.aaa"));
@@ -838,13 +838,13 @@
 		
 		//	test.Printf(_L("\nTest mask : %d \n"),testCombinations[matchIdx].iMatchMask | testAtt );
 			
-			test( r == (testAtt == 0 ? testCombinations[matchIdx].iExpectedResultNoAtts : testCombinations[matchIdx].iExpectedResultWithAtts) );
+			test_Value(r, r == (testAtt == 0 ? testCombinations[matchIdx].iExpectedResultNoAtts : testCombinations[matchIdx].iExpectedResultWithAtts) );
 			
 			
 			if (r== KErrNone)
 				{
 				r  = finder.FindByPath(_L("findfile.aaa"),&path);
-				test (r== KErrNone || r ==KErrNotFound);
+				test_Value(r, r == KErrNone || r ==KErrNotFound);
 				}
 			
 			}
@@ -881,7 +881,7 @@
 
 	TAutoClose<RFs> fs;
 	TInt r=fs.iObj.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TFindFile finder(fs.iObj);
 	
@@ -899,9 +899,9 @@
 		test.Next(_L("FindByDir with wild filenames when a find mask is specified"));
 		
 		TInt r=finder.SetFindMask(KDriveAttRemovable);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=finder.FindWildByDir(_L("FIND*"),_L("\\F32-TST\\LOCTEST\\BIN\\"),dir);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		count=dir->Count();
 		test(count==1);
 		entry=(*dir)[0];
@@ -909,13 +909,13 @@
 		delete dir;	
 
 		r=finder.FindWild(dir);
-		test(r==KErrNotFound);	
+		test_Value(r, r == KErrNotFound);	
 		
 		
 		r=finder.SetFindMask(KDriveAttExclude| KDriveAttRemovable);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=finder.FindWildByDir(_L("FIND*"),_L("\\F32-TST\\LOCTEST\\BIN\\"),dir);
-		test(r==KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 		
 		
 		test.Next(_L("Test FindByDir when a find mask is specified"));
@@ -924,12 +924,12 @@
 		TPtrC dir2=_L("\\F32-TST\\LOCTEST\\BIN\\");
 		
 		r=finder.SetFindMask(KDriveAttExclude | KDriveAttRemote );
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=finder.FindByDir(_L("findfile.aaa"),dir2);
-		test(r==KErrNone);
+		test_KErrNone(r);
 	
 		r=finder.Find();
-		test(r==KErrNotFound);	
+		test_Value(r, r == KErrNotFound);	
 		
 
 		}
@@ -965,7 +965,7 @@
 
 		
 		r=finder.FindWildByPath(_L("FIND*.AAA"), &gPath5, dir3);
- 		test(r==KErrNone);
+ 		test_KErrNone(r);
 		test(dir3->Count()==2);
 		
 		entry=(*dir3)[0];		
@@ -981,16 +981,16 @@
 		
 		
 		r=finder.SetFindMask(KDriveAttExclude| KDriveAttInternal);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=finder.FindWildByPath(_L("FIND*.AAA"), &gPath5, dir3);	
- 		test(r==KErrNone);
+ 		test_KErrNone(r);
 		test(dir3->Count()==2);
 		
 		delete dir3;
 		
 		
 		r=finder.FindWild(dir3);
-		test(r==KErrNotFound);
+		test_Value(r, r == KErrNotFound);
 				
 				
 		}
@@ -1026,7 +1026,7 @@
     
     __UHEAP_MARK;
     nRes = finder.FindWildByPath(_L("*"), &gPath1, pDir);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(pDir && pDir->Count() > 1);
     delete pDir;
 
@@ -1034,7 +1034,7 @@
     for(cnt = 0; ;cnt++)
         {
         nRes =TheFs.SetErrorCondition(KMyError, cnt);
-        test(nRes == KErrNone);
+        test_KErrNone(nRes);
 
         pDir = (CDir*)0xaabbccdd;
         nRes = finder.FindWildByPath(_L("*"), &gPath1, pDir);
@@ -1070,14 +1070,14 @@
     
    __UHEAP_MARK;
    nRes = finder.FindWildByDir(_L("*"), KPath, pDir);
-   test(nRes == KErrNone);
+   test_KErrNone(nRes);
    test(pDir && pDir->Count() > 1);
    delete pDir;
    
    for(cnt = 0; ;cnt++)
         {
         nRes =TheFs.SetErrorCondition(KMyError, cnt);
-        test(nRes == KErrNone);
+        test_KErrNone(nRes);
 
         pDir = (CDir*)0xaabbccdd;
         nRes = finder.FindWildByDir(_L("*"), KPath, pDir);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_lock.cpp
--- a/kerneltest/f32test/server/t_lock.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_lock.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -61,11 +62,11 @@
 #else
 	TInt r=format.Open(TheFs,_L("C:\\"),EHighDensity,count);
 #endif
-	test(r==KErrNone);
+	test_KErrNone(r);
 	while(count)
 		{
 		r=format.Next(count);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	format.Close();
 	}
@@ -83,7 +84,7 @@
 	test.Next(_L("Formatting disk"));
 	DoFormat();
 	r=TheFs.MkDir(testDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 RFileTest::RFileTest(const TDesC& aName)
@@ -101,7 +102,7 @@
 
 	test.Printf(_L("%S replace %S\n"),&iName,&aName);
 	TInt r=RFile::Replace(TheFs,aName,EFileStream|EFileWrite|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -113,7 +114,7 @@
 
 	test.Printf(_L("%S open %S\n"),&iName,&aName);
 	TInt r=RFile::Open(TheFs,aName,EFileStream|EFileWrite|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -125,7 +126,7 @@
 
 	test.Printf(_L("%S lock   %08x-%08x\n"),&iName,aPos,aPos+aLen-1);
 	TInt r=RFile::Lock(aPos,aLen);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -137,7 +138,7 @@
 
 	test.Printf(_L("%S lockE  %08x-%08x\n"),&iName,aPos,aPos+aLen-1);
 	TInt r=RFile::Lock(aPos,aLen);
-	test(r==KErrLocked);
+	test_Value(r, r == KErrLocked);
 	return(*this);
 	}
 
@@ -149,7 +150,7 @@
 
 	test.Printf(_L("%S ulock  %08x-%08x\n"),&iName,aPos,aPos+aLen-1);
 	TInt r=RFile::UnLock(aPos,aLen);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -161,7 +162,7 @@
 
 	test.Printf(_L("%S ulockE %08x-%08x\n"),&iName,aPos,aPos+aLen-1);
 	TInt r=RFile::UnLock(aPos,aLen);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	return(*this);
 	}
  
@@ -174,7 +175,7 @@
 
 	test.Printf(_L("%S lock   %08x-%08x\n"),&iName,aPos,aPos+aLen-1);
 	TInt r=RFile::Lock(aPos,aLen);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	return(*this);
 	}
 
@@ -186,7 +187,7 @@
 
 	test.Printf(_L("%S ulock  %08x-%08x\n"),&iName,aPos,aPos+aLen-1);
 	TInt r=RFile::UnLock(aPos,aLen);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	return(*this);
 	}
 
@@ -198,7 +199,7 @@
 
 	test.Printf(_L("%S write  %08x-%08x\n"),&iName,aPos,aPos+aLen-1);
 	TInt r=RFile::Write(aPos,Pattern,aLen);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -210,7 +211,7 @@
 
 	test.Printf(_L("%S writeE %08x-%08x\n"),&iName,aPos,aPos+aLen-1);
 	TInt r=RFile::Write(aPos,Pattern,aLen);
-	test(r==KErrLocked);
+	test_Value(r, r == KErrLocked);
 	return(*this);
 	}
 
@@ -222,7 +223,7 @@
 
 	test.Printf(_L("%S read   %08x-%08x\n"),&iName,aPos,aPos+aLen-1);
 	TInt r=RFile::Read(aPos,Buffer,aLen);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -234,7 +235,7 @@
 
 	test.Printf(_L("%S readE  %08x-%08x\n"),&iName,aPos,aPos+aLen-1);
 	TInt r=RFile::Read(aPos,Buffer,aLen);
-	test(r==KErrLocked);
+	test_Value(r, r == KErrLocked);
 	return(*this);
 	}
 
@@ -246,7 +247,7 @@
 
 	test.Printf(_L("%S size   %08x\n"),&iName,aSize);
 	TInt r=RFile::SetSize(aSize);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	return(*this);
 	}
 
@@ -258,7 +259,7 @@
 
 	test.Printf(_L("%S sizeE  %08x\n"),&iName,aSize);
 	TInt r=RFile::SetSize(aSize);
-	test(r==KErrLocked);
+	test_Value(r, r == KErrLocked);
 	return(*this);
 	}
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_main.cpp
--- a/kerneltest/f32test/server/t_main.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_main.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -666,12 +666,12 @@
 
 	TInt orgSessionCount;
 	r = controlIo(TheFs,theDrive, KControlIoSessionCount, orgSessionCount);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("Session count start=%d\n"),orgSessionCount);
 
 	TInt orgObjectCount;
 	r = controlIo(TheFs,theDrive, KControlIoObjectCount, orgObjectCount);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("Object count start=%d\n"),orgObjectCount);
 
 
@@ -717,7 +717,7 @@
 	// NB: This won't help if the test has opened another session & left sub-sessions open.
 	TheFs.Close();
 	r=TheFs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	// Display the file cache stats before closing the file queue
 	TFileCacheStats endFileCacheStats;
@@ -743,11 +743,11 @@
 		test_KErrNone(r);
 
 		r = controlIo(TheFs,theDrive, KControlIoSessionCount, endSessionCount);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test.Printf(_L("Session count end=%d\n"),endSessionCount);
 
 		r = controlIo(TheFs,theDrive, KControlIoObjectCount, endObjectCount);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test.Printf(_L("Object count end=%d\n"),endObjectCount);
 
 		if (endSessionCount == orgSessionCount && endObjectCount == orgObjectCount)
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_mmc.cpp
--- a/kerneltest/f32test/server/t_mmc.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_mmc.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -21,6 +21,7 @@
 //
 
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <f32dbg.h>
@@ -170,7 +171,7 @@
 		r = TheFs.Delete(mediaPWrdFile);
 		} while (r == KErrInUse);
 
-	test(r == KErrNone || r == KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 	}
 
 
@@ -653,7 +654,7 @@
 	User::After(1 * 1000 * 1000);				// wait to finish writing
 	
 	r = TheFs.Delete(mediaPWrdFile);
-	test(r == KErrNone || r == KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 	test(TBusLocalDrive::WritePasswordData(noMappings) == KErrNone);
 
 	// check contents of password file correspond to last written buffer.
@@ -816,7 +817,7 @@
 	mediaPWrdFile[0] = (TUint8) RFs::GetSystemDriveChar();
 	TParsePtrC ppc(mediaPWrdFile);
 	TInt r = TheFs.MkDir(ppc.DriveAndPath());
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 
 	// The media driver for the protected area of the SD card uses mount
 	// info. This is also used for password unlocking by the MMC media driver.
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_mvdr.cpp
--- a/kerneltest/f32test/server/t_mvdr.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_mvdr.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -19,6 +19,7 @@
 //
 
 
+#define __E32TEST_EXTENSION__
 #include <e32test.h>
 #include <f32file.h>
 
@@ -50,7 +51,7 @@
 
 	CFileMan *fm = 0;
 	TRAPD(r, fm = CFileMan::NewL(TheFs));
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	const TInt KMaxDirs = 32;
 
@@ -79,7 +80,7 @@
 			srcDirName.SetLength(srcDirName.Length() - 1);
 			dstDirName.SetLength(dstDirName.Length() - 1);
 			r = fm->Move(srcDirName, dstDirName);
-			test(r == KErrNone);
+			test_KErrNone(r);
 			}
 		}
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_nmbs.cpp
--- a/kerneltest/f32test/server/t_nmbs.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_nmbs.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -13,6 +13,7 @@
 // Description:
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -29,69 +30,69 @@
 	test.Next(_L("Test MkDir"));
 
 	TInt r=TheFs.RmDir(_L("\\F32-TST\\TNMBS\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MkDir(_L("\\F32-TST\\TNMBS\\TEST\\"));
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=TheFs.MkDir(_L("\\F32-TST\\TNMBS\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MkDir(_L("\\F32-TST\\TNMBS\\TEST\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Test RmDir 1.0"));
 	r=TheFs.RmDir(_L("\\F32-TST\\TNMBS\\TEST\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\F32-TST\\TNMBS\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Test MkDirAll 1.0"));
 	r=TheFs.MkDirAll(_L("\\F32-TST\\TNMBS\\TEST\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Test RmDir 2.0"));
 	r=TheFs.RmDir(_L("\\F32-TST\\TNMBS\\TEST\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\F32-TST\\TNMBS\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Test MkDirAll 2.0"));
 	r=TheFs.MkDirAll(_L("\\F32-TST\\TNMBS\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MkDirAll(_L("\\F32-TST\\TNMBS\\TEST\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Test RmDir 3.0"));
 	r=TheFs.RmDir(_L("\\F32-TST\\TNMBS\\TEST\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\F32-TST\\TNMBS\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Test mkdir and rmdir on root"));
 	r=TheFs.RmDir(_L("\\File.TXT"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.MkDir(_L("\\asdf.ere"));
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 	r=TheFs.MkDirAll(_L("\\asdf.ere"));
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 
 	test.Next(_L("Test error code return values"));
 	r=TheFs.MkDir(_L("\\F32-TST\\\\ABCDEF\\"));
 
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 
 	test.Next(_L("Test MkDir with trailing spaces"));
 	r=TheFs.MkDir(_L("\\F32-TST\\TESTMKDIR    \\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\F32-TST\\TESTMKDIR\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.MkDirAll(_L("\\F32-TST\\TESTMKDIR    \\NOTCREATED\\NORTHIS   \\"));
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=TheFs.RmDir(_L("\\F32-TST\\TESTMKDIR\\NOTCREATED\\"));
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.RmDir(_L("\\F32-TST\\TESTMKDIR\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.MkDirAll(_L("\\F32-TST\\TNMBS\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void testRename()
@@ -102,13 +103,13 @@
 
 	test.Next(_L("Test rename directories"));
 	TInt r=TheFs.MkDirAll(_L("\\F32-TST\\ABCDEF\\GPQ\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF\\"),_L("\\F32-TST\\ABCDEF\\LMED"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF\\GPQ"),_L("\\F32-TST\\LMED"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\F32-TST\\LMED\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	MakeDir(_L("\\F32-TST\\ABC\\"));
 	MakeFile(_L("\\F32-TST\\ABCDEF\\GPQ\\asdf.txt"));
@@ -117,110 +118,110 @@
 	test.Next(_L("Test rename directory while subfile is open"));
 	RFile f;
 	r=f.Open(TheFs,_L("\\F32-TST\\ABCDEF\\GPQ\\asdf.txt"),EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF"),_L("\\F32-TST\\xxxyyy"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF"),_L("\\F32-TST\\xxxyyy"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.Rename(_L("\\F32-TST\\ABC"),_L("\\F32-TST\\XXX"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF"),_L("\\F32-TST\\xxxyyy"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(_L("\\F32-TST\\XXX"),_L("\\F32-TST\\ABC"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(_L("\\"),_L("\\BLARG"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 
 	r=f.Open(TheFs,_L("\\F32-TST\\asdf.txt"),EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(_L("\\F32-TST\\xxxyyy"),_L("\\F32-TST\\ABCDEF"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(_L("\\F32-TST\\"),_L("\\ABCDEF"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	f.Close();
 
 	r=TheFs.Delete(_L("\\F32-TST\\ABCDEF\\GPQ\\asdf.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("\\F32-TST\\asdf.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\F32-TST\\ABCDEF\\GPQ\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\F32-TST\\ABC\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=TheFs.Rename(_L("\\TST-E32\\123456"),_L("\\F32-TST\\ABCDEF"));
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=TheFs.Rename(_L("\\F32-TST\\123456"),_L("\\F32-TST\\ABCDEF"));
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.Rename(_L("\\TST-E32\\123456"),_L("\\F32-TST\\FEDCBA"));
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=TheFs.Rename(_L("\\F32-TST\\FEDCBA"),_L("\\TST-E32\\123456"));
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF"),_L("\\F32-TST\\123456"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(_L("\\F32-TST\\123456"),_L("\\F32-TST\\XYZABC"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Test rename files"));
 	r=f.Create(TheFs,_L("\\F32-TST\\XYZABC\\OLDNAME.TXT"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	r=TheFs.Rename(_L("\\F32-TST\\XYZABC\\OLDNAME.TXT"),_L("\\F32-TST\\XYZABC\\NEWNAME.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("\\F32-TST\\XYZABC\\NEWNAME.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Test rename checks for duplicate entries"));
 	r=TheFs.MkDirAll(_L("\\F32-TST\\ABCDEF\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF"),_L("\\F32-TST\\XYZABC"));
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 	r=f.Create(TheFs,_L("\\F32-TST\\XYZABC\\OLDNAME.TXT"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	r=f.Create(TheFs,_L("\\F32-TST\\XYZABC\\NEWNAME.TXT"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	r=TheFs.Rename(_L("\\F32-TST\\XYZABC\\OLDNAME.TXT"),_L("\\F32-TST\\XYZABC\\NEWNAME.TXT"));
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 
 	test.Next(_L("Test rename across directories"));
 	r=TheFs.Rename(_L("\\F32-TST\\XYZABC\\NEWNAME.TXT"),_L("\\F32-TST\\ABCDEF\\OLDNAME.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(_L("\\F32-TST\\XYZABC\\NEWNAME.TXT"),_L("\\F32-TST\\ABCDEF\\OLDNAME.TXT"));
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.Rename(_L("\\F32-TST\\XYZABC\\NEWNAME.TXT"),_L("\\F32-TST\\ABCDEF\\DIFNAME.TXT"));
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.Rename(_L("\\F32-TST\\XYZABC"),_L("\\F32-TST\\ABCDEF\\XYZABC"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF\\XYZABC\\OLDNAME.TXT"),_L("\\F32-TST\\ABCDEF\\NEWNAME.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF\\NewNAME.TXT"),_L("\\F32-TST\\ABCDEF\\XYZABC\\OLDNAME.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Next(_L("Test rename across drive error code"));
 	r=TheFs.Rename(_L("Z:\\BLEG"),_L("C:\\FRUM"));
-	test(r==KErrArgument);	
+	test_Value(r, r == KErrArgument);	
 	test.Next(_L("Test rename to identical names"));
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF\\XYZABC\\OLDNAME.TXT"),_L("\\F32-TST\\ABCDEF\\XYZABC\\OLDNAME.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\XYZABC\\OLDNAME.TXT"),KErrNone);
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF\\XYZABC\\OLDNAME.TXT"),_L("\\F32-TST\\ABCDEF\\XYZABC\\OLdnAME.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\XYZABC\\OLDNAME.TXT"),KErrNone,EFalse);
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\XYZABC\\OLdnAME.TXT"),KErrNone,ETrue);
 
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF\\XYZABC\\OLDNAME.TXT"),_L("\\F32-TST\\ABCDEF\\NEWNAME.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Next(_L("Test RmDir"));
 	r=TheFs.Delete(_L("\\F32-TST\\ABCDEF\\NEWNAME.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("\\F32-TST\\ABCDEF\\OLDNAME.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\F32-TST\\ABCDEF\\XYZABC\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\F32-TST\\ABCDEF\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 LOCAL_C void TestLongFileName()
 	{
@@ -244,11 +245,11 @@
 	TInt 	result = KErrNone;
 	//-- 1. create directory in Root which total path length is 256 symbols.	result = TheFs.MkDirAll(Path);
 	result=TheFs.MkDirAll(Path);
-	test((result==KErrNone)||(result==KErrAlreadyExists));
+	test_Value(result, (result == KErrNone)||(result==KErrAlreadyExists));
 	
 	test.Next(_L("Renaming a 265 char directory to a 257 char directory"));
 	result=TheFs.SetSessionPath(baseDir);
-	test(result==KErrNone);	
+	test_KErrNone(result);	
 	TheFs.SessionPath(baseDir);
 	test.Printf(_L("Session path was set to: %S"), &baseDir);
 
@@ -257,12 +258,12 @@
 	result = KErrNone;
 	Path.Copy(KLongFileName257);
 	result = TheFs.Rename(KLongFileName256, Path);
-	test(result==KErrBadName);
+	test_Value(result, result == KErrBadName);
 	//-- 3. try to rename this directory to one with 258 character total path length
 
 	Path.Append(_L("z"));
 	result = TheFs.Rename(KLongFileName256, Path);
-	test(result==KErrBadName);
+	test_Value(result, result == KErrBadName);
 
 	}
 LOCAL_C void testRenameCase()
@@ -274,7 +275,7 @@
 	test.Next(_L("Test rename case"));
 	MakeDir(_L("\\F32-TST\\RENAMECASE\\"));
 	TInt r=TheFs.SetSessionPath(_L("\\F32-TST\\RENAMECASE\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	MakeFile(_L("file1.txt"));
 	MakeFile(_L("FILE2.TXT"));
@@ -283,89 +284,89 @@
 
 	TEntry entry;
 	r=TheFs.Rename(_L("FILE1.TXT"),_L("FILE1.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("File1.txt"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("FILE1.TXT"));
 
 	r=TheFs.Rename(_L("file2.txt"),_L("file2.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("File2.txt"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("file2.txt"));
 
 	r=TheFs.Rename(_L("agenda."),_L("agenda.two"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("Agenda.two"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("agenda.two"));
 
 	r=TheFs.Rename(_L("AGENDA.ONE"),_L("AGENDA.ONE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("Agenda.one"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("AGENDA.ONE"));
 
 	r=TheFs.Rename(_L("FILE1.TXT"),_L("file1.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("File1.txt"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("file1.txt"));
 
 	r=TheFs.Rename(_L("file2.txt"),_L("FILE2.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("File2.txt"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("FILE2.TXT"));
 
 	r=TheFs.Rename(_L("agenda.two"),_L("AGENDA"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("Agenda"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("AGENDA"));
 
 	r=TheFs.Rename(_L("AGENDA.ONE"),_L("agenda.one"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("Agenda.one"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("agenda.one"));
 
 	r=TheFs.Rename(_L("FILE1.TXT"),_L("FILe1.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("File1.txt"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("FILe1.txt"));
 
 	r=TheFs.Rename(_L("file2.txt"),_L("FILE3.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("File3.txt"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("FILE3.TXT"));
 
 	r=TheFs.Rename(_L("agenda."),_L("AGENDA1"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("Agenda1"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("AGENDA1"));
 
 	r=TheFs.Rename(_L("AGENDA.ONE"),_L("Agenda.One"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Entry(_L("Agenda.one"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("Agenda.One"));
 
 	r=TheFs.Delete(_L("file1.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("file3.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("Agenda1"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("AGENDA.ONE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\F32-TST\\RENAMECASE\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void testReplace()
@@ -376,33 +377,33 @@
 
 	test.Next(_L("Test Replace"));
 	TInt r=TheFs.MkDirAll(_L("\\F32-TST\\ABCDEF\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Replace(_L("\\TST-E32\\123456"),_L("\\F32-TST\\ABCDEF"));
-	test(r==KErrAccessDenied); // Do not replace directories
+	test_Value(r, r == KErrAccessDenied); // Do not replace directories
 	r=TheFs.Replace(_L("\\F32-TST\\123456"),_L("\\F32-TST\\ABCDEF"));
-	test(r==KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 	r=TheFs.Replace(_L("\\TST-E32\\123456"),_L("\\F32-TST\\FEDCBA"));
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=TheFs.Replace(_L("\\F32-TST\\ABCDEF"),_L("\\F32-TST\\123456"));
-	test(r==KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 
 	test.Next(_L("Replace a file with itself (8.3 filename)"));
 	MakeFile(_L("\\F32-TST\\ABCDEF\\TEST1.SPR"));
 	r=TheFs.Replace(_L("\\F32-TST\\ABCDEF\\TEST1.SPR"),_L("\\F32-TST\\ABCDEF\\TEST1.SPR"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\TEST1.SPR"),KErrNone);
 	r=TheFs.Replace(_L("\\F32-TST\\ABCDEF\\TEST1.SPR"),_L("\\F32-TST\\ABCDEF\\test1.spr"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\TEST1.SPR"),KErrNone,ETrue); // Replace does not rename existing file
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\test1.spr"),KErrNone,EFalse);
 
 	test.Next(_L("Replace a file with itself (vfat filename)"));
 	MakeFile(_L("\\F32-TST\\ABCDEF\\TEST_SHEET(01).SPR"));
 	r=TheFs.Replace(_L("\\F32-TST\\ABCDEF\\TEST_SHEET(01).SPR"),_L("\\F32-TST\\ABCDEF\\TEST_SHEET(01).SPR"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\TEST_SHEET(01).SPR"),KErrNone);
 	r=TheFs.Replace(_L("\\F32-TST\\ABCDEF\\TEST_SHEET(01).SPR"),_L("\\F32-TST\\ABCDEF\\test_sheet(01).spr"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\TEST_SHEET(01).SPR"),KErrNone,ETrue); // Replace does not rename existing file
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\test_sheet(01).spr"),KErrNone,EFalse);
 
@@ -410,14 +411,14 @@
 	MakeFile(_L("\\F32-TST\\ABCDEF\\SHEET1.SPR"),_L8("Original Data"));
 	MakeFile(_L("\\F32-TST\\ABCDEF\\TEMP0001.SPR"),_L8("NewData"));
 	r=TheFs.Replace(_L("\\F32-TST\\ABCDEF\\TEMP0001.SPR"),_L("\\F32-TST\\ABCDEF\\SHEET1.SPR"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileContents(_L("\\F32-TST\\ABCDEF\\SHEET1.SPR"),_L8("NewData"));
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\TEMP0001.SPR"),KErrNotFound);
 
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF\\SHEET1.SPR"),_L("\\F32-TST\\ABCDEF\\TEMP0001.SPR"));
-	test(r==KErrNone);
+	test_KErrNone(r);
     r=TheFs.Replace(_L("\\F32-TST\\ABCDEF\\TEMP0001.SPR"),_L("\\F32-TST\\ABCDEF\\SHEET1.SPR"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileContents(_L("\\F32-TST\\ABCDEF\\SHEET1.SPR"),_L8("NewData"));
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\TEMP0001.SPR"),KErrNotFound);
 
@@ -425,31 +426,31 @@
 	MakeFile(_L("\\F32-TST\\ABCDEF\\SHEET_TEST1.SPR"),_L8("Original Data"));
 	MakeFile(_L("\\F32-TST\\ABCDEF\\NEW_TEMP0001.SPR"),_L8("NewData"));
 	r=TheFs.Replace(_L("\\F32-TST\\ABCDEF\\NEW_TEMP0001.SPR"),_L("\\F32-TST\\ABCDEF\\SHEET_TEST1.SPR"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileContents(_L("\\F32-TST\\ABCDEF\\SHEET_TEST1.SPR"),_L8("NewData"));
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\NEW_TEMP0001.SPR"),KErrNotFound);
 
 	r=TheFs.Rename(_L("\\F32-TST\\ABCDEF\\SHEET_TEST1.SPR"),_L("\\F32-TST\\ABCDEF\\NEW_TEMP0001.SPR"));
-	test(r==KErrNone);
+	test_KErrNone(r);
     r=TheFs.Replace(_L("\\F32-TST\\ABCDEF\\NEW_TEMP0001.SPR"),_L("\\F32-TST\\ABCDEF\\SHEET_TEST1.SPR"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileContents(_L("\\F32-TST\\ABCDEF\\SHEET_TEST1.SPR"),_L8("NewData"));
 	CheckFileExists(_L("\\F32-TST\\ABCDEF\\NEW_TEMP0001.SPR"),KErrNotFound);
 
 	r=TheFs.RmDir(_L("\\F32-TST\\ABCDEF\\"));
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	r=TheFs.RmDir(_L("\\F32-TST\\ABCDEF\\SHEET1.SPR\\"));
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=TheFs.Delete(_L("\\F32-TST\\ABCDEF\\SHEET1.SPR"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("\\F32-TST\\ABCDEF\\SHEET_TEST1.SPR"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("\\F32-TST\\ABCDEF\\TEST1.SPR"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("\\F32-TST\\ABCDEF\\TEST_SHEET(01).SPR"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\F32-TST\\ABCDEF\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Check file date is retained"));
 	MakeFile(_L("OldFile.Old"));
@@ -459,11 +460,11 @@
 	TTime newTime(newDate);
 	
 	r=TheFs.SetEntry(_L("NewFile.new"),newTime,0,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TEntry entry;
 	r=TheFs.Entry(_L("NewFile.new"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TTime checkReturnedTime=entry.iModified;
 	TDateTime dateTime=checkReturnedTime.DateTime();
@@ -473,13 +474,13 @@
 	TDateTime oldDate(1996,(TMonth)2,3,23,0,0,0);
 	TTime oldTime(oldDate);
 	r=TheFs.SetEntry(_L("OldFile.old"),oldTime,0,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.Replace(_L("NewFile.new"),_L("OldFile.old"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TTime check;
 	r=TheFs.Modified(_L("OldFile.old"),check);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TDateTime checkDateTime=check.DateTime();
 	
 	test(checkDateTime.Year()==dateTime.Year());
@@ -492,28 +493,28 @@
 	test.Next(_L("Replace 'Agenda' with 'Agenda.'"));
 	MakeFile(_L("Agenda"));
 	r=TheFs.Replace(_L("Agenda"),_L("Agenda."));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileExists(_L("Agenda"),KErrNone,ETrue);
 	CheckFileExists(_L("Agenda."),KErrNone,ETrue);
 	CheckFileExists(_L("AGENDA"),KErrNone,EFalse);
 	CheckFileExists(_L("AGENDA."),KErrNone,EFalse);
 
 	r=TheFs.Replace(_L("Agenda"),_L("Agenda."));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileExists(_L("Agenda"),KErrNone,ETrue);
 	CheckFileExists(_L("Agenda."),KErrNone,ETrue);
 	CheckFileExists(_L("AGENDA"),KErrNone,EFalse);
 	CheckFileExists(_L("AGENDA."),KErrNone,EFalse);
 
 	r=TheFs.Replace(_L("Agenda."),_L("AGENDA"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileExists(_L("Agenda"),KErrNone,ETrue);  // Replace does not rename existing file
 	CheckFileExists(_L("Agenda."),KErrNone,ETrue);
 	CheckFileExists(_L("AGENDA"),KErrNone,EFalse);
 	CheckFileExists(_L("AGENDA."),KErrNone,EFalse);
 
 	r=TheFs.Replace(_L("AGENDA."),_L("AGENDA.")); // Unchanged, ie still 'Agenda'
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileExists(_L("Agenda"),KErrNone,ETrue);
 	CheckFileExists(_L("Agenda."),KErrNone,ETrue);
 	CheckFileExists(_L("AGENDA"),KErrNone,EFalse);
@@ -529,16 +530,16 @@
 	test.Next(_L("Get directory entry"));
 	TEntry entry;
 	TInt r=TheFs.Entry(_L("\\BLEERRG\\"),entry);
-	test(r==KErrNotFound); // BLEERRG does not exist
+	test_Value(r, r == KErrNotFound); // BLEERRG does not exist
 	r=TheFs.Entry(_L("\\F32-TST"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("F32-TST")||entry.iName==_L("F32-TST."));
 	if (IsTestingLFFS())
 		{
 		r=TheFs.Rename(_L("\\F32-TST.\\"),_L("\\F32-TST\\"));
-		test(r==KErrBadName);
+		test_Value(r, r == KErrBadName);
 		r=TheFs.Entry(_L("\\F32-TST"),entry);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	test(entry.iName==_L("F32-TST"));
 	test(entry.IsDir());
@@ -546,18 +547,18 @@
 	test.Next(_L("Get file entry"));
 	RFile f;
 	r=f.Replace(TheFs,_L("ENTRY.TXT"),EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f.Write(_L8("Entry data"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 	r=TheFs.Entry(_L("\\F32-TST\\TNMBS\\ENTRY.TXT"),entry);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(entry.iName==_L("ENTRY.TXT"));
 	test(!entry.IsDir());
 
 	test.Next(_L("Get the root directory"));
 	r=TheFs.Entry(_L("\\"),entry);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	}
 
 LOCAL_C void testRenameRegression()
@@ -569,14 +570,14 @@
 	test.Next(_L("More rename tests"));
 	MakeFile(_L("\\F32-TST\\asdf"));
 	TInt r=TheFs.Rename(_L("\\F32-TST\\asdf"),_L("*"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.Rename(_L("\\F32-TST\\"),_L("*"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=TheFs.Rename(_L("\\F32-TST\\"),_L("\\F32-TST.\\"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	CheckFileExists(_L("\\F32-TST\\asdf"),KErrNone);
 	r=TheFs.Rename(_L("\\F32-TST\\asdf"),_L("\\F32-TST\\Asdf."));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckFileExists(_L("\\F32-TST\\asdf"),KErrNone,EFalse);
 	CheckFileExists(_L("\\F32-TST\\Asdf"),KErrNone,ETrue);
 
@@ -584,11 +585,11 @@
 	shortName.SetLength(1);
 	shortName[0]=0xff;
 	r=TheFs.Rename(_L("\\F32-TST\\asdf"),shortName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("\\F32-TST\\Asdf"));
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	r=TheFs.Delete(shortName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void testMaxNameLength()
@@ -607,7 +608,7 @@
 	longName.Append(_L("\\"));
 
 	TInt r=TheFs.MkDirAll(longName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TInt i=0;
 	FOREVER
@@ -622,16 +623,16 @@
 	
 	longName.SetLength(longName.Length()-2);
 	r=TheFs.RmDir(longName);
-	test(r==KErrNone); // Make room for file
+	test_KErrNone(r); // Make room for file
 	longName.SetLength(longName.Length()-2);
 
 	TFullName oldSessionPath;
 	r=TheFs.SessionPath(oldSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetSessionPath(longName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SessionPath(longName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Printf(_L("MaxPathLength achieved = %d chars\n"),longName.Length());
 	TBuf<32> fileName=_L("012345678901234567890");
@@ -647,18 +648,18 @@
 	f.Close();
 	test.Printf(_L("Added filename %S\n"),&fileName);
 	r=f.Open(TheFs,fileName,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	f.Close();
 
 	CFileMan* fMan=CFileMan::NewL(TheFs);
 	r=fMan->RmDir(_L("\\F32-TST\\MAXNAMELEN\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	delete fMan;
 
 	r=f.Open(TheFs,fileName,EFileRead);
-	test(r==KErrPathNotFound);
+	test_Value(r, r == KErrPathNotFound);
 	r=TheFs.SetSessionPath(oldSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void testErrorReturnValues()
@@ -673,43 +674,43 @@
     if (!IsTestingLFFS())
         { //FIXME: Bad error codes from LFFS
 	    r=TheFs.MkDir(_L("\\BLUE\\"));
-        test(r==KErrAccessDenied);
+        test_Value(r, r == KErrAccessDenied);
         MakeFile(_L("\\RED\\BLUE"));
         r=TheFs.MkDir(_L("\\RED\\BLUE\\"));
-        test(r==KErrAccessDenied);
+        test_Value(r, r == KErrAccessDenied);
         r=TheFs.MkDirAll(_L("\\BLUE\\GREEN\\ORANGE\\"));
-        test(r==KErrAccessDenied);
+        test_Value(r, r == KErrAccessDenied);
         }
 
 	test.Next(_L("Create folder with the name of an existing folder"));
 	MakeDir(_L("\\VOLVO\\"));
 	r=TheFs.MkDir(_L("\\VOLVO\\"));
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 	MakeDir(_L("\\FORD\\VOLKSWAGEN\\"));
 	r=TheFs.MkDirAll(_L("\\ford\\volkswagen\\"));
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 
 	RFile f;
     if (!IsTestingLFFS())
         { //FIXME Bad error codes from LFFS
 	    test.Next(_L("Create a file with the name of an existing folder"));
 	    r=f.Create(TheFs,_L("\\VOLVO"),EFileRead|EFileWrite);
-	    test(r==KErrAccessDenied);
+	    test_Value(r, r == KErrAccessDenied);
 	    r=f.Replace(TheFs,_L("\\VOLVO"),EFileRead|EFileWrite);
-	    test(r==KErrAccessDenied);
+	    test_Value(r, r == KErrAccessDenied);
 	    r=f.Open(TheFs,_L("\\VOLVO"),EFileRead|EFileWrite);
-	    test(r==KErrAccessDenied);
+	    test_Value(r, r == KErrAccessDenied);
 	    r=f.Create(TheFs,_L("\\FORD\\VOLKSWAGEN"),EFileRead|EFileWrite);
-	    test(r==KErrAccessDenied);
+	    test_Value(r, r == KErrAccessDenied);
 	    r=f.Replace(TheFs,_L("\\FORD\\VOLKSWAGEN"),EFileRead|EFileWrite);
-	    test(r==KErrAccessDenied);
+	    test_Value(r, r == KErrAccessDenied);
 	    r=f.Open(TheFs,_L("\\FORD\\VOLKSWAGEN"),EFileRead|EFileWrite);
-	    test(r==KErrAccessDenied);
+	    test_Value(r, r == KErrAccessDenied);
         }
 
 	test.Next(_L("Create a file with the name of an existing file"));
 	r=f.Create(TheFs,_L("\\BLUE"),EFileRead|EFileWrite);
-	test(r==KErrAlreadyExists);
+	test_Value(r, r == KErrAlreadyExists);
 	}
 
 LOCAL_C void testSetEntry()
@@ -726,124 +727,124 @@
 	
 	RFile f;
 	TInt r=f.Open(TheFs,_L("dumentry"),EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttReadOnly,KEntryAttArchive);
-	test(r==KErrInUse);
+	test_Value(r, r == KErrInUse);
 	f.Close();
 	
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttReadOnly,KEntryAttArchive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),KEntryAttReadOnly,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,0,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttDir,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttVolume,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttRemote,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttDir|KEntryAttVolume,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttDir|KEntryAttRemote,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttVolume|KEntryAttRemote,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttDir|KEntryAttVolume|KEntryAttRemote,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,0,KEntryAttDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,0,KEntryAttVolume);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,0,KEntryAttRemote);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,0,KEntryAttDir|KEntryAttVolume);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,0,KEntryAttDir|KEntryAttRemote);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,0,KEntryAttVolume|KEntryAttRemote);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,0,KEntryAttDir|KEntryAttVolume|KEntryAttRemote);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttDir,KEntryAttVolume);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttDir,KEntryAttRemote);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));	
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttVolume,KEntryAttDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttVolume,KEntryAttRemote);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttRemote,KEntryAttDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=TheFs.SetEntry(_L("dumentry."),time,KEntryAttRemote,KEntryAttVolume);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 
 	r=f.Open(TheFs,_L("dumentry"),EFileWrite);
-	test(r==KErrNone);	
+	test_KErrNone(r);	
 
 	r=f.SetAtt(KEntryAttDir,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	r=f.SetAtt(KEntryAttVolume,KEntryAttDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("DUMEntry"),0,TTime(dateTime));
 	f.Close();
 	r=TheFs.Delete(_L("dumEntry."));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	MakeDir(_L("\\DumEntry\\"));
 	r=TheFs.SetEntry(_L("\\dumentry\\"),time,KEntryAttReadOnly,KEntryAttArchive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("\\DUMEntry"),KEntryAttReadOnly|KEntryAttDir,TTime(dateTime));
 	r=TheFs.SetEntry(_L("\\dumentry."),time,0,KEntryAttReadOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("\\DUMEntry"),KEntryAttDir,TTime(dateTime));
 	r=TheFs.SetEntry(_L("\\dumentry"),time,KEntryAttDir,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("\\DUMEntry"),KEntryAttDir,TTime(dateTime));
 	r=TheFs.SetEntry(_L("\\dumentry"),time,KEntryAttVolume,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("\\DUMEntry"),KEntryAttDir,TTime(dateTime));
 	r=TheFs.SetEntry(_L("\\dumentry"),time,KEntryAttVolume|KEntryAttDir,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("\\DUMEntry"),KEntryAttDir,TTime(dateTime));
 	r=TheFs.SetEntry(_L("\\dumentry"),time,0,KEntryAttVolume|KEntryAttDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("\\DUMEntry"),KEntryAttDir,TTime(dateTime));
 	r=TheFs.SetEntry(_L("\\dumentry"),time,0,KEntryAttVolume);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("\\DUMEntry"),KEntryAttDir,TTime(dateTime));
 	r=TheFs.SetEntry(_L("\\dumentry"),time,0,KEntryAttDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("\\DUMEntry"),KEntryAttDir,TTime(dateTime));
 	r=TheFs.SetEntry(_L("\\dumentry"),time,KEntryAttVolume,KEntryAttDir);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("\\DUMEntry"),KEntryAttDir,TTime(dateTime));
 	r=TheFs.SetEntry(_L("\\dumentry"),time,KEntryAttDir,KEntryAttVolume);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckEntry(_L("\\DUMEntry"),KEntryAttDir,TTime(dateTime));
 	r=TheFs.RmDir(_L("\\dumEntry\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 	
@@ -859,81 +860,81 @@
 //	Create a file "TEMPFILE.TMP" and set attributes to hidden	
 	RFile file;
 	TInt r=file.Replace(TheFs,_L("TEMPFILE.TMP"),0);
-	test(r==KErrNone || r==KErrPathNotFound);	
+	test_Value(r, r == KErrNone || r==KErrPathNotFound);	
 	r=file.SetAtt(KEntryAttHidden,0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 //	Check attributes are as set
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	TUint atts;
 	r=file.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	test(atts&KEntryAttHidden);
 
 //	Change attributes from hidden to system	
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.SetAtt(KEntryAttSystem,KEntryAttHidden);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 //	Check attributes have been changed
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	test(atts&KEntryAttSystem);
 
 //	Change attributes to normal
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.SetAtt(KEntryAttNormal,KEntryAttSystem|KEntryAttArchive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 //	Check attributes have been changed
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	test(atts==KEntryAttNormal);
 
 //	Attempt to change attributes from normal file to directory	
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.SetAtt(KEntryAttDir,KEntryAttNormal);
-	test(r==KErrNone);	//	Returns KErrNone but DOESN'T change the file to a directory
+	test_KErrNone(r);	//	Returns KErrNone but DOESN'T change the file to a directory
 	file.Close();
 
 //	Check the file has not been changed to a directory
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	test((TInt)(atts&KEntryAttDir)==KErrNone);
 
 //	Change the attributes from normal file to hidden file
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.SetAtt(KEntryAttHidden,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 //	Check the attributes have been changed
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	test(atts&KEntryAttHidden);
 
 //	Try to change the attributes from hidden file to volume	
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.SetAtt(KEntryAttVolume,KEntryAttHidden);
-	test(r==KErrNone);	//	Returns KErrNone but DOESN'T change the file to a volume
+	test_KErrNone(r);	//	Returns KErrNone but DOESN'T change the file to a volume
 	file.Close();
 
 //	Check that the hidden file has not been changed to a volume
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	test((TInt)(atts&KEntryAttVolume)==KErrNone);
 
@@ -944,7 +945,7 @@
 //	Check attributes 
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	test(atts==KEntryAttNormal);
 
@@ -954,15 +955,15 @@
 	TTime retTime;
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Set(modTime1,KEntryAttSystem,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 //	Check attributes have been changed
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Modified(retTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	test(atts&KEntryAttSystem);
 	test(retTime==modTime1);
@@ -972,15 +973,15 @@
 	TTime modTime2(dateTime);
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Set(modTime2,KEntryAttNormal,KEntryAttSystem|KEntryAttArchive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 //	Check attributes have been changed
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Modified(retTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	test(atts==KEntryAttNormal);
 	test(retTime==modTime2);
@@ -988,15 +989,15 @@
 //	Attempt to change attributes from normal file to directory	
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Set(modTime1,KEntryAttDir,KEntryAttNormal);
-	test(r==KErrNone);	//	Returns KErrNone but DOESN'T change the file to a directory
+	test_KErrNone(r);	//	Returns KErrNone but DOESN'T change the file to a directory
 	file.Close();
 
 //	Check the file has not been changed to a directory
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Modified(retTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	test((TInt)(atts&KEntryAttDir)==KErrNone);
 	test(retTime==modTime1);//	Modification time should have been set successfully
@@ -1004,13 +1005,13 @@
 //	Change the attributes from normal file to hidden file - and change modification time
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Set(modTime1,KEntryAttHidden,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 //	Check the attributes have been changed
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Modified(retTime);
 	file.Close();
 	test(atts&KEntryAttHidden);
@@ -1019,15 +1020,15 @@
 //	Try to change the attributes from hidden file to volume	
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Set(modTime2,KEntryAttVolume,KEntryAttHidden);
-	test(r==KErrNone);	//	Returns KErrNone but DOESN'T change the file to a volume
+	test_KErrNone(r);	//	Returns KErrNone but DOESN'T change the file to a volume
 	file.Close();
 
 //	Check that the hidden file has not been changed to a volume
 	file.Open(TheFs,_L("TEMPFILE.TMP"),EFileWrite);
 	r=file.Att(atts);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Modified(retTime);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	test((TInt)(atts&KEntryAttVolume)==KErrNone);
 	test(retTime==modTime2);	//	Modification time should have been set successfully
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_notifier.cpp
--- a/kerneltest/f32test/server/t_notifier.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_notifier.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32svr.h>
@@ -164,7 +165,7 @@
 	{
 	RFs fs;
 	TInt r = fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	CFsNotify* notify = NULL;
 	TRAP(r,notify= CFsNotify::NewL(fs,KMinNotificationBufferSize));
@@ -177,11 +178,11 @@
 	filename.Append(_L("media.change1"));
 	
 	r = notify->AddNotification((TUint)TFsNotification::ECreate,path,filename);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TRequestStatus status;
 	r = notify->RequestNotifications(status);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	test.Printf(_L("*****************************************************************\n"));
 	test.Printf(_L("Waiting 10 seconds.\n"));
@@ -191,7 +192,7 @@
 	test.Printf(_L("*****************************************************************\n"));
 	RTimer timer1;
 	r = timer1.CreateLocal();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	TRequestStatus timeout;
 	TTimeIntervalMicroSeconds32 time = 10000000;
 	timer1.After(timeout,time);
@@ -209,9 +210,9 @@
 	drive.Append(_L(":"));
 	TPtrC drivePtr;
 	r = notification->Path(drivePtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = drivePtr.Compare(drive);
-	test(r==0);
+	test_Value(r, r == 0);
 	
 	test.Printf(_L("*****************************************************************\n"));
 	test.Printf(_L("Waiting 10 seconds.\n"));
@@ -226,7 +227,7 @@
 		notify->RequestNotifications(status);
 		RTimer timer2;
 		r = timer2.CreateLocal();
-		test(r == KErrNone);
+		test_KErrNone(r);
 		TRequestStatus timeout2;
 		timer2.After(timeout2,time);
 		User::WaitForRequest(timeout2,status);
@@ -249,7 +250,7 @@
 	{
 	RFs fs;
 	TInt r = fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	CFsNotify* notify1 = NULL;
 	CFsNotify* notify2 = NULL;
@@ -260,7 +261,7 @@
 		{
 		delete notify1;
 		delete notify2;
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 	
 	TBuf<40> path;
@@ -275,15 +276,15 @@
 	fullname.Append(filename);
 	
 	r = notify1->AddNotification((TUint)TFsNotification::ECreate,path,filename);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = notify2->AddNotification((TUint)TFsNotification::ECreate,path,filename);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	delete notify1; //Delete notify1 and ensure we still get notification on notify2
 	
 	TRequestStatus status;
 	r = notify2->RequestNotifications(status);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	RFile file;
 	file.Replace(fs,fullname,EFileWrite); //Replace produces Create notification
@@ -291,7 +292,7 @@
 	
 	RTimer tim;
 	r = tim.CreateLocal();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TRequestStatus timStatus;
 	TTimeIntervalMicroSeconds32 time = 10000000; //10 seconds
@@ -301,7 +302,7 @@
 	test(status!=KRequestPending);
 	
 	r = fs.Delete(fullname);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	delete notify2;
 	tim.Close();
@@ -324,7 +325,7 @@
 	CFsNotify* notify = NULL;
 	
 	TRAPD(r,notify = CFsNotify::NewL(fs,KMinNotificationBufferSize););
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(notify!=NULL);
 	
 	TBuf<40> path;
@@ -335,18 +336,18 @@
 	filename.Append(_L("*"));
 	
 	r = notify->AddNotification((TUint)TFsNotification::ECreate,path,filename);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TRequestStatus status;
 	r = notify->RequestNotifications(status);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	RFile file;
 	TBuf<40> filePath;
 	filePath.Append((TChar)gDriveToTest);
 	filePath.Append(_L(":\\file.root"));
 	r = file.Replace(fs,filePath,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 	TRequestStatus s2;
@@ -1326,7 +1327,7 @@
 		    
 		    CFileMan* cfman = NULL;
 		    TRAP(r, cfman = CFileMan::NewL(fs);)
-		    test(r == KErrNone);
+		    test_KErrNone(r);
             test(cfman != NULL);
             TBuf<40> unmonitored_path;
             unmonitored_path.Append(gDriveToTest);
@@ -1396,13 +1397,13 @@
 	TUidType uid;
 	TPtrC command((TText*)&gDriveToTest,1);
 	TInt r = process.Create(aProcessName,command,uid);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	process.Resume();
 	TRequestStatus s1;
 	TRequestStatus s2;
 	RTimer tim;
 	r = tim.CreateLocal();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TTimeIntervalMicroSeconds32 delay = 5000000; //5 seconds
 	tim.After(s1,delay);
 	process.Logon(s2);
@@ -1958,9 +1959,9 @@
 	RThread doer;
 	
 	TInt r = watcher.Create(_L("TestTwoNotificationsWatcherThread"),MultipleNotificationsTFWatcher,KDefaultStackSize,KMinHeapSize,KMaxHeapSize,&package);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = doer.Create(_L("TestTwoNotificationsDoerThread"),TwoNotificationsTFDoer,KDefaultStackSize,KMinHeapSize,KMaxHeapSize,&package);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Next(_L("TestTwoNotifications - Resume Watcher"));
 	watcher.Resume();
 	test.Next(_L("TestTwoNotifications - Wait for Watcher to be ready"));
@@ -2622,9 +2623,9 @@
 	RThread doer;
 
 	TInt r = watcher.Create(_L("TestCancelNotification-WatcherThread"),TestCancelNotificationWatcher,KDefaultStackSize*2,KMinHeapSize,KMaxHeapSize,&package);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = doer.Create(_L("TestCancelNotification-DoerThread"),SimpleSingleNotificationTFDoer,KDefaultStackSize*2,KMinHeapSize,KMaxHeapSize,&package);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("TestCancelNotificationL - Watcher.Resume()"));
 	watcher.Resume();
 	test.Printf(_L("TestCancelNotificationL - Waiting on package.iBarrier.Wait()"));
@@ -2645,7 +2646,7 @@
 	
 	RTimer tim;
 	r = tim.CreateLocal();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TRequestStatus timStatus;
 	TTimeIntervalMicroSeconds32 time = 10000000; //10 seconds
@@ -2729,7 +2730,7 @@
 			
 			RDebug::Printf("TestSessionCloseTF - Case 2 - Add Notification\n");
 			r = notify->AddNotification((TUint)TFsNotification::ECreate,path,filename);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			
 			RDebug::Printf("TestSessionCloseTF - Case 2 - Fs.Close\n");
 			fs.Close();
@@ -2779,7 +2780,7 @@
 	User::WaitForRequest(status);
 	test.Printf(_L("Kern-Exec 0 is EXPECTED\n"));
 	TInt err = thread.ExitReason();
-	test(err == KErrNone);
+	test_KErrNone(err);
 	TExitType et = thread.ExitType();
 	test(et == EExitPanic);
 	CLOSE_AND_WAIT(thread);
@@ -2859,7 +2860,7 @@
 	//Except the first one will still be in the buffer
 	// (as we've not called RequestNotification yet) so we'll only actually get 5.
 	TRAPD(r, notify = CFsNotify::NewL(fs,(80*7)-4));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	User::LeaveIfNull(notify);
 	notify->AddNotification(TFsNotification::EFileChange,path,filename);
 	notify->RequestNotifications(status);
@@ -2941,7 +2942,7 @@
 	test.Next(_L("TestOverflow"));
 	RFs fs;
 	TInt r = fs.Connect();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	_LIT(KFileName,"over.flow");
 	SThreadPackage doerPkg;
 	doerPkg.iFileName = KFileName;
@@ -2983,7 +2984,7 @@
 	
 	RTimer tim;
 	r = tim.CreateLocal();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TRequestStatus timStatus;
 	
 	test.Next(_L("TestOverflow - Wait for watcher1 thread death"));
@@ -3060,7 +3061,7 @@
     {
     TRequestStatus status;
     TInt r = aNotify->RequestNotifications(status);
-    test(r == KErrNone);
+    test_KErrNone(r);
     //Signal that overflow has been found (W4)
     aPackage.iBarrier.Signal();
     
@@ -3086,7 +3087,7 @@
         if(notification == NULL)
             {
             r = aNotify->RequestNotifications(status);
-            test(r == KErrNone);
+            test_KErrNone(r);
             User::WaitForRequest(status);
             notification = aNotify->NextNotification();
             }
@@ -3127,7 +3128,7 @@
     //Except the first one will still be in the buffer
     // (as we've not called RequestNotification yet) so we'll only actually get 5.
     TRAPD(r, notify = CFsNotify::NewL(fs,(80*7)-4));
-    test(r == KErrNone);
+    test_KErrNone(r);
     User::LeaveIfNull(notify);
     notify->AddNotification(TFsNotification::EFileChange,path,filename);
     notify->RequestNotifications(status);
@@ -3196,7 +3197,7 @@
     test.Next(_L("TestPostOverflowNotifications"));
     RFs fs;
     TInt r = fs.Connect();
-    test(r == KErrNone);
+    test_KErrNone(r);
     _LIT(KFileName,"post.over");
     SThreadPackage doerPkg;
     doerPkg.iFileName = KFileName;
@@ -3251,21 +3252,21 @@
     path.Append(watcher1Pkg.iFileName);
     RFile file;
     r = file.Open(fs,path,EFileWrite);
-    test(r==KErrNone);
+    test_KErrNone(r);
     
     r = file.SetSize(1);
-    test(r==KErrNone);
+    test_KErrNone(r);
     r = file.SetSize(2);
-    test(r==KErrNone);
+    test_KErrNone(r);
     r = file.SetSize(3);
-    test(r==KErrNone);
+    test_KErrNone(r);
     file.Close();
     
     watcher1Pkg.iBarrier.Signal(); // Signal post operations complete (Sx)
     
     RTimer tim;
     r = tim.CreateLocal();
-    test(r==KErrNone);
+    test_KErrNone(r);
     TRequestStatus timStatus;
     
     test.Next(_L("TestOverflow - Wait for watcher1 thread death"));
@@ -3307,11 +3308,11 @@
 	test.Next(_L("TestNonDriveFilters"));
 	RFs fs;
 	TInt r = fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TDriveList drives;
 	r = fs.DriveList(drives);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	CFsNotify* notify = NULL;
 	TRAP(r,notify= CFsNotify::NewL(fs,KMinNotificationBufferSize));
@@ -3320,11 +3321,11 @@
 	testfile.Append(_L("test.file"));
 	
 	r = notify->AddNotification((TUint)TFsNotification::ECreate,_L(""),testfile);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TRequestStatus status;
 	r = notify->RequestNotifications(status);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TBuf<40> path;
 	path.Append((TChar)gDriveToTest);
@@ -3336,9 +3337,9 @@
 	
 	RFile file;
 	r = fs.MkDirAll(path);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	r = file.Replace(fs,fullname,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 	fs.Delete(fullname);
@@ -3362,14 +3363,14 @@
 		}
 	
 	r = fs.MkDirAll(fullname);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	r = file.Replace(fs,fullname,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 	RTimer timer1;
 	r = timer1.CreateLocal();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	TRequestStatus timeout;
 	TTimeIntervalMicroSeconds32 time = 10000000;    //10 seconds
 	timer1.After(timeout,time);
@@ -3382,7 +3383,7 @@
 	test(notification != NULL);
 	TPtrC _path;
 	r = notification->Path(_path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TChar driveletter = _path[0];
 	driveletter.UpperCase();
 	test(driveletter ==  (TChar)gDriveToTest);
@@ -3391,11 +3392,11 @@
 		{
 		TRequestStatus status2;
 		r = notify->RequestNotifications(status2);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		
 		RTimer timer2;
 		r = timer2.CreateLocal();
-		test(r == KErrNone);
+		test_KErrNone(r);
 		TRequestStatus timeout2;
 		TTimeIntervalMicroSeconds32 time2 = 10000000;    //10 seconds
 		timer2.After(timeout2,time2);
@@ -3408,7 +3409,7 @@
 		}
 	test(notification != NULL);
 	r = notification->Path(_path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	driveletter = _path[0];
 	driveletter.UpperCase();
 	test(driveletter == (TChar)'C');	
@@ -3423,7 +3424,7 @@
 	{
 	RFs fs;
 	TInt r = fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	CFsNotify* notify = NULL;
 	TRAP(r,notify= CFsNotify::NewL(fs,KMinNotificationBufferSize));
@@ -3432,14 +3433,14 @@
 	path.Append((TChar)gDriveToTest);
 	path.Append(_L(":\\F32-TST\\T_NOTIFIER\\"));
 	r = fs.MkDirAll(path);
-	test(r == KErrNone || r == KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	
 	r = notify->AddNotification((TUint)TFsNotification::ECreate,path,_L(""));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TRequestStatus status;
 	r = notify->RequestNotifications(status);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TBuf<40> filename;
 	filename.Append((TChar)gDriveToTest);
@@ -3447,12 +3448,12 @@
 	
 	RFile file;
 	r = file.Replace(fs,filename,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 	RTimer timer1;
 	r = timer1.CreateLocal();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	TRequestStatus timeout;
 	TTimeIntervalMicroSeconds32 time = 2000000;    //2 seconds
 	timer1.After(timeout,time);
@@ -3479,7 +3480,7 @@
 	RFs fs;
 	CFsNotify* notify = NULL;
 	TInt r = fs.Connect();
-	test(r == KErrNone);
+	test_KErrNone(r);
 	TRAP(r,notify = CFsNotify::NewL(fs,0));
 	test(notify != NULL);
 	delete notify;
@@ -3494,7 +3495,7 @@
 
 	test.Printf(_L("NegativeTests() C\n"));
 	TRAP(r,notify = CFsNotify::NewL(fs,KMaxTInt));
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 	test(notify==NULL);
 	
 	//3
@@ -3505,34 +3506,34 @@
 	TBuf<20> filename;
 	filename.Append(_L("file.txt"));
 	TRAP(r,notify = CFsNotify::NewL(fs,KMinNotificationBufferSize));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(notify!=NULL);
 	r = notify->AddNotification(0,path,filename);
-	test(r == KErrArgument);
+	test_Value(r, r == KErrArgument);
 	
 	test.Printf(_L("NegativeTests() E\n"));
 	r = notify->AddNotification((TUint)0x8000,path,filename); //invalid value
-	test(r == KErrArgument);
+	test_Value(r, r == KErrArgument);
 	
 	test.Printf(_L("NegativeTests() F\n"));
 	TBuf<40> invalidPath;
 	invalidPath.Append(_L("1:\\*"));
 	r = notify->AddNotification((TUint)TFsNotification::ECreate,invalidPath,filename);
-	test(r == KErrNotFound || r == KErrPathNotFound);
+	test_Value(r, r == KErrNotFound || r == KErrPathNotFound);
 	
 	//4
 	test.Printf(_L("NegativeTests() G\n"));
 	TRequestStatus wrongStatus;
 	wrongStatus = KRequestPending;
 	r = notify->RequestNotifications(wrongStatus);
-	test(r == KErrInUse);
+	test_Value(r, r == KErrInUse);
 	
 	test.Printf(_L("NegativeTests() H\n"));
 	TRequestStatus status;
 	r = notify->RequestNotifications(status);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = notify->CancelNotifications(wrongStatus);
-	test(r == KErrInUse);
+	test_Value(r, r == KErrInUse);
 	
 	delete notify;
 	notify = NULL;
@@ -3593,7 +3594,7 @@
 TInt TestNotificationsWithFServPlugins()
 	{
 	TInt r = TheFs.AddPlugin(KNotifyPluginFileName);
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	r = TheFs.MountPlugin(KNotifyPluginName,(TUint)gDriveToTest.GetUpperCase() - 65);
 	if (r == KErrNotSupported)
 		{
@@ -3653,12 +3654,12 @@
 	__UHEAP_MARK;
 	r = TestNewDeleteCFsNotify(1);
 	__UHEAP_MARKEND;
-	test(r==KErrNone);	
+	test_KErrNone(r);	
 	//Creates and Deletes 50 CFsNotifys
 	__UHEAP_MARK;
 	r = TestNewDeleteCFsNotify(50);
 	__UHEAP_MARKEND;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of User Heap Tests ---------------------------------------\n"));
 	//
 	// 2.	Add notification for creating a file
@@ -3668,7 +3669,7 @@
 	__UHEAP_MARK;
 	r = SimpleCreateTestL();
 	__UHEAP_MARKEND;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of CFsNotify Creation and Delete Tests -------------------\n"));
 	//
 	// 3.	Add notification at the root of a drive
@@ -3694,7 +3695,7 @@
 	__UHEAP_MARK;
 	r = TestTwoDoersL();
 	__UHEAP_MARKEND;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of TwoDoers Test -----------------------------------------\n"));
 	//
 	// 6.	Create 2 file server sessions
@@ -3705,7 +3706,7 @@
 	__UHEAP_MARK;
 	r = TestTwoWatchersL();
 	__UHEAP_MARKEND;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of TwoWatchers Test --------------------------------------\n"));
 	//
 	// 7.	Create 2 file server sessions and 2 clients
@@ -3716,7 +3717,7 @@
 	__UHEAP_MARK;
 	r = TestTwoWatchersTwoDoersL();
 	__UHEAP_MARKEND;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of TwoWatchersTwoDoers Test ------------------------------\n"));
 	//
 	// 8.	Add notification for a specific file creation
@@ -3727,7 +3728,7 @@
 	__UHEAP_MARK;
 	r =  TestCancelNotificationL();
 	__UHEAP_MARKEND;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of CancelNotification Test -------------------------------\n"));
 	//
 	// 9.	Create 2 file server sessions
@@ -3740,7 +3741,7 @@
 	__UHEAP_MARK;
 	r = TestClientRemovalL();
 	__UHEAP_MARKEND;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of TestClientRemoval Test --------------------------------\n"));
 	//
 	// 10.	Create a CFsNotify object
@@ -3777,7 +3778,7 @@
 	test.Next(_L("EFileCreate Tests"));
 	_LIT(KFilename3,"file.create");
 	r = TestMultipleNotificationsL(_L(""),KFilename3,5,5,t_notification::EFileCreate,TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of EFileCreate Tests -------------------------------------\n"));
 	//
 	// RFs::MkDir
@@ -3788,7 +3789,7 @@
 	test.Next(_L("EFsMkDir Test"));
 	_LIT(KDirName1,"dirCreate\\");
 	r = TestMultipleNotificationsL(KDirName1,_L(""),1,1,t_notification::EFsMkDir,TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of EFsMkDir Test -----------------------------------------\n"));
 	//
 	// RFile::Replace
@@ -3798,7 +3799,7 @@
 	PrintLine();
 	test.Next(_L("EFileReplace Test"));
 	r = TestMultipleNotificationsL(_L(""),KFilename3,1,1,t_notification::EFileReplace,TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of EFileReplace Test -------------------------------------\n"));
 	//
 	// 4.  Add notification for a specific file creation
@@ -3809,7 +3810,7 @@
 	__UHEAP_MARK;
 	r =  TestAddRemoveNotificationL();
 	__UHEAP_MARKEND;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of Add and Remove Notification Test ----------------------\n"));
 	//
 	// Wildcard Create Tests
@@ -3823,29 +3824,29 @@
 	// Wildcard Name
 	_LIT(KWildcardName1,"*");
 	r = TestMultipleNotificationsL(_L(""),KWildcardName1,1,1,t_notification::EFileCreate,TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = TestMultipleNotificationsL(KWildcardName1,KWildcardName1,1,1,t_notification::EFileCreate_subs,TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = TestMultipleNotificationsL(KWildcardName1,KWildcardName1,1,1,t_notification::EFileCreate_subs_nowatch,TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)ETrue,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// Wildcard including Subdirectories
 	_LIT(KWildcardName2,"*\\");
 	r = TestMultipleNotificationsL(KWildcardName2,KWildcardName1,1,1,t_notification::EFileCreate,TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)ETrue,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = TestMultipleNotificationsL(KWildcardName2,KWildcardName1,1,1,t_notification::EFileCreate_subs_nowatch,TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	_LIT(KDirName2,"SubDir\\");
 	_LIT(KWildcardName3,"?");
 	r = TestMultipleNotificationsL(KDirName2,KWildcardName3,1,1,t_notification::EFileCreate_subs_nowatch,TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// Wildcard Type
 	_LIT(KWildcardName4,"*.*");
 	r = TestMultipleNotificationsL(_L(""),KWildcardName4,1,1,t_notification::EFileCreate_txt_nowatch,TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = TestMultipleNotificationsL(_L(""),KWildcardName4,1,1,t_notification::EFileCreate_subs_nowatch,TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)ETrue,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// 6.  Add notification for file creation for a specific type
 	//     Create file with that type
@@ -3853,7 +3854,7 @@
 	//
 	_LIT(KWildcardName5,"*.txt");
 	r = TestMultipleNotificationsL(_L(""),KWildcardName5,1,1,t_notification::EFileCreate_txt,TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of Wildcard Create Tests ---------------------------------\n"));
 	
 	
@@ -3875,11 +3876,11 @@
 	test.Next(_L("Attribute Tests"));
 	_LIT(KFilename4,"file.setatts");
 	r = TestMultipleNotificationsL(_L(""),KFilename4,1,1,t_notification::EFileSetAtt,TFsNotification::EAttribute,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = TestMultipleNotificationsL(_L(""),KFilename4,1,1,t_notification::EFileSet,TFsNotification::EAttribute,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = TestMultipleNotificationsL(_L(""),KFilename4,1,1,t_notification::EFsSetEntry,TFsNotification::EAttribute,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// Wildcard Attribute Test including subdirectories
 	// 2.  Add notification for file attribute change using wildcard name
@@ -3887,7 +3888,7 @@
 	//     Change attributes of some files
 	//
 	r = TestMultipleNotificationsL(KWildcardName2,_L("*"),3,3,t_notification::EFileSetAtt_subs,TFsNotification::EAttribute,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of Attribute Tests ---------------------------------------\n"));
 	
 	
@@ -3909,25 +3910,25 @@
 	test.Next(_L("Rename Tests"));
 	_LIT(KFilename5,"file.rename");
 	r = TestMultipleNotificationsL(_L(""),KFilename5,1,1,t_notification::EFsReplace,TFsNotification::ERename,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = TestMultipleNotificationsL(_L(""),KFilename5,1,1,t_notification::EFsRename,TFsNotification::ERename,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = TestMultipleNotificationsL(_L(""),KFilename5,1,1,t_notification::EFileRename,TFsNotification::ERename,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// 2.  Add notification for a specific directory rename
 	//     Rename that directory
 	//
 	_LIT(KDirName3,"dirRename\\");
 	r = TestMultipleNotificationsL(KDirName3,_L(""),1,1,t_notification::EFsRename_dir,TFsNotification::ERename,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// 3.  Add notification for file rename using wildcard name
 	//     Create file that match the notification
 	//     Repeatedly rename the file
 	//
 	r = TestMultipleNotificationsL(_L(""),KWildcardName1,3,3,t_notification::EFileRename_wild,TFsNotification::ERename,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of Rename Tests ------------------------------------------\n"));
 	
 	
@@ -3949,7 +3950,7 @@
 	test.Next(_L("EFsDelete Test"));
 	_LIT(KFilename6,"file.delete");
 	r = TestMultipleNotificationsL(_L(""),KFilename6,1,1,t_notification::EFsDelete,TFsNotification::EDelete,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);	
+	test_KErrNone(r);	
 	//
 	// RFs::RmDir
 	// 2.  Add notification for a specific directory delete
@@ -3959,7 +3960,7 @@
 	test.Next(_L("EFsRmDir Tests"));
 	_LIT(KDirName4,"dirRemove\\");
 	r = TestMultipleNotificationsL(KDirName4,_L(""),1,1,t_notification::EFsRmDir,TFsNotification::EDelete,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
     //
     // This test should not receive any notifications because a non-empty directory cannot be removed
     // 3.  Add notification for specific directory delete
@@ -3968,7 +3969,7 @@
     //
     _LIT(KDirName5,"dirRmNonEmp\\");
     r = TestMultipleNotificationsL(KDirName5,_L(""),1,1,t_notification::EFsRmDir_nonEmpty,TFsNotification::EDelete,KMinNotificationBufferSize,(TBool)ETrue,__LINE__);
-    test(r==KErrNone);	
+    test_KErrNone(r);	
     //
     // Wildcard Name ("*")
     // 4.  Add notification for directory delete using wildcard name
@@ -3976,7 +3977,7 @@
 	//	   Delete that directory
     //
     r = TestMultipleNotificationsL(KWildcardName1,_L(""),1,1,t_notification::EFsRmDir_wild,TFsNotification::EDelete,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-    test(r==KErrNone);	
+    test_KErrNone(r);	
     //
     // Wildcard Type ("*.txt")
     // Creates files with different types and should only receive notifications from "*.txt" file deletions
@@ -3985,7 +3986,7 @@
     //     Delete those files
     //
     r = TestMultipleNotificationsL(_L(""),KWildcardName4,3,3,t_notification::EFsDelete,TFsNotification::EDelete,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-    test(r==KErrNone);
+    test_KErrNone(r);
     test.Printf(_L("------- End of Delete Tests ------------------------------------------\n"));
 	
 	
@@ -4013,7 +4014,7 @@
 	__UHEAP_MARK;
 	r = TestMultipleNotificationsL(_L(""),KFilename7,7,7,t_notification::EFileWrite,TFsNotification::EFileChange,3*KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
 	__UHEAP_MARKEND;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// 2.  Add notification for a specific file change
 	//     Write to the specified file a number of times without changing its size
@@ -4022,7 +4023,7 @@
 	//     aMaxNotifications = 1 + aIterations
 	//
 	r = TestMultipleNotificationsL(_L(""),KFilename7,3,4,t_notification::EFileWrite_samesize,TFsNotification::EFileChange,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of EFileWrite Tests --------------------------------------\n"));
 	//
 	// 3.  Add notification for a specific file change
@@ -4034,7 +4035,7 @@
 	__UHEAP_MARK;
 	r = TestMultipleNotificationsL(_L(""),KFilename8,4,4,t_notification::EFileWrite_async,TFsNotification::EFileChange,2*KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
 	__UHEAP_MARKEND;
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of EFileWrite_async Tests --------------------------------\n"));	
 	//
 	// File Set Size
@@ -4048,7 +4049,7 @@
 	test.Next(_L("EFileSetSize Tests"));
 	_LIT(KFilename9,"file.setsize");
 	r = TestMultipleNotificationsL(_L(""),KFilename9,5,9,t_notification::EFileSetSize,TFsNotification::EFileChange,3*KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of EFileSetSize Tests ------------------------------------\n"));
 
 
@@ -4058,7 +4059,7 @@
 	_LIT(KFilenameCFMan,"cf1le.man");
 	TUint notificationTypes = (TUint)TFsNotification::ECreate|TFsNotification::EFileChange|TFsNotification::EAttribute|TFsNotification::EDelete|TFsNotification::ERename;
 	r = TestMultipleNotificationsL(_L(""),KFilenameCFMan,1,5,t_notification::ECFileManMove,notificationTypes,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of CFileMan Tests -------------------------------------\n"));
 	
 	
@@ -4081,16 +4082,16 @@
 	test.Next(_L("Mount Tests"));
 	TFullName filesystemName;
 	r = TheFs.FileSystemName(filesystemName,globalDriveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r = TestMultipleNotificationsL(filesystemName,1,1,t_notification::EDismount,TFsNotification::EMediaChange,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// RFs::MountFileSystem
 	// 2.  Add notification for media change
 	//     Mount the file system
 	//
 	r = TestMultipleNotificationsL(filesystemName,1,1,t_notification::EMount,TFsNotification::EMediaChange,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// Repeatedly mount and dismount the file system
 	// 3.  Add notification for media change
@@ -4100,7 +4101,7 @@
 	//     aMaxNotifications = 2*aIterations
 	//
 	r = TestMultipleNotificationsL(filesystemName,5,10,t_notification::EMountDismount,TFsNotification::EMediaChange,3*KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// RFs::MountFileSystemAndScan
 	// 4.  Add notification for media change
@@ -4111,14 +4112,14 @@
 	//
 //#ifndef __WINS__
 //    r = TestMultipleNotificationsL(filesystemName,1,2,t_notification::EMountScan,TFsNotification::EMediaChange,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-//    test(r==KErrNone);
+//    test_KErrNone(r);
 //#endif
 	test.Printf(_L("------- End of Mount Tests -------------------------------------------\n"));
 	TDriveInfo drvInfo;
 	TInt driveNum;
 	TheFs.CharToDrive(gDriveToTest,driveNum);
 	r = TheFs.Drive(drvInfo,driveNum);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	TPtrC driveDes((TText*)&gDriveToTest,1);
 	//
 	// Manual Tests - Will only run on removable drives
@@ -4132,13 +4133,13 @@
 		PrintLine();
 		test.Next(_L("Media Card Removal/Insertion Tests"));
 		r = TestMultipleNotificationsL(driveDes,1,1,t_notification::EMediaCardRemoval,TFsNotification::EMediaChange,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		//
 		// 6. Add notification for media change
 		//    Insert media card manually
 		//
 		r = TestMultipleNotificationsL(driveDes,1,1,t_notification::EMediaCardInsertion,TFsNotification::EMediaChange,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test.Printf(_L("------- End of Media Card Removal/Insertion Tests --------------------\n"));
 		//
 		// We should receive an EMediaChange notification even though we did not register for it
@@ -4161,7 +4162,7 @@
         PrintLine();
         test.Next(_L("RRawDisk::Write Tests"));
         r = TestMultipleNotificationsL(driveDes,1,1,t_notification::ERawDiskWrite,TFsNotification::EMediaChange,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-        test(r==KErrNone);
+        test_KErrNone(r);
         test.Printf(_L("------- End of RRawDisk::Write Test ------------------------------  \n"));
         }	
 	
@@ -4186,13 +4187,13 @@
 	PrintLine();
 	test.Next(_L("DriveName Test"));
 	r = TestMultipleNotificationsL(driveDes,1,2,t_notification::ESetDriveName,TFsNotification::EDriveName,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// 2.  Add notification for a specific drive name change
 	//     Repeatedly rename the drive
 	//
 	r = TestMultipleNotificationsL(driveDes,3,6,t_notification::ESetDriveName,TFsNotification::EDriveName,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of DriveName Test ----------------------------------------\n"));
 	
 	
@@ -4218,13 +4219,13 @@
 	//     Change the volume name
 	//
 	r = TestMultipleNotificationsL(driveDes,1,2,t_notification::ESetVolumeLabel,TFsNotification::EVolumeName,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// 2.  Add notification for a specific volume name change
 	//     Repeatedly rename the volume
 	//
 	r = TestMultipleNotificationsL(driveDes,3,6,t_notification::ESetVolumeLabel,TFsNotification::EVolumeName,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of VolumeName Test ---------------------------------------\n"));
 #endif
 		
@@ -4250,7 +4251,7 @@
 	//
 	_LIT(KFilename10,"file.allops");
 	r = TestMultipleNotificationsL(_L(""),KFilename10,4,8,t_notification::EAllOps1,(TUint)TFsNotification::EAllOps,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// 2.	Add notification for all operations
 	//		Create a file
@@ -4261,7 +4262,7 @@
 	// 		aMaxNotification = 2 + aIterations (See File Write Tests)
 	//
 	r = TestMultipleNotificationsL(_L(""),KFilename10,4,6,t_notification::EAllOps2,(TUint)TFsNotification::EAllOps,2*KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// 3.	Add notification for all operations
 	//		Create a file
@@ -4273,7 +4274,7 @@
 	//     aMaxNotifications = 1 + 2*aIterations
 	//
 	r = TestMultipleNotificationsL(_L(""),KFilename10,4,9,t_notification::EAllOps3,(TUint)TFsNotification::EAllOps,KMinNotificationBufferSize*2,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// 4.	Add notification for all operations
 	//		Create a file
@@ -4284,7 +4285,7 @@
 	// 		aMaxNotification = 3
 	//
 	r = TestMultipleNotificationsL(_L(""),KFilename10,1,3,t_notification::EAllOps4,(TUint)TFsNotification::EAllOps,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// 5.	Add notification for all operations
 	//		Create a file
@@ -4294,7 +4295,7 @@
 	// 		aMaxNotification = 2
 	//
 	r = TestMultipleNotificationsL(_L(""),KFilename10,1,2,t_notification::EAllOps5,(TUint)TFsNotification::EAllOps,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// 6.	Add notification for all operations
 	//		Change drive name
@@ -4306,7 +4307,7 @@
 	//
 #ifndef __WINS__
 	r = TestMultipleNotificationsL(driveDes,1,2,t_notification::EAllOps6,(TUint)TFsNotification::EAllOps,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #endif
 	test.Printf(_L("------- End of AllOps Tests ------------------------------------------\n"));
 	
@@ -4331,7 +4332,7 @@
 	//
 	_LIT(KFilename11,"file.mulfil");
 	r = TestMultipleNotificationsL(_L(""),KFilename11,3,6,t_notification::EAllOps1,TFsNotification::ECreate | TFsNotification::EDelete,2*KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// TFsNotification::EDelete | TFsNotification::ECreate | TFsNotification::EFileChange
 	// 2.	Add notification for create, file change and delete for a specific file
@@ -4344,7 +4345,7 @@
 	//     aMaxNotifications = 1 + 2*aIterations
 	//
 	r = TestMultipleNotificationsL(_L(""),KFilename11,4,9,t_notification::EAllOps3,TFsNotification::EDelete | TFsNotification::ECreate | TFsNotification::EFileChange,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// TFsNotification::EAttribute | TFsNotification::EDelete | TFsNotification::ECreate
 	// 3.	Add notification for create, attribute change and delete for a specific file
@@ -4356,7 +4357,7 @@
 	// 		aMaxNotification = 3
 	//
 	r = TestMultipleNotificationsL(_L(""),KFilename11,1,3,t_notification::EAllOps4,TFsNotification::EAttribute | TFsNotification::EDelete | TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// TFsNotification::ERename | TFsNotification::ECreate
 	// 4.	Add notification for create and rename for a specific file
@@ -4367,7 +4368,7 @@
 	// 		aMaxNotification = 2
 	//
 	r = TestMultipleNotificationsL(_L(""),KFilename11,1,2,t_notification::EAllOps5,TFsNotification::ERename | TFsNotification::ECreate,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	//
 	// TFsNotification::EVolumeName | TFsNotification::EDriveName
 	// 5.	Add notification for drive and volume name change for a specific drive
@@ -4380,7 +4381,7 @@
 	//
 #ifndef __WINS__
 	r = TestMultipleNotificationsL(driveDes,1,2,t_notification::EAllOps6,TFsNotification::EVolumeName | TFsNotification::EDriveName,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-	test(r==KErrNone);
+	test_KErrNone(r);
 #endif
 	test.Printf(_L("------- End of Multiple-Filter Tests ---------------------------------\n"));
 	
@@ -4400,12 +4401,12 @@
 	//
 	PrintLine();
 	r = TestOverflowL();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	//For DEF140387
 	PrintLine();
 	r= TestPostOverflowNotifications();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of Overflow Test -----------------------------------------\n"));
 	
 	
@@ -4454,7 +4455,7 @@
 	//=============================================================================
 	PrintLine();
 	r = TestNotificationsWithFServPlugins();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of Plugin Tests ------------------------------------------\n"));
 		
 	
@@ -4481,7 +4482,7 @@
 		PrintLine();
 		test.Next(_L("Format Tests"));
 		r = TestMultipleNotificationsL(driveDes,1,1,t_notification::EFormat,TFsNotification::EMediaChange,KMinNotificationBufferSize,(TBool)EFalse,__LINE__);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test.Printf(_L("------- End of Format Tests ------------------------------------------\n"));
 		}
 	
@@ -4503,15 +4504,15 @@
 	PrintLine();
 	test.Next(_L("Test T_NOTIFIER_NOCAPS.EXE"));
 	r = TestProcessCapabilities(_L("T_NOTIFIER_NOCAPS.EXE"));
-	test(r == KErrPermissionDenied); //Failure on emulator -> Did you forget to do a wintest?
+	test_Value(r, r == KErrPermissionDenied); //Failure on emulator -> Did you forget to do a wintest?
 	
 	test.Next(_L("Test T_NOTIFIER_ALLFILES.EXE"));
 	r = TestProcessCapabilities(_L("T_NOTIFIER_ALLFILES.EXE"));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	test.Next(_L("Test T_NOTIFIER_BELONGS.EXE"));
 	r = TestProcessCapabilities(_L("T_NOTIFIER_BELONGS.EXE"));
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("------- End of Data-Caging Tests -------------------------------------\n"));
 	
 	
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_notify.cpp
--- a/kerneltest/f32test/server/t_notify.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_notify.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32svr.h>
@@ -109,9 +110,9 @@
 	{
 	RFs fs;
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TTestCode testCode=*(TTestCode*)&aTestCode;
 	RFile f;
 	switch (testCode)
@@ -119,19 +120,19 @@
 
 	case ETest1:
 		r=f.Replace(fs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileStream);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		f.Close();
 		break;
 
 	case ETest2:
 		r=f.Replace(fs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileStream);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		f.Close();
 		break;
 
 	case ETest3:
 		r=fs.MkDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\SCARECROW\\"));
-		test((r==KErrNone)||(r==KErrAlreadyExists));
+		test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 		break;
 
 	case ETest4:
@@ -148,34 +149,34 @@
 		{
 		RFile file;
 		TInt r=file.Open(fs,_L("\\F32-TST\\NOTIFY\\kangaroo.txt"),EFileRead|EFileWrite);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.SetSize(sizeof(TCheckedUid));
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.Write(sizeof(TCheckedUid),_L8("012345678912"));
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TBuf8<64> dum;
 		r=file.Read(0,dum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		file.Close();
 
 		r=file.Open(fs,_L("\\F32-TST\\NOTIFY\\koala.txt"),EFileRead|EFileWrite);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.SetSize(50);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.Write(sizeof(TCheckedUid),_L8("ABCDEFGHIJKLMNOPQRSTUVWXYZ"));
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.Read(0,dum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		file.Close();
 
 		r=file.Open(fs,_L("\\F32-TST\\NOTIFY\\dingo.txt"),EFileRead|EFileWrite);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.SetSize(50);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.Write(sizeof(TCheckedUid),_L8("01234567890123456789"));
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.Read(0,dum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		file.Close();
 		gSleepThread.Signal();
 		}
@@ -193,9 +194,9 @@
 		{
 		RFile file;
 		TInt r=file.Open(fs,_L("\\F32-TST\\NOTIFY\\NewFILE.TXT"),EFileRead|EFileWrite);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=file.Write(_L8("asdfasdfasdf"));
-		test(r==KErrNone);
+		test_KErrNone(r);
 		file.Close();
 		gSleepThread.Signal();
 		}
@@ -204,7 +205,7 @@
 	case ETest8:
 		{
 		r=f.Open(fs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\WickedWitch.msg"),EFileRead|EFileWrite);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		f.SetSize(500);
 		f.Close();
 		break;
@@ -224,7 +225,7 @@
 		{
 		TFileName path=_L("\\F32-TST\\NOTIFY\\BehindTheCurtain\\");
 		r=fs.MkDir(path);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		break;
 		}
 	case ETest11:
@@ -232,7 +233,7 @@
 		TFileName path=_L("\\F32-TST\\NOTIFY\\BehindTheCurtain\\PayNoAttention.man");
 		RFile file;
 		r=file.Replace(fs,path,EFileStream);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		file.Close();
 		break;
 		}
@@ -240,12 +241,12 @@
 		{
 		RFile writer;
 		TInt r=writer.Open(fs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileWrite|EFileShareAny);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TInt i;
 		for(i=0; i<10; i++)
 			{
 			r=writer.Write(_L8("ABCDEFGHIJKLMNOPQRSTUVWXYZ"));
-			test(r==KErrNone);
+			test_KErrNone(r);
 			User::After(1000000);
 			}
 		writer.Close();
@@ -288,7 +289,7 @@
 	TheFs.NotifyChange(ENotifyEntry,reqStat);
 	RThread thread;
 	r=thread.Create(_L("MyThread"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(thrdStat);
 	thread.Resume();
 	User::WaitForRequest(thrdStat);
@@ -299,7 +300,7 @@
 
 	RFile file;
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileWrite|EFileShareExclusive);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Write(_L8("Somewhere over the rainbow..."),reqStat);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
@@ -310,13 +311,13 @@
 	file.Close();
 
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileShareExclusive);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileShareReadersOnly);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Read(0, buf, 100, reqStat);
 	test(reqStat==KRequestPending);
 	file.Close();
@@ -324,7 +325,7 @@
 	test(reqStat==KErrCancel);
 
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Read(0, buf, 100, reqStat);
 	test(reqStat==KRequestPending);
 	file.ReadCancel(reqStat);
@@ -333,7 +334,7 @@
 	file.Close();
 
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileWrite|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Read(0, buf, 100, reqStat);
 	test(reqStat==KRequestPending);
 	file.SetSize(100);
@@ -386,19 +387,19 @@
 	TRequestStatus reqStat1(KRequestPending);
 	RFs fs1;
 	TInt r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs1.NotifyChange(ENotifyEntry,reqStat1);
 
 	TRequestStatus reqStat2(KRequestPending);
 	RFs fs2;
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs2.NotifyChange(ENotifyEntry,reqStat2);
 
 	test(reqStat1==KRequestPending);
 	test(reqStat2==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\NEWFILE.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat1);
 	User::WaitForRequest(reqStat2);
 	test(reqStat1==KErrNone);
@@ -414,7 +415,7 @@
 	test.Next(_L("Cancel notification"));
 	RFs fs1;
 	TInt r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TRequestStatus status1;
 	TRequestStatus status2;
@@ -511,7 +512,7 @@
 
 	test.Next(_L("Kill client"));
 	TInt r=gSleepThread.CreateLocal(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RThread clientThread;
 	r=clientThread.Create(_L("ClientThread"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest4);
 	if (r!=KErrNone)
@@ -532,7 +533,7 @@
 	clientThread.Close();
 
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	MakeFile(_L("\\F32-TST\\NOTIFY\\NewFile.Txt"));
 	User::After(1000);
 	}
@@ -548,13 +549,13 @@
 
 	RFile file;
 	TInt r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\kangaroo.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\koala.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\dingo.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	TRequestStatus reqStat=0;
@@ -562,23 +563,23 @@
 	test(reqStat==KRequestPending);
 
 	r=gSleepThread.CreateLocal(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RThread clientThread;
 	r=clientThread.Create(_L("Test5Thread"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest5);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.Resume();
 	gSleepThread.Wait();
 	test(reqStat==KRequestPending);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\kangaroo.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\koala.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\dingo.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 
@@ -594,7 +595,7 @@
 	{
 	TDriveInfo driveInfo;
 	TInt r=TheFs.Drive(driveInfo,CurrentDrive());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// only test on removable media
 	if (driveInfo.iDriveAtt&KDriveAttRemovable)
         {
@@ -606,10 +607,10 @@
         TheFs.NotifyChange(ENotifyEntry,reqStat);
         test(reqStat==KRequestPending);
         r=gSleepThread.CreateLocal(0);
-        test(r==KErrNone);
+        test_KErrNone(r);
         RThread clientThread;
         r=clientThread.Create(_L("Test6Thread"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest6);
-        test(r==KErrNone);
+        test_KErrNone(r);
         clientThread.Resume();
         gSleepThread.Wait();
         TInt reqInt=reqStat.Int();
@@ -623,7 +624,7 @@
         //-- it seems that after generating media change the meia driver isn't ready for some time
         User::After(2000000);
 	    r=TheFs.Drive(driveInfo,CurrentDrive());
-	    test(r==KErrNone);
+	    test_KErrNone(r);
 
     
     }
@@ -643,16 +644,16 @@
 	test(reqStat==KRequestPending);
 
 	r=gSleepThread.CreateLocal(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RThread clientThread;
 	r=clientThread.Create(_L("Test7Thread"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest7);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.Resume();
 	gSleepThread.Wait();
 	test(reqStat==KRequestPending);
 
 	r=TheFs.Delete(_L("Newfile.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	User::WaitForRequest(reqStat);
 
@@ -669,7 +670,7 @@
 	{
 	TDriveInfo driveInfo;
 	TInt r=TheFs.Drive(driveInfo,CurrentDrive());
-	test(r==KErrNone);
+	test_KErrNone(r);
 	// only test on removable media
 	if (driveInfo.iDriveAtt&KDriveAttRemovable)
 		{
@@ -680,11 +681,11 @@
 		TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 		test(reqStat==KRequestPending);
 		r=gSleepThread.CreateLocal(0);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		RThread clientThread;
 		gSocketNumber=0;
 		r=clientThread.Create(_L("Test6Thread1"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest6);	//only generates a media change on removable media
-		test(r==KErrNone);
+		test_KErrNone(r);
 		clientThread.Resume();
 		gSleepThread.Wait();
 		User::WaitForRequest(reqStat);
@@ -696,15 +697,15 @@
         //-- it seems that after generating media change the meia driver isn't ready for some time
         User::After(2000000);
 	    r=TheFs.Drive(driveInfo,CurrentDrive());
-	    test(r==KErrNone);
+	    test_KErrNone(r);
 
 
 		TheFs.NotifyChange(ENotifyDisk,reqStat,path);
 		test(reqStat==KRequestPending);
 		r=gSleepThread.CreateLocal(0);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=clientThread.Create(_L("Test6Thread2"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest6);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		clientThread.Resume();
 		gSleepThread.Wait();
 		User::WaitForRequest(reqStat);
@@ -716,14 +717,14 @@
         //-- it seems that after generating media change the meia driver isn't ready for some time
         User::After(2000000);
 	    r=TheFs.Drive(driveInfo,CurrentDrive());
-	    test(r==KErrNone);
+	    test_KErrNone(r);
 
 		TheFs.NotifyChange(ENotifyWrite,reqStat,path);
 		test(reqStat==KRequestPending);
 		r=gSleepThread.CreateLocal(0);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		r=clientThread.Create(_L("Test6Thread3"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest6);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		clientThread.Resume();
 		gSleepThread.Wait();
 		User::WaitForRequest(reqStat);
@@ -735,7 +736,7 @@
         //-- it seems that after generating media change the meia driver isn't ready for some time
         User::After(2000000);
 	    r=TheFs.Drive(driveInfo,CurrentDrive());
-	    test(r==KErrNone);
+	    test_KErrNone(r);
 
 		}
 	}
@@ -750,7 +751,7 @@
 //	First a simple example
 
 	TInt r=TheFs.RmDir(_L("\\F32-TST\\NOTIFY\\BehindTheCurtain\\"));
-	test((r==KErrNotFound)||(r==KErrPathNotFound)||(r==KErrNone));
+	test_Value(r, (r == KErrNotFound)||(r==KErrPathNotFound)||(r==KErrNone));
 
 	TFileName path=_L("\\F32-TST\\NOTIFY\\BehindTheCurtain\\");
 	TRequestStatus reqStat(KRequestPending);
@@ -758,7 +759,7 @@
 	test(reqStat==KRequestPending);
 
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\BehindTheCurtain\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
@@ -769,14 +770,14 @@
 
 	RFile file;
 	r=file.Replace(TheFs,path,EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
 	r=TheFs.Delete(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
@@ -790,14 +791,14 @@
 	test(reqStat==KRequestPending);
 
 	r=file.Replace(TheFs,path,EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
 	r=TheFs.Delete(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyFile,reqStat,path);
 	test(reqStat==KRequestPending);
@@ -811,14 +812,14 @@
 	test(reqStat==KRequestPending);
 
 	r=file.Replace(TheFs,path,EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);	//	Monitoring attributes but informed anyway
 
 	r=TheFs.Delete(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAttributes,reqStat,path);
 	test(reqStat==KRequestPending);
@@ -832,14 +833,14 @@
 	test(reqStat==KRequestPending);
 
 	r=file.Replace(TheFs,path,EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);	//	Monitoring file writing but informed anyway
 
 	r=TheFs.Delete(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyWrite,reqStat,path);
 	test(reqStat==KRequestPending);
@@ -853,14 +854,14 @@
 	test(reqStat==KRequestPending);
 
 	r=file.Replace(TheFs,path,EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);	//	Monitoring disk activity but informed anyway
 
 	r=TheFs.Delete(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyAttributes,reqStat,path);
 	test(reqStat==KRequestPending);
@@ -877,16 +878,16 @@
 	test(reqStat==KRequestPending);
 
 	TheFs.MkDir(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
 	TheFs.RmDir(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyDir,reqStat,path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 
 //	Now cancel the outstanding request
@@ -895,7 +896,7 @@
 	test(reqStat==KErrCancel);
 
 	TheFs.NotifyChange(ENotifyDir,reqStat,path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 
 //	Get a separate thread to create the directory
@@ -912,13 +913,13 @@
 	test(reqStat==KErrNone);
 
 	TheFs.RmDir(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	Check that notification is not received for a non-existent file if only the previously
 //	non existent directory that contains it is created
 	path=_L("\\F32-TST\\NOTIFY\\BehindTheCurtain\\PayNoAttention.man");
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 
 	thread.Create(_L("RequestAheadThread"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest10);
@@ -942,10 +943,10 @@
 	test(reqStat==KErrNone);
 
 	TheFs.Delete(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 
 //	Now cancel the outstanding request
@@ -955,7 +956,7 @@
 
 	path=_L("\\F32-TST\\NOTIFY\\BehindTheCurtain\\");
 	TheFs.RmDir(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 
@@ -974,7 +975,7 @@
 	test(reqStat==KRequestPending);
 	RThread thread;
 	TInt r=thread.Create(_L("MyThread"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(thrdStat);
 	thread.Resume();
 	User::WaitForRequest(thrdStat);
@@ -988,7 +989,7 @@
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=thread.Create(_L("MyThread2"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(thrdStat);
 	thread.Resume();
 	User::WaitForRequest(thrdStat);
@@ -1010,7 +1011,7 @@
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=thread.Create(_L("MyThread3"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(thrdStat);
 	thread.Resume();
 	User::WaitForRequest(thrdStat);
@@ -1024,12 +1025,12 @@
 //	will occur - this is tested for in Test18())
 	test.Next(_L("Test changing above monitored directory"));
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\"));
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 	path=_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\");
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=thread.Create(_L("MyThread4"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(thrdStat);
 	thread.Resume();
 	User::WaitForRequest(thrdStat);
@@ -1046,7 +1047,7 @@
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=thread.Create(_L("MyThread5"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(thrdStat);
 	thread.Resume();
 	User::WaitForRequest(thrdStat);
@@ -1059,7 +1060,7 @@
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=thread.Create(_L("MyThread6"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest3);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(thrdStat);
 	thread.Resume();
 	User::WaitForRequest(thrdStat);
@@ -1071,26 +1072,26 @@
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\SCARECROW\\TINMAN\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
 
 	r=TheFs.RmDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\SCARECROW\\TINMAN\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.RmDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\SCARECROW\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	Test again that notification doesn't occur above the subdirectory being monitored
 	test.Next(_L("Test changing above monitored directory"));
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\"));
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 	path=_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\");
 
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=thread.Create(_L("MyThread7"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(thrdStat);
 	thread.Resume();
 	User::WaitForRequest(thrdStat);
@@ -1107,13 +1108,13 @@
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
 	RFile file;
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\WickedWitch.msg"),EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 //	Test notification on a specific file
@@ -1122,7 +1123,7 @@
 	TheFs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=thread.Create(_L("MyThread8"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest8);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(thrdStat);
 	thread.Resume();
 	User::WaitForRequest(thrdStat);
@@ -1151,7 +1152,7 @@
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\WickedWitch.Msg"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -1166,7 +1167,7 @@
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.Doc"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -1174,7 +1175,7 @@
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.RmDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -1184,7 +1185,7 @@
 	test(reqStat==KRequestPending);
 //	Now create the directory we are waiting on
 	r=TheFs.MkDir(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //	Make sure the notification has now been received
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
@@ -1195,7 +1196,7 @@
 	test(reqStat==KRequestPending);
 //	Now create the file we are waiting on
 	r=file.Replace(TheFs,path,EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 //	Make sure the notification has now been received
 	User::WaitForRequest(reqStat);
@@ -1204,14 +1205,14 @@
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.Delete(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	path=_L("\\F32-TST\\NOTIFY\\GOOD_WITCH\\");
 	TheFs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.RmDir(path);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	// test passing in an empty string
@@ -1231,13 +1232,13 @@
 //	Create five sessions monitoring various levels of a directory tree
 
 	TInt r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\ANIMAL\\"));
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, (r == KErrNone)||(r==KErrAlreadyExists));
 	RFile file;
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\ANIMAL\\cat.txt"),EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\ANIMAL\\dog.txt"),EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	TFileName path1=_L("\\F32-TST\\");
@@ -1250,49 +1251,49 @@
 	TRequestStatus reqStat1(KRequestPending);
 	RFs fs1;
 	r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs1.NotifyChange(ENotifyEntry,reqStat1,path1);
 
 	TRequestStatus reqStat2(KRequestPending);
 	RFs fs2;
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs2.NotifyChange(ENotifyEntry,reqStat2,path2);
 
 	TRequestStatus reqStat3(KRequestPending);
 	RFs fs3;
 	r=fs3.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs3.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs3.NotifyChange(ENotifyEntry,reqStat3,path3);
 
 	TRequestStatus reqStat4(KRequestPending);
 	RFs fs4;
 	r=fs4.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs4.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs4.NotifyChange(ENotifyEntry,reqStat4,path4);
 
 	TRequestStatus reqStat5(KRequestPending);
 	RFs fs5;
 	r=fs5.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs5.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs5.NotifyChange(ENotifyEntry,reqStat5,path5);
 
 	TRequestStatus reqStat6(KRequestPending);
 	RFs fs6;
 	r=fs6.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs6.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs6.NotifyChange(ENotifyEntry,reqStat6,path6);
 
 	test(reqStat1==KRequestPending);
@@ -1306,7 +1307,7 @@
 //	that level is notified
 	test.Next(_L("Test only client monitoring top level is notified"));
 	r=file.Replace(TheFs,_L("\\F32-TST\\NewFile.txt"),EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	User::WaitForRequest(reqStat1);
 	test(reqStat1==KErrNone);
@@ -1318,7 +1319,7 @@
 	test(reqStat6==KErrNone);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NewFile.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	Renew the notify request at the top level and make a change one step lower
 	fs1.NotifyChange(ENotifyEntry,reqStat1,path1);
@@ -1328,7 +1329,7 @@
 
 	test.Next(_L("Test clients monitoring levels 1 and 2 are notified"));
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	User::WaitForRequest(reqStat1);
@@ -1342,7 +1343,7 @@
 	test(reqStat6==KErrNone);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\NewFile.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	Renew the notify request at the top and second levels and make a change
 //	one step lower still
@@ -1355,7 +1356,7 @@
 
 	test.Next(_L("Test clients monitoring levels 1,2 and 3 are notified"));
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\ANIMAL\\NewFile.txt"),EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	User::WaitForRequest(reqStat1);
@@ -1370,7 +1371,7 @@
 	test(reqStat6==KErrNone);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\ANIMAL\\NewFile.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	Renew the notify request at the top, second and third levels and make a change
 //	one step lower still
@@ -1385,7 +1386,7 @@
 
 	test.Next(_L("Test clients monitoring levels 1 - 4 are notified"));
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\ANIMAL\\cat.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat1);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -1415,7 +1416,7 @@
 
 	test.Next(_L("Test clients monitoring levels 1 - 3 and 5 are notified"));
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\ANIMAL\\dog.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat1);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -1450,7 +1451,7 @@
 	test(reqStat6==KRequestPending);
 
 	r=TheFs.RmDir(_L("\\F32-TST\\NOTIFY\\ANIMAL\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat1);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -1509,9 +1510,9 @@
 	TFileName path=_L("\\F32-TST\\NOTIFY\\");
 	RFs fs1;
 	TInt r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TRequestStatus status1;
 	TRequestStatus status2;
@@ -1570,7 +1571,7 @@
 	test(status5==KErrCancel);
 
 	r=TheFs.MkDir(_L("\\F32-TST\\TROPICANA\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(status1==KRequestPending);
 	test(status2==KRequestPending);
 	test(status3==KRequestPending);
@@ -1585,7 +1586,7 @@
 	test(status4==KRequestPending);
 
 	r=TheFs.RmDir(_L("\\F32-TST\\TROPICANA\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(status1==KRequestPending);
 	test(status3==KRequestPending);
 	test(status4==KRequestPending);
@@ -1622,11 +1623,11 @@
 	test.Next(_L("Kill client while it is monitoring changes to a directory"));
 //	Call CreateLocal to create RSemaphore gSleepThread which is local to this process
 	TInt r=gSleepThread.CreateLocal(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RThread clientThread;
 	r=clientThread.Create(_L("ClientThread"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest9);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	clientThread.Resume();
 	gSleepThread.Wait();	//	Wait for gSleepThread to be signalled
 							//	Client thread is waiting for notification of changes
@@ -1641,7 +1642,7 @@
 
 //	Make a change and check there's no disaster
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 	MakeFile(_L("\\F32-TST\\NOTIFY\\NewFile.Txt"));
 	User::After(1000);
 	}
@@ -1658,38 +1659,38 @@
 
 	RFile file;
 	TInt r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\kangaroo.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\koala.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\dingo.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	TFileName path=_L("\\F32-TST\\NOTIFY\\");
 	TRequestStatus reqStat1(KRequestPending);
 	RFs fs1;
 	r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs1.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs1.NotifyChange(ENotifyEntry,reqStat1,path);
 
 	TRequestStatus reqStat2(KRequestPending);
 	RFs fs2;
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs2.NotifyChange(ENotifyEntry,reqStat2,path);
 
 	TRequestStatus reqStat3(KRequestPending);
 	RFs fs3;
 	r=fs3.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs3.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs3.NotifyChange(ENotifyEntry,reqStat3,path);
 
 	test(reqStat1==KRequestPending);
@@ -1697,10 +1698,10 @@
 	test(reqStat3==KRequestPending);
 
 	r=gSleepThread.CreateLocal(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RThread thread1;
 	r=thread1.Create(_L("TestThread1"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest5);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread1.Resume();
 	gSleepThread.Wait();
 
@@ -1709,7 +1710,7 @@
 	test(reqStat3==KRequestPending);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\kangaroo.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat1);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -1722,7 +1723,7 @@
 
 	test.Next(_L("Test reads and writes do cause notification under ENotifyAll"));
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\kangaroo.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	fs1.NotifyChange(ENotifyAll,reqStat1,path);
@@ -1734,10 +1735,10 @@
 	test(reqStat3==KRequestPending);
 
 	r=gSleepThread.CreateLocal(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RThread thread2;
 	r=thread2.Create(_L("TestThread2"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest5);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread2.Resume();
 	gSleepThread.Wait();
 
@@ -1768,10 +1769,10 @@
 	test(reqStat3==KRequestPending);
 
 	r=gSleepThread.CreateLocal(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RThread thread3;
 	r=thread3.Create(_L("TestThread3"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest5);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread3.Resume();
 	gSleepThread.Wait();
 
@@ -1782,14 +1783,14 @@
 	test(reqStat3==KErrNone);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\koala.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat2);
 	test(reqStat2==KErrNone);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\kangaroo.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\dingo.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	gSleepThread.Close();
 	thread3.Close();
@@ -1806,17 +1807,17 @@
 	{
 	RFs fs;	//	Session to be notified of any changes
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\"));
-	test(r==KErrNone||r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone||r==KErrAlreadyExists);
 
 	RFile file;
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\WickedWitch.msg"),EFileStream);
-	test(r==KErrNone||KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	file.Close();
 
 //	Test notification on a specific file
@@ -1828,7 +1829,7 @@
 	test(reqStat==KRequestPending);
 	RThread thread;
 	r=thread.Create(_L("MyThread7"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest8);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(thrdStat);
 	thread.Resume();
 	User::WaitForRequest(thrdStat);
@@ -1840,7 +1841,7 @@
 	fs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=thread.Create(_L("MyThread8"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest1);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(thrdStat);
 	thread.Resume();
 	User::WaitForRequest(thrdStat);
@@ -1849,22 +1850,22 @@
 	thread.Close();
 	test(reqStat==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\NEWFILE.TXT"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	Test notification does not occur if a change is made to another file
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Lion.log"),EFileStream);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	file.Close();
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Lion.log"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 
 
 //	Test notification occurs when a change is made to the file
 	test.Next(_L("Delete monitored file"));
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\WickedWitch.Msg"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -1880,9 +1881,9 @@
 //
 	RFs fs;
 	TInt r=fs.Connect();	//	Session to be notified of any changes
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	RFile::Write() to a file within the monitored directory
 	test.Next(_L("RFile::Write()"));
@@ -1894,13 +1895,13 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=file.Write(0,_L8("Pay no attention to the man behind the curtain"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
@@ -1911,7 +1912,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	r=file.Read(0,temp,100);
 	test(reqStat==KRequestPending);
@@ -1919,7 +1920,7 @@
 //	RFile::SetAtt() of a file within the monitored directory
 	test.Next(_L("RFile::SetAtt()"));
 	r=file.SetAtt(KEntryAttSystem,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	fs.NotifyChange(ENotifyAll,reqStat,path);
@@ -1928,7 +1929,7 @@
 //	RFile::SetSize() of a file within the monitored directory
 	test.Next(_L("RFile::SetSize()"));
 	r=file.SetSize(256);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	file.Close();
@@ -1939,7 +1940,7 @@
 	test(reqStat==KRequestPending);
 	TFileName fileName;
 	r=file.Temp(TheFs,path,fileName,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	file.Close();
@@ -1951,7 +1952,7 @@
 	TTime now;
 	now.HomeTime();
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	file.SetModified(now);
 	file.Close();
@@ -1966,7 +1967,7 @@
 	test(reqStat==KRequestPending);
 	now.HomeTime();
 	r=TheFs.SetEntry(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),now,KEntryAttHidden,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -1974,7 +1975,7 @@
 	test.Next(_L("RFile::Set()"));
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	now.HomeTime();
 	r=file.Set(now,KEntryAttNormal,KEntryAttHidden);
@@ -1988,13 +1989,13 @@
 	test(reqStat==KRequestPending);
 	User::After(KNotifyChangeAfter);
 	r=TheFs.SetDriveName(KDefaultDrive,_L("DRIVETEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	fs.NotifyChange(ENotifyEntry,reqStat,path);
 	User::After(KNotifyChangeAfter);
 	r=TheFs.SetDriveName(KDefaultDrive,_L("TEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	fs.NotifyChangeCancel(reqStat);
 	User::WaitForRequest(reqStat);
@@ -2002,7 +2003,7 @@
 	fs.NotifyChange(ENotifyDisk,reqStat,path);
 	User::After(KNotifyChangeAfter);
 	r=TheFs.SetDriveName(KDefaultDrive,_L("DRIVE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	fs.NotifyChangeCancel(reqStat);
 	User::WaitForRequest(reqStat);
@@ -2014,7 +2015,7 @@
 	test(reqStat==KRequestPending);
 	test.Next(_L("RFs::MkDir()"));
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\EMERALD_CITY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2023,7 +2024,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.RmDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\EMERALD_CITY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2032,7 +2033,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=file.Create(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Good_Witch.bat"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	file.Close();
@@ -2042,7 +2043,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Good_Witch.bat"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2051,7 +2052,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Good_Witch.bat"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	file.Close();
@@ -2061,7 +2062,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Good_Witch.bat"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2074,7 +2075,7 @@
 	TFileName currentVolName;
 
 	r=TheFs.Volume(volInfo,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	currentVolName=volInfo.iName;
 
@@ -2084,27 +2085,27 @@
 		User::WaitForRequest(reqStat);
 		test(reqStat==KErrNone);
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(volInfo.iName==_L("VOL"));
 	//	Test notification occurs under ENotifyDisk
 		fs.NotifyChange(ENotifyDisk,reqStat,path);
 		test(reqStat==KRequestPending);
 		r=TheFs.SetVolumeLabel(_L("ABCDEFGHIJK"),driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		User::WaitForRequest(reqStat);
 		test(reqStat==KErrNone);
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		test(volInfo.iName==_L("ABCDEFGHIJK"));
 
 	//	Test notification does not occur under ENotifyAttributes
 		fs.NotifyChange(ENotifyAttributes,reqStat,path);
 		r=TheFs.SetVolumeLabel(_L("TROPICANA"),driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(reqStat==KRequestPending);
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		test(volInfo.iName==_L("TROPICANA"));
 
@@ -2115,11 +2116,11 @@
 		fs.NotifyChange(ENotifyEntry,reqStat,path);
 		test(reqStat==KRequestPending);
 		r=TheFs.SetVolumeLabel(currentVolName,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		User::WaitForRequest(reqStat);
 		test(reqStat==KErrNone);
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(volInfo.iName==currentVolName);
 		}
 
@@ -2137,12 +2138,12 @@
 	fs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.Rename(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Toto.doc"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
 	r=TheFs.Rename(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Toto.doc"),_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 #if defined(__WINS__)
 	if(gSessionPath[0]=='Y'||gSessionPath[0]=='X')
@@ -2153,11 +2154,11 @@
 		while(longName.Length()<(KMaxFileName-2))
 			longName+=_L("a");
 		r=TheFs.Rename(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),longName);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		fs.NotifyChange(ENotifyEntry,reqStat,longName);
 		test(reqStat==KRequestPending);
 		r=TheFs.Rename(longName,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"));
-		test(r==KErrNone);
+		test_KErrNone(r);
 		User::WaitForRequest(reqStat);
 		test(reqStat==KErrNone);
 		}
@@ -2175,9 +2176,9 @@
 //
 	RFs fs;					//	Session to be notified when a change occurs
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	RFile::Write() to a file in the subtree
 	test.Next(_L("RFile::Write()"));
@@ -2187,7 +2188,7 @@
 
 	RFile file;
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	r=file.Write(0,_L8("Pay no attention to the man behind the curtain"));
 	file.Close();
@@ -2198,7 +2199,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	TBuf8<100> temp;
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	r=file.Read(0,temp,100);
 	test(reqStat==KRequestPending);
@@ -2206,7 +2207,7 @@
 //	RFile::SetAtt() of a file within the monitored directory
 	test.Next(_L("RFile::SetAtt()"));
 	r=file.SetAtt(KEntryAttNormal,KEntryAttHidden);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2215,7 +2216,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=file.SetSize(256);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	file.Close();
@@ -2226,7 +2227,7 @@
 	test(reqStat==KRequestPending);
 	TFileName fileName;
 	r=file.Temp(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\"),fileName,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	file.Close();
@@ -2237,7 +2238,7 @@
 	TTime now;
 	now.HomeTime();
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	file.SetModified(now);
 	file.Close();
@@ -2252,7 +2253,7 @@
 	test(reqStat==KRequestPending);
 	now.HomeTime();
 	r=TheFs.SetEntry(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),now,KEntryAttHidden,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2260,7 +2261,7 @@
 	test.Next(_L("RFile::Set()"));
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	now.HomeTime();
 	r=file.Set(now,KEntryAttNormal,KEntryAttHidden);
@@ -2274,12 +2275,12 @@
 	test(reqStat==KRequestPending);
 	User::After(KNotifyChangeAfter);
 	r=TheFs.SetDriveName(KDefaultDrive,_L("DRIVETEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	fs.NotifyChange(ENotifyEntry,reqStat,path);
 	r=TheFs.SetDriveName(KDefaultDrive,_L("TEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	User::After(KNotifyChangeAfter);
 	fs.NotifyChangeCancel(reqStat);
@@ -2288,7 +2289,7 @@
 	fs.NotifyChange(ENotifyDisk,reqStat,path);
 	User::After(KNotifyChangeAfter);
 	r=TheFs.SetDriveName(KDefaultDrive,_L("DRIVE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	fs.NotifyChangeCancel(reqStat);
 	User::WaitForRequest(reqStat);
@@ -2299,7 +2300,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\EMERALD_CITY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2308,7 +2309,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.RmDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\EMERALD_CITY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2317,7 +2318,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=file.Create(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Good_Witch.bat"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	file.Close();
@@ -2327,7 +2328,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Good_Witch.bat"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2336,7 +2337,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Good_Witch.bat"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	file.Close();
@@ -2346,7 +2347,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Good_Witch.bat"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2360,7 +2361,7 @@
 	TVolumeInfo volInfo;
 	TFileName currentVolName;
 	r=TheFs.Volume(volInfo,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	currentVolName=volInfo.iName;
 
@@ -2370,27 +2371,27 @@
 		User::WaitForRequest(reqStat);
 		test(reqStat==KErrNone);
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(volInfo.iName==_L("VOL"));
 	//	Test notification occurs under ENotifyDisk
 		fs.NotifyChange(ENotifyDisk,reqStat,path);
 		test(reqStat==KRequestPending);
 		r=TheFs.SetVolumeLabel(_L("ABCDEFGHIJK"),driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		User::WaitForRequest(reqStat);
 		test(reqStat==KErrNone);
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		test(volInfo.iName==_L("ABCDEFGHIJK"));
 
 	//	Test notification does not occur under ENotifyAttributes
 		fs.NotifyChange(ENotifyAttributes,reqStat,path);
 		r=TheFs.SetVolumeLabel(_L("TROPICANA"),driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(reqStat==KRequestPending);
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		test(volInfo.iName==_L("TROPICANA"));
 
@@ -2401,11 +2402,11 @@
 		fs.NotifyChange(ENotifyEntry,reqStat,path);
 		test(reqStat==KRequestPending);
 		r=TheFs.SetVolumeLabel(currentVolName,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		User::WaitForRequest(reqStat);
 		test(reqStat==KErrNone);
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(volInfo.iName==currentVolName);
 		}
 
@@ -2422,14 +2423,14 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\EMERALD_CITY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.RmDir(_L("\\F32-TST\\NOTIFY\\EMERALD_CITY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	fs.Close();
@@ -2445,9 +2446,9 @@
 //
 	RFs fs;
 	TInt r=fs.Connect();	//	Session to be notified when a change occurs
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	RFile::Write() to a file in the subtree
 	TFileName path=_L("\\F32-TST\\NOTIFY\\");
@@ -2456,7 +2457,7 @@
 
 	RFile file;
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	r=file.Write(0,_L8("Pay no attention to the man behind the curtain"));
 	file.Close();
@@ -2467,14 +2468,14 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	TBuf8<100> temp;
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	r=file.Read(0,temp,100);
 	test(reqStat==KRequestPending);
 
 //	RFile::SetAtt() of a file within the monitored directory
 	r=file.SetAtt(KEntryAttNormal,KEntryAttHidden);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2482,7 +2483,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=file.SetSize(256);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	file.Close();
@@ -2493,7 +2494,7 @@
 	TTime now;
 	now.HomeTime();
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	file.SetModified(now);
 	file.Close();
@@ -2507,14 +2508,14 @@
 	test(reqStat==KRequestPending);
 	now.HomeTime();
 	r=TheFs.SetEntry(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),now,KEntryAttHidden,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
 //	RFile::Set() to change file's modification time and attributes
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	now.HomeTime();
 	r=file.Set(now,KEntryAttNormal,KEntryAttHidden);
@@ -2527,20 +2528,20 @@
 	test(reqStat==KRequestPending);
 	User::After(KNotifyChangeAfter);
 	r=TheFs.SetDriveName(KDefaultDrive,_L("DRIVETEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	fs.NotifyChange(ENotifyEntry,reqStat,path);
 	User::After(KNotifyChangeAfter);
 	r=TheFs.SetDriveName(KDefaultDrive,_L("TEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	fs.NotifyChangeCancel(reqStat);
 	User::WaitForRequest(reqStat);
 	fs.NotifyChange(ENotifyDisk,reqStat,path);
 	User::After(KNotifyChangeAfter);
 	r=TheFs.SetDriveName(KDefaultDrive,_L("DRIVE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	fs.NotifyChangeCancel(reqStat);
 	User::WaitForRequest(reqStat);
@@ -2551,7 +2552,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\EMERALD_CITY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2559,7 +2560,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.RmDir(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\EMERALD_CITY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2567,7 +2568,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=file.Create(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Good_Witch.bat"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	file.Close();
@@ -2576,7 +2577,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Good_Witch.bat"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2584,7 +2585,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Good_Witch.bat"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	file.Close();
@@ -2593,7 +2594,7 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Good_Witch.bat"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2604,7 +2605,7 @@
 	TVolumeInfo volInfo;
 	TFileName currentVolName;
 	r=TheFs.Volume(volInfo,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	currentVolName=volInfo.iName;
 
@@ -2614,27 +2615,27 @@
 		User::WaitForRequest(reqStat);
 		test(reqStat==KErrNone);
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(volInfo.iName==_L("VOL"));
 	//	Test notification occurs under ENotifyDisk
 		fs.NotifyChange(ENotifyDisk,reqStat,path);
 		test(reqStat==KRequestPending);
 		r=TheFs.SetVolumeLabel(_L("ABCDEFGHIJK"),driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		User::WaitForRequest(reqStat);
 		test(reqStat==KErrNone);
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		test(volInfo.iName==_L("ABCDEFGHIJK"));
 
 	//	Test notification does not occur under ENotifyAttributes
 		fs.NotifyChange(ENotifyAttributes,reqStat,path);
 		r=TheFs.SetVolumeLabel(_L("TROPICANA"),driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(reqStat==KRequestPending);
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		test(volInfo.iName==_L("TROPICANA"));
 
@@ -2645,11 +2646,11 @@
 		fs.NotifyChange(ENotifyEntry,reqStat,path);
 		test(reqStat==KRequestPending);
 		r=TheFs.SetVolumeLabel(currentVolName,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		User::WaitForRequest(reqStat);
 		test(reqStat==KErrNone);
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(volInfo.iName==currentVolName);
 		}
 
@@ -2664,7 +2665,7 @@
 	fs.NotifyChange(ENotifyEntry,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.Rename(_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Dorothy.doc"),_L("\\F32-TST\\NOTIFY\\MUNCHKINS\\Toto.doc"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
@@ -2672,14 +2673,14 @@
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\EMERALD_CITY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	test(reqStat==KRequestPending);
 	r=TheFs.RmDir(_L("\\F32-TST\\NOTIFY\\EMERALD_CITY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	fs.Close();
@@ -2696,20 +2697,20 @@
 
 	RFile file;
 	TInt r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\kangaroo.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\koala.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\dingo.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	RFs fs;
 	r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TRequestStatus reqStat1(KRequestPending);
 	TFileName path1=_L("\\F32-TST\\NOTIFY\\");
@@ -2759,10 +2760,10 @@
 
 
 	r=gSleepThread.CreateLocal(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RThread thread1;
 	r=thread1.Create(_L("TestThread1"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest5);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread1.Resume();
 	gSleepThread.Wait();
 
@@ -2786,7 +2787,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\kangaroo.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat1);
 	test(reqStat1==KErrNone);
 	User::WaitForRequest(status1);
@@ -2829,7 +2830,7 @@
 
 	test.Next(_L("Test reads and writes do cause notification under ENotifyAll"));
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\kangaroo.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	fs.NotifyChange(ENotifyAll,reqStat1,path1);
@@ -2842,10 +2843,10 @@
 	test(reqStat4==KRequestPending);
 
 	r=gSleepThread.CreateLocal(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RThread thread2;
 	r=thread2.Create(_L("TestThread2"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest5);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread2.Resume();
 	gSleepThread.Wait();
 
@@ -2868,10 +2869,10 @@
 	test(reqStat4==KRequestPending);
 
 	r=gSleepThread.CreateLocal(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RThread thread3;
 	r=thread3.Create(_L("TestThread3"),ThreadEntryPoint,0x4000,KHeapSize,KHeapSize,(TAny*)ETest5);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread3.Resume();
 	gSleepThread.Wait();
 
@@ -2884,16 +2885,16 @@
 
 	RFs fs2;
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TRequestStatus reqStat(KRequestPending);
 	fs2.NotifyChange(ENotifyEntry,reqStat);
 	test(reqStat==KRequestPending);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\kangaroo.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat2);
 	test(reqStat2==KErrNone);
 	test(reqStat4==KRequestPending);
@@ -2903,12 +2904,12 @@
 	fs2.NotifyChange(ENotifyAll,reqStat);
 	test(reqStat==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\koala.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	test(reqStat4==KRequestPending);
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\dingo.txt"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat4);
 	test(reqStat4==KErrNone);
 
@@ -2928,9 +2929,9 @@
 //
 	RFs fs;
 	TInt r=fs.Connect();	//	Session to be notified of any changes
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs.SetSessionPath(gSessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	RFile::Write() to a file within the monitored directory
 	test.Next(_L("RFile::Write()"));
@@ -2946,7 +2947,7 @@
 
 	RFile file;
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	fs.NotifyChange(ENotifyFile,reqStat2,path);
@@ -2993,7 +2994,7 @@
 	test(reqStat7==KErrCancel);
 
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	RFile::SetAtt() of a file within the monitored directory
 	fs.NotifyChange(ENotifyAll,reqStat,path);
@@ -3015,7 +3016,7 @@
 
 	test.Next(_L("RFile::SetAtt()"));
 	r=file.SetAtt(KEntryAttSystem,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat4);
 	test(reqStat==KErrNone);
@@ -3031,7 +3032,7 @@
 	User::WaitForRequest(reqStat4);
 	test(reqStat4==KErrArgument);
 	r=file.SetAtt(KEntryAttNormal,KEntryAttSystem);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);		//	Monitoring with ENotifyWrite
 	fs.NotifyChangeCancel();	//	Cancel outstanding notification request
 
@@ -3059,7 +3060,7 @@
 //	RFile::SetSize() of a file within the monitored directory
 	test.Next(_L("RFile::SetSize()"));
 	r=file.SetSize(256);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat4);
 	test(reqStat==KErrNone);
@@ -3073,7 +3074,7 @@
 	User::WaitForRequest(reqStat4);
 	test(reqStat4==KErrArgument);
 	r=file.SetSize(200);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::After(1000000);
 	test(reqStat==KRequestPending);		//	Monitoring with ENotifyWrite
 
@@ -3103,7 +3104,7 @@
 
 	TFileName fileName;
 	r=file.Temp(TheFs,path,fileName,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	test(reqStat2==KRequestPending);
@@ -3123,7 +3124,7 @@
 	fs.NotifyChange(ENotifyDisk,reqStat2,path);
 	fs.NotifyChange(ENotifyWrite,reqStat3,path);
 	r=file.Temp(TheFs,path,fileName,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);		//	Monitoring ENotifyFile
 	test(reqStat2==KRequestPending);	//	Monitoring ENotifyDisk
 	test(reqStat3==KRequestPending);	//	Monitoring ENotifyWrite
@@ -3154,7 +3155,7 @@
 	TTime now;
 	now.HomeTime();
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	file.SetModified(now);
 	file.Close();
@@ -3188,7 +3189,7 @@
 	test(reqStat==KRequestPending);
 	now.HomeTime();
 	r=TheFs.SetEntry(_L("\\F32-TST\\NOTIFY\\NewFile.txt"),now,KEntryAttHidden,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat3);
 	test(reqStat==KErrNone);
@@ -3215,7 +3216,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	now.HomeTime();
 	r=file.Set(now,KEntryAttNormal,KEntryAttHidden);
@@ -3248,7 +3249,7 @@
 	User::After(KNotifyChangeAfter);
 
 	r=TheFs.SetDriveName(KDefaultDrive,_L("DRIVETEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	test(reqStat==KErrNone);
 	test(reqStat2==KRequestPending);
@@ -3278,7 +3279,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=TheFs.MkDir(_L("\\F32-TST\\NOTIFY\\EMERALD_CITY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3298,7 +3299,7 @@
 	test(reqStat3==KRequestPending);
 
 	r=TheFs.RmDir(_L("\\F32-TST\\NOTIFY\\EMERALD_CITY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	test(reqStat==KErrNone);
@@ -3325,7 +3326,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=file.Create(TheFs,_L("\\F32-TST\\NOTIFY\\Good_Witch.bat"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat4);
@@ -3348,7 +3349,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=file.Create(TheFs,_L("\\F32-TST\\NOTIFY\\Bad_Witch.bat"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	test(reqStat==KErrNone);
@@ -3376,7 +3377,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\Good_Witch.bat"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat4);
@@ -3399,7 +3400,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\Bad_Witch.bat"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat4);
@@ -3424,7 +3425,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=file.Replace(TheFs,_L("\\F32-TST\\NOTIFY\\Good_Witch.bat"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3456,7 +3457,7 @@
 	test(reqStat4==KErrArgument);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\Good_Witch.bat"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3488,7 +3489,7 @@
 	TVolumeInfo volInfo;
 	TFileName currentVolName;
 	r=TheFs.Volume(volInfo,driveNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	currentVolName=volInfo.iName;
 
@@ -3516,7 +3517,7 @@
 		test(reqStat7==KRequestPending);
 
 		r=TheFs.SetVolumeLabel(currentVolName,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 
 		User::WaitForRequest(reqStat);
 		User::WaitForRequest(reqStat2);
@@ -3531,7 +3532,7 @@
 		test(reqStat7==KErrNone);
 
 		r=TheFs.Volume(volInfo,driveNum);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		test(volInfo.iName==currentVolName);
 
 		fs.NotifyChangeCancel();
@@ -3576,7 +3577,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=file.Rename(_L("\\F32-TST\\NOTIFY\\OldFile.abc"));
-	test(r==KErrNone||r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone||r==KErrAlreadyExists);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3592,7 +3593,7 @@
 	path=_L("\\F32-TST\\NOTIFY\\OldFile.abc");
 
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\OldFile.abc"),EFileShareExclusive|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fs.NotifyChange(ENotifyAll,reqStat,path);
 	fs.NotifyChange(ENotifyEntry,reqStat2,path);
 	fs.NotifyChange(ENotifyFile,reqStat3,path);
@@ -3605,7 +3606,7 @@
 	test(reqStat4==KErrArgument);
 
 	r=file.Rename(_L("\\F32-TST\\NOTIFY\\NewFile.xyz"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3629,7 +3630,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=TheFs.Rename(_L("\\F32-TST\\NOTIFY\\NewFile.xyz"),_L("\\F32-TST\\NOTIFY\\NewerFile.cat"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3658,7 +3659,7 @@
 	test(reqStat4==KErrArgument);
 
 	r=TheFs.Rename(_L("\\F32-TST\\NOTIFY\\NewerFile.cat"),_L("\\F32-TST\\NOTIFY\\Original.dog"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3678,7 +3679,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=TheFs.Rename(_L("\\F32-TST\\NOTIFY\\"),_L("\\F32-TST\\NOTIFY_TEMP\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3702,7 +3703,7 @@
 	test(reqStat4==KErrArgument);
 
 	r=TheFs.Rename(_L("\\F32-TST\\NOTIFY_TEMP\\"),_L("\\F32-TST\\NOTIFY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3737,7 +3738,7 @@
 	test(reqStat3==KRequestPending);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\Original.dog"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3755,7 +3756,7 @@
 	test(reqStat3==KRequestPending);
 
 	r=TheFs.Rename(_L("\\F32-TST\\"),_L("\\F32-TEST\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3793,7 +3794,7 @@
 	test(reqStat3==KRequestPending);
 
 	r=TheFs.Rename(_L("\\F32-TEST\\NOTIFY\\"),_L("\\F32-TEST\\NOTIFY_CHANGED\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
@@ -3817,7 +3818,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=TheFs.Rename(_L("\\F32-TEST\\"),_L("\\F32-TST\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
@@ -3844,7 +3845,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=TheFs.Rename(_L("\\F32-TST\\NOTIFY_CHANGED\\"),_L("\\F32-TST\\NOTIFY\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
@@ -3874,7 +3875,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=file.Create(TheFs,_L("\\F32-TST\\NOTIFY\\Munchkin.msg"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3901,7 +3902,7 @@
 	TTime nowTime;
 	nowTime.HomeTime();
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\Munchkin.msg"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(reqStat==KRequestPending);
 	file.SetModified(now);
 	file.Close();
@@ -3928,7 +3929,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=file.Open(TheFs,_L("\\F32-TST\\NOTIFY\\Munchkin.msg"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(0,_L8("Pay no attention to the man behind the curtain"));
 	file.Close();
 	User::WaitForRequest(reqStat);
@@ -3955,7 +3956,7 @@
 	test(reqStat4==KRequestPending);
 
 	r=TheFs.Delete(_L("\\F32-TST\\NOTIFY\\Munchkin.msg"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(reqStat);
 	User::WaitForRequest(reqStat2);
 	User::WaitForRequest(reqStat3);
@@ -3983,14 +3984,14 @@
 
 	RFs fs;
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	TDriveInfo driveInfo;
 	TInt driveNum = EDriveC + SocketToDrive[gSocketNumber];
 
 	// verify TDriveInfo.iType == EMediaHardDisk
 	r = fs.Drive(driveInfo, driveNum);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("iType = %d\n"), driveInfo.iType);
 	test(driveInfo.iType == EMediaHardDisk);
 
@@ -4007,7 +4008,7 @@
 
 	// verify TDriveInfo.iType == EMediaNotPresent
 	r = fs.Drive(driveInfo, driveNum);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("iType = %d\n"), driveInfo.iType);
 	test(driveInfo.iType == EMediaNotPresent);
 
@@ -4024,7 +4025,7 @@
 
 	// verify TDriveInfo.iType == EMediaHardDisk
 	r = fs.Drive(driveInfo, driveNum);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("iType = %d\n"), driveInfo.iType);
 	test(driveInfo.iType == EMediaHardDisk);
 
@@ -4058,7 +4059,7 @@
 	test.Next(_L("Test original behaviour of asynchronous read API"));
 	RFile reader;
 	TInt r=reader.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TBuf8<596> readBuf;
 	reader.Read(0, readBuf, 100, readStat1);
 	User::WaitForRequest(readStat1);
@@ -4068,15 +4069,15 @@
 
 	test.Next(_L("Test asynchronous read fails in EFileShareExclusive mode"));
 	r=reader.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileShareExclusive);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 
 	test.Next(_L("Test asynchronous read fails in EFileShareReadersOnly mode"));
 	r=reader.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileShareReadersOnly);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 
 	test.Next(_L("Test asynchronous read is cancelled when file is closed"));
 	r=reader.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	reader.Read(0, readBuf, 100, readStat1);
 	test(readStat1==KRequestPending);
 	reader.Close();
@@ -4085,7 +4086,7 @@
 
 	test.Next(_L("Test asynchronous read can be cancelled"));
 	r=reader.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	reader.Read(0, readBuf, 100, readStat1);
 	test(readStat1==KRequestPending);
 	reader.ReadCancel(readStat1);
@@ -4098,7 +4099,7 @@
 	// runs (to test whether cancelling still works...)
 	test.Next(_L("Test asynchronous read is cancelled when running at high priority"));
 	r=reader.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RThread	thisThread;
 	thisThread.SetPriority(EPriorityRealTime);
 	reader.Read(0, readBuf, 100, readStat1);
@@ -4112,21 +4113,21 @@
 
 	test.Next(_L("Test asynchronous read is notified due to RFile::SetSize()"));
 	r=reader.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileWrite|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	reader.Read(0, readBuf, 100, readStat1);
 	test(readStat1==KRequestPending);
 	r = reader.SetSize(100);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	User::WaitForRequest(readStat1);
 	test(readStat1==KErrNone);
 	test(readBuf.Length() == 100);
 	r=reader.SetSize(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	reader.Close();
 
 	test.Next(_L("Test asynchronous read is notified due to RFile::Write()"));
 	r=reader.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileWrite|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	reader.Read(0, readBuf, 26, readStat1);
 	test(readStat1==KRequestPending);
 	RFile writer;
@@ -4140,9 +4141,9 @@
 
 	test.Next(_L("Test multiple asynchronous readers notified from separate thread"));
 	r=reader.Open(TheFs,_L("\\F32-TST\\NOTIFY\\NewFile.txt"),EFileRead|EFileReadAsyncAll|EFileWrite|EFileShareAny);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=reader.SetSize(0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	const TInt KReadLen = 26;
 	test.Printf(_L(">Read%d[%d]\n"), 0, KReadLen);
 	reader.Read(0, readBuf, KReadLen, readStat1);
@@ -4154,7 +4155,7 @@
 
 	RThread thread;
 	r=thread.Create(_L("MyThread"),ThreadEntryPoint,KDefaultStackSize,KHeapSize,KHeapSize,(TAny*)ETest12);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	thread.Logon(thrdStat);
 	thread.Resume();
 	thread.Close();
@@ -4227,7 +4228,7 @@
     fileName.Append(_L("TestFile.tst"));
 
     nRes=file.Replace(TheFs, fileName, EFileWrite|EFileRead);
-    test(nRes == KErrNone || nRes ==KErrAlreadyExists);
+    test_Value(nRes, nRes == KErrNone || nRes ==KErrAlreadyExists);
     file.Close();
 
     //-- check that the notifier worked
@@ -4287,7 +4288,7 @@
 		if (r == KErrNotSupported)
 			continue;
 
-		test(r==KErrNone);
+		test_KErrNone(r);
 		TInt sockNum = 0;
 		if (d.IsRemovable(sockNum)>0)
 			{
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_notifydismount.cpp
--- a/kerneltest/f32test/server/t_notifydismount.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_notifydismount.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32hal.h>
@@ -46,12 +47,12 @@
 	test.Next( _L("Test File Handle Closure"));
 
 	TInt r = file.Replace(TheFs, fn, EFileWrite); 
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	r = TheFs.FileSystemName(fsname,aDrvNum);
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	buf = _L8("handle test23456");
 	r = file.Write(buf); 
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	TheFs.NotifyDismount(aDrvNum, stat, EFsDismountForceDismount); 
 	User::WaitForRequest(stat);         
 	test(stat.Int() == KErrNone);
@@ -59,13 +60,13 @@
 	// PDEF137626 Connectivity: Phone reboots automatically when connecting to PC via USB after pl 
 	// Check that writing data to a file when the drive is dismounted doesn't upset the file server
 	r = file.Write(buf); 
-	test(r == KErrNotReady || r == KErrDisMounted); 
+	test_Value(r, r == KErrNotReady || r == KErrDisMounted); 
 
 	// PDEF091956 was a file server fault EFsDriveThreadError when the file 
 	// handle was closed
 	file.Close(); 
 	r = TheFs.MountFileSystem(fsname,aDrvNum);
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 }
 
 
@@ -78,13 +79,13 @@
 	test.Next( _L("Test Request Cancelling") );
 
 	TInt r = TheFs.FileSystemName(fsname,aDrvNum);
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	
 	//***************************************
 	// first test with an open file handle
 	//***************************************
 	r = file.Replace(TheFs, fn, EFileWrite); 
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 
 	// up the priority of this thread so that we can queue 2 requests onto the drive thread - 
 	// i.e. a TFsNotifyDismount and a TFsCloseObject
@@ -106,7 +107,7 @@
 	thisThread.SetPriority(EPriorityNormal);
 
 	r = TheFs.MountFileSystem(fsname,aDrvNum);
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 
 
 	//***************************************
@@ -116,11 +117,11 @@
 	RDir dir;
 	TFileName sessionPath;
 	r=TheFs.SessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName path=_L("?:\\*");
 	path[0]=sessionPath[0];
 	r=dir.Open(TheFs,path,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	thisThread.SetPriority(EPriorityRealTime);
 	TheFs.NotifyDismount(aDrvNum, stat, EFsDismountForceDismount); 
@@ -132,7 +133,7 @@
 	thisThread.SetPriority(EPriorityNormal);
 
 	r = TheFs.MountFileSystem(fsname,aDrvNum);
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	}
 
 
@@ -146,25 +147,25 @@
 
 	TInt size = 0;
 	TInt r = file.Replace(TheFs, fn, EFileWrite); 
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	r = TheFs.FileSystemName(fsname,aDrvNum);
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	buf = _L8("size test9123456"); 
 	r = file.Write(buf); 
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	r = file.Flush(); 
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	r = file.Write(buf); 
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	TheFs.NotifyDismount(aDrvNum, stat, EFsDismountForceDismount); 
 	User::WaitForRequest(stat);         
 	test(stat.Int() == KErrNone);
 	file.Close();
 	r = TheFs.MountFileSystem(fsname,aDrvNum);
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	file.Open(TheFs, fn, EFileWrite);
 	r = file.Size(size); 
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	// PDEF091956 was, for example, a file size of 16 rather than 32. new file sizes were
 	// not flushed for the forced dismount. this was only a problem with rugged fat off.
 	test(size == 32);
@@ -173,13 +174,13 @@
 	test.Next( _L("Test File Size Flushing with EFsDismountNotifyClients") );
 	size = 0;
 	r = file.Replace(TheFs, fn, EFileWrite); 
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 
 	r = file.Write(buf); 
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 
 	r = file.Write(buf); 
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 
 	TheFs.NotifyDismount(aDrvNum, stat, EFsDismountNotifyClients); 
 	User::WaitForRequest(stat);
@@ -188,10 +189,10 @@
 	file.Close();
 
 	r = TheFs.MountFileSystem(fsname,aDrvNum);
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	file.Open(TheFs, fn, EFileWrite);
 	r = file.Size(size); 
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 	test(size == 32);
 	file.Close();
 	}
@@ -228,7 +229,7 @@
 	TInt drvNum, r;
 
 	r=TheFs.CharToDrive(gDriveToTest,drvNum);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 
 	// dismounting with file system extension present doesn't seem to work
@@ -268,11 +269,11 @@
 		TUint8 isRugged;
 		TPtr8 pRugged(&isRugged,1,1);
 		r=TheFs.ControlIo(drvNum,KControlIoIsRugged,pRugged);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		if(isRugged)
 			{
 			r=TheFs.ControlIo(drvNum,KControlIoRuggedOff);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			}
 
 		TestFileSizeFlushing(drvNum);
@@ -281,7 +282,7 @@
 		if(isRugged)
 			{
 			r=TheFs.ControlIo(drvNum,KControlIoRuggedOn);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			}	
 		}
 	else
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_open.cpp
--- a/kerneltest/f32test/server/t_open.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_open.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -74,18 +75,18 @@
 	RFile file1,file2,file3;
 	
 	TInt r=file1.Open(TheFs,filename1,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file2.Open(TheFs,filename2,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file3.Open(TheFs,filename1,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	CFileList* list=NULL;
 	TOpenFileScan fileScan(TheFs);
 	TRAP(r,fileScan.NextL(list));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	if (gRunByBatch)
 		{
@@ -133,24 +134,24 @@
 
 	RFs fs1,fs2,fs3,fs4;
 	TInt r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs3.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs4.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile file1,file2,file3;
 	
 	r=file1.Open(fs2,filename1,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file2.Open(fs2,filename2,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file3.Open(fs2,filename1,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	CFileList* list;
 	TOpenFileScan fileScan(TheFs);
@@ -203,33 +204,33 @@
 
 	RFs fs1,fs2,fs3,fs4;
 	TInt r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs3.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs4.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile file1,file2,file3;
 	
 	r=file1.Open(fs2,filename1,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file2.Open(fs2,filename2,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file3.Open(fs2,filename1,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file1.Open(fs4,filename1,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file2.Open(fs4,filename2,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=file3.Open(fs4,filename1,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	CFileList* list;
 	TOpenFileScan fileScan(TheFs);
@@ -296,41 +297,41 @@
 
 	RFs fs1,fs2,fs3,fs4;
 	TInt r=fs1.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs2.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs3.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=fs4.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RDir dir1,dir2,dir3,dir4;
 	r=dir1.Open(TheFs,dirname1,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir2.Open(TheFs,dirname1,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir3.Open(TheFs,dirname1,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir4.Open(TheFs,dirname1,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile file1,file2,file3;
 	r=file1.Open(fs2,filename1,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file2.Open(fs2,filename2,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file3.Open(fs2,filename1,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	RDir dir5,dir6,dir7,dir8;
 	r=dir5.Open(fs4,dirname1,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir6.Open(fs4,dirname1,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir7.Open(fs4,dirname1,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir8.Open(fs4,dirname1,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	CFileList* list;
 	TOpenFileScan fileScan(TheFs);
@@ -385,21 +386,21 @@
 
 	RFile file1,file2,file3;
 	TInt r=file1.Open(TheFs,filename1,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file2.Open(TheFs,filename2,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file3.Open(TheFs,filename1,EFileRead|EFileShareReadersOnly);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	RDir dir1,dir2,dir3,dir4;
 	r=dir1.Open(TheFs,dirname1,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir2.Open(TheFs,dirname1,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir3.Open(TheFs,dirname1,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=dir4.Open(TheFs,dirname1,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	CFileList* list;
 	TOpenFileScan fileScan(TheFs);
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_parse.cpp
--- a/kerneltest/f32test/server/t_parse.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_parse.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -33,7 +34,7 @@
 	TBuf<16> defaultPath(_L("C:\\"));
 	TParse parser;
 	TInt r=parser.Set(_L("\\WWW\\XXX\\YYY\\ZZZ\\AAA"),&relatedFiles,&defaultPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("C:\\WWW\\XXX\\YYY\\ZZZ\\AAA.CCC"));
 	test(parser.Drive()==_L("C:"));
 	test(parser.Path()==_L("\\WWW\\XXX\\YYY\\ZZZ\\"));
@@ -51,7 +52,7 @@
 	test(parser.IsNameWild()==EFalse);
 	test(parser.IsExtWild()==EFalse);
 	r=parser.SetNoWild(_L("\\WWW\\XXX\\YYY\\ZZZ\\AAA.EXT"),&relatedFiles,&defaultPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.PopDir()==KErrNone);
 	test(parser.AddDir(_L("BBB"))==KErrNone);
 	test.End();
@@ -67,21 +68,21 @@
 	TParse parser;
 	TInt r=parser.Set(_L("\\WWW\\XXX\\YYY\\ZZZ\\"),NULL,NULL);
 //	TParsePtrC parser(_L("\\WWW\\XXX\\YYY\\ZZZ\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=parser.PopDir();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.Path()==_L("\\WWW\\XXX\\YYY\\"));
 	r=parser.PopDir();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.Path()==_L("\\WWW\\XXX\\"));
 	r=parser.PopDir();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.Path()==_L("\\WWW\\"));
 	r=parser.PopDir();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.Path()==_L("\\"));
 	r=parser.PopDir();
-	test(r==KErrGeneral);
+	test_Value(r, r == KErrGeneral);
 //
 	test(parser.Set(_L("C:\\Documents\\.TXT"),NULL,NULL)==KErrNone);
 	test(parser.PopDir()==KErrNone);
@@ -103,31 +104,31 @@
     TPtrC x2=_L("X:\\");
     TPtrC z=_L("Z:");
 	TInt r=parser.Set(_L("Z:\\Hello"),&one,&null);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("Z:\\Hello"));
     TPtrC sht=_L("*.SHT");
     r=parser.Set(_L("Z:"),&sht,&x);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("Z:*.SHT"));
 	r=parser.Set(_L("Hello"),&z,&x2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("Z:\\Hello"));
 	r=parser.Set(_L("W:\\Hello"),&z,&x2);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("W:\\Hello"));
     TPtrC abcdefg=_L("abcdefg");
     TPtrC onetwo=_L("X:\\ONE\\TWO\\.CCC");
 	r=parser.Set(_L("W:"),&abcdefg,&onetwo);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("W:\\ONE\\TWO\\abcdefg.CCC"));
     TPtrC y=_L("Y:");
     TPtrC xhello=_L("X:\\HELLO\\");
     r=parser.Set(_L("World"),&y,&xhello);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("Y:\\HELLO\\World"));
     TPtrC xhelloext=_L("X:\\HELLO\\.EXT");
     r=parser.Set(_L("World"),&y,&xhelloext);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("Y:\\HELLO\\World.EXT"));
 	test.End();
 	}
@@ -143,24 +144,24 @@
     TPtrC xone=_L("X:\\ONE\\");
     TPtrC y=_L("Y:\\");
 	TInt r=parser.Set(_L("Z:\\Hello"),&xone,&y);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("Z:\\Hello"));
     TPtrC zone=_L("Z:\\ONE\\");
     TPtrC xnew=_L("X:\\NEW\\");
     r=parser.Set(_L("\\Hello"),&zone,&xnew);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("Z:\\Hello"));
     TPtrC aone=_L("A:\\ONE\\");
     TPtrC anew=_L("A:\\NEW\\");
     r=parser.Set(_L("A:Hello"),&aone,&anew);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("A:\\ONE\\Hello"));
     TPtrC a=_L("A:\\");
     r=parser.Set(_L("Hello"),&a,&xnew);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("A:\\Hello"));
 	r=parser.Set(_L("Hello"),&aone,&xnew);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("A:\\ONE\\Hello"));
 	test.End();
 	}
@@ -175,9 +176,9 @@
 	test.Start(_L("Test errors returned by illegal paths"));
 	TParse parser;
 	TInt r=parser.Set(_L("FOO\\"),NULL,NULL);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=parser.Set(_L("C:\\FOO\\\\"),NULL,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test.End();
 	}
 
@@ -303,67 +304,67 @@
 	TBuf<16> pathBuf=_L("\\PATH\\");
 	
 	TInt r=parser.Set(pathBuf,NULL,&nameBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("\\PATH\\   name.txt"));
 	r=parser.Set(_L(""),&nameBuf,&pathBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("\\PATH\\   name.txt"));
 	r=parser.Set(_L("   name.txt"),NULL,&pathBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("\\PATH\\   name.txt"));
 	r=parser.Set(nameBuf,&pathBuf,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("\\PATH\\   name.txt"));
 	
 	TBuf<16> badPath=_L("   \\PATH\\");
 	r=parser.Set(_L("C:\\"),NULL,&badPath);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	r=parser.Set(_L("C:\\"),&badPath,NULL);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 
 	TBuf<16> spacePath=_L("\\  PATH\\");
 	r=parser.Set(_L("C:"),&nameBuf,&spacePath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("C:\\  PATH\\   name.txt"));
 
 	TBuf<32> spacename=_L("\\  name   .   txt  ");
 	r=parser.Set(_L("C:"),&spacename,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("C:\\  name   .   txt"));
 
 // Illegal (?) values
 
 	TBuf<16> pureSpace=_L("     ");
 	r=parser.Set(_L("C:\\NAME\\"),NULL,&pureSpace);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("C:\\NAME\\")); // Trims right off name
 	r=parser.Set(_L("C:\\NAME\\   "),NULL,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("C:\\NAME\\"));
 
 	TBuf<16> spacePlusExt=_L("    .   ext  ");
 	r=parser.Set(_L("C:\\NAME\\"),NULL,&spacePlusExt);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("C:\\NAME\\    .   ext")); // Trims right off ext
 	r=parser.Set(_L("C:\\NAME\\    .   ext   "),NULL,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("C:\\NAME\\    .   ext"));
 
 	TBuf<32> pathSpace=_L("\\asdf\\zxcv\\   \\asdf\\");
 	r=parser.Set(_L("C:"),NULL,&pathSpace);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("C:\\asdf\\zxcv\\   \\asdf\\")); // Leaves spaces in path
 	r=parser.Set(_L("C:\\NAME\\ \\alt.sdf"),NULL,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("C:\\NAME\\ \\alt.sdf"));
 
 
 	TBuf<32> zeroPath=_L("\\asdf\\wqer\\\\asdf\\");
 	r=parser.Set(_L("NAME.TXT"),NULL,&zeroPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("\\asdf\\wqer\\\\asdf\\NAME.TXT")); // Leaves zerolength path
 	r=parser.Set(_L("C:\\NAME\\\\alt.sdf"),NULL,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parser.FullName()==_L("C:\\NAME\\\\alt.sdf"));
 	test.End();
 	}
@@ -383,10 +384,10 @@
 
 	RFs fs;
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TParse parse;
 	r=fs.Parse(testPath,parse);
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 	fs.Close();
 
 	TFileName longFileName;
@@ -396,21 +397,21 @@
 	longFileName[0]='\\';
 	longFileName[253]='\\';
 	r=parse.Set(longFileName,&test_string,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=parse.PopDir();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	longFileName[123]='\\';
 	r=parse.Set(longFileName,&test_string,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=parse.PopDir();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TPtrC startPath((TText*)longFileName.Ptr(),124);
 	test(parse.Path()==startPath);
 
 	TPtrC endPath((TText*)longFileName.Ptr()+124,252-124+1);
 	r=parse.AddDir(endPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(parse.Path()==longFileName);
 	}
 
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_pwstr.cpp
--- a/kerneltest/f32test/server/t_pwstr.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_pwstr.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -18,6 +18,7 @@
 
 //#include <p32mmc.h>
 
+#define __E32TEST_EXTENSION__
 #include <e32test.h>
 #include <f32fsys.h>
 #include <e32def.h>
@@ -389,9 +390,13 @@
 		wStore.SetLength(i);
 		TInt r(TBLD.WritePasswordData(wStore));
 		if (i == 0 || i == mapSizes[0][0] || i == mapSizes[0][0] + mapSizes[1][1])
-			test(r == KErrNone);
+			{
+			test_KErrNone(r);
+			}
 		else
-			test(r == KErrCorrupt && TBLD.PasswordStoreLengthInBytes() == 0);
+			{
+			test_Value(r, r == KErrCorrupt && TBLD.PasswordStoreLengthInBytes() == 0);
+			}
 		}
 
 	test.Next(_L("Exceeding password store size"));	
@@ -409,9 +414,13 @@
 		const TInt r = TBLD.WritePasswordData(wStore);
 		test.Printf(_L("WritePasswordData() --> ret=%d\n"), r);
 	 	if(n==KMaxNumOfStoreEntries)
-	 		test(r == KErrOverflow);
+			{
+	 		test_Value(r, r == KErrOverflow);
+			}
 	 	else
-	 		test(r == KErrNone);	
+			{
+	 		test_KErrNone(r);
+			}
 		}
 
 
@@ -461,7 +470,7 @@
 
 				if ((r = TBLD.WritePasswordData(wStore)) != KErrNone)
 					{
-					test(r == KErrNoMemory);
+					test_Value(r, r == KErrNoMemory);
 					test(TBLD.PasswordStoreLengthInBytes() == 0);
 					}
 				else
@@ -600,7 +609,7 @@
 		mp.iCIDIdx = cidIdx;
 		mp.iPWDIdx = pwdIdx;
 		TRAP(r, aMP->InsertL(0, mp));
-		test(r == KErrNone);
+		test_KErrNone(r);
 
 		iBIdx += KMMCCIDLength + sizeof(TInt32) + pwd_len;
 		}
@@ -743,7 +752,7 @@
 	TInt r = AccessDisk();
 	if (r != KErrLocked)
 		test.Printf(_L("AccessDisk() returned %d\n"), r);
-	test(r == KErrLocked);
+	test_Value(r, r == KErrLocked);
 	test(TBLD.Unlock(aPWD, aStore) == KErrNone);
 	}
 
@@ -1316,7 +1325,7 @@
 	r = fs.LockDrive(RFsDNum, nulPWrd, oldPWrd, EFalse);
 	if (r != KErrNone)
 		test.Printf(_L("RFs::LockDrive() returned %d\n"), r);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	RemountMedia();		// card is now locked
 
@@ -1329,7 +1338,7 @@
 	r = fmt.Open(fs, driveName, EHighDensity, stepPkg());
 	if (r != KErrLocked)
 		test.Printf(_L("RFormat::Next() returned %d\n"), r);
-	test(r == KErrLocked);
+	test_Value(r, r == KErrLocked);
 
 	test.Printf(_L("\n"));
 	fmt.Close();
@@ -1339,7 +1348,7 @@
 	r = fmt.Open(fs, driveName, EHighDensity | EForceErase, stepPkg());
 	if (r != KErrNone)
 		test.Printf(_L("RFormat::Open() returned %d\n"), r);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	
 	while (stepPkg() > 0)
 		{
@@ -1388,7 +1397,7 @@
 	test.Next(_L("lock card"));
 	test.Next(_L("assign test password"));
 	r = TBLD.SetPassword(nulPWrd, testPassword, EFalse);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	RemountMedia();		// card is now locked
 
@@ -1399,7 +1408,7 @@
 	r = TBLD.Caps(driveCapsPkg);
 	test.Printf(_L("Caps() returned %d , iMediaAtt %08x\n"), r, driveCaps.iMediaAtt);
 
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test ((driveCaps.iMediaAtt & KMediaAttLocked) != 0);
 
 	// Write correct password to store
@@ -1413,14 +1422,14 @@
 
 	test.Printf(_L("WritePasswordData() returned %d\n"), r);
 	
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	// test Caps() reports that card is unlocked
 	test.Next(_L("test card is unlocked"));
 	r = TBLD.Caps(driveCapsPkg);
 	test.Printf(_L("Caps() returned %d , iMediaAtt %08x\n"), r, driveCaps.iMediaAtt);
 
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test ((driveCaps.iMediaAtt & KMediaAttLocked) == 0);
 
 	// Clear the password, remount and test card is unlocked
@@ -1433,7 +1442,7 @@
 	r = TBLD.Caps(driveCapsPkg);
 	test.Printf(_L("Caps() returned %d , iMediaAtt %08x\n"), r, driveCaps.iMediaAtt);
 
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test ((driveCaps.iMediaAtt & KMediaAttLocked) == 0);
 
 
@@ -1604,7 +1613,7 @@
     TDriveInfo info;
 
 	TInt r = aFs.Drive(info, aTheMemoryCardDrive);
-	test (r == KErrNone);
+	test_KErrNone(r);
 
 	return (info.iMediaAtt & KMediaAttLocked)?(TBool)ETrue:(TBool)EFalse;
 	}
@@ -1657,7 +1666,7 @@
 
 	test.Next(_L("Locking card (Successful)"))	;
 	r = TestLockCard(fs, RFsDNum, oldpassword, password, ETrue);
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 		
 	test(!TestLocked(fs, RFsDNum));	// not locked yet as stack hasn't powered down
 
@@ -1665,7 +1674,7 @@
 	r = TBLD.Caps(driveCapsPkg);
 	test.Printf(_L("\tCaps() returned %d , iMediaAtt %08x\n"), r, driveCaps.iMediaAtt);
 
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test ((driveCaps.iMediaAtt & KMediaAttLocked) == 0);
 
 	WaitForPowerDownUnlock(fs, RFsDNum);
@@ -1674,19 +1683,19 @@
 	r = TBLD.Caps(driveCapsPkg);
 	test.Printf(_L("\tCaps() returned %d , iMediaAtt %08x\n"), r, driveCaps.iMediaAtt);
 
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test ((driveCaps.iMediaAtt & KMediaAttLocked) == 0);
 	
 	test.Next(_L("Clear password (Successful)"));
 	r = TestClearPassword(fs, RFsDNum, password);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 // Lock card (without password in store)
 	test.Next(_L("Locking card - Password NOT Stored"));
 
 	test.Next(_L("Locking card (Successful)"));
 	r = TestLockCard(fs, RFsDNum, oldpassword, password, EFalse);
-	test(r == KErrNone); 
+	test_KErrNone(r); 
 		
 	test(!TestLocked(fs, RFsDNum));	// not locked yet as stack hasn't powered down
 	
@@ -1694,7 +1703,7 @@
 	r = TBLD.Caps(driveCapsPkg);
 	test.Printf(_L("\tCaps() returned %d , iMediaAtt %08x\n"), r, driveCaps.iMediaAtt);
 
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test ((driveCaps.iMediaAtt & KMediaAttLocked) == 0);
 
 	WaitForPowerDownLock(fs, RFsDNum);
@@ -1703,7 +1712,7 @@
 	r = TBLD.Caps(driveCapsPkg);
 	test.Printf(_L("\tCaps() returned %d , iMediaAtt %08x\n"), r, driveCaps.iMediaAtt);
 
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test ((driveCaps.iMediaAtt & KMediaAttLocked) != 0);
 	
 // Unlock card
@@ -1711,14 +1720,14 @@
 	
 	test.Next(_L("Unlocking card (Successful)"))	;
 	r = TestUnlockCard(fs, RFsDNum, password, ETrue);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test (!TestLocked(fs, RFsDNum)); // not locked as stack hasn't powered down
 	
 	test.Next(_L("Card reports unlocked - before PowerDown"));
 	r = TBLD.Caps(driveCapsPkg);
 	test.Printf(_L("\tCaps() returned %d , iMediaAtt %08x\n"), r, driveCaps.iMediaAtt);
 
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test ((driveCaps.iMediaAtt & KMediaAttLocked) == 0);
 
 	WaitForPowerDownUnlock(fs, RFsDNum);
@@ -1727,12 +1736,12 @@
 	r = TBLD.Caps(driveCapsPkg);
 	test.Printf(_L("\tCaps() returned %d , iMediaAtt %08x\n"), r, driveCaps.iMediaAtt);
 
-	test (r == KErrNone);
+	test_KErrNone(r);
 	test ((driveCaps.iMediaAtt & KMediaAttLocked) == 0);
 	
 	test.Next(_L("Clearing Password (Successful)"));
 	r = TestClearPassword(fs, RFsDNum, password);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	
 	fs.Close();
 	
@@ -1757,22 +1766,22 @@
 	TMediaPassword wrongpwd = (TUint8*) "failtest";
 
 	r = TestLockCard(fs, RFsDNum, oldpassword, newpassword, EFalse);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test(!TestLocked(fs, RFsDNum));	// not locked yet as stack hasn't powered down
 
 	test.Next(_L("test unlocking fails if still powered up"));
 	r = TestUnlockCard(fs, RFsDNum, newpassword, EFalse);
-	test(r == KErrAlreadyExists);		// already unlocked (as stack won't have powered down yet)
+	test_Value(r, r == KErrAlreadyExists);		// already unlocked (as stack won't have powered down yet)
 	test (!TestLocked(fs, RFsDNum));
 
 	test.Next(_L("test clearing succeeds if still powered up"));
 	r = TestClearPassword(fs, RFsDNum, newpassword);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test(!TestLocked(fs, RFsDNum));
 	
 	test.Next(_L("test locking card again"));
 	r = TestLockCard(fs, RFsDNum, oldpassword, newpassword, EFalse);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test(!TestLocked(fs, RFsDNum));	// not locked yet as stack hasn't powered down
 
 	WaitForPowerDownLock(fs, RFsDNum);
@@ -1788,17 +1797,17 @@
 	sessionPath=_L("?:\\");
 	TChar driveLetter;
 	r = fs.DriveToChar(RFsDNum,driveLetter);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	sessionPath[0]=(TText)driveLetter;
 	r = fs.CheckDisk(sessionPath);
-	test(r == KErrNone || r == KErrLocked);
+	test_Value(r, r == KErrNone || r == KErrLocked);
 	WaitForPowerDownLock(fs, RFsDNum);
 
 
 	// DEF111700: Formatting a locked SD/MMC leaves it in a bad state (causes panics later)
 	// This was caused by format calling TDrive::MountMedia(ETrue) and then not dismounting
 	r = fs.RemountDrive(RFsDNum);
-	test (r == KErrNone);
+	test_KErrNone(r);
 	RFormat fmt;
 	TPckgBuf<TInt> stepPkg;
 	TDriveUnit driveUnit(RFsDNum);
@@ -1807,63 +1816,63 @@
 	r = fmt.Open(fs, driveName, EHighDensity, stepPkg());
 	if (r != KErrLocked)
 		test.Printf(_L("RFormat::Next() returned %d\n"), r);
-	test(r == KErrLocked);
+	test_Value(r, r == KErrLocked);
 	test.Printf(_L("\n"));
 	fmt.Close();
 	r = fs.CheckDisk(sessionPath);
-	test(r == KErrLocked);
+	test_Value(r, r == KErrLocked);
 
 
 	test.Next(_L("test unlocking fails after powered down & unlocked with wrong password"));
 	r = TestUnlockCard(fs, RFsDNum, wrongpwd, EFalse);
-	test(r == KErrAccessDenied);		// unlocked should now fail
+	test_Value(r, r == KErrAccessDenied);		// unlocked should now fail
 
 	test.Next(_L("test unlocking succeeds for correct password after powered down & locked"));
 	r = TestUnlockCard(fs, RFsDNum, newpassword, EFalse);
-	test(r == KErrNone);		// unlocked should now succeed
+	test_KErrNone(r);		// unlocked should now succeed
 
 	test.Next(_L("test unlocking fails after successful unlock"));
 	r = TestUnlockCard(fs, RFsDNum, wrongpwd, EFalse);
-	test(r == KErrAlreadyExists);		// unlocked should now succeed
+	test_Value(r, r == KErrAlreadyExists);		// unlocked should now succeed
 	test(!TestLocked(fs, RFsDNum));	// not locked yet as stack hasn't powered down
 
 	test.Next(_L("test locking card with new password (with wrong password as old password)"));
 	r = TestLockCard(fs, RFsDNum, wrongpwd, newpassword, EFalse);
-	test(r == KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 	test(!TestLocked(fs, RFsDNum));	// not locked yet as stack hasn't powered down
 
 	test.Next(_L("test locking card with new password (with right password as old password)"));
 	r = TestLockCard(fs, RFsDNum, newpassword, wrongpwd, EFalse);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test(!TestLocked(fs, RFsDNum));	// not locked yet as stack hasn't powered down
 
 	WaitForPowerDownLock(fs, RFsDNum);
 	
 	test.Next(_L("test clearing fails with wrong password if powered down & locked"));
 	r = TestClearPassword(fs, RFsDNum, newpassword); // Note: we have set the wrong password as the new password
-	test(r == KErrAccessDenied);
+	test_Value(r, r == KErrAccessDenied);
 	test(TestLocked(fs, RFsDNum));
 
 	test.Next(_L("test clearing succeeds with right password if powered down & locked"));
 	r = TestClearPassword(fs, RFsDNum, wrongpwd);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test(!TestLocked(fs, RFsDNum));
 
 	test.Next(_L("test locking card again"));
 	r = TestLockCard(fs, RFsDNum, oldpassword, newpassword, EFalse);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test(!TestLocked(fs, RFsDNum));		// not locked yet as stack hasn't powered down
 
 	test.Next(_L("test forced erase fails if still powered up"));
 	r = ExecuteForcedEraseTestL(fs, RFsDNum);
-	test(r == KErrAccessDenied);		// fails because card is not yet locked
+	test_Value(r, r == KErrAccessDenied);		// fails because card is not yet locked
 
 	WaitForPowerDownLock(fs, RFsDNum);
 
 
 	test.Next(_L("test forced erase succeeds if powered down & locked"));
 	r = ExecuteForcedEraseTestL(fs, RFsDNum);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	fs.Close();
 	test.End();
@@ -1884,16 +1893,16 @@
 	sessionPath=_L("?:\\");
 	TChar driveLetter;
 	TInt r=fs.DriveToChar(RFsDNum,driveLetter);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	sessionPath[0]=(TText)driveLetter;
 	r=fs.SetSessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
     
 	TInt nRes;
     TDriveInfo dInfo;
 
     nRes = fs.Drive(dInfo, RFsDNum);
-	test(nRes == KErrNone);
+	test_KErrNone(nRes);
 	if (!(dInfo.iMediaAtt & KMediaAttLockable))
 		{
 		test.Printf(_L("Drive %d is not lockable %d\n"), RFsDNum);
@@ -1905,7 +1914,7 @@
 	TMediaPassword oldPassword;
 	TMediaPassword newPassword = (TUint8*) "salasana";
     nRes = fs.LockDrive(RFsDNum, oldPassword, newPassword, EFalse );
-	test(nRes == KErrNone);
+	test_KErrNone(nRes);
 
 	WaitForPowerDownLock(fs, RFsDNum);
 
@@ -1924,7 +1933,7 @@
     test(reqStatNotify1.Int() == KErrNone);
 
 	r = TestClearPassword(fs, RFsDNum, newPassword);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test(!TestLocked(fs, RFsDNum));
 	
 	
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_rand.cpp
--- a/kerneltest/f32test/server/t_rand.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_rand.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32math.h>
@@ -43,7 +44,7 @@
 	testBuf.SetLength(testBuf.MaxSize());
 	Mem::Fill(bufPtr,testBuf.MaxSize(),aCluster);
 	TInt r=aFile.Write(testBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void SeekToCluster(RFile& aFile,TInt aCluster)
@@ -53,7 +54,7 @@
 	{
 	TBuf8<508> seekBuf(508);
 	TInt r=aFile.Read(aCluster*testBuf.MaxSize(),seekBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(seekBuf[0]==(TUint8)aCluster && seekBuf[507]==(TUint8)aCluster);
 	}
 
@@ -64,10 +65,10 @@
 	{
 	TBuf8<508> seekBuf(508);
 	TInt r=aFile.Read(aCluster1*testBuf.MaxSize(),seekBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(seekBuf[0]==(TUint8)aCluster1 && seekBuf[507]==(TUint8)aCluster1);
 	r=aFile.Read(aCluster2*testBuf.MaxSize(),seekBuf);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(seekBuf[0]==(TUint8)aCluster2 && seekBuf[507]==(TUint8)aCluster2);
 	}
 
@@ -100,9 +101,9 @@
 	RFile f1,f2;
 //
 	TInt r=f1.Replace(TheFs,_L("BIGFILE1.TST"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f2.Replace(TheFs,_L("BIGFILE2.TST"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //
 	TInt maxListLength=4;
 	TInt i=0,k=0;
@@ -147,9 +148,9 @@
 	f1.Close();
 	f2.Close();
 	r=TheFs.Delete(_L("BIGFile1.tst"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("BIGFile2.tst"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckDisk();
 	}
 
@@ -163,9 +164,9 @@
 	RFile f1,f2;
 //
 	TInt r=f1.Replace(TheFs,_L("BIGFILE1.TST"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f2.Replace(TheFs,_L("BIGFILE2.TST"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 //
 	WriteCluster(f1,0);
 	WriteCluster(f1,1);
@@ -182,9 +183,9 @@
 	f1.Close();
 	f2.Close();
 	r=TheFs.Delete(_L("BIGFile1.tst"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.Delete(_L("BIGFile2.tst"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CheckDisk();
 	}
 
@@ -200,10 +201,10 @@
 	TInt i=0,j=0;
 //
 	TInt r=f1.Replace(TheFs,_L("BIGFILE1.TST"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	r=f1.SetSize(65534);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	for(i=0;i<=15;i++)
 		WriteCluster(f1,i);
@@ -217,7 +218,7 @@
 
 	test.Next(_L("Increase Size"));
 	r=f1.SetSize(1048577);
-	test(r==KErrNone || r==KErrDiskFull);
+	test_Value(r, r == KErrNone || r==KErrDiskFull);
 	if (r==KErrDiskFull)
 		{
 		test.Printf(_L("File too big\n"));
@@ -235,7 +236,7 @@
 
 	TInt newPos=8192;
 	r=f1.Seek(ESeekStart,newPos);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Write more data"));
 	for(i=16;i<83;i++)
@@ -251,7 +252,7 @@
 
 	test.Next(_L("Reduce file size"));
 	r=f1.SetSize(135000);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Test data still present"));
 	for (j=0;j<200;j++)
@@ -284,7 +285,7 @@
 	{
 
 	TInt r=iFile.Read(0,iData);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 void TFileReader::Next(TUint8& aVal,TInt& aLength)
@@ -296,7 +297,7 @@
 	if (iPos==iData.Length())
 		{
 		TInt r=iFile.Read(iData);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		iPos=0;
 		if (iData.Length()==0)
 			{
@@ -426,13 +427,13 @@
 	HBufC8* dataBuf=HBufC8::NewL(KMaxBufferLength);
 
 	TInt r=f[0].Replace(TheFs,_L("TEST1.DAT"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f[1].Replace(TheFs,_L("TEST2.DAT"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f[2].Replace(TheFs,_L("TEST3.DAT"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=f[3].Replace(TheFs,_L("TEST4.DAT"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 	TInt size=0;
 	TInt iteration=0;
@@ -457,7 +458,7 @@
 			TInt s=len*mult[fileNum];
 			TInt filePos=pos*mult[fileNum];
 			r=f[fileNum].Seek(ESeekStart,filePos);
-			test(r==KErrNone);
+			test_KErrNone(r);
 
 			while(s>0)
 				{
@@ -471,7 +472,7 @@
 			
 				if (r==KErrDiskFull)
 					goto End;
-				test(r==KErrNone);
+				test_KErrNone(r);
 				s-=l;
 				}
 			
@@ -492,7 +493,7 @@
 				{
 				TInt fileNum=(order+i)%KMaxFiles;
 				r=f[fileNum].SetSize(size*mult[fileNum]);
-				test(r==KErrNone);
+				test_KErrNone(r);
 				}
 			CheckFileContents(&f[0]);
 			}
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_rcache.cpp
--- a/kerneltest/f32test/server/t_rcache.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_rcache.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -434,7 +434,7 @@
 
 	// delete file first to ensure it's contents are not in the cache (file may be be on the closed file queue)
 	r = fs.Delete(aFile);
-	test(r == KErrNone || r == KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 
 	r = aFileWrite.Replace(fs,aFile,EFileShareAny|EFileWrite|EFileReadDirectIO|EFileWriteDirectIO);
 	test_KErrNone(r);
@@ -556,7 +556,7 @@
 	RFile file;
 
 	TInt r = fs.Connect();
-	test (r == KErrNone);
+	test_KErrNone(r);
 
 	startTime.HomeTime();
 
@@ -695,7 +695,7 @@
 #endif
 
 	r = DeleteAll(gSessionPath);
-	test(r == KErrNone || r == KErrInUse);
+	test_Value(r, r == KErrNone || r == KErrInUse);
 
 	// Simple case filling/reading the cache from different threads
 	test.Next(_L("File fits in: read sync (another thread) + read sync + read async\n"));
@@ -715,7 +715,7 @@
 
 	buf = _L("Read File");
 	r = gThread2.Create(buf,ReadFileT,KDefaultStackSize,KHeapSize,KMaxHeapSize,NULL);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	gThread2.Resume();
 	client.Wait();
@@ -737,7 +737,7 @@
 #endif
 
 	r = DeleteAll(gSessionPath);
-	test(r == KErrNone || r == KErrInUse);
+	test_Value(r, r == KErrNone || r == KErrInUse);
 
 
 	test.Next(_L("File doesn't fit in: read sync + read sync + read async\n"));
@@ -760,7 +760,7 @@
 
 
 	r = DeleteAll(gSessionPath);
-	test(r == KErrNone || r == KErrInUse);
+	test_Value(r, r == KErrNone || r == KErrInUse);
 
 
 	test.Next(_L("File doesn't fit in: read sync (another thread) + read sync + read async\n"));
@@ -780,7 +780,7 @@
 
 	buf = _L("Read Big File");
 	r = gThread2.Create(buf,ReadFileT,KDefaultStackSize,KHeapSize,KMaxHeapSize,NULL);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	gThread2.Resume();
 	client.Wait();
@@ -802,7 +802,7 @@
 	#endif
 
 	r = DeleteAll(gSessionPath);
-	test(r == KErrNone || r == KErrInUse);
+	test_Value(r, r == KErrNone || r == KErrInUse);
 
 	test.End();
 }
@@ -823,13 +823,13 @@
 	test(res2 == KErrNone && lBufSec != NULL);
 	lBufReadPtr.Set(lBufSec->Des());
 
-	test(r == KErrNone);
+	test_KErrNone(r);
 	r = fs.SetSessionPath(gSessionPath);
 
 
 	// delete file first to ensure it's contents are not in the cache (file may be be on the closed file queue)
 	r = fs.Delete(gFirstFile);
-	test(r == KErrNone || r == KErrNotFound);
+	test_Value(r, r == KErrNone || r == KErrNotFound);
 
 	r = file.Create(fs,gFirstFile,EFileShareAny|EFileWrite|EFileReadDirectIO|EFileWriteDirectIO);
 
@@ -944,7 +944,7 @@
 
 	TBuf<20> buf2 = _L("Write Two Files 2");
 	r = gThread2.Create(buf2,WriteFileT2,KDefaultStackSize*2,KHeapSize,KMaxHeapSize,NULL);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	gThread1.Resume();
 	gThread2.Resume();
@@ -984,10 +984,10 @@
 	RTest test(_L("T_RCACHE"));
 	RFs fs;
 	TInt r = fs.Connect();
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	r = fs.SetSessionPath(gSessionPath);
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	r = WriteFile(fs, gSecondFile, gSecondFileSize, KBlockSize, gBufWritePtr, EThreadSignal);
 	test_KErrNone(r);
@@ -1069,7 +1069,7 @@
 	TPtr8 dummyPtr(NULL, 0);
 
 	TRAPD(res,dummy = HBufC8::NewL(4));
-	test(res == KErrNone && dummy != NULL);
+	test_Value(res, res== KErrNone && dummy != NULL);
 
 	dummyPtr.Set(dummy->Des());
 	FillBuffer(dummyPtr, 4, '1');
@@ -1297,7 +1297,7 @@
 	HBufC8* bigBuf = NULL;
 	const TInt KBigBifferSize = 32 * 1024;
 	TRAPD(res,bigBuf = HBufC8::NewL(KBigBifferSize));
-	test(res == KErrNone && bigBuf != NULL);
+	test_Value(res, res== KErrNone && bigBuf != NULL);
 
 	TPtr8 bigBufWritePtr(NULL, 0);
 	bigBufWritePtr.Set(bigBuf->Des());
@@ -1315,7 +1315,7 @@
 
 		// delete file first to ensure it's contents are not in the cache (file may be on the closed file queue)
 		r = TheFs.Delete(path);
-		test(r == KErrNone || r == KErrNotFound);
+		test_Value(r, r == KErrNone || r == KErrNotFound);
 
 		r = file.Create(TheFs,path,EFileShareAny|EFileWrite|EFileReadDirectIO|EFileWriteDirectIO);
 		if(r == KErrAlreadyExists)
@@ -1353,7 +1353,7 @@
 	TPtr8 bufPtr(NULL, 0);
 
 	TRAPD(res,buf = HBufC8::NewL(2));
-	test(res == KErrNone && buf != NULL);
+	test_Value(res, res== KErrNone && buf != NULL);
 	bufPtr.Set(buf->Des());
 
 	directory = gSessionPath;
@@ -1399,7 +1399,7 @@
 		// get number of items on Page Cache
 		TFileCacheStats startPageCacheStats;
 		TInt r = controlIo(TheFs,gDrive, KControlIoFileCacheStats, startPageCacheStats);
-		test(r==KErrNone || r == KErrNotSupported);
+		test_Value(r, r == KErrNone || r == KErrNotSupported);
 		test.Printf(_L("Number of page cache lines on free list at beginning=%d\n"),startPageCacheStats.iFreeCount);
 		test.Printf(_L("Number of page cache lines on used list at beginning=%d\n"),startPageCacheStats.iUsedCount);
 		test.Printf(_L("Number of files on closed queue=%d\n"),startPageCacheStats.iFilesOnClosedQueue);
@@ -1409,7 +1409,7 @@
 #if defined(_DEBUG) || defined(_DEBUG_RELEASE)
 		// get number of items on Page Cache
 		r = controlIo(TheFs,gDrive, KControlIoFileCacheStats, startPageCacheStats);
-		test(r==KErrNone || r == KErrNotSupported);
+		test_Value(r, r == KErrNone || r == KErrNotSupported);
 		test.Printf(_L("Number of page cache lines on free list at end=%d\n"),startPageCacheStats.iFreeCount);
 		test.Printf(_L("Number of page cache lines on used list at end=%d\n"),startPageCacheStats.iUsedCount);
 		test.Printf(_L("Number of files on closed queue=%d\n"),startPageCacheStats.iFilesOnClosedQueue);
@@ -1446,7 +1446,7 @@
 
 */
 LOCAL_C void TestReadAhead()
-{
+	{
 	TInt r = 0,tcreate;
 	RFile fileRead;
 	HBufC8* dummy = NULL;
@@ -1454,33 +1454,11 @@
 
 	TUint32 initTicks = 0;
 	TUint32 finalTicks = 0;
-	TTimeIntervalMicroSeconds timeTakenReadFirst(0);
-	TTimeIntervalMicroSeconds timeTakenReadSubsequent(0);
-
-	// On NAND/FAT and NOR/LFFS drives, due to the lack of DMA support, the read-ahead is likely to happen
-	// BEFORE control is returned to this test app - for NAND this could be fixed by adding
-	// "FileCacheReadAsync OFF" to the estart.txt file, but we can't do this on the integrator as it has no
-	// estart.txt file. Also, we can't set "FileCacheReadAsync OFF" for LFFS as it kills the LFFS background
-	// processing (!)
-	// So... it's only really worth testing on MMC.
-	_LIT(KFATName,"FAT");
-	TDriveInfo driveInfo;
-	test(TheFs.Drive(driveInfo, gDrive) == KErrNone);
-	TFileName fileSystem;
-	r = TheFs.FileSystemName(fileSystem, gDrive);
-	fileSystem.UpperCase();
-	test((r==KErrNone)||(r==KErrNotFound));
-	// ONLY test on MMC
-	if ((driveInfo.iType != EMediaHardDisk) || (fileSystem.Compare(KFATName) != 0))
-		{
-		test.Printf(_L("Skipping read-ahead testing (drive is not MMC)...\n"));
-		return;
-		}
 
 	//--Find out if the drive is sync/async at this point and print information
     TPckgBuf<TBool> drvSyncBuf;
     r = TheFs.QueryVolumeInfoExt(gDrive, EIsDriveSync, drvSyncBuf);
-    test(r == KErrNone);
+    test_KErrNone(r);
 	const TBool bDrvSync = drvSyncBuf();
     if(bDrvSync)
 		test.Printf(_L("Drive D: is synchronous\n"));
@@ -1490,7 +1468,7 @@
 	// use a fast counter as this is more accurate than using TTime
 	TInt fastCounterFreq;
 	r = HAL::Get(HAL::EFastCounterFrequency, fastCounterFreq);
-	test(r == KErrNone);
+	test_KErrNone(r);
 	test.Printf(_L("HAL::EFastCounterFrequency %d\n"), fastCounterFreq);
 
 	// Bind this thread to CPU 0. This is so that timer deltas don't drift from
@@ -1501,7 +1479,7 @@
 	const TInt KReadLen = 28 * KOneK;
 
 	TRAPD(res,dummy = HBufC8::NewL(KReadLen));
-	test(res == KErrNone && dummy != NULL);
+	test_Value(res, res== KErrNone && dummy != NULL);
 
 	dummyPtr.Set(dummy->Des());
 
@@ -1514,82 +1492,81 @@
 	r = fileRead.Open(TheFs,gFirstFile,EFileShareAny|EFileRead|EFileReadBuffered|EFileReadAheadOn);
 	test_KErrNone(r);
 
-	// Read #1
-	test.Printf(_L("Issuing read #1...\n"));
-	initTicks = User::FastCounter();
-	r = fileRead.Read(dummyPtr);
-	finalTicks = User::FastCounter();
+#if defined(_DEBUG) || defined(_DEBUG_RELEASE)
+	TFileCacheStats fileCacheStats;
+	r = controlIo(TheFs,gDrive, KControlIoFileCacheStats, fileCacheStats);
 	test_KErrNone(r);
+	TInt totalBytesRead = fileCacheStats.iUncachedBytesRead;
+	test.Printf(_L("totalBytesRead %d\n"), totalBytesRead);
+	TInt bytesRead = 0;
+	TInt filePos = 0;
+#endif
 
-	timeTakenReadFirst = TicksToMsec(initTicks, finalTicks, fastCounterFreq);
-	test.Printf(_L("first read time %d \n"), I64LOW(timeTakenReadFirst.Int64()));
+	const TInt KReadCount = 6;
+	#define	PAGE_ROUND_UP(x) ((x + 4095) & (-4096))
+	TInt expectedBytesRead[KReadCount] = 
+		{
+		PAGE_ROUND_UP(KReadLen),	// read #0 from media
+		PAGE_ROUND_UP(KReadLen),	// read #1 from media
+		PAGE_ROUND_UP(KReadLen*2),	// read #2 from media, read-ahead #1 of length KReadLen
+		PAGE_ROUND_UP(KReadLen*2),	// read #3 from cache, read-ahead #2 of length KReadLen * 2
+		PAGE_ROUND_UP(KReadLen*4),	// read #4 from cache, read-ahead #3 of length KReadLen * 4
+		0,							// read #5 from cache, no read-ahead
+		};
+	TTimeIntervalMicroSeconds readTimes[KReadCount];
 
-	// Read #2
-	test.Printf(_L("Issuing read #2...\n"));
-	r = fileRead.Read(dummyPtr);
+	for (TInt n=0; n<KReadCount; n++)
+		{
+
+		initTicks = User::FastCounter();
+		r = fileRead.Read(dummyPtr);
+		finalTicks = User::FastCounter();
+		test_KErrNone(r);
 
-	// Read #3
-	test.Printf(_L("Issuing read #3......resulting in read-ahead #1\n"));
-	r = fileRead.Read(dummyPtr);
+		readTimes[n] = TicksToMsec(initTicks, finalTicks, fastCounterFreq);
+		test.Printf(_L("%d: read time %d \n"), n, I64LOW(readTimes[n].Int64()));
 
-	// Wait for the read ahead #1 to be done - this should be approx the same size as previous read (KReadLen)
-	test.Printf(_L("Wait for read-ahead #1...\n"));
-	User::After(I64LOW(timeTakenReadFirst.Int64()) * 3 / 2);
-
+		TInt readAheadTime = I64LOW(readTimes[0].Int64()) * expectedBytesRead[n] / expectedBytesRead[0];
+		// Wait for the read ahead to be done 
+		if (n >= 2)
+			{
+			test.Printf(_L("Wait %u uS for read-ahead ...\n"), readAheadTime);
+			User::After(readAheadTime);
+			}
 
-	test.Printf(_L("Issuing read #4...resulting in read-ahead #2\n"));
-	initTicks = User::FastCounter();
-	r = fileRead.Read(dummyPtr);
-	finalTicks = User::FastCounter();
-	test_KErrNone(r);
-	timeTakenReadSubsequent = TicksToMsec(initTicks, finalTicks, fastCounterFreq);
+#if defined(_DEBUG) || defined(_DEBUG_RELEASE)
+		// check the number of bytes read from the media is as expected. i.e. including the read-ahead length
+		// Keep waiting if it's not for up to 10 seconds
+		const TInt KMaxWaitTime = 10000000;	// 10 secs
+		TInt waitTime;
+		for (waitTime=0; waitTime <KMaxWaitTime; waitTime+= readAheadTime)
+			{
+			r = controlIo(TheFs,gDrive, KControlIoFileCacheStats, fileCacheStats);
+			test_KErrNone(r);
+			bytesRead = fileCacheStats.iUncachedBytesRead - totalBytesRead;
+			TInt bytesReadExpected = Min(gFirstFileSize - filePos, expectedBytesRead[n]);
 
-	test.Printf(_L("read time:  %d \n"), I64LOW(timeTakenReadSubsequent.Int64()));
+			test.Printf(_L("bytesRead %d, bytesReadExpected %d\n"), bytesRead, bytesReadExpected);
+
+			if (bytesRead == bytesReadExpected)
+				break;
+			User::After(readAheadTime);
+			}
+		test(waitTime < KMaxWaitTime);
+		totalBytesRead+= bytesRead;
+		filePos += bytesRead;
+#endif
 
 #if !defined(__WINS__)
-	// NB the read-ahead on LFFS occurs "synchronously" i.e. it occurs before control is returned
-	// to the caller. However it's not a good idea to mark the drive as synchronous (FileCacheReadAsync OFF)
-	// as this causes the drive thread's priority to be lowered which kills the LFFS background processing (!)
-	if (gPagedRom)
-		test.Printf(_L("Skipping timing test on paged ROM\n"));
-	else
-		test(timeTakenReadSubsequent.Int64() < timeTakenReadFirst.Int64());
+		// Read #3 should be able to be satisfied entirely from the cache, so should be quicker. If it's not quicker,
+		// display a warning rather than failing, because the read-ahead might be hogging the CPU, delaying the read from the cache.
+		if (n >= 3)
+			{
+			if (readTimes[n].Int64() >= readTimes[0].Int64())
+				test.Printf(_L("WARNING: Subsequent read not faster despite read-ahead !!!\n"));
+			}
 #endif
-
-	// The read ahead #2 should now be in progress - this should be approx KReadLen * 2
-	// so this read will take result in the next read taking longer than normal (about double)
-	test.Printf(_L("Issuing read #5......resulting in read-ahead #3\n"));
-	initTicks = User::FastCounter();
-	r = fileRead.Read(dummyPtr);
-	finalTicks = User::FastCounter();
-	test_KErrNone(r);
-	timeTakenReadSubsequent = TicksToMsec(initTicks, finalTicks, fastCounterFreq);
-	test.Printf(_L("read time:  %d\n"), I64LOW(timeTakenReadSubsequent.Int64()));
-
-
-	// this read should take a long time, so don't test
-//#if !defined(__WINS__)
-//	test(gTimeTakenReadBlockFile.Int64() < gTimeTakenBigFile.Int64());
-//#endif
-
-	// The third read should be very quick as the previous read-ahead should have already buffered the data
-	test.Printf(_L("Issuing read #6......resulting in read-ahead #4\n"));
-	initTicks = User::FastCounter();
-	r = fileRead.Read(dummyPtr);
-	finalTicks = User::FastCounter();
-	test_KErrNone(r);
-	timeTakenReadSubsequent = TicksToMsec(initTicks, finalTicks, fastCounterFreq);
-	test.Printf(_L("read time:  %d\n"), I64LOW(timeTakenReadSubsequent.Int64()));
-
-
-#if !defined(__WINS__)
-	if (gPagedRom)
-		test.Printf(_L("Skipping timing test on paged ROM\n"));
-	else
-		test(timeTakenReadSubsequent.Int64() < timeTakenReadFirst.Int64());
-#endif
-
-
+		}
 	fileRead.Close();
 
 	r = DeleteAll(gSessionPath);
@@ -1597,8 +1574,7 @@
 
 	delete dummy;
 	test.End();
-
-}
+	}
 
 /** Main tests function
 */
@@ -1609,7 +1585,7 @@
 	// turn OFF lock failure mode
 	TBool simulatelockFailureMode = EFalse;
 	TInt r = controlIo(TheFs, gDrive, KControlIoSimulateLockFailureMode, simulatelockFailureMode);
-	test (r == KErrNone);
+	test_KErrNone(r);
 #endif
 
 	TBuf16<45> dir;
@@ -1629,7 +1605,7 @@
 
 
 	TRAPD(res,gBuf = HBufC8::NewL(KBlockSize+1));
-	test(res == KErrNone && gBuf != NULL);
+	test_Value(res, res== KErrNone && gBuf != NULL);
 
 	gBufWritePtr.Set(gBuf->Des());
 	FillBuffer(gBufWritePtr, KBlockSize, 'A');
@@ -1664,7 +1640,7 @@
 	// turn lock failure mode back ON (if enabled)
 	simulatelockFailureMode = ETrue;
 	r = controlIo(TheFs, gDrive, KControlIoSimulateLockFailureMode, simulatelockFailureMode);
-	test (r == KErrNone);
+	test_KErrNone(r);
 #endif
 
 	}
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_rcount.cpp
--- a/kerneltest/f32test/server/t_rcount.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_rcount.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 
@@ -40,7 +41,7 @@
 	name[0] = gExeFileName[0];
 	test.Printf(_L("%S\n"),&name);
 	TInt r=file.Open(TheFs,name,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	count=TheFs.ResourceCount();
 	test(count==1);
 	file.Close();
@@ -59,14 +60,14 @@
 	User::SetJustInTime(EFalse);
 	RFs fs;
 	TInt r=fs.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFile file;
 	fs.ResourceCountMarkStart();
 	TFileName name=_L("Z:\\Test\\T_FILE.CPP");
 	name[0] = gExeFileName[0];
 
 	r=file.Open(fs,name,EFileRead);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TInt count=fs.ResourceCount();
 	test(count==1);
 	fs.ResourceCountMarkEnd(); // MarkEnd without close
@@ -84,7 +85,7 @@
 	TRequestStatus stat;	
 	RThread t;
 	TInt r=t.Create(_L("TestPanicThread"),TestPanic,KDefaultStackSize,KHeapSize,KHeapSize,NULL);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	t.Logon(stat);
 	t.Resume();
 	User::WaitForRequest(stat);	
@@ -154,11 +155,11 @@
 	{
 	RFs f;
 	TInt r = f.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile a;
 	r=a.Replace(f,KFileName1,EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFile b(a);
 	a.Close();
 	
@@ -181,11 +182,11 @@
 	{
 	RFs f;
 	TInt r = f.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RDir a;
 	r=a.Open(f,KDirName1,KEntryAttNormal);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RDir b(a);
 	a.Close();
 	
@@ -215,12 +216,12 @@
 
 	RFs f;
 	TInt r = f.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFormat a;
 	TInt count;
 	r=a.Open(f,KDrive1,EQuickFormat,count);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RFormat b(a);
 	a.Close();
 	
@@ -250,12 +251,12 @@
 	
 	RFs f;
 	TInt r = f.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RRawDisk a;
     r=a.Open(f,KDrive1);
 
-	test(r==KErrNone);
+	test_KErrNone(r);
 	RRawDisk b(a);
 	a.Close();
 	TBuf8<19> buffer;
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_rdsect.cpp
--- a/kerneltest/f32test/server/t_rdsect.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_rdsect.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -73,7 +73,7 @@
 
 	test.Next(_L("Create test files"));
 	TInt r=TheFs.MkDir(_L("\\F32-TST\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 
 	RFile file;
 
@@ -208,7 +208,7 @@
 //	First, test for non-existant file
 	TBuf<256> testDes;
 	TInt r=TheFs.ReadFileSection(_L("\\F32-tst\\NonExistantFile.txt"),0,testDes,52);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	test(testDes.Length()==0);
 
 //	Test with file closed
@@ -400,7 +400,7 @@
 	TBuf8<256> testDesN;
 	test.Next(_L("Check for null file name"));
  	r=TheFs.ReadFileSection(_L(""),0,testDesN,26);
- 	test(r==KErrBadName);
+ 	test_Value(r, r == KErrBadName);
  	
 	// Check the lentgh of descriptor.	
  	TInt x = testDesN.Length();
@@ -409,7 +409,7 @@
  	test.Next(_L("Check for non existing file"));
 	r=TheFs.ReadFileSection(_L("sdfsd.dfg"),0,testDesN,26);
  	test.Printf(_L("Return %d"),r);
- 	test((r==KErrNotFound) || (r == KErrPathNotFound));
+ 	test_Value(r, (r == KErrNotFound) || (r == KErrPathNotFound));
  	
 	// Check the lentgh of descriptor.	
  	x = testDesN.Length();
@@ -546,7 +546,7 @@
 //	__ASSERT_ALWAYS(aDes.MaxLength()>=aLength,Panic(EBadLength));
 
 	r=TheFs.ReadFileSection(_L("\\F32-tst\\ReadFileSection1.txt"),2000,testDes,-20);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 
 //	Test that specifying a position and length which extends beyond the end of
 //	the	file returns a zero length descriptor and KErrNone
@@ -617,7 +617,7 @@
 	//	First, test for non-existant file
 	TBuf8<256> testDes;
 	TInt r=TheFs.ReadFileSection(_L("\\F32-tst\\NonExistantFile.txt"),0,testDes,52);
-	test(r==KErrNotFound);
+	test_Value(r, r == KErrNotFound);
 	test(testDes.Length()==0);
 	
 	//	Test with file closed
@@ -640,7 +640,7 @@
 	TBuf8<256> testDesN;
 	test.Next(_L("Check for null file name"));
  	r=TheFs.ReadFileSection(_L(""),0,testDesN,26);
- 	test(r==KErrBadName);
+ 	test_Value(r, r == KErrBadName);
  	
 	//  Check the lentgh of descriptor.	
  	TInt x = testDesN.Length();
@@ -649,7 +649,7 @@
  	test.Next(_L("Check for non existing file"));
 	r=TheFs.ReadFileSection(_L("sdfsd.dfg"),0,testDesN,26);
  	test.Printf(_L("Return %d"),r);
- 	test((r==KErrNotFound) || (r == KErrPathNotFound));
+ 	test_Value(r, (r == KErrNotFound) || (r == KErrPathNotFound));
  	
 	//  Check the lentgh of descriptor.	
  	x = testDesN.Length();
@@ -657,27 +657,27 @@
 
     //  Test for Empty directory  
     r=TheFs.ReadFileSection(_L("\\F32-tst\\"),0,testDesN,52);
-    test(r==KErrBadName);
+    test_Value(r, r == KErrBadName);
     test(testDesN.Length()==0);
 
     //  Test for File with wildcard name 
     r=TheFs.ReadFileSection(_L("\\F32-tst\\*.txt"),0,testDesN,52);
-    test(r==KErrBadName);
+    test_Value(r, r == KErrBadName);
     test(testDesN.Length()==0);
 
     //  Test for Folder with wildcard name 
     r=TheFs.ReadFileSection(_L("\\F32-tst*\\ReadFileSection1.txt"),0,testDesN,52);
-    test(r==KErrBadName);
+    test_Value(r, r == KErrBadName);
     test(testDesN.Length()==0);
       
     //  Test for Root directory
     r=TheFs.ReadFileSection(_L("\\"),0,testDesN,52);
-    test(r==KErrBadName);
+    test_Value(r, r == KErrBadName);
     test(testDesN.Length()==0);
 
     //  Test for no file being specified.
     r=TheFs.ReadFileSection(_L(""),0,testDesN,26);
-    test(r==KErrBadName);
+    test_Value(r, r == KErrBadName);
     test(testDesN.Length()==0); 
 
 
@@ -857,7 +857,7 @@
 
 
 	r=TheFs.ReadFileSection(_L("\\F32-tst\\ReadFileSection1.txt"),2000,testDes2,-20);
-	test(r==KErrArgument);
+	test_Value(r, r == KErrArgument);
 
 //	Test that specifying a position and length which extends beyond the end of
 //	the	file returns a zero length descriptor and KErrNone
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_rename.cpp
--- a/kerneltest/f32test/server/t_rename.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_rename.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -37,29 +37,29 @@
 	{
 	test.Next(_L("Create test files"));
 	TInt r=TheFs.MkDir(_L("\\F32-TST\\"));
-	test(r==KErrNone || r==KErrAlreadyExists);
+	test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 
 	RFile file;
 
 //	Create \\SessionPath\\testfile
 	r=file.Replace(TheFs,_L("\\F32-TST\\testfile"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(BeckPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 //	Create \\SessionPath\\rfsfile
 	r=file.Replace(TheFs,_L("\\F32-TST\\rfsfile"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(BeckPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 //	Create \\SessionPath\\eikfile
 	r=file.Replace(TheFs,_L("\\F32-TST\\eikfile"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(BeckPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	}
@@ -73,7 +73,7 @@
     RDir dir;
 	TFileName sessionPath;
 	TInt r=TheFs.SessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TFileName path=_L("?:");
 	path[0]=sessionPath[0];
 	path+=aDirectory;
@@ -83,11 +83,11 @@
 		path.Append(_L("\\*"));
 		
 	r=dir.Open(TheFs,path,KEntryAttMaskSupported);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	CDir* anEntryList;
 	r=TheFs.GetDir(path,KEntryAttMaskSupported,ESortByName,anEntryList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	Sets the new length of path to the position of the last path delimiter +1
 	path.SetLength(path.LocateReverse(KPathDelimiter)+1);
@@ -117,19 +117,19 @@
 	RFile file;
 	
 	r=file.Open(TheFs,_L("\\F32-TST\\testfile"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file.Rename(_L("\\F32-TST\\TESTFILE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	file.Close();
 
 	test.Next(_L("Write in some data"));
 	r=file.Open(TheFs,_L("\\F32-TST\\TESTFILE"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file.Write(alphaPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	file.Close();
 	}
@@ -144,15 +144,15 @@
 	TInt r;
 		
 	r=TheFs.Rename(_L("\\F32-TST\\rfsfile"),_L("\\F32-TST\\RFSFILE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	RFile file;
 	test.Next(_L("Write in some data"));
 	r=file.Open(TheFs,_L("\\F32-TST\\RFSFILE"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file.Write(alphaPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	file.Close();
 	}
@@ -168,19 +168,19 @@
 	
 	test.Next(_L("Create a new file with DOS compatible equivalent name"));
 	r=file.Create(TheFs,_L("\\F32-TST\\EIKFILE"),EFileRead|EFileWrite);
-	test((r==KErrNone)||(r==KErrAlreadyExists));
+	test_Value(r, r == KErrNone || r == KErrAlreadyExists);
 	file.Close();
 
 	test.Next(_L("Copy data from original file into new file"));
 	r=TheFs.Replace(_L("\\F32-TST\\eikfile"),_L("\\F32-TST\\EIKFILE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	test.Next(_L("Open the new file and write into it"));
 	r=file.Open(TheFs,_L("\\F32-TST\\EIKFILE"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file.Write(alphaPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	file.Close();
 	}
@@ -198,17 +198,17 @@
 //	First test with a non DOS compatible name renamed to a DOS compatible name
 	test.Next(_L("Rename test to TEST and replace temp with TEST"));
 	r=file.Replace(TheFs,_L("\\F32-TST\\test"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(BeckPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	r=TheFs.Rename(_L("\\F32-TST\\test"),_L("\\F32-TST\\TEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Replace(TheFs,_L("\\F32-TST\\temp"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(alphaPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 //	Replace(oldName, newName)	
@@ -217,183 +217,183 @@
 //	then temp is deleted.  If it does exist, it must be closed
 //	The bug created a second file of the same name	
 	r=TheFs.Replace(_L("\\F32-TST\\temp"),_L("\\F32-TST\\TEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	Check that there's only one file named TEST
 	TInt fileCount=0;
 	fileCount=CountFiles(_L("\\F32-TST\\"),_L("TEST"));
 	test(fileCount==1);
 	r=TheFs.Delete(_L("\\F32-TST\\TEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileCount=CountFiles(_L("\\F32-TST\\"),_L("TEST"));
 	test(fileCount==0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	
 
 //*****************************************************
 //	The same test but with different source directories
 	test.Next(_L("Rename test to and replace \\SYSTEM\\temp with TEST"));
 	r=file.Replace(TheFs,_L("\\F32-TST\\test"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(BeckPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	r=TheFs.Rename(_L("\\F32-TST\\test"),_L("\\F32-TST\\TEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Replace(TheFs,_L("\\F32-TST\\SYSTEM\\temp"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(alphaPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 //	The bug created a second file of the same name	
 	r=TheFs.Replace(_L("\\F32-TST\\SYSTEM\\temp"),_L("\\F32-TST\\TEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	fileCount=0;
 	fileCount=CountFiles(_L("\\F32-TST\\"),_L("TEST"));
 	test(fileCount==1);
 	r=TheFs.Delete(_L("\\F32-TST\\TEST"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileCount=CountFiles(_L("\\F32-TST\\"),_L("TEST"));
 	test(fileCount==0);
 //	Test that system directory is now empty	
 	fileCount=0;
 	fileCount=CountFiles(_L("\\F32-TST\\SYSTEM\\"),_L("temp"));
 	test(fileCount==0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	*************************************************************************
 //	Test with a DOS compatible name renamed to a different DOS compatible name
 	test.Next(_L("Rename little to BIG and replace temp with BIG"));
 	r=file.Replace(TheFs,_L("\\F32-TST\\little"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(BeckPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	// Test a long path (>250 chrs)
 	r=TheFs.Rename(_L("\\F32-TST\\little"),_L("\\F32-TST\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\0495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\PLATTEST\\FileStore\\TestData\\20495_Folder\\middle.gif"));
-	test(r==KErrBadName);
+	test_Value(r, r == KErrBadName);
 
 	r=TheFs.Rename(_L("\\F32-TST\\little"),_L("\\F32-TST\\BIG"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Replace(TheFs,_L("\\F32-TST\\temp"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(alphaPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 	r=TheFs.Replace(_L("\\F32-TST\\temp"),_L("\\F32-TST\\BIG"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	fileCount=0;
 	fileCount=CountFiles(_L("\\F32-TST\\"),_L("BIG"));
 	test(fileCount==1);
 	r=TheFs.Delete(_L("\\F32-TST\\BIG"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileCount=CountFiles(_L("\\F32-TST\\"),_L("BIG"));
 	test(fileCount==0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	***********************************	
 //	Test with a non-DOS compatible name
 	test.Next(_L("Rename veryLongFileName to VERYLONGFILENAME"));
 	r=file.Replace(TheFs,_L("\\F32-TST\\veryLongFileName"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(BeckPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	r=TheFs.Rename(_L("\\F32-TST\\veryLongFileName"),_L("\\F32-TST\\VERYLONGFILENAME"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Replace(TheFs,_L("\\F32-TST\\temp"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(alphaPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 	r=TheFs.Replace(_L("\\F32-TST\\temp"),_L("\\F32-TST\\VERYLONGFILENAME"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	fileCount=0;
 	fileCount=CountFiles(_L("\\F32-TST\\"),_L("VERYLONGFILENAME"));
 	test(fileCount==1);
 	r=TheFs.Delete(_L("\\F32-TST\\VERYLONGFILENAME"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileCount=CountFiles(_L("\\F32-TST\\"),_L("VERYLONGFILENAME"));
 	test(fileCount==0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	*******************************
 //	Test with a DOS compatible name
 	test.Next(_L("Rename FILE to FILE and replace temp with FILE"));
 	r=file.Replace(TheFs,_L("\\F32-TST\\FILE"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(BeckPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	r=TheFs.Rename(_L("\\F32-TST\\FILE"),_L("\\F32-TST\\FILE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Replace(TheFs,_L("\\F32-TST\\temp"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(alphaPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 	r=TheFs.Replace(_L("\\F32-TST\\temp"),_L("\\F32-TST\\FILE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	fileCount=0;
 	fileCount=CountFiles(_L("\\F32-TST\\"),_L("FILE"));
 	test(fileCount==1);
 	r=TheFs.Delete(_L("\\F32-TST\\FILE"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileCount=CountFiles(_L("\\F32-TST\\"),_L("FILE"));
 	test(fileCount==0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	**************************************************
 //	Test with a DOS compatible name which is kept open
 	test.Next(_L("Rename test1 to TEST1 and replace temp1 with TEST1 while it's open"));
 	r=file.Replace(TheFs,_L("\\F32-TST\\test1"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(BeckPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 
 	r=TheFs.Rename(_L("\\F32-TST\\test1"),_L("\\F32-TST\\TEST1"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 //	Try with the file open
 	RFile openFile;
 	r=openFile.Open(TheFs,_L("\\F32-TST\\TEST1"),EFileRead|EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	r=file.Replace(TheFs,_L("\\F32-TST\\temp"),EFileWrite);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=file.Write(alphaPtr);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	file.Close();
 	
 	r=TheFs.Replace(_L("\\F32-TST\\temp"),_L("\\F32-TST\\TEST1"));
-	test(r==KErrInUse);	//	Fails as it should!  But not intuitive bearing in mind the other bug...
+	test_Value(r, r == KErrInUse);	//	Fails as it should!  But not intuitive bearing in mind the other bug...
 
 	openFile.Close();
 	
 	r=TheFs.Replace(_L("\\F32-TST\\temp"),_L("\\F32-TST\\TEST1"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	fileCount=0;
 	fileCount=CountFiles(_L("\\F32-TST\\"),_L("TEST1"));
 	test(fileCount==1);
 	r=TheFs.Delete(_L("\\F32-TST\\TEST1"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	fileCount=CountFiles(_L("\\F32-TST\\"),_L("TEST1"));
 	test(fileCount==0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 
 	}
 
@@ -453,7 +453,7 @@
 
    fName.Format(_L("%c:"), gDriveNum+'A');
    nRes = TheFs.CheckDisk(fName);
-   test(nRes == KErrNone || nRes == KErrNotSupported);
+   test_Value(nRes, nRes == KErrNone || nRes == KErrNotSupported);
 
    //-- clean up
     for(i=0; i<KNumFiles; ++i)
@@ -465,11 +465,11 @@
 
    fName.Format(_L("%c:"), gDriveNum+'A');
    nRes = TheFs.CheckDisk(fName);
-   test(nRes == KErrNone || nRes == KErrNotSupported);
+   test_Value(nRes, nRes == KErrNone || nRes == KErrNotSupported);
 
 
    nRes = TheFs.RmDir(KDir);
-   test(nRes == KErrNone);
+   test_KErrNone(nRes);
 
 
 }
@@ -485,14 +485,14 @@
     F32_Test_Utils::SetConsole(test.Console());
 
     TInt nRes=TheFs.CharToDrive(gDriveToTest, gDriveNum);
-    test(nRes==KErrNone);
+    test_KErrNone(nRes);
     
     PrintDrvInfo(TheFs, gDriveNum);
 
     if(!Is_Win32(TheFs, gDriveNum))
         {
         nRes = FormatDrive(TheFs, gDriveNum, ETrue);
-        test(nRes==KErrNone);
+        test_KErrNone(nRes);
         }
     
 
@@ -507,7 +507,7 @@
     if(!Is_Win32(TheFs, gDriveNum))
         {
         nRes = FormatDrive(TheFs, gDriveNum, ETrue);
-        test(nRes==KErrNone);
+        test_KErrNone(nRes);
         }
 
 	test.End();
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_resize.cpp
--- a/kerneltest/f32test/server/t_resize.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_resize.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -20,6 +20,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <e32test.h>
 #include <f32file.h>
 #include <hal.h>
@@ -56,7 +57,7 @@
 	test.Next(_L("Connecting to file server."));
 	TInt r;
 	r = TheFs.Connect();
-	test(r == KErrNone);
+	test_KErrNone(r);
 
 	if ( !gDriveToTest.IsLower() )
 		{
@@ -171,13 +172,13 @@
 	TInt isFat, isValid;
     TInt machUid;
     r=HAL::Get(HAL::EMachineUid,machUid);
-    test(r==KErrNone);
+    test_KErrNone(r);
 //	test.Printf(_L("machUid = %08x.\n"), machUid);
 
 	TBuf<16> fsName;							// _?_ length
         
     r = TheFs.FileSystemName(fsName, aDrive);
-    test(r == KErrNone || r == KErrNotFound);
+    test_Value(r, r == KErrNone || r == KErrNotFound);
 	test.Printf(_L("fsName = \"%S\".\n"), &fsName);
 
 	if (machUid == HAL::EMachineUid_Brutus)
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_scan.cpp
--- a/kerneltest/f32test/server/t_scan.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_scan.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -13,6 +13,7 @@
 // Description:
 //
 
+#define	__E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include "t_server.h"
@@ -57,11 +58,11 @@
 
 	TInt r;
 	r=TheFs.SetAtt(_L("\\F32-TST\\SCANTEST\\Left\\Dir3\\Dir4\\Hidden"), KEntryAttHidden, 0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetAtt(_L("\\F32-TST\\SCANTEST\\Left\\Dir3\\Dir4\\Hidden\\HiddenFile"), KEntryAttHidden, 0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetAtt(_L("\\F32-TST\\SCANTEST\\Left\\Dir3\\Dir4\\Hidden\\System"), KEntryAttSystem, 0);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	}
 
 LOCAL_C void Test1()
@@ -236,12 +237,12 @@
 	TheFs.SetAllocFailure(gAllocFailOff);
 	TFileName sessionPath;
 	TInt r=TheFs.SessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	r=TheFs.SetSessionPath(_L("N:\\"));
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TAutoClose<RFs> fs;
 	r=fs.iObj.Connect();
-	test(r==KErrNone);
+	test_KErrNone(r);
 	CDirScan* scanner=CDirScan::NewL(fs.iObj);
 	TParse dirName;
 	TheFs.Parse(sessionPath,dirName);
@@ -264,7 +265,7 @@
 		}
 	delete scanner;
 	r=TheFs.SetSessionPath(sessionPath);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	TheFs.SetAllocFailure(gAllocFailOn);
 	}
 
@@ -387,7 +388,7 @@
 	TPtrC romPath(_L("Z:\\"));
 	TParse dirName;
 	TInt r=TheFs.Parse(romPath,dirName);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	scanner->SetScanDataL(dirName.FullName(),KEntryAttDir,ESortByName);
 	CDir* entryList;
 	FOREVER
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_vfat.cpp
--- a/kerneltest/f32test/server/t_vfat.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_vfat.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -15,6 +15,7 @@
 // 
 //
 
+#define __E32TEST_EXTENSION__
 #include <f32file.h>
 #include <e32test.h>
 #include <e32math.h>
@@ -56,15 +57,15 @@
 		TBuf<32> longName=namelong;
 		longName.AppendNum(fileNum);
 		TInt r=TheFs.Rename(shortName,longName);
-		test(r==KErrNone);
+		test_KErrNone(r);
 		}
 
 	TInt r=TheFs.CheckDisk(gSessionPath);
-	test(r==KErrNone || r==KErrNotSupported);
+	test_Value(r, r == KErrNone || r==KErrNotSupported);
 
 	CDir* dirList;
 	r=TheFs.GetDir(_L("*.*"),KEntryAttMaskSupported,ESortBySize,dirList);
-	test(r==KErrNone);
+	test_KErrNone(r);
 	test(dirList->Count()==totalFiles);
 	for (i=0;i<totalFiles;i++)
 		{
@@ -129,7 +130,7 @@
 			if (fileName==_L(""))
 				goto End;
 			r=TheFs.Delete(fileName);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			gFileName[fileNum]=_L("");
 			goto End;
 		default:
@@ -142,14 +143,14 @@
 			TInt r;
 			RFile thing;
 			r=thing.Open(TheFs, fileName, EFileShareAny);
-			test (r==KErrNone || r==KErrNotFound);
+			test_Value(r, r == KErrNone || r==KErrNotFound);
 			if (r==KErrNone)
 				{
 				TInt s;
 				test (thing.Size(s) == KErrNone);
 				thing.Close();
 				r=TheFs.Delete(fileName);
-				test (r==KErrNone);
+				test_KErrNone(r);
 				gFileName[s]=_L("");
 				}
 			else
@@ -168,7 +169,7 @@
 			TInt r=TheFs.Rename(gFileName[fileNum],fileName);
             if (r != KErrNone && r != KErrAlreadyExists)
                 test.Printf(_L("Rename returned %d at line %d"), r, __LINE__);
-			test(r==KErrNone || r==KErrAlreadyExists);
+			test_Value(r, r == KErrNone || r==KErrAlreadyExists);
 			if (r==KErrNone)
 				gFileName[fileNum]=fileName;
 			}
@@ -177,11 +178,11 @@
 			{
 			test.Printf(_L("Iteration %d    \r"),gMaxIterations-maxIterations);
 			TInt r=TheFs.CheckDisk(gSessionPath);
-			test(r==KErrNone || r==KErrNotSupported);
+			test_Value(r, r == KErrNone || r==KErrNotSupported);
 			TInt count=0;
 			CDir* dirList;
 			r=TheFs.GetDir(_L("*.*"),KEntryAttMaskSupported,ESortBySize,dirList);
-			test(r==KErrNone);
+			test_KErrNone(r);
 			for(i=0;i<gMaxFiles;i++)
 				{
 				if (gFileName[i]==_L(""))
@@ -231,19 +232,19 @@
     TEntry  entry;
 
     nRes = TheFs.Entry(KName1, entry);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(entry.iName.CompareF(KExpectedName) == 0);
 
     nRes = TheFs.Entry(KName2, entry);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(entry.iName.CompareF(KExpectedName) == 0);
 
     nRes = TheFs.Entry(KName3, entry);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(entry.iName.CompareF(KExpectedName) == 0);
 
     nRes = TheFs.Entry(KName3, entry);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     test(entry.iName.CompareF(KExpectedName) == 0);
 }
 
@@ -273,46 +274,46 @@
 
     //----- create and check "\\file1"
     nRes = file.Replace(TheFs, KName1, EFileWrite);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     file.Close();
     
     DoCheckTD_FN();
 
     nRes = TheFs.Delete(KName1);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
 
     //----- create and check "\\file1."
     nRes = file.Replace(TheFs, KName2, EFileWrite);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     file.Close();
     
     DoCheckTD_FN();
 
     nRes = TheFs.Delete(KName2);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
 
     //----- create and check "\\file1.."
     nRes = file.Replace(TheFs, KName3, EFileWrite);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     file.Close();
     
     DoCheckTD_FN();
 
     nRes = TheFs.Delete(KName3);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
 
     //----- create and check "\\file1..."
     nRes = file.Replace(TheFs, KName4, EFileWrite);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
     file.Close();
     
     DoCheckTD_FN();
     
     nRes = TheFs.Delete(KName4);
-    test(nRes == KErrNone);
+    test_KErrNone(nRes);
 
 
 }
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/server/t_wcache.cpp
--- a/kerneltest/f32test/server/t_wcache.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/server/t_wcache.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -810,7 +810,7 @@
 	TPtr8 dummyPtr(NULL, 0);	
 
 	TRAPD(res,dummy = HBufC8::NewL(4));
-	test(res == KErrNone && dummy != NULL);
+	test_Value(res, res == KErrNone && dummy != NULL);
 		
 	dummyPtr.Set(dummy->Des());
 	FillBuffer(dummyPtr, 4, '1');
@@ -893,7 +893,7 @@
 	TInt KBigBifferSize = 32 * KOneK;
 	
 	TRAPD(res,bigBuf = HBufC8::NewL(KBigBifferSize));
-	test(res == KErrNone && bigBuf != NULL);
+	test_Value(res, res == KErrNone && bigBuf != NULL);
 		
 	TPtr8 bigBufWritePtr(NULL, 0);	
 	bigBufWritePtr.Set(bigBuf->Des());
@@ -959,7 +959,7 @@
 	HBufC8* bigBuf = NULL;
 	const TInt KBigBifferSize = 32 * 1024;
 	TRAPD(res,bigBuf = HBufC8::NewL(KBigBifferSize));
-	test(res == KErrNone && bigBuf != NULL);
+	test_Value(res, res == KErrNone && bigBuf != NULL);
 		
 	TPtr8 bigBufWritePtr(NULL, 0);	
 	bigBufWritePtr.Set(bigBuf->Des());
@@ -1016,7 +1016,7 @@
 	TPtr8 bufPtr(NULL, 0);	
 	
 	TRAPD(res,buf = HBufC8::NewL(2));
-	test(res == KErrNone && buf != NULL);
+	test_Value(res, res == KErrNone && buf != NULL);
 	bufPtr.Set(buf->Des());
 	
 	directory = gSessionPath;
@@ -1214,7 +1214,7 @@
 
 
 	TRAPD(res,gBuf = HBufC8::NewL(KBlockSize+1));
-	test(res == KErrNone && gBuf != NULL);
+	test_Value(res, res == KErrNone && gBuf != NULL);
 		
 	gBufWritePtr.Set(gBuf->Des());
 	FillBuffer(gBufWritePtr, KBlockSize, 'A');
@@ -1299,7 +1299,7 @@
 
 
 	TRAPD(res,gBuf = HBufC8::NewL(KBlockSize+1));
-	test(res == KErrNone && gBuf != NULL);
+	test_Value(res, res == KErrNone && gBuf != NULL);
 		
 	gBufWritePtr.Set(gBuf->Des());
 	FillBuffer(gBufWritePtr, KBlockSize, 'A');
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/smassstorage/scripts/usbinterop1.pl
--- a/kerneltest/f32test/smassstorage/scripts/usbinterop1.pl	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/smassstorage/scripts/usbinterop1.pl	Thu Jun 10 11:48:01 2010 +0100
@@ -2,7 +2,7 @@
 # Copyright (c) 2004-2009 Nokia Corporation and/or its subsidiary(-ies).
 # All rights reserved.
 # This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
+# under the terms of the License "Eclipse Public License v1.0"
 # which accompanies this distribution, and is available
 # at the URL "http://www.eclipse.org/legal/epl-v10.html".
 #
@@ -279,8 +279,4 @@
  TestExpectedResults:  
 	Read data from files should match with written.
 
-=head1 COPYRIGHT
-
-Copyright (c) 2004-2009 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.
-
 =cut
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/smassstorage/scripts/usbinterop2.pl
--- a/kerneltest/f32test/smassstorage/scripts/usbinterop2.pl	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/smassstorage/scripts/usbinterop2.pl	Thu Jun 10 11:48:01 2010 +0100
@@ -2,7 +2,7 @@
 # Copyright (c) 2004-2009 Nokia Corporation and/or its subsidiary(-ies).
 # All rights reserved.
 # This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
+# under the terms of the License "Eclipse Public License v1.0"
 # which accompanies this distribution, and is available
 # at the URL "http://www.eclipse.org/legal/epl-v10.html".
 #
@@ -163,8 +163,4 @@
  with written.  Sum of file size and free space should be close to
  drive size.
 
-=head1 COPYRIGHT
-
-Copyright (c) 2004-2009 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.
-
 =cut
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/smassstorage/scripts/usbperformance.pl
--- a/kerneltest/f32test/smassstorage/scripts/usbperformance.pl	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/smassstorage/scripts/usbperformance.pl	Thu Jun 10 11:48:01 2010 +0100
@@ -2,7 +2,7 @@
 # Copyright (c) 2006-2009 Nokia Corporation and/or its subsidiary(-ies).
 # All rights reserved.
 # This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
+# under the terms of the License "Eclipse Public License v1.0"
 # which accompanies this distribution, and is available
 # at the URL "http://www.eclipse.org/legal/epl-v10.html".
 #
@@ -174,8 +174,4 @@
 free space for the file that is going to be created. The default size is 400
 MB.
 
-=head1 COPYRIGHT
-
- Copyright (c) 2006-2009 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.
-
 =cut
diff -r 5e441a173c63 -r d9f1e5bfe28c kerneltest/f32test/smassstorage/scripts/usbperformance_multifile.pl
--- a/kerneltest/f32test/smassstorage/scripts/usbperformance_multifile.pl	Mon May 24 18:45:46 2010 +0100
+++ b/kerneltest/f32test/smassstorage/scripts/usbperformance_multifile.pl	Thu Jun 10 11:48:01 2010 +0100
@@ -2,7 +2,7 @@
 # Copyright (c) 2006-2009 Nokia Corporation and/or its subsidiary(-ies).
 # All rights reserved.
 # This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
+# under the terms of the License "Eclipse Public License v1.0"
 # which accompanies this distribution, and is available
 # at the URL "http://www.eclipse.org/legal/epl-v10.html".
 #
@@ -186,8 +186,4 @@
 free space for the file that is going to be created. The default size is 400
 MB.
 
-=head1 COPYRIGHT
-
-Copyright (c) 2006-2009 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.
-
 =cut
diff -r 5e441a173c63 -r d9f1e5bfe28c package_definition.xml
--- a/package_definition.xml	Mon May 24 18:45:46 2010 +0100
+++ b/package_definition.xml	Thu Jun 10 11:48:01 2010 +0100
@@ -61,6 +61,14 @@
         <!-- owned and maintained by usb package. To be moved there as soon as technical limitations are resolved -->
         <unit bldFile="kernel/eka/drivers/usbc" mrp="kernel/eka/drivers/usbc/base_e32_drivers_usbcli.mrp"/>
       </component>
+      <component id="usbdescriptors" name="USB Descriptors" purpose="optional">
+        <!-- owned and maintained by usb package. To be moved there as soon as technical limitations are resolved -->
+        <unit bldFile="kernel/eka/drivers/usbho/usbdescriptors" mrp="kernel/eka/drivers/usbho/usbdescriptors/base_drivers_usbdescriptors.mrp"/>
+      </component>
+      <component id="usbdi_utils" name="USB DI Utils" purpose="optional">
+        <!-- owned and maintained by usb package. To be moved there as soon as technical limitations are resolved -->
+        <unit bldFile="kernel/eka/drivers/usbho/usbdi_utils" mrp="kernel/eka/drivers/usbho/usbdi_utils/base_drivers_usbdi_utils.mrp"/>
+      </component>
     </collection>
     <collection id="driversupport" name="Generic Driver Support" level="hw-if">
       <component id="mediadrivers" name="Media Drivers" purpose="optional">
@@ -133,6 +141,9 @@
       <component id="kernelhwsrv_metadata" name="Kernel and Hardware Services Metadata" class="config" introduced="^2" purpose="development" target="desktop">
         <unit mrp="kernelhwsrv_info/kernelhwsrv_metadata/kernelhwsrv_metadata.mrp"/>
       </component>
+      <component id="kernelhwsrv_docpub" name="Kernel and Hardware Services Public Documentation" class="doc" introduced="^3" purpose="development">
+        <unit mrp="kernelhwsrv_info/doc_pub/kernelhwsrv_doc_pub.mrp"/>
+      </component>
     </collection>
   </package>
 </SystemDefinition>
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/domainmgr/group/base_domain.mrp
--- a/userlibandfileserver/domainmgr/group/base_domain.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/domainmgr/group/base_domain.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Domain Manager"
 
 component	base_domain
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/bmarm/efileu.def
--- a/userlibandfileserver/fileserver/bmarm/efileu.def	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/bmarm/efileu.def	Thu Jun 10 11:48:01 2010 +0100
@@ -240,4 +240,5 @@
 	DriveInfo__C11CFileSystemR10TDriveInfoi @ 239 NONAME R3UNUSED ; CFileSystem::DriveInfo(TDriveInfo &, int) const
 	GetDriveInfo__FR10TDriveInfoi @ 240 NONAME R3UNUSED ; GetDriveInfo(TDriveInfo &, int)
 	Volume__C9RFsPluginR11TVolumeInfoi @ 241 NONAME R3UNUSED ; RFsPlugin::Volume(TVolumeInfo &, int) const
-
+	IsSequentialMode__C7CFileCB @ 242 NONAME R3UNUSED ; CFileCB::IsSequentialMode(void) const
+	DirectIOMode__7CFileCBRC12RMessagePtr2 @ 243 NONAME R3UNUSED ; CFileCB::DirectIOMode(RMessagePtr2 const &)
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/bwins/efileu.def
--- a/userlibandfileserver/fileserver/bwins/efileu.def	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/bwins/efileu.def	Thu Jun 10 11:48:01 2010 +0100
@@ -241,3 +241,5 @@
 	?DriveInfo@CFileSystem@@UBEXAAVTDriveInfo@@H@Z @ 240 NONAME ; void CFileSystem::DriveInfo(class TDriveInfo &, int) const
 	?GetDriveInfo@@YAXAAVTDriveInfo@@H@Z @ 241 NONAME ; void GetDriveInfo(class TDriveInfo &, int)
 	?Volume@RFsPlugin@@QBEHAAVTVolumeInfo@@H@Z @ 242 NONAME ; int RFsPlugin::Volume(class TVolumeInfo &, int) const
+	?IsSequentialMode@CFileCB@@QBEHXZ @ 243 NONAME ; int CFileCB::IsSequentialMode(void) const
+	?DirectIOMode@CFileCB@@QAEHABVRMessagePtr2@@@Z @ 244 NONAME ; int CFileCB::DirectIOMode(class RMessagePtr2 const &)
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/bx86/efileu.def
--- a/userlibandfileserver/fileserver/bx86/efileu.def	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/bx86/efileu.def	Thu Jun 10 11:48:01 2010 +0100
@@ -241,3 +241,6 @@
 	?DriveInfo@CFileSystem@@UBEXAAVTDriveInfo@@H@Z @ 240 NONAME ; public: virtual void __thiscall CFileSystem::DriveInfo(class TDriveInfo &,int)const 
 	?GetDriveInfo@@YAXAAVTDriveInfo@@H@Z @ 241 NONAME ; void __cdecl GetDriveInfo(class TDriveInfo &,int)
 	?Volume@RFsPlugin@@QBEHAAVTVolumeInfo@@H@Z @ 242 NONAME ; public: int __thiscall RFsPlugin::Volume(class TVolumeInfo &,int)const 
+	?IsSequentialMode@CFileCB@@QBEHXZ @ 243 NONAME ; public: int __thiscall CFileCB::IsSequentialMode(void)const 
+	?DirectIOMode@CFileCB@@QAEHABVRMessagePtr2@@@Z @ 244 NONAME ; int CFileCB::DirectIOMode(class RMessagePtr2 const &)
+
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/eabi/efileu.def
--- a/userlibandfileserver/fileserver/eabi/efileu.def	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/eabi/efileu.def	Thu Jun 10 11:48:01 2010 +0100
@@ -313,3 +313,6 @@
 	_Z12GetDriveInfoR10TDriveInfoi @ 312 NONAME
 	_ZNK11CFileSystem9DriveInfoER10TDriveInfoi @ 313 NONAME
 	_ZNK9RFsPlugin6VolumeER11TVolumeInfoi @ 314 NONAME
+	_ZNK7CFileCB16IsSequentialModeEv @ 315 NONAME
+	_ZN7CFileCB12DirectIOModeERK12RMessagePtr2 @ 316 NONAME
+
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/estart/base_f32_estart.mrp
--- a/userlibandfileserver/fileserver/estart/base_f32_estart.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/estart/base_f32_estart.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "EStart"
 
 component	base_f32_estart
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/etshell/base_f32_eshell.mrp
--- a/userlibandfileserver/fileserver/etshell/base_f32_eshell.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/etshell/base_f32_eshell.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Text Shell"
 
 component	base_f32_eshell
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/group/base_f32.mrp
--- a/userlibandfileserver/fileserver/group/base_f32.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/group/base_f32.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "File Server"
 
 component	base_f32
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/group/release.txt
--- a/userlibandfileserver/fileserver/group/release.txt	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/group/release.txt	Thu Jun 10 11:48:01 2010 +0100
@@ -1,3 +1,29 @@
+Version 2.00.3044
+=================
+(Made by vfebvre 27/05/2010)
+
+1.	vfebvre
+	1.	ou1cimx1#400806 Warnings reported by the Symbian Foundation license checker
+
+2.	h14jiang
+	1.	DEF145205 File server crash observed when running F32TEST T_PLUGIN_V2
+
+3.	michcox
+	1.	ou1cimx1#378866 MCL Symbian.org Bug 2544 -  Possible deadlocks on f32 plugin chains
+
+4.	vinjose
+	1.	ou1cimx1#394794 Raptor creates incorrect .iby files for f32test/loader
+
+
+Version 2.00.3043
+=================
+(Made by vfebvre 27/05/2010)
+
+1.	paconway
+	1.	REQ 417-56766 MBBMS over CMMB for TD-SCDMA Gen. 2 MobileTv
+		PackageReleaseID=497412 FeatureReleaseID=494378
+
+
 Version 2.00.3042
 =================
 (Made by vfebvre 14/05/2010)
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/inc/f32dbg.h
--- a/userlibandfileserver/fileserver/inc/f32dbg.h	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/inc/f32dbg.h	Thu Jun 10 11:48:01 2010 +0100
@@ -187,6 +187,8 @@
 const TInt KControlIoSessionCount=KMaxTInt-21;
 const TInt KControlIoObjectCount=KMaxTInt-22;
 
+const TInt KControlIoIsFileSequential=KMaxTInt-23;
+
 const TInt KNCDebugNotifierValue=-500000;	// between 0 and 1 second
 
 GLREF_D TInt DebugNCNotifier;
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/inc/f32fsys.h
--- a/userlibandfileserver/fileserver/inc/f32fsys.h	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/inc/f32fsys.h	Thu Jun 10 11:48:01 2010 +0100
@@ -556,6 +556,10 @@
 	
 	friend class LocalDrives;			// for access to iChanged flag
 	friend class CExtNotifyMediaChange; // for access to iChanged flag
+	
+#if defined(_USE_CONTROLIO) || defined(_DEBUG) || defined(_DEBUG_RELEASE)
+	friend class TFsControlIo;			// for access to LocateDrives()
+#endif
 	};
 
 class CFileCB;
@@ -1614,7 +1618,6 @@
 	TBool DeleteOnClose() const;
  
 	
-
 	void SetNotifyAsyncReadersPending(TBool aNotifyAsyncReadersPending);
 	TBool NotifyAsyncReadersPending() const;
 	TInt CancelAsyncReadRequest(CFileShare* aShareP, TRequestStatus* aStatusP);
@@ -1629,6 +1632,7 @@
 	IMPORT_C TInt64 Size64() const;
 	IMPORT_C void SetSize64(TInt64 aSize, TBool aDriveLocked);
     IMPORT_C void SetMaxSupportedSize(TUint64 aMaxFileSize);
+	IMPORT_C TBool DirectIOMode(const RMessagePtr2& aMessage);
 
 
     TInt64 CachedSize64() const;
@@ -1638,6 +1642,17 @@
 	TInt RemoveLock64(CFileShare* aFileShare,TInt64 aPos,TInt64 aLength);
 	TInt CheckLock64(CFileShare* aFileShare,TInt64 aPos,TInt64 aLength);
 
+	/** Sequential mode */
+	
+	IMPORT_C TBool IsSequentialMode() const;
+	void SetSequentialMode(TBool aSequential);
+
+	/**
+	The FileShare List contains the file shares of an open file.
+	*/
+	TDblQue<CFileShare>& FileShareList() const;
+	void AddShare(CFileShare& aFileShare);
+
     /**
     Renames the file with the full file name provided.
 
@@ -1954,12 +1969,12 @@
 public:
 
 	/**
-	The full name of the file, including drive and extensions.
+	The full name of the file, including its extension.
 	*/
 	HBufC* iFileName;
 
 	/**
-	The full name of the file, including drive and extensions - Folded.
+	The full name of the file, including its extension - Folded.
 	*/
 	HBufC* iFileNameF;
 
@@ -1968,11 +1983,9 @@
 	TDrive*             iCreatedDrive;
 	TDrive*             iDrive;
 	CMountCB*           iMount;
-	TFileLocksArray*    iFileLocks; ///< an array of file position locks
+	TFileLocksArray*    iFileLocks;		// An array of file position locks
 	TDblQueLink         iMountLink;
-	
-private:
-	CFileBody* iBody;
+	CFileBody*			iBody;
 
 	friend class TDrive;
 	friend class CMountCB;
@@ -2025,7 +2038,7 @@
 	void InitL();
 	inline CFileCB& File();
 
-	// For serialising aync requests 
+	// For serialising async requests 
 	TBool RequestStart(CFsMessageRequest* aRequest);
 	void RequestEnd(CFsMessageRequest* aRequest);
 	TBool RequestInProgress() const;
@@ -2050,8 +2063,13 @@
 
 	// A pointer to the current request. Used for serializing client 
 	// async read/write requests which might otherwise be processed out
-	// of order due to fair scheduling
-	CFsMessageRequest* iCurrentRequest;	
+	// of order due to fair scheduling.
+	CFsMessageRequest* iCurrentRequest;
+	
+	// The FileShare List link object.
+	TDblQueLink iShareLink;
+
+friend class CFileBody;	// For access to iShareLink
 	};
 
 
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/inc/f32notification.h
--- a/userlibandfileserver/fileserver/inc/f32notification.h	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/inc/f32notification.h	Thu Jun 10 11:48:01 2010 +0100
@@ -17,6 +17,8 @@
 #ifndef __F32NOTIFICATION_H__
 #define __F32NOTIFICATION_H__
 
+#include <f32file.h> //For clients that include F32Notification.h first.
+
 /*
  * This class is not intended for instantiation neither on the stack
  * nor on the heap.
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/inc/f32ver.h
--- a/userlibandfileserver/fileserver/inc/f32ver.h	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/inc/f32ver.h	Thu Jun 10 11:48:01 2010 +0100
@@ -58,6 +58,6 @@
 
 @see TVersion
 */
-const TInt KF32BuildVersionNumber=3042;
+const TInt KF32BuildVersionNumber=3044;
 //
 #endif
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/scomp/base_f32_scomp.mrp
--- a/userlibandfileserver/fileserver/scomp/base_f32_scomp.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/scomp/base_f32_scomp.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "Composite File System"
 
 component	base_f32_scomp
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat/base_f32_sfat.mrp
--- a/userlibandfileserver/fileserver/sfat/base_f32_sfat.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat/base_f32_sfat.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "FAT File System"
 
 component	base_f32_sfat
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/base_f32_sfat32.mrp
--- a/userlibandfileserver/fileserver/sfat32/base_f32_sfat32.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/base_f32_sfat32.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "FAT32 File System"
 
 component	base_f32_sfat32
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/fat_table32.cpp
--- a/userlibandfileserver/fileserver/sfat32/fat_table32.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/fat_table32.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1480,7 +1480,7 @@
                 {//-- test property for this drive is defined
                     if(nMntDebugFlags & KMntDisable_FatBkGndScan)
                     {
-                    __PRINT(_L("#- FAT32 BkGnd scan is disabled is disabled by debug interface."));
+                    __PRINT(_L("#- FAT32 BkGnd scan is disabled by debug interface."));
                     bFat32BkGndScan = EFalse;
                     }
             
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/inc/sl_scandrv.h
--- a/userlibandfileserver/fileserver/sfat32/inc/sl_scandrv.h	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/inc/sl_scandrv.h	Thu Jun 10 11:48:01 2010 +0100
@@ -134,6 +134,7 @@
 	
 	void FixPartEntryL();
 	void FixMatchingEntryL();
+	void FixHangingClusterChainL(TUint32 aFatEocIndex);
 	void MovePastEntriesL(TEntryPos& aEntryPos,TFatDirEntry& aEntry,TInt aToMove,TInt& aDirEntries);
 	void AddToClusterListL(TInt aCluster);
 	inline TBool AlreadyExistsL(TInt aCluster)const;
@@ -150,37 +151,39 @@
 protected:
 	
     /**
-    Internal ScanDrive mode specific errors. In Rugged FAT mode (current implementatio) any type of error of this kind can occur only once and it will be fixed.
-    Othersise the FS is considered to be corrupted
+    Internal ScanDrive mode specific errors.
+    In Rugged FAT mode (current implementation) any type of error of this kind can occur only once and it will be fixed.
+    Otherwise the FS is considered to be corrupted.
     */
     enum TDirError 
         {
-        ENoDirError= 0,         ///< no errors found
+        ENoDirError= 0,         ///< No errors found
         EScanMatchingEntry=1,   ///< Two entries pointing to the same cluster chain; Rugged FAT rename/replace artefact
         EScanPartEntry,         ///< Deleted DOS entry and orphaned VFAT ones from the same entryset; Rugged FAT 'file/dir delete' artefact
         };
 
 
 private:
-	CFatMountCB*            iMount;             ///< The owning Fat mount
+	CFatMountCB*            iMount;             ///< The owning FAT mount
 	
-    TPartVFatEntry          iPartEntry;         ///< Storage for a partial VFat entry set error, see EScanPartEntry
+    TPartVFatEntry          iPartEntry;         ///< Storage for a partial VFAT entry set error, see EScanPartEntry
 	TMatchingStartCluster   iMatching;          ///< Storage for Matching start cluster error, see EScanMatchingEntry
 	
-    TDirError               iDirError;          ///< Indicates the error tpye found also used to indicate if an error has occured
+    TDirError               iDirError;          ///< Indicates the error type found also used to indicate if an error has occured
+	TUint32                 iHangingClusters;	///< Number of hanging clusters found (and marked as EOF by ScanDrive), at which cluster chain
+												///< truncation should take place; Rugged FAT 'file shrinking/expanding' artefact
     TInt                    iDirsChecked;       ///< Count of the number of directories checked
 	TInt                    iRecursiveDepth;    ///< Depth of recursion the scan has reached
-	RArray<TInt>*           iClusterListArray[KMaxArrayDepth]; ///< Size in bytes of the bit packed Fat	Cluster list array used when maximum depth has been reached so that directory may be re-visited. Avoid stack overflow
-	
+	RArray<TInt>*           iClusterListArray[KMaxArrayDepth]; ///< Size in bytes of the bit packed FAT	cluster list array used when maximum depth
+															   ///< has been reached so that directory may be re-visited. Avoid stack overflow.
     TUint                   iListArrayIndex;    ///< Current position into cluster list array
-	TUint32                 iTruncationCluster; ///< Cluster at which cluster chain truncation should take place, used for truncation errors
 	TUint32                 iMaxClusters;       ///< Max. amount of clusters on the volume
 
-    RBitVector              iMediaFatBits;      ///< Storage for bit packed Fat read from media 
-    RBitVector              iScanFatBits;       ///< Storage for bit packed Fat built up by the scan
+    RBitVector              iMediaFatBits;      ///< Storage for bit packed FAT read from media 
+    RBitVector              iScanFatBits;       ///< Storage for bit packed FAT built up by the scan
 
     TGenericError           iGenericError;      ///< FS error that is discovered by scanning in any mode  
-    TScanDriveMode          iScanDriveMode;     ///< mode of operation
+    TScanDriveMode          iScanDriveMode;     ///< Mode of operation
 	};
 
 
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/inc/sl_std.h
--- a/userlibandfileserver/fileserver/sfat32/inc/sl_std.h	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/inc/sl_std.h	Thu Jun 10 11:48:01 2010 +0100
@@ -58,7 +58,7 @@
 class CFatFileSystem;
 
 /**
-Represents the position of a directory entery in terms of a cluster and off set into it
+Represents the position of a directory entry in terms of a cluster and offset into it
 */
 class TEntryPos
 	{
@@ -92,12 +92,12 @@
 
     //-- public interface to the local drive. Provides media driver's error handling (critical and non-critical user notifiers)
     //-- and thread-safety if required.
-	TInt ReadNonCritical(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset) const;
+	TInt ReadNonCritical(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag) const;
 	TInt ReadNonCritical(TInt64 aPos,TInt aLength,TDes8& aTrg) const;
 	TInt ReadCritical(TInt64 aPos,TInt aLength,TDes8& aTrg) const;
 	
     TInt WriteCritical(TInt64 aPos,const TDesC8& aSrc);
-    TInt WriteNonCritical(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset);
+    TInt WriteNonCritical(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag);
 	
     TInt GetLastErrorInfo(TDes8& aErrorInfo) const;
 
@@ -148,9 +148,9 @@
         inline void LeaveCriticalSection() const {iLock.Signal();}
 
         //-- methods' wrappers that are used by TDriveInterface
-        TInt Read(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset) const;
+        TInt Read(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag) const;
         TInt Read(TInt64 aPos,TInt aLength,TDes8& aTrg) const;
-        TInt Write(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset);
+        TInt Write(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag);
         TInt Write(TInt64 aPos, const TDesC8& aSrc);
         TInt GetLastErrorInfo(TDes8& aErrorInfo) const;
         TInt Caps(TDes8& anInfo) const;
@@ -336,7 +336,7 @@
 	@param aMessage	Refrence to server message from request
 	@param anOffset	Offset into read data to write
 	*/
-	virtual void ReadL(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset) const = 0;
+	virtual void ReadL(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag) const = 0;
 
 	/**
 	Disk write function
@@ -347,7 +347,7 @@
 	@param aMessage	Refrence to server message from request, contains data
 	@param anOffset	Offset into write data to use in write
 	*/
-	virtual void WriteL(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset) = 0;
+	virtual void WriteL(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag) = 0;
 
     
     virtual inline MWTCacheInterface* DirCacheInterface();
@@ -428,7 +428,7 @@
 
 
 /**
-Fat file system mount implmentation, provides all that is required of a plug in
+Fat file system mount implementation, provides all that is required of a plug in
 file system mount as well as Fat mount specific functionality 
 */
 class CFatMountCB : public CLocDrvMountCB, 
@@ -570,8 +570,8 @@
     void DirReadL(const TEntryPos& aPos,TInt aLength,TDes8& aDes) const;
     void DirWriteL(const TEntryPos& aPos,const TDesC8& aDes);
 
-	void ReadFromClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2& aMessage,TInt anOffset) const;
-    void WriteToClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2& aMessage,TInt anOffset, TUint& aBadcluster, TUint& aGoodcluster);
+	void ReadFromClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2& aMessage,TInt anOffset, TUint aFlag) const;
+    void WriteToClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2& aMessage,TInt anOffset, TUint& aBadcluster, TUint& aGoodcluster, TUint aFlag);
 	
 	void MoveToNextEntryL(TEntryPos& aPos) const;
 	void MoveToDosEntryL(TEntryPos& aPos,TFatDirEntry& anEntry) const;
@@ -703,8 +703,8 @@
 	void DoCheckFatForLoopsL(TUint32 aCluster, TUint32& aPreviousCluster, TUint32& aChangePreviousCluster, TUint32& aCount) const;
     void InitializeL(const TLocalDriveCaps& aLocDrvCaps, TBool aIgnoreFSInfo=EFalse);
 
-	void DoReadFromClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2& aMessage,TInt anOffset) const;
-    void DoWriteToClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2& aMessage,TInt anOffset, TUint aLastcluster, TUint& aBadcluster, TUint& aGoodcluster);
+	void DoReadFromClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2& aMessage,TInt anOffset, TUint aFlag) const;
+    void DoWriteToClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2& aMessage,TInt anOffset, TUint aLastcluster, TUint& aBadcluster, TUint& aGoodcluster, TUint aFlag);
 
 	TBool IsUniqueNameL(const TShortName& aName, TUint32 aDirCluster);
 	TBool FindShortNameL(const TShortName& aName,TEntryPos& anEntryPos);
@@ -900,10 +900,10 @@
     TUint     iStartCluster;     ///< Start cluster number of file
 	TEntryPos iCurrentPos;  ///< Current position in file data
 	
-    TEntryPos iFileDosEntryPos;  ///< File DOS dir. entry position
+    TEntryPos iFileDosEntryPos;	///< File DOS dir. entry position
 	
-    TBool iFileSizeModified :1;  ///< flag, indicating that file size was modified and needs to be flushed onto the media (see FlushL())
-    TBool iFileTimeModified :1;  ///< flag, indicating that file modification time was modified and needs to be flushed onto the media (see FlushL())
+    TBool iFileSizeModified :1;	///< flag, indicating that file size was modified and needs to be flushed onto the media (see FlushL())
+    TBool iFileTimeModified :1;	///< flag, indicating that file modification time was modified and needs to be flushed onto the media (see FlushL())
 
 	};
 
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/inc/sl_std.inl
--- a/userlibandfileserver/fileserver/sfat32/inc/sl_std.inl	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/inc/sl_std.inl	Thu Jun 10 11:48:01 2010 +0100
@@ -178,14 +178,14 @@
     }
 
 
-/** @return refrence to the fat table owned by the mount */
+/** @return reference to the fat table owned by the mount */
 CFatTable& CFatMountCB::FAT() const
 	{
     return(*iFatTable);
     }
 
 /**
-    @return refrence to the file system object that has produced this CFatMountCB
+    @return reference to the file system object that has produced this CFatMountCB
 */
 CFatFileSystem& CFatMountCB::FatFileSystem() const
 	{
@@ -495,7 +495,7 @@
 /**
 Returns the fat table used by the file system for this mount
 
-@return Refrence to the Fat table owned by the mount
+@return Reference to the Fat table owned by the mount
 */
 CFatTable& CFatFileCB::FAT()
 	{return(FatMount().FAT());}
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/sl_dir_cache.cpp
--- a/userlibandfileserver/fileserver/sfat32/sl_dir_cache.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/sl_dir_cache.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -27,9 +27,9 @@
 The static cache page creation function.
 Cache page objects are not supposed to be created on the stack, so this factory function is required.
 */
-TDynamicDirCachePage* TDynamicDirCachePage::NewL(CDynamicDirCache* aOwnerCache, TInt64 aStartMedPos, TUint8* aStartRamAddr)
+TDynamicDirCachePage* TDynamicDirCachePage::CreateCachePage(CDynamicDirCache* aOwnerCache, TInt64 aStartMedPos, TUint8* aStartRamAddr)
 	{
-	return new(ELeave) TDynamicDirCachePage(aOwnerCache, aStartMedPos, aStartRamAddr);
+	return new TDynamicDirCachePage(aOwnerCache, aStartMedPos, aStartRamAddr);
 	}
 
 /**
@@ -158,7 +158,7 @@
 
 	// allocate as many permanently locked pages as there are threads - plus one
 	// otherwise DoMakePageMRU() won't work properly with only one thread
-    //-- At present moment the size of TDrive thread pool is 1 (1 drive thread in a pool)
+	//-- At present moment the size of TDrive thread pool is 1 (1 drive thread in a pool)
 	const TUint KThreadCount = 1;
 	iPermanentlyAllocatedPageCount = KThreadCount + 1; 
 
@@ -167,7 +167,10 @@
 
 	for (TUint n=0; n<iPermanentlyAllocatedPageCount; n++)
 		{
-		TDynamicDirCachePage* pPage = AllocateAndLockNewPageL(0);
+		TDynamicDirCachePage* pPage = AllocateAndLockNewPage(0);
+		ASSERT(pPage);
+		if (!pPage)
+			User::Leave(KErrNoMemory);
 		AddFirstOntoQueue(pPage, TDynamicDirCachePage::ELocked);
 		LookupTblAdd(pPage);
 		}
@@ -694,47 +697,46 @@
 		}
 
 	TDynamicDirCachePage* pPage = FindPageByPos(aPos);
-    if (pPage)
-    	{
-    	ASSERT(pPage->IsValid());
+	if (pPage)
+		{
+		ASSERT(pPage->IsValid());
 		// lock page before make it MRU
-    	if (pPage->PageType() == TDynamicDirCachePage::EUnlocked)
-    		{
-    		ASSERT(!pPage->IsLocked());
-        	if (LockPage(pPage) == NULL)
-        		{
-        		DeQueue(pPage);
-        		LookupTblRemove(pPage->StartPos());
-        		DecommitPage(pPage);
-        		delete pPage;
-        		pPage = NULL;
-        		}
-    		}
-    	else
-    		{
-    		// error checking: page should either be locked or active
-    		ASSERT(LockPage(pPage) != NULL);
-    		}
-    	}
+		if (pPage->PageType() == TDynamicDirCachePage::EUnlocked)
+			{
+			ASSERT(!pPage->IsLocked());
+			if (LockPage(pPage) == NULL)
+				{
+				DeQueue(pPage);
+				LookupTblRemove(pPage->StartPos());
+				DecommitPage(pPage);
+				delete pPage;
+				pPage = NULL;
+				}
+			}
+		else
+			{
+			// error checking: page should either be locked or active
+			ASSERT(LockPage(pPage) != NULL);
+			}
+		}
 
-    // if page not found or page data not valid anymore, use active page to read data
-    if (!pPage)
-    	{
-        TRAPD(err, pPage = UpdateActivePageL(aPos));
-        if (err != KErrNone)
-        	{
-        	// problem occurred reading active page, return immediately.
-        	return;
-        	}
-    	}
+	// if page not found or page data not valid anymore, use active page to read data
+	if (!pPage)
+		{
+		TRAPD(err, pPage = UpdateActivePageL(aPos));
+		if (err != KErrNone)
+			{
+			// problem occurred reading active page, return immediately.
+			return;
+			}
+		}
 
-    // by now, the page is either locked or active page
+	// by now, the page is either locked or active page
 	ASSERT(pPage && pPage->IsValid() && pPage->IsLocked());
 
 
-
-	TBool allocateNewPage = pPage == iLockedQ.Last() && !CacheIsFull();
-
+	// if we used the active page (last on the queue), try to grow the cache.
+	TBool growCache = pPage == iLockedQ.Last();
 
 	switch (pPage->PageType())
 		{
@@ -762,24 +764,24 @@
 			ASSERT(0);
 		}
 
-	if (allocateNewPage)
-		{
-		TDynamicDirCachePage* nPage = NULL;
-		TRAPD(err, nPage = AllocateAndLockNewPageL(0));
-		if (err == KErrNone)
-			{
+	if (CacheIsFull() || !growCache)
+		return;
+
+	// attempt to grow the cache by appending a clean, new page at the end of the LRU list.
+	// This can fail when out of memory; the LRU mechanism then makes sure the oldest page will be re-used.
+	TDynamicDirCachePage* nPage = AllocateAndLockNewPage(0);
+	if (!nPage)
+		return;
 
-			// about to add a page to end of locked queue, so lie about iLockedQCount
-			iLockedQCount++;
-			CheckThresholds();
-			iLockedQCount--;
+	// about to add a page to end of locked queue, so lie about iLockedQCount
+	iLockedQCount++;
+	CheckThresholds();
+	iLockedQCount--;
 
-			iLockedQ.AddLast(*nPage);
-			nPage->SetPageType(TDynamicDirCachePage::ELocked);
-			++iLockedQCount;
-			LookupTblAdd(nPage);
-			}
-		}
+	iLockedQ.AddLast(*nPage);
+	nPage->SetPageType(TDynamicDirCachePage::ELocked);
+	++iLockedQCount;
+	LookupTblAdd(nPage);
 	}
 
 /**
@@ -898,21 +900,28 @@
 @param	aStartMedPos	the starting media address of the page to be created.
 @pre	aStartMedPos should not already be existing in the cache.
 */
-TDynamicDirCachePage* CDynamicDirCache::AllocateAndLockNewPageL(TInt64 aStartMedPos)
+TDynamicDirCachePage* CDynamicDirCache::AllocateAndLockNewPage(TInt64 aStartMedPos)
 	{
-	__PRINT1(_L("CDynamicDirCache::AllocateAndLockNewPageL(aStartMedPos=%lx)"), aStartMedPos);
+	__PRINT1(_L("CDynamicDirCache::AllocateAndLockNewPage(aStartMedPos=%lx)"), aStartMedPos);
 
 	TUint8* startRamAddr = iCacheMemoryClient->AllocateAndLockSegments(PageSizeInSegs());
-	if (startRamAddr)
+
+	if (!startRamAddr)
+		return NULL;
+
+	TDynamicDirCachePage* pPage = TDynamicDirCachePage::CreateCachePage(this, aStartMedPos, startRamAddr);
+
+	// Failure would mean the cache chunk was able to grow but we've run out of heap.
+	// This seems extremely unlikely, but decommit the now-unmanageable cache segment just in case.
+	if (!pPage)
 		{
-		// create new page and return
-		TDynamicDirCachePage* pPage = TDynamicDirCachePage::NewL(this, aStartMedPos, startRamAddr);
-		pPage->SetLocked(ETrue);
-		pPage->SetValid(EFalse);
-		return pPage;
+		iCacheMemoryClient->DecommitSegments(startRamAddr, PageSizeInSegs());
+		return NULL;
 		}
 
-	return NULL;
+	pPage->SetLocked(ETrue);
+	pPage->SetValid(EFalse);
+	return pPage;
 	}
 
 #ifdef _DEBUG
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/sl_dir_cache.h
--- a/userlibandfileserver/fileserver/sfat32/sl_dir_cache.h	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/sl_dir_cache.h	Thu Jun 10 11:48:01 2010 +0100
@@ -47,7 +47,7 @@
 
 public:
 	~TDynamicDirCachePage();
-	static TDynamicDirCachePage* NewL(CDynamicDirCache* aOwnerCache, TInt64 aStartMedPos, TUint8* aStartRamAddr);
+	static TDynamicDirCachePage* CreateCachePage(CDynamicDirCache* aOwnerCache, TInt64 aStartMedPos, TUint8* aStartRamAddr);
 	
 	inline void	SetLocked(TBool);
 	inline TBool	IsLocked() const;
@@ -145,7 +145,7 @@
 
 	TDynamicDirCachePage* FindPageByPos(TInt64 aPos);
 	TDynamicDirCachePage* UpdateActivePageL(TInt64 aPos);
-	TDynamicDirCachePage* AllocateAndLockNewPageL(TInt64 aStartMedPos);
+	TDynamicDirCachePage* AllocateAndLockNewPage(TInt64 aStartMedPos);
 	TUint8* LockPage(TDynamicDirCachePage* aPage);
 	TInt 	UnlockPage(TDynamicDirCachePage* aPage);
 	TInt 	DecommitPage(TDynamicDirCachePage* aPage);
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/sl_disk.cpp
--- a/userlibandfileserver/fileserver/sfat32/sl_disk.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/sl_disk.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -286,11 +286,11 @@
 
     @leave on error
 */
-void CAtaDisk::ReadL(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset) const
+void CAtaDisk::ReadL(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag) const
 	{
 
 	__PRINT4(_L("CAtaDisk::ReadL() pos:%u:%u, len:%u, offset:%u"), I64HIGH(aPos), I64LOW(aPos), aLength, anOffset);
-	User::LeaveIfError(iDrive.ReadNonCritical(aPos,aLength,aTrg,aMessage,anOffset));
+	User::LeaveIfError(iDrive.ReadNonCritical(aPos,aLength,aTrg,aMessage,anOffset, aFlag));
 	}
 
 //-------------------------------------------------------------------------------------
@@ -309,12 +309,12 @@
 
     @leave on error
 */
-void CAtaDisk::WriteL(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset)
+void CAtaDisk::WriteL(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag)
 	{
     __PRINT4(_L("CAtaDisk::WriteL() pos:%u:%u, len:%u, offset:%u"), I64HIGH(aPos), I64LOW(aPos), aLength, anOffset);
 
 	//-- write data to the media directly
-    User::LeaveIfError(iDrive.WriteNonCritical(aPos,aLength,aSrc,aMessage,anOffset));
+    User::LeaveIfError(iDrive.WriteNonCritical(aPos,aLength,aSrc,aMessage,anOffset, aFlag));
 
     //-- we need to invalidate UID cache page that corresponds to aPos (if any). This is UID caching specific. UID is stored in the first few bytes of 
     //-- the executable module and therefore belongs to one cache page only.
@@ -444,7 +444,7 @@
 //
 // Read from ramDrive into thread relative descriptor
 //
-void CRamDisk::ReadL(TInt64 aPos,TInt aLength,const TAny* /*aTrg*/,const RMessagePtr2 &aMessage,TInt anOffset) const
+void CRamDisk::ReadL(TInt64 aPos,TInt aLength,const TAny* /*aTrg*/,const RMessagePtr2 &aMessage,TInt anOffset, TUint /*aFlag*/) const
 	{
 	__PRINT2(_L("CRamDisk::ReadL TAny* Pos 0x%x, Len %d"),aPos,aLength);
 	__ASSERT_ALWAYS((aPos+aLength<=I64INT(iFatMount->Size())) && (aLength>=0),User::Leave(KErrCorrupt));
@@ -457,7 +457,7 @@
 //
 // Write from thread relative descriptor into ramDrive
 //
-void CRamDisk::WriteL(TInt64 aPos,TInt aLength,const TAny* /*aSrc*/,const RMessagePtr2 &aMessage,TInt anOffset)
+void CRamDisk::WriteL(TInt64 aPos,TInt aLength,const TAny* /*aSrc*/,const RMessagePtr2 &aMessage,TInt anOffset, TUint /*aFlag*/)
 	{
 	__PRINT2(_L("CRamDisk::WriteL TAny* Pos 0x%x, Len %d"),aPos,aLength);
 	__ASSERT_ALWAYS(aPos+aLength<=I64INT(iFatMount->Size()),User::Leave(KErrCorrupt));
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/sl_disk.h
--- a/userlibandfileserver/fileserver/sfat32/sl_disk.h	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/sl_disk.h	Thu Jun 10 11:48:01 2010 +0100
@@ -49,8 +49,8 @@
     virtual void InvalidateUidCachePage(TUint64 aPos);
 
 	
-    void ReadL(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset) const;
-	void WriteL(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset);
+    void ReadL(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag) const;
+	void WriteL(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag);
 	virtual TInt GetLastErrorInfo(TDes8& aErrorInfo) const;
 
     MWTCacheInterface* DirCacheInterface();
@@ -80,11 +80,9 @@
 public:
 	void ReadCachedL(TInt64 aPos,TInt aLength,TDes8& aDes) const;
 	void WriteCachedL(TInt64 aPos,const TDesC8& aDes);
-	void ReadL(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset) const;
-	void WriteL(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset);
-
-    
-
+	void ReadL(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag) const;
+	void WriteL(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag);
+	
 private:
 	inline TUint8 *RamDiskBase() const;
 
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/sl_drv.cpp
--- a/userlibandfileserver/fileserver/sfat32/sl_drv.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/sl_drv.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,4 +1,4 @@
-// Copyright (c) 1996-2009 Nokia Corporation and/or its subsidiary(-ies).
+// Copyright (c) 1996-2010 Nokia Corporation and/or its subsidiary(-ies).
 // All rights reserved.
 // This component and the accompanying materials are made available
 // under the terms of the License "Eclipse Public License v1.0"
@@ -46,12 +46,11 @@
     Close the interface to the media driver
 */
 void TDriveInterface::Close()
-{
-	 if(iMount)
+{	 
+	 if((iMount != NULL) && (iMount->LocalDrive() != NULL))
 		{
 		iMount->LocalDrive()->SetMount(NULL);
-        }
-
+		}
      iMount = NULL;
 }
 
@@ -118,7 +117,7 @@
     @return KErrBadPower - failure due to low power
 
 */
-TInt TDriveInterface::ReadNonCritical(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset) const
+TInt TDriveInterface::ReadNonCritical(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag) const
 {
     //__PRINT2(_L("#=+++ Read_nc2: pos:%LU, len:%u"), aPos, aLength);
 
@@ -127,7 +126,7 @@
 
     for(;;)
     {
-        nRes = iProxyDrive.Read(aPos, aLength, aTrg, aMessage, anOffset);
+        nRes = iProxyDrive.Read(aPos, aLength, aTrg, aMessage, anOffset, aFlag);
         if (nRes==KErrNone)
             break;
 
@@ -201,7 +200,7 @@
     @return KErrCorrupt - an illegal write is detected
     @return KErrAccessDenied - write to protected media
 */
-TInt TDriveInterface::WriteNonCritical(TInt64 aPos, TInt aLength, const TAny* aSrc, const RMessagePtr2 &aMessage, TInt anOffset)
+TInt TDriveInterface::WriteNonCritical(TInt64 aPos, TInt aLength, const TAny* aSrc, const RMessagePtr2 &aMessage, TInt anOffset, TUint aFlag)
 {
     //__PRINT2(_L("#=+++ Write_NC: pos:%LU, len:%u"), aPos, aLength);
 
@@ -212,7 +211,7 @@
     for(;;)
     {
         iMount->OpenMountForWrite(); //-- make a callback to CFatMountCB to perform some actions on 1st write.
-        nRes = iProxyDrive.Write(aPos, aLength, aSrc, aMessage, anOffset);
+        nRes = iProxyDrive.Write(aPos, aLength, aSrc, aMessage, anOffset, aFlag);
         if (nRes==KErrNone)
             break;
 
@@ -543,10 +542,10 @@
 
 //-- see original TDriveInterface methods
 
-TInt TDriveInterface::XProxyDriveWrapper::Read(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset) const
+TInt TDriveInterface::XProxyDriveWrapper::Read(TInt64 aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag) const
 {
     EnterCriticalSection();
-    TInt nRes = iLocalDrive->Read(aPos, aLength, aTrg, aMessage.Handle(), anOffset);
+    TInt nRes = iLocalDrive->Read(aPos, aLength, aTrg, aMessage.Handle(), anOffset, aFlag);
     LeaveCriticalSection();
     return nRes;
 }
@@ -559,10 +558,10 @@
     return nRes;
 }
 
-TInt TDriveInterface::XProxyDriveWrapper::Write(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset)
+TInt TDriveInterface::XProxyDriveWrapper::Write(TInt64 aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2 &aMessage,TInt anOffset, TUint aFlag)
 {
     EnterCriticalSection();
-    TInt nRes = iLocalDrive->Write(aPos, aLength, aSrc, aMessage.Handle(), anOffset);
+    TInt nRes = iLocalDrive->Write(aPos, aLength, aSrc, aMessage.Handle(), anOffset, aFlag);
     LeaveCriticalSection();
     return nRes;
 }
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/sl_fatcache32.cpp
--- a/userlibandfileserver/fileserver/sfat32/sl_fatcache32.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/sl_fatcache32.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -699,6 +699,7 @@
 
 /**
     Writes FAT cache page sector to the media (to all copies of the FAT)
+
     @param  aSector page sector number
 */
 void CFat32LruCachePage::DoWriteSectorL(TUint32 aSector)
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/sl_file.cpp
--- a/userlibandfileserver/fileserver/sfat32/sl_file.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/sl_file.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -11,7 +11,7 @@
 // Contributors:
 //
 // Description:
-// f32\sfat\sl_file.cpp
+// f32\sfat32\sl_file.cpp
 // 
 //
 
@@ -245,8 +245,10 @@
 	
 	if((startPos + length > curSize) || (startPos > startPos + length) )
 		aLength=curSize-startPos;
+		
+	TUint flag = DirectIOMode(aMessage) ? RLocalDrive::ELocDrvDirectIO : 0;
 	
-    FatMount().ReadFromClusterListL(iCurrentPos,aLength,aDes,aMessage,aOffset);
+    FatMount().ReadFromClusterListL(iCurrentPos,aLength,aDes,aMessage,aOffset, flag);
 	aLength=iCurrentPos.iPos-startPos;
 	}
 
@@ -295,7 +297,9 @@
 	TUint badcluster=0;
 	TUint goodcluster=0;
    	
-	TRAPD(ret, FatMount().WriteToClusterListL(iCurrentPos,aLength,aSrc,aMessage,aOffset,badcluster, goodcluster));
+	TUint flag = DirectIOMode(aMessage) ? RLocalDrive::ELocDrvDirectIO : 0;
+	
+	TRAPD(ret, FatMount().WriteToClusterListL(iCurrentPos,aLength,aSrc,aMessage,aOffset,badcluster, goodcluster, flag));
    	
 	if (ret == KErrCorrupt || ret == KErrDied)
 		{
@@ -367,7 +371,7 @@
 		}
 	aLength=iCurrentPos.iPos-startPos;
 
-	if(FatMount().IsRuggedFSys() && pos+(TUint)aLength > FCB_FileSize())
+	if(!IsSequentialMode() && FatMount().IsRuggedFSys() && pos+(TUint)aLength > FCB_FileSize())
 		{
 		WriteFileSizeL(pos+aLength);
 		}
@@ -381,7 +385,6 @@
 	}
 
 
-
 //-----------------------------------------------------------------------------
 
 void CFatFileCB::ResizeIndex(TInt aNewMult,TUint aNewSize)
@@ -502,7 +505,7 @@
 	if (I64HIGH(aSize))
 		User::Leave(KErrNotSupported);
 
-    DoSetSizeL(I64LOW(aSize), FatMount().IsRuggedFSys());
+	DoSetSizeL(I64LOW(aSize), FatMount().IsRuggedFSys());
 	}
 
 
@@ -520,7 +523,7 @@
 	    ASSERT(FCB_FileSize());
         ASSERT(FileSizeModified());
         
-            ClearIndex(0); //-- clear seek index array
+        ClearIndex(0); // Clear seek index array
 		
         //-- update file dir. entry
         const TUint32 cluster = FCB_StartCluster();
@@ -608,8 +611,8 @@
 	
 		FAT().FlushL();
 		
-        if(aForceCachesFlush)			// write file size if increasing
-			WriteFileSizeL(aNewSize);
+        if(!IsSequentialMode() && aForceCachesFlush)	// Write file size directly to its dir. entry if a cache flush
+			WriteFileSizeL(aNewSize);				// is needed and rugged FAT is not ignored by client
 		}
 
 	}
@@ -884,7 +887,6 @@
 	}
 
 
-
 TInt CFatFileCB::GetInterface(TInt aInterfaceId,TAny*& aInterface,TAny* aInput)
 	{
 	switch(aInterfaceId)
@@ -906,8 +908,6 @@
 	}
 
 
-
-
 /**
     Overwrites file's start cluster (iStartCluster) in its directory entry.
 */
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/sl_mnt.cpp
--- a/userlibandfileserver/fileserver/sfat32/sl_mnt.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/sl_mnt.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1607,7 +1607,7 @@
 /**
     Overwrite as many contiguous file clusters as possible.
 */
-void CFatMountCB::DoWriteToClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2& aMessage,TInt anOffset, TUint aLastcluster, TUint& aBadcluster, TUint& aGoodcluster)
+void CFatMountCB::DoWriteToClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2& aMessage,TInt anOffset, TUint aLastcluster, TUint& aBadcluster, TUint& aGoodcluster, TUint aFlag)
     {
 
     __PRINT(_L("CFatMountCB::DoWriteToClusterListL"));
@@ -1621,7 +1621,7 @@
     const TInt writeLength=Min(aLength,(clusterListLen<<ClusterSizeLog2())-clusterRelativePos);
     TInt64 dataStart=FAT().DataPositionInBytes(aPos.iCluster)+clusterRelativePos;
 
-    TRAPD(r, iRawDisk->WriteL(dataStart,writeLength,aSrc,aMessage,anOffset));
+    TRAPD(r, iRawDisk->WriteL(dataStart,writeLength,aSrc,aMessage,anOffset, aFlag));
 
     if(r == KErrNone) // Write succeded
         {
@@ -1736,7 +1736,7 @@
 
 //-----------------------------------------------------------------------------------------
 
-void CFatMountCB::WriteToClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2& aMessage,TInt anOffset, TUint& aBadcluster, TUint& aGoodcluster)
+void CFatMountCB::WriteToClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aSrc,const RMessagePtr2& aMessage,TInt anOffset, TUint& aBadcluster, TUint& aGoodcluster, TUint aFlag)
 //
 // Overwrite cluster list.
 //
@@ -1758,7 +1758,7 @@
     TInt previouscluster=0;
     FOREVER
         {
-        DoWriteToClusterListL(aPos,length-offset,aSrc,aMessage,anOffset+offset, previouscluster, aBadcluster, aGoodcluster);
+        DoWriteToClusterListL(aPos,length-offset,aSrc,aMessage,anOffset+offset, previouscluster, aBadcluster, aGoodcluster, aFlag);
         if (offset == (aPos.iPos-startPos))
             continue;
         offset=aPos.iPos-startPos;
@@ -1773,7 +1773,7 @@
 
 //-----------------------------------------------------------------------------------------
 
-void CFatMountCB::DoReadFromClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2& aMessage,TInt anOffset) const
+void CFatMountCB::DoReadFromClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2& aMessage,TInt anOffset, TUint aFlag) const
 //
 // Read from as many contiguous file clusters as possible
 //
@@ -1789,7 +1789,7 @@
     const TInt readLength=Min(aLength,(clusterListLen<<ClusterSizeLog2())-clusterRelativePos);
     const TInt64 dataStart=FAT().DataPositionInBytes(aPos.iCluster)+clusterRelativePos;
 
-    TRAPD(r, iRawDisk->ReadL(dataStart,readLength,aTrg,aMessage,anOffset));
+    TRAPD(r, iRawDisk->ReadL(dataStart,readLength,aTrg,aMessage,anOffset, aFlag));
 
     if(r == KErrNone) // Read succeded
         {
@@ -1814,7 +1814,7 @@
 
 //-----------------------------------------------------------------------------------------
 
-void CFatMountCB::ReadFromClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2& aMessage,TInt anOffset) const
+void CFatMountCB::ReadFromClusterListL(TEntryPos& aPos,TInt aLength,const TAny* aTrg,const RMessagePtr2& aMessage,TInt anOffset, TUint aFlag) const
 //
 // Read from cluster list
 //
@@ -1834,7 +1834,7 @@
     TInt offset=0;
     FOREVER
         {
-        DoReadFromClusterListL(aPos,aLength-offset,aTrg,aMessage,anOffset+offset);
+        DoReadFromClusterListL(aPos,aLength-offset,aTrg,aMessage,anOffset+offset, aFlag);
         offset=aPos.iPos-startPos;
         if ((offset<aLength))
             {
@@ -3228,7 +3228,7 @@
 			TInt readLength = Min(aLength-readTotal,(clusterListLen<<ClusterSizeLog2())-pos);
 			__ASSERT_DEBUG(readLength>0,Fault(EReadFileSectionFailed));
 			TInt64 dataAddress=(FAT().DataPositionInBytes(cluster))+pos;
-			iRawDisk->ReadL(dataAddress,readLength,aTrg,aMessage,readTotal);
+			iRawDisk->ReadL(dataAddress,readLength,aTrg,aMessage,readTotal, 0);
 			readTotal += readLength;
 
 			if (readTotal == aLength)
@@ -3256,7 +3256,7 @@
 // Read aLength of data from disk directly to thread relative descriptor
 //
     {
-    iRawDisk->ReadL(aPos,aLength,aTrg,aMessage,anOffset);
+    iRawDisk->ReadL(aPos,aLength,aTrg,aMessage,anOffset, 0);
     }
 
 //-----------------------------------------------------------------------------------------
@@ -3271,7 +3271,7 @@
 	//-- check if we are trying to write to the FAT directly and wait until FAT scan thread finishes in this case.
     FAT().RequestRawWriteAccess(aPos, aLength);
 
-    iRawDisk->WriteL(aPos,aLength,aSrc,aMessage,anOffset);
+    iRawDisk->WriteL(aPos,aLength,aSrc,aMessage,anOffset, 0);
     //-- Note: FAT directory cache will be invalidated in MountL()
     }
 
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/sl_mnt32.cpp
--- a/userlibandfileserver/fileserver/sfat32/sl_mnt32.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/sl_mnt32.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -1073,7 +1073,7 @@
 			TInt readLength = (TInt)Min((TInt64)(aLength-readTotal),(clusterListLen<<ClusterSizeLog2())-pos);
 			__ASSERT_DEBUG(readLength>0,Fault(EReadFileSectionFailed));
 			TInt64 dataAddress=(FAT().DataPositionInBytes(cluster))+pos;
-			iRawDisk->ReadL(dataAddress,readLength,aTrg,aMessage,readTotal);
+			iRawDisk->ReadL(dataAddress,readLength,aTrg,aMessage,readTotal, 0);
 			readTotal += readLength;
 
 			if (readTotal == aLength)
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfat32/sl_scan32.cpp
--- a/userlibandfileserver/fileserver/sfat32/sl_scan32.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfat32/sl_scan32.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -72,10 +72,11 @@
     ASSERT(aMount);
 
     //--- setting up 
-    iMount=aMount;
-    iGenericError = ENoErrors;
-    iDirError     = ENoDirError;  
-    iMaxClusters  = iMount->UsableClusters()+KFatFirstSearchCluster; //-- UsableClusters() doesn't count first 2 unused clusers
+	iMount			 = aMount;
+	iGenericError	 = ENoErrors;
+	iDirError		 = ENoDirError;
+	iHangingClusters = 0;
+	iMaxClusters	 = iMount->UsableClusters()+KFatFirstSearchCluster; //-- UsableClusters() doesn't count first 2 unused clusers
     //------------------------------
 	
     //-- create bit vectors that will represent FAT on media and reconstructed by ScanDrive. Each bit in the vector represents 1 FAT cluster.
@@ -94,7 +95,7 @@
 //----------------------------------------------------------------------------------------------------
 /**
     FAT type-agnostic parser. Reads whole FAT and sets up a bit vector.
-    for FAT12/16 it's OK, because the FAT12/16 is fully cached.
+    For FAT12/16 it's OK, because the FAT12/16 is fully cached.
 */
 void CScanDrive::DoParseFatL()
     {
@@ -109,7 +110,7 @@
         const TUint32 nFatEntry = ReadFatL(i);
        
         //-- each '1' bit represents a used cluster 
-        if(nFatEntry != KSpareCluster) 
+        if(nFatEntry != KSpareCluster)
             iMediaFatBits.SetBit(i);
 	    }
     }
@@ -125,7 +126,7 @@
     ASSERT((aBuf.Size() & (sizeof(TFat32Entry)-1)) == 0);
     
     const TInt KNumEntries = aBuf.Size() >> KFat32EntrySzLog2;
-    const TFat32Entry* const pFatEntry = (const TFat32Entry*)(aBuf.Ptr()); 
+    const TFat32Entry* const pFatEntry = (const TFat32Entry*)(aBuf.Ptr());
 
     for(TInt i=0; i<KNumEntries; ++i)
         {
@@ -161,11 +162,11 @@
 
     iMediaFatBits.Fill(0);
 
-    RBuf8 buf;
-    CleanupClosePushL(buf);
+    RBuf8 fatParseBuf;
+    CleanupClosePushL(fatParseBuf);
 
     //-- allocate memory for FAT parse buffer
-    buf.CreateMaxL(KFatBufSz);
+    fatParseBuf.CreateMaxL(KFatBufSz);
 
     //-- read FAT directly from the media into the large buffer and parse it
     TUint32 rem = KFatSize;
@@ -175,10 +176,10 @@
     while(rem)
         {
         const TUint32 bytesToRead=Min(rem, KFatBufSz);
-        TPtrC8 ptrData(buf.Ptr(), bytesToRead);
+        TPtrC8 ptrData(fatParseBuf.Ptr(), bytesToRead);
 
         //-- read portion of the FAT into buffer
-        User::LeaveIfError(iMount->LocalDrive()->Read(mediaPos, bytesToRead, buf)); 
+        User::LeaveIfError(iMount->LocalDrive()->Read(mediaPos, bytesToRead, fatParseBuf)); 
 
         //-- parse the buffer and populate bit vector
         DoParseFat32Buf(ptrData, currFatEntry);
@@ -187,8 +188,8 @@
         rem -= bytesToRead;
         }
 
-    buf.Close();
-    CleanupStack::PopAndDestroy(&buf); 
+    fatParseBuf.Close();
+    CleanupStack::PopAndDestroy(&fatParseBuf); 
     }
 
 
@@ -241,7 +242,7 @@
 }
 
 /**
-    Sets the flag indicating than there are errors in filesystem structure
+    Sets the flag indicating that there are errors in filesystem structure
     See ProblemsDiscovered()
 
     @param  aError a code describing the error
@@ -255,8 +256,9 @@
 
 //----------------------------------------------------------------------------------------------------
 /**
-    Start the scanner. The this calss description about what it actually does.
-    @param  aMode specifies the operational mode.
+    Starts the scanner.
+    
+    @param	aMode	Specifies the operational mode.
 */
 void CScanDrive::StartL(TScanDriveMode aMode)
 	{
@@ -299,7 +301,6 @@
 
 	PrintErrors();
 
-
     timeEnd.UniversalTime(); //-- take end time
     const TInt elapsedTime = (TInt)( (timeEnd.MicroSecondsFrom(timeStart)).Int64() / K1mSec);
     (void)elapsedTime;
@@ -477,7 +478,7 @@
 	{
 	CheckDirL(iMount->RootIndicator());
 	// Due to recursive nature of CheckDirL when a depth of
-	// KMaxScanDepth is reached clusters are stored in a list
+	// KMaxScanDepth is reached, clusters are stored in a list
 	// and passed into CheckDirL afresh
 
 	for(TUint i=0;i<KMaxArrayDepth && iClusterListArray[i]!=NULL;++i)
@@ -517,7 +518,7 @@
 
 	TEntryPos entryPos(aCluster,0);
 	TInt dirEntries=0;
-	FOREVER
+	for(;;)
 		{
 		TFatDirEntry entry;
 		ReadDirEntryL(entryPos,entry);
@@ -659,11 +660,11 @@
 		{
         if(IsClusterUsedL(aCluster))
 			{//-- this cluster already seems to belong to some other object; crosslinked cluster chain. Can't fix it.
-                __PRINT1(_L("CScanDrive::RecordClusterChainL #1 %d"),aCluster); 
+            __PRINT1(_L("CScanDrive::RecordClusterChainL #1 %d"),aCluster); 
             
             if(CheckDiskMode())
-                {//-- in check disk mode this is a FS error; Indicate error and abort furter scanning
-                __PRINT(_L("CScanDrive::RecordClusterChainL #1.1")); 
+                {//-- in check disk mode this is an FS error; Indicate error and abort further scanning
+                __PRINT(_L("CScanDrive::RecordClusterChainL #1.1"));
                 IndicateErrorsFound(EClusterAlreadyInUse);
                 User::Leave(KErrCorrupt);
                 }
@@ -686,16 +687,26 @@
         if(clusterCount==1)
 			{//-- we have reached the end of the cluster chain
 			if(!iMount->IsEndOfClusterCh(ReadFatL(aCluster)))
-				{//-- seems to be a rugged FAT artefact; File truncation/extension had failed before and now file length is less than
-                 //-- the corresponding cluster chain shall be. It will be truncated to the size recorded in file DOS entry.
-				iTruncationCluster = aCluster;								
+				{
+				// According to the directory entry, we have reached the end of the cluster chain,
+				// whereas in the media FAT, it is not.
+				// This is a rugged FAT artefact; hanging cluster chain:
+				// 	A cluster chain which is longer in the FAT table than is recorded in the corresponding directory entry 
+				// 	or not terminated by an EOC entry in FAT.
+				// This is caused by:
+				//  - File truncation failing.
+				//	- OR file expanding failing during flushing to the media FAT.
                 
                 if(CheckDiskMode())
-                    {//-- in check disk mode this is a FS error; Indicate error and abort furter scanning
-                    __PRINT1(_L("CScanDrive::RecordClusterChainL #2 %d"),aCluster); 
+                    {//-- in check disk mode this is an FS error; Indicate error and abort further scanning
+                    __PRINT1(_L("CScanDrive::RecordClusterChainL #2 Hanging cluster=%d"),aCluster);
                     IndicateErrorsFound(EInvalidEntrySize);
                     User::Leave(KErrCorrupt);
                     }
+				
+				// The chain will be truncated to the size recorded in the file's DOS entry and
+				// the remaining lost cluster chain will be fixed later in CompareAndFixFatsL().
+				FixHangingClusterChainL(aCluster);
                 }
 
             //__PRINT1(_L("#--: %d -> EOC"), aCluster); 
@@ -762,8 +773,8 @@
         if(!IsValidVFatEntry(aEntry,toFollow))
 			return(EFalse);
 		}
-	
-    return(IsDosEntry(aEntry));
+	// A sequence of VFat entries must end with a Dos entry to be valid.
+	return(IsDosEntry(aEntry));
 	}
 
 //----------------------------------------------------------------------------------------------------
@@ -844,7 +855,7 @@
 
 //----------------------------------------------------------------------------------------------------
 /**
-    Scan for differnces in the new and old FAT table writing them to media if discovered
+    Scan for differences in the new and old FAT table writing them to media if discovered
     It is supposed to be called in 'ScanDrive' mode only
 
     @leave System wide error codes
@@ -884,9 +895,10 @@
                     continue;
                     }
          
-                //-- here we found a lost cluster. Its FAT entry will be replaced with KSpareCluster. In the case of multiple lost clusters FAT table will
-                //-- be flushed on media sector basis. It is much faster than flushing FAT after every write and will
-                //-- guarantee that FAT won't be corrupted if the media driver provides atomic sector write. 
+                //-- Here we found a lost cluster. Its FAT entry will be replaced with KSpareCluster.
+                //-- In the case of multiple lost clusters FAT table will be flushed on media sector basis.
+                //-- It is much faster than flushing FAT after every write and will guarantee
+                //-- that FAT won't be corrupted if the media driver provides atomic sector write. 
                 if(nClustersFixed == 0)
                     {//-- this is the first lost cluster entry we found
                     
@@ -901,7 +913,7 @@
                     const TUint32 fatSec = iMount->FAT().PosInBytes(i) >> KSectorSzLog2; 
 
                     if(fatSec != dirtyFatSector)
-                        {//-- we are going to write to a differrent media sector
+                        {//-- we are going to write to a different media sector
                         iMount->FAT().FlushL();
                         iMount->FAT().WriteL(i, KSpareCluster); //-- fix lost cluster
                         dirtyFatSector = fatSec;
@@ -927,18 +939,11 @@
     
     //------
 
-    if(iTruncationCluster != 0)
-        {
-	    iMount->FAT().WriteFatEntryEofL(iTruncationCluster); 
-		iMount->FAT().FlushL();
-		
-        //-- indicate that there are some problems in FAT. and we probably wrote something there.
-        IndicateErrorsFound(EScanDriveDirError); //-- indicate that we have found errors
-
-        ++nClustersFixed;
-        }
+	
+	// Add the number of hanging clusters fixed by ScanDrive
+	nClustersFixed += iHangingClusters;
     
-    __PRINT2(_L("CScanDrive::WriteNewFatsL() fixed:%d, bad:%d"), nClustersFixed, nBadClusters);
+    __PRINT3(_L("CScanDrive::WriteNewFatsL() fixed clusters=%d,hanging clusters=%d,bad clusters=%d"),nClustersFixed,iHangingClusters,nBadClusters);
     }
 
 //----------------------------------------------------------------------------------------------------
@@ -946,7 +951,6 @@
     Read the "Rugged FAT" ID, stored in reserved2 in the Dos entry or associated with the Dos entry of the 
     Entry at the position passed in. This is used to find which version of two matching entries should be kept.
 
-
     @param aVFatPos Position of an entry to read ID from
     @leave System wide error codes
     @return The ID found in reserved2 field of dos entry 
@@ -1015,6 +1019,28 @@
 
 //----------------------------------------------------------------------------------------------------
 /**
+	Fix a hanging cluster chain.
+	Writes EOF to the corresponding FAT entry, making this cluster chain length correspond to the 
+	real file size recorded in the directory entry.
+	The remainder of the chain will be cleaned up later in CompareAndFixFatsL().
+	
+	@leave	System wide error code
+*/
+void CScanDrive::FixHangingClusterChainL(TUint32 aFatEofIndex)
+	{
+	__PRINT1(_L("CScanDrive::FixHangingClusterL() Hanging cluster=%d"), aFatEofIndex);
+	
+	iMount->FAT().WriteFatEntryEofL(aFatEofIndex);
+	iMount->FAT().FlushL();
+	iHangingClusters++;
+	
+	// Indicate that we have found an error
+	IndicateErrorsFound(EScanDriveDirError);
+	}
+
+
+//----------------------------------------------------------------------------------------------------
+/**
     Move past specified number of entries
 
     @param aEntryPos Start position to move from, updated as move takes place
@@ -1087,35 +1113,26 @@
 		if(BoolXOR(bRealFatEntry, bNewFatEntry))
 		    {//-- mismatch between FAT on the media and the FAT bitmap restored by walking directory structure
 
-			    if(bRealFatEntry)
-                {//-- FAT[i] on the media is marked as occupied, but retored FAT bitmap shows that it is free
-                    if(iMount->IsBadCluster(ReadFatL(i)))
-                        continue; //-- this is a BAD cluster it can't be occupied by the FS object, OK.
+			if(bRealFatEntry)
+				{//-- FAT[i] on the media is marked as occupied, but restored FAT bitmap shows that it is free
+				if(iMount->IsBadCluster(ReadFatL(i)))
+					continue; //-- this is a BAD cluster it can't be occupied by the FS object, OK.
 
-                    __PRINT2(_L("FAT[%d] = %d\n"), i, ReadFatL(i));        
-                    __PRINT1(_L("iTruncationCluster = %d\n"), iTruncationCluster);        
-                    
-                    //-- this is a lost cluster
-                    if(!IsEofF(ReadFatL(i)) && (i==iTruncationCluster))
-                        {//-- seems to be a Rugged FAT ertefact
-                        __PRINT1(_L("Hanging cluster = %d\n"),i);        
-                        }
-                    else
-                        {
-                        __PRINT1(_L("Lost cluster=%d\n"),i);
-                        }
-                    
-                    
-                    IndicateErrorsFound(EBadClusterValue);
-                }
-                else
-                {//-- FAT[i] on the media is marked as free, but retored FAT bitmap shows that it is occupied by some object
-                    IndicateErrorsFound(EClusterAlreadyInUse);
-                    __PRINT1(_L("Unflushed cluster = %d\n"),i);
-                }
+				__PRINT2(_L("FAT[%d] = %d\n"), i, ReadFatL(i));
+				
+				//-- this is a Rugged FAT artefact; a lost cluster
+				__PRINT1(_L("Lost cluster=%d\n"),i);
+				
+				IndicateErrorsFound(EBadClusterValue);
+				}
+			else
+				{//-- FAT[i] on the media is marked as free, but restored FAT bitmap shows that it is occupied by some object
+				IndicateErrorsFound(EClusterAlreadyInUse);
+				__PRINT1(_L("Unflushed cluster = %d\n"),i);
+				}
 
-             if(aStopOnFirstErrorFound)
-                 break; //-- not asked to check for errors further
+		 if(aStopOnFirstErrorFound)
+			 break; //-- not asked to check for errors further
 
             }
 		
@@ -1187,13 +1204,13 @@
 	}	
 
 /**
-    Read a cluster from the Media Fat if scan run in a seperate thread read from scan fat table
+    Read a cluster from the Media Fat if scan run in a separate thread read from scan Fat table
     otherwise read from mount owned Fat table
 
     @param aClusterNum Cluster to read
     @return Value of cluster read from Fat
 */
-TUint32 CScanDrive::ReadFatL(TUint aClusterNum) 
+TUint32 CScanDrive::ReadFatL(TUint aClusterNum)
 	{
 	if(aClusterNum < KFatFirstSearchCluster || aClusterNum >= MaxClusters())
         {
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfile/sf_cache.cpp
--- a/userlibandfileserver/fileserver/sfile/sf_cache.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfile/sf_cache.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -610,8 +610,11 @@
 	if(r==KErrNoMemory)
 		return r;
 
+	iCache = (TFileCacheRecord**)User::ReAlloc(pIndexes,sizeof(TFileCacheRecord*)*currentIndex);
+	if(!iCache)
+	    return KErrNoMemory;
+	
 	iNotPresent = EFalse;
-	iCache = (TFileCacheRecord**)User::ReAlloc(pIndexes,sizeof(TFileCacheRecord*)*currentIndex);
 	iRecordCount = currentIndex;
 	if (currentIndex>1)
 		{
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfile/sf_debug.cpp
--- a/userlibandfileserver/fileserver/sfile/sf_debug.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfile/sf_debug.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -598,6 +598,33 @@
             TInt r=aRequest->Write(2,pkgBuf);
             return r;
             }
+        // Check if the file is in 'file sequential/non-rugged file' mode
+        case KControlIoIsFileSequential:
+        	{
+        	TDrive* drive = aRequest->Drive();
+        	if(!drive)
+        		return KErrNotSupported;
+        	
+        	// RFs::ControlIO uses narrow descriptors, so convert narrow back to wide
+        	TBuf8<KMaxPath> fileNameNarrow;
+        	TInt r = aRequest->Read(2, fileNameNarrow);
+        	if (r != KErrNone)
+        		return r;
+        	TFileName fileNameWide;
+        	fileNameWide.Copy(fileNameNarrow);
+        	
+        	// Locate the file
+        	CFileCB* file = drive->LocateFile(fileNameWide);
+        	if(!file)
+        		return KErrNotFound;
+        	
+        	// isFileSequential = 1 or 0 for EFileSequential mode enabled or disabled respectively
+        	TUint8 isFileSequential = (file->IsSequentialMode() != 0);
+        	TPtr8 pkgBuf(&isFileSequential,1,1);
+        	aRequest->Write(3, pkgBuf);
+        	
+        	return KErrNone;
+        	}
 		
 		}
 #endif
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfile/sf_file.cpp
--- a/userlibandfileserver/fileserver/sfile/sf_file.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfile/sf_file.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -701,8 +701,18 @@
 			// Current operation points to a local buffer
 			// The request originated from the file server (e.g. file cache) with a local message handle (KLocalMessageHandle)
 			TPtr8 dataDesc((TUint8*) currentOperation.iReadWriteArgs.iData + currentOperation.iReadWriteArgs.iOffset, len, len);
-			const RLocalMessage msg;
-			TRAP(r,file->ReadL(pos, len, &dataDesc, msg, 0));
+
+			// save the client's RMessage2
+			const RMessage2 msgClient = aRequest->Message();
+			
+			// overwrite RMessage2 in CFsMessageRequest with RLocalMessage 
+			const RLocalMessage msgLocal;					
+			const_cast<RMessage2&> (aRequest->Message()) = msgLocal;
+
+			TRAP(r,file->ReadL(pos, len, &dataDesc, aRequest->Message(), 0));
+							
+			// restore the client's RMessage2
+			const_cast<RMessage2&> (aRequest->Message()) = msgClient;
 			}
 		}
 
@@ -1099,8 +1109,18 @@
 		else
 			{
 			TPtr8 dataDesc((TUint8*) currentOperation.iReadWriteArgs.iData + currentOperation.iReadWriteArgs.iOffset, len, len);
-			const RLocalMessage msg;
-			TRAP(r,file->WriteL(pos, len, &dataDesc, msg, 0));
+
+			// save the client's RMessage2
+			const RMessage2 msgClient = aRequest->Message();
+			
+			// overwrite RMessage2 in CFsMessageRequest with RLocalMessage 
+			const RLocalMessage msgLocal;					
+			const_cast<RMessage2&> (aRequest->Message()) = msgLocal;
+
+			TRAP(r,file->WriteL(pos, len, &dataDesc, aRequest->Message(), 0));
+							
+			// restore the client's RMessage2
+			const_cast<RMessage2&> (aRequest->Message()) = msgClient;
 			}
 		}
 
@@ -3670,13 +3690,25 @@
 
 
 
-
-
-
-
-
-
-
-
-
-
+EXPORT_C TBool CFileCB::DirectIOMode(const RMessagePtr2& aMessage)
+	{
+	CFsMessageRequest* msgRequest = CFsMessageRequest::RequestFromMessage(aMessage);
+
+	TInt func = msgRequest->Operation()->Function();
+	ASSERT(func == EFsFileRead || func == EFsFileWrite || func == EFsFileWriteDirty || func == EFsReadFileSection);
+
+	CFileShare* share;
+	CFileCB* file;
+	GetFileFromScratch(msgRequest, share, file);
+	if (share == NULL)		// no share indicates this is a request originating from the file cache
+		return EFalse;
+
+	return func == EFsFileRead ? share->iMode & EFileReadDirectIO : share->iMode & EFileWriteDirectIO; 
+	}
+
+
+
+
+
+
+
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfile/sf_lepoc.cpp
--- a/userlibandfileserver/fileserver/sfile/sf_lepoc.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfile/sf_lepoc.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -3248,30 +3248,6 @@
 	}
 
 
-/**
-This function is defined because RArray does not natively support
-sorting 64-bit integers.
-
-It is used by FixupDlls to order the import fixup locations in the image
-so they can be organized by page.
-
-@param	aLeft			64-bit unsigned integer to compare against aRight.
-@param	aRight			64-bit unsigned integer to compare against aLeft.
-@return					-1 if aLeft < aRight; 0 if aLeft == aRight; and
-						+1 if aLeft > aRight.  This conforms to the behavior
-						which is expected from a function used by TLinearOrder.
-*/
-static TInt Uint64LinearOrderFunc(const TUint64& aLeft, const TUint64& aRight)
-	{
-	if (aLeft < aRight)
-		return -1;
-	else if (aLeft > aRight)
-		return 1;
-	else
-		return 0;
-	}
-
-
 TUint64* E32Image::ExpandFixups(TInt aNumFixups)
 	{
 	__IF_DEBUG(Printf("ExpandFixups,%d+%d", iFixupCount,aNumFixups));
@@ -3315,8 +3291,10 @@
 
 	// sort the array in address order, to organize by page
 	RArray<TUint64> fixup64ToSort(sizeof(TUint64), iFixups, iFixupCount);
-	// SortUnsigned doesn't work on TUint64
-	fixup64ToSort.Sort(TLinearOrder<TUint64>(Uint64LinearOrderFunc));
+
+	// address is in high word of entry, offset 4
+	fixup64ToSort.SetKeyOffset(4);
+	fixup64ToSort.SortUnsigned();
 
 	// now have <address | new-value> pairs, organize into pages.
 	// Each page is stored as fXXX YYYY ZZZZ where YYYY ZZZZ is written
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfile/sf_obj.cpp
--- a/userlibandfileserver/fileserver/sfile/sf_obj.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfile/sf_obj.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -129,7 +129,13 @@
 			if (newAlloc!=iAllocated)
 				{
 				if (newAlloc)
+				    {
 					iContainers=(CFsObjectCon**)User::ReAlloc(iContainers,newAlloc*sizeof(CFsObjectCon*));
+					if(!iContainers)
+					    {
+					    Fault(EContainerHeapCorruptionOnRemove);
+					    }
+				    }
 				else
 					{
 					delete iContainers;
@@ -489,7 +495,13 @@
 		if (newAlloc!=iAllocated)
 			{
 			if (newAlloc)
+			    {
 				iObjects=(SFsObjectIxRec*)User::ReAlloc(iObjects,newAlloc*sizeof(SFsObjectIxRec));
+				if(!iObjects)
+				    {
+                    Fault(EContainerHeapCorruptionOnRemove);
+				    }
+			    }
 			else
 				{
 				delete iObjects;
@@ -679,7 +691,13 @@
 			if (newAlloc!=iAllocated)
 				{
 				if (newAlloc)
+				    {
 					iObjects=(CFsObject**)User::ReAlloc(iObjects,newAlloc*sizeof(CFsObject*));
+					if(!iObjects)
+					    {
+					    Fault(EContainerHeapCorruptionOnRemove);
+					    }
+				    }
 				else
 					{
 					delete iObjects;
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfile/sf_plugin.h
--- a/userlibandfileserver/fileserver/sfile/sf_plugin.h	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfile/sf_plugin.h	Thu Jun 10 11:48:01 2010 +0100
@@ -66,7 +66,7 @@
 	static TInt IsInChain(TInt aUPos, TInt aPos,TInt aDrive, CFsPluginFactory* aPluginFactory);
 	static CFsPlugin* FindByUniquePosition(TInt aPos);
 
-	static TInt InitPlugin(CFsPlugin& aPlugin);
+	static TInt InitPlugin(CFsPlugin& aPlugin, RLibrary aLibrary);
 	static void TransferRequests(CPluginThread* aPluginThread);
 	static void CancelPlugin(CFsPlugin* aPlugin,CSessionFs* aSession);
 	static TInt ChainCount();
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfile/sf_plugin_man.cpp
--- a/userlibandfileserver/fileserver/sfile/sf_plugin_man.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfile/sf_plugin_man.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -162,7 +162,7 @@
 		return err;
 		}
 
-	err = InitPlugin(*pP);
+	err = InitPlugin(*pP, aPluginFactory.Library());
 	if(err != KErrNone)
 		{
 		return err;
@@ -624,13 +624,13 @@
 Create a plugin thread
 Should only by called from main file server thread with plugin thread unavailable
 */
-TInt FsPluginManager::InitPlugin(CFsPlugin& aPlugin)
+TInt FsPluginManager::InitPlugin(CFsPlugin& aPlugin, RLibrary aLibrary)
 	{
 	TInt err = KErrNone;
 
 	if(!aPlugin.iThreadP)
 		{
-		TRAP(err,aPlugin.iThreadP=CPluginThread::NewL(aPlugin));
+		TRAP(err,aPlugin.iThreadP=CPluginThread::NewL(aPlugin, aLibrary));
 		if(err!=KErrNone)
 			return err;
 		}
@@ -745,11 +745,12 @@
 
 	FsPluginManager::LockChain();
 	TInt count = FsPluginManager::ChainCount();
+	TInt oldCount = count;
 	TInt i;
 	for(i=0; i<count; i++)
 	    {
 	    CFsPlugin* plugin = NULL;
-	    User::LeaveIfError(FsPluginManager::Plugin(plugin, i));
+	    (void) FsPluginManager::Plugin(plugin, i); // (void) as chain is locked.
 	    __ASSERT_DEBUG(plugin, User::Leave(KErrNotFound));
 	    aRequest->iCurrentPlugin = plugin;
 	    aRequest->Status() = KRequestPending;
@@ -761,6 +762,12 @@
 	    FsPluginManager::LockChain();
 	    __ASSERT_ALWAYS(aRequest->Status().Int()==KErrNone||aRequest->Status().Int()==KErrCancel,Fault(ESessionDisconnectThread2));
 	    count = FsPluginManager::ChainCount();
+	    //If a plugin was removed whilst the chain was unlocked we need to make sure we don't skip any plugins
+	    if(count != oldCount)
+	        {
+	        i=0;
+	        oldCount = count;
+	        }
 	    }
 	FsPluginManager::UnlockChain();
 	
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfile/sf_plugin_ops.cpp
--- a/userlibandfileserver/fileserver/sfile/sf_plugin_ops.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfile/sf_plugin_ops.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -252,8 +252,11 @@
 	CFsPlugin* plugin=NULL;
 	FsPluginManager::LockChain();
 	TInt err = FsPluginManager::Plugin(plugin, aRequest->Message().Int2());
-	if(err != KErrNone)
+	if(err != KErrNone) //should be ok but just in case
+	    {
+	    FsPluginManager::UnlockChain();
 		return err;
+	    }
 
 	TInt r = KErrNotFound;
 	if(plugin)
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfile/sf_std.h
--- a/userlibandfileserver/fileserver/sfile/sf_std.h	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfile/sf_std.h	Thu Jun 10 11:48:01 2010 +0100
@@ -114,6 +114,8 @@
 #define __PLUGIN_PRINT3(t,a,b,c)
 #endif
 
+#define _LOFF(p,T,f) ((T*)(((TUint8*)(p))-_FOFF(T,f)))
+
 const TInt KMaxTotalDriveReserved	=0x100000;
 const TInt KMaxSessionDriveReserved	=0x10000;
 
@@ -807,7 +809,7 @@
 NONSHARABLE_CLASS(CPluginThread) : public CRequestThread
 	{
 public:
-	CPluginThread(CFsPlugin& aPlugin);
+	CPluginThread(CFsPlugin& aPlugin, RLibrary aLibrary);
 	~CPluginThread();
 	
 	void CompleteSessionRequests(CSessionFs* aSession, TInt aValue);
@@ -819,7 +821,7 @@
 	void OperationLockSignal();
 
 private:
-	static CPluginThread* NewL(CFsPlugin& aPlugin);
+	static CPluginThread* NewL(CFsPlugin& aPlugin, RLibrary aLibrary);
 	TUint StartL();
 	virtual TInt DoThreadInitialise();
 private:
@@ -828,6 +830,7 @@
 	/** @prototype */
 	RSemaphore iOperationLock;
 
+	RLibrary iLib;	// contains a handle to the library	which created the plugin
 friend class FsPluginManager;
 	};
 
@@ -1311,6 +1314,7 @@
 	inline void Init();
 	void ReStart();
 	TBool IsPluginRequest();
+	static inline CFsMessageRequest* RequestFromMessage(const RMessagePtr2& aMessage);
 	
    // UID of the process to touching the file. (To be used in notification framework).
    // TUid iUID;
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfile/sf_std.inl
--- a/userlibandfileserver/fileserver/sfile/sf_std.inl	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfile/sf_std.inl	Thu Jun 10 11:48:01 2010 +0100
@@ -252,6 +252,11 @@
 void CFsMessageRequest::SetMessage(RMessage2& aMessage) 
 	{iMessage=aMessage;}
 
+
+CFsMessageRequest* CFsMessageRequest::RequestFromMessage(const RMessagePtr2& aMessage)
+	{return _LOFF(&aMessage, CFsMessageRequest, iMessage);}
+
+
 TMsgOperation* CFsMessageRequest::CurrentOperationPtr()
 	{return iCurrentOperation;}
 
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/sfile/sf_thread.cpp
--- a/userlibandfileserver/fileserver/sfile/sf_thread.cpp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/sfile/sf_thread.cpp	Thu Jun 10 11:48:01 2010 +0100
@@ -926,24 +926,34 @@
 	}
 
 
-CPluginThread::CPluginThread(CFsPlugin& aPlugin)
-  : iPlugin(aPlugin)
+CPluginThread::CPluginThread(CFsPlugin& aPlugin, RLibrary aLibrary)
+  : iPlugin(aPlugin), iLib(aLibrary)
 	{
 	/** @prototype */
 	iOperationLock.Close();
 	iPlugin.Open();
+	
+    /* 
+    Duplicate the handle to the DLL which created the plugin to prevent 
+    TFsRemovePlugin::DoRequestL() from unmapping the DLL's code segment before
+    this thread's destructor has been called as the destructor closes the plugin 
+    which results in a call to the plugin's derived destructor contained in the DLL (!)
+    */ 
+    TInt r = iLib.Duplicate(iThread, EOwnerProcess);
+    __ASSERT_ALWAYS(r==KErrNone, Fault(EFsThreadConstructor));
 	}
 
 CPluginThread::~CPluginThread()
     {
     iPlugin.Close();
+	iLib.Close();
     }
 
 
-CPluginThread* CPluginThread::NewL(CFsPlugin& aPlugin)
+CPluginThread* CPluginThread::NewL(CFsPlugin& aPlugin, RLibrary aLibrary)
 	{
 	__PRINT(_L("CPluginThread::NewL()"));
-	CPluginThread* pT=new(ELeave) CPluginThread(aPlugin);
+	CPluginThread* pT=new(ELeave) CPluginThread(aPlugin, aLibrary);
 	TInt r=pT->Initialise();
 
 	/** @prototype */
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/shostmassstorage/base_f32_shostmassstorage.mrp
--- a/userlibandfileserver/fileserver/shostmassstorage/base_f32_shostmassstorage.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/shostmassstorage/base_f32_shostmassstorage.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "USB Host Mass Storage Server"
 
 component	base_f32_shostmassstorage
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/smassstorage/base_f32_smassstorage.mrp
--- a/userlibandfileserver/fileserver/smassstorage/base_f32_smassstorage.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/smassstorage/base_f32_smassstorage.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "USB Mass Storage File System"
 
 component	base_f32_smassstorage
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/srofs/base_f32_srofs.mrp
--- a/userlibandfileserver/fileserver/srofs/base_f32_srofs.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/srofs/base_f32_srofs.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "ROFS File System"
 
 component	base_f32_srofs
diff -r 5e441a173c63 -r d9f1e5bfe28c userlibandfileserver/fileserver/srom/base_f32_srom.mrp
--- a/userlibandfileserver/fileserver/srom/base_f32_srom.mrp	Mon May 24 18:45:46 2010 +0100
+++ b/userlibandfileserver/fileserver/srom/base_f32_srom.mrp	Thu Jun 10 11:48:01 2010 +0100
@@ -1,18 +1,3 @@
-#
-# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-# All rights reserved.
-# This component and the accompanying materials are made available
-# under the terms of "Eclipse Public License v1.0"
-# which accompanies this distribution, and is available
-# at the URL "http://www.eclipse.org/legal/epl-v10.html".
-#
-# Initial Contributors:
-# Nokia Corporation - initial contribution.
-#
-# Contributors:
-#
-# Description: 
-#
 # component name "ROM File System"
 
 component	base_f32_srom