-
Notifications
You must be signed in to change notification settings - Fork 108
/
rewriter.cpp
1126 lines (1090 loc) · 37.8 KB
/
rewriter.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
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
#include <stdio.h>
#include <iostream>
#include <vector>
#include <map>
#include "util.h"
#include "lllparser.h"
#include "bignum.h"
#include "optimize.h"
#include "rewriteutils.h"
#include "preprocess.h"
#include "functions.h"
#include "opcodes.h"
// Rewrite rules
std::string macros[][2] = {
{
"(seq $x)",
"$x"
},
{
"(seq (seq) $x)",
"$x"
},
{
"(+= $a $b)",
"(set $a (+ $a $b))"
},
{
"(*= $a $b)",
"(set $a (* $a $b))"
},
{
"(-= $a $b)",
"(set $a (- $a $b))"
},
{
"(/= $a $b)",
"(set $a (/ $a $b))"
},
{
"(%= $a $b)",
"(set $a (% $a $b))"
},
{
"(^= $a $b)",
"(set $a (^ $a $b))"
},
{
"(!= $a $b)",
"(iszero (eq $a $b))"
},
{
"(assert $x)",
"(jumpi (pc) (iszero $x))"
},
{
"(min $a $b)",
"(with $1 $a (with $2 $b (if (slt $1 $2) $1 $2)))"
},
{
"(max $a $b)",
"(with $1 $a (with $2 $b (if (slt $1 $2) $2 $1)))"
},
{
"(unsigned_min $a $b)",
"(with $1 $a (with $2 $b (if (lt $1 $2) $1 $2)))"
},
{
"(unsigned_max $a $b)",
"(with $1 $a (with $2 $b (if (lt $1 $2) $2 $1)))"
},
{
"(if $cond $do (else $else))",
"(if $cond $do $else)"
},
{
"(code $code)",
"$code"
},
{
"(array $len)",
"(with $l $len (with $x (alloc (add 32 (mul 32 $l))) (seq (mstore $x $l) (add $x 32))))"
},
{
"(string $len)",
"(with $l $len (with $x (alloc (add 32 $l)) (seq (mstore $x $l) (add $x 32))))"
},
{
"(shrink $arr $sz)",
"(mstore (sub $arr 32) $sz)"
},
{
"(slice $arr (= items $start) (= items $end))",
"(with _s $start (with _l (sub $end _s) (with _a (array _l) (seq (mcopy _a (add $arr (mul 32 _s)) (mul 32 _l)) _a))))"
},
{
"(slice $arr (= chars $start) (= chars $end))",
"(with _s $start (with _l (sub $end _s) (with _a (string _l) (seq (mcopy _a (add $arr _s) _l) _a))))"
},
{
"(len $x)",
"(mload (sub $x 32))"
},
{
"(ceil32 $x)",
"(mul 32 (div (add $x 31) 32))"
},
{
"(while $cond $do)",
"(until (iszero $cond) $do)",
},
{
"(while (iszero $cond) $do)",
"(until $cond $do)",
},
{
"(if $cond $do)",
"(unless (iszero $cond) $do)",
},
{
"(if (iszero $cond) $do)",
"(unless $cond $do)",
},
{
"(access (. self storage) $ind)",
"(sload $ind)"
},
{
"(access $var $ind)",
"(mload (add $var (mul 32 $ind)))"
},
{
"(set (access (. self storage) $ind) $val)",
"(sstore $ind $val)"
},
{
"(set (sload $ind) $val)",
"(sstore $ind $val)"
},
{
"(set (access $var $ind) $val)",
"(mstore (add $var (mul 32 $ind)) $val)"
},
{
"(getch $var $ind)",
"(mod (mload (sub (add $var $ind) 31)) 256)"
},
{
"(setch $var $ind $val)",
"(mstore8 (add $var $ind) (or (byte 0 $val) (byte 31 $val)))",
},
{
"(send $to $value)",
"(~call 0 $to $value 0 0 0 0)"
},
{
"(send $gas $to $value)",
"(~call $gas $to $value 0 0 0 0)"
},
{
"(id $0)",
"$0"
},
{
"(return (: $x (access $y)))",
"(return (: $x arr))"
},
{
"(return (: $x bytes))",
"(return (: $x str))"
},
{
"(return (: $x arr))",
"(with $0 $x (seq (mstore (sub $0 64) 32) (~return (sub $0 64) (add 64 (= items (mload (sub $0 32)))))))"
},
{
"(return (: $x str))",
"(with $0 $x (seq (mstore (sub $0 64) 32) (~return (sub $0 64) (ceil32 (add 64 (= chars (mload (sub $0 32))))))))"
},
{
"(return (: $x $y))",
"(return $x)"
},
{
"(return $arr (= $type $sz))",
"(with _a $arr (with _size $sz (seq (mstore (sub _a 64) 32) (mstore (sub _a 32) _size) (~return (sub _a 64) (ceil32 (add (= $type _size) 64))))))"
},
{
"(return $arr $sz)",
"(error \"when returning you must do return(x) for values, return(x:arr) for arrays or return(x:str) for strings; return(arr, len) by itself is no longer valid. Uses of return(arr, len) should be substituted with return(arr, items=len) or ideally actual arrays.\")"
},
{
"(return $x)",
"(seq (set $1 $x) (~return (ref $1) 32))"
},
{
"(&& $x $y)",
"(if $x $y 0)"
},
{
"(|| $x $y)",
"(with $1 $x (if $1 $1 $y))"
},
{
"(>= $x $y)",
"(iszero (slt $x $y))"
},
{
"(<= $x $y)",
"(iszero (sgt $x $y))"
},
{
"(create $code)",
"(create 0 $code)"
},
{
"(create $endowment $code)",
"(with $1 (msize) (create $endowment (get $1) (lll $code (msize))))"
},
{
"(sha3 (: $x arr))",
"(with $0 $x (~sha3 $0 (= items (mload (sub $0 32)))))"
},
{
"(sha3 (: $x str))",
"(with $0 $x (~sha3 $0 (= chars (mload (sub $0 32)))))"
},
{
"(sha3 $arr (= $type $sz))",
"(~sha3 $arr (= $type $sz))"
},
{
"(sha3 $arr $sz)",
"(error \"when hashing you must do sha3(x) for values, sha3(arr, items=len) for arrays or sha3(arr, chars=len) for strings; sha3(arr, len) by itself is no longer valid\")"
},
{
"(sha3 $x)",
"(seq (set $1 $x) (~sha3 (ref $1) 32))"
},
{
"(sha256 (: $x arr))",
"(with $0 $x (_sha256 $0 (= items (mload (sub $0 32)))))"
},
{
"(sha256 (: $x str))",
"(with $0 $x (_sha256 $0 (= chars (mload (sub $0 32)))))"
},
{
"(sha256 $arr (= $type $sz))",
"(_sha256 $arr (= $type $sz))"
},
{
"(sha256 (: $x str))",
"(with $0 $x (_sha256 $0 (= chars (mload (sub $0 32)))))"
},
{
"(sha256 $x)",
"(seq (set $1 $x) (_sha256 (ref $1) (= items 1)))",
},
{
"(_sha256 $arr $sz)",
"(with $0 $sz (with $1 (alloc 32) (with $gas (add 72 $0) (seq (pop (~call $gas 2 0 $arr $0 (get $1) 32)) (mload (get $1))))))"
},
{
"(sha256 $arr $sz)",
"(error \"when hashing you must do sha256(x) for values, sha256(arr, items=len) for arrays or sha256(arr, chars=len) for strings; sha256(arr, len) by itself is no longer valid\")"
},
{
"(ripemd160 (: $x arr))",
"(with $0 $x (_ripemd160 $0 (= items (mload (sub $0 32)))))"
},
{
"(ripemd160 (: $x str))",
"(with $0 $x (_ripemd160 $0 (= chars (mload (sub $0 32)))))"
},
{
"(ripemd160 $arr (= $type $sz))",
"(_ripemd160 $arr (= $type $sz))"
},
{
"(ripemd160 $x)",
"(seq (set $1 $x) (_ripemd160 (ref $1) (= items 1)))",
},
{
"(_ripemd160 $arr $sz)",
"(with $0 $sz (with $1 (alloc 32) (with $gas (add 720 (mul 4 $0)) (seq (pop (~call $gas 3 0 $arr $0 (get $1) 32)) (mload (get $1))))))"
},
{
"(ripemd160 $arr $sz)",
"(error \"when hashing you must do ripemd(x) for values, ripemd160(arr, items=len) for arrays or ripemd160(arr, chars=len) for strings; ripemd160(arr, len) by itself is no longer valid\")"
},
{
"(set chars $x)",
"$x",
},
{
"(set items $x)",
"(mul $x 32)",
},
{
"(ecrecover $h $v $r $s)",
"(with $1 (alloc 160) (seq (mstore (get $1) $h) (mstore (add (get $1) 32) $v) (mstore (add (get $1) 64) $r) (mstore (add (get $1) 96) $s) (pop (~call 3000 1 0 (get $1) 128 (add (get $1) 128) 32)) (mload (add (get $1) 128))))"
},
{
"(inset $x)",
"$x"
},
{
"(create $x)",
"(with $1 (msize) (create $val (get $1) (lll $code (get $1))))"
},
{
"(with (= $var $val) $cond)",
"(with $var $val $cond)"
},
{
"(save $loc (: $array arr))",
"(with $0 $array (save $loc $0 (= items (len $0))))"
},
{
"(save $loc (: $string str))",
"(with $0 $string (save $loc $0 (= chars (len $0))))"
},
{
"(save $loc $array (= items $count))",
"(with $location (ref $loc) (with $end $count (with $i 0 (while (slt $i $end) (seq (sstore (add $i $location) (access $array $i)) (set $i (add $i 1)))))))"
},
{
"(save $loc $array $count)",
"(with $location (ref $loc) (with $c $count (with $end (div $c 32) (with $i 0 (seq (while (slt $i $end) (seq (sstore (add $i $location) (access $array $i)) (set $i (add $i 1)))) (sstore (add $i $location) (~and (access $array $i) (sub 0 (exp 256 (sub 32 (mod $c 32)))))))))))"
},
{
"(load $loc (= items $count))",
"(with $location (ref $loc) (with $c $count (with $a (array $c) (with $i 0 (seq (while (slt $i $c) (seq (set (access $a $i) (sload (add $location $i))) (set $i (add $i 1)))) $a)))))"
},
{
"(load $loc $count)",
"(with $location (ref $loc) (with $c $count (with $a (string $c) (with $i 0 (seq (while (slt $i (div $c 32)) (seq (set (access $a $i) (sload (add $location $i))) (set $i (add $i 1)))) (set (access $a $i) (~and (sload (add $location $i)) (sub 0 (exp 256 (sub 32 (mod $c 32)))))) $a)))))"
},
{
"(safe_call $gas $to $value $datain $datainsz $dataout $dataoutsz)",
"(unless (~call $gas $to $value $datain $datainsz $dataout $dataoutsz) (invalid))"
},
{
"(mcopy $to $from $sz)",
"(with _sz $sz (with $gas (+ 18 (/ _sz 10)) (safe_call $gas 4 0 $from _sz $to _sz)))"
},
{
"(waste $n)",
"(call $n (create (lll (invalid))) 0 0 0 0 0)"
},
{
"(selfdestruct $a)",
"(suicide $a)"
},
{
"(~delegatecall $a $b $value $c $d $e $f)",
"(~delegatecall $a $b $c $d $e $f)",
},
{ "(. msg sender)", "(caller)" },
{ "(. msg value)", "(callvalue)" },
{ "(. msg gas)", "(gas)" },
{ "(. tx gasprice)", "(gasprice)" },
{ "(. tx origin)", "(origin)" },
{ "(. tx gas)", "(error \"Replace tx.gas with msg.gas\")" },
{ "(. $x balance)", "(balance $x)" },
{ "self", "(address)" },
{ "(. block prevhash)", "(blockhash (sub (number) 1))" },
{ "(fun (. block prevhash) $n)", "(blockhash (sub (number) $n))" },
{ "(. block coinbase)", "(coinbase)" },
{ "(. block timestamp)", "(timestamp)" },
{ "(. block number)", "(number)" },
{ "(. block difficulty)", "(difficulty)" },
{ "(. block gaslimit)", "(gaslimit)" },
{ "stop", "(stop)" },
{ "---END---", "" } //Keep this line at the end of the list
};
// Token synonyms
std::string synonyms[][2] = {
{ "or", "||" },
{ "and", "&&" },
{ "|", "~or" },
{ "&", "~and" },
{ "elif", "if" },
{ "!", "iszero" },
{ "~", "~not" },
{ "not", "iszero" },
{ "+", "add" },
{ "-", "sub" },
{ "*", "mul" },
{ "/", "sdiv" },
{ "^", "exp" },
{ "**", "exp" },
{ "%", "smod" },
{ "<", "slt" },
{ ">", "sgt" },
{ "=", "set" },
{ "==", "eq" },
{ ":", "kv" },
{ "---END---", "" } //Keep this line at the end of the list
};
std::map<std::string, std::string> synonymMap;
// Custom setters (need to be registered separately
// for use with managed storage)
std::string setters[][2] = {
{ "+=", "+" },
{ "-=", "-" },
{ "*=", "*" },
{ "/=", "/" },
{ "%=", "%" },
{ "^=", "^" },
{ "---END---", "" } //Keep this line at the end of the list
};
std::map<std::string, std::string> setterMap;
// processes mutable array literals
Node array_lit_transform(Node node) {
std::string prefix = "_temp"+mkUniqueToken() + "_";
Metadata m = node.metadata;
std::map<std::string, Node> d;
std::string o = "(with $arr (alloc "+utd(node.args.size()*32+32)+")";
o += " (seq (mstore (get $arr) "+utd(node.args.size())+")";
for (unsigned i = 0; i < node.args.size(); i++) {
o += " (mstore (add (get $arr) "+utd(i * 32 + 32)+") $"+utd(i)+")";
d[utd(i)] = node.args[i];
}
o += " (add (get $arr) 32)))";
return subst(parseLLL(o), d, prefix, m);
}
Node logTransform(Node node, preprocessAux aux) {
Metadata m = node.metadata;
std::vector<Node> topics;
Node data;
bool usingData = false;
bool isDataString = false;
std::string type = "";
for (unsigned i = 0; i < node.args.size(); i++) {
if (node.args[i].val == "=") {
std::string v = node.args[i].args[0].val;
if (v == "data" || v == "datastr" || v == "dataarr") {
data = node.args[i].args[1];
usingData = true;
isDataString = (v == "datastr");
}
if (v == "type") {
type = node.args[i].args[1].val;
if (type[0] == '\"') type = type.substr(1, type.size() - 2);
}
}
else topics.push_back(node.args[i]);
}
// ABI logging
if (type != "") {
functionMetadata fm = aux.events[type];
std::vector<Node> indexedArgs;
std::vector<Node> serializedArgs;
strvec argTypes;
for (int i = 0; i < topics.size(); i++) {
if (fm.indexed[i]) {
if (fm.argTypes[i] == "string" || fm.argTypes[i] == "bytes") {
std::string varName = "__temp"+mkUniqueToken();
serializedArgs.push_back(asn("seq",
asn("set", tkn(varName), topics[i]),
asn("get", tkn(varName))));
indexedArgs.push_back(asn("sha3", asn(":", asn("get", tkn(varName)), tkn("str"))));
argTypes.push_back(fm.argTypes[i]);
}
else indexedArgs.push_back(topics[i]);
}
else {
serializedArgs.push_back(topics[i]);
argTypes.push_back(fm.argTypes[i]);
}
}
Node inner = asn("~log"+utd(indexedArgs.size()+1),
tkn("_datastart", m),
tkn("_datasz", m),
tkn(bytesToDecimal(fm.prefix), m),
m);
for (unsigned i = 0; i < indexedArgs.size(); i++) {
inner.args.push_back(indexedArgs[i]);
}
return packArguments(serializedArgs, argTypes, 0, inner, m, false);
}
// Standard (non-ABI) logging
if (topics.size() > 4) err("Too many topics!", m);
std::vector<Node> out;
if (usingData) {
out.push_back(tkn("_datarr", m));
out.push_back(isDataString
? asn("len", tkn("_datarr", m), m)
: asn("mul", tkn("32", m), asn("len", tkn("_datarr", m), m)));
}
else {
out.push_back(tkn("0", m));
out.push_back(tkn("0", m));
}
std::string t = utd(topics.size());
for (unsigned i = 0; i < topics.size(); i++)
out.push_back(topics[i]);
if (usingData)
return asn("with", tkn("_datarr", m), data, asn("~log"+t, out, m), m);
else
return asn("~log"+t, out, m);
}
// Processes long text literals
Node string_transform(Node node) {
std::string prefix = "_temp"+mkUniqueToken() + "_";
Metadata m = node.metadata;
if (!node.args.size())
err("Empty text!", m);
if (node.args[0].val.size() < 2
|| node.args[0].val[0] != '"'
|| node.args[0].val[node.args[0].val.size() - 1] != '"')
err("Text contents don't look like a string: "+node.args[0].val, m);
std::vector<uint8_t> bin =
strToBytes(node.args[0].val.substr(1, node.args[0].val.size() - 2));
unsigned sz = bin.size();
std::map<std::string, Node> d;
std::string o = "(with $str (alloc "+utd(bin.size() + 32)+")";
o += " (seq (mstore (get $str) "+utd(bin.size())+")";
for (unsigned i = 0; i < sz; i += 32) {
unsigned curpos = i;
std::string t = "0";
for (unsigned j = i; j < i + 32; j++) {
uint8_t x = j < sz ? bin[j] : 0;
t = decimalMul(t, "256");
t = decimalAdd(t, unsignedToDecimal(x));
}
o += " (mstore (add (get $str) "+utd(curpos + 32)+") "+t+")";
}
o += " (add (get $str) 32)))";
return subst(parseLLL(o), d, prefix, m);
}
Node apply_rules(preprocessResult pr);
// Process objects of the form "prefix(self.foo)", outputting
// the four prefix bytes
Node prefixTransform(Node node, preprocessAux aux) {
Metadata m = node.metadata;
Node callee = node.args[0].args[0];
Node funNode = node.args[0].args[1];
std::string functionName;
if (funNode.val == "::") {
if (funNode.args[0].type == ASTNODE
|| funNode.args[1].type == ASTNODE)
err("Function name must be a token: "+printSimple(funNode), m);
functionName = funNode.args[0].val + "::" + funNode.args[1].val;
}
else {
if (funNode.type == ASTNODE)
err("Function name must be a token: "+printSimple(funNode), m);
functionName = funNode.val;
}
// Determine the functionPrefix and sig if calling self
if (callee.val == "self") {
if (!aux.interns.count(functionName))
err("Invalid call: "+functionName, m);
return asn("mul",
asn("exp", tkn("2", m), tkn("224", m), m),
tkn(unsignedToDecimal(aux.interns[functionName].id), m));
}
// Determine the funId and sig otherwise
else {
if (!aux.externs.count(functionName))
err("Invalid call: "+functionName, m);
if (aux.externs[functionName].ambiguous)
err("Ambiguous call: "+functionName+". Please use the "
"functionName::sig(...) syntax to specify the signature "
"of the function you are using.", m);
return asn("mul",
asn("exp", tkn("2", m), tkn("224", m), m),
tkn(unsignedToDecimal(aux.externs[functionName].id), m));
}
err("Cannot get prefix", m);
}
// Transform "<variable>.<fun>(args...)" into
// a call
Node dotTransform(Node node, preprocessAux aux) {
Metadata m = node.metadata;
// We're gonna make lots of temporary variables,
// so set up a unique flag for them
std::string prefix = "_temp"+mkUniqueToken()+"_";
// Determine the callee and the name of the function we are calling
Node callee = node.args[0].args[0];
Node funNode = node.args[0].args[1];
std::string functionName;
if (funNode.val == "::") {
if (funNode.args[0].type == ASTNODE
|| funNode.args[1].type == ASTNODE)
err("Function name must be a token: "+printSimple(funNode), m);
functionName = funNode.args[0].val + "::" + funNode.args[1].val;
}
else {
if (funNode.type == ASTNODE)
err("Function name must be a token: "+printSimple(funNode), m);
functionName = funNode.val;
}
// kwargs = map of special arguments
std::map<std::string, Node> kwargs;
kwargs["value"] = token("0", m);
kwargs["gas"] = subst(parseLLL("(- (gas) 45)"), msn(), prefix, m);
// Search for as=? and call=code keywords, and isolate the actual
// function arguments
std::vector<Node> fnargs;
std::string op = "call";
for (unsigned i = 1; i < node.args.size(); i++) {
fnargs.push_back(node.args[i]);
Node arg = fnargs.back();
if (arg.val == "=" || arg.val == "set") {
if (arg.args[0].val == "as")
err("As keyword deprecated. To disambiguate overloaded "
"definitions, use the foo::sig syntax instead", m);
if (arg.args[0].val == "call" && arg.args[1].val == "code")
op = "callcode";
if (arg.args[0].val == "call" && arg.args[1].val == "delegate")
op = "delegatecall";
if (arg.args[0].val == "gas")
kwargs["gas"] = arg.args[1];
if (arg.args[0].val == "value") {
kwargs["value"] = arg.args[1];
kwargs["gas"] = subst(parseLLL("(- (gas) 9045)"), msn(), prefix, m);
}
if (arg.args[0].val == "outitems" || arg.args[0].val == "outsz")
kwargs["outitems"] = arg.args[1];
if (arg.args[0].val == "outchars")
kwargs["outchars"] = arg.args[1];
}
}
int functionPrefix = 0;
strvec argTypes;
std::string outType;
// Determine the functionPrefix and sig if calling self
if (callee.val == "self") {
if (!aux.interns.count(functionName))
err("Invalid call: "+functionName, m);
functionPrefix = aux.interns[functionName].id;
argTypes = aux.interns[functionName].argTypes;
outType = aux.interns[functionName].outType;
}
// Determine the funId and sig otherwise
else {
if (!aux.externs.count(functionName))
err("Invalid call: "+functionName, m);
if (aux.externs[functionName].ambiguous)
err("Ambiguous call: "+functionName+". Please use the "
"functionName::sig(...) syntax to specify the signature "
"of the function you are using.", m);
std::string key = unsignedToDecimal(aux.externs[functionName].id);
functionPrefix = aux.externs[functionName].id;
argTypes = aux.externs[functionName].argTypes;
outType = aux.externs[functionName].outType;
}
int outTypeVal;
if (isArrayType(outType)) outTypeVal = ARRAY;
else if (outType == "bytes" || outType == "string") outTypeVal = BYTES;
else if (outType == "") outTypeVal = 0;
else outTypeVal = STATIC;
// Type checks
if (outTypeVal == STATIC && (kwargs.count("outitems") || kwargs.count("outchars")))
err("Expecting int/addr/short-string output; "
"outitems or outchars keywords not valid", m);
if (outTypeVal == BYTES && kwargs.count("outitems"))
err("Expecting string, use outchars instead of outitems", m);
if (outTypeVal == BYTES && !kwargs.count("outchars"))
err("Please specify maximum string length with outchars", m);
if (outTypeVal == ARRAY && kwargs.count("outchars"))
err("Expecting array, use outitems instead of outchars", m);
if (outTypeVal == ARRAY && !kwargs.count("outitems"))
err("Please specify maximum array length with outitems", m);
// Pack arguments
kwargs["to"] = callee;
Node main;
// Pack output
if (!kwargs.count("outitems") && !kwargs.count("outchars")) {
main = parseLLL(
"(seq "
"(pop (~"+op+" $gas $to $value _datastart _datasz (ref $dataout) 32))"
"(get $dataout))");
}
else if (kwargs.count("outchars")) {
main = parseLLL(
"(with _outchars $outchars (with _out (alloc (add _outchars 64)) (seq "
"(pop (~"+op+" $gas $to $value _datastart _datasz _out (add 64 _outchars)))"
"(add (get _out) 64))))");
}
else {
main = parseLLL(
"(with _outitems $outitems (with _out (alloc (add (mul 32 _outitems) 64)) (seq "
"(pop (~"+op+" $gas $to $value _datastart _datasz _out (add 64 (mul 32 _outitems))))"
"(add (get _out) 64))))");
}
// Set up main call
Node inner = subst(main, kwargs, prefix, m);
return packArguments(fnargs, argTypes, functionPrefix, inner, m);
}
// Transform an access of the form self.bob, self.users[5], etc into
// a storage access
//
// There exist two types of objects: finite objects, and infinite
// objects. Finite objects are packed optimally tightly into storage
// accesses; for example:
//
// data obj[100](a, b[2][4], c)
//
// obj[0].a -> 0
// obj[0].b[0][0] -> 1
// obj[0].b[1][3] -> 8
// obj[45].c -> 459
//
// Infinite objects are accessed by sha3([v1, v2, v3 ... ]), where
// the values are a list of array indices and keyword indices, for
// example:
// data obj[](a, b[2][4], c)
// data obj2[](a, b[][], c)
//
// obj[0].a -> sha3([0, 0, 0])
// obj[5].b[1][3] -> sha3([0, 5, 1, 1, 3])
// obj[45].c -> sha3([0, 45, 2])
// obj2[0].a -> sha3([1, 0, 0])
// obj2[5].b[1][3] -> sha3([1, 5, 1, 1, 3])
// obj2[45].c -> sha3([1, 45, 2])
Node storageTransform(Node node, preprocessAux aux,
bool mapstyle=false, bool ref=false) {
Metadata m = node.metadata;
// Get a list of all of the "access parameters" used in order
// eg. self.users[5].cow[4][m[2]][woof] ->
// [--self, --users, 5, --cow, 4, m[2], woof]
std::vector<Node> hlist = listfyStorageAccess(node);
// For infinite arrays, the terms array will just provide a list
// of indices. For finite arrays, it's a list of index*coefficient
std::vector<Node> terms;
std::string offset = "0";
std::string prefix = "";
std::string varPrefix = "_temp"+mkUniqueToken()+"_";
int c = 0;
std::vector<std::string> coefficients;
coefficients.push_back("");
for (unsigned i = 1; i < hlist.size(); i++) {
// We pre-add the -- flag to parameter-like terms. For example,
// self.users[m] -> [--self, --users, m]
// self.users.m -> [--self, --users, --m]
if (hlist[i].val.substr(0, 2) == "--") {
prefix += hlist[i].val.substr(2) + ".";
std::string tempPrefix = prefix.substr(0, prefix.size()-1);
if (!aux.storageVars.offsets.count(tempPrefix))
return node;
if (c < (signed)coefficients.size() - 1)
err("Too few array index lookups", m);
if (c > (signed)coefficients.size() - 1)
err("Too many array index lookups", m);
coefficients = aux.storageVars.coefficients[tempPrefix];
// If the size of an object exceeds 2^176, we make it an infinite
// array
if (decimalGt(coefficients.back(), tt176) && !mapstyle)
return storageTransform(node, aux, true, ref);
offset = decimalAdd(offset, aux.storageVars.offsets[tempPrefix]);
c = 0;
if (mapstyle)
terms.push_back(token(unsignedToDecimal(
aux.storageVars.indices[tempPrefix])));
}
else if (mapstyle) {
terms.push_back(hlist[i]);
c += 1;
}
else {
if (c > (signed)coefficients.size() - 2)
err("Too many array index lookups", m);
terms.push_back(
astnode("mul",
hlist[i],
token(coefficients[coefficients.size() - 2 - c], m),
m));
c += 1;
}
}
if (aux.storageVars.nonfinal.count(prefix.substr(0, prefix.size()-1)))
err("Storage variable access not deep enough", m);
if (c < (signed)coefficients.size() - 1) {
err("Too few array index lookups", m);
}
if (c > (signed)coefficients.size() - 1) {
err("Too many array index lookups", m);
}
Node o;
if (mapstyle) {
std::string t = "_temp_"+mkUniqueToken();
std::vector<Node> sub;
for (unsigned i = 0; i < terms.size(); i++)
sub.push_back(asn("mstore",
asn("add",
tkn(utd(i * 32), m),
asn("get", tkn(t+"pos", m), m),
m),
terms[i],
m));
sub.push_back(tkn(t+"pos", m));
Node main = asn("with",
tkn(t+"pos", m),
asn("alloc", tkn(utd(terms.size() * 32), m), m),
asn("seq", sub, m),
m);
Node sz = token(utd(terms.size() * 32), m);
o = astnode("~sha3",
main,
sz,
m);
}
else {
// We add up all the index*coefficients
Node out = token(offset, node.metadata);
for (unsigned i = 0; i < terms.size(); i++) {
std::vector<Node> temp;
temp.push_back(out);
temp.push_back(terms[i]);
out = astnode("add", temp, node.metadata);
}
o = out;
}
if (ref) return o;
else return astnode("sload", o, node.metadata);
}
// Basic rewrite rule execution
std::pair<Node, bool> rulesTransform(Node node, rewriteRuleSet macros) {
std::string prefix = "_temp_"+mkUniqueToken();
bool changed = false;
if (!macros.ruleLists.count(node.val))
return std::pair<Node, bool>(node, false);
std::vector<rewriteRule> rules = macros.ruleLists[node.val];
for (unsigned pos = 0; pos < rules.size(); pos++) {
rewriteRule macro = rules[pos];
matchResult mr = match(macro.pattern, node);
if (mr.success) {
node = subst(macro.substitution, mr.map, prefix, node.metadata);
if (node.val == "error")
err(node.args[0].val, node.metadata);
std::pair<Node, bool> o = rulesTransform(node, macros);
o.second = true;
return o;
}
}
return std::pair<Node, bool>(node, changed);
}
std::pair<Node, bool> synonymTransform(Node node) {
bool changed = false;
if (node.type == ASTNODE && synonymMap.count(node.val)) {
node.val = synonymMap[node.val];
changed = true;
}
return std::pair<Node, bool>(node, changed);
}
rewriteRuleSet nodeMacros;
rewriteRuleSet setterMacros;
bool dontDescend(std::string s) {
return s == "macro" || s == "comment" || s == "outer";
}
// Recursively applies any set of rewrite rules
std::pair<Node, bool> apply_rules_iter(preprocessResult pr, rewriteRuleSet rules) {
bool changed = false;
Node node = pr.first;
if (dontDescend(node.val))
return std::pair<Node, bool>(node, false);
std::pair<Node, bool> o = rulesTransform(node, rules);
node = o.first;
changed = changed || o.second;
if (node.type == ASTNODE) {
for (unsigned i = 0; i < node.args.size(); i++) {
std::pair<Node, bool> r =
apply_rules_iter(preprocessResult(node.args[i], pr.second), rules);
node.args[i] = r.first;
changed = changed || r.second;
}
}
return std::pair<Node, bool>(node, changed);
}
// Recursively applies rewrite rules and other primary transformations
std::pair<Node, bool> mainTransform(preprocessResult pr) {
bool changed = false;
Node node = pr.first;
// Anything inside "outer" should be treated as a separate program
// and thus recursively compiled in its entirety
if (node.val == "outer") {
node = apply_rules(preprocess(node.args[0]));
changed = true;
}
// Don't descend into comments, macros and inner scopes
if (dontDescend(node.val))
return std::pair<Node, bool>(node, changed);
// Special storage transformation
if (isNodeStorageVariable(node)) {
node = storageTransform(node, pr.second);
changed = true;
}
if (node.val == "ref" && isNodeStorageVariable(node.args[0])) {
node = storageTransform(node.args[0], pr.second, false, true);
changed = true;
}
if (node.val == "=" && isNodeStorageVariable(node.args[0])) {
Node t = storageTransform(node.args[0], pr.second);
if (t.val == "sload") {
std::vector<Node> o;
o.push_back(t.args[0]);
o.push_back(node.args[1]);
node = astnode("sstore", o, node.metadata);
}
changed = true;
}
// Main code
std::pair<Node, bool> pnb = synonymTransform(node);
node = pnb.first;
changed = changed || pnb.second;
// std::cerr << priority << " " << macros.size() << "\n";
std::pair<Node, bool> pnc = rulesTransform(node, nodeMacros);
node = pnc.first;
changed = changed || pnc.second;
// Special transformations
if (node.val == "log") {
node = logTransform(node, pr.second);
changed = true;
}
if (node.val == "array_lit") {
node = array_lit_transform(node);
changed = true;
}
if (node.val == "fun" && node.args[0].val == ".") {
node = dotTransform(node, pr.second);
changed = true;
}
if (node.val == "prefix" && node.type == ASTNODE) {
node = prefixTransform(node, pr.second);
changed = true;
}
if (node.val == "text") {
node = string_transform(node);
changed = true;
}
if (node.type == ASTNODE) {
unsigned i = 0;
// Arg 0 of all of these is a variable, so should not be changed
if (node.val == "set" || node.val == "ref"
|| node.val == "get" || node.val == "with") {
if (node.args[0].type == TOKEN &&
node.args[0].val.size() > 0 && node.args[0].val[0] != '\'') {
node.args[0].val = "'" + node.args[0].val;
changed = true;
}
i = 1;
}
// Recursively process children
for (; i < node.args.size(); i++) {
std::pair<Node, bool> r =
mainTransform(preprocessResult(node.args[i], pr.second));
node.args[i] = r.first;
changed = changed || r.second;
}
}
// Add leading ' to variable names, and wrap them inside get
else if (node.type == TOKEN && !isNumberLike(node)) {
if (node.val.size() && node.val[0] != '\'' && node.val[0] != '$') {
Node n = astnode("get", tkn("'"+node.val), node.metadata);
node = n;
changed = true;
}
}
// Convert all numbers to normalized form
else if (node.type == TOKEN && isNumberLike(node) && !isDecimal(node.val)) {
node.val = strToNumeric(node.val, 32);
changed = true;
}
return std::pair<Node, bool>(node, changed);
}
// Do some preprocessing to convert all of our macro lists into compiled
// forms that can then be reused
void parseMacros() {