Function SelectBestFunction

NULLC/Callbacks.cpp:3728–3827

}

unsigned SelectBestFunction(unsigned count, unsigned callArgCount, unsigned int &minRating, TypeInfo* forcedParentType)
{
	// Find the best suited function
	bestFuncRating.resize(count);

	unsigned int minGenericRating = ~0u;
	unsigned int minRatingIndex = ~0u, minGenericIndex = ~0u;
	for(unsigned int k = 0; k < count; k++)
	{
		unsigned int argumentCount = callArgCount;
		// Act as if default parameter values were passed
		if(argumentCount < bestFuncList[k]->paramCount)
		{
			// Move to the last parameter
			VariableInfo *param = bestFuncList[k]->firstParam;
			for(unsigned int i = 0; i < argumentCount; i++)
				param = param->next;
			// While there are default values, put them
			while(param && param->defaultValue)
			{
				argumentCount++;
				CodeInfo::nodeList.push_back(param->defaultValue);
				param = param->next;
			}
		}
		if(argumentCount >= (bestFuncList[k]->paramCount - 1) && bestFuncList[k]->lastParam && bestFuncList[k]->lastParam->varType == typeObjectArray &&
			!(argumentCount == bestFuncList[k]->paramCount && CodeInfo::nodeList.back()->typeInfo == typeObjectArray))
		{
			// If function accepts variable argument list
			TypeInfo *&lastType = bestFuncList[k]->funcType->funcType->paramType[bestFuncList[k]->paramCount - 1];
			assert(lastType == CodeInfo::GetArrayType(typeObject, TypeInfo::UNSIZED_ARRAY));
			unsigned int redundant = argumentCount - bestFuncList[k]->paramCount;
			if(redundant == ~0u)
				CodeInfo::nodeList.push_back(new NodeZeroOP(typeObjectArray));
			else
				CodeInfo::nodeList.shrink(CodeInfo::nodeList.size() - redundant);
			// Change things in a way that this function will be selected (lie about real argument count and match last argument type)
			lastType = CodeInfo::nodeList.back()->typeInfo;
			bestFuncRating[k] = GetFunctionRating(bestFuncList[k]->funcType->funcType, bestFuncList[k]->paramCount);
			if(redundant == ~0u)
				CodeInfo::nodeList.pop_back();
			else
				CodeInfo::nodeList.resize(CodeInfo::nodeList.size() + redundant);
			if(bestFuncRating[k] != ~0u)
				bestFuncRating[k] += 10 + (redundant == ~0u ? 5 : redundant * 5);	// Cost of variable arguments function
			lastType = CodeInfo::GetArrayType(typeObject, TypeInfo::UNSIZED_ARRAY);
		}else{
			bestFuncRating[k] = GetFunctionRating(bestFuncList[k]->funcType->funcType, argumentCount);
		}
		if(bestFuncList[k]->generic)
		{
			// If we have a positive rating, check that generic function constraints are satisfied
			if(bestFuncRating[k] != ~0u)
			{
				unsigned newRating = bestFuncRating[k];
				TypeInfo *parentClass = bestFuncList[k]->parentClass;
				if(forcedParentType && bestFuncList[k]->parentClass != forcedParentType)
				{