// 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 basetestcase.cpp

// @internalComponent

// 

//

#include "BaseTestCase.h"

#include <e32ver.h>

#include <d32usbdi.h>

#include "testdebug.h"

#include "testpolicy.h"

namespace NUnitTesting_USBDI

	{

const TUint8 KEpDirectionIn = 0x80;

const TUint8 KEpDirectionOut = 0x00;

const TUint8 KTransferTypeControl = 0x00;

const TUint8 KTransferTypeIsoch = 0x01;

const TUint8 KTransferTypeBulk = 0x02;

const TUint8 KTransferTypeInterrupt = 0x03;	

const TUint8 KChunkSize  		= 0x80 ; // 128 bytes

const TUint KTreeBufferSize 	= 32*1024 ; // 32k bytes

_LIT(KRefPath, "Z:\\scripts\\");

 _LIT(KGeneratedFilesPath,"C:\\");

_LIT(KExtensionFile,".txt"); 

CBaseTestCase::CBaseTestCase(const TDesC& aTestCaseId,TBool aHostFlag, TBool aHostOnly)

:	CActive(EPriorityStandard),

	iHost(aHostFlag),

	iHostOnly(aHostOnly)

	{

	iTestCaseId.Copy(aTestCaseId);

	CActiveScheduler::Add(this);

	}

void CBaseTestCase::BaseConstructL()

	{

	TInt err(iTimer.CreateLocal());

	if(err == KErrNone)

		{

		}

	else

		{

		User::Leave(err);

		}	

	}

void CBaseTestCase::TimeoutIn(TInt aTimeoutPeriod)

	{

	CancelTimeout();

	iTimer.After(iStatus,aTimeoutPeriod*1000000);

	SetActive();

	}

void CBaseTestCase::CancelTimeout()

	{

	iTimer.Cancel();

	}

TInt CBaseTestCase::GenerateRefFile(const TDesC& aFileName)

	{

	TBuf<256> refTreeFullFileName(KGeneratedFilesPath);

	refTreeFullFileName.Append(aFileName);	

	refTreeFullFileName.Append(KExtensionFile);

 	RFile refFile; 

	TInt ret = KErrNone; 

	ret = iFs.Connect();

	if(ret!=KErrNone && ret!=KErrAlreadyExists)

	// if already connected, ignore

		{ 

		return ret;

		}

	ret = iFs.Delete(refTreeFullFileName);

	if(ret == KErrNone || ret == KErrNotFound)

		{

		ret = refFile.Create(iFs,refTreeFullFileName,EFileShareAny|EFileWrite);

		}		

	if(ret!=KErrNone) 

		{ 

		return ret;

		}

	refFile.Write(iTreeBuffer);

	refFile.Flush(); 

	refFile.Close();

	return KErrNone;

	}	

TInt CBaseTestCase::CompareCurrentTreeToRef(const TDesC& aFileName, TBool& aIsIdentical)

	{

	TBuf<256> refTreeFullFileName(KRefPath);

	refTreeFullFileName.Append(aFileName);

	refTreeFullFileName.Append(KExtensionFile);	 	

	TInt ret = KErrNone; 

	ret = iFs.Connect();

	if(ret!=KErrNone && ret!=KErrAlreadyExists)

	// if already connected, ignore

		{ 

		return ret;

		}

	RFile refFile;

	ret = refFile.Open(iFs,refTreeFullFileName,EFileShareAny|EFileRead);

	if(ret!=KErrNone)

		{

		return ret;

		}

	TInt refFileSize;

	refFile.Size(refFileSize);   

	// check size is identical

	if(refFileSize != iTreeBuffer.Size())

		{		

		//return KErrGeneral; not an issue, \n encoded differently by perforce... x0D x0A. (x0A only in generated ref file)

		}

	// read the file, and put it in a local buffer

	RBuf8 refBuf;

	refBuf.CreateL(refFileSize);

	ret = refFile.Read(0, refBuf, refFileSize);

	if(ret!=KErrNone)

		{

		return ret;

		}

	// find occurences of \n now 

	RBuf8 copyRefBuf;

	copyRefBuf.CreateL(refFileSize);

	for(TInt iRefBuffer=0; iRefBuffer < refFileSize; iRefBuffer++)

		{

		if(refBuf[iRefBuffer] == 0x0D && iRefBuffer != refFileSize-1) // not the last byte

			{			

			if(refBuf[iRefBuffer+1] == 0x0A)

				{				

				copyRefBuf.Append(_L8("\n"));

				continue;

				}			

			}

		// previous is 0x0D, skip... 

		if( refBuf[iRefBuffer] == 0x0A && refBuf[iRefBuffer-1] == 0x0D)

			{

			continue;

			}			

		copyRefBuf.AppendFormat(_L8("%c"), refBuf[iRefBuffer]);				  

		}

	refBuf.Close();

	// check size is identical, should be identical now

	if(copyRefBuf.Size() != iTreeBuffer.Size())

		{		

		return KErrGeneral;

		}

	// now compare the 2 buffers		

    // Can only go as far as the smallest buffer

    TInt bufferSizeToCheck = Min(copyRefBuf.Size(), iTreeBuffer.Size());

	aIsIdentical = ETrue;	

	for(TInt iRefBuffer=0; iRefBuffer < bufferSizeToCheck; iRefBuffer++)

		{

		if(iTreeBuffer[iRefBuffer] != copyRefBuf[iRefBuffer])

			{

			aIsIdentical = EFalse;

			break;

			}			 	 	 

		}		

 	copyRefBuf.Close();

	return KErrNone;	

	}	

CBaseTestCase::~CBaseTestCase()

	{

	Cancel();

	iTimer.Close();

	iTreeBuffer.Close();

	iFs.Close();

	}

void CBaseTestCase::SelfComplete()

	{

	SelfComplete(KErrNone);

	}

void CBaseTestCase::SelfComplete(TInt aError)

	{

	TRequestStatus* s = &iStatus;

	iStatus = KRequestPending;

	User::RequestComplete(s,aError);

	SetActive();

	}

void CBaseTestCase::DoCancel()

	{

	iTimer.Cancel();

	if(iHost)

		{

		HostDoCancel();

		}

	else

		{

		DeviceDoCancel();

		}

	}

void CBaseTestCase::RunL()

	{

	if(iHost)

		{

		HostRunL();

		}

	else

		{

		DeviceRunL();

		}

	}

TInt CBaseTestCase::RunError(TInt aError)

	{

	iTestPolicy->SignalTestComplete(aError);

	return KErrNone;

	}

TDesC& CBaseTestCase::TestCaseId()

	{

	return iTestCaseId;

	}

TInt CBaseTestCase::TestResult() const

	{

	return iTestResult;

	}

TBool CBaseTestCase::IsHostOnly() const

	{

	return iHostOnly;

	}

TBool CBaseTestCase::IsHost() const

	{

	return iHost;

	}

void CBaseTestCase::PerformTestL()

	{

	if(iHost)

		{

		iTreeBuffer.CreateL(KTreeBufferSize); //32k

		ExecuteHostTestCaseL();

		}

	else

		{

		ExecuteDeviceTestCaseL();

		}	

	}

void CBaseTestCase::SetTestPolicy(CBasicTestPolicy* aTestPolicy)

	{

	iTestPolicy = aTestPolicy;

	}

void CBaseTestCase::TestFailed(TInt aFailResult)

	{

	iTestResult = aFailResult;

	if(!iHostOnly)

		{

		CActiveScheduler::Stop();

		}		

	}

void CBaseTestCase::TestPassed()

	{

	iTestResult = KErrNone;	

	if(!iHostOnly)

		{

		CActiveScheduler::Stop();

		}

	}

CBasicTestPolicy& CBaseTestCase::TestPolicy()

	{

	return *iTestPolicy;

	}

/**

Gets the first endpoint address that satisfies the parameters

So caution when there are multiple endpoints on the interface setting

See method below for specifying the endpoint index if more than 

one endpoint of the given type exists on the interface setting

*/

TInt CBaseTestCase::GetEndpointAddress(RUsbInterface& aUsbInterface,TInt aInterfaceSetting,

		TUint8 aTransferType,TUint8 aDirection,TInt& aEndpointAddress)

	{

	return GetEndpointAddress(aUsbInterface, aInterfaceSetting, aTransferType, aDirection, 0, aEndpointAddress);

	}

/**

Gets the (aIndex+1)th endpoint address that satisfies the parameters

Allows the specification of the endpoint index (starting from ZERO)if more than 

one endpoint of the given type exists on the interface setting

*/

TInt CBaseTestCase::GetEndpointAddress(RUsbInterface& aUsbInterface,TInt aInterfaceSetting,

		TUint8 aTransferType,TUint8 aDirection,TUint8 aIndex,TInt& aEndpointAddress)

	{

	// Get the interface descriptor

	TUsbInterfaceDescriptor alternateInterfaceDescriptor;

	TInt err = aUsbInterface.GetAlternateInterfaceDescriptor(aInterfaceSetting, alternateInterfaceDescriptor);

	if(err)

		{

		return err;

		}

	// Parse the descriptor tree from the interface 	

	TUsbGenericDescriptor* descriptor = alternateInterfaceDescriptor.iFirstChild;

	TUint8 indexCount = 0;

	while(descriptor)

		{

		// Cast the descriptor to an endpoint descriptor

		TUsbEndpointDescriptor* endpoint = TUsbEndpointDescriptor::Cast(descriptor);

		if(endpoint)

			{

			if( (endpoint->Attributes() & aTransferType) == aTransferType)

				{

				if( (endpoint->EndpointAddress() & aDirection) == aDirection) 

					{

					if(indexCount==aIndex)

						{

						aEndpointAddress = endpoint->EndpointAddress();

						return KErrNone;

						}

					else

						{

						indexCount++;

						}

					}

				}

			}

		descriptor = descriptor->iNextPeer;

		}

	// Unable to find the endpoint address	

	return KErrNotFound;

	}

/*static*/ void CBaseTestCase::LogWithCondAndInfo(const TDesC& aCondition, const TDesC& aFileName, TInt aLine)

	{

	TBuf<256> buf;

 	buf.Format(KFailText, &aCondition, &aFileName, aLine);

 	} 	

/*static*/ void CBaseTestCase::PrintAndStoreTree(TUsbGenericDescriptor& aDesc, TInt aDepth)

	{ 

	TBuf8<20> buf;	

	for(TInt depth=aDepth;depth>=0;--depth)

		{

		buf.Append(_L8("  "));

		}

	//##==TBuf16<40> unicodeBuf;

	TBuf8<40> unicodeBuf;

	unicodeBuf.Copy(buf);	// Ideally this needs conversion to UNICODE

	if(aDesc.iRecognisedAndParsed == TUsbGenericDescriptor::ERecognised)

		{ 

   		iTreeBuffer.AppendFormat(_L8("%S+ length=%d, type=0x%02x\n"), &buf, aDesc.ibLength, aDesc.ibDescriptorType);		

		}

	else

		{

		iTreeBuffer.AppendFormat(_L8("%S- length=%d, type=0x%02x\n"), &buf, aDesc.ibLength, aDesc.ibDescriptorType);

		} 		

		PrintAndStoreBlob(buf ,aDesc.iBlob);		

		if(aDesc.iFirstChild)    

		{

		iTreeBuffer.AppendFormat(_L8("%S \\ \n"), &buf);		

		PrintAndStoreTree(*(aDesc.iFirstChild), aDepth+1);		

		iTreeBuffer.AppendFormat(_L8("%S / \n"), &buf);

		}

	if(aDesc.iNextPeer)

		{

		PrintAndStoreTree(*(aDesc.iNextPeer), aDepth);

		}		

	} 

void CBaseTestCase::PrintAndStoreBlob(TDes8& aBuf, TPtrC8& aBlob)

	{

	HBufC8* chunk = HBufC8::New(KChunkSize);

	TUint nbIter = aBlob.Length()/(KChunkSize/2);

	TUint remainderSize = aBlob.Length()%(KChunkSize/2);

	if(nbIter == 0)  

		{

		PrintAndStoreChunk(chunk, aBlob.Length() ,aBlob, 0, 0, aBuf );      

		}

	else

		{

		// print chunks

		TUint offset = 0;

		TInt i = 0;

		for(i=0;i<nbIter;++i)

			{

			PrintAndStoreChunk(chunk, (KChunkSize/2) ,aBlob, offset, i, aBuf); 

			offset+=(KChunkSize/2);

			} 

		// remainder

		PrintAndStoreChunk(chunk, remainderSize ,aBlob,offset, i ,aBuf);				

		}

	delete chunk;

	} 

void CBaseTestCase::PrintAndStoreChunk(HBufC8* aChunk, TUint aSize, TPtrC8& aBlob, TUint aOffset, TUint aIter, TDes8& aBuf)

	{	

	for(TInt i=0;i<aSize;++i)

		{

		aChunk->Des().AppendFormat(_L8("%02x"), aBlob[i+aOffset]);

		}

	TBuf16<40> unicodeBuf;	

	unicodeBuf.Copy(aBuf);

	TBuf16<256> unicodeChunk;	

	unicodeChunk.Copy(aChunk->Des());