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
/*
* 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/>.
*/
mod new_states_calculation;
use super::*;
use new_states_calculation::compute_new_states;
/// At the end of a Par execution it's needed to update subtrace_len and positions of both sliders.
///
/// To see why it's really needed, imagine the following trace:
/// [par 12, 3]
/// [par 3, 5] <- left subgraph of [par 9, 3]
/// [call rs 1] [call rs 2] [call rs 3] <- left subgraph of [par 3, 5]
/// [call rs 4] [call rs 5] [call rs 6] [call rs 7] [call rs 8] <- right subgraph of [par 3, 5]
/// [par 1, 1] <- right subgraph of [par 9, 3]
/// [call e 9] <- left subgraph of [par 1, 1]
/// [call e 10] <- right subgraph of [par 1, 1]
///
/// where
/// call rs N - request sent state of Nth call
/// call e N - executed state of Nth call
///
/// and the following script:
/// (par
/// (xor
/// (par
/// (call 1-3)
/// (call 4-8)
/// )
/// (null) <- here could be any non-fallible set of instructions
/// )
/// (par
/// (call 9)
/// (call 10)
/// )
/// )
///
/// Suppose that call 5 (corresponds to [call rs 5]) will fail (f.e. call_service returns a service
/// error). Since it's wrapped with xor, then right subgraph of xor (null) will be executed.
/// After that next par will be executed. This par has corresponding state [par 1, 1] in a trace,
/// and to allow slider to pop it it's needed to set updated position in a proper way, because
/// otherwise [call rs 6] will be returned.
///
/// This struct manages to save the updated lens and pos and update slider states to prevent
/// such situations.
#[derive(Debug, Default, Clone, Copy)]
pub(super) struct CtxStateHandler {
left_pair: CtxStatesPair,
right_pair: CtxStatesPair,
}
impl CtxStateHandler {
/// Prepare new states that sliders will have after finishing executing of each subgraph.
pub(super) fn prepare(prev_par: ParResult, current_par: ParResult, data_keeper: &DataKeeper) -> FSMResult<Self> {
let left_pair = compute_new_states(data_keeper, prev_par, current_par, SubgraphType::Left)?;
let right_pair = compute_new_states(data_keeper, prev_par, current_par, SubgraphType::Right)?;
let handler = Self { left_pair, right_pair };
Ok(handler)
}
pub(super) fn handle_subgraph_end(self, data_keeper: &mut DataKeeper, subgraph_type: SubgraphType) {
match subgraph_type {
SubgraphType::Left => update_ctx_states(self.left_pair, data_keeper),
SubgraphType::Right => update_ctx_states(self.right_pair, data_keeper),
}
}
}