-
Notifications
You must be signed in to change notification settings - Fork 298
/
NFClockKind.mo
439 lines (382 loc) · 12.2 KB
/
NFClockKind.mo
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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
/*
* This file is part of OpenModelica.
*
* Copyright (c) 1998-CurrentYear, Open Source Modelica Consortium (OSMC),
* c/o Linköpings universitet, Department of Computer and Information Science,
* SE-58183 Linköping, Sweden.
*
* All rights reserved.
*
* THIS PROGRAM IS PROVIDED UNDER THE TERMS OF GPL VERSION 3 LICENSE OR
* THIS OSMC PUBLIC LICENSE (OSMC-PL) VERSION 1.2.
* ANY USE, REPRODUCTION OR DISTRIBUTION OF THIS PROGRAM CONSTITUTES
* RECIPIENT'S ACCEPTANCE OF THE OSMC PUBLIC LICENSE OR THE GPL VERSION 3,
* ACCORDING TO RECIPIENTS CHOICE.
*
* The OpenModelica software and the Open Source Modelica
* Consortium (OSMC) Public License (OSMC-PL) are obtained
* from OSMC, either from the above address,
* from the URLs: http://www.ida.liu.se/projects/OpenModelica or
* http://www.openmodelica.org, and in the OpenModelica distribution.
* GNU version 3 is obtained from: http://www.gnu.org/copyleft/gpl.html.
*
* This program is distributed WITHOUT ANY WARRANTY; without
* even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE, EXCEPT AS EXPRESSLY SET FORTH
* IN THE BY RECIPIENT SELECTED SUBSIDIARY LICENSE CONDITIONS OF OSMC-PL.
*
* See the full OSMC Public License conditions for more details.
*
*/
encapsulated uniontype NFClockKind
import DAE;
import Expression = NFExpression;
protected
import ClockKind = NFClockKind;
public
record INFERRED_CLOCK
end INFERRED_CLOCK;
record INTEGER_CLOCK
Expression intervalCounter;
Expression resolution " integer type >= 1 ";
end INTEGER_CLOCK;
record REAL_CLOCK
Expression interval;
end REAL_CLOCK;
record BOOLEAN_CLOCK
Expression condition;
Expression startInterval " real type >= 0.0 ";
end BOOLEAN_CLOCK;
record SOLVER_CLOCK
Expression c;
Expression solverMethod " string type ";
end SOLVER_CLOCK;
function compare
input ClockKind ck1;
input ClockKind ck2;
output Integer comp;
algorithm
comp := match (ck1, ck2)
local
Expression i1, ic1, r1, c1, si1, sm1, i2, ic2, r2, c2, si2, sm2;
case (INFERRED_CLOCK(), INFERRED_CLOCK()) then 0;
case (INTEGER_CLOCK(i1, r1),INTEGER_CLOCK(i2, r2))
algorithm
comp := Expression.compare(i1, i2);
if (comp == 0) then
comp := Expression.compare(r1, r2);
end if;
then comp;
case (REAL_CLOCK(i1), REAL_CLOCK(i2)) then Expression.compare(i1, i2);
case (BOOLEAN_CLOCK(c1, si1), BOOLEAN_CLOCK(c2, si2))
algorithm
comp := Expression.compare(c1, c2);
if (comp == 0) then
comp := Expression.compare(si1, si2);
end if;
then comp;
case (SOLVER_CLOCK(c1, sm2), SOLVER_CLOCK(c2, sm1))
algorithm
comp := Expression.compare(c1, c2);
if (comp == 0) then
comp := Expression.compare(sm1, sm2);
end if;
then comp;
end match;
end compare;
function applyExp
input ClockKind ck;
input ApplyFunc func;
partial function ApplyFunc
input Expression exp;
end ApplyFunc;
algorithm
() := match ck
case INTEGER_CLOCK()
algorithm
Expression.apply(ck.intervalCounter, func);
Expression.apply(ck.resolution, func);
then
();
case REAL_CLOCK()
algorithm
Expression.apply(ck.interval, func);
then
();
case BOOLEAN_CLOCK()
algorithm
Expression.apply(ck.condition, func);
Expression.apply(ck.startInterval, func);
then
();
case SOLVER_CLOCK()
algorithm
Expression.apply(ck.c, func);
Expression.apply(ck.solverMethod, func);
then
();
else ();
end match;
end applyExp;
function applyExpShallow
input ClockKind ck;
input ApplyFunc func;
partial function ApplyFunc
input Expression exp;
end ApplyFunc;
algorithm
() := match ck
case INTEGER_CLOCK()
algorithm
func(ck.intervalCounter);
func(ck.resolution);
then
();
case REAL_CLOCK()
algorithm
func(ck.interval);
then
();
case BOOLEAN_CLOCK()
algorithm
func(ck.condition);
func(ck.startInterval);
then
();
case SOLVER_CLOCK()
algorithm
func(ck.c);
func(ck.solverMethod);
then
();
else ();
end match;
end applyExpShallow;
function foldExp<ArgT>
input ClockKind ck;
input FoldFunc func;
input ArgT arg;
output ArgT result;
partial function FoldFunc
input Expression exp;
input output ArgT arg;
end FoldFunc;
algorithm
result := match ck
case INTEGER_CLOCK()
algorithm
result := Expression.fold(ck.intervalCounter, func, arg);
then
Expression.fold(ck.resolution, func, result);
case REAL_CLOCK()
then Expression.fold(ck.interval, func, arg);
case BOOLEAN_CLOCK()
algorithm
result := Expression.fold(ck.condition, func, arg);
then
Expression.fold(ck.startInterval, func, result);
case SOLVER_CLOCK()
algorithm
result := Expression.fold(ck.c, func, arg);
then
Expression.fold(ck.solverMethod, func, result);
else arg;
end match;
end foldExp;
function mapExp
input ClockKind ck;
input MapFunc func;
output ClockKind outCk;
partial function MapFunc
input output Expression e;
end MapFunc;
protected
Expression e1, e2, e3, e4;
algorithm
outCk := match ck
case INTEGER_CLOCK(e1, e2)
algorithm
e3 := Expression.map(e1, func);
e4 := Expression.map(e2, func);
then
if referenceEq(e1, e3) and referenceEq(e2, e4) then ck else INTEGER_CLOCK(e3, e4);
case REAL_CLOCK(e1)
algorithm
e3 := Expression.map(e1, func);
then
if referenceEq(e1, e3) then ck else REAL_CLOCK(e3);
case BOOLEAN_CLOCK(e1, e2)
algorithm
e3 := Expression.map(e1, func);
e4 := Expression.map(e2, func);
then
if referenceEq(e1, e3) and referenceEq(e2, e4) then ck else BOOLEAN_CLOCK(e3, e4);
case SOLVER_CLOCK(e1, e2)
algorithm
e3 := Expression.map(e1, func);
e4 := Expression.map(e2, func);
then
if referenceEq(e1, e3) and referenceEq(e2, e4) then ck else SOLVER_CLOCK(e3, e4);
else ck;
end match;
end mapExp;
function mapExpShallow
input ClockKind ck;
input MapFunc func;
output ClockKind outCk;
partial function MapFunc
input output Expression e;
end MapFunc;
protected
Expression e1, e2, e3, e4;
algorithm
outCk := match ck
case INTEGER_CLOCK(e1, e2)
algorithm
e3 := func(e1);
e4 := func(e2);
then
if referenceEq(e1, e3) and referenceEq(e2, e4) then ck else INTEGER_CLOCK(e3, e4);
case REAL_CLOCK(e1)
algorithm
e3 := func(e1);
then
if referenceEq(e1, e3) then ck else REAL_CLOCK(e3);
case BOOLEAN_CLOCK(e1, e2)
algorithm
e3 := func(e1);
e4 := func(e2);
then
if referenceEq(e1, e3) and referenceEq(e2, e4) then ck else BOOLEAN_CLOCK(e3, e4);
case SOLVER_CLOCK(e1, e2)
algorithm
e3 := func(e1);
e4 := func(e2);
then
if referenceEq(e1, e3) and referenceEq(e2, e4) then ck else SOLVER_CLOCK(e3, e4);
else ck;
end match;
end mapExpShallow;
function mapFoldExp<ArgT>
input ClockKind ck;
input MapFunc func;
output ClockKind outCk;
input output ArgT arg;
partial function MapFunc
input output Expression e;
input output ArgT arg;
end MapFunc;
protected
Expression e1, e2, e3, e4;
algorithm
outCk := match ck
case INTEGER_CLOCK(e1, e2)
algorithm
(e3, arg) := Expression.mapFold(e1, func, arg);
(e4, arg) := Expression.mapFold(e2, func, arg);
then
if referenceEq(e1, e3) and referenceEq(e2, e4) then ck else INTEGER_CLOCK(e3, e4);
case REAL_CLOCK(e1)
algorithm
(e3, arg) := Expression.mapFold(e1, func, arg);
then
if referenceEq(e1, e3) then ck else REAL_CLOCK(e3);
case BOOLEAN_CLOCK(e1, e2)
algorithm
(e3, arg) := Expression.mapFold(e1, func, arg);
(e4, arg) := Expression.mapFold(e2, func, arg);
then
if referenceEq(e1, e3) and referenceEq(e2, e4) then ck else BOOLEAN_CLOCK(e3, e4);
case SOLVER_CLOCK(e1, e2)
algorithm
(e3, arg) := Expression.mapFold(e1, func, arg);
(e4, arg) := Expression.mapFold(e2, func, arg);
then
if referenceEq(e1, e3) and referenceEq(e2, e4) then ck else SOLVER_CLOCK(e3, e4);
else ck;
end match;
end mapFoldExp;
function mapFoldExpShallow<ArgT>
input ClockKind ck;
input MapFunc func;
output ClockKind outCk;
input output ArgT arg;
partial function MapFunc
input output Expression e;
input output ArgT arg;
end MapFunc;
protected
Expression e1, e2, e3, e4;
algorithm
outCk := match ck
case INTEGER_CLOCK(e1, e2)
algorithm
(e3, arg) := Expression.mapFoldShallow(e1, func, arg);
(e4, arg) := Expression.mapFoldShallow(e2, func, arg);
then
if referenceEq(e1, e3) and referenceEq(e2, e4) then ck else INTEGER_CLOCK(e3, e4);
case REAL_CLOCK(e1)
algorithm
(e3, arg) := Expression.mapFoldShallow(e1, func, arg);
then
if referenceEq(e1, e3) then ck else REAL_CLOCK(e3);
case BOOLEAN_CLOCK(e1, e2)
algorithm
(e3, arg) := Expression.mapFoldShallow(e1, func, arg);
(e4, arg) := Expression.mapFoldShallow(e2, func, arg);
then
if referenceEq(e1, e3) and referenceEq(e2, e4) then ck else BOOLEAN_CLOCK(e3, e4);
case SOLVER_CLOCK(e1, e2)
algorithm
(e3, arg) := Expression.mapFoldShallow(e1, func, arg);
(e4, arg) := Expression.mapFoldShallow(e2, func, arg);
then
if referenceEq(e1, e3) and referenceEq(e2, e4) then ck else SOLVER_CLOCK(e3, e4);
else ck;
end match;
end mapFoldExpShallow;
function toDAE
input ClockKind ick;
output DAE.ClockKind ock;
algorithm
ock := match ick
local
Expression i, ic, r, c, si, sm;
case INFERRED_CLOCK() then DAE.INFERRED_CLOCK();
case INTEGER_CLOCK(i, r) then DAE.INTEGER_CLOCK(Expression.toDAE(i), Expression.toDAE(r));
case REAL_CLOCK(i) then DAE.REAL_CLOCK(Expression.toDAE(i));
case BOOLEAN_CLOCK(c, si) then DAE.BOOLEAN_CLOCK(Expression.toDAE(c), Expression.toDAE(si));
case SOLVER_CLOCK(c, sm) then DAE.SOLVER_CLOCK(Expression.toDAE(c), Expression.toDAE(sm));
end match;
end toDAE;
function toDebugString
input ClockKind ick;
output String ock;
algorithm
ock := match ick
local
Expression i, ic, r, c, si, sm;
case INFERRED_CLOCK() then "INFERRED_CLOCK()";
case INTEGER_CLOCK(i, r) then "INTEGER_CLOCK(" + Expression.toString(i) + ", " + Expression.toString(r) + ")";
case REAL_CLOCK(i) then "REAL_CLOCK(" + Expression.toString(i) + ")";
case BOOLEAN_CLOCK(c, si) then "BOOLEAN_CLOCK(" + Expression.toString(c) + ", " + Expression.toString(si) + ")";
case SOLVER_CLOCK(c, sm) then "SOLVER_CLOCK(" + Expression.toString(c) + ", " + Expression.toString(sm) + ")";
end match;
end toDebugString;
function toString
input ClockKind ck;
output String str;
algorithm
str := match ck
local
Expression e1, e2;
case INFERRED_CLOCK() then "";
case INTEGER_CLOCK(e1, e2) then Expression.toString(e1) + ", " + Expression.toString(e2);
case REAL_CLOCK(e1) then Expression.toString(e1);
case BOOLEAN_CLOCK(e1, e2) then Expression.toString(e1) + ", " + Expression.toString(e2);
case SOLVER_CLOCK(e1, e2) then Expression.toString(e1) + ", " + Expression.toString(e2);
end match;
str := "Clock(" + str + ")";
end toString;
annotation(__OpenModelica_Interface="frontend");
end NFClockKind;