blob: 1a49ec1538aa6d9d174863458b925d57247ef5cb (
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
|
//=============================================================================
//
// File : kvi_kvs_treenode_instructionblock.cpp
// Created on Thu 09 Oct 2003 01:44:31 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_instructionblock.h"
#include "kvi_kvs_runtimecontext.h"
KviKvsTreeNodeInstructionBlock::KviKvsTreeNodeInstructionBlock(const TQChar * pLocation)
: KviKvsTreeNodeInstruction(pLocation)
{
m_pInstructionList = new KviPointerList<KviKvsTreeNodeInstruction>;
m_pInstructionList->setAutoDelete(true);
}
KviKvsTreeNodeInstructionBlock::~KviKvsTreeNodeInstructionBlock()
{
delete m_pInstructionList;
}
void KviKvsTreeNodeInstructionBlock::contextDescription(TQString &szBuffer)
{
szBuffer = "Instruction Block";
}
void KviKvsTreeNodeInstructionBlock::dump(const char * prefix)
{
debug("%s InstructionBlock",prefix);
TQString tmp = prefix;
tmp.append(" ");
for(KviKvsTreeNodeInstruction * i = m_pInstructionList->first();i;i = m_pInstructionList->next())
{
i->dump(tmp.utf8().data());
}
}
KviKvsTreeNodeInstruction * KviKvsTreeNodeInstructionBlock::releaseFirst()
{
m_pInstructionList->setAutoDelete(false);
KviKvsTreeNodeInstruction * i = m_pInstructionList->first();
if(i)
{
i->setParent(0);
m_pInstructionList->removeFirst();
}
m_pInstructionList->setAutoDelete(true);
return i;
}
void KviKvsTreeNodeInstructionBlock::addInstruction(KviKvsTreeNodeInstruction * i)
{
m_pInstructionList->append(i);
i->setParent(this);
}
bool KviKvsTreeNodeInstructionBlock::execute(KviKvsRunTimeContext * c)
{
// to accomodate recursion we need to use an iterator here
KviPointerListIterator<KviKvsTreeNodeInstruction> it(*m_pInstructionList);
while(KviKvsTreeNodeInstruction * i = it.current())
{
if(!i->execute(c))return false;
++it;
}
return true;
}
|
