// 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"

// 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:

// Test22Append.cpp

// Contains MBufMgr Test Step 22 for Append() methods

//

//

// EPOC includes

#include <e32base.h>

// Test system includes

//#ifdef SYMBIAN_OLD_EXPORT_LOCATION

//#include "networking/log.h"

//#include "networking/teststep.h"

//#else

//#include <networking/log.h>

//#include <networking/teststep.h>

//#endif

#include "TestStepCTMbufmgr.h"

#include "Test22Append.h"

// constructor

CTest22Append::CTest22Append()

	{

	SetTestStepName(_L("MBufMgrTest22"));// Store the name of this test case

	}

// destructor

CTest22Append::~CTest22Append()

	{

	}

//

enum TVerdict CTest22Append::doTestStepL(void)

	{

	SetTestStepResult(EFail);

	//-------------- substep 1 --------------------

	INFO_PRINTF1(_L("  01 Create CMBufManager and install active scheduler:"));

    CleanupStack::PushL( iActSch = new(ELeave) CActiveScheduler );

	CActiveScheduler::Install(iActSch);

	RArray<TCommsBufPoolCreateInfo> poolInfoArray;

	TCommsBufPoolCreateInfo createInfo;

	createInfo.iBufSize = 128;

	createInfo.iInitialBufs = 128;

	createInfo.iGrowByBufs = 64;

	createInfo.iMinFreeBufs = 40;

	createInfo.iCeiling = (KMBufDefaultHeapSize / 2)/createInfo.iBufSize;

	poolInfoArray.AppendL(createInfo);

	CreateInstanceMBufMgrL(poolInfoArray);

	CleanupClosePushL(iBufPond);

	poolInfoArray.Close ();

	TBool firstFail = EFalse;

	TBool secondFail = EFalse;

	TInt ret;

	RMBufChain chain,chain2;

	//-------------- substep 2 --------------------

	INFO_PRINTF1(_L("  02 Append 20 bytes to an empty chain"));

	ret = chain.Append(20);

	if (ret != KErrNone)

		{

		INFO_PRINTF1(_L("Error: Couldn't append:"));

		firstFail = ETrue;

		}

	else

		{

	    if(chain.NumBufs() != 1)

	        {

		    INFO_PRINTF1(_L("Error: Wrong number of MBufs allocated:"));

			secondFail = ETrue;

		    }

		if(chain.Length() != 20)

			{

		    INFO_PRINTF1(_L("Error: Wrong number of bytes appended:"));

			secondFail = ETrue;

			}

		//-------------- substep 3 --------------------

		INFO_PRINTF1(_L("  03 Deallocating RMBufChain"));

		chain.Free();

		}

	//-------------- substep 4 --------------------

	INFO_PRINTF1(_L("  04 Append 200 bytes to an empty chain"));

    ret = chain.Append(200);

	if (ret != KErrNone)

		{

		INFO_PRINTF1(_L("Error: Couldn't append:"));

		firstFail = ETrue;

		}

	else

		{

	    if(chain.NumBufs() != 2)

	        {

		    INFO_PRINTF1(_L("Error: Wrong number of MBufs allocated:"));

			secondFail = ETrue;

		    }

		if(chain.Length() != 200)

			{

		    INFO_PRINTF1(_L("Error: Wrong number of bytes appended:"));

			secondFail = ETrue;

			}

		//-------------- substep 6 --------------------

		INFO_PRINTF1(_L("  05 Deallocating RMBufChain"));

		chain.Free();

		}

	//-------------- substep 6 --------------------

	INFO_PRINTF1(_L("  06 Append 20 bytes to an existing chain"));

	ret = chain.Alloc(20);

	if (ret != KErrNone)

	    {

        INFO_PRINTF1(_L("Error: Couldn't allocate initial chain:"));

        firstFail = ETrue;

	    }

    else

        {

		ret = chain.Append(20);

		if (ret != KErrNone)

			{

			INFO_PRINTF1(_L("Error: Couldn't append:"));

			firstFail = ETrue;

			}

		else

			{

			if(chain.NumBufs() != 1)

				{

				INFO_PRINTF1(_L("Error: Wrong number of MBufs allocated:"));

				secondFail = ETrue;

				}

			if(chain.Length() != 40)

				{

				INFO_PRINTF1(_L("Error: Wrong number of bytes:"));

				secondFail = ETrue;

				}

		    //-------------- substep 7 --------------------

			INFO_PRINTF1(_L("  07 Deallocating RMBufChain"));

			chain.Free();

			}

		}

	//-------------- substep 8 --------------------

	INFO_PRINTF1(_L("  08 Append 200 bytes to an existing chain"));

	ret = chain.Alloc(20);

	if (ret != KErrNone)

	    {

        INFO_PRINTF1(_L("Error: Couldn't allocate initial chain:"));

        firstFail = ETrue;

	    }

    else

        {

		ret = chain.Append(200);

		if (ret != KErrNone)

			{

			INFO_PRINTF1(_L("Error: Couldn't append:"));

			firstFail = ETrue;

			}

		else

			{

			if(chain.NumBufs() != 2)

				{

				INFO_PRINTF1(_L("Error: Wrong number of MBufs allocated:"));

				secondFail = ETrue;

				}

			if(chain.Length() != 220)

				{

				INFO_PRINTF1(_L("Error: Wrong number of bytes:"));

				secondFail = ETrue;

				}

		    //-------------- substep 9 --------------------

			INFO_PRINTF1(_L("  09 Deallocating RMBufChain"));

			chain.Free();

			}

		}

	//-------------- substep 10 --------------------

	INFO_PRINTF1(_L("  10 Append one chain onto another chain"));

	ret = chain.Alloc(20);

	if (ret != KErrNone)

	    {

        INFO_PRINTF1(_L("Error: Couldn't allocate initial chain:"));

        firstFail = ETrue;

	    }

    else

        {

		ret = chain2.Alloc(200);

		if (ret != KErrNone)

			{

			INFO_PRINTF1(_L("Error: Couldn't allocate second chain:"));

			firstFail = ETrue;

			}

		else

			{

			RMBuf* first = chain.First();

			chain.Append(chain2);

			if(chain.NumBufs() != 3)

				{

				INFO_PRINTF1(_L("Error: Wrong number of MBufs in the chain:"));

				secondFail = ETrue;

				}

			if(chain.Length() != 220)

				{

				INFO_PRINTF1(_L("Error: Wrong number of bytes:"));

				secondFail = ETrue;

				}

			if(chain.First() != first)

			    {

				INFO_PRINTF1(_L("Error: chain2 not appended correctly:"));

				secondFail = ETrue;

				}

		    //-------------- substep 11 --------------------

			INFO_PRINTF1(_L("  11 Deallocating RMBufChains"));

			chain2.Free();

			}

		chain.Free();

		}

	//-------------- substep 12 --------------------

	INFO_PRINTF1(_L("  12 Clean up stack:"));

    CleanupStack::PopAndDestroy(); // pond

	CActiveScheduler::Install(NULL);

	CleanupStack::PopAndDestroy(iActSch);

    if (firstFail || secondFail)

    	{

		SetTestStepResult(EFail);

    	}

	else

		{

		SetTestStepResult(EPass);

		}

	return TestStepResult();

	}