This repository has been archived by the owner on May 13, 2022. It is now read-only.
/
vm.go
1105 lines (963 loc) · 33.6 KB
/
vm.go
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 2017 Monax Industries Limited
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package evm
import (
"bytes"
"fmt"
"io/ioutil"
"math/big"
"strings"
"github.com/hyperledger/burrow/execution/evm/abi"
"github.com/hyperledger/burrow/acm"
"github.com/hyperledger/burrow/acm/acmstate"
. "github.com/hyperledger/burrow/binary"
"github.com/hyperledger/burrow/crypto"
"github.com/hyperledger/burrow/crypto/sha3"
"github.com/hyperledger/burrow/execution/errors"
. "github.com/hyperledger/burrow/execution/evm/asm"
"github.com/hyperledger/burrow/execution/exec"
"github.com/hyperledger/burrow/logging"
"github.com/hyperledger/burrow/permission"
"github.com/hyperledger/burrow/txs"
)
const (
DataStackInitialCapacity = 1024
MaximumAllowedBlockLookBack = 256
uint64Length = 8
)
type Params struct {
BlockHeight uint64
BlockTime int64
GasLimit uint64
CallStackMaxDepth uint64
DataStackInitialCapacity uint64
DataStackMaxDepth uint64
}
type VM struct {
memoryProvider func(errors.Sink) Memory
params Params
origin crypto.Address
nonce []byte
stackDepth uint64
logger *logging.Logger
debugOpcodes bool
dumpTokens bool
sequence uint64
}
// Create a new EVM instance. Nonce is required to be globally unique (nearly almost surely) to avoid duplicate
// addresses for EVM created accounts. In Burrow we use TxHash for this but a random nonce or sequence number could be
// used.
func NewVM(params Params, origin crypto.Address, nonce []byte, logger *logging.Logger, options ...func(*VM)) *VM {
vm := &VM{
memoryProvider: DefaultDynamicMemoryProvider,
params: params,
origin: origin,
stackDepth: 0,
nonce: nonce,
logger: logger.WithScope("NewVM"),
}
for _, option := range options {
option(vm)
}
return vm
}
func (vm *VM) Debugf(format string, a ...interface{}) {
// Uncomment for quick and dirty debug
//fmt.Printf(format, a...)
if vm.debugOpcodes {
vm.logger.TraceMsg(fmt.Sprintf(format, a...), "tag", "DebugOpcodes")
}
}
// CONTRACT: it is the duty of the contract writer to call known permissions
// we do not convey if a permission is not set
// (unlike in state/execution, where we guarantee HasPermission is called
// on known permissions and panics else)
// If the perm is not defined in the acc nor set by default in GlobalPermissions,
// this function returns false.
func HasPermission(st Interface, address crypto.Address, perm permission.PermFlag) bool {
globalPerms := st.GetPermissions(acm.GlobalPermissionsAddress)
accPerms := st.GetPermissions(address)
perms := accPerms.Base.Compose(globalPerms.Base)
value, err := perms.Get(perm)
if err != nil {
return false
}
return value
}
func EnsurePermission(st Interface, address crypto.Address, perm permission.PermFlag) {
if !HasPermission(st, address, perm) {
st.PushError(errors.PermissionDenied{
Address: address,
Perm: perm,
})
}
}
func (vm *VM) fireCallEvent(eventSink EventSink, callType exec.CallType, errProvider errors.Provider, output *[]byte,
callerAddress, calleeAddress crypto.Address, input []byte, value uint64, gas *uint64, errSink errors.Sink) {
// fire the post call event (including exception if applicable)
eventErr := eventSink.Call(&exec.CallEvent{
CallType: callType,
CallData: &exec.CallData{
Caller: callerAddress,
Callee: calleeAddress,
Data: input,
Value: value,
Gas: *gas,
},
Origin: vm.origin,
StackDepth: vm.stackDepth,
Return: *output,
}, errors.AsException(errProvider.Error()))
errSink.PushError(eventErr)
}
// CONTRACT state is aware of caller and callee, so we can just mutate them.
// CONTRACT code and input are not mutated.
// CONTRACT returned 'ret' is a new compact slice.
// value: To be transferred from caller to callee. Refunded upon errors.CodedError.
// gas: Available gas. No refunds for gas.
// code: May be nil, since the CALL opcode may be used to send value from contracts to accounts
func (vm *VM) Call(callState Interface, eventSink EventSink, caller, callee crypto.Address, code,
input []byte, value uint64, gas *uint64) (output []byte, err errors.CodedError) {
// Always return output - we may have a reverted exception for which the return is meaningful
output, err = vm.call(callState, eventSink, caller, callee, code, input, value, gas, exec.CallTypeCall)
if err == nil {
err = callState.Error()
}
return
}
func (vm *VM) call(callState Interface, eventSink EventSink, caller, callee crypto.Address, code,
input []byte, value uint64, gas *uint64, callType exec.CallType) (output []byte, err errors.CodedError) {
// fire the post call event (including exception if applicable) and make sure we return the accumulated call error
defer func() {
vm.fireCallEvent(eventSink, callType, callState, &output, caller, callee, input, value, gas, callState)
err = callState.Error()
}()
callState.PushError(transfer(callState, caller, callee, value))
callState.PushError(vm.ensureStackDepth())
// Early exit
if callState.Error() != nil {
return
}
if len(code) > 0 {
vm.stackDepth += 1
output = vm.execute(callState, eventSink, caller, callee, code, input, value, gas)
vm.stackDepth -= 1
if err != nil {
callState.PushError(err)
callState.PushError(transfer(callState, callee, caller, value))
}
}
return
}
// DelegateCall is executed by the DELEGATECALL opcode, introduced as off Ethereum Homestead.
// The intent of delegate call is to run the code of the callee in the storage context of the caller;
// while preserving the original caller to the previous callee.
// Different to the normal CALL or CALLCODE, the value does not need to be transferred to the callee.
func (vm *VM) delegateCall(callState Interface, eventSink EventSink, caller, callee crypto.Address,
code, input []byte, value uint64, gas *uint64,
callType exec.CallType) (output []byte, err errors.CodedError) {
// fire the post call event (including exception if applicable) and make sure we return the accumulated call error
defer func() {
vm.fireCallEvent(eventSink, callType, callState, &output, caller, callee, input, value, gas, callState)
err = callState.Error()
}()
// DelegateCall does not transfer the value to the callee.
callState.PushError(vm.ensureStackDepth())
// Early exit
if callState.Error() != nil {
return
}
if len(code) > 0 {
vm.stackDepth += 1
output = vm.execute(callState, eventSink, caller, callee, code, input, value, gas)
vm.stackDepth -= 1
}
return
}
// Try to deduct gasToUse from gasLeft. If ok return false, otherwise
// set err and return true.
func useGasNegative(gasLeft *uint64, gasToUse uint64, err errors.Sink) {
if *gasLeft >= gasToUse {
*gasLeft -= gasToUse
} else {
err.PushError(errors.ErrorCodeInsufficientGas)
}
}
// Executes the EVM code passed in the appropriate context
func (vm *VM) execute(callState Interface, eventSink EventSink, caller, callee crypto.Address,
code, input []byte, value uint64, gas *uint64) (returnData []byte) {
vm.Debugf("(%d) (%s) %s (code=%d) gas: %v (d) %X\n", vm.stackDepth, caller, callee, len(code), *gas, input)
logger := vm.logger.With("evm_nonce", vm.nonce)
if vm.dumpTokens {
dumpTokens(vm.nonce, caller, callee, code)
}
// Program counter - the index into code that tracks current instruction
pc := int64(0)
// Provide stack and memory storage - passing in the callState as an error provider
stack := NewStack(vm.params.DataStackInitialCapacity, vm.params.DataStackMaxDepth, gas, callState)
memory := vm.memoryProvider(callState)
for {
// Check for any error accrued to state
if callState.Error() != nil {
return
}
var op = codeGetOp(code, pc)
vm.Debugf("(pc) %-3d (op) %-14s (st) %-4d (gas) %d", pc, op.String(), stack.Len(), *gas)
// Use BaseOp gas.
useGasNegative(gas, GasBaseOp, callState)
switch op {
case ADD: // 0x01
x, y := stack.PopBigInt(), stack.PopBigInt()
sum := new(big.Int).Add(x, y)
res := stack.PushBigInt(sum)
vm.Debugf(" %v + %v = %v (%X)\n", x, y, sum, res)
case MUL: // 0x02
x, y := stack.PopBigInt(), stack.PopBigInt()
prod := new(big.Int).Mul(x, y)
res := stack.PushBigInt(prod)
vm.Debugf(" %v * %v = %v (%X)\n", x, y, prod, res)
case SUB: // 0x03
x, y := stack.PopBigInt(), stack.PopBigInt()
diff := new(big.Int).Sub(x, y)
res := stack.PushBigInt(diff)
vm.Debugf(" %v - %v = %v (%X)\n", x, y, diff, res)
case DIV: // 0x04
x, y := stack.PopBigInt(), stack.PopBigInt()
if y.Sign() == 0 {
stack.Push(Zero256)
vm.Debugf(" %x / %x = %v\n", x, y, 0)
} else {
div := new(big.Int).Div(x, y)
res := stack.PushBigInt(div)
vm.Debugf(" %v / %v = %v (%X)\n", x, y, div, res)
}
case SDIV: // 0x05
x, y := stack.PopBigIntSigned(), stack.PopBigIntSigned()
if y.Sign() == 0 {
stack.Push(Zero256)
vm.Debugf(" %x / %x = %v\n", x, y, 0)
} else {
div := new(big.Int).Div(x, y)
res := stack.PushBigInt(div)
vm.Debugf(" %v / %v = %v (%X)\n", x, y, div, res)
}
case MOD: // 0x06
x, y := stack.PopBigInt(), stack.PopBigInt()
if y.Sign() == 0 {
stack.Push(Zero256)
vm.Debugf(" %v %% %v = %v\n", x, y, 0)
} else {
mod := new(big.Int).Mod(x, y)
res := stack.PushBigInt(mod)
vm.Debugf(" %v %% %v = %v (%X)\n", x, y, mod, res)
}
case SMOD: // 0x07
x, y := stack.PopBigIntSigned(), stack.PopBigIntSigned()
if y.Sign() == 0 {
stack.Push(Zero256)
vm.Debugf(" %v %% %v = %v\n", x, y, 0)
} else {
mod := new(big.Int).Mod(x, y)
res := stack.PushBigInt(mod)
vm.Debugf(" %v %% %v = %v (%X)\n", x, y, mod, res)
}
case ADDMOD: // 0x08
x, y, z := stack.PopBigInt(), stack.PopBigInt(), stack.PopBigInt()
if z.Sign() == 0 {
stack.Push(Zero256)
vm.Debugf(" %v %% %v = %v\n", x, y, 0)
} else {
add := new(big.Int).Add(x, y)
mod := add.Mod(add, z)
res := stack.PushBigInt(mod)
vm.Debugf(" %v + %v %% %v = %v (%X)\n", x, y, z, mod, res)
}
case MULMOD: // 0x09
x, y, z := stack.PopBigInt(), stack.PopBigInt(), stack.PopBigInt()
if z.Sign() == 0 {
stack.Push(Zero256)
vm.Debugf(" %v %% %v = %v\n", x, y, 0)
} else {
mul := new(big.Int).Mul(x, y)
mod := mul.Mod(mul, z)
res := stack.PushBigInt(mod)
vm.Debugf(" %v * %v %% %v = %v (%X)\n", x, y, z, mod, res)
}
case EXP: // 0x0A
x, y := stack.PopBigInt(), stack.PopBigInt()
pow := new(big.Int).Exp(x, y, nil)
res := stack.PushBigInt(pow)
vm.Debugf(" %v ** %v = %v (%X)\n", x, y, pow, res)
case SIGNEXTEND: // 0x0B
back := stack.PopU64()
if back < Word256Length-1 {
stack.PushBigInt(SignExtend(back, stack.PopBigInt()))
}
case LT: // 0x10
x, y := stack.PopBigInt(), stack.PopBigInt()
if x.Cmp(y) < 0 {
stack.Push(One256)
vm.Debugf(" %v < %v = %v\n", x, y, 1)
} else {
stack.Push(Zero256)
vm.Debugf(" %v < %v = %v\n", x, y, 0)
}
case GT: // 0x11
x, y := stack.PopBigInt(), stack.PopBigInt()
if x.Cmp(y) > 0 {
stack.Push(One256)
vm.Debugf(" %v > %v = %v\n", x, y, 1)
} else {
stack.Push(Zero256)
vm.Debugf(" %v > %v = %v\n", x, y, 0)
}
case SLT: // 0x12
x, y := stack.PopBigIntSigned(), stack.PopBigIntSigned()
if x.Cmp(y) < 0 {
stack.Push(One256)
vm.Debugf(" %v < %v = %v\n", x, y, 1)
} else {
stack.Push(Zero256)
vm.Debugf(" %v < %v = %v\n", x, y, 0)
}
case SGT: // 0x13
x, y := stack.PopBigIntSigned(), stack.PopBigIntSigned()
if x.Cmp(y) > 0 {
stack.Push(One256)
vm.Debugf(" %v > %v = %v\n", x, y, 1)
} else {
stack.Push(Zero256)
vm.Debugf(" %v > %v = %v\n", x, y, 0)
}
case EQ: // 0x14
x, y := stack.Pop(), stack.Pop()
if bytes.Equal(x[:], y[:]) {
stack.Push(One256)
vm.Debugf(" %X == %X = %v\n", x, y, 1)
} else {
stack.Push(Zero256)
vm.Debugf(" %X == %X = %v\n", x, y, 0)
}
case ISZERO: // 0x15
x := stack.Pop()
if x.IsZero() {
stack.Push(One256)
vm.Debugf(" %X == 0 = %v\n", x, 1)
} else {
stack.Push(Zero256)
vm.Debugf(" %X == 0 = %v\n", x, 0)
}
case AND: // 0x16
x, y := stack.Pop(), stack.Pop()
z := [32]byte{}
for i := 0; i < 32; i++ {
z[i] = x[i] & y[i]
}
stack.Push(z)
vm.Debugf(" %X & %X = %X\n", x, y, z)
case OR: // 0x17
x, y := stack.Pop(), stack.Pop()
z := [32]byte{}
for i := 0; i < 32; i++ {
z[i] = x[i] | y[i]
}
stack.Push(z)
vm.Debugf(" %X | %X = %X\n", x, y, z)
case XOR: // 0x18
x, y := stack.Pop(), stack.Pop()
z := [32]byte{}
for i := 0; i < 32; i++ {
z[i] = x[i] ^ y[i]
}
stack.Push(z)
vm.Debugf(" %X ^ %X = %X\n", x, y, z)
case NOT: // 0x19
x := stack.Pop()
z := [32]byte{}
for i := 0; i < 32; i++ {
z[i] = ^x[i]
}
stack.Push(z)
vm.Debugf(" !%X = %X\n", x, z)
case BYTE: // 0x1A
idx := stack.Pop64()
val := stack.Pop()
res := byte(0)
if idx < 32 {
res = val[idx]
}
stack.Push64(int64(res))
vm.Debugf(" => 0x%X\n", res)
case SHL: //0x1B
shift, x := stack.PopBigInt(), stack.PopBigInt()
if shift.Cmp(Big256) >= 0 {
reset := big.NewInt(0)
stack.PushBigInt(reset)
vm.Debugf(" %v << %v = %v\n", x, shift, reset)
} else {
shiftedValue := x.Lsh(x, uint(shift.Uint64()))
stack.PushBigInt(shiftedValue)
vm.Debugf(" %v << %v = %v\n", x, shift, shiftedValue)
}
case SHR: //0x1C
shift, x := stack.PopBigInt(), stack.PopBigInt()
if shift.Cmp(Big256) >= 0 {
reset := big.NewInt(0)
stack.PushBigInt(reset)
vm.Debugf(" %v << %v = %v\n", x, shift, reset)
} else {
shiftedValue := x.Rsh(x, uint(shift.Uint64()))
stack.PushBigInt(shiftedValue)
vm.Debugf(" %v << %v = %v\n", x, shift, shiftedValue)
}
case SAR: //0x1D
shift, x := stack.PopBigInt(), stack.PopBigIntSigned()
if shift.Cmp(Big256) >= 0 {
reset := big.NewInt(0)
if x.Sign() < 0 {
reset.SetInt64(-1)
}
stack.PushBigInt(reset)
vm.Debugf(" %v << %v = %v\n", x, shift, reset)
} else {
shiftedValue := x.Rsh(x, uint(shift.Uint64()))
stack.PushBigInt(shiftedValue)
vm.Debugf(" %v << %v = %v\n", x, shift, shiftedValue)
}
case SHA3: // 0x20
useGasNegative(gas, GasSha3, callState)
offset, size := stack.PopBigInt(), stack.PopBigInt()
data := memory.Read(offset, size)
data = sha3.Sha3(data)
stack.PushBytes(data)
vm.Debugf(" => (%v) %X\n", size, data)
case ADDRESS: // 0x30
stack.Push(callee.Word256())
vm.Debugf(" => %X\n", callee)
case BALANCE: // 0x31
address := stack.PopAddress()
useGasNegative(gas, GasGetAccount, callState)
balance := callState.GetBalance(address)
stack.PushU64(balance)
vm.Debugf(" => %v (%X)\n", balance, address)
case ORIGIN: // 0x32
stack.Push(vm.origin.Word256())
vm.Debugf(" => %X\n", vm.origin)
case CALLER: // 0x33
stack.Push(caller.Word256())
vm.Debugf(" => %X\n", caller)
case CALLVALUE: // 0x34
stack.PushU64(value)
vm.Debugf(" => %v\n", value)
case CALLDATALOAD: // 0x35
offset := stack.Pop64()
data := subslice(input, offset, 32, callState)
res := LeftPadWord256(data)
stack.Push(res)
vm.Debugf(" => 0x%X\n", res)
case CALLDATASIZE: // 0x36
stack.Push64(int64(len(input)))
vm.Debugf(" => %d\n", len(input))
case CALLDATACOPY: // 0x37
memOff := stack.PopBigInt()
inputOff := stack.Pop64()
length := stack.Pop64()
data := subslice(input, inputOff, length, callState)
memory.Write(memOff, data)
vm.Debugf(" => [%v, %v, %v] %X\n", memOff, inputOff, length, data)
case CODESIZE: // 0x38
l := int64(len(code))
stack.Push64(l)
vm.Debugf(" => %d\n", l)
case CODECOPY: // 0x39
memOff := stack.PopBigInt()
codeOff := stack.Pop64()
length := stack.Pop64()
data := subslice(code, codeOff, length, callState)
memory.Write(memOff, data)
vm.Debugf(" => [%v, %v, %v] %X\n", memOff, codeOff, length, data)
case GASPRICE_DEPRECATED: // 0x3A
stack.Push(Zero256)
vm.Debugf(" => %X (GASPRICE IS DEPRECATED)\n", Zero256)
case EXTCODESIZE: // 0x3B
address := stack.PopAddress()
useGasNegative(gas, GasGetAccount, callState)
if callState.Exists(address) {
code := callState.GetCode(address)
l := int64(len(code))
stack.Push64(l)
vm.Debugf(" => %d\n", l)
} else {
if _, ok := registeredNativeContracts[address]; !ok {
callState.PushError(errors.ErrorCodeUnknownAddress)
continue
}
vm.Debugf(" => returning code size of 1 to indicated existence of native contract at %X\n", address)
stack.Push(One256)
}
case EXTCODECOPY: // 0x3C
address := stack.PopAddress()
useGasNegative(gas, GasGetAccount, callState)
if !callState.Exists(address) {
if _, ok := registeredNativeContracts[address]; ok {
vm.Debugf(" => attempted to copy native contract at %v but this is not supported\n", address)
callState.PushError(errors.ErrorCodeNativeContractCodeCopy)
}
callState.PushError(errors.ErrorCodeUnknownAddress)
continue
}
code := callState.GetCode(address)
memOff := stack.PopBigInt()
codeOff := stack.Pop64()
length := stack.Pop64()
data := subslice(code, codeOff, length, callState)
memory.Write(memOff, data)
vm.Debugf(" => [%v, %v, %v] %X\n", memOff, codeOff, length, data)
case RETURNDATASIZE: // 0x3D
stack.Push64(int64(len(returnData)))
vm.Debugf(" => %d\n", len(returnData))
case RETURNDATACOPY: // 0x3E
memOff, outputOff, length := stack.PopBigInt(), stack.PopBigInt(), stack.PopBigInt()
end := new(big.Int).Add(outputOff, length)
if end.BitLen() > 64 || uint64(len(returnData)) < end.Uint64() {
callState.PushError(errors.ErrorCodeReturnDataOutOfBounds)
continue
}
memory.Write(memOff, returnData)
vm.Debugf(" => [%v, %v, %v] %X\n", memOff, outputOff, length, returnData)
case EXTCODEHASH: // 0x3F
address := stack.PopAddress()
if !callState.Exists(address) {
// In case the account does not exist 0 is pushed to the stack.
stack.PushU64(0)
} else {
code := callState.GetCode(address)
if code == nil {
// In case the account does not have code the keccak256 hash of empty data
code = acm.Bytecode{}
}
// keccak256 hash of a contract's code
var extcodehash Word256
hash := sha3.NewKeccak256()
hash.Write(code)
copy(extcodehash[:], hash.Sum(nil))
stack.Push(extcodehash)
}
case BLOCKHASH: // 0x40
blockNumber := stack.PopU64()
if blockNumber >= vm.params.BlockHeight {
vm.Debugf(" => attempted to get block hash of a non-existent block: %v", blockNumber)
callState.PushError(errors.ErrorCodeInvalidBlockNumber)
} else if vm.params.BlockHeight-blockNumber > MaximumAllowedBlockLookBack {
vm.Debugf(" => attempted to get block hash of a block %d outside of the allowed range "+
"(must be within %d blocks)", blockNumber, MaximumAllowedBlockLookBack)
callState.PushError(errors.ErrorCodeBlockNumberOutOfRange)
} else {
blockHash, err := callState.GetBlockHash(blockNumber)
if err != nil {
vm.Debugf(" => error attempted to get block hash: %v, %v", blockNumber, err)
callState.PushError(errors.ErrorCodeInvalidBlockNumber)
} else {
stack.Push(blockHash)
vm.Debugf(" => 0x%X\n", blockHash)
}
}
case COINBASE: // 0x41
stack.Push(Zero256)
vm.Debugf(" => 0x%X (NOT SUPPORTED)\n", stack.Peek().Bytes())
case TIMESTAMP: // 0x42
time := vm.params.BlockTime
stack.Push64(int64(time))
vm.Debugf(" => 0x%X\n", time)
case BLOCKHEIGHT: // 0x43
number := vm.params.BlockHeight
stack.PushU64(number)
vm.Debugf(" => 0x%X\n", number)
case GASLIMIT: // 0x45
stack.PushU64(vm.params.GasLimit)
vm.Debugf(" => %v\n", vm.params.GasLimit)
case POP: // 0x50
popped := stack.Pop()
vm.Debugf(" => 0x%X\n", popped)
case MLOAD: // 0x51
offset := stack.PopBigInt()
data := memory.Read(offset, BigWord256Length)
stack.Push(LeftPadWord256(data))
vm.Debugf(" => 0x%X @ 0x%X\n", data, offset)
case MSTORE: // 0x52
offset, data := stack.PopBigInt(), stack.Pop()
memory.Write(offset, data.Bytes())
vm.Debugf(" => 0x%X @ 0x%X\n", data, offset)
case MSTORE8: // 0x53
offset := stack.PopBigInt()
val64 := stack.Pop64()
val := byte(val64 & 0xFF)
memory.Write(offset, []byte{val})
vm.Debugf(" => [%v] 0x%X\n", offset, val)
case SLOAD: // 0x54
loc := stack.Pop()
data := callState.GetStorage(callee, loc)
stack.Push(data)
vm.Debugf("%s {0x%X = 0x%X}\n", callee, loc, data)
case SSTORE: // 0x55
loc, data := stack.Pop(), stack.Pop()
useGasNegative(gas, GasStorageUpdate, callState)
callState.SetStorage(callee, loc, data)
vm.Debugf("%s {0x%X := 0x%X}\n", callee, loc, data)
case JUMP: // 0x56
to := stack.Pop64()
vm.jump(code, to, &pc, callState)
continue
case JUMPI: // 0x57
pos := stack.Pop64()
cond := stack.Pop()
if !cond.IsZero() {
vm.jump(code, pos, &pc, callState)
continue
}
vm.Debugf(" ~> false\n")
case PC: // 0x58
stack.Push64(pc)
case MSIZE: // 0x59
// Note: Solidity will write to this offset expecting to find guaranteed
// free memory to be allocated for it if a subsequent MSTORE is made to
// this offset.
capacity := memory.Capacity()
stack.PushBigInt(capacity)
vm.Debugf(" => 0x%X\n", capacity)
case GAS: // 0x5A
stack.PushU64(*gas)
vm.Debugf(" => %X\n", *gas)
case JUMPDEST: // 0x5B
vm.Debugf("\n")
// Do nothing
case PUSH1, PUSH2, PUSH3, PUSH4, PUSH5, PUSH6, PUSH7, PUSH8, PUSH9, PUSH10, PUSH11, PUSH12, PUSH13, PUSH14, PUSH15, PUSH16, PUSH17, PUSH18, PUSH19, PUSH20, PUSH21, PUSH22, PUSH23, PUSH24, PUSH25, PUSH26, PUSH27, PUSH28, PUSH29, PUSH30, PUSH31, PUSH32:
a := int64(op - PUSH1 + 1)
codeSegment := subslice(code, pc+1, a, callState)
res := LeftPadWord256(codeSegment)
stack.Push(res)
pc += a
vm.Debugf(" => 0x%X\n", res)
case DUP1, DUP2, DUP3, DUP4, DUP5, DUP6, DUP7, DUP8, DUP9, DUP10, DUP11, DUP12, DUP13, DUP14, DUP15, DUP16:
n := int(op - DUP1 + 1)
stack.Dup(n)
vm.Debugf(" => [%d] 0x%X\n", n, stack.Peek().Bytes())
case SWAP1, SWAP2, SWAP3, SWAP4, SWAP5, SWAP6, SWAP7, SWAP8, SWAP9, SWAP10, SWAP11, SWAP12, SWAP13, SWAP14, SWAP15, SWAP16:
n := int(op - SWAP1 + 2)
stack.Swap(n)
vm.Debugf(" => [%d] %X\n", n, stack.Peek())
case LOG0, LOG1, LOG2, LOG3, LOG4:
n := int(op - LOG0)
topics := make([]Word256, n)
offset, size := stack.PopBigInt(), stack.PopBigInt()
for i := 0; i < n; i++ {
topics[i] = stack.Pop()
}
data := memory.Read(offset, size)
callState.PushError(eventSink.Log(&exec.LogEvent{
Address: callee,
Topics: topics,
Data: data,
}))
vm.Debugf(" => T:%X D:%X\n", topics, data)
case CREATE, CREATE2: // 0xF0, 0xFB
returnData = nil
contractValue := stack.PopU64()
offset, size := stack.PopBigInt(), stack.PopBigInt()
input := memory.Read(offset, size)
// TODO charge for gas to create account _ the code length * GasCreateByte
useGasNegative(gas, GasCreateAccount, callState)
var newAccount crypto.Address
if op == CREATE {
vm.sequence++
nonce := make([]byte, txs.HashLength+uint64Length)
copy(nonce, vm.nonce)
PutUint64BE(nonce[txs.HashLength:], vm.sequence)
newAccount = crypto.NewContractAddress(callee, nonce)
} else if op == CREATE2 {
salt := stack.Pop()
newAccount = crypto.NewContractAddress2(callee, salt, callState.GetCode(callee))
}
// Check the CreateContract permission for this account
EnsurePermission(callState, callee, permission.CreateContract)
if callState.Error() != nil {
continue
}
// Establish a frame in which the putative account exists
childCallState := callState.NewCache()
create(childCallState, newAccount)
// Run the input to get the contract code.
// NOTE: no need to copy 'input' as per Call contract.
ret, callErr := vm.Call(childCallState, eventSink, callee, newAccount, input, input, contractValue, gas)
if callErr != nil {
stack.Push(Zero256)
// Note we both set the return buffer and return the result normally
returnData = ret
} else {
// Update the account with its initialised contract code
childCallState.InitCode(newAccount, ret)
callState.PushError(childCallState.Sync())
stack.PushAddress(newAccount)
}
case CALL, CALLCODE, DELEGATECALL, STATICCALL: // 0xF1, 0xF2, 0xF4, 0xFA
returnData = nil
EnsurePermission(callState, callee, permission.Call)
if callState.Error() != nil {
continue
}
gasLimit := stack.PopU64()
address := stack.PopAddress()
// NOTE: for DELEGATECALL value is preserved from the original
// caller, as such it is not stored on stack as an argument
// for DELEGATECALL and should not be popped. Instead previous
// caller value is used. for CALL and CALLCODE value is stored
// on stack and needs to be overwritten from the given value.
if op != DELEGATECALL && op != STATICCALL {
value = stack.PopU64()
}
// inputs
inOffset, inSize := stack.PopBigInt(), stack.PopBigInt()
// outputs
retOffset := stack.PopBigInt()
retSize := stack.Pop64()
vm.Debugf(" => %v\n", address)
// Get the arguments from the memory
args := memory.Read(inOffset, inSize)
// Ensure that gasLimit is reasonable
if *gas < gasLimit {
// EIP150 - the 63/64 rule - rather than errors.CodedError we pass this specified fraction of the total available gas
gasLimit = *gas - *gas/64
}
// NOTE: we will return any used gas later.
*gas -= gasLimit
// Begin execution
var callErr errors.CodedError
// Establish a stack frame and perform the call
var childCallState Interface
if IsRegisteredNativeContract(address) {
// Native contract
childCallState = callState.NewCache()
returnData, callErr = ExecuteNativeContract(address, childCallState, callee, args, &gasLimit, logger)
childCallState.PushError(callErr)
// for now we fire the Call event. maybe later we'll fire more particulars
// NOTE: these fire call go_events and not particular go_events for eg name reg or permissions
vm.fireCallEvent(eventSink, exec.CallTypeSNative, childCallState, &returnData, callee, address, args, value,
&gasLimit, childCallState)
} else {
// EVM contract
useGasNegative(gas, GasGetAccount, callState)
// since CALL is used also for sending funds,
// acc may not exist yet. This is an errors.CodedError for
// CALLCODE, but not for CALL, though I don't think
// ethereum actually cares
if !callState.Exists(address) {
if op != CALL {
callState.PushError(errors.ErrorCodeUnknownAddress)
continue
}
// We're sending funds to a new account so we must create it first
createAccount(callState, callee, address)
if callState.Error() != nil {
continue
}
}
switch op {
case CALL:
childCallState = callState.NewCache()
returnData, callErr = vm.call(childCallState, eventSink, callee, address, callState.GetCode(address),
args, value, &gasLimit, exec.CallTypeCall)
case CALLCODE:
childCallState = callState.NewCache()
returnData, callErr = vm.call(childCallState, eventSink, callee, callee, callState.GetCode(address),
args, value, &gasLimit, exec.CallTypeCode)
case DELEGATECALL:
childCallState = callState.NewCache()
returnData, callErr = vm.delegateCall(childCallState, eventSink, caller, callee,
callState.GetCode(address), args, value, &gasLimit, exec.CallTypeDelegate)
case STATICCALL:
childCallState = callState.NewCache(acmstate.ReadOnly)
returnData, callErr = vm.delegateCall(childCallState, NewLogFreeEventSink(eventSink),
callee, address, callState.GetCode(address), args, value, &gasLimit, exec.CallTypeStatic)
default:
panic(fmt.Errorf("switch statement should be exhaustive so this should not have been reached"))
}
}
if callErr == nil {
// Sync error is a hard stop
callState.PushError(childCallState.Sync())
}
// Push result
if callErr != nil {
vm.Debugf("error from nested sub-call (depth: %v): %s\n", vm.stackDepth, callErr.Error())
// So we can return nested errors.CodedError if the top level return is an errors.CodedError
stack.Push(Zero256)
if callErr.ErrorCode() == errors.ErrorCodeExecutionReverted {
memory.Write(retOffset, RightPadBytes(returnData, int(retSize)))
}
} else {
stack.Push(One256)
// Should probably only be necessary when there is no return value and
// returnData is empty, but since EVM expects retSize to be respected this will
// defensively pad or truncate the portion of returnData to be returned.
memory.Write(retOffset, RightPadBytes(returnData, int(retSize)))
}
// Handle remaining gas.
*gas += gasLimit
vm.Debugf("resume %s (%v)\n", callee, gas)
case RETURN: // 0xF3
offset, size := stack.PopBigInt(), stack.PopBigInt()
output := memory.Read(offset, size)
vm.Debugf(" => [%v, %v] (%d) 0x%X\n", offset, size, len(output), output)
return output
case REVERT: // 0xFD
offset, size := stack.PopBigInt(), stack.PopBigInt()
output := memory.Read(offset, size)
vm.Debugf(" => [%v, %v] (%d) 0x%X\n", offset, size, len(output), output)
callState.PushError(newRevertException(output))
return output
case INVALID: // 0xFE
callState.PushError(errors.ErrorCodeExecutionAborted)
return nil
case SELFDESTRUCT: // 0xFF
receiver := stack.PopAddress()
useGasNegative(gas, GasGetAccount, callState)
if !callState.Exists(receiver) {
// If receiver address doesn't exist, try to create it
useGasNegative(gas, GasCreateAccount, callState)
createAccount(callState, callee, receiver)
if callState.Error() != nil {
continue
}
}
balance := callState.GetBalance(callee)
callState.AddToBalance(receiver, balance)
callState.RemoveAccount(callee)
vm.Debugf(" => (%X) %v\n", receiver[:4], balance)
return nil
case STOP: // 0x00
return nil
default:
vm.Debugf("(pc) %-3v Unknown opcode %v\n", pc, op)
callState.PushError(errors.Errorf("unknown opcode %v", op))
return nil
}
pc++
}
return
}
func createAccount(st Interface, creator, address crypto.Address) {
EnsurePermission(st, creator, permission.CreateAccount)
create(st, address)
}
func create(st Interface, address crypto.Address) {
if IsRegisteredNativeContract(address) {
st.PushError(errors.ErrorCodef(errors.ErrorCodeReservedAddress,