vm_debug.go 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928
  1. package vm
  2. import (
  3. "fmt"
  4. "math/big"
  5. "github.com/ethereum/go-ethereum/ethcrypto"
  6. "github.com/ethereum/go-ethereum/ethutil"
  7. )
  8. type DebugVm struct {
  9. env Environment
  10. logTy byte
  11. logStr string
  12. err error
  13. // Debugging
  14. Dbg Debugger
  15. BreakPoints []int64
  16. Stepping bool
  17. Fn string
  18. Recoverable bool
  19. depth int
  20. }
  21. func NewDebugVm(env Environment) *DebugVm {
  22. lt := LogTyPretty
  23. if ethutil.Config.Diff {
  24. lt = LogTyDiff
  25. }
  26. return &DebugVm{env: env, logTy: lt, Recoverable: true}
  27. }
  28. func (self *DebugVm) RunClosure(closure *Closure) (ret []byte, err error) {
  29. self.depth++
  30. var (
  31. op OpCode
  32. mem = &Memory{}
  33. stack = NewStack()
  34. pc = big.NewInt(0)
  35. step = 0
  36. prevStep = 0
  37. state = self.env.State()
  38. require = func(m int) {
  39. if stack.Len() < m {
  40. panic(fmt.Sprintf("%04v (%v) stack err size = %d, required = %d", pc, op, stack.Len(), m))
  41. }
  42. }
  43. jump = func(pos *big.Int) {
  44. p := int(pos.Int64())
  45. self.Printf(" ~> %v", pos)
  46. // Return to start
  47. if p == 0 {
  48. pc = big.NewInt(0)
  49. } else {
  50. nop := OpCode(closure.GetOp(p - 1))
  51. if nop != JUMPDEST {
  52. panic(fmt.Sprintf("JUMP missed JUMPDEST (%v) %v", nop, p))
  53. }
  54. pc = pos
  55. }
  56. self.Endl()
  57. }
  58. )
  59. if self.Recoverable {
  60. // Recover from any require exception
  61. defer func() {
  62. if r := recover(); r != nil {
  63. self.Endl()
  64. ret = closure.Return(nil)
  65. // No error should be set. Recover is used with require
  66. // Is this too error prone?
  67. }
  68. }()
  69. }
  70. // Debug hook
  71. if self.Dbg != nil {
  72. self.Dbg.SetCode(closure.Code)
  73. }
  74. // Don't bother with the execution if there's no code.
  75. if len(closure.Code) == 0 {
  76. return closure.Return(nil), nil
  77. }
  78. vmlogger.Debugf("(%d) %x gas: %v (d) %x\n", self.depth, closure.Address(), closure.Gas, closure.Args)
  79. for {
  80. prevStep = step
  81. // The base for all big integer arithmetic
  82. base := new(big.Int)
  83. step++
  84. // Get the memory location of pc
  85. op = closure.GetOp(int(pc.Uint64()))
  86. // XXX Leave this Println intact. Don't change this to the log system.
  87. // Used for creating diffs between implementations
  88. if self.logTy == LogTyDiff {
  89. switch op {
  90. case STOP, RETURN, SUICIDE:
  91. state.GetStateObject(closure.Address()).EachStorage(func(key string, value *ethutil.Value) {
  92. value.Decode()
  93. fmt.Printf("%x %x\n", new(big.Int).SetBytes([]byte(key)).Bytes(), value.Bytes())
  94. })
  95. }
  96. b := pc.Bytes()
  97. if len(b) == 0 {
  98. b = []byte{0}
  99. }
  100. fmt.Printf("%x %x %x %x\n", closure.Address(), b, []byte{byte(op)}, closure.Gas.Bytes())
  101. }
  102. gas := new(big.Int)
  103. addStepGasUsage := func(amount *big.Int) {
  104. if amount.Cmp(ethutil.Big0) >= 0 {
  105. gas.Add(gas, amount)
  106. }
  107. }
  108. addStepGasUsage(GasStep)
  109. var newMemSize *big.Int = ethutil.Big0
  110. // Stack Check, memory resize & gas phase
  111. switch op {
  112. // Stack checks only
  113. case NOT, CALLDATALOAD, POP, JUMP, BNOT: // 1
  114. require(1)
  115. case ADD, SUB, DIV, SDIV, MOD, SMOD, EXP, LT, GT, SLT, SGT, EQ, AND, OR, XOR, BYTE: // 2
  116. require(2)
  117. case ADDMOD, MULMOD: // 3
  118. require(3)
  119. case SWAP1, SWAP2, SWAP3, SWAP4, SWAP5, SWAP6, SWAP7, SWAP8, SWAP9, SWAP10, SWAP11, SWAP12, SWAP13, SWAP14, SWAP15, SWAP16:
  120. n := int(op - SWAP1 + 2)
  121. require(n)
  122. case DUP1, DUP2, DUP3, DUP4, DUP5, DUP6, DUP7, DUP8, DUP9, DUP10, DUP11, DUP12, DUP13, DUP14, DUP15, DUP16:
  123. n := int(op - DUP1 + 1)
  124. require(n)
  125. case LOG0, LOG1, LOG2, LOG3, LOG4:
  126. n := int(op - LOG0)
  127. require(n + 2)
  128. mSize, mStart := stack.Peekn()
  129. gas.Set(GasLog)
  130. addStepGasUsage(new(big.Int).Mul(big.NewInt(int64(n)), GasLog))
  131. addStepGasUsage(new(big.Int).Add(mSize, mStart))
  132. // Gas only
  133. case STOP:
  134. gas.Set(ethutil.Big0)
  135. case SUICIDE:
  136. require(1)
  137. gas.Set(ethutil.Big0)
  138. case SLOAD:
  139. require(1)
  140. gas.Set(GasSLoad)
  141. // Memory resize & Gas
  142. case SSTORE:
  143. require(2)
  144. var mult *big.Int
  145. y, x := stack.Peekn()
  146. val := closure.GetStorage(x)
  147. if val.BigInt().Cmp(ethutil.Big0) == 0 && len(y.Bytes()) > 0 {
  148. // 0 => non 0
  149. mult = ethutil.Big3
  150. } else if val.BigInt().Cmp(ethutil.Big0) != 0 && len(y.Bytes()) == 0 {
  151. state.Refund(closure.caller.Address(), GasSStoreRefund, closure.Price)
  152. mult = ethutil.Big0
  153. } else {
  154. // non 0 => non 0
  155. mult = ethutil.Big1
  156. }
  157. gas.Set(new(big.Int).Mul(mult, GasSStore))
  158. case BALANCE:
  159. require(1)
  160. gas.Set(GasBalance)
  161. case MSTORE:
  162. require(2)
  163. newMemSize = calcMemSize(stack.Peek(), u256(32))
  164. case MLOAD:
  165. require(1)
  166. newMemSize = calcMemSize(stack.Peek(), u256(32))
  167. case MSTORE8:
  168. require(2)
  169. newMemSize = calcMemSize(stack.Peek(), u256(1))
  170. case RETURN:
  171. require(2)
  172. newMemSize = calcMemSize(stack.Peek(), stack.data[stack.Len()-2])
  173. case SHA3:
  174. require(2)
  175. gas.Set(GasSha)
  176. newMemSize = calcMemSize(stack.Peek(), stack.data[stack.Len()-2])
  177. case CALLDATACOPY:
  178. require(2)
  179. newMemSize = calcMemSize(stack.Peek(), stack.data[stack.Len()-3])
  180. case CODECOPY:
  181. require(3)
  182. newMemSize = calcMemSize(stack.Peek(), stack.data[stack.Len()-3])
  183. case EXTCODECOPY:
  184. require(4)
  185. newMemSize = calcMemSize(stack.data[stack.Len()-2], stack.data[stack.Len()-4])
  186. case CALL, CALLCODE:
  187. require(7)
  188. gas.Set(GasCall)
  189. addStepGasUsage(stack.data[stack.Len()-1])
  190. x := calcMemSize(stack.data[stack.Len()-6], stack.data[stack.Len()-7])
  191. y := calcMemSize(stack.data[stack.Len()-4], stack.data[stack.Len()-5])
  192. newMemSize = ethutil.BigMax(x, y)
  193. case CREATE:
  194. require(3)
  195. gas.Set(GasCreate)
  196. newMemSize = calcMemSize(stack.data[stack.Len()-2], stack.data[stack.Len()-3])
  197. }
  198. if newMemSize.Cmp(ethutil.Big0) > 0 {
  199. newMemSize.Add(newMemSize, u256(31))
  200. newMemSize.Div(newMemSize, u256(32))
  201. newMemSize.Mul(newMemSize, u256(32))
  202. if newMemSize.Cmp(u256(int64(mem.Len()))) > 0 {
  203. memGasUsage := new(big.Int).Sub(newMemSize, u256(int64(mem.Len())))
  204. memGasUsage.Mul(GasMemory, memGasUsage)
  205. memGasUsage.Div(memGasUsage, u256(32))
  206. addStepGasUsage(memGasUsage)
  207. }
  208. }
  209. self.Printf("(pc) %-3d -o- %-14s", pc, op.String())
  210. self.Printf(" (g) %-3v (%v)", gas, closure.Gas)
  211. if !closure.UseGas(gas) {
  212. self.Endl()
  213. tmp := new(big.Int).Set(closure.Gas)
  214. closure.UseGas(closure.Gas)
  215. return closure.Return(nil), OOG(gas, tmp)
  216. }
  217. mem.Resize(newMemSize.Uint64())
  218. switch op {
  219. // 0x20 range
  220. case ADD:
  221. x, y := stack.Popn()
  222. self.Printf(" %v + %v", y, x)
  223. base.Add(y, x)
  224. U256(base)
  225. self.Printf(" = %v", base)
  226. // Pop result back on the stack
  227. stack.Push(base)
  228. case SUB:
  229. x, y := stack.Popn()
  230. self.Printf(" %v - %v", y, x)
  231. base.Sub(y, x)
  232. U256(base)
  233. self.Printf(" = %v", base)
  234. // Pop result back on the stack
  235. stack.Push(base)
  236. case MUL:
  237. x, y := stack.Popn()
  238. self.Printf(" %v * %v", y, x)
  239. base.Mul(y, x)
  240. U256(base)
  241. self.Printf(" = %v", base)
  242. // Pop result back on the stack
  243. stack.Push(base)
  244. case DIV:
  245. x, y := stack.Pop(), stack.Pop()
  246. self.Printf(" %v / %v", x, y)
  247. if y.Cmp(ethutil.Big0) != 0 {
  248. base.Div(x, y)
  249. }
  250. U256(base)
  251. self.Printf(" = %v", base)
  252. // Pop result back on the stack
  253. stack.Push(base)
  254. case SDIV:
  255. x, y := S256(stack.Pop()), S256(stack.Pop())
  256. self.Printf(" %v / %v", x, y)
  257. if y.Cmp(ethutil.Big0) == 0 {
  258. base.Set(ethutil.Big0)
  259. } else {
  260. n := new(big.Int)
  261. if new(big.Int).Mul(x, y).Cmp(ethutil.Big0) < 0 {
  262. n.SetInt64(-1)
  263. } else {
  264. n.SetInt64(1)
  265. }
  266. base.Div(x.Abs(x), y.Abs(y)).Mul(base, n)
  267. U256(base)
  268. }
  269. self.Printf(" = %v", base)
  270. stack.Push(base)
  271. case MOD:
  272. x, y := stack.Pop(), stack.Pop()
  273. self.Printf(" %v %% %v", x, y)
  274. if y.Cmp(ethutil.Big0) == 0 {
  275. base.Set(ethutil.Big0)
  276. } else {
  277. base.Mod(x, y)
  278. }
  279. U256(base)
  280. self.Printf(" = %v", base)
  281. stack.Push(base)
  282. case SMOD:
  283. x, y := S256(stack.Pop()), S256(stack.Pop())
  284. self.Printf(" %v %% %v", x, y)
  285. if y.Cmp(ethutil.Big0) == 0 {
  286. base.Set(ethutil.Big0)
  287. } else {
  288. n := new(big.Int)
  289. if x.Cmp(ethutil.Big0) < 0 {
  290. n.SetInt64(-1)
  291. } else {
  292. n.SetInt64(1)
  293. }
  294. base.Mod(x.Abs(x), y.Abs(y)).Mul(base, n)
  295. U256(base)
  296. }
  297. self.Printf(" = %v", base)
  298. stack.Push(base)
  299. case EXP:
  300. x, y := stack.Popn()
  301. self.Printf(" %v ** %v", y, x)
  302. base.Exp(y, x, Pow256)
  303. U256(base)
  304. self.Printf(" = %v", base)
  305. stack.Push(base)
  306. case BNOT:
  307. base.Sub(Pow256, stack.Pop()).Sub(base, ethutil.Big1)
  308. // Not needed
  309. //base = U256(base)
  310. stack.Push(base)
  311. case LT:
  312. x, y := stack.Popn()
  313. self.Printf(" %v < %v", y, x)
  314. // x < y
  315. if y.Cmp(x) < 0 {
  316. stack.Push(ethutil.BigTrue)
  317. } else {
  318. stack.Push(ethutil.BigFalse)
  319. }
  320. case GT:
  321. x, y := stack.Popn()
  322. self.Printf(" %v > %v", y, x)
  323. // x > y
  324. if y.Cmp(x) > 0 {
  325. stack.Push(ethutil.BigTrue)
  326. } else {
  327. stack.Push(ethutil.BigFalse)
  328. }
  329. case SLT:
  330. y, x := S256(stack.Pop()), S256(stack.Pop())
  331. self.Printf(" %v < %v", y, x)
  332. // x < y
  333. if y.Cmp(S256(x)) < 0 {
  334. stack.Push(ethutil.BigTrue)
  335. } else {
  336. stack.Push(ethutil.BigFalse)
  337. }
  338. case SGT:
  339. y, x := S256(stack.Pop()), S256(stack.Pop())
  340. self.Printf(" %v > %v", y, x)
  341. // x > y
  342. if y.Cmp(x) > 0 {
  343. stack.Push(ethutil.BigTrue)
  344. } else {
  345. stack.Push(ethutil.BigFalse)
  346. }
  347. case EQ:
  348. x, y := stack.Popn()
  349. self.Printf(" %v == %v", y, x)
  350. // x == y
  351. if x.Cmp(y) == 0 {
  352. stack.Push(ethutil.BigTrue)
  353. } else {
  354. stack.Push(ethutil.BigFalse)
  355. }
  356. case NOT:
  357. x := stack.Pop()
  358. if x.Cmp(ethutil.BigFalse) > 0 {
  359. stack.Push(ethutil.BigFalse)
  360. } else {
  361. stack.Push(ethutil.BigTrue)
  362. }
  363. // 0x10 range
  364. case AND:
  365. x, y := stack.Popn()
  366. self.Printf(" %v & %v", y, x)
  367. stack.Push(base.And(y, x))
  368. case OR:
  369. x, y := stack.Popn()
  370. self.Printf(" %v | %v", y, x)
  371. stack.Push(base.Or(y, x))
  372. case XOR:
  373. x, y := stack.Popn()
  374. self.Printf(" %v ^ %v", y, x)
  375. stack.Push(base.Xor(y, x))
  376. case BYTE:
  377. val, th := stack.Popn()
  378. if th.Cmp(big.NewInt(32)) < 0 {
  379. byt := big.NewInt(int64(ethutil.LeftPadBytes(val.Bytes(), 32)[th.Int64()]))
  380. base.Set(byt)
  381. } else {
  382. base.Set(ethutil.BigFalse)
  383. }
  384. self.Printf(" => 0x%x", base.Bytes())
  385. stack.Push(base)
  386. case ADDMOD:
  387. x := stack.Pop()
  388. y := stack.Pop()
  389. z := stack.Pop()
  390. base.Add(x, y)
  391. base.Mod(base, z)
  392. U256(base)
  393. self.Printf(" = %v", base)
  394. stack.Push(base)
  395. case MULMOD:
  396. x := stack.Pop()
  397. y := stack.Pop()
  398. z := stack.Pop()
  399. base.Mul(x, y)
  400. base.Mod(base, z)
  401. U256(base)
  402. self.Printf(" = %v", base)
  403. stack.Push(base)
  404. // 0x20 range
  405. case SHA3:
  406. size, offset := stack.Popn()
  407. data := ethcrypto.Sha3(mem.Get(offset.Int64(), size.Int64()))
  408. stack.Push(ethutil.BigD(data))
  409. self.Printf(" => %x", data)
  410. // 0x30 range
  411. case ADDRESS:
  412. stack.Push(ethutil.BigD(closure.Address()))
  413. self.Printf(" => %x", closure.Address())
  414. case BALANCE:
  415. addr := stack.Pop().Bytes()
  416. balance := state.GetBalance(addr)
  417. stack.Push(balance)
  418. self.Printf(" => %v (%x)", balance, addr)
  419. case ORIGIN:
  420. origin := self.env.Origin()
  421. stack.Push(ethutil.BigD(origin))
  422. self.Printf(" => %x", origin)
  423. case CALLER:
  424. caller := closure.caller.Address()
  425. stack.Push(ethutil.BigD(caller))
  426. self.Printf(" => %x", caller)
  427. case CALLVALUE:
  428. value := closure.exe.value
  429. stack.Push(value)
  430. self.Printf(" => %v", value)
  431. case CALLDATALOAD:
  432. var (
  433. offset = stack.Pop()
  434. data = make([]byte, 32)
  435. lenData = big.NewInt(int64(len(closure.Args)))
  436. )
  437. if lenData.Cmp(offset) >= 0 {
  438. length := new(big.Int).Add(offset, ethutil.Big32)
  439. length = ethutil.BigMin(length, lenData)
  440. copy(data, closure.Args[offset.Int64():length.Int64()])
  441. }
  442. self.Printf(" => 0x%x", data)
  443. stack.Push(ethutil.BigD(data))
  444. case CALLDATASIZE:
  445. l := int64(len(closure.Args))
  446. stack.Push(big.NewInt(l))
  447. self.Printf(" => %d", l)
  448. case CALLDATACOPY:
  449. var (
  450. size = int64(len(closure.Args))
  451. mOff = stack.Pop().Int64()
  452. cOff = stack.Pop().Int64()
  453. l = stack.Pop().Int64()
  454. )
  455. if cOff > size {
  456. cOff = 0
  457. l = 0
  458. } else if cOff+l > size {
  459. l = 0
  460. }
  461. code := closure.Args[cOff : cOff+l]
  462. mem.Set(mOff, l, code)
  463. case CODESIZE, EXTCODESIZE:
  464. var code []byte
  465. if op == EXTCODESIZE {
  466. addr := stack.Pop().Bytes()
  467. code = state.GetCode(addr)
  468. } else {
  469. code = closure.Code
  470. }
  471. l := big.NewInt(int64(len(code)))
  472. stack.Push(l)
  473. self.Printf(" => %d", l)
  474. case CODECOPY, EXTCODECOPY:
  475. var code []byte
  476. if op == EXTCODECOPY {
  477. addr := stack.Pop().Bytes()
  478. code = state.GetCode(addr)
  479. } else {
  480. code = closure.Code
  481. }
  482. var (
  483. size = int64(len(code))
  484. mOff = stack.Pop().Int64()
  485. cOff = stack.Pop().Int64()
  486. l = stack.Pop().Int64()
  487. )
  488. if cOff > size {
  489. cOff = 0
  490. l = 0
  491. } else if cOff+l > size {
  492. l = 0
  493. }
  494. codeCopy := code[cOff : cOff+l]
  495. mem.Set(mOff, l, codeCopy)
  496. case GASPRICE:
  497. stack.Push(closure.Price)
  498. self.Printf(" => %v", closure.Price)
  499. // 0x40 range
  500. case PREVHASH:
  501. prevHash := self.env.PrevHash()
  502. stack.Push(ethutil.BigD(prevHash))
  503. self.Printf(" => 0x%x", prevHash)
  504. case COINBASE:
  505. coinbase := self.env.Coinbase()
  506. stack.Push(ethutil.BigD(coinbase))
  507. self.Printf(" => 0x%x", coinbase)
  508. case TIMESTAMP:
  509. time := self.env.Time()
  510. stack.Push(big.NewInt(time))
  511. self.Printf(" => 0x%x", time)
  512. case NUMBER:
  513. number := self.env.BlockNumber()
  514. stack.Push(number)
  515. self.Printf(" => 0x%x", number.Bytes())
  516. case DIFFICULTY:
  517. difficulty := self.env.Difficulty()
  518. stack.Push(difficulty)
  519. self.Printf(" => 0x%x", difficulty.Bytes())
  520. case GASLIMIT:
  521. stack.Push(self.env.GasLimit())
  522. // 0x50 range
  523. 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:
  524. a := big.NewInt(int64(op) - int64(PUSH1) + 1)
  525. pc.Add(pc, ethutil.Big1)
  526. data := closure.Gets(pc, a)
  527. val := ethutil.BigD(data.Bytes())
  528. // Push value to stack
  529. stack.Push(val)
  530. pc.Add(pc, a.Sub(a, big.NewInt(1)))
  531. step += int(op) - int(PUSH1) + 1
  532. self.Printf(" => 0x%x", data.Bytes())
  533. case POP:
  534. stack.Pop()
  535. case DUP1, DUP2, DUP3, DUP4, DUP5, DUP6, DUP7, DUP8, DUP9, DUP10, DUP11, DUP12, DUP13, DUP14, DUP15, DUP16:
  536. n := int(op - DUP1 + 1)
  537. v := stack.Dupn(n)
  538. self.Printf(" => [%d] 0x%x", n, stack.Peek().Bytes())
  539. if OpCode(closure.Get(new(big.Int).Add(pc, ethutil.Big1)).Uint()) == POP && OpCode(closure.Get(new(big.Int).Add(pc, big.NewInt(2))).Uint()) == POP {
  540. fmt.Println(toValue(v))
  541. }
  542. case SWAP1, SWAP2, SWAP3, SWAP4, SWAP5, SWAP6, SWAP7, SWAP8, SWAP9, SWAP10, SWAP11, SWAP12, SWAP13, SWAP14, SWAP15, SWAP16:
  543. n := int(op - SWAP1 + 2)
  544. x, y := stack.Swapn(n)
  545. self.Printf(" => [%d] %x [0] %x", n, x.Bytes(), y.Bytes())
  546. case LOG0, LOG1, LOG2, LOG3, LOG4:
  547. n := int(op - LOG0)
  548. topics := make([][]byte, n)
  549. mSize, mStart := stack.Pop().Int64(), stack.Pop().Int64()
  550. data := mem.Geti(mStart, mSize)
  551. for i := 0; i < n; i++ {
  552. topics[i] = stack.Pop().Bytes()
  553. }
  554. self.env.AddLog(Log{closure.Address(), topics, data})
  555. case MLOAD:
  556. offset := stack.Pop()
  557. val := ethutil.BigD(mem.Get(offset.Int64(), 32))
  558. stack.Push(val)
  559. self.Printf(" => 0x%x", val.Bytes())
  560. case MSTORE: // Store the value at stack top-1 in to memory at location stack top
  561. // Pop value of the stack
  562. val, mStart := stack.Popn()
  563. mem.Set(mStart.Int64(), 32, ethutil.BigToBytes(val, 256))
  564. self.Printf(" => 0x%x", val)
  565. case MSTORE8:
  566. off := stack.Pop()
  567. val := stack.Pop()
  568. mem.store[off.Int64()] = byte(val.Int64() & 0xff)
  569. self.Printf(" => [%v] 0x%x", off, val)
  570. case SLOAD:
  571. loc := stack.Pop()
  572. val := ethutil.BigD(state.GetState(closure.Address(), loc.Bytes()))
  573. stack.Push(val)
  574. self.Printf(" {0x%x : 0x%x}", loc.Bytes(), val.Bytes())
  575. case SSTORE:
  576. val, loc := stack.Popn()
  577. state.SetState(closure.Address(), loc.Bytes(), val)
  578. // Debug sessions are allowed to run without message
  579. if closure.message != nil {
  580. closure.message.AddStorageChange(loc.Bytes())
  581. }
  582. self.Printf(" {0x%x : 0x%x}", loc.Bytes(), val.Bytes())
  583. case JUMP:
  584. jump(stack.Pop())
  585. continue
  586. case JUMPI:
  587. cond, pos := stack.Popn()
  588. if cond.Cmp(ethutil.BigTrue) >= 0 {
  589. jump(pos)
  590. continue
  591. }
  592. case JUMPDEST:
  593. case PC:
  594. stack.Push(pc)
  595. case MSIZE:
  596. stack.Push(big.NewInt(int64(mem.Len())))
  597. case GAS:
  598. stack.Push(closure.Gas)
  599. // 0x60 range
  600. case CREATE:
  601. var (
  602. err error
  603. value = stack.Pop()
  604. size, offset = stack.Popn()
  605. input = mem.Get(offset.Int64(), size.Int64())
  606. gas = new(big.Int).Set(closure.Gas)
  607. // Snapshot the current stack so we are able to
  608. // revert back to it later.
  609. //snapshot = self.env.State().Copy()
  610. )
  611. // Generate a new address
  612. n := state.GetNonce(closure.Address())
  613. addr := ethcrypto.CreateAddress(closure.Address(), n)
  614. state.SetNonce(closure.Address(), n+1)
  615. self.Printf(" (*) %x", addr).Endl()
  616. closure.UseGas(closure.Gas)
  617. msg := NewExecution(self, addr, input, gas, closure.Price, value)
  618. ret, err := msg.Create(closure)
  619. if err != nil {
  620. stack.Push(ethutil.BigFalse)
  621. // Revert the state as it was before.
  622. //self.env.State().Set(snapshot)
  623. self.Printf("CREATE err %v", err)
  624. } else {
  625. msg.object.Code = ret
  626. stack.Push(ethutil.BigD(addr))
  627. }
  628. self.Endl()
  629. // Debug hook
  630. if self.Dbg != nil {
  631. self.Dbg.SetCode(closure.Code)
  632. }
  633. case CALL, CALLCODE:
  634. self.Endl()
  635. gas := stack.Pop()
  636. // Pop gas and value of the stack.
  637. value, addr := stack.Popn()
  638. // Pop input size and offset
  639. inSize, inOffset := stack.Popn()
  640. // Pop return size and offset
  641. retSize, retOffset := stack.Popn()
  642. // Get the arguments from the memory
  643. args := mem.Get(inOffset.Int64(), inSize.Int64())
  644. var executeAddr []byte
  645. if op == CALLCODE {
  646. executeAddr = closure.Address()
  647. } else {
  648. executeAddr = addr.Bytes()
  649. }
  650. msg := NewExecution(self, executeAddr, args, gas, closure.Price, value)
  651. ret, err := msg.Exec(addr.Bytes(), closure)
  652. if err != nil {
  653. stack.Push(ethutil.BigFalse)
  654. vmlogger.Debugln(err)
  655. } else {
  656. stack.Push(ethutil.BigTrue)
  657. mem.Set(retOffset.Int64(), retSize.Int64(), ret)
  658. }
  659. self.Printf("resume %x", closure.Address())
  660. // Debug hook
  661. if self.Dbg != nil {
  662. self.Dbg.SetCode(closure.Code)
  663. }
  664. case RETURN:
  665. size, offset := stack.Popn()
  666. ret := mem.Get(offset.Int64(), size.Int64())
  667. self.Printf(" => (%d) 0x%x", len(ret), ret).Endl()
  668. return closure.Return(ret), nil
  669. case SUICIDE:
  670. receiver := state.GetOrNewStateObject(stack.Pop().Bytes())
  671. receiver.AddAmount(state.GetBalance(closure.Address()))
  672. state.Delete(closure.Address())
  673. fallthrough
  674. case STOP: // Stop the closure
  675. self.Endl()
  676. return closure.Return(nil), nil
  677. default:
  678. vmlogger.Debugf("(pc) %-3v Invalid opcode %x\n", pc, op)
  679. //panic(fmt.Sprintf("Invalid opcode %x", op))
  680. closure.ReturnGas(big.NewInt(1), nil)
  681. return closure.Return(nil), fmt.Errorf("Invalid opcode %x", op)
  682. }
  683. pc.Add(pc, ethutil.Big1)
  684. self.Endl()
  685. if self.Dbg != nil {
  686. for _, instrNo := range self.Dbg.BreakPoints() {
  687. if pc.Cmp(big.NewInt(instrNo)) == 0 {
  688. self.Stepping = true
  689. if !self.Dbg.BreakHook(prevStep, op, mem, stack, state.GetStateObject(closure.Address())) {
  690. return nil, nil
  691. }
  692. } else if self.Stepping {
  693. if !self.Dbg.StepHook(prevStep, op, mem, stack, state.GetStateObject(closure.Address())) {
  694. return nil, nil
  695. }
  696. }
  697. }
  698. }
  699. }
  700. }
  701. func (self *DebugVm) Printf(format string, v ...interface{}) VirtualMachine {
  702. if self.logTy == LogTyPretty {
  703. self.logStr += fmt.Sprintf(format, v...)
  704. }
  705. return self
  706. }
  707. func (self *DebugVm) Endl() VirtualMachine {
  708. if self.logTy == LogTyPretty {
  709. vmlogger.Debugln(self.logStr)
  710. self.logStr = ""
  711. }
  712. return self
  713. }
  714. func (self *DebugVm) Env() Environment {
  715. return self.env
  716. }
  717. func (self *DebugVm) Depth() int {
  718. return self.depth
  719. }