arnaucube/evm-rs
1
1
Fork 0
mirror of https://github.com/arnaucube/evm-rs.git synced 2026-02-02 17:06:40 +01:00
Code Issues Packages Projects Releases Wiki Activity

reorg & add GHA

Browse Source
This commit is contained in:
arnaucube
2021-09-12 19:49:07 +02:00
parent dbd992138b
commit bb02272d5c
7 changed files with 458 additions and 432 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
.github/workflows/clippy.yml vendored Normal file
View File

@@ -0,0 +1,11 @@
name: Clippy check
on: [push, pull_request]
jobs:
clippy_check:
runs-on: ubuntu-latest
steps:
- uses: actions/checkout@v1
- run: rustup component add clippy
- uses: actions-rs/clippy-check@v1
with:
token: ${{ secrets.GITHUB_TOKEN }}

13
.github/workflows/test.yml vendored Normal file
View File

@@ -0,0 +1,13 @@
name: Test
on: [push, pull_request]
env:
CARGO_TERM_COLOR: always
jobs:
build:
runs-on: ubuntu-latest
steps:
- uses: actions/checkout@v2
- name: Build
run: cargo build --verbose
- name: Run tests
run: cargo test --verbose

2
Cargo.toml
View File

@@ -1,5 +1,5 @@
[package] [package]
name = "evm-study" name = "evm"
version = "0.1.0" version = "0.1.0"
edition = "2018" edition = "2018"

7
README.md
View File

