sl@0: // Copyright (c) 1997-2009 Nokia Corporation and/or its subsidiary(-ies).
sl@0: // All rights reserved.
sl@0: // This component and the accompanying materials are made available
sl@0: // under the terms of "Eclipse Public License v1.0"
sl@0: // which accompanies this distribution, and is available
sl@0: // at the URL "http://www.eclipse.org/legal/epl-v10.html".
sl@0: //
sl@0: // Initial Contributors:
sl@0: // Nokia Corporation - initial contribution.
sl@0: //
sl@0: // Contributors:
sl@0: //
sl@0: // Description:
sl@0: // Implements the default CDefaultResolver class.
sl@0: // 
sl@0: //
sl@0: 
sl@0: /**
sl@0:  @file
sl@0:  @internalComponent
sl@0: */
sl@0: 
sl@0: #include <ecom/ecom.h>
sl@0: #include <ecom/ecomerrorcodes.h>
sl@0: #include <ecom/ecomresolverparams.h>
sl@0: #include <ecom/implementationinformation.h>
sl@0: 
sl@0: #include "TestUtilities.h"	// For __FILE__LINE__
sl@0: #include "DefaultResolver.h"
sl@0: 
sl@0: CDefaultResolver* CDefaultResolver::NewL(MPublicRegistry& aRegistry)
sl@0: 	{
sl@0: 	return new(ELeave) CDefaultResolver(aRegistry);
sl@0: 	}
sl@0: 
sl@0: // Default d'tor
sl@0: 
sl@0: CDefaultResolver::~CDefaultResolver()
sl@0: 	{
sl@0: 	}
sl@0: 
sl@0: // Default c'tor
sl@0: 
sl@0: CDefaultResolver::CDefaultResolver(MPublicRegistry& aRegistry)
sl@0: : CResolver(aRegistry)
sl@0: 	{
sl@0: 	// Do nothing here
sl@0: 	}
sl@0: 
sl@0: 
sl@0: TUid CDefaultResolver::IdentifyImplementationL(TUid aInterfaceUid, 
sl@0: 											   const TEComResolverParams& aAdditionalParameters) const
sl@0: 	{
sl@0: 	RImplInfoArray* implementationsInfo = ListAllL(aInterfaceUid, aAdditionalParameters);
sl@0: 	TUid found = Resolve(*implementationsInfo, aAdditionalParameters);
sl@0: 	implementationsInfo->Reset();
sl@0: 	delete implementationsInfo;
sl@0: 	return found;
sl@0: 	}
sl@0: 
sl@0: 
sl@0: TUid CDefaultResolver::Resolve(const RImplInfoArray& aImplementationsInfo, 
sl@0: 							   const TEComResolverParams& aAdditionalParameters) const
sl@0: 	{
sl@0: 	// Place to store the result if we get a wildcard match
sl@0: 	TUid wildMatched = KNullUid;
sl@0: 	TInt wildConfidence = KErrNotFound;
sl@0: 	const TDesC8& matchType = aAdditionalParameters.DataType();
sl@0: 
sl@0: 	// Loop through the implementations matching on type
sl@0: 	const TInt count = aImplementationsInfo.Count();
sl@0: 	TBool isGenericMatch=aAdditionalParameters.IsGenericMatch();
sl@0: 	for(TInt index = 0; index < count; ++index)
sl@0: 		{
sl@0: 		const CImplementationInformation& impData = *aImplementationsInfo[index];
sl@0: 		const TDesC8& dataType = impData.DataType();
sl@0: 
sl@0: 		// As soon as we get a match on the datatype then return uid of the 
sl@0: 		// implementation found.
sl@0: 		if(Match(dataType,	// The Datatype of this implementation
sl@0: 				 matchType,	// The type we are trying to find
sl@0: 				 EFalse))	// Don't use wildcards first
sl@0: 			{
sl@0: 			// We have got an exact match so return this
sl@0: 			return impData.ImplementationUid();
sl@0: 			}
sl@0: 		else if(isGenericMatch) // If the client wants us to use wildcards
sl@0: 			{
sl@0: 			if(Match(dataType,
sl@0: 					 matchType,
sl@0: 					 ETrue))
sl@0: 				{
sl@0: 				// We have matched using wildcards so work out a confidence value
sl@0: 				TInt confidence = 0;
sl@0: 				TInt length = Min(matchType.Length(), dataType.Length());
sl@0: 				while((matchType[confidence] == dataType[confidence]) && 
sl@0: 					  (++confidence < length))
sl@0: 					{
sl@0: 					}
sl@0: 				if(confidence > wildConfidence)
sl@0: 					{
sl@0: 					wildConfidence = confidence;
sl@0: 					wildMatched = impData.ImplementationUid();
sl@0: 					}
sl@0: 				}
sl@0: 			}
sl@0: 		}
sl@0: 
sl@0: 	return wildMatched;
sl@0: 	}
sl@0: 
sl@0: void CloseAndDeleteRArray(TAny* aObject)
sl@0: 	{
sl@0: 	RImplInfoArray* array=reinterpret_cast<RImplInfoArray*>(aObject);
sl@0: 	if (array)
sl@0: 		array->Close();
sl@0: 	delete array;
sl@0: 	}
sl@0: 
sl@0: 
sl@0: RImplInfoArray* CDefaultResolver::ListAllL(TUid aInterfaceUid, 
sl@0: 										   const TEComResolverParams& aAdditionalParameters) const
sl@0: 	{
sl@0: 	// Use the member var to create the array so that we get proper cleanup behaviour
sl@0: 	RImplInfoArray* retList = new (ELeave) RImplInfoArray;
sl@0: 	
sl@0: 	CleanupStack::PushL(TCleanupItem(CloseAndDeleteRArray,retList));
sl@0: 	RImplInfoArray& fullList = iRegistry.ListImplementationsL(aInterfaceUid);
sl@0: 
sl@0: 	const TBool useWildcards = aAdditionalParameters.IsGenericMatch();
sl@0: 	const TDesC8& matchType = aAdditionalParameters.DataType();
sl@0: 	const TInt numImps = fullList.Count();
sl@0: 	for(TInt index = 0; index < numImps; ++index)
sl@0: 		{	
sl@0: 		if(Match(fullList[index]->DataType(), matchType, useWildcards))
sl@0: 			{
sl@0: 			User::LeaveIfError(retList->Append(fullList[index]));
sl@0: 			}
sl@0: 		}
sl@0: 
sl@0: 	// Reset the member variable because we are passing ownership back
sl@0: 	CleanupStack::Pop();
sl@0: 	return retList;
sl@0: 	}
sl@0: 
sl@0: TBool CDefaultResolver::Match(const TDesC8& aImplementationType, 
sl@0: 							  const TDesC8& aMatchType, 
sl@0: 							  TBool aUseWildcards) const
sl@0: 	{
sl@0: 	// In this function if allowing wildcards then TDesC8::Match is used which returns 
sl@0: 	// the position of the match or KErrNotFound
sl@0: 	// If not allowing wildcards then TDesC8::Compare is used which returns a TInt which
sl@0: 	// indicates if one descriptor is bigger than the other (0 if they are identical)
sl@0: 
sl@0: 	TBool gotMatch = ETrue;
sl@0: 	
sl@0: 	if(aMatchType.Length()!=0)
sl@0: 	{
sl@0: 		gotMatch = EFalse;
sl@0: 		
sl@0: 		_LIT8(dataSeparator, "||");
sl@0: 		const TInt separatorLength = dataSeparator().Length();
sl@0: 
sl@0: 		// Look for the section separator marker '||'
sl@0: 		TInt separatorPos = aImplementationType.Find(dataSeparator);
sl@0: 		if(separatorPos == KErrNotFound)
sl@0: 			{
sl@0: 			// Match against the whole string
sl@0: 			if(aUseWildcards)
sl@0: 				gotMatch = aMatchType.Match(aImplementationType) != KErrNotFound;
sl@0: 			else
sl@0: 				gotMatch = aMatchType.Compare(aImplementationType) == 0;
sl@0: 			}
sl@0: 		else
sl@0: 			{
sl@0: 			// Find the first section, up to the separator
sl@0: 			TPtrC8 dataSection = aImplementationType.Left(separatorPos);
sl@0: 			TPtrC8 remainingData = aImplementationType.Mid(separatorPos + separatorLength);
sl@0: 			// Match against each section in turn
sl@0: 			while(separatorPos != KErrNotFound)
sl@0: 				{
sl@0: 				// Search this section
sl@0: 				if(aUseWildcards)
sl@0: 					gotMatch = aMatchType.Match(dataSection) != KErrNotFound;
sl@0: 				else
sl@0: 					gotMatch = aMatchType.Compare(dataSection) == 0;
sl@0: 
sl@0: 				// If we found it then no need to continue, so return
sl@0: 				if(gotMatch)
sl@0: 					return ETrue;
sl@0: 
sl@0: 				// Move on to the next section
sl@0: 				separatorPos = remainingData.Find(dataSeparator);
sl@0: 				if(separatorPos != KErrNotFound)
sl@0: 					{
sl@0: 					dataSection.Set(remainingData.Left(separatorPos));
sl@0: 					remainingData.Set(remainingData.Mid(separatorPos + separatorLength));
sl@0: 					}
sl@0: 				else
sl@0: 					dataSection.Set(remainingData);
sl@0: 				}
sl@0: 
sl@0: 			// Check the final part
sl@0: 			if(aUseWildcards)
sl@0: 				gotMatch = aMatchType.Match(dataSection) != KErrNotFound;
sl@0: 			else
sl@0: 				gotMatch = aMatchType.Compare(dataSection) == 0;
sl@0: 			}
sl@0: 		}
sl@0: 		return gotMatch;
sl@0: 	}