2019-04-15 05:45:05 +00:00
|
|
|
#![recursion_limit = "256"]
|
|
|
|
extern crate proc_macro;
|
|
|
|
|
|
|
|
use proc_macro::TokenStream;
|
2019-09-30 02:32:44 +00:00
|
|
|
use quote::quote;
|
2019-11-05 04:46:52 +00:00
|
|
|
use std::collections::HashMap;
|
|
|
|
use syn::{parse_macro_input, Attribute, DeriveInput, Meta};
|
2019-04-15 05:45:05 +00:00
|
|
|
|
2019-11-05 04:46:52 +00:00
|
|
|
/// Return a Vec of `syn::Ident` for each named field in the struct, whilst filtering out fields
|
2019-04-15 05:45:05 +00:00
|
|
|
/// that should not be hashed.
|
|
|
|
///
|
|
|
|
/// # Panics
|
|
|
|
/// Any unnamed struct field (like in a tuple struct) will raise a panic at compile time.
|
2019-11-05 04:46:52 +00:00
|
|
|
fn get_hashable_fields<'a>(struct_data: &'a syn::DataStruct) -> Vec<&'a syn::Ident> {
|
|
|
|
get_hashable_fields_and_their_caches(struct_data)
|
|
|
|
.into_iter()
|
|
|
|
.map(|(ident, _, _)| ident)
|
|
|
|
.collect()
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Return a Vec of the hashable fields of a struct, and each field's type and optional cache field.
|
|
|
|
fn get_hashable_fields_and_their_caches<'a>(
|
|
|
|
struct_data: &'a syn::DataStruct,
|
|
|
|
) -> Vec<(&'a syn::Ident, syn::Type, Option<syn::Ident>)> {
|
2019-04-15 05:45:05 +00:00
|
|
|
struct_data
|
|
|
|
.fields
|
|
|
|
.iter()
|
|
|
|
.filter_map(|f| {
|
|
|
|
if should_skip_hashing(&f) {
|
|
|
|
None
|
|
|
|
} else {
|
2019-11-05 04:46:52 +00:00
|
|
|
let ident = f
|
|
|
|
.ident
|
|
|
|
.as_ref()
|
|
|
|
.expect("tree_hash_derive only supports named struct fields");
|
|
|
|
let opt_cache_field = get_cache_field_for(&f);
|
|
|
|
Some((ident, f.ty.clone(), opt_cache_field))
|
2019-04-15 05:45:05 +00:00
|
|
|
}
|
|
|
|
})
|
|
|
|
.collect()
|
|
|
|
}
|
|
|
|
|
2019-11-05 04:46:52 +00:00
|
|
|
/// Parse the cached_tree_hash attribute for a field.
|
|
|
|
///
|
|
|
|
/// Extract the cache field name from `#[cached_tree_hash(cache_field_name)]`
|
|
|
|
///
|
|
|
|
/// Return `Some(cache_field_name)` if the field has a cached tree hash attribute,
|
|
|
|
/// or `None` otherwise.
|
|
|
|
fn get_cache_field_for<'a>(field: &'a syn::Field) -> Option<syn::Ident> {
|
|
|
|
use syn::{MetaList, NestedMeta};
|
|
|
|
|
|
|
|
let parsed_attrs = cached_tree_hash_attr_metas(&field.attrs);
|
|
|
|
if let [Meta::List(MetaList { nested, .. })] = &parsed_attrs[..] {
|
|
|
|
nested.iter().find_map(|x| match x {
|
|
|
|
NestedMeta::Meta(Meta::Word(cache_field_ident)) => Some(cache_field_ident.clone()),
|
|
|
|
_ => None,
|
|
|
|
})
|
|
|
|
} else {
|
|
|
|
None
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Process the `cached_tree_hash` attributes from a list of attributes into structured `Meta`s.
|
|
|
|
fn cached_tree_hash_attr_metas(attrs: &[Attribute]) -> Vec<Meta> {
|
|
|
|
attrs
|
|
|
|
.iter()
|
|
|
|
.filter(|attr| attr.path.is_ident("cached_tree_hash"))
|
|
|
|
.flat_map(|attr| attr.parse_meta())
|
|
|
|
.collect()
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Parse the top-level cached_tree_hash struct attribute.
|
|
|
|
///
|
|
|
|
/// Return the type from `#[cached_tree_hash(type = "T")]`.
|
|
|
|
///
|
|
|
|
/// **Panics** if the attribute is missing or the type is malformed.
|
|
|
|
fn parse_cached_tree_hash_struct_attrs(attrs: &[Attribute]) -> syn::Type {
|
|
|
|
use syn::{Lit, MetaList, MetaNameValue, NestedMeta};
|
|
|
|
|
|
|
|
let parsed_attrs = cached_tree_hash_attr_metas(attrs);
|
|
|
|
if let [Meta::List(MetaList { nested, .. })] = &parsed_attrs[..] {
|
|
|
|
let eqns = nested
|
|
|
|
.iter()
|
|
|
|
.flat_map(|x| match x {
|
|
|
|
NestedMeta::Meta(Meta::NameValue(MetaNameValue {
|
|
|
|
ident,
|
|
|
|
lit: Lit::Str(lit_str),
|
|
|
|
..
|
|
|
|
})) => Some((ident.to_string(), lit_str.clone())),
|
|
|
|
_ => None,
|
|
|
|
})
|
|
|
|
.collect::<HashMap<_, _>>();
|
|
|
|
|
|
|
|
eqns["type"]
|
|
|
|
.clone()
|
|
|
|
.parse()
|
|
|
|
.expect("valid type required for cache")
|
|
|
|
} else {
|
|
|
|
panic!("missing attribute `#[cached_tree_hash(type = ...)` on struct");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-07-26 19:26:06 +00:00
|
|
|
/// Returns true if some field has an attribute declaring it should not be hashed.
|
2019-04-15 05:45:05 +00:00
|
|
|
///
|
|
|
|
/// The field attribute is: `#[tree_hash(skip_hashing)]`
|
|
|
|
fn should_skip_hashing(field: &syn::Field) -> bool {
|
2019-09-28 04:29:14 +00:00
|
|
|
field.attrs.iter().any(|attr| {
|
|
|
|
attr.path.is_ident("tree_hash") && attr.tts.to_string().replace(" ", "") == "(skip_hashing)"
|
|
|
|
})
|
2019-04-15 05:45:05 +00:00
|
|
|
}
|
|
|
|
|
2019-04-16 00:47:58 +00:00
|
|
|
/// Implements `tree_hash::TreeHash` for some `struct`.
|
|
|
|
///
|
|
|
|
/// Fields are hashed in the order they are defined.
|
|
|
|
#[proc_macro_derive(TreeHash, attributes(tree_hash))]
|
|
|
|
pub fn tree_hash_derive(input: TokenStream) -> TokenStream {
|
|
|
|
let item = parse_macro_input!(input as DeriveInput);
|
|
|
|
|
|
|
|
let name = &item.ident;
|
2019-05-08 03:08:37 +00:00
|
|
|
let (impl_generics, ty_generics, where_clause) = &item.generics.split_for_impl();
|
2019-04-16 00:47:58 +00:00
|
|
|
|
|
|
|
let struct_data = match &item.data {
|
|
|
|
syn::Data::Struct(s) => s,
|
|
|
|
_ => panic!("tree_hash_derive only supports structs."),
|
|
|
|
};
|
|
|
|
|
2019-11-05 04:46:52 +00:00
|
|
|
let idents = get_hashable_fields(&struct_data);
|
2019-04-16 00:47:58 +00:00
|
|
|
|
|
|
|
let output = quote! {
|
2019-05-08 03:08:37 +00:00
|
|
|
impl #impl_generics tree_hash::TreeHash for #name #ty_generics #where_clause {
|
2019-04-16 00:47:58 +00:00
|
|
|
fn tree_hash_type() -> tree_hash::TreeHashType {
|
2019-04-17 00:57:36 +00:00
|
|
|
tree_hash::TreeHashType::Container
|
2019-04-16 00:47:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
fn tree_hash_packed_encoding(&self) -> Vec<u8> {
|
|
|
|
unreachable!("Struct should never be packed.")
|
|
|
|
}
|
|
|
|
|
|
|
|
fn tree_hash_packing_factor() -> usize {
|
|
|
|
unreachable!("Struct should never be packed.")
|
|
|
|
}
|
|
|
|
|
|
|
|
fn tree_hash_root(&self) -> Vec<u8> {
|
|
|
|
let mut leaves = Vec::with_capacity(4 * tree_hash::HASHSIZE);
|
|
|
|
|
|
|
|
#(
|
|
|
|
leaves.append(&mut self.#idents.tree_hash_root());
|
|
|
|
)*
|
|
|
|
|
Update to frozen spec ❄️ (v0.8.1) (#444)
* types: first updates for v0.8
* state_processing: epoch processing v0.8.0
* state_processing: block processing v0.8.0
* tree_hash_derive: support generics in SignedRoot
* types v0.8: update to use ssz_types
* state_processing v0.8: use ssz_types
* ssz_types: add bitwise methods and from_elem
* types: fix v0.8 FIXMEs
* ssz_types: add bitfield shift_up
* ssz_types: iterators and DerefMut for VariableList
* types,state_processing: use VariableList
* ssz_types: fix BitVector Decode impl
Fixed a typo in the implementation of ssz::Decode for BitVector, which caused it
to be considered variable length!
* types: fix test modules for v0.8 update
* types: remove slow type-level arithmetic
* state_processing: fix tests for v0.8
* op_pool: update for v0.8
* ssz_types: Bitfield difference length-independent
Allow computing the difference of two bitfields of different lengths.
* Implement compact committee support
* epoch_processing: committee & active index roots
* state_processing: genesis state builder v0.8
* state_processing: implement v0.8.1
* Further improve tree_hash
* Strip examples, tests from cached_tree_hash
* Update TreeHash, un-impl CachedTreeHash
* Update bitfield TreeHash, un-impl CachedTreeHash
* Update FixedLenVec TreeHash, unimpl CachedTreeHash
* Update update tree_hash_derive for new TreeHash
* Fix TreeHash, un-impl CachedTreeHash for ssz_types
* Remove fixed_len_vec, ssz benches
SSZ benches relied upon fixed_len_vec -- it is easier to just delete
them and rebuild them later (when necessary)
* Remove boolean_bitfield crate
* Fix fake_crypto BLS compile errors
* Update ef_tests for new v.8 type params
* Update ef_tests submodule to v0.8.1 tag
* Make fixes to support parsing ssz ef_tests
* `compact_committee...` to `compact_committees...`
* Derive more traits for `CompactCommittee`
* Flip bitfield byte-endianness
* Fix tree_hash for bitfields
* Modify CLI output for ef_tests
* Bump ssz crate version
* Update ssz_types doc comment
* Del cached tree hash tests from ssz_static tests
* Tidy SSZ dependencies
* Rename ssz_types crate to eth2_ssz_types
* validator_client: update for v0.8
* ssz_types: update union/difference for bit order swap
* beacon_node: update for v0.8, EthSpec
* types: disable cached tree hash, update min spec
* state_processing: fix slot bug in committee update
* tests: temporarily disable fork choice harness test
See #447
* committee cache: prevent out-of-bounds access
In the case where we tried to access the committee of a shard that didn't have a committee in the
current epoch, we were accessing elements beyond the end of the shuffling vector and panicking! This
commit adds a check to make the failure safe and explicit.
* fix bug in get_indexed_attestation and simplify
There was a bug in our implementation of get_indexed_attestation whereby
incorrect "committee indices" were used to index into the custody bitfield. The
bug was only observable in the case where some bits of the custody bitfield were
set to 1. The implementation has been simplified to remove the bug, and a test
added.
* state_proc: workaround for compact committees bug
https://github.com/ethereum/eth2.0-specs/issues/1315
* v0.8: updates to make the EF tests pass
* Remove redundant max operation checks.
* Always supply both messages when checking attestation signatures -- allowing
verification of an attestation with no signatures.
* Swap the order of the fork and domain constant in `get_domain`, to match
the spec.
* rustfmt
* ef_tests: add new epoch processing tests
* Integrate v0.8 into master (compiles)
* Remove unused crates, fix clippy lints
* Replace v0.6.3 tags w/ v0.8.1
* Remove old comment
* Ensure lmd ghost tests only run in release
* Update readme
2019-07-30 02:44:51 +00:00
|
|
|
tree_hash::merkle_root(&leaves, 0)
|
2019-04-16 00:47:58 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
output.into()
|
|
|
|
}
|
2019-04-16 01:14:28 +00:00
|
|
|
|
|
|
|
#[proc_macro_derive(SignedRoot, attributes(signed_root))]
|
|
|
|
pub fn tree_hash_signed_root_derive(input: TokenStream) -> TokenStream {
|
|
|
|
let item = parse_macro_input!(input as DeriveInput);
|
|
|
|
|
|
|
|
let name = &item.ident;
|
Update to frozen spec ❄️ (v0.8.1) (#444)
* types: first updates for v0.8
* state_processing: epoch processing v0.8.0
* state_processing: block processing v0.8.0
* tree_hash_derive: support generics in SignedRoot
* types v0.8: update to use ssz_types
* state_processing v0.8: use ssz_types
* ssz_types: add bitwise methods and from_elem
* types: fix v0.8 FIXMEs
* ssz_types: add bitfield shift_up
* ssz_types: iterators and DerefMut for VariableList
* types,state_processing: use VariableList
* ssz_types: fix BitVector Decode impl
Fixed a typo in the implementation of ssz::Decode for BitVector, which caused it
to be considered variable length!
* types: fix test modules for v0.8 update
* types: remove slow type-level arithmetic
* state_processing: fix tests for v0.8
* op_pool: update for v0.8
* ssz_types: Bitfield difference length-independent
Allow computing the difference of two bitfields of different lengths.
* Implement compact committee support
* epoch_processing: committee & active index roots
* state_processing: genesis state builder v0.8
* state_processing: implement v0.8.1
* Further improve tree_hash
* Strip examples, tests from cached_tree_hash
* Update TreeHash, un-impl CachedTreeHash
* Update bitfield TreeHash, un-impl CachedTreeHash
* Update FixedLenVec TreeHash, unimpl CachedTreeHash
* Update update tree_hash_derive for new TreeHash
* Fix TreeHash, un-impl CachedTreeHash for ssz_types
* Remove fixed_len_vec, ssz benches
SSZ benches relied upon fixed_len_vec -- it is easier to just delete
them and rebuild them later (when necessary)
* Remove boolean_bitfield crate
* Fix fake_crypto BLS compile errors
* Update ef_tests for new v.8 type params
* Update ef_tests submodule to v0.8.1 tag
* Make fixes to support parsing ssz ef_tests
* `compact_committee...` to `compact_committees...`
* Derive more traits for `CompactCommittee`
* Flip bitfield byte-endianness
* Fix tree_hash for bitfields
* Modify CLI output for ef_tests
* Bump ssz crate version
* Update ssz_types doc comment
* Del cached tree hash tests from ssz_static tests
* Tidy SSZ dependencies
* Rename ssz_types crate to eth2_ssz_types
* validator_client: update for v0.8
* ssz_types: update union/difference for bit order swap
* beacon_node: update for v0.8, EthSpec
* types: disable cached tree hash, update min spec
* state_processing: fix slot bug in committee update
* tests: temporarily disable fork choice harness test
See #447
* committee cache: prevent out-of-bounds access
In the case where we tried to access the committee of a shard that didn't have a committee in the
current epoch, we were accessing elements beyond the end of the shuffling vector and panicking! This
commit adds a check to make the failure safe and explicit.
* fix bug in get_indexed_attestation and simplify
There was a bug in our implementation of get_indexed_attestation whereby
incorrect "committee indices" were used to index into the custody bitfield. The
bug was only observable in the case where some bits of the custody bitfield were
set to 1. The implementation has been simplified to remove the bug, and a test
added.
* state_proc: workaround for compact committees bug
https://github.com/ethereum/eth2.0-specs/issues/1315
* v0.8: updates to make the EF tests pass
* Remove redundant max operation checks.
* Always supply both messages when checking attestation signatures -- allowing
verification of an attestation with no signatures.
* Swap the order of the fork and domain constant in `get_domain`, to match
the spec.
* rustfmt
* ef_tests: add new epoch processing tests
* Integrate v0.8 into master (compiles)
* Remove unused crates, fix clippy lints
* Replace v0.6.3 tags w/ v0.8.1
* Remove old comment
* Ensure lmd ghost tests only run in release
* Update readme
2019-07-30 02:44:51 +00:00
|
|
|
let (impl_generics, ty_generics, where_clause) = &item.generics.split_for_impl();
|
2019-04-16 01:14:28 +00:00
|
|
|
|
|
|
|
let struct_data = match &item.data {
|
|
|
|
syn::Data::Struct(s) => s,
|
|
|
|
_ => panic!("tree_hash_derive only supports structs."),
|
|
|
|
};
|
|
|
|
|
|
|
|
let idents = get_signed_root_named_field_idents(&struct_data);
|
2019-04-17 04:00:00 +00:00
|
|
|
let num_elems = idents.len();
|
2019-04-16 01:14:28 +00:00
|
|
|
|
|
|
|
let output = quote! {
|
Update to frozen spec ❄️ (v0.8.1) (#444)
* types: first updates for v0.8
* state_processing: epoch processing v0.8.0
* state_processing: block processing v0.8.0
* tree_hash_derive: support generics in SignedRoot
* types v0.8: update to use ssz_types
* state_processing v0.8: use ssz_types
* ssz_types: add bitwise methods and from_elem
* types: fix v0.8 FIXMEs
* ssz_types: add bitfield shift_up
* ssz_types: iterators and DerefMut for VariableList
* types,state_processing: use VariableList
* ssz_types: fix BitVector Decode impl
Fixed a typo in the implementation of ssz::Decode for BitVector, which caused it
to be considered variable length!
* types: fix test modules for v0.8 update
* types: remove slow type-level arithmetic
* state_processing: fix tests for v0.8
* op_pool: update for v0.8
* ssz_types: Bitfield difference length-independent
Allow computing the difference of two bitfields of different lengths.
* Implement compact committee support
* epoch_processing: committee & active index roots
* state_processing: genesis state builder v0.8
* state_processing: implement v0.8.1
* Further improve tree_hash
* Strip examples, tests from cached_tree_hash
* Update TreeHash, un-impl CachedTreeHash
* Update bitfield TreeHash, un-impl CachedTreeHash
* Update FixedLenVec TreeHash, unimpl CachedTreeHash
* Update update tree_hash_derive for new TreeHash
* Fix TreeHash, un-impl CachedTreeHash for ssz_types
* Remove fixed_len_vec, ssz benches
SSZ benches relied upon fixed_len_vec -- it is easier to just delete
them and rebuild them later (when necessary)
* Remove boolean_bitfield crate
* Fix fake_crypto BLS compile errors
* Update ef_tests for new v.8 type params
* Update ef_tests submodule to v0.8.1 tag
* Make fixes to support parsing ssz ef_tests
* `compact_committee...` to `compact_committees...`
* Derive more traits for `CompactCommittee`
* Flip bitfield byte-endianness
* Fix tree_hash for bitfields
* Modify CLI output for ef_tests
* Bump ssz crate version
* Update ssz_types doc comment
* Del cached tree hash tests from ssz_static tests
* Tidy SSZ dependencies
* Rename ssz_types crate to eth2_ssz_types
* validator_client: update for v0.8
* ssz_types: update union/difference for bit order swap
* beacon_node: update for v0.8, EthSpec
* types: disable cached tree hash, update min spec
* state_processing: fix slot bug in committee update
* tests: temporarily disable fork choice harness test
See #447
* committee cache: prevent out-of-bounds access
In the case where we tried to access the committee of a shard that didn't have a committee in the
current epoch, we were accessing elements beyond the end of the shuffling vector and panicking! This
commit adds a check to make the failure safe and explicit.
* fix bug in get_indexed_attestation and simplify
There was a bug in our implementation of get_indexed_attestation whereby
incorrect "committee indices" were used to index into the custody bitfield. The
bug was only observable in the case where some bits of the custody bitfield were
set to 1. The implementation has been simplified to remove the bug, and a test
added.
* state_proc: workaround for compact committees bug
https://github.com/ethereum/eth2.0-specs/issues/1315
* v0.8: updates to make the EF tests pass
* Remove redundant max operation checks.
* Always supply both messages when checking attestation signatures -- allowing
verification of an attestation with no signatures.
* Swap the order of the fork and domain constant in `get_domain`, to match
the spec.
* rustfmt
* ef_tests: add new epoch processing tests
* Integrate v0.8 into master (compiles)
* Remove unused crates, fix clippy lints
* Replace v0.6.3 tags w/ v0.8.1
* Remove old comment
* Ensure lmd ghost tests only run in release
* Update readme
2019-07-30 02:44:51 +00:00
|
|
|
impl #impl_generics tree_hash::SignedRoot for #name #ty_generics #where_clause {
|
2019-04-16 01:14:28 +00:00
|
|
|
fn signed_root(&self) -> Vec<u8> {
|
2019-04-17 04:00:00 +00:00
|
|
|
let mut leaves = Vec::with_capacity(#num_elems * tree_hash::HASHSIZE);
|
2019-04-16 01:14:28 +00:00
|
|
|
|
|
|
|
#(
|
|
|
|
leaves.append(&mut self.#idents.tree_hash_root());
|
|
|
|
)*
|
|
|
|
|
Update to frozen spec ❄️ (v0.8.1) (#444)
* types: first updates for v0.8
* state_processing: epoch processing v0.8.0
* state_processing: block processing v0.8.0
* tree_hash_derive: support generics in SignedRoot
* types v0.8: update to use ssz_types
* state_processing v0.8: use ssz_types
* ssz_types: add bitwise methods and from_elem
* types: fix v0.8 FIXMEs
* ssz_types: add bitfield shift_up
* ssz_types: iterators and DerefMut for VariableList
* types,state_processing: use VariableList
* ssz_types: fix BitVector Decode impl
Fixed a typo in the implementation of ssz::Decode for BitVector, which caused it
to be considered variable length!
* types: fix test modules for v0.8 update
* types: remove slow type-level arithmetic
* state_processing: fix tests for v0.8
* op_pool: update for v0.8
* ssz_types: Bitfield difference length-independent
Allow computing the difference of two bitfields of different lengths.
* Implement compact committee support
* epoch_processing: committee & active index roots
* state_processing: genesis state builder v0.8
* state_processing: implement v0.8.1
* Further improve tree_hash
* Strip examples, tests from cached_tree_hash
* Update TreeHash, un-impl CachedTreeHash
* Update bitfield TreeHash, un-impl CachedTreeHash
* Update FixedLenVec TreeHash, unimpl CachedTreeHash
* Update update tree_hash_derive for new TreeHash
* Fix TreeHash, un-impl CachedTreeHash for ssz_types
* Remove fixed_len_vec, ssz benches
SSZ benches relied upon fixed_len_vec -- it is easier to just delete
them and rebuild them later (when necessary)
* Remove boolean_bitfield crate
* Fix fake_crypto BLS compile errors
* Update ef_tests for new v.8 type params
* Update ef_tests submodule to v0.8.1 tag
* Make fixes to support parsing ssz ef_tests
* `compact_committee...` to `compact_committees...`
* Derive more traits for `CompactCommittee`
* Flip bitfield byte-endianness
* Fix tree_hash for bitfields
* Modify CLI output for ef_tests
* Bump ssz crate version
* Update ssz_types doc comment
* Del cached tree hash tests from ssz_static tests
* Tidy SSZ dependencies
* Rename ssz_types crate to eth2_ssz_types
* validator_client: update for v0.8
* ssz_types: update union/difference for bit order swap
* beacon_node: update for v0.8, EthSpec
* types: disable cached tree hash, update min spec
* state_processing: fix slot bug in committee update
* tests: temporarily disable fork choice harness test
See #447
* committee cache: prevent out-of-bounds access
In the case where we tried to access the committee of a shard that didn't have a committee in the
current epoch, we were accessing elements beyond the end of the shuffling vector and panicking! This
commit adds a check to make the failure safe and explicit.
* fix bug in get_indexed_attestation and simplify
There was a bug in our implementation of get_indexed_attestation whereby
incorrect "committee indices" were used to index into the custody bitfield. The
bug was only observable in the case where some bits of the custody bitfield were
set to 1. The implementation has been simplified to remove the bug, and a test
added.
* state_proc: workaround for compact committees bug
https://github.com/ethereum/eth2.0-specs/issues/1315
* v0.8: updates to make the EF tests pass
* Remove redundant max operation checks.
* Always supply both messages when checking attestation signatures -- allowing
verification of an attestation with no signatures.
* Swap the order of the fork and domain constant in `get_domain`, to match
the spec.
* rustfmt
* ef_tests: add new epoch processing tests
* Integrate v0.8 into master (compiles)
* Remove unused crates, fix clippy lints
* Replace v0.6.3 tags w/ v0.8.1
* Remove old comment
* Ensure lmd ghost tests only run in release
* Update readme
2019-07-30 02:44:51 +00:00
|
|
|
tree_hash::merkle_root(&leaves, 0)
|
2019-04-16 01:14:28 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
output.into()
|
|
|
|
}
|
|
|
|
|
2019-11-05 04:46:52 +00:00
|
|
|
/// Derive the `CachedTreeHash` trait for a type.
|
|
|
|
///
|
|
|
|
/// Requires two attributes:
|
|
|
|
/// * `#[cached_tree_hash(type = "T")]` on the struct, declaring
|
|
|
|
/// that the type `T` should be used as the tree hash cache.
|
|
|
|
/// * `#[cached_tree_hash(f)]` on each struct field that makes use
|
|
|
|
/// of the cache, which declares that the sub-cache for that field
|
|
|
|
/// can be found in the field `cache.f` of the struct's cache.
|
|
|
|
#[proc_macro_derive(CachedTreeHash, attributes(cached_tree_hash))]
|
|
|
|
pub fn cached_tree_hash_derive(input: TokenStream) -> TokenStream {
|
|
|
|
let item = parse_macro_input!(input as DeriveInput);
|
|
|
|
|
|
|
|
let name = &item.ident;
|
|
|
|
|
|
|
|
let cache_type = parse_cached_tree_hash_struct_attrs(&item.attrs);
|
|
|
|
|
|
|
|
let (impl_generics, ty_generics, where_clause) = &item.generics.split_for_impl();
|
|
|
|
|
|
|
|
let struct_data = match &item.data {
|
|
|
|
syn::Data::Struct(s) => s,
|
|
|
|
_ => panic!("tree_hash_derive only supports structs."),
|
|
|
|
};
|
|
|
|
|
|
|
|
let fields = get_hashable_fields_and_their_caches(&struct_data);
|
|
|
|
let caching_field_ty = fields
|
|
|
|
.iter()
|
|
|
|
.filter(|(_, _, cache_field)| cache_field.is_some())
|
|
|
|
.map(|(_, ty, _)| ty);
|
|
|
|
let caching_field_cache_field = fields
|
|
|
|
.iter()
|
|
|
|
.flat_map(|(_, _, cache_field)| cache_field.as_ref());
|
|
|
|
|
|
|
|
let tree_hash_root_expr = fields
|
|
|
|
.iter()
|
|
|
|
.map(|(field, _, caching_field)| match caching_field {
|
|
|
|
None => quote! {
|
|
|
|
self.#field.tree_hash_root()
|
|
|
|
},
|
|
|
|
Some(caching_field) => quote! {
|
|
|
|
self.#field
|
|
|
|
.recalculate_tree_hash_root(&mut cache.#caching_field)?
|
|
|
|
.as_bytes()
|
|
|
|
.to_vec()
|
|
|
|
},
|
|
|
|
});
|
|
|
|
|
|
|
|
let output = quote! {
|
|
|
|
impl #impl_generics cached_tree_hash::CachedTreeHash<#cache_type> for #name #ty_generics #where_clause {
|
|
|
|
fn new_tree_hash_cache() -> #cache_type {
|
|
|
|
// Call new cache for each sub type
|
|
|
|
#cache_type {
|
|
|
|
initialized: true,
|
|
|
|
#(
|
|
|
|
#caching_field_cache_field: <#caching_field_ty>::new_tree_hash_cache()
|
|
|
|
),*
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn recalculate_tree_hash_root(
|
|
|
|
&self,
|
|
|
|
cache: &mut #cache_type)
|
2019-11-24 01:00:49 +00:00
|
|
|
-> std::result::Result<Hash256, cached_tree_hash::Error>
|
2019-11-05 04:46:52 +00:00
|
|
|
{
|
|
|
|
let mut leaves = vec![];
|
|
|
|
|
|
|
|
#(
|
|
|
|
leaves.append(&mut #tree_hash_root_expr);
|
|
|
|
)*
|
|
|
|
|
|
|
|
Ok(Hash256::from_slice(&tree_hash::merkle_root(&leaves, 0)))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
output.into()
|
|
|
|
}
|
|
|
|
|
2019-04-16 01:14:28 +00:00
|
|
|
fn get_signed_root_named_field_idents(struct_data: &syn::DataStruct) -> Vec<&syn::Ident> {
|
|
|
|
struct_data
|
|
|
|
.fields
|
|
|
|
.iter()
|
|
|
|
.filter_map(|f| {
|
|
|
|
if should_skip_signed_root(&f) {
|
|
|
|
None
|
|
|
|
} else {
|
|
|
|
Some(match &f.ident {
|
|
|
|
Some(ref ident) => ident,
|
|
|
|
_ => panic!("tree_hash_derive only supports named struct fields"),
|
|
|
|
})
|
|
|
|
}
|
|
|
|
})
|
|
|
|
.collect()
|
|
|
|
}
|
|
|
|
|
|
|
|
fn should_skip_signed_root(field: &syn::Field) -> bool {
|
2019-09-30 02:32:44 +00:00
|
|
|
field.attrs.iter().any(|attr| {
|
|
|
|
attr.path.is_ident("signed_root")
|
|
|
|
&& attr.tts.to_string().replace(" ", "") == "(skip_hashing)"
|
|
|
|
})
|
2019-04-16 01:14:28 +00:00
|
|
|
}
|