@@ -1,5 +1,4 @@
# evm-rs # evm-rs [![Test](https://github.com/arnaucube/evm-rs/workflows/Test/badge.svg)](https://github.com/arnaucube/evm-rs/actions?query=workflow%3ATest)
This is a repo done to get familiar with EVM, do not use. EVM ([Ethereum Virtual Machine](https://ethereum.org/en/developers/docs/evm/)) implementation from scratch in Rust.
EVM (Ethereum Virtual Machine) implementation from scratch in Rust.
*This is a repo done to get familiar with the EVM, do not use.*

456
src/lib.rs
View File

@@ -2,45 +2,16 @@
use num_bigint::BigUint; use num_bigint::BigUint;
use std::collections::HashMap; use std::collections::HashMap;
pub mod opcodes;
// Non-opcode gas prices #[derive(Default)]
const GDEFAULT: usize = 1;
const GMEMORY: usize = 3;
const GQUADRATICMEMDENOM: usize = 512; // 1 gas per 512 quadwords
const GSTORAGEREFUND: usize = 15000;
const GSTORAGEKILL: usize = 5000;
const GSTORAGEMOD: usize = 5000;
const GSTORAGEADD: usize = 20000;
const GEXPONENTBYTE: usize = 10; // cost of EXP exponent per byte
const GCOPY: usize = 3; // cost to copy one 32 byte word
const GCONTRACTBYTE: usize = 200; // one byte of code in contract creation
const GCALLVALUETRANSFER: usize = 9000; // non-zero-valued call
const GLOGBYTE: usize = 8; // cost of a byte of logdata
const GTXCOST: usize = 21000; // TX BASE GAS COST
const GTXDATAZERO: usize = 4; // TX DATA ZERO BYTE GAS COST
const GTXDATANONZERO: usize = 68; // TX DATA NON ZERO BYTE GAS COST
const GSHA3WORD: usize = 6; // Cost of SHA3 per word
const GSHA256BASE: usize = 60; // Base c of SHA256
const GSHA256WORD: usize = 12; // Cost of SHA256 per word
const GRIPEMD160BASE: usize = 600; // Base cost of RIPEMD160
const GRIPEMD160WORD: usize = 120; // Cost of RIPEMD160 per word
const GIDENTITYBASE: usize = 15; // Base cost of indentity
const GIDENTITYWORD: usize = 3; // Cost of identity per word
const GECRECOVER: usize = 3000; // Cost of ecrecover op
const GSTIPEND: usize = 2300;
const GCALLNEWACCOUNT: usize = 25000;
const GSUICIDEREFUND: usize = 24000;
pub struct Stack { pub struct Stack {
pc: usize, pub pc: usize,
calldata_i: usize, pub calldata_i: usize,
stack: Vec<[u8; 32]>, pub stack: Vec<[u8; 32]>,
mem: Vec<u8>, pub mem: Vec<u8>,
gas: u64, pub gas: u64,
opcodes: HashMap<u8, Opcode>, pub opcodes: HashMap<u8, opcodes::Opcode>,
} }
impl Stack { impl Stack {
@@ -53,40 +24,41 @@ impl Stack {
gas: 10000000000, gas: 10000000000,
opcodes: HashMap::new(), opcodes: HashMap::new(),
}; };
s.opcodes = new_opcodes(); s.opcodes = opcodes::new_opcodes();
s s
} }
fn print_stack(&self) { pub fn print_stack(&self) {
for i in (0..self.stack.len()).rev() { for i in (0..self.stack.len()).rev() {
println!("{:x?}", &self.stack[i][28..]); println!("{:x?}", &self.stack[i][28..]);
} }
} }
fn push(&mut self, b: [u8; 32]) { pub fn push(&mut self, b: [u8; 32]) {
self.stack.push(b); self.stack.push(b);
} }
// push_arbitrary performs a push, but first converting the arbitrary-length input into a 32 // push_arbitrary performs a push, but first converting the arbitrary-length
// byte array // input into a 32 byte array
fn push_arbitrary(&mut self, b: &[u8]) { pub fn push_arbitrary(&mut self, b: &[u8]) {
// TODO if b.len()>32 return error // TODO if b.len()>32 return error
let mut d: [u8; 32] = [0; 32]; let mut d: [u8; 32] = [0; 32];
d[32 - b.len()..].copy_from_slice(&b[..]); d[32 - b.len()..].copy_from_slice(b);
self.stack.push(d); self.stack.push(d);
} }
// put_arbitrary puts in the last element of the stack the value // put_arbitrary puts in the last element of the stack the value
fn put_arbitrary(&mut self, b: &[u8]) { pub fn put_arbitrary(&mut self, b: &[u8]) {
// TODO if b.len()>32 return error // TODO if b.len()>32 return error
let mut d: [u8; 32] = [0; 32]; let mut d: [u8; 32] = [0; 32];
d[32 - b.len()..].copy_from_slice(&b[..]); d[32 - b.len()..].copy_from_slice(b);
let l = self.stack.len(); let l = self.stack.len();
self.stack[l - 1] = d; self.stack[l - 1] = d;
} }
fn pop(&mut self) -> [u8; 32] { pub fn pop(&mut self) -> [u8; 32] {
match self.stack.pop() { match self.stack.pop() {
Some(x) => return x, Some(x) => x,
None => panic!("err"), None => panic!("err"),
} }
} }
fn execute(&mut self, code: &[u8], calldata: &[u8], debug: bool) -> Vec<u8> {
pub fn execute(&mut self, code: &[u8], calldata: &[u8], debug: bool) -> Vec<u8> {
self.pc = 0; self.pc = 0;
self.calldata_i = 0; self.calldata_i = 0;
let l = code.len(); let l = code.len();
@@ -106,7 +78,7 @@ impl Stack {
self.gas, self.gas,
); );
self.print_stack(); self.print_stack();
println!(""); println!();
} }
match opcode & 0xf0 { match opcode & 0xf0 {
0x00 => { 0x00 => {
@@ -145,12 +117,8 @@ impl Stack {
0x51 => self.mload(), 0x51 => self.mload(),
0x52 => self.mstore(), 0x52 => self.mstore(),
0x56 => self.jump(), 0x56 => self.jump(),
0x57 => { 0x57 => self.jump_i(),
self.jump_i(); 0x5b => self.jump_dest(),
}
0x5b => {
self.jump_dest();
}
_ => panic!("unimplemented {:x}", opcode), _ => panic!("unimplemented {:x}", opcode),
} }
} }
@@ -179,9 +147,7 @@ impl Stack {
} else { } else {
pos = (0x8e - opcode) as usize; pos = (0x8e - opcode) as usize;
} }
let tmp = self.stack[pos]; self.stack.swap(pos, l - 1);
self.stack[pos] = self.stack[l - 1];
self.stack[l - 1] = tmp;
self.pc += 1; self.pc += 1;
} }
0xf0 => { 0xf0 => {
@@ -197,382 +163,18 @@ impl Stack {
} }
self.gas -= self.opcodes.get(&opcode).unwrap().gas; self.gas -= self.opcodes.get(&opcode).unwrap().gas;
} }
return Vec::new(); Vec::new()
}
// arithmetic
// TODO instead of [u8;32] converted to BigUint, use custom type uint256 that implements all
// the arithmetic
fn add(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
self.push_arbitrary(&(b0 + b1).to_bytes_be());
}
fn mul(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
self.push_arbitrary(&(b0 * b1).to_bytes_be());
}
fn sub(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
if b0 >= b1 {
self.push_arbitrary(&(b0 - b1).to_bytes_be());
} else {
// 2**256
let max =
"115792089237316195423570985008687907853269984665640564039457584007913129639936"
.parse::<BigUint>()
.unwrap();
self.push_arbitrary(&(max + b0 - b1).to_bytes_be());
}
}
fn div(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
self.push_arbitrary(&(b0 / b1).to_bytes_be());
}
fn sdiv(&mut self) {
panic!("unimplemented");
}
fn modulus(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
self.push_arbitrary(&(b0 % b1).to_bytes_be());
}
fn smod(&mut self) {
panic!("unimplemented");
}
fn add_mod(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
let b2 = BigUint::from_bytes_be(&self.pop()[..]);
self.push_arbitrary(&(b0 + b1 % b2).to_bytes_be());
}
fn mul_mod(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
let b2 = BigUint::from_bytes_be(&self.pop()[..]);
self.push_arbitrary(&(b0 * b1 % b2).to_bytes_be());
}
fn exp(&mut self) {
panic!("unimplemented");
// let b0 = BigUint::from_bytes_be(&self.pop()[..]);
// let b1 = BigUint::from_bytes_be(&self.pop()[..]);
// self.push_arbitrary(&(pow(b0, b1)).to_bytes_be());
}
// boolean
// crypto
// contract context
fn calldata_load(&mut self, calldata: &[u8]) {
self.put_arbitrary(&calldata[self.calldata_i..self.calldata_i + 32]);
self.calldata_i += 32;
}
// blockchain context
// storage and execution
fn extend_mem(&mut self, start: usize, size: usize) {
if size <= self.mem.len() || start + size <= self.mem.len() {
return;
}
let old_size = self.mem.len() / 32;
let new_size = (start + size) / 32;
let old_total_fee = old_size * GMEMORY + old_size.pow(2) / GQUADRATICMEMDENOM;
let new_total_fee = new_size * GMEMORY + new_size.pow(2) / GQUADRATICMEMDENOM;
let mem_fee = new_total_fee - old_total_fee;
self.gas -= mem_fee as u64;
let mut new_bytes: Vec<u8> = vec![0; size];
self.mem.append(&mut new_bytes);
}
fn mload(&mut self) {
let pos = u256_to_u64(self.pop()) as usize;
self.extend_mem(pos as usize, 32);
let mem32 = self.mem[pos..pos + 32].to_vec();
self.push_arbitrary(&mem32);
}
fn mstore(&mut self) {
let pos = u256_to_u64(self.pop());
let val = self.pop();
self.extend_mem(pos as usize, 32);
self.mem[pos as usize..].copy_from_slice(&val);
}
fn jump(&mut self) {
// TODO that jump destination is valid
self.pc = u256_to_u64(self.pop()) as usize;
}
fn jump_i(&mut self) {
let new_pc = u256_to_u64(self.pop()) as usize;
if self.stack.len() > 0 {
let cond = u256_to_u64(self.pop()) as usize;
if cond != 0 {
self.pc = new_pc;
}
}
// let cont = self.pop();
// if cont {} // TODO depends on having impl Err in pop()
}
fn jump_dest(&mut self) {
// TODO
} }
} }
fn u256_to_u64(a: [u8; 32]) -> u64 { pub fn u256_to_u64(a: [u8; 32]) -> u64 {
let mut b8: [u8; 8] = [0; 8]; let mut b8: [u8; 8] = [0; 8];
b8.copy_from_slice(&a[32 - 8..32]); b8.copy_from_slice(&a[32 - 8..32]);
let pos = u64::from_be_bytes(b8); u64::from_be_bytes(b8)
pos
} }
fn str_to_u256(s: &str) -> [u8; 32] { pub fn str_to_u256(s: &str) -> [u8; 32] {
let bi = s.parse::<BigUint>().unwrap().to_bytes_be(); let bi = s.parse::<BigUint>().unwrap().to_bytes_be();
let mut r: [u8; 32] = [0; 32]; let mut r: [u8; 32] = [0; 32];
r[32 - bi.len()..].copy_from_slice(&bi[..]); r[32 - bi.len()..].copy_from_slice(&bi[..]);
r r
} }
struct Opcode {
name: String,
ins: u32,
outs: u32,
gas: u64,
// operation: fn(),
}
fn new_opcode(name: &str, ins: u32, outs: u32, gas: u64) -> Opcode {
Opcode {
name: name.to_string(),
ins,
outs,
gas,
}
}
fn new_opcodes() -> HashMap<u8, Opcode> {
let mut opcodes: HashMap<u8, Opcode> = HashMap::new();
// arithmetic
opcodes.insert(0x00, new_opcode("STOP", 0, 0, 0));
opcodes.insert(0x01, new_opcode("ADD", 2, 1, 3));
opcodes.insert(0x02, new_opcode("MUL", 2, 1, 5));
opcodes.insert(0x03, new_opcode("SUB", 2, 1, 3));
opcodes.insert(0x04, new_opcode("DIV", 2, 1, 5));
opcodes.insert(0x05, new_opcode("SDIV", 2, 1, 5));
opcodes.insert(0x06, new_opcode("MOD", 2, 1, 5));
opcodes.insert(0x07, new_opcode("SMOD", 2, 1, 5));
opcodes.insert(0x08, new_opcode("ADDMOD", 3, 1, 8));
opcodes.insert(0x09, new_opcode("MULMOD", 3, 1, 8));
opcodes.insert(0x0a, new_opcode("EXP", 2, 1, 10));
opcodes.insert(0x0b, new_opcode("SIGNEXTEND", 2, 1, 5));
// boolean
opcodes.insert(0x10, new_opcode("LT", 2, 1, 3));
opcodes.insert(0x11, new_opcode("GT", 2, 1, 3));
opcodes.insert(0x12, new_opcode("SLT", 2, 1, 3));
opcodes.insert(0x13, new_opcode("SGT", 2, 1, 3));
opcodes.insert(0x14, new_opcode("EQ", 2, 1, 3));
opcodes.insert(0x15, new_opcode("ISZERO", 1, 1, 3));
opcodes.insert(0x16, new_opcode("AND", 2, 1, 3));
opcodes.insert(0x17, new_opcode("OR", 2, 1, 3));
opcodes.insert(0x18, new_opcode("XOR", 2, 1, 3));
opcodes.insert(0x19, new_opcode("NOT", 1, 1, 3));
opcodes.insert(0x1a, new_opcode("BYTE", 2, 1, 3));
// crypto
opcodes.insert(0x20, new_opcode("SHA3", 2, 1, 30));
// contract context
opcodes.insert(0x30, new_opcode("ADDRESS", 0, 1, 2));
opcodes.insert(0x31, new_opcode("BALANCE", 1, 1, 20));
opcodes.insert(0x32, new_opcode("ORIGIN", 0, 1, 2));
opcodes.insert(0x33, new_opcode("CALLER", 0, 1, 2));
opcodes.insert(0x34, new_opcode("CALLVALUE", 0, 1, 2));
opcodes.insert(0x35, new_opcode("CALLDATALOAD", 1, 1, 3));
opcodes.insert(0x36, new_opcode("CALLDATASIZE", 0, 1, 2));
opcodes.insert(0x37, new_opcode("CALLDATACOPY", 3, 0, 3));
opcodes.insert(0x38, new_opcode("CODESIZE", 0, 1, 2));
opcodes.insert(0x39, new_opcode("CODECOPY", 3, 0, 3));
opcodes.insert(0x3a, new_opcode("GASPRICE", 0, 1, 2));
opcodes.insert(0x3b, new_opcode("EXTCODESIZE", 1, 1, 20));
opcodes.insert(0x3c, new_opcode("EXTCODECOPY", 4, 0, 20));
// blockchain context
opcodes.insert(0x40, new_opcode("BLOCKHASH", 1, 1, 20));
opcodes.insert(0x41, new_opcode("COINBASE", 0, 1, 2));
opcodes.insert(0x42, new_opcode("TIMESTAMP", 0, 1, 2));
opcodes.insert(0x43, new_opcode("NUMBER", 0, 1, 2));
opcodes.insert(0x44, new_opcode("DIFFICULTY", 0, 1, 2));
opcodes.insert(0x45, new_opcode("GASLIMIT", 0, 1, 2));
// storage and execution
opcodes.insert(0x50, new_opcode("POP", 1, 0, 2));
opcodes.insert(0x51, new_opcode("MLOAD", 1, 1, 3));
opcodes.insert(0x52, new_opcode("MSTORE", 2, 0, 3));
opcodes.insert(0x53, new_opcode("MSTORE8", 2, 0, 3));
opcodes.insert(0x54, new_opcode("SLOAD", 1, 1, 50));
opcodes.insert(0x55, new_opcode("SSTORE", 2, 0, 0));
opcodes.insert(0x56, new_opcode("JUMP", 1, 0, 8));
opcodes.insert(0x57, new_opcode("JUMPI", 2, 0, 10));
opcodes.insert(0x58, new_opcode("PC", 0, 1, 2));
opcodes.insert(0x59, new_opcode("MSIZE", 0, 1, 2));
opcodes.insert(0x5a, new_opcode("GAS", 0, 1, 2));
opcodes.insert(0x5b, new_opcode("JUMPDEST", 0, 0, 1));
// logging
opcodes.insert(0xa0, new_opcode("LOG0", 2, 0, 375));
opcodes.insert(0xa1, new_opcode("LOG1", 3, 0, 750));
opcodes.insert(0xa2, new_opcode("LOG2", 4, 0, 1125));
opcodes.insert(0xa3, new_opcode("LOG3", 5, 0, 1500));
opcodes.insert(0xa4, new_opcode("LOG4", 6, 0, 1875));
// closures
opcodes.insert(0xf0, new_opcode("CREATE", 3, 1, 32000));
opcodes.insert(0xf1, new_opcode("CALL", 7, 1, 40));
opcodes.insert(0xf2, new_opcode("CALLCODE", 7, 1, 40));
opcodes.insert(0xf3, new_opcode("RETURN", 2, 0, 0));
opcodes.insert(0xf4, new_opcode("DELEGATECALL", 6, 0, 40));
opcodes.insert(0xff, new_opcode("SUICIDE", 1, 0, 0));
for i in 1..33 {
let name = format!("PUSH{}", i);
opcodes.insert(0x5f + i, new_opcode(&name, 0, 1, 3));
}
for i in 1..17 {
let name = format!("DUP{}", i);
opcodes.insert(0x7f + i, new_opcode(&name, i as u32, i as u32 + 1, 3));
let name = format!("SWAP{}", i);
opcodes.insert(0x8f + i, new_opcode(&name, i as u32 + 1, i as u32 + 1, 3));
}
opcodes
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn stack_simple_push_pop() {
let mut s = Stack::new();
s.push(str_to_u256("1"));
s.push(str_to_u256("2"));
s.push(str_to_u256("3"));
assert_eq!(s.pop(), str_to_u256("3"));
assert_eq!(s.pop(), str_to_u256("2"));
assert_eq!(s.pop(), str_to_u256("1"));
// assert_eq!(s.pop(), str_to_u256("1"));
// assert_eq!(s.pop(), error); // TODO expect error as stack is empty
}
// arithmetic
#[test]
fn execute_opcodes_0() {
let code = hex::decode("6005600c01").unwrap(); // 5+12
let calldata = vec![];
let mut s = Stack::new();
s.execute(&code, &calldata, false);
assert_eq!(s.pop(), str_to_u256("17"));
assert_eq!(s.gas, 9999999991);
assert_eq!(s.pc, 5);
}
#[test]
fn execute_opcodes_1() {
let code = hex::decode("60056004016000526001601ff3").unwrap();
let calldata = vec![];
let mut s = Stack::new();
let out = s.execute(&code, &calldata, false);
assert_eq!(out[0], 0x09);
assert_eq!(s.gas, 9999999976);
assert_eq!(s.pc, 12);
// assert_eq!(s.pop(), err); // TODO expect error as stack is empty
}
#[test]
fn execute_opcodes_2() {
let code = hex::decode("61010161010201").unwrap();
let calldata = vec![];
let mut s = Stack::new();
s.execute(&code, &calldata, false);
// assert_eq!(out[0], 0x09);
assert_eq!(s.gas, 9999999991);
assert_eq!(s.pc, 7);
assert_eq!(s.pop(), str_to_u256("515"));
}
#[test]
fn execute_opcodes_3() {
// contains calldata
let code = hex::decode("60003560203501").unwrap();
let calldata = hex::decode("00000000000000000000000000000000000000000000000000000000000000050000000000000000000000000000000000000000000000000000000000000004").unwrap();
let mut s = Stack::new();
s.execute(&code, &calldata, false);
assert_eq!(s.gas, 9999999985);
assert_eq!(s.pc, 7);
assert_eq!(s.pop(), str_to_u256("9"));
}
// storage and execution
#[test]
fn execute_opcodes_4() {
// contains loops
let code = hex::decode("6000356000525b600160005103600052600051600657").unwrap();
let calldata =
hex::decode("0000000000000000000000000000000000000000000000000000000000000005")
.unwrap();
let mut s = Stack::new();
s.execute(&code, &calldata, false);
assert_eq!(s.gas, 9999999795);
assert_eq!(s.pc, 22);
assert_eq!(s.stack.len(), 0);
}
#[test]
fn execute_opcodes_5() {
// contains loops, without using mem
let code = hex::decode("6000355b6001900380600357").unwrap();
let calldata =
hex::decode("0000000000000000000000000000000000000000000000000000000000000001")
.unwrap();
let mut s = Stack::new();
s.execute(&code, &calldata, false);
assert_eq!(s.gas, 9999999968);
assert_eq!(s.pc, 12);
let code = hex::decode("6000355b6001900380600357").unwrap();
let calldata =
hex::decode("0000000000000000000000000000000000000000000000000000000000000002")
.unwrap();
let mut s = Stack::new();
s.execute(&code, &calldata, false);
assert_eq!(s.gas, 9999999942);
assert_eq!(s.pc, 12);
let code = hex::decode("6000355b6001900380600357").unwrap();
let calldata =
hex::decode("0000000000000000000000000000000000000000000000000000000000000005")
.unwrap();
let mut s = Stack::new();
s.execute(&code, &calldata, false);
assert_eq!(s.gas, 9999999864);
assert_eq!(s.pc, 12);
}
}

