This repository has been archived by the owner on May 18, 2019. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 59
/
NFCall.mo
1489 lines (1330 loc) · 46.7 KB
/
NFCall.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
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* 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 NFCall
import Absyn;
import DAE;
import NFInstNode.InstNode;
import Expression = NFExpression;
import Type = NFType;
import NFPrefixes.Variability;
protected
import Binding = NFBinding;
import NFComponent.Component;
import NFInstNode.CachedData;
import ComponentRef = NFComponentRef;
import Dimension = NFDimension;
import NFFunction.Function;
import Inst = NFInst;
import NFInstNode.InstNodeType;
import Lookup = NFLookup;
import Typing = NFTyping;
import TypeCheck = NFTypeCheck;
import Types;
import List;
import NFClass.Class;
import ErrorExt;
import Util;
import Prefixes = NFPrefixes;
import MetaModelica.Dangerous.listReverseInPlace;
import NFTyping.ExpOrigin;
import NFFunction.NamedArg;
import NFFunction.TypedArg;
import NFFunction.TypedNamedArg;
import NFFunction.FunctionMatchKind;
public
uniontype CallAttributes
record CALL_ATTR
Type ty "The type of the return value, if several return values this is undefined";
Boolean tuple_ "tuple" ;
Boolean builtin "builtin Function call" ;
Boolean isImpure "if the function has prefix *impure* is true, else false";
Boolean isFunctionPointerCall;
DAE.InlineType inlineType;
DAE.TailCall tailCall "Input variables of the function if the call is tail-recursive";
end CALL_ATTR;
function toDAE
input CallAttributes attr;
output DAE.CallAttributes fattr;
algorithm
fattr := DAE.CALL_ATTR(Type.toDAE(attr.ty), attr.tuple_, attr.builtin,
attr.isImpure, attr.isFunctionPointerCall, attr.inlineType, attr.tailCall);
end toDAE;
end CallAttributes;
public constant CallAttributes callAttrBuiltinBool = CALL_ATTR(Type.BOOLEAN(),false,true,false,false,DAE.NO_INLINE(),DAE.NO_TAIL());
public constant CallAttributes callAttrBuiltinInteger = CALL_ATTR(Type.INTEGER(),false,true,false,false,DAE.NO_INLINE(),DAE.NO_TAIL());
public constant CallAttributes callAttrBuiltinReal = CALL_ATTR(Type.REAL(),false,true,false,false,DAE.NO_INLINE(),DAE.NO_TAIL());
public constant CallAttributes callAttrBuiltinString = CALL_ATTR(Type.STRING(),false,true,false,false,DAE.NO_INLINE(),DAE.NO_TAIL());
public constant CallAttributes callAttrBuiltinOther = CALL_ATTR(Type.UNKNOWN(),false,true,false,false,DAE.NO_INLINE(),DAE.NO_TAIL());
public constant CallAttributes callAttrBuiltinImpureBool = CALL_ATTR(Type.BOOLEAN(),false,true,true,false,DAE.NO_INLINE(),DAE.NO_TAIL());
public constant CallAttributes callAttrBuiltinImpureInteger = CALL_ATTR(Type.INTEGER(),false,true,true,false,DAE.NO_INLINE(),DAE.NO_TAIL());
public constant CallAttributes callAttrBuiltinImpureReal = CALL_ATTR(Type.REAL(),false,true,true,false,DAE.NO_INLINE(),DAE.NO_TAIL());
public
uniontype Call
record UNTYPED_CALL
ComponentRef ref;
list<Integer> matchingFuncs;
list<Expression> arguments;
list<NamedArg> named_args;
end UNTYPED_CALL;
record ARG_TYPED_CALL
ComponentRef ref;
list<TypedArg> arguments;
list<TypedNamedArg> named_args;
end ARG_TYPED_CALL;
record TYPED_CALL
Function fn;
Type ty;
list<Expression> arguments;
CallAttributes attributes;
end TYPED_CALL;
record UNTYPED_MAP_CALL
ComponentRef ref;
Expression exp;
list<InstNode> iters;
end UNTYPED_MAP_CALL;
record TYPED_MAP_CALL
Function fn;
Type ty;
Expression exp;
list<InstNode> iters;
end TYPED_MAP_CALL;
function instantiate
input Absyn.ComponentRef functionName;
input Absyn.FunctionArgs functionArgs;
input InstNode scope;
input SourceInfo info;
output Expression callExp;
algorithm
callExp := match functionArgs
case Absyn.FUNCTIONARGS() then instNormalCall(functionName, functionArgs, scope, info);
case Absyn.FOR_ITER_FARG() then instIteratorCall(functionName, functionArgs, scope, info);
else
algorithm
Error.assertion(false, getInstanceName() + " got unknown call type", sourceInfo());
then
fail();
end match;
// callExp := Expression.CALL(call);
end instantiate;
protected
function instNormalCall
input Absyn.ComponentRef functionName;
input Absyn.FunctionArgs functionArgs;
input InstNode scope;
input SourceInfo info;
output Expression callExp;
protected
ComponentRef fn_ref;
list<Expression> args;
list<NamedArg> named_args;
Boolean specialBuiltin;
algorithm
(fn_ref, _, specialBuiltin) := Function.instFunc(functionName,scope,info);
(args, named_args) := instArgs(functionArgs, scope, info);
if specialBuiltin then
callExp := match Absyn.crefFirstIdent(functionName)
case "size" then makeSizeCall(args, named_args, info);
else Expression.CALL(UNTYPED_CALL(fn_ref, {}, args, named_args));
end match;
else
callExp := Expression.CALL(UNTYPED_CALL(fn_ref, {}, args, named_args));
end if;
end instNormalCall;
function instArgs
input Absyn.FunctionArgs args;
input InstNode scope;
input SourceInfo info;
output list<Expression> posArgs;
output list<NamedArg> namedArgs;
algorithm
(posArgs, namedArgs) := match args
case Absyn.FUNCTIONARGS()
algorithm
posArgs := list(Inst.instExp(a, scope, info) for a in args.args);
namedArgs := list(instNamedArg(a, scope, info) for a in args.argNames);
then
(posArgs, namedArgs);
else
algorithm
Error.assertion(false, getInstanceName() + " got unknown function args", sourceInfo());
then
fail();
end match;
end instArgs;
function instNamedArg
input Absyn.NamedArg absynArg;
input InstNode scope;
input SourceInfo info;
output NamedArg arg;
protected
String name;
Absyn.Exp exp;
algorithm
Absyn.NAMEDARG(argName = name, argValue = exp) := absynArg;
arg := (name, Inst.instExp(exp, scope, info));
end instNamedArg;
function instIteratorCall
input Absyn.ComponentRef functionName;
input Absyn.FunctionArgs functionArgs;
input InstNode scope;
input SourceInfo info;
output Expression callExp;
protected
ComponentRef fn_ref;
Expression exp;
list<InstNode> iters;
Call call;
Boolean is_builtin, is_array;
algorithm
(is_builtin, is_array) := match Absyn.crefFirstIdent(functionName)
case "$array" then (true, true);
case "min" then (true, false);
case "max" then (true, false);
case "sum" then (true, false);
case "product" then (true, false);
else (false, false);
end match;
(exp, iters) := instIteratorCallArgs(functionArgs, scope, info);
if is_builtin then
// If the call is one of the builtin ones, start by making an array map call.
fn_ref := Function.instFunc(Absyn.CREF_IDENT("array", {}), scope, info);
call := UNTYPED_MAP_CALL(fn_ref, exp, iters);
// If the call is not array itself, wrap the array call in the given
// function (e.g. sum(array(i for i in ...))).
if not is_array then
fn_ref := Function.instFunc(functionName, scope, info);
call := UNTYPED_CALL(fn_ref, {}, {Expression.CALL(call)}, {});
end if;
else
// Otherwise, make a map call from the given function.
fn_ref := Function.instFunc(functionName, scope, info);
call := UNTYPED_MAP_CALL(fn_ref, exp, iters);
end if;
callExp := Expression.CALL(call);
end instIteratorCall;
function instIteratorCallArgs
input Absyn.FunctionArgs args;
input InstNode scope;
input SourceInfo info;
output Expression exp;
output list<InstNode> iters;
algorithm
_ := match args
local
InstNode for_scope;
case Absyn.FOR_ITER_FARG()
algorithm
(for_scope, iters) := instIterators(args.iterators, scope, info);
exp := Inst.instExp(args.exp, for_scope, info);
then
();
end match;
end instIteratorCallArgs;
function instIterators
input list<Absyn.ForIterator> inIters;
input InstNode scope;
input SourceInfo info;
output InstNode iter_scope;
output list<InstNode> outIters;
protected
Binding binding;
InstNode iter;
algorithm
outIters := {};
iter_scope := scope;
for Absiter in inIters loop
binding := Binding.fromAbsyn(Absiter.range, SCode.NOT_EACH(), 0, iter_scope, info);
binding := Inst.instBinding(binding);
(iter_scope, iter) := Inst.addIteratorToScope(Absiter.name, binding, info, iter_scope);
outIters := iter::outIters;
end for;
outIters := listReverse(outIters);
end instIterators;
function builtinSpecialHandling
input Call call;
output Boolean special;
algorithm
() := match call
local
InstNode fn_node;
case UNTYPED_CALL(ComponentRef.CREF(node = fn_node)) algorithm
CachedData.FUNCTION(_, _, special) := InstNode.getFuncCache(fn_node);
then ();
case UNTYPED_MAP_CALL(ComponentRef.CREF(node = fn_node)) algorithm
CachedData.FUNCTION(_, _, special) := InstNode.getFuncCache(fn_node);
then ();
end match;
end builtinSpecialHandling;
function typeSpecialBuiltinFunction
input output Call call;
input Integer origin;
input SourceInfo info;
output Type ty;
output Variability variability;
protected
ComponentRef cref;
InstNode fn_node;
Expression first;
list<Expression> rest;
String name;
algorithm
UNTYPED_CALL(ref = cref) := call;
(call, ty, variability) := match ComponentRef.firstName(cref)
case "cardinality" then typeCardinalityCall(call, origin, info);
case "change" then typeChangeCall(call, origin, info);
case "edge" then typeEdgeCall(call, origin, info);
case "fill" then typeFillCall(call, origin, info);
case "initial" then typeDiscreteCall(call, origin, info);
case "matrix" then typeMatrixCall(call, origin, info);
case "max" then typeMinMaxCall(call, origin, info);
case "min" then typeMinMaxCall(call, origin, info);
case "ndims" then typeNdimsCall(call, origin, info);
case "noEvent" then typeNoEventCall(call, origin, info);
case "ones" then typeZerosOnesCall(call, origin, info);
case "pre" then typePreCall(call, origin, info);
case "product" then typeSumProductCall(call, origin, info);
case "scalar" then typeScalarCall(call, origin, info);
case "smooth" then typeSmoothCall(call, origin, info);
case "sum" then typeSumProductCall(call, origin, info);
case "symmetric" then typeSymmetricCall(call, origin, info);
case "terminal" then typeDiscreteCall(call, origin, info);
case "transpose" then typeTransposeCall(call, origin, info);
case "vector" then typeVectorCall(call, origin, info);
case "zeros" then typeZerosOnesCall(call, origin, info);
else
algorithm
Error.assertion(false, getInstanceName() + " got unhandled builtin function", sourceInfo());
then
fail();
end match;
end typeSpecialBuiltinFunction;
public
function typeCall
input output Expression callExp;
input Integer origin;
input SourceInfo info;
output Type ty;
output Variability variability;
protected
Call call;
algorithm
() := match callExp
case Expression.CALL(UNTYPED_CALL()) algorithm
if(builtinSpecialHandling(callExp.call)) then
(call, ty, variability) := typeSpecialBuiltinFunction(callExp.call, origin, info);
else
(call, ty, variability) := typeMatchNormalCall(callExp.call, origin, info);
end if;
then ();
case Expression.CALL(UNTYPED_MAP_CALL()) algorithm
if(builtinSpecialHandling(callExp.call)) then
(call, ty, variability) := typeSpecialBuiltinFunction(callExp.call, origin, info);
else
(call, ty, variability) := typeMapIteratorCall(callExp.call, origin, info);
end if;
then ();
end match;
callExp := Expression.CALL(call);
end typeCall;
function typeMapIteratorCall
input output Call call;
input Integer origin;
input SourceInfo info;
output Type ty;
output Variability variability;
protected
InstNode fn_node;
list<Function> fnl;
Function fn;
Expression arg;
Type arg_ty;
Binding binding;
Variability arg_var;
algorithm
(call, ty, variability) := match call
case UNTYPED_MAP_CALL(ref = ComponentRef.CREF(node = fn_node)) algorithm
// Fetch the cached function(s).
fnl := typeCachedFunctions(call.ref);
Error.assertion(listLength(fnl) == 1, getInstanceName() + " overloaded functions in mapping functions not handled yet.", sourceInfo());
fn := listHead(fnl);
for iter in call.iters loop
Typing.typeIterator(iter, info, ExpOrigin.FUNCTION, structural = false);
end for;
(arg, arg_ty, arg_var) := Typing.typeExp(call.exp, origin, info);
ty := arg_ty;
variability := Variability.CONSTANT;
for iter in call.iters loop
binding := Component.getBinding(InstNode.component(iter));
ty := Type.liftArrayLeftList(ty,Type.arrayDims(Binding.getType(binding)));
variability := Variability.variabilityMax(variability,Binding.variability(binding));
end for;
then
(TYPED_MAP_CALL(fn, ty, arg, call.iters), ty, variability);
else algorithm
Error.assertion(false, getInstanceName() + " got invalid function call expression", sourceInfo());
then
fail();
end match;
end typeMapIteratorCall;
function typeMatchNormalCall
input output Call call;
input Integer origin;
input SourceInfo info;
output Type ty;
output Variability variability;
protected
Call argtycall;
algorithm
argtycall := typeNormalCall(call, origin, info);
(call, ty, variability) := matchTypedNormalCall(argtycall, info);
end typeMatchNormalCall;
function typeNormalCall
input output Call call;
input Integer origin;
input SourceInfo info;
algorithm
call := match call
case UNTYPED_CALL() algorithm
typeCachedFunctions(call.ref);
then
typeArgs(call, origin, info);
else algorithm
Error.assertion(false, getInstanceName() + " got invalid function call expression", sourceInfo());
then
fail();
end match;
end typeNormalCall;
function typeCachedFunctions
"Returns the function(s) referenced by the given cref, and types them if
they are not already typed."
input ComponentRef functionRef;
output list<Function> functions;
protected
InstNode fn_node;
Boolean typed, special;
algorithm
functions := match functionRef
case ComponentRef.CREF(node = fn_node)
algorithm
CachedData.FUNCTION(functions, typed, special) := InstNode.getFuncCache(fn_node);
// Type the function(s) if not already done.
if not typed then
functions := list(Function.typeFunction(f) for f in functions);
InstNode.setFuncCache(fn_node, CachedData.FUNCTION(functions, true, special));
functions := list(Function.typeFunctionBody(f) for f in functions);
InstNode.setFuncCache(fn_node, CachedData.FUNCTION(functions, true, special));
end if;
then
functions;
else
algorithm
Error.assertion(false, getInstanceName() + " got invalid function call reference", sourceInfo());
then
fail();
end match;
end typeCachedFunctions;
function matchTypedNormalCall
input output Call argtycall;
input SourceInfo info;
output Type ty;
output Variability variability;
protected
Function fn;
list<Expression> args;
list<Type> arg_ty;
list<Variability> arg_var;
CallAttributes ca;
list<TypedArg> tyArgs;
algorithm
(argtycall , ty, variability) := match argtycall
case ARG_TYPED_CALL() algorithm
// Match the arguments with the expected ones.
(fn,tyArgs) := matchFunctions(argtycall,info);
args := list(Util.tuple31(a) for a in tyArgs);
variability := Variability.CONSTANT;
for a in tyArgs loop
variability := Prefixes.variabilityMax(variability, Util.tuple33(a));
end for;
// Construct the call expression.
ty := Function.returnType(fn);
ca := CallAttributes.CALL_ATTR(
ty, Type.isTuple(ty), Function.isBuiltin(fn)
, Function.isImpure(fn), Function.isFunctionPointer(fn)
, Function.inlineBuiltin(fn), DAE.NO_TAIL()
);
then
(TYPED_CALL(fn, ty, args, ca), ty, variability);
else algorithm
Error.assertion(false, getInstanceName() + " got invalid function call expression", sourceInfo());
then
fail();
end match;
end matchTypedNormalCall;
function typeArgs
input output Call call;
input Integer origin;
input SourceInfo info;
algorithm
call := match call
local
Expression arg;
Type arg_ty;
Variability arg_var;
list<TypedArg> typedArgs;
list<TypedNamedArg> typedNamedArgs;
String name;
case UNTYPED_CALL()
algorithm
typedArgs := {};
for arg in call.arguments loop
(arg, arg_ty, arg_var) := Typing.typeExp(arg, origin, info);
typedArgs := (arg, arg_ty, arg_var) :: typedArgs;
end for;
typedArgs := listReverse(typedArgs);
typedNamedArgs := {};
for narg in call.named_args loop
(name,arg) := narg;
(arg, arg_ty, arg_var) := Typing.typeExp(arg, origin, info);
typedNamedArgs := (name, arg, arg_ty, arg_var) :: typedNamedArgs;
end for;
typedNamedArgs := listReverse(typedNamedArgs);
then
ARG_TYPED_CALL(call.ref, typedArgs, typedNamedArgs);
end match;
end typeArgs;
function matchFunctions
input Call call;
input SourceInfo info;
output Function outFunc;
output list<TypedArg> args;
protected
list<FunctionMatchKind.MatchedFunction> matchedFunctions, exactMatches;
Boolean typematched, has_cast;
list<Function> allfuncs, matchingFuncs;
InstNode fn_node;
FunctionMatchKind matchKind;
Absyn.Path ov_name;
algorithm
ErrorExt.setCheckpoint("NFCall:matchFunctions");
matchingFuncs := {};
matchedFunctions := {};
_ := match call
case ARG_TYPED_CALL(ref = ComponentRef.CREF(node = fn_node)) algorithm
ov_name := ComponentRef.toPath(call.ref);
allfuncs := Function.getCachedFuncs(fn_node);
for fn in allfuncs loop
(args, typematched, matchKind) := matchFunction(fn, call.arguments, call.named_args, info);
if typematched then
matchedFunctions := (fn,args,matchKind)::matchedFunctions;
matchingFuncs := fn::matchingFuncs;
end if;
end for;
then
();
end match;
if listEmpty(matchedFunctions) then
// TODO: Remove "in component" from error message.
Error.addSourceMessage(Error.NO_MATCHING_FUNCTION_FOUND,
{toString(call), "<REMOVE ME>", ":\n " + candidateFuncListString(allfuncs,SOME(ov_name))}, info);
ErrorExt.delCheckpoint("NFCall:matchFunctions");
fail();
end if;
ErrorExt.rollBack("NFCall:matchFunctions");
if listLength(matchedFunctions) == 1 then
(outFunc,args,_) ::_ := matchedFunctions;
// Overwrite the actuall function name with the overload name
// for builtin functions.
// We shouldn't do that for non-builtin functions because we need unique names
// when collected in to the function cache (and then code generation...)
// builtin functions are not collected so that is okay.
// It might be a better idea to never overwrite names and print the actual name like
// OpenModelica.Internal.intAbs() instead of abs()
if Function.isBuiltin(outFunc) then
outFunc.path := ov_name;
end if;
return;
end if;
if listLength(matchedFunctions) > 1 then
exactMatches := FunctionMatchKind.getExactMatches(matchedFunctions);
if listLength(exactMatches) == 1 then
(outFunc,args,_) ::_ := exactMatches;
// Overwrite the actuall function name with the overload name
// for builtin functions.
// We shouldn't do that for non-builtin functions because we need unique names
// when collected in to the function cache (and then code generation...)
// builtin functions are not collected so that is okay.
// It might be a better idea to never overwrite names and print the actual name like
// OpenModelica.Internal.intAbs() instead of abs()
if Function.isBuiltin(outFunc) then
outFunc.path := ov_name;
end if;
return;
else
// TODO: FIX ME: Add proper error message.
print("Ambiguous call: " + toString(call) + "\nCandidates:\n ");
print(candidateFuncListString(matchingFuncs,SOME(ov_name)));
print("\n");
fail();
end if;
end if;
end matchFunctions;
function typeOf
input Call call;
output Type ty;
algorithm
ty := match call
case TYPED_CALL() then call.ty;
case TYPED_MAP_CALL() then call.ty;
else Type.UNKNOWN();
end match;
end typeOf;
function setType
input output Call call;
input Type ty;
algorithm
call := match call
case TYPED_CALL() algorithm call.ty := ty; then call;
case TYPED_MAP_CALL() algorithm call.ty := ty; then call;
end match;
end setType;
protected
function matchFunction
input Function func;
input list<TypedArg> args;
input list<TypedNamedArg> named_args;
input SourceInfo info;
output list<TypedArg> out_args;
output Boolean matched;
output FunctionMatchKind matchKind;
algorithm
(out_args, matched) := Function.fillArgs(args, named_args, func, info);
if matched then
(out_args, matched, matchKind) := Function.matchArgs(func, out_args, info);
end if;
end matchFunction;
public
function arguments
input Call call;
output list<Expression> arguments;
algorithm
arguments := match call
case UNTYPED_CALL() then call.arguments;
case TYPED_CALL() then call.arguments;
end match;
end arguments;
function compare
input Call call1;
input Call call2;
output Integer comp;
algorithm
comp := match (call1, call2)
case (UNTYPED_CALL(), UNTYPED_CALL())
then ComponentRef.compare(call1.ref, call2.ref);
case (TYPED_CALL(), TYPED_CALL())
then Absyn.pathCompare(Function.name(call1.fn), Function.name(call2.fn));
case (UNTYPED_CALL(), TYPED_CALL())
then Absyn.pathCompare(ComponentRef.toPath(call1.ref), Function.name(call2.fn));
case (TYPED_CALL(), UNTYPED_CALL())
then Absyn.pathCompare(Function.name(call1.fn), ComponentRef.toPath(call2.ref));
end match;
if comp == 0 then
comp := Expression.compareList(arguments(call1), arguments(call2));
end if;
end compare;
function toDAE
input Call call;
output DAE.Exp daeCall;
algorithm
daeCall := match call
case TYPED_CALL()
then DAE.CALL(Function.nameConsiderBuiltin(call.fn),
list(Expression.toDAE(e) for e in call.arguments),
CallAttributes.toDAE(call.attributes));
case TYPED_MAP_CALL()
then DAE.REDUCTION(
DAE.REDUCTIONINFO(Function.name(call.fn), Absyn.COMBINE(), Type.toDAE(call.ty), NONE(), "TMP", "TMP", NONE()),
Expression.toDAE(call.exp),
list(iteratorToDAE(iter) for iter in call.iters));
else
algorithm
Error.assertion(false, getInstanceName() + " got untyped call", sourceInfo());
then
fail();
end match;
end toDAE;
function iteratorToDAE
input InstNode iter;
output DAE.ReductionIterator diter;
protected
Component c;
Binding b;
algorithm
c := InstNode.component(iter);
diter := match c
case Component.ITERATOR() algorithm
b := Component.getBinding(c);
then
DAE.REDUCTIONITER(InstNode.name(iter), Expression.toDAE(Binding.getTypedExp(b)), NONE(), Type.toDAE(Binding.getType(b)));
end match;
end iteratorToDAE;
function toString
input Call call;
output String str;
protected
String name, arg_str,c;
Expression argexp;
algorithm
str := match call
case UNTYPED_CALL()
algorithm
name := ComponentRef.toString(call.ref);
arg_str := stringDelimitList(list(Expression.toString(arg) for arg in call.arguments), ", ");
then
name + "(" + arg_str + ")";
case ARG_TYPED_CALL()
algorithm
name := ComponentRef.toString(call.ref);
arg_str := stringDelimitList(list(Expression.toString(Util.tuple31(arg)) for arg in call.arguments), ", ");
for arg in call.named_args loop
c := if arg_str == "" then "" else ", ";
arg_str := arg_str + c + Util.tuple41(arg) + " = " + Expression.toString(Util.tuple42(arg));
end for;
then
name + "(" + arg_str + ")";
case UNTYPED_MAP_CALL()
algorithm
name := ComponentRef.toString(call.ref);
arg_str := Expression.toString(call.exp);
then
name + "(" + arg_str + ")";
case TYPED_CALL()
algorithm
name := Absyn.pathString(Function.name(call.fn));
arg_str := stringDelimitList(list(Expression.toString(arg) for arg in call.arguments), ", ");
then
name + "(" + arg_str + ")";
case TYPED_MAP_CALL()
algorithm
name := Absyn.pathString(Function.name(call.fn));
arg_str := Expression.toString(call.exp);
then
name + "(" + arg_str + ")";
end match;
end toString;
function typedFunction
input Call call;
output Function fn;
algorithm
fn := match call
case TYPED_CALL() then call.fn;
case TYPED_MAP_CALL() then call.fn;
else
algorithm
Error.assertion(false, getInstanceName() + " got untyped function", sourceInfo());
then
fail();
end match;
end typedFunction;
function makeSizeCall
input list<Expression> posArgs;
input list<NamedArg> namedArgs;
input SourceInfo info;
output Expression callExp;
protected
Integer argc = listLength(posArgs);
Expression arg1, arg2;
algorithm
if not listEmpty(namedArgs) then
for arg in namedArgs loop
Error.addSourceMessage(Error.NO_SUCH_PARAMETER,
{"size", Util.tuple21(arg)}, info);
end for;
fail();
end if;
callExp := match posArgs
case {arg1} then Expression.SIZE(arg1, NONE());
case {arg1, arg2} then Expression.SIZE(arg1, SOME(arg2));
else
algorithm
Error.addSourceMessage(Error.NO_MATCHING_FUNCTION_FOUND,
{"size", "", ":\n size(array) => Integer[:]\n size(array, Integer) => Integer"}, info);
then
fail();
end match;
end makeSizeCall;
function makeBuiltinCall
"Creates a call to a builtin function, given a Function and a list of
argument expressions."
input Function func;
input list<Expression> args;
output Call call;
algorithm
call := TYPED_CALL(func, func.returnType, args,
CallAttributes.CALL_ATTR(func.returnType, false, true, false, false,
DAE.NO_INLINE(), DAE.NO_TAIL()));
end makeBuiltinCall;
protected
function makeBuiltinCall2
"Creates a call to a builtin function, given a Function, list of
argument expressions and a return type. Used for builtin functions defined with no return type."
input Function func;
input list<Expression> args;
input Type returnType; // you can use func.returnType if the buiting function is defined with the corrrect type.
output Call call;
algorithm
call := TYPED_CALL(func, returnType, args,
CallAttributes.CALL_ATTR(returnType, false, true, false, false,
DAE.NO_INLINE(), DAE.NO_TAIL()));
end makeBuiltinCall2;
function typeDiscreteCall
"Types a function call that can be typed normally, but which always has
discrete variability regardless of the variability of the arguments."
input output Call call;
input Integer origin;
input SourceInfo info;
output Type ty;
output Variability variability = Variability.DISCRETE;
protected
Call argtycall;
Function fn;
list<TypedArg> args;
TypedArg start,interval;
algorithm
argtycall := typeNormalCall(call, origin, info);
(call, ty) := matchTypedNormalCall(argtycall, info);
call := unboxArgs(call);
end typeDiscreteCall;
function typeNdimsCall
input output Call call;
input Integer origin;
input SourceInfo info;
output Type ty;
output Variability variability = Variability.PARAMETER;
protected
Call argtycall;
Expression arg;
Type argty;
list<Dimension> dims;
Dimension dim1,dim2;
algorithm
argtycall := typeNormalCall(call, origin, info);
(call, ty) := matchTypedNormalCall(argtycall, info);
call := unboxArgs(call);
end typeNdimsCall;
function typePreCall
input output Call call;
input Integer origin;
input SourceInfo info;
output Type ty;
output Variability variability = Variability.DISCRETE;
protected
Call argtycall;
Function fn;
list<TypedArg> args;
TypedArg arg;
InstNode fn_node;
CallAttributes ca;
algorithm
// pre may not be used in a function context.
if intBitAnd(origin, ExpOrigin.FUNCTION) > 0 then
Error.addSourceMessage(Error.EXP_INVALID_IN_FUNCTION, {"pre"}, info);
end if;
argtycall as ARG_TYPED_CALL(ComponentRef.CREF(node = fn_node), args, _) := typeNormalCall(call, origin, info);
(call, _) := matchTypedNormalCall(argtycall, info);
call := unboxArgs(call);
{arg} := args;
if not Expression.isCref(Util.tuple31(arg)) then
Error.addSourceMessage(Error.ARGUMENT_MUST_BE_VARIABLE,
{"First", "pre", "<REMOVE ME>"}, info);
fail();
end if;
ty := Util.tuple32(arg);
end typePreCall;
function typeChangeCall
input output Call call;
input Integer origin;
input SourceInfo info;
output Type ty;
output Variability variability = Variability.DISCRETE;
protected
Call argtycall;
Function fn;
list<TypedArg> args;
TypedArg arg;
InstNode fn_node;
CallAttributes ca;
algorithm
// change may not be used in a function context.
if intBitAnd(origin, ExpOrigin.FUNCTION) > 0 then
Error.addSourceMessage(Error.EXP_INVALID_IN_FUNCTION, {"change"}, info);
end if;
argtycall as ARG_TYPED_CALL(ComponentRef.CREF(node = fn_node), args, _) := typeNormalCall(call, origin, info);
(call, ty) := matchTypedNormalCall(argtycall, info);
call := unboxArgs(call);
{arg} := args;
if not Expression.isCref(Util.tuple31(arg)) then
Error.addSourceMessage(Error.ARGUMENT_MUST_BE_VARIABLE,
{"First", "change", "<REMOVE ME>"}, info);