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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
/*
 * AquaVM Workflow Engine
 *
 * Copyright (C) 2024 Fluence DAO
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as
 * published by the Free Software Foundation version 3 of the
 * License.
 *
 * This program 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 Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */

use super::*;
use merger::*;

use std::convert::TryInto;

#[derive(Debug, Default)]
pub struct TraceHandler {
    data_keeper: DataKeeper,
    fsm_keeper: FSMKeeper,
}

impl TraceHandler {
    pub fn from_trace(prev_trace: ExecutionTrace, current_trace: ExecutionTrace) -> Self {
        let data_keeper = DataKeeper::from_trace(prev_trace, current_trace);

        Self {
            data_keeper,
            fsm_keeper: <_>::default(),
        }
    }

    /// Returns size of elements inside result trace and intended to provide
    /// a position of next inserted elements.
    pub fn trace_pos(&self) -> Result<TracePos, IntConversionError> {
        self.data_keeper
            .result_trace
            .len()
            .try_into()
            .map_err(IntConversionError::TryIntoTracePosError)
    }

    pub fn into_result_trace(self) -> ExecutionTrace {
        self.data_keeper.result_trace
    }

    pub fn as_result_trace(&self) -> &ExecutionTrace {
        &self.data_keeper.result_trace
    }

    pub fn subgraph_sizes(&self) -> (TraceLen, TraceLen) {
        let prev_len = self.data_keeper.prev_slider().subtrace_len();
        let current_len = self.data_keeper.current_slider().subtrace_len();

        (prev_len, current_len)
    }

    pub fn update_generation(
        &mut self,
        trace_pos: TracePos,
        generation: GenerationIdx,
    ) -> Result<(), GenerationCompactificationError> {
        let state = self
            .data_keeper
            .result_trace
            .get_mut(trace_pos)
            .ok_or_else(|| GenerationCompactificationError::points_to_nowhere(trace_pos))?;

        match state {
            ExecutedState::Ap(ap_result) => ap_result.res_generations = vec![generation],
            ExecutedState::Call(CallResult::Executed(ValueRef::Stream {
                generation: call_generation,
                ..
            })) => *call_generation = generation,
            state => {
                return Err(GenerationCompactificationError::points_to_invalid_state(
                    trace_pos,
                    state.clone(),
                ))
            }
        }

        Ok(())
    }
}

impl TraceHandler {
    /// Should be called at the beginning of a call execution.
    pub fn meet_call_start(&mut self) -> TraceHandlerResult<MergerCallResult> {
        try_merge_next_state_as_call(&mut self.data_keeper).map_err(Into::into)
    }

    /// Should be called when a call instruction was executed successfully. It adds the supplied
    /// state to the result trace.
    pub fn meet_call_end(&mut self, call_result: CallResult) {
        log::trace!(
            target: air_log_targets::EXECUTED_STATE_CHANGING,
            "  adding new call executed state {:?}",
            call_result
        );
        self.data_keeper.result_trace.push(ExecutedState::Call(call_result));
    }
}

impl TraceHandler {
    pub fn meet_ap_start(&mut self) -> TraceHandlerResult<MergerApResult> {
        try_merge_next_state_as_ap(&mut self.data_keeper).map_err(Into::into)
    }

    pub fn meet_ap_end(&mut self, ap_result: ApResult) {
        self.data_keeper.result_trace.push(ExecutedState::Ap(ap_result));
    }
}

impl TraceHandler {
    pub fn meet_canon_start(&mut self) -> TraceHandlerResult<MergerCanonResult> {
        try_merge_next_state_as_canon(&mut self.data_keeper).map_err(Into::into)
    }

    pub fn meet_canon_end(&mut self, canon_result: CanonResult) {
        self.data_keeper.result_trace.push(ExecutedState::Canon(canon_result));
    }
}

impl TraceHandler {
    pub fn meet_par_start(&mut self) -> TraceHandlerResult<()> {
        let ingredients = merger::try_merge_next_state_as_par(&mut self.data_keeper)?;
        let par_fsm = ParFSM::from_left_started(ingredients, &mut self.data_keeper)?;
        self.fsm_keeper.push_par(par_fsm);

        Ok(())
    }

    pub fn meet_par_subgraph_end(&mut self, subgraph_type: SubgraphType) -> TraceHandlerResult<()> {
        match subgraph_type {
            SubgraphType::Left => {
                let par_fsm = self.fsm_keeper.last_par()?;
                par_fsm.left_completed(&mut self.data_keeper);
            }
            SubgraphType::Right => {
                let par_fsm = self.fsm_keeper.pop_par()?;
                par_fsm.right_completed(&mut self.data_keeper);
            }
        }

        Ok(())
    }
}

impl TraceHandler {
    pub fn meet_fold_start(&mut self, fold_id: u32) -> TraceHandlerResult<()> {
        let ingredients = try_merge_next_state_as_fold(&mut self.data_keeper)?;
        let fold_fsm = FoldFSM::from_fold_start(ingredients, &mut self.data_keeper)?;
        self.fsm_keeper.add_fold(fold_id, fold_fsm);

        Ok(())
    }

    pub fn meet_iteration_start(&mut self, fold_id: u32, value_pos: TracePos) -> TraceHandlerResult<()> {
        let fold_fsm = self.fsm_keeper.fold_mut(fold_id)?;
        fold_fsm.meet_iteration_start(value_pos, &mut self.data_keeper)?;

        Ok(())
    }

    pub fn meet_iteration_end(&mut self, fold_id: u32) -> TraceHandlerResult<()> {
        let fold_fsm = self.fsm_keeper.fold_mut(fold_id)?;
        fold_fsm.meet_iteration_end(&self.data_keeper);

        Ok(())
    }

    pub fn meet_back_iterator(&mut self, fold_id: u32) -> TraceHandlerResult<()> {
        let fold_fsm = self.fsm_keeper.fold_mut(fold_id)?;
        fold_fsm.meet_back_iterator(&mut self.data_keeper)?;

        Ok(())
    }

    pub fn meet_generation_end(&mut self, fold_id: u32) -> TraceHandlerResult<()> {
        let fold_fsm = self.fsm_keeper.fold_mut(fold_id)?;
        fold_fsm.meet_generation_end(&self.data_keeper);

        Ok(())
    }

    pub fn meet_fold_end(&mut self, fold_id: u32) -> TraceHandlerResult<()> {
        let fold_fsm = self.fsm_keeper.extract_fold(fold_id)?;
        fold_fsm.meet_fold_end(&mut self.data_keeper);

        Ok(())
    }
}