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
|
/* $Id$
*
* Check, if next statements occur within a loop statement.
*
* Copyright (C) 2008-2009 FAUmachine Team <info@faumachine.org>.
* This program is free software. You can redistribute it and/or modify it
* under the terms of the GNU General Public License, either version 2 of
* the License, or (at your option) any later version. See COPYING.
*/
#include "frontend/visitor/CheckLoops.hpp"
#include "frontend/ast/LoopStat.hpp"
#include "frontend/ast/NextStat.hpp"
#include "frontend/ast/ExitStat.hpp"
#include "frontend/reporting/ErrorRegistry.hpp"
namespace ast {
template <typename T>
void
CheckLoops::visitLoopCFNode(T &node, const char *kind) const
{
LoopStat *referred = this->lookup(node.loopLabel);
if (referred == NULL) {
this->missingLoop(node, node.loopLabel, kind);
return;
}
assert(node.referredLoop == NULL);
node.referredLoop = referred;
}
void
CheckLoops::visit(ExitStat &node)
{
this->visitLoopCFNode(node, "Exit");
}
void
CheckLoops::visit(NextStat &node)
{
this->visitLoopCFNode(node, "Next");
}
void
CheckLoops::process(LoopStat &node)
{
this->loops.push_front(&node);
assert(node.loopStats != NULL);
if (node.loopStats->empty()) {
// issue warning?
}
this->listTraverse(*node.loopStats);
this->loops.pop_front();
}
LoopStat *
CheckLoops::lookup(SimpleName *label) const
{
if (label == NULL) {
if (this->loops.empty()) {
return NULL;
}
return this->loops.front();
}
for (std::list<LoopStat*>::const_iterator i = this->loops.begin();
i != this->loops.end(); i++) {
if (((*i)->name != NULL) && (*(*i)->name == *label->name)) {
return *i;
}
}
return NULL;
}
void
CheckLoops::missingLoop(
const AstNode &node,
const SimpleName *label,
const char *kind
) const
{
std::string msg;
if (label == NULL) {
msg = kind;
msg += " statement not within a loop statement.";
} else {
assert(label->name != NULL);
msg = "Missing loop statement with label <" + *label->name
+ ">.";
}
CompileError *ce = new CompileError(node, msg);
ErrorRegistry::addError(ce);
}
}; /* namespace ast */
|
