-
Notifications
You must be signed in to change notification settings - Fork 139
/
Copy pathNamespaceUDT.cpp
131 lines (116 loc) · 3.66 KB
/
NamespaceUDT.cpp
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
/*******************************************************************************
* Copyright IBM Corp. and others 2016
*
* This program and the accompanying materials are made available under
* the terms of the Eclipse Public License 2.0 which accompanies this
* distribution and is available at https://www.eclipse.org/legal/epl-2.0/
* or the Apache License, Version 2.0 which accompanies this distribution
* and is available at https://www.apache.org/licenses/LICENSE-2.0.
*
* This Source Code may also be made available under the following Secondary
* Licenses when the conditions for such availability set forth in the
* Eclipse Public License, v. 2.0 are satisfied: GNU General Public License,
* version 2 with the GNU Classpath Exception [1] and GNU General Public
* License, version 2 with the OpenJDK Assembly Exception [2].
*
* [1] https://www.gnu.org/software/classpath/license.html
* [2] https://openjdk.org/legal/assembly-exception.html
*
* SPDX-License-Identifier: EPL-2.0 OR Apache-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0 OR GPL-2.0-only WITH OpenJDK-assembly-exception-1.0
*******************************************************************************/
#include "ddr/ir/NamespaceUDT.hpp"
#include "ddr/ir/Symbol_IR.hpp"
NamespaceUDT::NamespaceUDT(unsigned int lineNumber)
: UDT(0, lineNumber)
, _subUDTs()
, _macros()
, _enumMembers()
{
}
NamespaceUDT::~NamespaceUDT()
{
for (vector<EnumMember *>::iterator it = _enumMembers.begin(); it != _enumMembers.end(); ++it) {
delete *it;
}
_enumMembers.clear();
for (vector<UDT *>::const_iterator it = _subUDTs.begin(); it != _subUDTs.end(); ++it) {
delete *it;
}
_subUDTs.clear();
}
DDR_RC
NamespaceUDT::acceptVisitor(const TypeVisitor &visitor)
{
return visitor.visitNamespace(this);
}
bool
NamespaceUDT::insertUnique(Symbol_IR *ir)
{
/* Even if this is a duplicate, there may be additions to this namespace. */
for (vector<UDT *>::iterator it = _subUDTs.begin(); it != _subUDTs.end();) {
if ((*it)->insertUnique(ir)) {
++it;
} else {
it = _subUDTs.erase(it);
}
}
return UDT::insertUnique(ir);
}
const string &
NamespaceUDT::getSymbolKindName() const
{
static const string namespaceKind("namespace");
return namespaceKind;
}
void
NamespaceUDT::addMacro(Macro *macro)
{
/* Add or update a macro: The last of a #define/#undef sequence applies. */
for (vector<Macro>::iterator it = _macros.begin();; ++it) {
if (_macros.end() == it) {
_macros.push_back(*macro);
break;
} else if (macro->_name == it->_name) {
it->setValue(macro->getValue());
break;
}
}
}
std::vector<UDT *> *
NamespaceUDT::getSubUDTS()
{
return &_subUDTs;
}
void
NamespaceUDT::renameFieldsAndMacros(const FieldOverride &fieldOverride, Type *replacementType)
{
UDT::renameFieldsAndMacros(fieldOverride, replacementType);
if (!fieldOverride.isTypeOverride) {
for (vector<Macro>::iterator it = _macros.begin(); it != _macros.end(); ++it) {
if (it->_name == fieldOverride.fieldName) {
it->_name = fieldOverride.overrideName;
}
}
}
for (vector<UDT *>::iterator it = _subUDTs.begin(); it != _subUDTs.end(); ++it) {
(*it)->renameFieldsAndMacros(fieldOverride, replacementType);
}
}
bool
NamespaceUDT::operator==(const Type & rhs) const
{
return rhs.compareToNamespace(*this);
}
bool
NamespaceUDT::compareToNamespace(const NamespaceUDT &other) const
{
bool subUDTsEqual = _subUDTs.size() == other._subUDTs.size();
vector<UDT *>::const_iterator it2 = other._subUDTs.begin();
for (vector<UDT *>::const_iterator it = _subUDTs.begin();
it != _subUDTs.end() && it2 != other._subUDTs.end() && subUDTsEqual;
++ it, ++ it2) {
subUDTsEqual = (**it == **it2);
}
return compareToUDT(other)
&& subUDTsEqual;
}