-
Notifications
You must be signed in to change notification settings - Fork 2
/
COperatorNode.cpp
90 lines (67 loc) · 2.23 KB
/
COperatorNode.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
/*
* COperatorNode.cpp
* HyperCompiler
*
* Created by Uli Kusterer on 12.05.07.
* Copyright 2007 M. Uli Kusterer. All rights reserved.
*
*/
#include "COperatorNode.h"
#include "CParseTree.h"
#include "CCodeBlock.h"
#include "LEOInstructions.h"
#include "CNodeTransformation.h"
namespace Carlson
{
void COperatorNode::DebugPrint( std::ostream& destStream, size_t indentLevel )
{
INDENT_PREPARE(indentLevel);
destStream << indentChars << GetDebugNodeName() << " \"" << ((gNumInstructions > mInstructionID) ? gInstructions[mInstructionID].name : "???") << "\"" << std::endl
<< indentChars << "{" << std::endl;
std::vector<CValueNode*>::iterator itty;
for( itty = mParams.begin(); itty != mParams.end(); itty++ )
{
(*itty)->DebugPrint( destStream, indentLevel +1 );
}
destStream << indentChars << "}" << std::endl;
}
void COperatorNode::AddParam( CValueNode* val )
{
mParams.push_back( val );
mParseTree->NodeWasAdded(val);
}
CValueNode* COperatorNode::Copy()
{
COperatorNode * nodeCopy = new COperatorNode( mParseTree, mInstructionID, mLineNum );
std::vector<CValueNode*>::const_iterator itty;
for( itty = mParams.begin(); itty != mParams.end(); itty++ )
{
nodeCopy->AddParam( (*itty)->Copy() );
}
return nodeCopy;
}
void COperatorNode::Simplify()
{
CValueNode::Simplify();
std::vector<CValueNode*>::iterator itty;
for( itty = mParams.begin(); itty != mParams.end(); itty++ )
{
CValueNode * 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 )
{
assert( dynamic_cast<CValueNode*>(newNode) != NULL );
*itty = (CValueNode*)newNode;
}
}
}
void COperatorNode::GenerateCode( CCodeBlock* inCodeBlock )
{
std::vector<CValueNode*>::iterator itty;
// Push all params on stack:
for( itty = mParams.begin(); itty != mParams.end(); itty++ )
(*itty)->GenerateCode( inCodeBlock );
inCodeBlock->GenerateOperatorInstruction( mInstructionID, mInstructionParam1, mInstructionParam2 );
}
} // namespace Carlson