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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108

// RGB Core Library: consensus layer for RGB smart contracts.
//
// SPDX-License-Identifier: Apache-2.0
//
// Written in 2019-2023 by
//     Dr Maxim Orlovsky <orlovsky@lnp-bp.org>
//
// Copyright (C) 2019-2023 LNP/BP Standards Association. All rights reserved.
// Copyright (C) 2019-2023 Dr Maxim Orlovsky. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

use std::collections::{BTreeMap, BTreeSet};

use aluvm::data::{ByteStr, Number};
use aluvm::reg::{Reg32, RegA, RegAFR, RegS};
use aluvm::Vm;

use crate::validation::OpInfo;
use crate::vm::{AluScript, EntryPoint};
use crate::OpFullType;

pub struct AluRuntime<'script> {
    script: &'script AluScript,
}

impl<'script> AluRuntime<'script> {
    pub fn new(script: &'script AluScript) -> Self { AluRuntime { script } }

    pub fn run_validations(&self, info: &OpInfo) -> Result<(), String> {
        let mut regs = RegSetup::default();

        match info.ty {
            OpFullType::Genesis => {
                regs.nums
                    .insert((RegAFR::A(RegA::A16), Reg32::Reg1), (info.subschema as u8).into());
                self.run(EntryPoint::ValidateGenesis, &regs, info)?;
            }
            OpFullType::StateTransition(ty) => {
                self.run(EntryPoint::ValidateTransition(ty), &regs, info)?;
            }
            OpFullType::StateExtension(ty) => {
                self.run(EntryPoint::ValidateExtension(ty), &regs, info)?;
            }
        }

        for ty in info.global.keys() {
            self.run(EntryPoint::ValidateGlobalState(*ty), &regs, info)?;
        }

        let used_state = info
            .owned_state
            .types()
            .iter()
            .chain(info.prev_state.keys())
            .copied()
            .collect::<BTreeSet<_>>();
        for ty in used_state {
            self.run(EntryPoint::ValidateGlobalState(ty), &regs, info)?;
        }

        Ok(())
    }

    fn run(&self, entry: EntryPoint, regs: &RegSetup, info: &OpInfo) -> Result<(), String> {
        let mut vm = Vm::new();

        for ((reg, idx), val) in &regs.nums {
            vm.registers.set(*reg, *idx, *val);
        }
        for (reg, val) in &regs.data {
            vm.registers.set_s(
                *reg,
                Some(
                    ByteStr::try_from(val.as_slice()).expect("state must be less than 2^16 bytes"),
                ),
            );
        }

        match self.script.entry_points.get(&entry) {
            Some(site) => match vm.call(self.script, *site, info) {
                true => Ok(()),
                false => Err(vm
                    .registers
                    .get_s(0)
                    .and_then(|bs| String::from_utf8(bs.to_vec()).ok())
                    .unwrap_or_else(|| s!("unspecified error"))),
            },
            None => Ok(()),
        }
    }
}

#[derive(Debug, Default)]
struct RegSetup {
    pub nums: BTreeMap<(RegAFR, Reg32), Number>,
    pub data: BTreeMap<RegS, Vec<u8>>,
}