Function TypeInstanceGeneric

NULLC/Callbacks.cpp:5112–5230

}

void TypeInstanceGeneric(const char* pos, TypeInfo* base, unsigned aliases, bool genericTemp)
{
	Lexeme *start = CodeInfo::lexStart + base->genericInfo->start;
	NodeZeroOP **aliasType = &CodeInfo::nodeList[CodeInfo::nodeList.size() - aliases];

	// Generate instance name
	char tempName[NULLC_MAX_VARIABLE_NAME_LENGTH];
	char *namePos = tempName;
	namePos += SafeSprintf(namePos, NULLC_MAX_VARIABLE_NAME_LENGTH - int(namePos - tempName), "%s<", base->name);
	for(unsigned i = 0; i < aliases; i++)
		namePos += SafeSprintf(namePos, NULLC_MAX_VARIABLE_NAME_LENGTH - int(namePos - tempName), "%s%s", aliasType[i]->typeInfo->GetFullTypeName(), i == aliases - 1 ? "" : ", ");
	namePos += SafeSprintf(namePos, NULLC_MAX_VARIABLE_NAME_LENGTH - int(namePos - tempName), ">");

	// Check name length
	if(NULLC_MAX_VARIABLE_NAME_LENGTH - int(namePos - tempName) == 0)
		ThrowError(pos, "ERROR: generated generic type name exceeds maximum type length '%d'", NULLC_MAX_VARIABLE_NAME_LENGTH);

	AliasInfo *aliasList = NULL;

	unsigned aliasID = 0;
	// We are reparsing original class definition
	do
	{
		currType = aliasType[aliasID]->typeInfo;
		assert(start->type == lex_string); // This was already checked during parsing

		InplaceStr aliasName = InplaceStr(start->pos, start->length);
		AliasInfo *info = TypeInfo::CreateAlias(aliasName, currType);
		info->next = aliasList;
		aliasList = info;
		CodeInfo::classMap.insert(info->nameHash, currType);

		start++;
		aliasID++;
	}while(start->type == lex_comma ? !!start++ : false);
	if(aliasID > aliases)
		ThrowError(pos, "ERROR: there where only '%d' argument(s) to a generic type that expects '%d'", aliases, aliasID);
	else if(aliasID < aliases)
		ThrowError(pos, "ERROR: type has only '%d' generic argument(s) while '%d' specified", aliasID, aliases);
	assert(start->type == lex_greater);
	start++;

	base->genericInfo->aliasCount = aliases;

	// Remove type nodes used to instance class
	for(unsigned i = 0; i < aliases; i++)
		CodeInfo::nodeList.pop_back();

	// Search if the type was already defined
	if(TypeInfo **lastType = CodeInfo::classMap.find(GetStringHash(tempName, namePos)))
	{
		while(aliasList)
		{
			CodeInfo::classMap.remove(aliasList->nameHash, aliasList->type);
			aliasList = aliasList->next;
		}
		currType = *lastType;
		return;