/
meta_modelica_builtin.cpp
751 lines (649 loc) · 15.4 KB
/
meta_modelica_builtin.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
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
/*
* This file is part of OpenModelica.
*
* Copyright (c) 1998-2010, Linköpings University,
* Department of Computer and Information Science,
* SE-58183 Linköping, Sweden.
*
* All rights reserved.
*
* THIS PROGRAM IS PROVIDED UNDER THE TERMS OF THIS OSMC PUBLIC
* LICENSE (OSMC-PL). ANY USE, REPRODUCTION OR DISTRIBUTION OF
* THIS PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THE OSMC
* PUBLIC LICENSE.
*
* The OpenModelica software and the Open Source Modelica
* Consortium (OSMC) Public License (OSMC-PL) are obtained
* from Linköpings University, either from the above address,
* from the URL: http://www.ida.liu.se/projects/OpenModelica
* and in the OpenModelica distribution.
*
* 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.
*
*/
#include "meta_modelica_builtin.h"
#include <limits.h>
#include <time.h>
#include <math.h>
#include <string.h>
#include <stdio.h>
#if defined(_MSC_VER)
#include <float.h>
#define isinf(d) (!_finite(d) && !_isnan(d))
#define isnan _isnan
#define snprintf _snprintf
#endif
extern "C" {
/* Boolean Operations */
boolAnd_rettype boolAnd(modelica_boolean b1, modelica_boolean b2)
{
return ((b1 != 0) && b2 != 0 ? 1 : 0);
}
boolOr_rettype boolOr(modelica_boolean b1, modelica_boolean b2)
{
return ((b1 != 0) || b2 != 0 ? 1 : 0);
}
boolNot_rettype boolNot(modelica_boolean b)
{
return (b == 0 ? 1 : 0);
}
/* Integer Operations */
intAdd_rettype intAdd(modelica_integer i1, modelica_integer i2)
{
return i1+i2;
}
intSub_rettype intSub(modelica_integer i1, modelica_integer i2)
{
return i1-i2;
}
intMul_rettype intMul(modelica_integer i1, modelica_integer i2)
{
return i1*i2;
}
intDiv_rettype intDiv(modelica_integer i1, modelica_integer i2)
{
return i1/i2;
}
intMod_rettype intMod(modelica_integer i1, modelica_integer i2)
{
return i1%i2;
}
intMax_rettype intMax(modelica_integer i1, modelica_integer i2)
{
return i1 > i2 ? i1 : i2;
}
intMin_rettype intMin(modelica_integer i1, modelica_integer i2)
{
return i1 < i2 ? i1 : i2;
}
modelica_metatype boxptr_intAdd(modelica_metatype i1, modelica_metatype i2)
{
return (void*) ((long)i1+(long)i2);
}
modelica_metatype boxptr_intSub(modelica_metatype i1, modelica_metatype i2)
{
return (void*) ((long)i1-(long)i2);
}
modelica_metatype boxptr_intMul(modelica_metatype i1, modelica_metatype i2)
{
// Unbox first to avoid overflow
return mmc_mk_icon(mmc__unbox__integer(i1)*mmc__unbox__integer(i2));
}
modelica_metatype boxptr_intDiv(modelica_metatype i1, modelica_metatype i2)
{
return mmc_mk_icon((long)i1/(long)i2);
}
modelica_metatype boxptr_intMod(modelica_metatype i1, modelica_metatype i2)
{
return (void*) ((long)i1%(long)i2);
}
modelica_metatype boxptr_intMax(modelica_metatype i1, modelica_metatype i2)
{
return i1 > i2 ? i1 : i2;
}
modelica_metatype boxptr_intMin(modelica_metatype i1, modelica_metatype i2)
{
return i1 < i2 ? i1 : i2;
}
intLt_rettype intLt(modelica_integer i1, modelica_integer i2)
{
return i1 < i2;
}
intLe_rettype intLe(modelica_integer i1, modelica_integer i2)
{
return i1 <= i2;
}
intEq_rettype intEq(modelica_integer i1, modelica_integer i2)
{
return i1 == i2;
}
intNe_rettype intNe(modelica_integer i1, modelica_integer i2)
{
return i1 != i2;
}
intGe_rettype intGe(modelica_integer i1, modelica_integer i2)
{
return i1 >= i2;
}
intGt_rettype intGt(modelica_integer i1, modelica_integer i2)
{
return i1 > i2;
}
intAbs_rettype intAbs(modelica_integer i)
{
return abs(i);
}
intNeg_rettype intNeg(modelica_integer i)
{
return -i;
}
intReal_rettype intReal(modelica_integer i)
{
return (modelica_real) i;
}
intString_rettype intString(modelica_integer i)
{
/* 32-bit integer: 1+log_10(2**31)+1 = 12 digits max */
static char buffer[12];
modelica_string_t res;
sprintf(buffer, "%d", i);
init_modelica_string(&res, buffer);
return res;
}
modelica_metatype boxptr_intAbs(modelica_metatype i)
{
return mmc_mk_icon(abs(mmc__unbox__integer(i)));
}
modelica_metatype boxptr_intNeg(modelica_metatype i)
{
return mmc_mk_icon(-(mmc__unbox__integer(i)));
}
modelica_metatype boxptr_intReal(modelica_metatype i)
{
return mmc_mk_rcon(-(mmc__unbox__integer(i)));
}
modelica_metatype boxptr_intString(modelica_metatype i)
{
return mmc_mk_scon(intString(mmc__unbox__integer(i)));
}
/* Real Operations */
realAdd_rettype realAdd(modelica_real r1, modelica_real r2)
{
return r1+r2;
}
realSub_rettype realSub(modelica_real r1, modelica_real r2)
{
return r1-r2;
}
realMul_rettype realMul(modelica_real r1, modelica_real r2)
{
return r1*r2;
}
realDiv_rettype realDiv(modelica_real r1, modelica_real r2)
{
return r1/r2;
}
realMod_rettype realMod(modelica_real r1, modelica_real r2)
{
return fmod(r1,r2);
}
realPow_rettype realPow(modelica_real r1, modelica_real r2)
{
return pow(r1,r2);
}
realMax_rettype realMax(modelica_real r1, modelica_real r2)
{
return r1 > r2 ? r1 : r2;
}
realMin_rettype realMin(modelica_real r1, modelica_real r2)
{
return r1 < r2 ? r1 : r2;
}
realAbs_rettype realAbs(modelica_real r)
{
return fabs(r);
}
realNeg_rettype realNeg(modelica_real r)
{
return -r;
}
realCos_rettype realCos(modelica_real r)
{
return cos(r);
}
realSin_rettype realSin(modelica_real r)
{
return sin(r);
}
realAtan_rettype realAtan(modelica_real r)
{
return atan(r);
}
realExp_rettype realExp(modelica_real r)
{
return exp(r);
}
realLn_rettype realLn(modelica_real r)
{
return log(r);
}
realFloor_rettype realFloor(modelica_real r)
{
return floor(r);
}
realSqrt_rettype realSqrt(modelica_real r)
{
return sqrt(r);
}
realLt_rettype realLt(modelica_real r1, modelica_real r2)
{
return r1 < r2;
}
realLe_rettype realLe(modelica_real r1, modelica_real r2)
{
return r1 <= r2;
}
realEq_rettype realEq(modelica_real r1, modelica_real r2)
{
return r1 == r2;
}
realNe_rettype realNe(modelica_real r1, modelica_real r2)
{
return r1 != r2;
}
realGe_rettype realGe(modelica_real r1, modelica_real r2)
{
return r1 >= r2;
}
realGt_rettype realGt(modelica_real r1, modelica_real r2)
{
return r1 > r2;
}
realInt_rettype realInt(modelica_real r)
{
return (modelica_integer) r;
}
realString_rettype realString(modelica_real r)
{
/* 64-bit (1+11+52) double: -d.[15 digits]E-[4 digits] = ~24 digits max.
* Add safety margin. */
static char buffer[32];
modelica_string_t res;
if (isinf(r) && r < 0)
init_modelica_string(&res, "-inf");
else if (isinf(r))
init_modelica_string(&res, "inf");
else if (isnan(r))
init_modelica_string(&res, "NaN");
else if (snprintf(buffer, 32, "%.16g", r) <= 0)
throw 1;
else
init_modelica_string(&res, buffer);
return res;
}
/* String Character Conversion */
stringCharInt_rettype stringCharInt(modelica_string_t chr)
{
if (chr[0] == '\0' || chr[1] != '\0')
throw 1;
return (int) chr[0];
}
intStringChar_rettype intStringChar(modelica_integer ix)
{
modelica_string_t res;
if (ix < 1 || ix > 255)
throw 1;
alloc_modelica_string(&res, 1);
res[0] = (char) ix;
res[1] = '\0';
return res;
}
/* String Operations */
stringInt_rettype stringInt(modelica_string_t str)
{
long res;
char* endptr;
errno = 0;
res = strtol(str,&endptr,10);
if (errno != 0 || str == endptr)
throw 1;
if (*endptr != '\0')
throw 1;
if (res > INT_MAX || res < INT_MIN)
throw 1;
return res;
}
stringListStringChar_rettype stringListStringChar(modelica_string_t str)
{
char chr[2] = {'\0', '\0'};
modelica_metatype revRes;
revRes = mmc_mk_nil();
while (*str != '\0') {
chr[0] = *str++;
revRes = mmc_mk_cons(mmc_mk_scon(chr), revRes);
}
return listReverse(revRes);
}
listStringCharString_rettype listStringCharString(modelica_metatype lst)
{
int lstLen, i;
modelica_string_t res;
void* car;
lstLen = listLength(lst);
alloc_modelica_string(&res, lstLen+1);
for (i=0; i<lstLen /* MMC_NILTEST not required */ ; i++, lst = MMC_CDR(lst)) {
car = MMC_CAR(lst);
if (1 != MMC_HDRSTRLEN(MMC_GETHDR(car))) {
free_modelica_string(&res);
throw 1;
}
res[i] = MMC_STRINGDATA(car)[0];
}
res[lstLen] = '\0';
return res;
}
stringAppendList_rettype stringAppendList(modelica_metatype lst)
{
int lstLen, i, acc, len;
modelica_string_t res, res_head, tmp;
modelica_metatype car, lstHead;
lstLen = listLength(lst);
acc = 0;
lstHead = lst;
for (i=0; i<lstLen /* MMC_NILTEST not required */ ; i++, lst = MMC_CDR(lst)) {
tmp = MMC_STRINGDATA(MMC_CAR(lst));
acc += strlen(tmp);
}
res = (char*) malloc(acc+1);
res_head = res;
lst = lstHead;
for (i=0; i<lstLen /* MMC_NILTEST not required */ ; i++, lst = MMC_CDR(lst)) {
car = MMC_CAR(lst);
tmp = MMC_STRINGDATA(car);
len = strlen(tmp);
memcpy(res,tmp,len);
res += len;
}
*res = '\0';
return res_head;
}
stringAppend_rettype stringAppend(modelica_string_const s1, modelica_string_const s2)
{
int len1 = strlen(s1);
int len2 = strlen(s2);
char* str = (char*) malloc(len1+len2+1);
memcpy(str, s1, len1);
memcpy(str + len1, s2, len2 + 1);
str[len1+len2] = '\0';
return str;
}
modelica_metatype boxptr_stringAppend(modelica_metatype str1, modelica_metatype str2)
{
const char* s1 = MMC_STRINGDATA(str1);
const char* s2 = MMC_STRINGDATA(str2);
char* str = stringAppend(s1,s2);
modelica_metatype res = mmc_mk_scon(str);
free(str);
return res;
}
stringLength_rettype stringLength(modelica_string_const str)
{
return strlen(str);
}
stringCompare_rettype stringCompare(modelica_string_t str1, modelica_string_t str2)
{
stringCompare_rettype res = strcmp(str1,str2);
if (res < 0)
return -1;
if (res > 0)
return 1;
return 0;
}
stringEqual_rettype stringEqual(modelica_string_t str1, modelica_string_t str2)
{
return 0 == strcmp(str1,str2) ? 1 : 0;
}
stringGetStringChar_rettype stringGetStringChar(modelica_string_t str, modelica_integer ix)
{
modelica_string_t res;
char chr[2] = {'\0','\0'};
if (*str == 0)
throw 1;
while (ix > 1) {
if (*(++str) == 0)
throw 1;
ix--;
}
chr[0] = *str;
init_modelica_string(&res, chr);
return res;
}
stringUpdateStringChar_rettype stringUpdateStringChar(modelica_string_t str, modelica_string_t c, modelica_integer ix)
{
modelica_string_t res;
int length;
if (ix < 1 || c[0] == '\0' || c[1] != '\0')
throw 1;
length = strlen(str);
if (ix > length)
throw 1;
copy_modelica_string(str, &res);
res[ix-1] = c[0];
return res;
}
/* List Operations */
listReverse_rettype listReverse(modelica_metatype lst)
{
modelica_metatype res;
res = mmc_mk_nil();
while (!MMC_NILTEST(lst))
{
res = mmc_mk_cons(MMC_CAR(lst),res);
lst = MMC_CDR(lst);
}
return res;
}
listAppend_rettype listAppend(modelica_metatype lst1,modelica_metatype lst2)
{
if (MMC_NILTEST(lst2)) /* Don't reverse lst1 if lst2 is empty... */
return lst1;
lst1 = listReverse(lst1);
while (!MMC_NILTEST(lst1))
{
lst2 = mmc_mk_cons(MMC_CAR(lst1),lst2);
lst1 = MMC_CDR(lst1);
}
return lst2;
}
listLength_rettype listLength(modelica_metatype lst)
{
modelica_integer res = 0;
while (!MMC_NILTEST(lst))
{
lst = MMC_CDR(lst);
res++;
}
return res;
}
listMember_rettype listMember(modelica_metatype lst, modelica_metatype obj)
{
while (!MMC_NILTEST(lst))
{
if (mmc_boxes_equal(MMC_CAR(lst), obj))
return 1;
lst = MMC_CDR(lst);
}
return 0;
}
listGet_rettype listGet(modelica_metatype lst, modelica_integer i)
{
if (i < 1)
throw 1;
while (!MMC_NILTEST(lst))
{
if (i == 1) {
return MMC_CAR(lst);
}
lst = MMC_CDR(lst);
i--;
}
throw 1; /* List was not long enough */
}
listNth_rettype listNth(modelica_metatype lst, modelica_integer i)
{
return listGet(lst,i+1);
}
listRest_rettype listRest(modelica_metatype lst)
{
if (MMC_NILTEST(lst))
throw 1;
return MMC_CDR(lst);
}
listEmpty_rettype listEmpty(modelica_metatype lst)
{
return MMC_NILTEST(lst) ? 1 : 0;
}
listDelete_rettype listDelete(modelica_metatype lst, modelica_integer ix)
{
modelica_metatype *tmpArr;
int i;
tmpArr = (modelica_metatype *) malloc(sizeof(modelica_metatype)*ix); /* We know the size of the first part of the list (+1 for the element to delete) */
if (tmpArr == NULL) {
fprintf(stderr, "%s:%d: malloc failed", __FILE__, __LINE__);
EXIT(1);
}
for (i=0; i<ix; i++)
{
if (MMC_NILTEST(lst))
{
free(tmpArr);
throw 1;
}
tmpArr[i] = MMC_CAR(lst);
lst = MMC_CDR(lst);
}
for (i=ix-2; i>=0; i--)
{
lst = mmc_mk_cons(tmpArr[i], lst);
}
free(tmpArr);
return lst;
}
/* Option Operations */
optionNone_rettype optionNone(modelica_metatype opt)
{
return 0==MMC_HDRSLOTS(MMC_GETHDR(opt)) ? 1 : 0;
}
/* Array Operations */
arrayLength_rettype arrayLength(modelica_metatype arr)
{
return MMC_HDRSLOTS(MMC_GETHDR(arr));
}
arrayGet_rettype arrayGet(modelica_metatype arr, modelica_integer ix)
{
if (ix < 1)
throw 1;
if((unsigned)ix-1 >= MMC_HDRSLOTS(MMC_GETHDR(arr)))
throw 1;
return MMC_STRUCTDATA(arr)[ix-1];
}
arrayCreate_rettype arrayCreate(modelica_integer nelts, modelica_metatype val)
{
void* arr = (struct mmc_struct*)mmc_mk_box_no_assign(nelts, MMC_ARRAY_TAG);
void **arrp = MMC_STRUCTDATA(arr);
for(int i=0; i<nelts; i++)
arrp[i] = val;
return arr;
}
arrayList_rettype arrayList(modelica_metatype arr)
{
int nelts = MMC_HDRSLOTS(MMC_GETHDR(arr))-1;
void **vecp = MMC_STRUCTDATA(arr);
void *res = mmc_mk_nil();
for(; nelts >= 0; --nelts)
res = mmc_mk_cons(vecp[nelts],res);
return res;
}
listArray_rettype listArray(modelica_metatype lst)
{
int nelts = listLength(lst);
void* arr = (struct mmc_struct*)mmc_mk_box_no_assign(nelts, MMC_ARRAY_TAG);
void **arrp = MMC_STRUCTDATA(arr);
for(int i=0; i<nelts; i++) {
arrp[i] = MMC_CAR(lst);
lst = MMC_CDR(lst);
}
return arr;
}
arrayUpdate_rettype arrayUpdate(modelica_metatype arr, modelica_integer ix, modelica_metatype val)
{
int nelts = MMC_HDRSLOTS(MMC_GETHDR(arr));
if (ix < 1 || ix > nelts)
throw 1;
MMC_STRUCTDATA(arr)[ix-1] = val;
return arr;
}
arrayCopy_rettype arrayCopy(modelica_metatype arr)
{
int nelts = MMC_HDRSLOTS(MMC_GETHDR(arr));
void* res = (struct mmc_struct*)mmc_mk_box_no_assign(nelts, MMC_ARRAY_TAG);
void **arrp = MMC_STRUCTDATA(arr);
void **resp = MMC_STRUCTDATA(res);
for(int i=0; i<nelts; i++) {
resp[i] = arrp[i];
}
return res;
}
arrayAdd_rettype arrayAdd(modelica_metatype arr, modelica_metatype val)
{
int nelts = MMC_HDRSLOTS(MMC_GETHDR(arr));
void* res = (struct mmc_struct*)mmc_mk_box_no_assign(nelts+1, MMC_ARRAY_TAG);
void **arrp = MMC_STRUCTDATA(arr);
void **resp = MMC_STRUCTDATA(res);
for(int i=0; i<nelts; i++) {
resp[i] = arrp[i];
}
resp[nelts] = val;
return res;
}
/* Misc Operations */
tick_rettype tick()
{
static modelica_integer curTick = 0;
return curTick++;
}
void boxptr_print(modelica_metatype str)
{
fprintf(stdout, "%s", MMC_STRINGDATA(str));
}
void print(char* str)
{
fprintf(stdout, "%s", str);
}
mmc__clock_rettype mmc__clock()
{
static double start_t;
static int init = 1;
if (init) {
start_t = ((double)clock())/CLOCKS_PER_SEC;
init = 0;
return 0.0;
}
return (clock()-start_t)/CLOCKS_PER_SEC;
}
if__exp_rettype if__exp(modelica_boolean cond, modelica_metatype in1, modelica_metatype in2)
{
return cond ? in1 : in2;
}
void equality(modelica_metatype in1, modelica_metatype in2)
{
if (!mmc_boxes_equal(in1, in2))
throw 1;
}
}