271
src/opcodes.rs Normal file
View File

@@ -0,0 +1,271 @@
use super::*;
// Non-opcode gas prices
const GDEFAULT: usize = 1;
const GMEMORY: usize = 3;
const GQUADRATICMEMDENOM: usize = 512; // 1 gas per 512 quadwords
const GSTORAGEREFUND: usize = 15000;
const GSTORAGEKILL: usize = 5000;
const GSTORAGEMOD: usize = 5000;
const GSTORAGEADD: usize = 20000;
const GEXPONENTBYTE: usize = 10; // cost of EXP exponent per byte
const GCOPY: usize = 3; // cost to copy one 32 byte word
const GCONTRACTBYTE: usize = 200; // one byte of code in contract creation
const GCALLVALUETRANSFER: usize = 9000; // non-zero-valued call
const GLOGBYTE: usize = 8; // cost of a byte of logdata
const GTXCOST: usize = 21000; // TX BASE GAS COST
const GTXDATAZERO: usize = 4; // TX DATA ZERO BYTE GAS COST
const GTXDATANONZERO: usize = 68; // TX DATA NON ZERO BYTE GAS COST
const GSHA3WORD: usize = 6; // Cost of SHA3 per word
const GSHA256BASE: usize = 60; // Base c of SHA256
const GSHA256WORD: usize = 12; // Cost of SHA256 per word
const GRIPEMD160BASE: usize = 600; // Base cost of RIPEMD160
const GRIPEMD160WORD: usize = 120; // Cost of RIPEMD160 per word
const GIDENTITYBASE: usize = 15; // Base cost of indentity
const GIDENTITYWORD: usize = 3; // Cost of identity per word
const GECRECOVER: usize = 3000; // Cost of ecrecover op
const GSTIPEND: usize = 2300;
const GCALLNEWACCOUNT: usize = 25000;
const GSUICIDEREFUND: usize = 24000;
pub struct Opcode {
pub name: String,
pub ins: u32,
pub outs: u32,
pub gas: u64,
// operation: fn(),
}
pub fn new_opcode(name: &str, ins: u32, outs: u32, gas: u64) -> Opcode {
Opcode {
name: name.to_string(),
ins,
outs,
gas,
}
}
pub fn new_opcodes() -> HashMap<u8, Opcode> {
let mut opcodes: HashMap<u8, Opcode> = HashMap::new();
// arithmetic
opcodes.insert(0x00, new_opcode("STOP", 0, 0, 0));
opcodes.insert(0x01, new_opcode("ADD", 2, 1, 3));
opcodes.insert(0x02, new_opcode("MUL", 2, 1, 5));
opcodes.insert(0x03, new_opcode("SUB", 2, 1, 3));
opcodes.insert(0x04, new_opcode("DIV", 2, 1, 5));
opcodes.insert(0x05, new_opcode("SDIV", 2, 1, 5));
opcodes.insert(0x06, new_opcode("MOD", 2, 1, 5));
opcodes.insert(0x07, new_opcode("SMOD", 2, 1, 5));
opcodes.insert(0x08, new_opcode("ADDMOD", 3, 1, 8));
opcodes.insert(0x09, new_opcode("MULMOD", 3, 1, 8));
opcodes.insert(0x0a, new_opcode("EXP", 2, 1, 10));
opcodes.insert(0x0b, new_opcode("SIGNEXTEND", 2, 1, 5));
// boolean
opcodes.insert(0x10, new_opcode("LT", 2, 1, 3));
opcodes.insert(0x11, new_opcode("GT", 2, 1, 3));
opcodes.insert(0x12, new_opcode("SLT", 2, 1, 3));
opcodes.insert(0x13, new_opcode("SGT", 2, 1, 3));
opcodes.insert(0x14, new_opcode("EQ", 2, 1, 3));
opcodes.insert(0x15, new_opcode("ISZERO", 1, 1, 3));
opcodes.insert(0x16, new_opcode("AND", 2, 1, 3));
opcodes.insert(0x17, new_opcode("OR", 2, 1, 3));
opcodes.insert(0x18, new_opcode("XOR", 2, 1, 3));
opcodes.insert(0x19, new_opcode("NOT", 1, 1, 3));
opcodes.insert(0x1a, new_opcode("BYTE", 2, 1, 3));
// crypto
opcodes.insert(0x20, new_opcode("SHA3", 2, 1, 30));
// contract context
opcodes.insert(0x30, new_opcode("ADDRESS", 0, 1, 2));
opcodes.insert(0x31, new_opcode("BALANCE", 1, 1, 20));
opcodes.insert(0x32, new_opcode("ORIGIN", 0, 1, 2));
opcodes.insert(0x33, new_opcode("CALLER", 0, 1, 2));
opcodes.insert(0x34, new_opcode("CALLVALUE", 0, 1, 2));
opcodes.insert(0x35, new_opcode("CALLDATALOAD", 1, 1, 3));
opcodes.insert(0x36, new_opcode("CALLDATASIZE", 0, 1, 2));
opcodes.insert(0x37, new_opcode("CALLDATACOPY", 3, 0, 3));
opcodes.insert(0x38, new_opcode("CODESIZE", 0, 1, 2));
opcodes.insert(0x39, new_opcode("CODECOPY", 3, 0, 3));
opcodes.insert(0x3a, new_opcode("GASPRICE", 0, 1, 2));
opcodes.insert(0x3b, new_opcode("EXTCODESIZE", 1, 1, 20));
opcodes.insert(0x3c, new_opcode("EXTCODECOPY", 4, 0, 20));
// blockchain context
opcodes.insert(0x40, new_opcode("BLOCKHASH", 1, 1, 20));
opcodes.insert(0x41, new_opcode("COINBASE", 0, 1, 2));
opcodes.insert(0x42, new_opcode("TIMESTAMP", 0, 1, 2));
opcodes.insert(0x43, new_opcode("NUMBER", 0, 1, 2));
opcodes.insert(0x44, new_opcode("DIFFICULTY", 0, 1, 2));
opcodes.insert(0x45, new_opcode("GASLIMIT", 0, 1, 2));
// storage and execution
opcodes.insert(0x50, new_opcode("POP", 1, 0, 2));
opcodes.insert(0x51, new_opcode("MLOAD", 1, 1, 3));
opcodes.insert(0x52, new_opcode("MSTORE", 2, 0, 3));
opcodes.insert(0x53, new_opcode("MSTORE8", 2, 0, 3));
opcodes.insert(0x54, new_opcode("SLOAD", 1, 1, 50));
opcodes.insert(0x55, new_opcode("SSTORE", 2, 0, 0));
opcodes.insert(0x56, new_opcode("JUMP", 1, 0, 8));
opcodes.insert(0x57, new_opcode("JUMPI", 2, 0, 10));
opcodes.insert(0x58, new_opcode("PC", 0, 1, 2));
opcodes.insert(0x59, new_opcode("MSIZE", 0, 1, 2));
opcodes.insert(0x5a, new_opcode("GAS", 0, 1, 2));
opcodes.insert(0x5b, new_opcode("JUMPDEST", 0, 0, 1));
// logging
opcodes.insert(0xa0, new_opcode("LOG0", 2, 0, 375));
opcodes.insert(0xa1, new_opcode("LOG1", 3, 0, 750));
opcodes.insert(0xa2, new_opcode("LOG2", 4, 0, 1125));
opcodes.insert(0xa3, new_opcode("LOG3", 5, 0, 1500));
opcodes.insert(0xa4, new_opcode("LOG4", 6, 0, 1875));
// closures
opcodes.insert(0xf0, new_opcode("CREATE", 3, 1, 32000));
opcodes.insert(0xf1, new_opcode("CALL", 7, 1, 40));
opcodes.insert(0xf2, new_opcode("CALLCODE", 7, 1, 40));
opcodes.insert(0xf3, new_opcode("RETURN", 2, 0, 0));
opcodes.insert(0xf4, new_opcode("DELEGATECALL", 6, 0, 40));
opcodes.insert(0xff, new_opcode("SUICIDE", 1, 0, 0));
for i in 1..33 {
let name = format!("PUSH{}", i);
opcodes.insert(0x5f + i, new_opcode(&name, 0, 1, 3));
}
for i in 1..17 {
let name = format!("DUP{}", i);
opcodes.insert(0x7f + i, new_opcode(&name, i as u32, i as u32 + 1, 3));
let name = format!("SWAP{}", i);
opcodes.insert(0x8f + i, new_opcode(&name, i as u32 + 1, i as u32 + 1, 3));
}
opcodes
}
impl Stack {
// arithmetic
// TODO instead of [u8;32] converted to BigUint, use custom type uint256 that implements all
// the arithmetic
pub fn add(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
self.push_arbitrary(&(b0 + b1).to_bytes_be());
}
pub fn mul(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
self.push_arbitrary(&(b0 * b1).to_bytes_be());
}
pub fn sub(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
if b0 >= b1 {
self.push_arbitrary(&(b0 - b1).to_bytes_be());
} else {
// 2**256
let max =
"115792089237316195423570985008687907853269984665640564039457584007913129639936"
.parse::<BigUint>()
.unwrap();
self.push_arbitrary(&(max + b0 - b1).to_bytes_be());
}
}
pub fn div(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
self.push_arbitrary(&(b0 / b1).to_bytes_be());
}
pub fn sdiv(&mut self) {
panic!("unimplemented");
}
pub fn modulus(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
self.push_arbitrary(&(b0 % b1).to_bytes_be());
}
pub fn smod(&mut self) {
panic!("unimplemented");
}
pub fn add_mod(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
let b2 = BigUint::from_bytes_be(&self.pop()[..]);
self.push_arbitrary(&(b0 + b1 % b2).to_bytes_be());
}
pub fn mul_mod(&mut self) {
let b0 = BigUint::from_bytes_be(&self.pop()[..]);
let b1 = BigUint::from_bytes_be(&self.pop()[..]);
let b2 = BigUint::from_bytes_be(&self.pop()[..]);
self.push_arbitrary(&(b0 * b1 % b2).to_bytes_be());
}
pub fn exp(&mut self) {
panic!("unimplemented");
// let b0 = BigUint::from_bytes_be(&self.pop()[..]);
// let b1 = BigUint::from_bytes_be(&self.pop()[..]);
// self.push_arbitrary(&(pow(b0, b1)).to_bytes_be());
}
// boolean
// crypto
// contract context
pub fn calldata_load(&mut self, calldata: &[u8]) {
self.put_arbitrary(&calldata[self.calldata_i..self.calldata_i + 32]);
self.calldata_i += 32;
}
// blockchain context
// storage and execution
pub fn extend_mem(&mut self, start: usize, size: usize) {
if size <= self.mem.len() || start + size <= self.mem.len() {
return;
}
let old_size = self.mem.len() / 32;
let new_size = (start + size) / 32;
let old_total_fee = old_size * GMEMORY + old_size.pow(2) / GQUADRATICMEMDENOM;
let new_total_fee = new_size * GMEMORY + new_size.pow(2) / GQUADRATICMEMDENOM;
let mem_fee = new_total_fee - old_total_fee;
self.gas -= mem_fee as u64;
let mut new_bytes: Vec<u8> = vec![0; size];
self.mem.append(&mut new_bytes);
}
pub fn mload(&mut self) {
let pos = u256_to_u64(self.pop()) as usize;
self.extend_mem(pos as usize, 32);
let mem32 = self.mem[pos..pos + 32].to_vec();
self.push_arbitrary(&mem32);
}
pub fn mstore(&mut self) {
let pos = u256_to_u64(self.pop());
let val = self.pop();
self.extend_mem(pos as usize, 32);
self.mem[pos as usize..].copy_from_slice(&val);
}
pub fn jump(&mut self) {
// TODO that jump destination is valid
self.pc = u256_to_u64(self.pop()) as usize;
}
pub fn jump_i(&mut self) {
let new_pc = u256_to_u64(self.pop()) as usize;
if !self.stack.is_empty() {
let cond = u256_to_u64(self.pop()) as usize;
if cond != 0 {
self.pc = new_pc;
}
}
// let cont = self.pop();
// if cont {} // TODO depends on having impl Err in pop()
}
pub fn jump_dest(&mut self) {
// TODO
}
}

