272 lines
9.6 KiB
Rust
272 lines
9.6 KiB
Rust
use std::cmp::min;
|
|
use std::fmt;
|
|
use std::mem;
|
|
use std::slice;
|
|
use util::uint::*;
|
|
use util::hash::*;
|
|
use util::sha3::*;
|
|
use util::bytes::*;
|
|
use rustc_serialize::json::Json;
|
|
use std::io::Write;
|
|
use util::crypto::*;
|
|
|
|
/// Definition of a contract whose implementation is built-in.
|
|
pub struct Builtin {
|
|
/// The gas cost of running this built-in for the given size of input data.
|
|
pub cost: Box<Fn(usize) -> U256>, // TODO: U256 should be bignum.
|
|
/// Run this built-in function with the input being the first argument and the output
|
|
/// being placed into the second.
|
|
pub execute: Box<Fn(&[u8], &mut [u8])>,
|
|
}
|
|
|
|
impl fmt::Debug for Builtin {
|
|
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
|
|
write!(f, "<Builtin>")
|
|
}
|
|
}
|
|
|
|
impl Builtin {
|
|
/// Create a new object from components.
|
|
pub fn new(cost: Box<Fn(usize) -> U256>, execute: Box<Fn(&[u8], &mut [u8])>) -> Builtin {
|
|
Builtin {cost: cost, execute: execute}
|
|
}
|
|
|
|
/// Create a new object from a builtin-function name with a linear cost associated with input size.
|
|
pub fn from_named_linear(name: &str, base_cost: usize, word_cost: usize) -> Option<Builtin> {
|
|
new_builtin_exec(name).map(|b| {
|
|
let cost = Box::new(move|s: usize| -> U256 {
|
|
U256::from(base_cost) + U256::from(word_cost) * U256::from((s + 31) / 32)
|
|
});
|
|
Self::new(cost, b)
|
|
})
|
|
}
|
|
|
|
/// Create a builtin from JSON.
|
|
///
|
|
/// JSON must be of the form `{ "name": "identity", "linear": {"base": 10, "word": 20} }`.
|
|
pub fn from_json(json: &Json) -> Option<Builtin> {
|
|
// NICE: figure out a more convenient means of handing errors here.
|
|
if let Json::String(ref name) = json["name"] {
|
|
if let Json::Object(ref o) = json["linear"] {
|
|
if let Json::U64(ref word) = o["word"] {
|
|
if let Json::U64(ref base) = o["base"] {
|
|
return Self::from_named_linear(&name[..], *base as usize, *word as usize);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
None
|
|
}
|
|
}
|
|
|
|
/*
|
|
ETH_REGISTER_PRECOMPILED(ecrecover)(bytesConstRef _in, bytesRef _out)
|
|
{
|
|
struct inType
|
|
{
|
|
h256 hash;
|
|
h256 v;
|
|
h256 r;
|
|
h256 s;
|
|
} in;
|
|
|
|
memcpy(&in, _in.data(), min(_in.size(), sizeof(in)));
|
|
|
|
h256 ret;
|
|
u256 v = (u256)in.v;
|
|
if (v >= 27 && v <= 28)
|
|
{
|
|
SignatureStruct sig(in.r, in.s, (byte)((int)v - 27));
|
|
if (sig.isValid())
|
|
{
|
|
try
|
|
{
|
|
if (Public rec = recover(sig, in.hash))
|
|
{
|
|
ret = dev::sha3(rec);
|
|
memset(ret.data(), 0, 12);
|
|
ret.ref().copyTo(_out);
|
|
}
|
|
}
|
|
catch (...) {}
|
|
}
|
|
}
|
|
}
|
|
|
|
ETH_REGISTER_PRECOMPILED(sha256)(bytesConstRef _in, bytesRef _out)
|
|
{
|
|
dev::sha256(_in).ref().copyTo(_out);
|
|
}
|
|
|
|
ETH_REGISTER_PRECOMPILED(ripemd160)(bytesConstRef _in, bytesRef _out)
|
|
{
|
|
h256(dev::ripemd160(_in), h256::AlignRight).ref().copyTo(_out);
|
|
}
|
|
*/
|
|
|
|
/// Simple trait to allow for raw population of a Sized object from a byte slice.
|
|
trait Populatable {
|
|
/// Populate self from byte slice `d` in a raw fashion.
|
|
fn populate_raw(&mut self, d: &[u8]);
|
|
}
|
|
|
|
impl<T> Populatable for T where T: Sized {
|
|
fn populate_raw(&mut self, d: &[u8]) {
|
|
unsafe {
|
|
slice::from_raw_parts_mut(self as *mut T as *mut u8, mem::size_of::<T>())
|
|
}.write(&d).unwrap();
|
|
}
|
|
}
|
|
|
|
/// Create a new builtin executor according to `name`.
|
|
/// TODO: turn in to a factory with dynamic registration.
|
|
pub fn new_builtin_exec(name: &str) -> Option<Box<Fn(&[u8], &mut [u8])>> {
|
|
match name {
|
|
"identity" => Some(Box::new(move|input: &[u8], output: &mut[u8]| {
|
|
for i in 0..min(input.len(), output.len()) {
|
|
output[i] = input[i];
|
|
}
|
|
})),
|
|
"ecrecover" => Some(Box::new(move|_input: &[u8], _output: &mut[u8]| {
|
|
#[repr(packed)]
|
|
#[derive(Debug)]
|
|
struct InType {
|
|
hash: H256,
|
|
v: H256,
|
|
r: H256,
|
|
s: H256,
|
|
}
|
|
let mut it: InType = InType { hash: H256::new(), v: H256::new(), r: H256::new(), s: H256::new() };
|
|
it.populate_raw(_input);
|
|
if it.v == H256::from(&U256::from(27)) || it.v == H256::from(&U256::from(28)) {
|
|
let s = Signature::from_rsv(&it.r, &it.s, it.v[31] - 27);
|
|
if is_valid(&s) {
|
|
match recover(&s, &it.hash) {
|
|
Ok(p) => {
|
|
let r = p.as_slice().sha3();
|
|
// NICE: optimise and separate out into populate-like function
|
|
for i in 0..min(32, _output.len()) {
|
|
_output[i] = if i < 12 {0} else {r[i]};
|
|
}
|
|
}
|
|
_ => {}
|
|
};
|
|
}
|
|
}
|
|
})),
|
|
"sha256" => Some(Box::new(move|_input: &[u8], _output: &mut[u8]| {
|
|
unimplemented!();
|
|
})),
|
|
"ripemd160" => Some(Box::new(move|_input: &[u8], _output: &mut[u8]| {
|
|
unimplemented!();
|
|
})),
|
|
_ => None
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn identity() {
|
|
let f = new_builtin_exec("identity").unwrap();
|
|
let i = [0u8, 1, 2, 3];
|
|
|
|
let mut o2 = [255u8; 2];
|
|
f(&i[..], &mut o2[..]);
|
|
assert_eq!(i[0..2], o2);
|
|
|
|
let mut o4 = [255u8; 4];
|
|
f(&i[..], &mut o4[..]);
|
|
assert_eq!(i, o4);
|
|
|
|
let mut o8 = [255u8; 8];
|
|
f(&i[..], &mut o8[..]);
|
|
assert_eq!(i, o8[..4]);
|
|
assert_eq!([255u8; 4], o8[4..]);
|
|
}
|
|
|
|
#[test]
|
|
fn ecrecover() {
|
|
use rustc_serialize::hex::FromHex;
|
|
/*let k = KeyPair::from_secret(b"test".sha3()).unwrap();
|
|
let a: Address = From::from(k.public().sha3());
|
|
println!("Address: {}", a);
|
|
let m = b"hello world".sha3();
|
|
println!("Message: {}", m);
|
|
let s = k.sign(&m).unwrap();
|
|
println!("Signed: {}", s);*/
|
|
|
|
let f = new_builtin_exec("ecrecover").unwrap();
|
|
let i = FromHex::from_hex("47173285a8d7341e5e972fc677286384f802f8ef42a5ec5f03bbfa254cb01fad000000000000000000000000000000000000000000000000000000000000001b650acf9d3f5f0a2c799776a1254355d5f4061762a237396a99a0e0e3fc2bcd6729514a0dacb2e623ac4abd157cb18163ff942280db4d5caad66ddf941ba12e03").unwrap();
|
|
|
|
let mut o = [255u8; 32];
|
|
f(&i[..], &mut o[..]);
|
|
assert_eq!(&o[..], &(FromHex::from_hex("000000000000000000000000c08b5542d177ac6686946920409741463a15dddb").unwrap())[..]);
|
|
|
|
let mut o8 = [255u8; 8];
|
|
f(&i[..], &mut o8[..]);
|
|
assert_eq!(&o8[..], &(FromHex::from_hex("0000000000000000").unwrap())[..]);
|
|
|
|
let mut o34 = [255u8; 34];
|
|
f(&i[..], &mut o34[..]);
|
|
assert_eq!(&o34[..], &(FromHex::from_hex("000000000000000000000000c08b5542d177ac6686946920409741463a15dddbffff").unwrap())[..]);
|
|
|
|
let i_bad = FromHex::from_hex("47173285a8d7341e5e972fc677286384f802f8ef42a5ec5f03bbfa254cb01fad000000000000000000000000000000000000000000000000000000000000001a650acf9d3f5f0a2c799776a1254355d5f4061762a237396a99a0e0e3fc2bcd6729514a0dacb2e623ac4abd157cb18163ff942280db4d5caad66ddf941ba12e03").unwrap();
|
|
let mut o = [255u8; 32];
|
|
f(&i_bad[..], &mut o[..]);
|
|
assert_eq!(&o[..], &(FromHex::from_hex("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff").unwrap())[..]);
|
|
|
|
let i_bad = FromHex::from_hex("47173285a8d7341e5e972fc677286384f802f8ef42a5ec5f03bbfa254cb01fad000000000000000000000000000000000000000000000000000000000000001b000000000000000000000000000000000000000000000000000000000000001b0000000000000000000000000000000000000000000000000000000000000000").unwrap();
|
|
let mut o = [255u8; 32];
|
|
f(&i_bad[..], &mut o[..]);
|
|
assert_eq!(&o[..], &(FromHex::from_hex("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff").unwrap())[..]);
|
|
|
|
let i_bad = FromHex::from_hex("47173285a8d7341e5e972fc677286384f802f8ef42a5ec5f03bbfa254cb01fad000000000000000000000000000000000000000000000000000000000000001b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001b").unwrap();
|
|
let mut o = [255u8; 32];
|
|
f(&i_bad[..], &mut o[..]);
|
|
assert_eq!(&o[..], &(FromHex::from_hex("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff").unwrap())[..]);
|
|
|
|
let i_bad = FromHex::from_hex("47173285a8d7341e5e972fc677286384f802f8ef42a5ec5f03bbfa254cb01fad000000000000000000000000000000000000000000000000000000000000001bffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff000000000000000000000000000000000000000000000000000000000000001b").unwrap();
|
|
let mut o = [255u8; 32];
|
|
f(&i_bad[..], &mut o[..]);
|
|
assert_eq!(&o[..], &(FromHex::from_hex("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff").unwrap())[..]);
|
|
|
|
let i_bad = FromHex::from_hex("47173285a8d7341e5e972fc677286384f802f8ef42a5ec5f03bbfa254cb01fad000000000000000000000000000000000000000000000000000000000000001b000000000000000000000000000000000000000000000000000000000000001bffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff").unwrap();
|
|
let mut o = [255u8; 32];
|
|
f(&i_bad[..], &mut o[..]);
|
|
assert_eq!(&o[..], &(FromHex::from_hex("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff").unwrap())[..]);
|
|
|
|
// TODO: Should this (corrupted version of the above) fail rather than returning some address?
|
|
/* let i_bad = FromHex::from_hex("48173285a8d7341e5e972fc677286384f802f8ef42a5ec5f03bbfa254cb01fad000000000000000000000000000000000000000000000000000000000000001b650acf9d3f5f0a2c799776a1254355d5f4061762a237396a99a0e0e3fc2bcd6729514a0dacb2e623ac4abd157cb18163ff942280db4d5caad66ddf941ba12e03").unwrap();
|
|
let mut o = [255u8; 32];
|
|
f(&i_bad[..], &mut o[..]);
|
|
assert_eq!(&o[..], &(FromHex::from_hex("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff").unwrap())[..]);*/
|
|
}
|
|
|
|
#[test]
|
|
fn from_named_linear() {
|
|
let b = Builtin::from_named_linear("identity", 10, 20).unwrap();
|
|
assert_eq!((*b.cost)(0), U256::from(10));
|
|
assert_eq!((*b.cost)(1), U256::from(30));
|
|
assert_eq!((*b.cost)(32), U256::from(30));
|
|
assert_eq!((*b.cost)(33), U256::from(50));
|
|
|
|
let i = [0u8, 1, 2, 3];
|
|
let mut o = [255u8; 4];
|
|
(*b.execute)(&i[..], &mut o[..]);
|
|
assert_eq!(i, o);
|
|
}
|
|
|
|
#[test]
|
|
fn from_json() {
|
|
let text = "{ \"name\": \"identity\", \"linear\": {\"base\": 10, \"word\": 20} }";
|
|
let json = Json::from_str(text).unwrap();
|
|
let b = Builtin::from_json(&json).unwrap();
|
|
assert_eq!((*b.cost)(0), U256::from(10));
|
|
assert_eq!((*b.cost)(1), U256::from(30));
|
|
assert_eq!((*b.cost)(32), U256::from(30));
|
|
assert_eq!((*b.cost)(33), U256::from(50));
|
|
|
|
let i = [0u8, 1, 2, 3];
|
|
let mut o = [255u8; 4];
|
|
(*b.execute)(&i[..], &mut o[..]);
|
|
assert_eq!(i, o);
|
|
} |