This repository has been archived by the owner on Sep 27, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 73
/
Copy pathbuiltin.cc
1787 lines (1715 loc) · 60.8 KB
/
builtin.cc
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
// Copyright 2016-2021 Doug Moen
// Licensed under the Apache License, version 2.0
// See accompanying file LICENSE or https://www.apache.org/licenses/LICENSE-2.0
#include <libcurv/builtin.h>
#include <libcurv/analyser.h>
#include <libcurv/bool.h>
#include <libcurv/die.h>
#include <libcurv/dir_record.h>
#include <libcurv/exception.h>
#include <libcurv/function.h>
#include <libcurv/import.h>
#include <libcurv/tree.h>
#include <libcurv/num.h>
#include <libcurv/pattern.h>
#include <libcurv/picker.h>
#include <libcurv/prim_expr.h>
#include <libcurv/program.h>
#include <libcurv/sc_compiler.h>
#include <libcurv/sc_context.h>
#include <libcurv/source.h>
#include <libcurv/system.h>
#include <libcurv/types.h>
#include <boost/math/constants/constants.hpp>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <filesystem>
#include <string>
using namespace std;
using namespace boost::math::double_constants;
namespace curv {
Shared<Meaning>
Builtin_Value::to_meaning(const Identifier& id) const
{
return make<Constant>(share(id), value_);
}
//----------------------------------------------//
// Templates for constructing builtin functions //
//----------------------------------------------//
template <class Prim>
struct Unary_Array_Func : public Function
{
using Function::Function;
using Op = Unary_Array_Op<Prim>;
Value call(Value arg, Fail fl, Frame& fm) const override
{
return Op::call(fl, At_Arg(*this, fm), arg);
}
SC_Value sc_call_expr(Operation& argx, Shared<const Phrase> ph, SC_Frame& fm)
const override
{
return Op::sc_op(At_SC_Arg_Expr(*this, ph, fm), argx, fm);
}
};
template <class Prim>
struct Binary_Array_Func : public Tuple_Function
{
Binary_Array_Func(const char* nm) : Tuple_Function(2,nm) {}
using Op = Binary_Array_Op<Prim>;
Value tuple_call(Fail fl, Frame& args) const override
{
return Op::call(fl, At_Arg(*this, args), args[0], args[1]);
}
SC_Value sc_call_expr(Operation& argx, Shared<const Phrase> ph, SC_Frame& fm)
const override
{
return Op::sc_op(At_SC_Arg_Expr(*this, ph, fm), argx, fm);
}
};
template <class Prim>
struct Monoid_Func final : public Function
{
using Function::Function;
using Op = Binary_Array_Op<Prim>;
Value call(Value arg, Fail fl, Frame& fm) const override
{
return Op::reduce(fl, At_Arg(*this, fm), Prim::zero(), arg);
}
SC_Value sc_call_expr(Operation& argx, Shared<const Phrase> ph, SC_Frame& fm)
const override
{
return Op::sc_reduce(At_SC_Arg_Expr(*this, ph, fm),
Prim::zero(), argx, fm);
}
};
//-------------------//
// Builtin Functions //
//-------------------//
struct F_as : public Curried_Function
{
F_as(const char* nm) : Curried_Function(2,nm) {}
virtual Value ccall(const Function& self, Fail fl, Frame& args)
const override {
At_Arg cx(*this, args);
auto type = CType::from_value(args[0], Fail::hard, cx);
if (type->contains(args[1], cx))
return args[1];
if (fl == Fail::soft)
return missing;
throw Exception(At_Arg(self, args),
stringify(args[1]," is not a ",*type));
}
virtual bool validate_arg(unsigned i, Value a, Fail fl, const At_Syntax& cx)
const override {
return CType::from_value(a, fl, cx).has_value();
}
};
struct F_is : public Curried_Function
{
F_is(const char* nm) : Curried_Function(2,nm) {}
virtual Value ccall(const Function& self, Fail, Frame& args)
const override {
At_Arg cx(*this, args);
auto type = CType::from_value(args[0], Fail::hard, cx);
return type->contains(args[1], cx);
}
virtual bool validate_arg(unsigned i, Value a, Fail fl, const At_Syntax& cx)
const override {
return CType::from_value(a, fl, cx).has_value();
}
};
struct F_Tuple : public Function
{
using Function::Function;
Value call(Value arg, Fail fl, Frame& fm) const override
{
std::vector<CType> types;
TRY_DEF(list, arg.to<const List>(fl, At_Arg(*this, fm)));
for (auto e : *list) {
TRY_DEF(type, CType::from_value(e, fl, At_Arg(*this, fm)));
types.push_back(type);
}
if (types.size() > 0) {
// Tuple[T]=>Array[1]T, Tuple[T,T]=>Array[2]T, ...
bool uniform = true;
for (unsigned i = 1; i < types.size(); ++i) {
if (types[0] != types[i]) {
uniform = false;
break;
}
}
if (uniform)
return {make<Array_Type>(types.size(), types[0])};
}
return {make<Tuple_Type>(std::move(types))};
}
};
struct F_List : public Function
{
using Function::Function;
Value call(Value arg, Fail fl, Frame& fm) const override
{
TRY_DEF(type, CType::from_value(arg, fl, At_Arg(*this, fm)));
return {make<List_Type>(type)};
}
};
struct F_Array : public Curried_Function
{
static CType make_array_type(
unsigned i,
const std::vector<int>& axes,
CType etype)
{
if (i == axes.size()) return etype;
/* otherwise i < axes.size() */
if (axes[i] == 0)
return {make<Tuple_Type>(std::vector<CType>{})};
etype = make_array_type(i+1, axes, etype);
return {make<Array_Type>(axes[i], etype)};
}
F_Array(const char* nm) : Curried_Function(2,nm) {}
virtual Value ccall(const Function& self, Fail fl, Frame& args) const
{
At_Arg cx(*this, args);
TRY_DEF(xlist, args[0].to<const List>(fl, cx));
TRY_DEF(etype, CType::from_value(args[1], fl, cx));
std::vector<int> axes;
for (auto e : *xlist) {
if (!e.is_num()) {
FAIL(fl, false, cx, stringify(e," is not a number"));
}
int i;
if (!num_to_int(e.to_num_unsafe(), i, 0, INT_MAX, fl, cx))
return missing;
axes.push_back(i);
}
return make_array_type(0, axes, etype).to_value();
}
virtual bool validate_arg(unsigned i, Value a, Fail fl, const At_Syntax& cx)
const override {
auto xlist = a.to<const List>(fl, cx);
if (xlist == nullptr) return false;
for (auto e : *xlist) {
if (!e.is_num()) {
FAIL(fl, false, cx, stringify(e," is not a number"));
}
int i;
if (!num_to_int(e.to_num_unsafe(), i, 0, INT_MAX, fl, cx))
return false;
}
return true;
}
};
struct F_Struct : public Function
{
using Function::Function;
Value call(Value arg, Fail fl, Frame& fm) const override
{
Symbol_Map<CType> fields;
At_Arg cx(*this, fm);
TRY_DEF(rec, arg.to<const Record>(fl, cx));
for (auto pf = rec->iter(); !pf->empty(); pf->next()) {
TRY_DEF(type, CType::from_value(pf->value(cx), fl, cx));
fields[pf->key()] = type;
}
return {make<Struct_Type>(std::move(fields))};
}
};
struct F_Record : public Function
{
using Function::Function;
Value call(Value arg, Fail fl, Frame& fm) const override
{
Symbol_Map<CType> fields;
At_Arg cx(*this, fm);
TRY_DEF(rec, arg.to<const Record>(fl, cx));
for (auto pf = rec->iter(); !pf->empty(); pf->next()) {
TRY_DEF(type, CType::from_value(pf->value(cx), fl, cx));
fields[pf->key()] = type;
}
return {make<Record_Type>(std::move(fields))};
}
};
struct F_is_bool : public Function
{
using Function::Function;
Value call(Value arg, Fail, Frame&) const override
{
return {is_bool(arg)};
}
};
struct F_is_char : public Function
{
using Function::Function;
Value call(Value arg, Fail, Frame&) const override
{
return {arg.is_char()};
}
};
struct F_is_symbol : public Function
{
using Function::Function;
Value call(Value arg, Fail, Frame&) const override
{
return {is_symbol(arg)};
}
};
struct F_is_num : public Function
{
using Function::Function;
Value call(Value arg, Fail, Frame&) const override
{
return {is_num(arg)};
}
};
struct F_is_string : public Function
{
using Function::Function;
Value call(Value arg, Fail, Frame&) const override
{
return {is_string(arg)};
}
};
struct F_is_list : public Function
{
using Function::Function;
Value call(Value arg, Fail, Frame& fm) const override
{
Generic_List glist(arg);
return {glist.is_list()};
}
};
struct F_is_record : public Function
{
using Function::Function;
Value call(Value arg, Fail, Frame&) const override
{
return {arg.maybe<Record>() != nullptr};
}
};
struct F_is_primitive_func : public Function
{
using Function::Function;
Value call(Value arg, Fail, Frame&) const override
{
return {arg.maybe<Function>() != nullptr};
}
};
struct F_is_func : public Function
{
using Function::Function;
Value call(Value arg, Fail, Frame& fm) const override
{
return {maybe_function(arg, At_Arg(*this, fm)) != nullptr};
}
};
struct Bit_Prim : public Unary_Bool_To_Num_Prim
{
static inline constexpr const char name[] = "bit";
static constexpr Prec prec = Prec::postfix;
static Value call(bool b, const Context&) { return {double(b)}; }
static SC_Value sc_call(SC_Frame& fm, SC_Value arg)
{
auto result = fm.sc_.newvalue(SC_Type::Num(arg.type.count()));
fm.sc_.out() << " " << result.type << " " << result << " = "
<< result.type << "(" << arg << ");\n";
return result;
}
};
using F_bit = Unary_Array_Func<Bit_Prim>;
#define UNARY_NUMERIC_FUNCTION(Func_Name,curv_name,c_name,glsl_name) \
struct Func_Name##Prim : public Unary_Num_SCVec_Prim \
{ \
static inline constexpr const char name[] = #curv_name; \
static constexpr Prec prec = Prec::postfix; \
static Value call(double x, const Context&) { return {c_name(x)}; } \
static SC_Value sc_call(SC_Frame& fm, SC_Value arg) \
{ return sc_unary_call(fm, arg.type, #glsl_name, arg); } \
}; \
using Func_Name = Unary_Array_Func<Func_Name##Prim>; \
UNARY_NUMERIC_FUNCTION(F_sqrt, sqrt, sqrt, sqrt)
UNARY_NUMERIC_FUNCTION(F_log, log, log, log)
UNARY_NUMERIC_FUNCTION(F_abs, abs, abs, abs)
UNARY_NUMERIC_FUNCTION(F_floor, floor, floor, floor)
UNARY_NUMERIC_FUNCTION(F_ceil, ceil, ceil, ceil)
UNARY_NUMERIC_FUNCTION(F_trunc, trunc, trunc, trunc)
UNARY_NUMERIC_FUNCTION(F_round, round, rint, roundEven)
inline double frac(double n) { return n - floor(n); }
UNARY_NUMERIC_FUNCTION(F_frac, frac, frac, fract)
inline double sign(double n) { return copysign(double(n!=0),n); }
UNARY_NUMERIC_FUNCTION(F_sign, sign, sign, sign)
UNARY_NUMERIC_FUNCTION(F_sin, sin, sin, sin)
UNARY_NUMERIC_FUNCTION(F_cos, cos, cos, cos)
UNARY_NUMERIC_FUNCTION(F_tan, tan, tan, tan)
UNARY_NUMERIC_FUNCTION(F_acos, acos, acos, acos)
UNARY_NUMERIC_FUNCTION(F_asin, asin, asin, asin)
UNARY_NUMERIC_FUNCTION(F_atan, atan, atan, atan)
UNARY_NUMERIC_FUNCTION(F_sinh, sinh, sinh, sinh)
UNARY_NUMERIC_FUNCTION(F_cosh, cosh, cosh, cosh)
UNARY_NUMERIC_FUNCTION(F_tanh, tanh, tanh, tanh)
UNARY_NUMERIC_FUNCTION(F_acosh, acosh, acosh, acosh)
UNARY_NUMERIC_FUNCTION(F_asinh, asinh, asinh, asinh)
UNARY_NUMERIC_FUNCTION(F_atanh, atanh, atanh, atanh)
struct Phase_Prim : public Unary_Vec2_To_Num_Prim
{
static inline constexpr const char name[] = "phase";
static constexpr Prec prec = Prec::postfix;
static Value call(Vec2 v, const Context&) { return {atan2(v.y,v.x)}; }
static SC_Value sc_call(SC_Frame& fm, SC_Value arg) {
auto result = fm.sc_.newvalue(SC_Type::Num());
fm.sc_.out() << " " << result.type << " " << result << " = "
<< "atan(" << arg << ".y," << arg << ".x);\n";
return result;
}
};
using F_phase = Unary_Array_Func<Phase_Prim>;
struct Max_Prim : public Binary_Num_SCVec_Prim
{
static inline constexpr const char name[] = "max";
static constexpr Prec prec = Prec::postfix;
static Value zero() { return {-INFINITY}; }
static Value call(double x, double y, const Context&)
{ return {std::max(x,y)}; }
static SC_Value sc_call(SC_Frame& fm, SC_Value x, SC_Value y)
{ return sc_bincall(fm, x.type, "max", x, y); }
};
using F_max = Monoid_Func<Max_Prim>;
struct Min_Prim : public Binary_Num_SCVec_Prim
{
static inline constexpr const char name[] = "min";
static constexpr Prec prec = Prec::postfix;
static Value zero() { return {INFINITY}; }
static Value call(double x, double y, const Context&)
{ return {std::min(x,y)}; }
static SC_Value sc_call(SC_Frame& fm, SC_Value x, SC_Value y)
{ return sc_bincall(fm, x.type, "min", x, y); }
};
using F_min = Monoid_Func<Min_Prim>;
using F_sum = Monoid_Func<Add_Prim>;
using F_not = Unary_Array_Func<Not_Prim>;
#define BOOL_OP(CppName,Name,Zero,LogOp,BitOp)\
struct CppName##_Prim : public Binary_Bool_Prim\
{\
static inline constexpr const char name[] = Name; \
static constexpr Prec prec = Prec::postfix; \
static Value zero() { return {Zero}; }\
static Value call(bool x, bool y, const Context&) { return {x LogOp y}; }\
static SC_Value sc_call(SC_Frame& fm, SC_Value x, SC_Value y)\
{\
auto result = fm.sc_.newvalue(x.type);\
fm.sc_.out() << " " << x.type << " " << result << " = ";\
if (x.type.is_bool())\
fm.sc_.out() << x << #LogOp << y << ";\n";\
else if (x.type.is_bool_or_vec()) {\
/* In GLSL 4.6, I *think* you can use '&' and '|' instead. */ \
/* TODO: SubCurv: more efficient and|or in bvec case */ \
bool first = true;\
fm.sc_.out() << x.type << "(";\
for (unsigned i = 0; i < x.type.count(); ++i) {\
if (!first) fm.sc_.out() << ",";\
first = false;\
fm.sc_.out() << x << "[" << i << "]"\
<< #LogOp << y << "[" << i << "]";\
}\
fm.sc_.out() << ")";\
}\
else\
fm.sc_.out() << x << #BitOp << y << ";\n";\
fm.sc_.out() << ";\n";\
return result;\
}\
};\
using F_##CppName = Monoid_Func<CppName##_Prim>;\
BOOL_OP(and,"and",true,&&,&)
BOOL_OP(or,"or",false,||,|)
struct Xor_Prim : public Binary_Bool_Prim
{
static inline constexpr const char name[] = "xor";
static constexpr Prec prec = Prec::postfix;
static Value zero() { return {false}; }
static Value call(bool x, bool y, const Context&) { return {x != y}; }
static SC_Value sc_call(SC_Frame& fm, SC_Value x, SC_Value y)
{
auto result = fm.sc_.newvalue(x.type);
fm.sc_.out() << " " << result.type << " " << result << " = ";
if (x.type.is_bool())
fm.sc_.out() << x << "!=" << y;
else if (x.type.is_bool_or_vec())
fm.sc_.out() << "notEqual(" << x << "," << y << ")";
else // bool32 or vector of bool32
fm.sc_.out() << x << "^" << y;
fm.sc_.out() << ";\n";
return result;
}
};
using F_xor = Monoid_Func<Xor_Prim>;
struct Lshift_Prim : public Shift_Prim
{
static inline constexpr const char name[] = "lshift";
static constexpr Prec prec = Prec::postfix;
static Value call(Shared<const List> a, double b, const Context &cx)
{
At_Index acx(0, cx);
At_Index bcx(1, cx);
unsigned n = (unsigned) num_to_int(b, 0, a->size()-1, bcx);
Shared<List> result = make_tail_array<List>(a->size());
for (unsigned i = 0; i < n; ++i)
result->at(i) = {false};
for (unsigned i = n; i < a->size(); ++i)
result->at(i) = {a->at(i-n).to_bool(acx)};
return {result};
}
static SC_Value sc_call(SC_Frame& fm, SC_Value x, SC_Value y)
{
auto result = fm.sc_.newvalue(x.type);
fm.sc_.out() << " " << x.type << " " << result << " = "
<< x << " << int(" << y << ");\n";
return result;
}
};
using F_lshift = Binary_Array_Func<Lshift_Prim>;
struct Rshift_Prim : public Shift_Prim
{
static inline constexpr const char name[] = "rshift";
static constexpr Prec prec = Prec::postfix;
static Value call(Shared<const List> a, double b, const Context &cx)
{
At_Index acx(0, cx);
At_Index bcx(1, cx);
unsigned n = (unsigned) num_to_int(b, 0, a->size()-1, bcx);
Shared<List> result = make_tail_array<List>(a->size());
for (unsigned i = a->size()-n; i < a->size(); ++i)
result->at(i) = {false};
for (unsigned i = 0; i < a->size()-n; ++i)
result->at(i) = {a->at(i+n).to_bool(acx)};
return {result};
}
static SC_Value sc_call(SC_Frame& fm, SC_Value x, SC_Value y)
{
auto result = fm.sc_.newvalue(x.type);
fm.sc_.out() << " " << x.type << " " << result << " = "
<< x << " >> int(" << y << ");\n";
return result;
}
};
using F_rshift = Binary_Array_Func<Rshift_Prim>;
struct Bool32_Sum_Prim : public Binary_Bool32_Prim
{
static inline constexpr const char name[] = "bool32_sum";
static constexpr Prec prec = Prec::postfix;
static Value zero()
{
static Value z = {nat_to_bool32(0)};
return z;
}
static Value call(unsigned a, unsigned b, const Context&)
{
return {nat_to_bool32(a + b)};
}
static SC_Value sc_call(SC_Frame& fm, SC_Value x, SC_Value y)
{
auto result = fm.sc_.newvalue(x.type);
fm.sc_.out() << " " << x.type << " " << result << " = "
<< x << " + " << y << ";\n";
return result;
}
};
using F_bool32_sum = Monoid_Func<Bool32_Sum_Prim>;
struct Bool32_Product_Prim : public Binary_Bool32_Prim
{
static inline constexpr const char name[] = "bool32_product";
static constexpr Prec prec = Prec::postfix;
static Value zero()
{
static Value z = {nat_to_bool32(1)};
return z;
}
static Value call(unsigned a, unsigned b, const Context&)
{
return {nat_to_bool32(a * b)};
}
static SC_Value sc_call(SC_Frame& fm, SC_Value x, SC_Value y)
{
auto result = fm.sc_.newvalue(x.type);
fm.sc_.out() << " " << x.type << " " << result << " = "
<< x << " * " << y << ";\n";
return result;
}
};
using F_bool32_product = Monoid_Func<Bool32_Product_Prim>;
struct F_bool32_to_nat : public Function
{
using Function::Function;
struct Prim : public Unary_Bool32_To_Num_Prim
{
static inline constexpr const char name[] = "bool32_to_nat";
static constexpr Prec prec = Prec::postfix;
static Value call(unsigned n, const Context&)
{
return {double(n)};
}
// No SubCurv support because a Num (32 bit float)
// cannot hold a Nat (32 bit natural).
static SC_Type sc_result_type(SC_Type) { return {}; }
static SC_Value sc_call(SC_Frame& fm, SC_Value x)
{
throw Exception(At_SC_Frame(fm),
"bool32_to_nat is not supported by SubCurv");
}
};
static Unary_Array_Op<Prim> array_op;
Value call(Value arg, Fail fl, Frame& fm) const override
{
return array_op.call(fl, At_Arg(*this, fm), arg);
}
};
struct F_nat_to_bool32 : public Function
{
using Function::Function;
struct Prim : public Unary_Num_To_Bool32_Prim
{
static inline constexpr const char name[] = "nat_to_bool32";
static constexpr Prec prec = Prec::postfix;
static Value call(double n, const Context& cx)
{
return {nat_to_bool32(num_to_nat(n, cx))};
}
static SC_Value sc_call(SC_Frame& fm, SC_Value x)
{
throw Exception(At_SC_Frame(fm),
"nat_to_bool32 can't be called in this context: "
"argument must be a constant");
}
};
static Unary_Array_Op<Prim> array_op;
Value call(Value arg, Fail fl, Frame& fm) const override
{
return array_op.call(fl, At_Arg(*this, fm), arg);
}
SC_Value sc_call_expr(Operation& argx, Shared<const Phrase> ph, SC_Frame& fm)
const override
{
At_SC_Arg_Expr cx(*this, ph, fm);
if (auto k = dynamic_cast<const Constant*>(&argx)) {
unsigned n = num_to_nat(k->value_.to_num(cx), cx);
auto type = SC_Type::Bool32();
auto result = fm.sc_.newvalue(type);
fm.sc_.out() << " " << type << " " << result << " = "
<< n << "u;\n";
return result;
}
else {
throw Exception(cx, "argument must be a constant");
}
}
};
struct Bool32_To_Float_Prim : public Unary_Bool32_To_Num_Prim
{
static inline constexpr const char name[] = "bool32_to_float";
static constexpr Prec prec = Prec::postfix;
static Value call(unsigned n, const Context&)
{
return {bitcast_nat_to_float(n)};
}
static SC_Value sc_call(SC_Frame& fm, SC_Value x)
{
unsigned count = x.type.is_bool32() ? 1 : x.type.count();
auto result = fm.sc_.newvalue(SC_Type::Num(count));
fm.sc_.out() << " " << result.type << " " << result
<< " = uintBitsToFloat(" << x << ");\n";
return result;
}
};
using F_bool32_to_float = Unary_Array_Func<Bool32_To_Float_Prim>;
struct Float_To_Bool32_Prim : public Unary_Num_To_Bool32_Prim
{
static inline constexpr const char name[] = "bool32_to_float";
static constexpr Prec prec = Prec::postfix;
static Value call(double n, const Context&)
{
return {nat_to_bool32(bitcast_float_to_nat(n))};
}
static SC_Value sc_call(SC_Frame& fm, SC_Value x)
{
auto result = fm.sc_.newvalue(SC_Type::Bool32(x.type.count()));
fm.sc_.out() << " " << result.type << " " << result
<< " = floatBitsToUint(" << x << ");\n";
return result;
}
};
using F_float_to_bool32 = Unary_Array_Func<Float_To_Bool32_Prim>;
Value
select(Value a, Value b, Value c, Fail fl, const Context& cx)
{
if (a.is_bool())
return a.to_bool_unsafe() ? b : c;
if (auto alist = a.maybe<List>()) {
auto blist = b.maybe<Abstract_List>();
if (blist) {
ASSERT_SIZE(fl,missing,blist,alist->size(),At_Index(1, cx));
}
auto clist = c.maybe<Abstract_List>();
if (clist) {
ASSERT_SIZE(fl,missing,clist,alist->size(),At_Index(2, cx));
}
List_Builder lb;
for (unsigned i = 0; i < alist->size(); ++i) {
TRY_DEF(v, select(alist->at(i),
blist ? blist->val_at(i) : b,
clist ? clist->val_at(i) : c,
fl, cx));
lb.push_back(v);
}
return lb.get_value();
}
FAIL(fl, missing, At_Index(0, cx),
stringify(a, " is not a Bool or a List"));
}
// `select[a,b,c]` is a vectorized version of `if` in which the condition is
// an array of booleans.
// * If `a` is boolean, then the result is `if (a) b else c`.
// * If `a` is an array of booleans, then the result is an array with the same
// shape as `a`. The elements of the result are selected from the arrays `b`
// and `c` based on whether the corresponding element of `a` is true or false.
// For example, `select[[false,true], [1,2], [10,20]] == [10,2]`.
// * Broadcasting is supported between `a` and `b` and between `a` and `c`,
// so for example, `select[[false,true], 1, 0] == [0,1]`.
// * Broadcasting is not supported between `b` and `c`, so for example,
// `select[true, 1, [1,2,3]]` yields `1`, and not `[1,1,1]`.
// The SubCurv version of `select` restricts the arguments `b` and `c`
// to have the same type.
//
// `select` has a different name from `if` because it violates some of the
// laws of `if`: it always evaluates all 3 arguments, and it can't be involved
// in tail recursion optimization.
//
// Similar to: numpy.where, R `ifelse`
struct F_select : public Tuple_Function
{
F_select(const char* nm) : Tuple_Function(3,nm) {}
Value tuple_call(Fail fl, Frame& args) const override
{
return select(args[0], args[1], args[2], fl, At_Arg(*this, args));
}
SC_Value sc_tuple_call(SC_Frame& fm) const override
{
auto cond = fm[0];
auto consequent = fm[1];
auto alternate = fm[2];
if (!cond.type.is_bool_or_vec()) {
throw Exception(At_SC_Tuple_Arg(0,fm), stringify(
"argument is not bool or bool vector; it has type ",
cond.type));
}
if (consequent.type != alternate.type) {
throw Exception(At_SC_Tuple_Arg(1,fm), stringify(
"2nd and 3rd argument of 'select' have different types: ",
consequent.type, " and ", alternate.type));
}
SC_Value result;
if (cond.type.is_bool()) {
result = fm.sc_.newvalue(consequent.type);
fm.sc_.out() << " " << result.type << " " << result << " = ";
fm.sc_.out() << cond << "?" << consequent << ":" << alternate;
} else {
// 'cond' is a boolean vector.
if (consequent.type.count() == 1) {
// Consequent & alternate are scalars. Convert them to vectors.
auto T = SC_Type::Array(consequent.type, cond.type.count());
sc_try_extend(fm, consequent, T);
sc_try_extend(fm, alternate, T);
}
else if (!consequent.type.is_vec()) {
throw Exception(At_SC_Tuple_Arg(1,fm), stringify(
"Must be a scalar or vector to match condition argument."
" Instead, type is ", consequent.type));
}
else if (cond.type.count() != consequent.type.count()) {
throw Exception(At_SC_Tuple_Arg(1,fm), stringify(
"Vector length ",consequent.type.count()," does not match"
" length of condition vector (", cond.type.count(),")"));
}
result = fm.sc_.newvalue(consequent.type);
fm.sc_.out() << " " << result.type << " " << result << " = ";
// In GLSL 4.5, this is `mix(alt,cons,cond)` (all args are vectors).
// Right now, we are locked to GLSL 3.3, so we can't use this.
// TODO: SubCurv: more efficient `select` for vector case
if (result.type.is_num_vec()) {
// This version of 'mix' is linear interpolation: it works by
// multiplication and addition of all 3 arguments. Which is
// different from the boolean vector 'mix' in GLSL 4.5 (which
// produces exact results even when linear interpolation would
// fail due to floating point approximation). But I saw IQ use
// linear interpolation of vectors to implement a 'select' in
// WebGL, so maybe this is efficient code.
fm.sc_.out() << "mix(" << alternate << "," << consequent
<< ",vec" << cond.type.count() << "(" << cond << "))";
} else {
fm.sc_.out() << result.type << "(";
bool atfirst = true;
for (unsigned i = 0; i < result.type.count(); ++i) {
if (!atfirst) fm.sc_.out() << ",";
atfirst = false;
fm.sc_.out() << cond << "[" << i << "] ? "
<< consequent << "[" << i << "] : "
<< alternate << "[" << i << "]";
}
fm.sc_.out() << ")";
}
}
fm.sc_.out() << ";\n";
return result;
}
};
SC_Value Equal_Expr::sc_eval(SC_Frame& fm) const
{
auto a = sc_eval_op(fm, *arg1_);
auto b = sc_eval_op(fm, *arg2_);
if (a.type != b.type || a.type.plex_array_rank() > 0) {
throw Exception(At_SC_Phrase(syntax_, fm),
stringify("domain error: ",a.type," == ",b.type));
}
SC_Value result = fm.sc_.newvalue(SC_Type::Bool());
fm.sc_.out() <<" bool "<<result<<" =("<<a<<" == "<<b<<");\n";
return result;
}
SC_Value Not_Equal_Expr::sc_eval(SC_Frame& fm) const
{
auto a = sc_eval_op(fm, *arg1_);
auto b = sc_eval_op(fm, *arg2_);
if (a.type != b.type || a.type.plex_array_rank() > 0) {
throw Exception(At_SC_Phrase(syntax_, fm),
stringify("domain error: ",a.type," != ",b.type));
}
SC_Value result = fm.sc_.newvalue(SC_Type::Bool());
fm.sc_.out() <<" bool "<<result<<" =("<<a<<" != "<<b<<");\n";
return result;
}
// Generalized dot product that includes vector dot product and matrix product.
// Same as Mathematica Dot[A,B]. Like APL A+.×B, Python numpy.dot(A,B)
// dot(a,b) =
// if (count a > 0 && is_list(a[0]))
// [for (row in a) dot(row,b)] // matrix*...
// else
// sum(a*b) // vector*...
struct F_dot : public Tuple_Function
{
F_dot(const char* nm) : Tuple_Function(2,nm) {}
Value dot(Value a, Value b, Fail, const At_Arg& cx) const;
Value tuple_call(Fail fl, Frame& args) const override
{
return dot(args[0], args[1], fl, At_Arg(*this, args));
}
SC_Value sc_tuple_call(SC_Frame& fm) const override
{
auto a = fm[0];
auto b = fm[1];
if (a.type.is_num_vec() && a.type == b.type)
return sc_bincall(fm, SC_Type::Num(), "dot", a, b);
if (a.type.is_num_vec() && b.type.is_mat()
&& a.type.count() == b.type.count())
{
return sc_binop(fm, a.type, b, "*", a);
}
if (a.type.is_mat() && b.type.is_num_vec()
&& a.type.count() == b.type.count())
{
return sc_binop(fm, b.type, b, "*", a);
}
if (a.type.is_mat() && b.type.is_mat()
&& a.type.count() == b.type.count())
{
return sc_binop(fm, a.type, b, "*", a);
}
throw Exception(At_SC_Frame(fm), stringify(
"dot: invalid argument type [",a.type,",",b.type,"]"));
}
};
Value F_dot::dot(Value a, Value b, Fail fl, const At_Arg& cx) const
{
auto av = a.maybe<List>();
auto bv = b.maybe<List>();
if (av && bv) {
if (av->size() > 0 && av->at(0).maybe<List>()) {
Shared<List> result = make_tail_array<List>(av->size());
for (size_t i = 0; i < av->size(); ++i) {
TRY_DEF(v, dot(av->at(i), b, fl, cx));
result->at(i) = v;
}
return {result};
} else {
if (av->size() != bv->size())
throw Exception(cx, stringify("list of size ",av->size(),
" can't be multiplied by list of size ",bv->size()));
Value result = {0.0};
for (size_t i = 0; i < av->size(); ++i) {
TRY_DEF(prod, Multiply_Op::call(fl, cx, av->at(i), bv->at(i)));
TRY_DEF(sum, Add_Op::call(fl, cx, result, prod));
result = sum;
}
return result;
}
}
// Handle the case where a or b is a reactive list,
// and return a reactive result.
// This is copied and modified from F_dot::sc_tuple_call.
// The code ought to be identical in both cases.
// The reactive result should contain SubCurv IR code,
// which is simultaneously code that can be evaluated by the interpreter.
auto aty = sc_type_of(a);
auto bty = sc_type_of(b);
SC_Type rty;
if (aty.is_num_vec() && aty == bty)
rty = SC_Type::Num();
else if (aty.is_num_vec() && bty.is_mat() && aty.count() == bty.count())
rty = bty;
else if (aty.is_mat() && bty.is_num_vec() && aty.count() == bty.count())
rty = aty;
else if (aty.is_mat() && bty.is_mat() && aty.count() == bty.count())
rty = aty;
else
throw Exception(cx, stringify("dot[",a,",",b,"]: invalid arguments"));
Shared<List_Expr> args = make_tail_array<List_Expr>(
{to_expr(a, cx.syntax()), to_expr(b, cx.syntax())},
share(cx.syntax()));
args->init();
return {make<Reactive_Expression>(
rty,
make<Call_Expr>(
cx.call_frame_.call_phrase_,
make<Constant>(
func_part(cx.call_frame_.call_phrase_),
Value{share(*this)}),
args),
cx)};
}
struct F_mag : public Tuple_Function
{
F_mag(const char* nm) : Tuple_Function(1,nm) {}
Value tuple_call(Fail fl, Frame& args) const override
{
// Use hypot() or BLAS DNRM2 or Eigen stableNorm/blueNorm?
// Avoids overflow/underflow due to squaring of large/small values.
// Slower. https://forum.kde.org/viewtopic.php?f=74&t=62402
// Fast path: assume we have a list of numbers, compute a result.
if (auto list = args[0].maybe<List>()) {
double sum = 0.0;
for (auto val : *list) {
double x = val.to_num_or_nan();
sum += x * x;
}
if (sum == sum)
return {sqrt(sum)};
}
// Slow path, return a reactive value or abort.
Shared<Operation> arg_op = nullptr;
if (auto rx = args[0].maybe<Reactive_Value>()) {
if (rx->sctype_.is_num_vec())
arg_op = rx->expr();
} else {
TRY_DEF(list, args[0].to<List>(fl, At_Arg(*this, args)));
Shared<List_Expr> rlist = make_tail_array<List_Expr>
(list->size(),arg_part(args.call_phrase_));
arg_op = rlist;
for (unsigned i = 0; i < list->size(); ++i) {
Value val = list->at(i);
if (val.is_num()) {
rlist->at(i) =
make<Constant>(arg_part(args.call_phrase_), val);
continue;
}
auto r = val.maybe<Reactive_Value>();
if (r && r->sctype_.is_num()) {
rlist->at(i) = r->expr();
continue;
}
arg_op = nullptr;
break;
}
if (arg_op) rlist->init();
}
if (arg_op) {
return {make<Reactive_Expression>(
SC_Type::Num(),
make<Call_Expr>(
args.call_phrase_,
make<Constant>(
func_part(args.call_phrase_),
Value{share(*this)}),
arg_op),
At_Arg(*this, args))};
}
FAIL(fl, missing, At_Arg(*this, args),
stringify(args[0],": domain error"));
}
SC_Value sc_tuple_call(SC_Frame& fm) const override
{
auto arg = fm[0];
if (!arg.type.is_num_vec())
throw Exception(At_SC_Tuple_Arg(0, fm), stringify(
"mag: argument is not a vector (type ", arg.type, ")"));
auto result = fm.sc_.newvalue(SC_Type::Num());
fm.sc_.out() << " float "<<result<<" = length("<<arg<<");\n";
return result;
}
};