2018-01-15 18:42:40 +00:00
|
|
|
import
|
2018-02-14 16:38:01 +00:00
|
|
|
strformat, strutils, sequtils, parseutils, sets, macros,
|
2018-01-15 18:42:40 +00:00
|
|
|
../logging, ../constants, ../opcode_values
|
|
|
|
|
|
|
|
type
|
|
|
|
CodeStream* = ref object
|
2018-02-20 17:27:43 +00:00
|
|
|
bytes*: seq[byte]
|
2018-01-15 18:42:40 +00:00
|
|
|
depthProcessed: int
|
|
|
|
invalidPositions: HashSet[int]
|
|
|
|
pc*: int
|
|
|
|
logger: Logger
|
2018-02-27 18:10:34 +00:00
|
|
|
cached: seq[(int, Op, string)]
|
2018-01-15 18:42:40 +00:00
|
|
|
|
|
|
|
proc `$`*(b: byte): string =
|
|
|
|
$(b.int)
|
|
|
|
|
2018-01-31 12:57:05 +00:00
|
|
|
proc newCodeStream*(codeBytes: seq[byte]): CodeStream =
|
2018-01-15 18:42:40 +00:00
|
|
|
new(result)
|
2018-01-31 12:57:05 +00:00
|
|
|
result.bytes = codeBytes
|
2018-01-15 18:42:40 +00:00
|
|
|
result.pc = 0
|
|
|
|
result.invalidPositions = initSet[int]()
|
|
|
|
result.depthProcessed = 0
|
2018-02-27 18:10:34 +00:00
|
|
|
result.cached = @[]
|
2018-01-31 12:57:05 +00:00
|
|
|
result.logger = logging.getLogger("vm.code_stream")
|
|
|
|
|
|
|
|
proc newCodeStream*(codeBytes: string): CodeStream =
|
|
|
|
newCodeStream(codeBytes.mapIt(it.byte))
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-02-14 16:38:01 +00:00
|
|
|
proc newCodeStreamFromUnescaped*(code: string): CodeStream =
|
|
|
|
# from 0xunescaped
|
|
|
|
var codeBytes: seq[byte] = @[]
|
|
|
|
for z, c in code[2..^1]:
|
|
|
|
if z mod 2 == 1:
|
|
|
|
var value: int
|
|
|
|
discard parseHex(&"0x{code[z+1..z+2]}", value)
|
|
|
|
codeBytes.add(value.byte)
|
|
|
|
newCodeStream(codeBytes)
|
|
|
|
|
2018-01-15 18:42:40 +00:00
|
|
|
proc read*(c: var CodeStream, size: int): seq[byte] =
|
2018-01-31 12:57:05 +00:00
|
|
|
if c.pc + size - 1 < c.bytes.len:
|
|
|
|
result = c.bytes[c.pc .. c.pc + size - 1]
|
|
|
|
c.pc += size
|
|
|
|
else:
|
|
|
|
result = @[]
|
|
|
|
c.pc = c.bytes.len
|
2018-01-15 18:42:40 +00:00
|
|
|
|
|
|
|
proc len*(c: CodeStream): int =
|
|
|
|
len(c.bytes)
|
|
|
|
|
2018-01-23 18:36:23 +00:00
|
|
|
proc next*(c: var CodeStream): Op =
|
2018-01-15 18:42:40 +00:00
|
|
|
var nextOpcode = c.read(1)
|
2018-01-31 12:57:05 +00:00
|
|
|
if nextOpcode.len != 0:
|
2018-01-23 18:36:23 +00:00
|
|
|
return Op(nextOpcode[0])
|
2018-01-15 18:42:40 +00:00
|
|
|
else:
|
2018-01-23 18:36:23 +00:00
|
|
|
return Op.STOP
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-01-23 18:36:23 +00:00
|
|
|
iterator items*(c: var CodeStream): Op =
|
2018-01-15 18:42:40 +00:00
|
|
|
var nextOpcode = c.next()
|
2018-01-23 18:36:23 +00:00
|
|
|
while nextOpcode != Op.STOP:
|
2018-01-15 18:42:40 +00:00
|
|
|
yield nextOpcode
|
|
|
|
nextOpcode = c.next()
|
|
|
|
|
2018-01-31 12:57:05 +00:00
|
|
|
proc `[]`*(c: CodeStream, offset: int): Op =
|
|
|
|
Op(c.bytes[offset])
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-01-23 18:36:23 +00:00
|
|
|
proc peek*(c: var CodeStream): Op =
|
2018-01-15 18:42:40 +00:00
|
|
|
var currentPc = c.pc
|
|
|
|
result = c.next()
|
|
|
|
c.pc = currentPc
|
|
|
|
|
|
|
|
proc updatePc*(c: var CodeStream, value: int) =
|
|
|
|
c.pc = min(value, len(c))
|
|
|
|
|
2018-01-31 12:57:05 +00:00
|
|
|
macro seek*(c: var CodeStream, pc: int, handler: untyped): untyped =
|
|
|
|
let c2 = ident("c")
|
|
|
|
result = quote:
|
|
|
|
var anchorPc = `c`.pc
|
|
|
|
`c`.pc = `pc`
|
|
|
|
try:
|
|
|
|
var `c2` = `c`
|
|
|
|
`handler`
|
|
|
|
finally:
|
|
|
|
`c`.pc = anchorPc
|
2018-01-15 18:42:40 +00:00
|
|
|
|
|
|
|
proc isValidOpcode*(c: var CodeStream, position: int): bool =
|
|
|
|
if position >= len(c):
|
|
|
|
return false
|
|
|
|
if position in c.invalidPositions:
|
|
|
|
return false
|
|
|
|
if position <= c.depthProcessed:
|
|
|
|
return true
|
|
|
|
else:
|
|
|
|
var i = c.depthProcessed
|
|
|
|
while i <= position:
|
2018-01-23 18:36:23 +00:00
|
|
|
var opcode = Op(c[i])
|
|
|
|
if opcode >= Op.PUSH1 and opcode <= Op.PUSH32:
|
2018-01-15 18:42:40 +00:00
|
|
|
var leftBound = (i + 1)
|
|
|
|
var rightBound = leftBound + (opcode.int - 95)
|
|
|
|
for z in leftBound ..< rightBound:
|
|
|
|
c.invalidPositions.incl(z)
|
|
|
|
i = rightBound
|
|
|
|
else:
|
|
|
|
c.depthProcessed = i
|
|
|
|
i += 1
|
|
|
|
if position in c.invalidPositions:
|
|
|
|
return false
|
|
|
|
else:
|
|
|
|
return true
|
2018-02-12 16:59:12 +00:00
|
|
|
|
2018-02-27 18:10:34 +00:00
|
|
|
proc decompile*(original: var CodeStream): seq[(int, Op, string)] =
|
2018-02-12 16:59:12 +00:00
|
|
|
# behave as https://etherscan.io/opcode-tool
|
|
|
|
# TODO
|
2018-02-27 18:10:34 +00:00
|
|
|
if original.cached.len > 0:
|
|
|
|
return original.cached
|
2018-02-12 16:59:12 +00:00
|
|
|
result = @[]
|
|
|
|
var c = newCodeStream(original.bytes)
|
|
|
|
while true:
|
|
|
|
var op = c.next
|
|
|
|
if op >= PUSH1 and op <= PUSH32:
|
|
|
|
let bytes = c.read(op.int - 95)
|
|
|
|
result.add((c.pc - 1, op, "0x" & bytes.mapIt($(it.BiggestInt.toHex(2))).join("")))
|
|
|
|
elif op != Op.Stop:
|
|
|
|
result.add((c.pc - 1, op, ""))
|
|
|
|
else:
|
|
|
|
result.add((-1, Op.STOP, ""))
|
|
|
|
break
|
2018-02-27 18:10:34 +00:00
|
|
|
original.cached = result
|
|
|
|
|
2018-03-13 14:30:38 +00:00
|
|
|
proc displayDecompiled*(c: CodeStream) =
|
|
|
|
var copy = c
|
|
|
|
let opcodes = copy.decompile()
|
|
|
|
for op in opcodes:
|
|
|
|
echo op[0], " ", op[1], " ", op[2]
|
|
|
|
|
|
|
|
|
2018-02-27 18:10:34 +00:00
|
|
|
proc hasSStore*(c: var CodeStream): bool =
|
|
|
|
let opcodes = c.decompile()
|
|
|
|
result = opcodes.anyIt(it[1] == SSTORE)
|