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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
#include "stdafx.h"
#include "TemplateUpdate.h"
#include "Engine.h"
#include "NameSet.h"
#include "Package.h"
#include "Type.h"
#include "Exception.h"
#include "Core/Set.h"
#include "Core/Array.h"
namespace storm {
static void allTypes(NameSet *root, Set<Type *> *to) {
for (NameSet::Iter i = root->begin(), end = root->end(); i != end; ++i) {
Named *here = i.v();
if (Type *t = as<Type>(here)) {
to->put(t);
allTypes(t, to);
} else if (NameSet *s = as<NameSet>(here)) {
allTypes(s, to);
}
}
}
static Set<Type *> *allTypes(NameSet *root) {
Set<Type *> *result = new (root) Set<Type *>();
allTypes(root, result);
return result;
}
static Bool hasType(Set<Type *> *toRemove, Named *named) {
for (Nat i = 0; i < named->params->count(); i++) {
if (toRemove->has(named->params->at(i).type))
return true;
}
return false;
}
// Returns any new types that were removed.
static Set<Type *> *remove(Set<Type *> *toRemove, Array<NameOverloads *> *in) {
Set<Type *> *removed = new (in) Set<Type *>();
for (Nat i = 0; i < in->count(); i++) {
NameOverloads *o = in->at(i);
// We might remove stuff, so we iterate backwards.
for (Nat j = o->count(); j > 0; j--) {
Named *n = o->at(j - 1);
if (hasType(toRemove, n)) {
// Remove it.
o->remove(n);
// If it was a type, we need to remove any uses of that type as well.
if (Type *t = as<Type>(n))
removed->put(t);
}
}
}
return removed;
}
void removeTemplatesFrom(NameSet *root) {
Set<Type *> *types = allTypes(root);
Array<NameOverloads *> *check = root->engine().package()->templateOverloads();
// Remove types unil we have nothing more to check.
while (types->any()) {
types = remove(types, check);
}
}
static Named *findOld(NameOverloads *in, Named *named, ReplaceContext *context) {
for (Nat i = 0; i < in->count(); i++) {
Named *candidate = in->at(i);
if (candidate == named)
continue;
if (candidate->params->count() != named->params->count())
continue;
bool same = true;
for (Nat j = 0; j < named->params->count(); j++) {
if (context->normalize(named->params->at(j)) != candidate->params->at(j)) {
same = false;
break;
}
}
// Found it!
if (same)
return candidate;
}
return null;
}
static void addNestedTypes(Type *oldType, Type *newType,
ReplaceContext *context, Set<Type *> *replaced, Array<NamedPair> *result) {
context->addEquivalence(oldType, newType);
replaced->put(newType);
newType->forceLoad();
// Find types in 'old' and their equivalent type in 'new':
for (NameSet::Iter i = newType->begin(), end = newType->end(); i != end; ++i) {
Type *newInner = as<Type>(i.v());
if (!newInner)
continue;
// TODO: This might not be enough - we might need to replace parameters with the context.
// Templates are, however, usually quite simple, so this is likely to work for now.
SimplePart *part = new (oldType) SimplePart(newInner->name, newInner->params);
Named *oldNamed = oldType->find(part, Scope());
Type *oldInner = as<Type>(oldNamed);
if (oldNamed == null) {
// All is well, it is a new type.
} else if (oldInner == null) {
StrBuf *msg = new (oldType) StrBuf();
*msg << S("Unable to replace a non-type with a type during template replacement.\n");
*msg << S("Old entity: ") << oldNamed << S("\n");
*msg << S("New entity: ") << newInner << S("\n");
throw new (oldType) ReplaceError(newInner->pos, msg->toS());
} else {
// TODO: Is this necessary?
result->push(NamedPair(oldInner, newInner));
addNestedTypes(oldInner, newInner, context, replaced, result);
}
}
}
static Set<Type *> *replace(Set<Type *> *toReplace, Array<NameOverloads *> *in,
ReplaceContext *context, Array<NamedPair> *result) {
Set<Type *> *replaced = new (in) Set<Type *>();
for (Nat i = 0; i < in->count(); i++) {
NameOverloads *o = in->at(i);
for (Nat j = 0; j < o->count(); j++) {
Named *n = o->at(j);
if (!hasType(toReplace, n))
continue;
Named *old = findOld(o, n, context);
// If an old version did not exist, we don't need to worry.
if (!old)
continue;
result->push(NamedPair(old, n));
// Update type equivalences if needed.
Type *oldType = as<Type>(old);
Type *newType = as<Type>(n);
if ((oldType == null) != (newType == null)) {
StrBuf *msg = new (in) StrBuf();
*msg << S("Unable to replace a type with a non-type during template replacement.\n");
*msg << S("Old entity: ") << old << S("\n");
*msg << S("New entity: ") << n;
throw new (in) ReplaceError(oldType->pos, msg->toS());
} else if (newType) {
addNestedTypes(oldType, newType, context, replaced, result);
}
}
}
return replaced;
}
Array<NamedPair> *replaceTemplatesFrom(NameSet *root, ReplaceContext *context) {
Array<NamedPair> *result = new (root) Array<NamedPair>();
Set<Type *> *types = context->allNewTypes();
Array<NameOverloads *> *check = root->engine().package()->templateOverloads();
while (types->any()) {
types = replace(types, check, context, result);
}
return result;
}
}
|
