/
FBuiltin.mo
700 lines (606 loc) · 35.6 KB
/
FBuiltin.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
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
/*
* This file is part of OpenModelica.
*
* Copyright (c) 1998-2014, 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 package FBuiltin
" file: FBuiltin.mo
package: FBuiltin
description: Builting tyepes and variables
This module defines the builtin types, variables and functions in Modelica.
There are several builtin attributes defined in the builtin types, such as unit, start, etc."
public import Absyn;
public import AbsynUtil;
public import DAE;
public import Error;
public import SCode;
public import FCore;
public import FGraph;
// protected imports
protected import ClassInf;
protected import Config;
protected import Flags;
protected import FGraphBuild;
protected import Global;
protected import List;
protected import MetaUtil;
protected import Parser;
protected import AbsynToSCode;
import SCodeUtil;
protected import Settings;
protected import System;
protected import Util;
/* These imports were used in e.g. MSL 1.6. They should not be here anymore...
If you need them, add them to the initial environment and recompile; they are not standard Modelica.
import arcsin = asin;
import arccos = acos;
import arctan = atan;
import ln = log;
*/
// Predefined DAE.Types
// Real arrays
protected constant DAE.Type T_REAL_ARRAY_DEFAULT = DAE.T_ARRAY(DAE.T_REAL_DEFAULT, {DAE.DIM_UNKNOWN()});
protected constant DAE.Type T_REAL_ARRAY_1_DEFAULT = DAE.T_ARRAY(DAE.T_REAL_DEFAULT, {DAE.DIM_INTEGER(1)});
// Integer arrays
protected constant DAE.Type T_INT_ARRAY_1_DEFAULT = DAE.T_ARRAY(DAE.T_INTEGER_DEFAULT, {DAE.DIM_INTEGER(1)});
protected constant SCode.Prefixes commonPrefixes =
SCode.PREFIXES(
SCode.PUBLIC(),
SCode.NOT_REDECLARE(),
SCode.FINAL(), // make everything here final!
Absyn.NOT_INNER_OUTER(),
SCode.NOT_REPLACEABLE());
protected constant SCode.Prefixes commonPrefixesNotFinal =
SCode.PREFIXES(
SCode.PUBLIC(),
SCode.NOT_REDECLARE(),
SCode.NOT_FINAL(), // make everything here final!
Absyn.NOT_INNER_OUTER(),
SCode.NOT_REPLACEABLE());
protected
constant SCode.Attributes attrConst = SCode.ATTR({},SCode.POTENTIAL(),SCode.NON_PARALLEL(),SCode.CONST(),Absyn.BIDIR(),Absyn.NONFIELD());
constant SCode.Attributes attrParam = SCode.ATTR({},SCode.POTENTIAL(),SCode.NON_PARALLEL(),SCode.PARAM(),Absyn.BIDIR(),Absyn.NONFIELD());
constant SCode.Attributes attrParamVectorNoDim = SCode.ATTR({Absyn.NOSUB()},SCode.POTENTIAL(),SCode.NON_PARALLEL(),SCode.PARAM(),Absyn.BIDIR(),Absyn.NONFIELD());
//
// The primitive types
// These are the primitive types that are used to build the types
// Real, Integer etc.
protected constant SCode.Element rlType = SCode.CLASS("RealType",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_PREDEFINED_REAL(),
SCode.PARTS({},{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo) " real type ";
protected constant SCode.Element intType = SCode.CLASS("IntegerType",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_PREDEFINED_INTEGER(),
SCode.PARTS({},{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo);
protected constant SCode.Element strType = SCode.CLASS("StringType",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_PREDEFINED_STRING(),
SCode.PARTS({},{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo);
protected constant SCode.Element boolType = SCode.CLASS("BooleanType",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_PREDEFINED_BOOLEAN(),
SCode.PARTS({},{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo);
protected constant SCode.Element enumType = SCode.CLASS("EnumType",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_PREDEFINED_ENUMERATION(),
SCode.PARTS({},{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo);
protected constant SCode.Element unit = SCode.COMPONENT("unit",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("StringType"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},SOME(Absyn.STRING("")), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo) "This `unit\' component is used in several places below, and it is
declared once here to make the definitions below easier to read." ;
protected constant SCode.Element quantity = SCode.COMPONENT("quantity",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("StringType"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},SOME(Absyn.STRING("")), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo);
protected constant SCode.Element displayUnit = SCode.COMPONENT("displayUnit",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("StringType"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},SOME(Absyn.STRING("")), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo);
protected constant SCode.Element min = SCode.COMPONENT("min",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("RealType"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},SOME(Absyn.REAL("-1e+099")), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo);
protected constant SCode.Element max = SCode.COMPONENT("max",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("RealType"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},SOME(Absyn.REAL("1e+099")), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo);
protected constant SCode.Element startOrigin = SCode.COMPONENT("startOrigin",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("StringType"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},SOME(Absyn.STRING("undefined")), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo);
protected constant SCode.Element realStart = SCode.COMPONENT("start",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("RealType"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},SOME(Absyn.REAL("0.0")), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo);
protected constant SCode.Element integerStart = SCode.COMPONENT("start",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("IntegerType"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},SOME(Absyn.INTEGER(0)), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo);
protected constant SCode.Element stringStart = SCode.COMPONENT("start",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("StringType"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},SOME(Absyn.STRING("")), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo);
protected constant SCode.Element booleanStart = SCode.COMPONENT("start",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("BooleanType"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},SOME(Absyn.BOOL(false)), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo);
protected constant SCode.Element fixed = SCode.COMPONENT("fixed",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("BooleanType"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},SOME(Absyn.BOOL(false)), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo) "Should be true for variables" ;
protected constant SCode.Element nominal = SCode.COMPONENT("nominal",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("RealType"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},NONE(), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo);
protected constant SCode.Element stateSelect = SCode.COMPONENT("stateSelect",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("StateSelect"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},
SOME(
Absyn.CREF(
Absyn.CREF_QUAL("StateSelect",{},Absyn.CREF_IDENT("default",{})))), AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo);
// Extensions for uncertainties
protected constant SCode.Element uncertainty=SCode.COMPONENT("uncertain",commonPrefixes,
attrParam,Absyn.TPATH(Absyn.IDENT("Uncertainty"),NONE()),
SCode.MOD(SCode.NOT_FINAL(),SCode.NOT_EACH(),{},
SOME(Absyn.CREF(Absyn.CREF_QUAL("Uncertainty",{},Absyn.CREF_IDENT("given",{})))),AbsynUtil.dummyInfo),SCode.noComment,NONE(),AbsynUtil.dummyInfo);
protected constant SCode.Element distribution = SCode.COMPONENT("distribution",commonPrefixes,attrParam,Absyn.TPATH(Absyn.IDENT("Distribution"),NONE()),
SCode.NOMOD(),SCode.noComment,NONE(),AbsynUtil.dummyInfo); // Distribution is declared in ModelicaBuiltin.mo
// END Extensions for uncertainties
protected constant list<SCode.Element> stateSelectComps = {
SCode.COMPONENT("never",commonPrefixes,
attrConst,Absyn.TPATH(Absyn.IDENT("EnumType"),NONE()),SCode.NOMOD(),SCode.noComment,NONE(),AbsynUtil.dummyInfo),
SCode.COMPONENT("avoid",commonPrefixes,
attrConst,Absyn.TPATH(Absyn.IDENT("EnumType"),NONE()),SCode.NOMOD(),SCode.noComment,NONE(),AbsynUtil.dummyInfo),
SCode.COMPONENT("default",commonPrefixes,
attrConst,Absyn.TPATH(Absyn.IDENT("EnumType"),NONE()),SCode.NOMOD(),SCode.noComment,NONE(),AbsynUtil.dummyInfo),
SCode.COMPONENT("prefer",commonPrefixes,
attrConst,Absyn.TPATH(Absyn.IDENT("EnumType"),NONE()),SCode.NOMOD(),SCode.noComment,NONE(),AbsynUtil.dummyInfo),
SCode.COMPONENT("always",commonPrefixes,
attrConst,Absyn.TPATH(Absyn.IDENT("EnumType"),NONE()),SCode.NOMOD(),SCode.noComment,NONE(),AbsynUtil.dummyInfo)} "The StateSelect enumeration" ;
protected constant list<SCode.Element> uncertaintyComps = {
SCode.COMPONENT("given",commonPrefixes,
attrConst,Absyn.TPATH(Absyn.IDENT("EnumType"),NONE()),SCode.NOMOD(),SCode.noComment,NONE(),AbsynUtil.dummyInfo),
SCode.COMPONENT("sought",commonPrefixes,
attrConst,Absyn.TPATH(Absyn.IDENT("EnumType"),NONE()),SCode.NOMOD(),SCode.noComment,NONE(),AbsynUtil.dummyInfo),
SCode.COMPONENT("refine",commonPrefixes,
attrConst,Absyn.TPATH(Absyn.IDENT("EnumType"),NONE()),SCode.NOMOD(),SCode.noComment,NONE(),AbsynUtil.dummyInfo)} "The Uncertainty enumeration" ;
protected constant SCode.Element stateSelectType = SCode.CLASS("StateSelect",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_ENUMERATION(),
SCode.PARTS(stateSelectComps,{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo) "The State Select Type";
protected constant SCode.Element uncertaintyType = SCode.CLASS("Uncertainty",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_ENUMERATION(),
SCode.PARTS(uncertaintyComps,{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo) "The Uncertainty Type";
protected constant SCode.Element ExternalObjectType = SCode.CLASS("ExternalObject",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_CLASS(),
SCode.PARTS({},{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo) "ExternalObject type" ;
// The Real type
protected constant SCode.Element realType = SCode.CLASS("Real",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_PREDEFINED_REAL(),
SCode.PARTS({unit,quantity,displayUnit,min,max,realStart,fixed,nominal,
stateSelect,uncertainty,distribution,startOrigin},{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo) "- The `Real\' type" ;
// The Integer type
protected constant SCode.Element integerType = SCode.CLASS("Integer",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_PREDEFINED_INTEGER(),
SCode.PARTS({quantity,min,max,integerStart,fixed,uncertainty,distribution,startOrigin},{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo) "- The `Integer\' type" ;
// The String type
protected constant SCode.Element stringType = SCode.CLASS("String",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_PREDEFINED_STRING(),
SCode.PARTS({quantity,stringStart,startOrigin},{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo) "- The `String\' type" ;
// The Boolean type
protected constant SCode.Element booleanType = SCode.CLASS("Boolean",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_PREDEFINED_BOOLEAN(),
SCode.PARTS({quantity,booleanStart,fixed,startOrigin},{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo) "- The `Boolean\' type" ;
// BTH The Clock type
protected constant SCode.Element clockType = SCode.CLASS("Clock",commonPrefixes,SCode.NOT_ENCAPSULATED(),SCode.NOT_PARTIAL(),SCode.R_PREDEFINED_CLOCK(),
SCode.PARTS({},{},{},{},{},{},{},NONE()),SCode.noComment,AbsynUtil.dummyInfo) "- The `Clock\' type" ;
// The builtin variable time. See also variableIsBuiltin
protected constant DAE.Var timeVar = DAE.TYPES_VAR("time",
DAE.dummyAttrInput,
DAE.T_REAL_DEFAULT,DAE.UNBOUND(),false,NONE());
/* Optimica Extensions. Theses variables are considered builtin for Optimica: startTime, finalTime, objectiveIntegrand and objective */
/* Optimica Extensions. The builtin variable startTime. */
protected constant DAE.Var startTimeVar = DAE.TYPES_VAR("startTime",
DAE.dummyAttrInput,
DAE.T_REAL_DEFAULT,DAE.UNBOUND(),false,NONE()) "- The `startTime\' variable" ;
/* Optimica Extensions. The builtin variable finalTime. */
protected constant DAE.Var finalTimeVar = DAE.TYPES_VAR("finalTime",
DAE.dummyAttrInput,
DAE.T_REAL_DEFAULT,DAE.UNBOUND(),false,NONE()) "- The `finalTime\' variable" ;
/* Optimica Extensions. The builtin variable objectiveIntegrand. */
protected constant DAE.Var objectiveIntegrandVar = DAE.TYPES_VAR("objectiveIntegrand",
DAE.dummyAttrInput,
DAE.T_REAL_DEFAULT,DAE.UNBOUND(),false,NONE()) "- The `objectiveIntegrand\' variable" ;
/* Optimica Extensions. The builtin variable objective. */
protected constant DAE.Var objectiveVar = DAE.TYPES_VAR("objective",
DAE.dummyAttrInput,
DAE.T_REAL_DEFAULT,DAE.UNBOUND(),false,NONE()) "- The `objective\' variable" ;
protected constant DAE.FuncArg argRealX = DAE.FUNCARG("x",DAE.T_REAL_DEFAULT,DAE.C_VAR(),DAE.NON_PARALLEL(),NONE());
protected constant DAE.FuncArg argRealY = DAE.FUNCARG("y",DAE.T_REAL_DEFAULT,DAE.C_VAR(),DAE.NON_PARALLEL(),NONE());
protected constant DAE.FuncArg argRealZ = DAE.FUNCARG("z",DAE.T_REAL_DEFAULT,DAE.C_VAR(),DAE.NON_PARALLEL(),NONE());
protected constant list<DAE.FuncArg> argsRealX = {argRealX};
protected constant list<DAE.FuncArg> argsRealXY = {argRealX, argRealY};
protected constant list<DAE.FuncArg> argsRealXYZ = {argRealX, argRealY, argRealZ};
protected constant SCode.Element timeComp =
SCode.COMPONENT(
"time",
SCode.defaultPrefixes,
SCode.ATTR({}, SCode.POTENTIAL(), SCode.NON_PARALLEL(), SCode.VAR(), Absyn.INPUT(),Absyn.NONFIELD()),
Absyn.TPATH(Absyn.IDENT("Real"), NONE()), SCode.NOMOD(),
SCode.noComment, NONE(), AbsynUtil.dummyInfo);
protected constant SCode.Element startTimeComp =
SCode.COMPONENT(
"startTime",
SCode.defaultPrefixes,
SCode.ATTR({}, SCode.POTENTIAL(), SCode.NON_PARALLEL(), SCode.VAR(), Absyn.INPUT(),Absyn.NONFIELD()),
Absyn.TPATH(Absyn.IDENT("Real"), NONE()), SCode.NOMOD(),
SCode.noComment, NONE(), AbsynUtil.dummyInfo);
protected constant SCode.Element finalTimeComp =
SCode.COMPONENT(
"finalTime",
SCode.defaultPrefixes,
SCode.ATTR({}, SCode.POTENTIAL(), SCode.NON_PARALLEL(), SCode.VAR(), Absyn.INPUT(),Absyn.NONFIELD()),
Absyn.TPATH(Absyn.IDENT("Real"), NONE()), SCode.NOMOD(),
SCode.noComment, NONE(), AbsynUtil.dummyInfo);
protected constant SCode.Element objectiveIntegrandComp =
SCode.COMPONENT(
"objectiveIntegrand",
SCode.defaultPrefixes,
SCode.ATTR({}, SCode.POTENTIAL(), SCode.NON_PARALLEL(), SCode.VAR(), Absyn.INPUT(),Absyn.NONFIELD()),
Absyn.TPATH(Absyn.IDENT("Real"), NONE()), SCode.NOMOD(),
SCode.noComment, NONE(), AbsynUtil.dummyInfo);
protected constant SCode.Element objectiveVarComp =
SCode.COMPONENT(
"objectiveVar",
SCode.defaultPrefixes,
SCode.ATTR({}, SCode.POTENTIAL(), SCode.NON_PARALLEL(), SCode.VAR(), Absyn.INPUT(),Absyn.NONFIELD()),
Absyn.TPATH(Absyn.IDENT("Real"), NONE()), SCode.NOMOD(),
SCode.noComment, NONE(), AbsynUtil.dummyInfo);
protected constant list<SCode.Element> basicTypes = {clockType, rlType, intType, strType, boolType, enumType, ExternalObjectType, realType, integerType, stringType, booleanType, uncertaintyType};
protected constant list<SCode.Element> basicTypesNF = {clockType, rlType, intType, strType, boolType, enumType, realType, integerType, stringType, booleanType, uncertaintyType};
public function getBasicTypes
output list<SCode.Element> tys;
algorithm
tys := if Flags.isSet(Flags.SCODE_INST) then basicTypesNF else basicTypes;
end getBasicTypes;
public function variableIsBuiltin
"Returns true if cref is a builtin variable.
Currently only 'time' is a builtin variable."
input DAE.ComponentRef cref;
input Boolean useOptimica;
output Boolean b;
algorithm
b := match (cref, useOptimica)
case(DAE.CREF_IDENT(ident="time"),_) then true;
case(_,false) then false;
//If accepting Optimica then these variabels are also builtin
case(DAE.CREF_IDENT(ident="startTime"),true) then true;
case(DAE.CREF_IDENT(ident="finalTime"),true) then true;
case(DAE.CREF_IDENT(ident="objective"),true) then true;
case(DAE.CREF_IDENT(ident="objectiveIntegrand"),true) then true;
else false;
end match;
end variableIsBuiltin;
public function isDer
input Absyn.Path inPath;
algorithm
_:=
match (inPath)
local Absyn.Path path;
case (Absyn.IDENT(name = "der")) then ();
case (Absyn.FULLYQUALIFIED(path)) equation isDer(path); then ();
end match;
end isDer;
public function getInitialFunctions
"Fetches the Absyn.Program representation of the functions (and other classes) in the initial environment"
output Absyn.Program initialProgram;
output SCode.Program initialSCodeProgram;
protected
// legend: NF = new frontend; CF = current frontend
String fileModelicaNF,fileModelicaCF,fileMetaModelica,fileParModelica,filePDEModelica;
list<tuple<tuple<Integer,Boolean>,tuple<Absyn.Program,SCode.Program>>> assocLst;
list<Absyn.Class> classesNF,classesCF,classes1NF,classes1CF,classes2;
Absyn.Program p, pNF, pCF;
SCode.Program sp, spNF, spCF;
algorithm
fileModelicaNF := Settings.getInstallationDirectoryPath() + "/lib/omc/NFModelicaBuiltin.mo";
fileModelicaCF := Settings.getInstallationDirectoryPath() + "/lib/omc/ModelicaBuiltin.mo";
fileMetaModelica := Settings.getInstallationDirectoryPath() + "/lib/omc/MetaModelicaBuiltin.mo";
fileParModelica := Settings.getInstallationDirectoryPath() + "/lib/omc/ParModelicaBuiltin.mo";
filePDEModelica := Settings.getInstallationDirectoryPath() + "/lib/omc/PDEModelicaBuiltin.mo";
(initialProgram,initialSCodeProgram) := matchcontinue ()
case ()
equation
failure(_ = getGlobalRoot(Global.builtinIndex));
setGlobalRoot(Global.builtinIndex,{});
then fail();
case ()
equation
assocLst = getGlobalRoot(Global.builtinIndex);
((p,sp)) = Util.assoc(Util.makeTuple(Flags.getConfigEnum(Flags.GRAMMAR), Flags.isSet(Flags.SCODE_INST)) , assocLst);
then (p,sp);
case ()
equation
true = intEq(Flags.getConfigEnum(Flags.GRAMMAR), Flags.METAMODELICA);
Error.assertionOrAddSourceMessage(System.regularFileExists(fileModelicaNF),Error.FILE_NOT_FOUND_ERROR,{fileModelicaNF},AbsynUtil.dummyInfo);
Error.assertionOrAddSourceMessage(System.regularFileExists(fileModelicaCF),Error.FILE_NOT_FOUND_ERROR,{fileModelicaCF},AbsynUtil.dummyInfo);
Error.assertionOrAddSourceMessage(System.regularFileExists(fileMetaModelica),Error.FILE_NOT_FOUND_ERROR,{fileMetaModelica},AbsynUtil.dummyInfo);
Absyn.PROGRAM(classes=classes1NF,within_=Absyn.TOP()) = Parser.parsebuiltin(fileModelicaNF,"UTF-8","",NONE(),acceptedGram=Flags.METAMODELICA);
Absyn.PROGRAM(classes=classes1CF,within_=Absyn.TOP()) = Parser.parsebuiltin(fileModelicaCF,"UTF-8","",NONE(),acceptedGram=Flags.METAMODELICA);
Absyn.PROGRAM(classes=classes2,within_=Absyn.TOP()) = Parser.parsebuiltin(fileMetaModelica,"UTF-8","",NONE(),acceptedGram=Flags.METAMODELICA);
classesNF = listAppend(classes1NF,classes2);
classesCF = listAppend(classes1CF,classes2);
pNF = Absyn.PROGRAM(classesNF,Absyn.TOP());
pCF = Absyn.PROGRAM(classesCF,Absyn.TOP());
(pNF as Absyn.PROGRAM(classes=classesNF)) = MetaUtil.createMetaClassesInProgram(pNF);
(pCF as Absyn.PROGRAM(classes=classesCF)) = MetaUtil.createMetaClassesInProgram(pCF);
spNF = List.map(classesNF, AbsynToSCode.translateClass);
spCF = List.map(classesCF, AbsynToSCode.translateClass);
assocLst = getGlobalRoot(Global.builtinIndex);
setGlobalRoot(Global.builtinIndex, ((Flags.METAMODELICA, true), (pNF,spNF))::((Flags.METAMODELICA, false), (pCF,spCF))::assocLst);
(p, sp) = if Flags.isSet(Flags.SCODE_INST) then (pNF, spNF) else (pCF, spCF);
then (p,sp);
case ()
equation
true = intEq(Flags.getConfigEnum(Flags.GRAMMAR), Flags.PARMODELICA);
Error.assertionOrAddSourceMessage(System.regularFileExists(fileModelicaNF),Error.FILE_NOT_FOUND_ERROR,{fileModelicaNF},AbsynUtil.dummyInfo);
Error.assertionOrAddSourceMessage(System.regularFileExists(fileModelicaCF),Error.FILE_NOT_FOUND_ERROR,{fileModelicaCF},AbsynUtil.dummyInfo);
Error.assertionOrAddSourceMessage(System.regularFileExists(fileMetaModelica),Error.FILE_NOT_FOUND_ERROR,{fileMetaModelica},AbsynUtil.dummyInfo);
Absyn.PROGRAM(classes=classes1NF,within_=Absyn.TOP()) = Parser.parsebuiltin(fileModelicaNF,"UTF-8","",NONE(),acceptedGram=Flags.METAMODELICA);
Absyn.PROGRAM(classes=classes1CF,within_=Absyn.TOP()) = Parser.parsebuiltin(fileModelicaCF,"UTF-8","",NONE(),acceptedGram=Flags.METAMODELICA);
Absyn.PROGRAM(classes=classes2,within_=Absyn.TOP()) = Parser.parsebuiltin(fileParModelica,"UTF-8","",NONE(),acceptedGram=Flags.METAMODELICA);
classesNF = listAppend(classes1NF,classes2);
classesCF = listAppend(classes1CF,classes2);
pNF = Absyn.PROGRAM(classesNF,Absyn.TOP());
pCF = Absyn.PROGRAM(classesCF,Absyn.TOP());
spNF = List.map(classesNF, AbsynToSCode.translateClass);
spCF = List.map(classesCF, AbsynToSCode.translateClass);
assocLst = getGlobalRoot(Global.builtinIndex);
setGlobalRoot(Global.builtinIndex, ((Flags.PARMODELICA, true), (pNF,spNF))::((Flags.PARMODELICA, false), (pCF,spCF))::assocLst);
(p, sp) = if Flags.isSet(Flags.SCODE_INST) then (pNF, spNF) else (pCF, spCF);
then (p,sp);
case ()
equation
true = intEq(Flags.getConfigEnum(Flags.GRAMMAR), Flags.MODELICA) or intEq(Flags.getConfigEnum(Flags.GRAMMAR), Flags.OPTIMICA);
Error.assertionOrAddSourceMessage(System.regularFileExists(fileModelicaNF),Error.FILE_NOT_FOUND_ERROR,{fileModelicaNF},AbsynUtil.dummyInfo);
Error.assertionOrAddSourceMessage(System.regularFileExists(fileModelicaCF),Error.FILE_NOT_FOUND_ERROR,{fileModelicaCF},AbsynUtil.dummyInfo);
(pNF as Absyn.PROGRAM(classes=classes1NF,within_=Absyn.TOP())) = Parser.parsebuiltin(fileModelicaNF,"UTF-8","",NONE(),acceptedGram=Flags.METAMODELICA);
(pCF as Absyn.PROGRAM(classes=classes1CF,within_=Absyn.TOP())) = Parser.parsebuiltin(fileModelicaCF,"UTF-8","",NONE(),acceptedGram=Flags.METAMODELICA);
spNF = List.map(classes1NF, AbsynToSCode.translateClass);
spCF = List.map(classes1CF, AbsynToSCode.translateClass);
assocLst = getGlobalRoot(Global.builtinIndex);
setGlobalRoot(Global.builtinIndex, ((Flags.MODELICA, true), (pNF,spNF))::((Flags.MODELICA, false), (pCF,spCF))::assocLst);
(p, sp) = if Flags.isSet(Flags.SCODE_INST) then (pNF, spNF) else (pCF, spCF);
then (p,sp);
case ()
equation
true = intEq(Flags.getConfigEnum(Flags.GRAMMAR), Flags.PDEMODELICA);
Error.assertionOrAddSourceMessage(System.regularFileExists(fileModelicaNF),Error.FILE_NOT_FOUND_ERROR,{fileModelicaNF},AbsynUtil.dummyInfo);
Error.assertionOrAddSourceMessage(System.regularFileExists(fileModelicaCF),Error.FILE_NOT_FOUND_ERROR,{fileModelicaCF},AbsynUtil.dummyInfo);
Error.assertionOrAddSourceMessage(System.regularFileExists(filePDEModelica),Error.FILE_NOT_FOUND_ERROR,{filePDEModelica},AbsynUtil.dummyInfo);
Absyn.PROGRAM(classes=classes1NF,within_=Absyn.TOP()) = Parser.parsebuiltin(fileModelicaNF,"UTF-8","",NONE(),acceptedGram=Flags.METAMODELICA);
Absyn.PROGRAM(classes=classes1CF,within_=Absyn.TOP()) = Parser.parsebuiltin(fileModelicaCF,"UTF-8","",NONE(),acceptedGram=Flags.METAMODELICA);
Absyn.PROGRAM(classes=classes2,within_=Absyn.TOP()) = Parser.parsebuiltin(filePDEModelica,"UTF-8","",NONE(),acceptedGram=Flags.METAMODELICA);
classesNF = listAppend(classes1NF,classes2);
classesCF = listAppend(classes1CF,classes2);
pNF = Absyn.PROGRAM(classesNF,Absyn.TOP());
pCF = Absyn.PROGRAM(classesCF,Absyn.TOP());
spNF = List.map(classesNF, AbsynToSCode.translateClass);
spCF = List.map(classesCF, AbsynToSCode.translateClass);
assocLst = getGlobalRoot(Global.builtinIndex);
setGlobalRoot(Global.builtinIndex, ((Flags.PDEMODELICA, true), (pNF,spNF))::((Flags.PDEMODELICA, false), (pCF,spCF))::assocLst);
(p, sp) = if Flags.isSet(Flags.SCODE_INST) then (pNF, spNF) else (pCF, spCF);
then (p,sp);
else
equation
Error.addInternalError("FBuiltin.getInitialFunctions failed.", sourceInfo());
then fail();
end matchcontinue;
end getInitialFunctions;
public function initialGraph
"The initial environment where instantiation takes place is built
up using this function. It creates an empty environment and adds
all the built-in definitions to it.
NOTE:
The following built in operators can not be described in
the type system, since they e.g. have arbitrary arguments, etc.
- fill
- cat
These operators are catched in the elabBuiltinHandler, along with all
others."
input FCore.Cache inCache;
output FCore.Cache outCache;
output FGraph.Graph graph;
protected
FCore.Cache cache;
algorithm
(outCache, graph) := matchcontinue(inCache)
local
list<Absyn.Class> initialClasses;
SCode.Program initialProgram;
list<SCode.Element> types;
// First look for cached version
case (cache) equation
graph = FCore.getCachedInitialGraph(cache);
then (cache,graph);
// then look in the global roots[builtinEnvIndex]
case (cache)
equation
graph = getSetInitialGraph(NONE());
then
(cache, graph);
// if no cached version found create initial graph.
case (cache)
equation
graph = FGraph.new("graph", FCore.dummyTopModel);
graph = FGraphBuild.mkProgramGraph(basicTypes, FCore.BASIC_TYPE(), graph);
graph = initialGraphOptimica(graph, FGraphBuild.mkCompNode);
graph = initialGraphMetaModelica(graph, FGraphBuild.mkTypeNode);
graph = initialGraphModelica(graph, FGraphBuild.mkTypeNode, FGraphBuild.mkCompNode);
(_, initialProgram) = getInitialFunctions();
// add the ModelicaBuiltin/MetaModelicaBuiltin classes in the initial graph
graph = FGraphBuild.mkProgramGraph(initialProgram, FCore.BUILTIN(), graph);
cache = FCore.setCachedInitialGraph(cache,graph);
_ = getSetInitialGraph(SOME(graph));
then
(cache,graph);
end matchcontinue;
end initialGraph;
protected function getSetInitialGraph
"gets/sets the initial environment depending on grammar flags"
input Option<FGraph.Graph> inEnvOpt;
output FGraph.Graph initialEnv;
algorithm
initialEnv := matchcontinue (inEnvOpt)
local
list<tuple<Integer,FGraph.Graph>> assocLst;
FGraph.Graph graph;
// nothing there
case (_)
equation
failure(_ = getGlobalRoot(Global.builtinGraphIndex));
setGlobalRoot(Global.builtinGraphIndex, {});
then
fail();
// return the correct graph depending on flags
case (NONE())
equation
assocLst = getGlobalRoot(Global.builtinGraphIndex);
then
Util.assoc(Flags.getConfigEnum(Flags.GRAMMAR), assocLst);
case (SOME(graph))
equation
true = intEq(Flags.getConfigEnum(Flags.GRAMMAR), Flags.METAMODELICA);
assocLst = getGlobalRoot(Global.builtinGraphIndex);
setGlobalRoot(Global.builtinGraphIndex, (Flags.METAMODELICA,graph)::assocLst);
then
graph;
case (SOME(graph))
equation
true = intEq(Flags.getConfigEnum(Flags.GRAMMAR), Flags.PARMODELICA);
assocLst = getGlobalRoot(Global.builtinGraphIndex);
setGlobalRoot(Global.builtinGraphIndex, (Flags.PARMODELICA,graph)::assocLst);
then
graph;
case (SOME(graph))
equation
true = intEq(Flags.getConfigEnum(Flags.GRAMMAR), Flags.MODELICA) or intEq(Flags.getConfigEnum(Flags.GRAMMAR), Flags.OPTIMICA);
assocLst = getGlobalRoot(Global.builtinGraphIndex);
setGlobalRoot(Global.builtinGraphIndex, (Flags.MODELICA,graph)::assocLst);
then
graph;
end matchcontinue;
end getSetInitialGraph;
public
partial function MakeTypeNode
input list<DAE.Type> inTypes "the types to add";
input FCore.Ref inParentRef;
input FCore.Name inName "name to search for";
input FCore.Graph inGraph;
output FCore.Graph outGraph;
end MakeTypeNode;
partial function MakeCompNode
input SCode.Element inComp;
input FCore.Ref inParentRef;
input FCore.Kind inKind;
input FCore.Graph inGraph;
output FCore.Graph outGraph;
end MakeCompNode;
function initialGraphModelica
input output FGraph.Graph graph;
input MakeTypeNode mkTypeNode;
input MakeCompNode mkCompNode;
protected
constant DAE.Type enumeration2int =
DAE.T_FUNCTION(
{DAE.FUNCARG("x",DAE.T_ENUMERATION(NONE(), Absyn.IDENT(""), {}, {}, {}),DAE.C_VAR(),DAE.NON_PARALLEL(),NONE())},
DAE.T_INTEGER_DEFAULT,
DAE.FUNCTION_ATTRIBUTES_BUILTIN,
Absyn.IDENT("Integer"));
algorithm
graph := mkCompNode(timeComp, FGraph.top(graph), FCore.BUILTIN(), graph);
graph := FGraph.updateComp(graph, timeVar, FCore.VAR_UNTYPED(), FGraph.empty());
graph := mkTypeNode({
DAE.T_FUNCTION(
{DAE.FUNCARG("x", DAE.T_ANYTYPE(SOME(ClassInf.CONNECTOR(Absyn.IDENT("$dummy$"),false))),DAE.C_VAR(),DAE.NON_PARALLEL(),NONE())},
DAE.T_INTEGER_DEFAULT,
DAE.FUNCTION_ATTRIBUTES_BUILTIN,
Absyn.IDENT("cardinality")),
DAE.T_FUNCTION(
{DAE.FUNCARG("x",DAE.T_ANYTYPE(SOME(ClassInf.CONNECTOR(Absyn.IDENT("$dummy$"),true))),DAE.C_VAR(),DAE.NON_PARALLEL(),NONE())},
DAE.T_INTEGER_DEFAULT,
DAE.FUNCTION_ATTRIBUTES_BUILTIN,
Absyn.IDENT("cardinality"))},
FGraph.top(graph),
"cardinality", graph);
graph := mkTypeNode({enumeration2int}, FGraph.top(graph), "Integer", graph);
graph := mkTypeNode({enumeration2int}, FGraph.top(graph), "EnumToInteger", graph);
graph := mkTypeNode({DAE.T_FUNCTION(argsRealX,DAE.T_REAL_DEFAULT,DAE.FUNCTION_ATTRIBUTES_BUILTIN,Absyn.IDENT("noEvent"))},
FGraph.top(graph), "noEvent", graph);
graph := mkTypeNode({DAE.T_FUNCTION(argsRealX,DAE.T_REAL_DEFAULT,DAE.FUNCTION_ATTRIBUTES_BUILTIN,Absyn.IDENT("actualStream"))},
FGraph.top(graph), "actualStream", graph);
graph := mkTypeNode({DAE.T_FUNCTION(argsRealX,DAE.T_REAL_DEFAULT,DAE.FUNCTION_ATTRIBUTES_BUILTIN,Absyn.IDENT("inStream"))},
FGraph.top(graph), "inStream", graph);
graph := mkTypeNode({
DAE.T_FUNCTION(argsRealXYZ,DAE.T_REAL_DEFAULT,DAE.FUNCTION_ATTRIBUTES_BUILTIN,Absyn.IDENT("constrain")),
DAE.T_FUNCTION({
DAE.FUNCARG("x",T_REAL_ARRAY_1_DEFAULT,DAE.C_VAR(),DAE.NON_PARALLEL(),NONE()),
DAE.FUNCARG("y",T_REAL_ARRAY_1_DEFAULT,DAE.C_VAR(),DAE.NON_PARALLEL(),NONE()),
DAE.FUNCARG("z",T_REAL_ARRAY_1_DEFAULT,DAE.C_VAR(),DAE.NON_PARALLEL(),NONE())},
T_REAL_ARRAY_1_DEFAULT,
DAE.FUNCTION_ATTRIBUTES_BUILTIN,
Absyn.IDENT("constrain"))
},
FGraph.top(graph), "constrain", graph);
end initialGraphModelica;
function initialGraphMetaModelica
input output FGraph.Graph graph;
input MakeTypeNode mkTypeNode;
algorithm
if not Config.acceptMetaModelicaGrammar() then
return;
end if;
// getGlobalRoot can not be represented by a regular function...
graph := mkTypeNode({DAE.T_FUNCTION(
{DAE.FUNCARG("index",DAE.T_INTEGER_DEFAULT,DAE.C_VAR(),DAE.NON_PARALLEL(),NONE())},
DAE.T_METABOXED_DEFAULT,
DAE.FUNCTION_ATTRIBUTES_BUILTIN,
Absyn.IDENT("getGlobalRoot"))}, FGraph.top(graph), "getGlobalRoot", graph);
end initialGraphMetaModelica;
function initialGraphOptimica
input output FGraph.Graph graph;
input MakeCompNode mkCompNode;
algorithm
if not Config.acceptOptimicaGrammar() then
return;
end if;
//If Optimica add the startTime,finalTime,objectiveIntegrand and objective "builtin" variables.
graph := mkCompNode(objectiveVarComp, FGraph.top(graph), FCore.BUILTIN(), graph);
graph := FGraph.updateComp(graph, objectiveVar, FCore.VAR_UNTYPED(), FGraph.empty());
graph := mkCompNode(objectiveIntegrandComp, FGraph.top(graph), FCore.BUILTIN(), graph);
graph := FGraph.updateComp(graph, objectiveIntegrandVar, FCore.VAR_UNTYPED(), FGraph.empty());
graph := mkCompNode(startTimeComp, FGraph.top(graph), FCore.BUILTIN(), graph);
graph := FGraph.updateComp(graph, startTimeVar, FCore.VAR_UNTYPED(), FGraph.empty());
graph := mkCompNode(finalTimeComp, FGraph.top(graph), FCore.BUILTIN(), graph);
graph := FGraph.updateComp(graph, finalTimeVar, FCore.VAR_UNTYPED(), FGraph.empty());
end initialGraphOptimica;
function getElementWithPathCheckBuiltin
"returns the element from the program having the name as the id.
if the element does not exist it fails"
input SCode.Program inProgram;
input Absyn.Path inPath;
output SCode.Element outElement;
algorithm
outElement := matchcontinue (inProgram, inPath)
local
SCode.Program sp, rest;
SCode.Element c, e;
Absyn.Path p;
Absyn.Ident i, n;
case (_, _)
then SCodeUtil.getElementWithPath(inProgram, inPath);
else
equation
(_,sp) = FBuiltin.getInitialFunctions();
then SCodeUtil.getElementWithPath(sp, inPath);
end matchcontinue;
end getElementWithPathCheckBuiltin;
annotation(__OpenModelica_Interface="frontend");
end FBuiltin;