130
tests/execute.rs Normal file
View File

@@ -0,0 +1,130 @@
use evm::*;
#[test]
fn stack_simple_push_pop() {
let mut s = Stack::new();
s.push(str_to_u256("1"));
s.push(str_to_u256("2"));
s.push(str_to_u256("3"));
assert_eq!(s.pop(), str_to_u256("3"));
assert_eq!(s.pop(), str_to_u256("2"));
assert_eq!(s.pop(), str_to_u256("1"));
// assert_eq!(s.pop(), error); // TODO expect error as stack is empty
}
// arithmetic
#[test]
fn execute_opcodes_0() {
let code = hex::decode("6005600c01").unwrap(); // 5+12
let calldata = vec![];
let mut s = Stack::new();
s.execute(&code, &calldata, false);
assert_eq!(s.pop(), str_to_u256("17"));
assert_eq!(s.gas, 9999999991);
assert_eq!(s.pc, 5);
}
#[test]
fn execute_opcodes_1() {
let code = hex::decode("60056004016000526001601ff3").unwrap();
let calldata = vec![];
let mut s = Stack::new();
let out = s.execute(&code, &calldata, false);
assert_eq!(out[0], 0x09);
assert_eq!(s.gas, 9999999976);
assert_eq!(s.pc, 12);
// assert_eq!(s.pop(), err); // TODO expect error as stack is empty
}
#[test]
fn execute_opcodes_2() {
let code = hex::decode("61010161010201").unwrap();
let calldata = vec![];
let mut s = Stack::new();
s.execute(&code, &calldata, false);
// assert_eq!(out[0], 0x09);
assert_eq!(s.gas, 9999999991);
assert_eq!(s.pc, 7);
assert_eq!(s.pop(), str_to_u256("515"));
}
#[test]
fn execute_opcodes_3() {
// contains calldata
let code = hex::decode("60003560203501").unwrap();
let calldata = hex::decode("00000000000000000000000000000000000000000000000000000000000000050000000000000000000000000000000000000000000000000000000000000004").unwrap();
let mut s = Stack::new();
s.execute(&code, &calldata, false);
assert_eq!(s.gas, 9999999985);
assert_eq!(s.pc, 7);
assert_eq!(s.pop(), str_to_u256("9"));
}
// storage and execution
#[test]
fn execute_opcodes_4() {
// contains loops
let code = hex::decode("6000356000525b600160005103600052600051600657").unwrap();
let calldata =
hex::decode("0000000000000000000000000000000000000000000000000000000000000005").unwrap();
let mut s = Stack::new();
s.execute(&code, &calldata, false);
assert_eq!(s.gas, 9999999795);
assert_eq!(s.pc, 22);
assert_eq!(s.stack.len(), 0);
}
#[test]
fn execute_opcodes_5() {
// contains loops, without using mem
let code = hex::decode("6000355b6001900380600357").unwrap();
let calldata =
hex::decode("0000000000000000000000000000000000000000000000000000000000000001").unwrap();
let mut s = Stack::new();
s.execute(&code, &calldata, false);
assert_eq!(s.gas, 9999999968);
assert_eq!(s.pc, 12);
let code = hex::decode("6000355b6001900380600357").unwrap();
let calldata =
hex::decode("0000000000000000000000000000000000000000000000000000000000000002").unwrap();
let mut s = Stack::new();
s.execute(&code, &calldata, false);
assert_eq!(s.gas, 9999999942);
assert_eq!(s.pc, 12);
let code = hex::decode("6000355b6001900380600357").unwrap();
let calldata =
hex::decode("0000000000000000000000000000000000000000000000000000000000000005").unwrap();
let mut s = Stack::new();
s.execute(&code, &calldata, false);
assert_eq!(s.gas, 9999999864);
assert_eq!(s.pc, 12);
}
// #[test]
// fn execute_opcodes_6() {
// // 0x36: calldata_size
// let code = hex::decode("366020036101000a600035045b6001900380600c57").unwrap();
// let calldata = hex::decode("05").unwrap();
//
// let mut s = Stack::new();
// s.execute(&code, &calldata, false);
//
// assert_eq!(s.gas, 9999999788);
// assert_eq!(s.pc, 21);
// assert_eq!(s.stack.len(), 0);
// }