1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76

// Copyright 2015-2020 Parity Technologies (UK) Ltd.
// This file is part of OpenEthereum.

// OpenEthereum is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.

// OpenEthereum is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with OpenEthereum.  If not, see <http://www.gnu.org/licenses/>.

//! Blockchain test state deserializer.

use crate::{
    bytes::Bytes,
    hash::{Address, H256},
    spec::{Account, Builtin},
};
use std::collections::BTreeMap;

#[derive(Clone, Debug, PartialEq, Deserialize)]
#[serde(untagged)]
pub enum HashOrMap {
    /// When the `postState` is large, tests sometimes just include the state root of the last
    /// successful block here.
    Hash(H256),
    /// The expected `postState` of a test
    Map(BTreeMap<Address, Account>),
}

/// Blockchain state deserializer.
#[derive(Clone, Debug, PartialEq, Deserialize)]
#[serde(deny_unknown_fields)]
pub struct State(pub HashOrMap);

impl State {
    /// Returns all builtins.
    pub fn builtins(&self) -> BTreeMap<Address, Builtin> {
        match &self.0 {
            HashOrMap::Hash(_) => BTreeMap::default(),
            HashOrMap::Map(map) => map
                .iter()
                .filter_map(|(add, ref acc)| acc.builtin.clone().map(|b| (add.clone(), b.into())))
                .collect(),
        }
    }

    /// Returns all constructors.
    pub fn constructors(&self) -> BTreeMap<Address, Bytes> {
        match &self.0 {
            HashOrMap::Hash(_) => BTreeMap::default(),
            HashOrMap::Map(map) => map
                .iter()
                .filter_map(|(add, ref acc)| acc.constructor.clone().map(|b| (add.clone(), b)))
                .collect(),
        }
    }
}

impl IntoIterator for State {
    type Item = <BTreeMap<Address, Account> as IntoIterator>::Item;
    type IntoIter = <BTreeMap<Address, Account> as IntoIterator>::IntoIter;

    fn into_iter(self) -> Self::IntoIter {
        if let HashOrMap::Map(m) = self.0 {
            m.into_iter()
        } else {
            BTreeMap::default().into_iter()
        }
    }
}