nimbus-eth1/src/logic/helpers.nim

import macros

  
macro pushRes*: untyped =
  let resNode = ident("res")
  result = quote:
    computation.stack.push(`resNode`)

macro quasiBoolean*(name: untyped, op: untyped, signed: untyped = nil, nonzero: untyped = nil): untyped =
  var signedNode = newEmptyNode()
  var finishSignedNode = newEmptyNode()
  let resNode = ident("res")
  var leftNode = ident("left")
  var rightNode = ident("right")
  var actualLeftNode = leftNode
  var actualRightNode = rightNode
  if not signed.isNil:
    actualLeftNode = ident("leftSigned")
    actualRightNode = ident("rightSigned")
    signedNode = quote:
      let `actualLeftNode` = unsignedToSigned(`leftNode`)
      let `actualRightNode` = unsignedToSigned(`rightNode`)
  var test = if nonzero.isNil:
      quote:
        `op`(`actualLeftNode`, `actualRightNode`)
    else:
      quote:
        `op`(`actualLeftNode`, `actualRightNode`) != 0
  result = quote:
    proc `name`*(computation: var BaseComputation) =
      var (`leftNode`, `rightNode`) = computation.stack.popInt(2)
      `signedNode`
      
      var `resNode` = if `test`: 1.u256 else: 0.u256
      computation.stack.push(`resNode`)
Implement more math: non-rigogous translation for now, more precise operation correctness later 2018-01-16 18:42:38 +00:00			`import macros`


Implement duplication and block, add more opcodes, improve math support 2018-01-22 22:23:07 +00:00			`macro pushRes*: untyped =`
Implement more math: non-rigogous translation for now, more precise operation correctness later 2018-01-16 18:42:38 +00:00			`let resNode = ident("res")`
Implement duplication and block, add more opcodes, improve math support 2018-01-22 22:23:07 +00:00			`result = quote:`
			computation.stack.push(`resNode`)
Implement more math: non-rigogous translation for now, more precise operation correctness later 2018-01-16 18:42:38 +00:00
			`macro quasiBoolean*(name: untyped, op: untyped, signed: untyped = nil, nonzero: untyped = nil): untyped =`
			`var signedNode = newEmptyNode()`
			`var finishSignedNode = newEmptyNode()`
			`let resNode = ident("res")`
Pass more tests, use UInt256 more often 82 / 189 arithmetic 55 / 62 logic 77 / 78 stack Most errors are the same sstore gascost bug, also next work on flow and memory 2018-02-20 17:27:43 +00:00			`var leftNode = ident("left")`
			`var rightNode = ident("right")`
			`var actualLeftNode = leftNode`
			`var actualRightNode = rightNode`
Implement more math: non-rigogous translation for now, more precise operation correctness later 2018-01-16 18:42:38 +00:00			`if not signed.isNil:`
Pass more tests, use UInt256 more often 82 / 189 arithmetic 55 / 62 logic 77 / 78 stack Most errors are the same sstore gascost bug, also next work on flow and memory 2018-02-20 17:27:43 +00:00			`actualLeftNode = ident("leftSigned")`
			`actualRightNode = ident("rightSigned")`
Implement more math: non-rigogous translation for now, more precise operation correctness later 2018-01-16 18:42:38 +00:00			`signedNode = quote:`
Pass more tests, use UInt256 more often 82 / 189 arithmetic 55 / 62 logic 77 / 78 stack Most errors are the same sstore gascost bug, also next work on flow and memory 2018-02-20 17:27:43 +00:00			let `actualLeftNode` = unsignedToSigned(`leftNode`)
			let `actualRightNode` = unsignedToSigned(`rightNode`)
Implement more math: non-rigogous translation for now, more precise operation correctness later 2018-01-16 18:42:38 +00:00			`var test = if nonzero.isNil:`
			`quote:`
Pass more tests, use UInt256 more often 82 / 189 arithmetic 55 / 62 logic 77 / 78 stack Most errors are the same sstore gascost bug, also next work on flow and memory 2018-02-20 17:27:43 +00:00			`op`(`actualLeftNode`, `actualRightNode`)
Implement more math: non-rigogous translation for now, more precise operation correctness later 2018-01-16 18:42:38 +00:00			`else:`
			`quote:`
Pass more tests, use UInt256 more often 82 / 189 arithmetic 55 / 62 logic 77 / 78 stack Most errors are the same sstore gascost bug, also next work on flow and memory 2018-02-20 17:27:43 +00:00			`op`(`actualLeftNode`, `actualRightNode`) != 0
Implement more math: non-rigogous translation for now, more precise operation correctness later 2018-01-16 18:42:38 +00:00			`result = quote:`
			proc `name`*(computation: var BaseComputation) =
			var (`leftNode`, `rightNode`) = computation.stack.popInt(2)
			`signedNode`

Pass more tests, use UInt256 more often 82 / 189 arithmetic 55 / 62 logic 77 / 78 stack Most errors are the same sstore gascost bug, also next work on flow and memory 2018-02-20 17:27:43 +00:00			var `resNode` = if `test`: 1.u256 else: 0.u256
Implement more math: non-rigogous translation for now, more precise operation correctness later 2018-01-16 18:42:38 +00:00			computation.stack.push(`resNode`)