summaryrefslogtreecommitdiffstats
path: root/src/kvirc/kvs/kvi_kvs_treenode_specialcommandfor.cpp
blob: e608988c84c218f0e5493501e6ada8ba2e3859df (plain)
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
//=============================================================================
//
//   File : kvi_kvs_treenode_specialcommandfor.cpp
//   Created on Fri 07 Nov 2003 11:48:11 by Szymon Stefanek
//
//   This file is part of the KVIrc IRC client distribution
//   Copyright (C) 2003 Szymon Stefanek <pragma at kvirc dot net>
//
//   This program is FREE software. You can redistribute it and/or
//   modify it under the terms of the GNU General Public License
//   as published by the Free Software Foundation; either version 2
//   of the License, or (at your opinion) any later version.
//
//   This program is distributed in the HOPE that it will be USEFUL,
//   but WITHOUT ANY WARRANTY; without even the implied warranty of
//   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
//   See the GNU General Public License for more details.
//
//   You should have received a copy of the GNU General Public License
//   along with this program. If not, write to the Free Software Foundation,
//   Inc. ,51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
//
//=============================================================================

#define __KVIRC__

#include "kvi_kvs_treenode_specialcommandfor.h"
#include "kvi_kvs_treenode_expression.h"
#include "kvi_kvs_treenode_instruction.h"
#include "kvi_kvs_runtimecontext.h"
#include "kvi_locale.h"

KviKvsTreeNodeSpecialCommandFor::KviKvsTreeNodeSpecialCommandFor(const TQChar * pLocation,KviKvsTreeNodeInstruction * pInit,KviKvsTreeNodeExpression * pCond,KviKvsTreeNodeInstruction * pUpd,KviKvsTreeNodeInstruction * pLoop)
: KviKvsTreeNodeSpecialCommand(pLocation,"for")
{
	m_pInitialization = pInit;
	if(m_pInitialization)m_pInitialization->setParent(this);
	m_pCondition = pCond;
	if(m_pCondition)m_pCondition->setParent(this);
	m_pUpdate = pUpd;
	if(m_pUpdate)m_pUpdate->setParent(this);
	m_pLoop = pLoop;
	if(m_pLoop)m_pLoop->setParent(this);
}

KviKvsTreeNodeSpecialCommandFor::~KviKvsTreeNodeSpecialCommandFor()
{
	if(m_pInitialization)delete m_pInitialization;
	if(m_pCondition)delete m_pCondition;
	if(m_pUpdate)delete m_pUpdate;
	if(m_pLoop)delete m_pLoop;
}

void KviKvsTreeNodeSpecialCommandFor::contextDescription(TQString &szBuffer)
{
	szBuffer = "Special Command \"for\"";
}

void KviKvsTreeNodeSpecialCommandFor::dump(const char * prefix)
{
	debug("%s SpecialCommandFor",prefix);
	TQString tmp = prefix;
	tmp.append("  ");
	if(m_pInitialization)m_pInitialization->dump(tmp.utf8().data());
	if(m_pCondition)m_pCondition->dump(tmp.utf8().data());
	if(m_pUpdate)m_pUpdate->dump(tmp.utf8().data());
	if(m_pLoop)m_pLoop->dump(tmp.utf8().data());
}

bool KviKvsTreeNodeSpecialCommandFor::execute(KviKvsRunTimeContext * c)
{
	if(m_pInitialization)
	{
		if(!m_pInitialization->execute(c))
		{
			// break allowed also here
			if(c->error())return false;

			if(c->breakPending())
			{
				c->handleBreak();
				return true;
			}

			return false; // propagate false ret value
		}
	}

	for(;;)
	{
		if(m_pCondition)
		{
			KviKvsVariant v;
			if(!m_pCondition->evaluateReadOnly(c,&v))return false;
			if(!v.asBoolean())return true;
		}
	
		if(m_pLoop)
		{
			if(!m_pLoop->execute(c))
			{
				if(c->error())return false;

				if(c->breakPending())
				{
					c->handleBreak();
					return true;
				}

				return false; // propagate false ret value
			}
		}
		
		if(m_pUpdate)
		{
			if(!m_pUpdate->execute(c))
			{
				// break allowed also here
				if(c->error())return false;

				if(c->breakPending())
				{
					c->handleBreak();
					return true;
				}
				
				return false; // propagate false ret value
			}
		}
	}
	// not reached
	return false;
}