|
| 1 | +use spacetimedb::{ |
| 2 | + procedure, reducer, table, DbContext, ProcedureContext, ReducerContext, ScheduleAt, Table, TxContext, |
| 3 | +}; |
| 4 | +use std::time::Duration; |
| 5 | + |
| 6 | +#[table(public, accessor = procedure_concurrency_row)] |
| 7 | +struct ProcedureConcurrencyRow { |
| 8 | + #[auto_inc] |
| 9 | + insertion_order: u32, |
| 10 | + insertion_context: String, |
| 11 | +} |
| 12 | + |
| 13 | +fn insert_procedure_concurrency_row(ctx: &TxContext, insertion_context: &str) { |
| 14 | + ctx.db.procedure_concurrency_row().insert(ProcedureConcurrencyRow { |
| 15 | + insertion_order: 0, |
| 16 | + insertion_context: insertion_context.into(), |
| 17 | + }); |
| 18 | +} |
| 19 | + |
| 20 | +#[reducer] |
| 21 | +fn insert_reducer_row(ctx: &ReducerContext) { |
| 22 | + ctx.db().procedure_concurrency_row().insert(ProcedureConcurrencyRow { |
| 23 | + insertion_order: 0, |
| 24 | + insertion_context: "reducer".into(), |
| 25 | + }); |
| 26 | +} |
| 27 | + |
| 28 | +#[derive(Copy, Clone, Debug)] |
| 29 | +struct PollOptions { |
| 30 | + timeout: Duration, |
| 31 | + poll_interval: Duration, |
| 32 | +} |
| 33 | + |
| 34 | +impl Default for PollOptions { |
| 35 | + fn default() -> Self { |
| 36 | + Self { |
| 37 | + timeout: Duration::from_secs(10), |
| 38 | + poll_interval: Duration::from_millis(100), |
| 39 | + } |
| 40 | + } |
| 41 | +} |
| 42 | + |
| 43 | +fn poll_until_tx_true(ctx: &mut ProcedureContext, pred: impl Fn(&TxContext) -> bool, options: PollOptions) { |
| 44 | + let deadline = ctx.timestamp + options.timeout; |
| 45 | + log::info!("poll_until_tx_true: will give up at {deadline}"); |
| 46 | + while ctx.timestamp < deadline { |
| 47 | + let try_again = ctx.timestamp + options.poll_interval; |
| 48 | + log::info!("poll_until_tx_true: sleeping until {try_again}"); |
| 49 | + ctx.sleep_until(try_again); |
| 50 | + if ctx.with_tx(&pred) { |
| 51 | + log::info!("poll_until_tx_true: succeeded, returning now"); |
| 52 | + return; |
| 53 | + } |
| 54 | + log::info!("poll_until_tx_true: false"); |
| 55 | + } |
| 56 | + panic!("poll_until_tx_true: exceeded timeout {:?}", options.timeout) |
| 57 | +} |
| 58 | + |
| 59 | +#[procedure] |
| 60 | +fn procedure_sleep_between_inserts(ctx: &mut ProcedureContext) { |
| 61 | + ctx.with_tx(|ctx| insert_procedure_concurrency_row(ctx, "procedure_before")); |
| 62 | + poll_until_tx_true( |
| 63 | + ctx, |
| 64 | + |tx| { |
| 65 | + tx.db |
| 66 | + .procedure_concurrency_row() |
| 67 | + .iter() |
| 68 | + .any(|row| row.insertion_context != "procedure_before") |
| 69 | + }, |
| 70 | + Default::default(), |
| 71 | + ); |
| 72 | + ctx.with_tx(|ctx| insert_procedure_concurrency_row(ctx, "procedure_after")); |
| 73 | +} |
| 74 | + |
| 75 | +#[table(accessor = scheduled_reducer_row, scheduled(insert_scheduled_reducer))] |
| 76 | +struct ScheduledReducerRow { |
| 77 | + #[primary_key] |
| 78 | + #[auto_inc] |
| 79 | + scheduled_id: u64, |
| 80 | + scheduled_at: ScheduleAt, |
| 81 | +} |
| 82 | + |
| 83 | +#[reducer] |
| 84 | +fn insert_scheduled_reducer(ctx: &ReducerContext, _schedule: ScheduledReducerRow) { |
| 85 | + ctx.db().procedure_concurrency_row().insert(ProcedureConcurrencyRow { |
| 86 | + insertion_order: 0, |
| 87 | + insertion_context: "scheduled_reducer".into(), |
| 88 | + }); |
| 89 | +} |
| 90 | + |
| 91 | +#[procedure] |
| 92 | +fn procedure_schedule_reducer_between_inserts(ctx: &mut ProcedureContext) { |
| 93 | + ctx.with_tx(|ctx| { |
| 94 | + insert_procedure_concurrency_row(ctx, "procedure_before"); |
| 95 | + ctx.db.scheduled_reducer_row().insert(ScheduledReducerRow { |
| 96 | + scheduled_id: 0, |
| 97 | + scheduled_at: ctx.timestamp.into(), |
| 98 | + }); |
| 99 | + }); |
| 100 | + poll_until_tx_true( |
| 101 | + ctx, |
| 102 | + |tx| { |
| 103 | + tx.db |
| 104 | + .procedure_concurrency_row() |
| 105 | + .iter() |
| 106 | + .any(|row| row.insertion_context != "procedure_before") |
| 107 | + }, |
| 108 | + Default::default(), |
| 109 | + ); |
| 110 | + ctx.with_tx(|ctx| insert_procedure_concurrency_row(ctx, "procedure_after")); |
| 111 | +} |
| 112 | + |
| 113 | +#[table(accessor = scheduled_procedure_row, scheduled(scheduled_procedure_sleep_between_inserts))] |
| 114 | +struct ScheduledProcedureRow { |
| 115 | + #[primary_key] |
| 116 | + #[auto_inc] |
| 117 | + scheduled_id: u64, |
| 118 | + scheduled_at: ScheduleAt, |
| 119 | +} |
| 120 | + |
| 121 | +#[procedure] |
| 122 | +fn scheduled_procedure_sleep_between_inserts(ctx: &mut ProcedureContext, _schedule: ScheduledProcedureRow) { |
| 123 | + ctx.with_tx(|ctx| insert_procedure_concurrency_row(ctx, "scheduled_procedure_before")); |
| 124 | + // Unfortunately, we can't poll and wake on event here, |
| 125 | + // as (until https://github.com/clockworklabs/SpacetimeDB/pull/5224 is fixed) |
| 126 | + // the scheduled reducer actually won't run until after this procedure fully completes. |
| 127 | + ctx.sleep_until(ctx.timestamp + Duration::from_secs(10)); |
| 128 | + ctx.with_tx(|ctx| insert_procedure_concurrency_row(ctx, "scheduled_procedure_after")); |
| 129 | +} |
| 130 | + |
| 131 | +#[reducer] |
| 132 | +fn schedule_procedure_then_reducer(ctx: &ReducerContext) { |
| 133 | + ctx.db().scheduled_procedure_row().insert(ScheduledProcedureRow { |
| 134 | + scheduled_id: 0, |
| 135 | + scheduled_at: ctx.timestamp.into(), |
| 136 | + }); |
| 137 | + ctx.db().scheduled_reducer_row().insert(ScheduledReducerRow { |
| 138 | + scheduled_id: 0, |
| 139 | + scheduled_at: (ctx.timestamp + Duration::from_secs(2)).into(), |
| 140 | + }); |
| 141 | +} |
0 commit comments