1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/ossrv/lowlevellibsandfws/pluginfw/Framework/frame/DefaultResolver.cpp Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,211 @@
1.4 +// Copyright (c) 1997-2009 Nokia Corporation and/or its subsidiary(-ies).
1.5 +// All rights reserved.
1.6 +// This component and the accompanying materials are made available
1.7 +// under the terms of "Eclipse Public License v1.0"
1.8 +// which accompanies this distribution, and is available
1.9 +// at the URL "http://www.eclipse.org/legal/epl-v10.html".
1.10 +//
1.11 +// Initial Contributors:
1.12 +// Nokia Corporation - initial contribution.
1.13 +//
1.14 +// Contributors:
1.15 +//
1.16 +// Description:
1.17 +// Implements the default CDefaultResolver class.
1.18 +//
1.19 +//
1.20 +
1.21 +/**
1.22 + @file
1.23 + @internalComponent
1.24 +*/
1.25 +
1.26 +#include <ecom/ecom.h>
1.27 +#include <ecom/ecomerrorcodes.h>
1.28 +#include <ecom/ecomresolverparams.h>
1.29 +#include <ecom/implementationinformation.h>
1.30 +
1.31 +#include "TestUtilities.h" // For __FILE__LINE__
1.32 +#include "DefaultResolver.h"
1.33 +
1.34 +CDefaultResolver* CDefaultResolver::NewL(MPublicRegistry& aRegistry)
1.35 + {
1.36 + return new(ELeave) CDefaultResolver(aRegistry);
1.37 + }
1.38 +
1.39 +// Default d'tor
1.40 +
1.41 +CDefaultResolver::~CDefaultResolver()
1.42 + {
1.43 + }
1.44 +
1.45 +// Default c'tor
1.46 +
1.47 +CDefaultResolver::CDefaultResolver(MPublicRegistry& aRegistry)
1.48 +: CResolver(aRegistry)
1.49 + {
1.50 + // Do nothing here
1.51 + }
1.52 +
1.53 +
1.54 +TUid CDefaultResolver::IdentifyImplementationL(TUid aInterfaceUid,
1.55 + const TEComResolverParams& aAdditionalParameters) const
1.56 + {
1.57 + RImplInfoArray* implementationsInfo = ListAllL(aInterfaceUid, aAdditionalParameters);
1.58 + TUid found = Resolve(*implementationsInfo, aAdditionalParameters);
1.59 + implementationsInfo->Reset();
1.60 + delete implementationsInfo;
1.61 + return found;
1.62 + }
1.63 +
1.64 +
1.65 +TUid CDefaultResolver::Resolve(const RImplInfoArray& aImplementationsInfo,
1.66 + const TEComResolverParams& aAdditionalParameters) const
1.67 + {
1.68 + // Place to store the result if we get a wildcard match
1.69 + TUid wildMatched = KNullUid;
1.70 + TInt wildConfidence = KErrNotFound;
1.71 + const TDesC8& matchType = aAdditionalParameters.DataType();
1.72 +
1.73 + // Loop through the implementations matching on type
1.74 + const TInt count = aImplementationsInfo.Count();
1.75 + TBool isGenericMatch=aAdditionalParameters.IsGenericMatch();
1.76 + for(TInt index = 0; index < count; ++index)
1.77 + {
1.78 + const CImplementationInformation& impData = *aImplementationsInfo[index];
1.79 + const TDesC8& dataType = impData.DataType();
1.80 +
1.81 + // As soon as we get a match on the datatype then return uid of the
1.82 + // implementation found.
1.83 + if(Match(dataType, // The Datatype of this implementation
1.84 + matchType, // The type we are trying to find
1.85 + EFalse)) // Don't use wildcards first
1.86 + {
1.87 + // We have got an exact match so return this
1.88 + return impData.ImplementationUid();
1.89 + }
1.90 + else if(isGenericMatch) // If the client wants us to use wildcards
1.91 + {
1.92 + if(Match(dataType,
1.93 + matchType,
1.94 + ETrue))
1.95 + {
1.96 + // We have matched using wildcards so work out a confidence value
1.97 + TInt confidence = 0;
1.98 + TInt length = Min(matchType.Length(), dataType.Length());
1.99 + while((matchType[confidence] == dataType[confidence]) &&
1.100 + (++confidence < length))
1.101 + {
1.102 + }
1.103 + if(confidence > wildConfidence)
1.104 + {
1.105 + wildConfidence = confidence;
1.106 + wildMatched = impData.ImplementationUid();
1.107 + }
1.108 + }
1.109 + }
1.110 + }
1.111 +
1.112 + return wildMatched;
1.113 + }
1.114 +
1.115 +void CloseAndDeleteRArray(TAny* aObject)
1.116 + {
1.117 + RImplInfoArray* array=reinterpret_cast<RImplInfoArray*>(aObject);
1.118 + if (array)
1.119 + array->Close();
1.120 + delete array;
1.121 + }
1.122 +
1.123 +
1.124 +RImplInfoArray* CDefaultResolver::ListAllL(TUid aInterfaceUid,
1.125 + const TEComResolverParams& aAdditionalParameters) const
1.126 + {
1.127 + // Use the member var to create the array so that we get proper cleanup behaviour
1.128 + RImplInfoArray* retList = new (ELeave) RImplInfoArray;
1.129 +
1.130 + CleanupStack::PushL(TCleanupItem(CloseAndDeleteRArray,retList));
1.131 + RImplInfoArray& fullList = iRegistry.ListImplementationsL(aInterfaceUid);
1.132 +
1.133 + const TBool useWildcards = aAdditionalParameters.IsGenericMatch();
1.134 + const TDesC8& matchType = aAdditionalParameters.DataType();
1.135 + const TInt numImps = fullList.Count();
1.136 + for(TInt index = 0; index < numImps; ++index)
1.137 + {
1.138 + if(Match(fullList[index]->DataType(), matchType, useWildcards))
1.139 + {
1.140 + User::LeaveIfError(retList->Append(fullList[index]));
1.141 + }
1.142 + }
1.143 +
1.144 + // Reset the member variable because we are passing ownership back
1.145 + CleanupStack::Pop();
1.146 + return retList;
1.147 + }
1.148 +
1.149 +TBool CDefaultResolver::Match(const TDesC8& aImplementationType,
1.150 + const TDesC8& aMatchType,
1.151 + TBool aUseWildcards) const
1.152 + {
1.153 + // In this function if allowing wildcards then TDesC8::Match is used which returns
1.154 + // the position of the match or KErrNotFound
1.155 + // If not allowing wildcards then TDesC8::Compare is used which returns a TInt which
1.156 + // indicates if one descriptor is bigger than the other (0 if they are identical)
1.157 +
1.158 + TBool gotMatch = ETrue;
1.159 +
1.160 + if(aMatchType.Length()!=0)
1.161 + {
1.162 + gotMatch = EFalse;
1.163 +
1.164 + _LIT8(dataSeparator, "||");
1.165 + const TInt separatorLength = dataSeparator().Length();
1.166 +
1.167 + // Look for the section separator marker '||'
1.168 + TInt separatorPos = aImplementationType.Find(dataSeparator);
1.169 + if(separatorPos == KErrNotFound)
1.170 + {
1.171 + // Match against the whole string
1.172 + if(aUseWildcards)
1.173 + gotMatch = aMatchType.Match(aImplementationType) != KErrNotFound;
1.174 + else
1.175 + gotMatch = aMatchType.Compare(aImplementationType) == 0;
1.176 + }
1.177 + else
1.178 + {
1.179 + // Find the first section, up to the separator
1.180 + TPtrC8 dataSection = aImplementationType.Left(separatorPos);
1.181 + TPtrC8 remainingData = aImplementationType.Mid(separatorPos + separatorLength);
1.182 + // Match against each section in turn
1.183 + while(separatorPos != KErrNotFound)
1.184 + {
1.185 + // Search this section
1.186 + if(aUseWildcards)
1.187 + gotMatch = aMatchType.Match(dataSection) != KErrNotFound;
1.188 + else
1.189 + gotMatch = aMatchType.Compare(dataSection) == 0;
1.190 +
1.191 + // If we found it then no need to continue, so return
1.192 + if(gotMatch)
1.193 + return ETrue;
1.194 +
1.195 + // Move on to the next section
1.196 + separatorPos = remainingData.Find(dataSeparator);
1.197 + if(separatorPos != KErrNotFound)
1.198 + {
1.199 + dataSection.Set(remainingData.Left(separatorPos));
1.200 + remainingData.Set(remainingData.Mid(separatorPos + separatorLength));
1.201 + }
1.202 + else
1.203 + dataSection.Set(remainingData);
1.204 + }
1.205 +
1.206 + // Check the final part
1.207 + if(aUseWildcards)
1.208 + gotMatch = aMatchType.Match(dataSection) != KErrNotFound;
1.209 + else
1.210 + gotMatch = aMatchType.Compare(dataSection) == 0;
1.211 + }
1.212 + }
1.213 + return gotMatch;
1.214 + }