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
|
/*
This file is part of the Maude 2 interpreter.
Copyright 1997-2006 SRI International, Menlo Park, CA 94025, USA.
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 option) 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
*/
//
// Implementation for abstract class StrategicTask.
//
// utility stuff
#include "macros.hh"
#include "vector.hh"
// forward declarations
#include "interface.hh"
#include "core.hh"
#include "strategyLanguage.hh"
// strategy language class definitions
#include "strategicProcess.hh"
StrategicProcess::StrategicProcess(StrategicExecution* taskSibling, StrategicProcess* other)
: StrategicExecution(taskSibling)
{
if (other == 0)
{
//
// Make degenerate circular list.
//
next = prev = this;
}
else
{
//
// Insert us into circular list just before other; i.e. we become
// the tail of the list w.r.t. other to ensure that all the remaining
// processes get to run before us.
//
prev = other->prev;
prev->next = this;
next = other;
next->prev = this;
}
}
StrategicProcess::~StrategicProcess()
{
prev->next = next;
next->prev = prev;
}
|
