CParseTree.cpp

/*
 *  CParseTree.cpp
 *  HyperCompiler
 *
 *  Created by Uli Kusterer on 10.05.07.
 *  Copyright 2007 M. Uli Kusterer. All rights reserved.
 *
 */

#include "CParseTree.h"
#include "CNodeTransformation.h"
#include "CFunctionDefinitionNode.h"
#include <string>
#include <assert.h>


namespace Carlson
{


CParseTree::CParseTree()
	: mUniqueIdentifierSeed(0)
{

}


CParseTree::~CParseTree()
{
	std::deque<CNode*>::iterator itty;
	
	for( itty = mNodes.begin(); itty != mNodes.end(); itty++ )
	{
		delete *itty;
		*itty = NULL;
	}
}


void	CParseTree::AddFunctionDefinitionNode( CFunctionDefinitionNode* inNode )
{
	AddNode( inNode );
	mFunctionNodes[inNode->GetName()] = inNode;
}


void	CParseTree::Simplify()
{
	std::deque<CNode*>::iterator itty;
	
	for( itty = mNodes.begin(); itty != mNodes.end(); itty++ )
	{
		CNode	*	originalNode = *itty;
		originalNode->Simplify();	// Give subnodes a chance to apply transformations first. Might expose simpler sub-nodes we can then simplify.
		CNode* newNode = CNodeTransformationBase::Apply( originalNode );	// Returns either originalNode, or a totally new object, in which case we delete the old one.
		if( newNode != originalNode )
			*itty = newNode;
	}
}


void	CParseTree::Visit( std::function<void(CNode*)> visitorBlock )
{
	for( auto currNode : mNodes )
	{
		currNode->Visit(visitorBlock);
	}
}


void	CParseTree::GenerateCode( CCodeBlock* inCodeBlock )
{
	std::deque<CNode*>::iterator itty;
	
	for( itty = mNodes.begin(); itty != mNodes.end(); itty++ )
	{
		(*itty)->GenerateCode( inCodeBlock );
	}
}


void	CParseTree::DebugPrint( std::ostream& destStream, size_t indentLevel )
{
	INDENT_PREPARE(indentLevel);
	
	std::deque<CNode*>::iterator itty;
	
	for( itty = mNodes.begin(); itty != mNodes.end(); itty++ )
	{
		(*itty)->DebugPrint( destStream, indentLevel );
	}
}


std::string	CParseTree::GetUniqueIdentifierBasedOn( std::string inBaseIdentifier )
{
	std::string		outIdent( inBaseIdentifier );
	assert(ULLONG_MAX <= 18446744073709551615ULL);
	char			numStr[20+1] = {0};
	snprintf(numStr, 20, "%llu", mUniqueIdentifierSeed++);
	outIdent.append(numStr);
	return outIdent;
}

} // namespace Carlson