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
|
/* Final validation after constant folding.
Copyright (C) 2025 Free Software Foundation, Inc.
GCC 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 3, or (at your option)
any later version.
GCC 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 GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "elna/boot/validation.h"
#include <unordered_map>
namespace elna::boot
{
validation_error::validation_error(const source_position position, payload_type payload)
: error(position), payload(payload)
{
}
std::string validation_error::what() const
{
return std::visit([](const auto& payload) -> std::string {
using T = std::decay_t<decltype(payload)>;
if constexpr (std::is_same_v<T, duplicate_case>)
{
return "Duplicate case label";
}
}, this->payload);
}
std::optional<std::pair<std::string, source_position>> validation_error::note() const
{
return std::visit([](const auto& payload) -> std::optional<std::pair<std::string, source_position>> {
using T = std::decay_t<decltype(payload)>;
if constexpr (std::is_same_v<T, duplicate_case>)
{
return std::make_pair("Previous label here", payload.first);
}
}, this->payload);
}
validation_visitor::validation_visitor(symbol_bag& bag, const target_info& target)
: bag(bag), constant_evaluator(this->bag, target)
{
}
void validation_visitor::visit(unit *unit)
{
for (procedure_declaration *procedure : unit->procedures)
{
procedure->accept(this);
}
for (auto *entry_statement : unit->entry_point)
{
entry_statement->accept(this);
}
}
void validation_visitor::visit(procedure_declaration *declaration)
{
if (declaration->body.has_value())
{
auto procedure = this->bag.lookup(declaration->identifier.name())->is_procedure();
this->bag.enter(procedure->scope);
}
walking_visitor::visit(declaration);
if (declaration->body.has_value())
{
this->bag.leave();
}
}
void validation_visitor::visit(case_statement *statement)
{
walking_visitor::visit(statement);
std::unordered_map<constant_value, source_position, constant_value_hash> seen;
for (const auto& case_block : statement->cases)
{
for (auto *label : case_block.labels)
{
auto value = this->constant_evaluator.evaluate(*label);
if (!value.has_value())
{
add_error<non_constant_expression_error>(label->position(),
non_constant_expression_error::case_label{});
continue;
}
auto [case_position, inserted] = seen.try_emplace(value.value(), label->position());
if (!inserted)
{
add_error<validation_error>(label->position(),
validation_error::duplicate_case{ case_position->second });
}
}
}
}
}
|
