aws-s3-transfer 1.0.0

Transfer Manager for Amazon S3 - a high-performance data plane client for uploading and downloading objects and directories.
Documentation
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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
/*
 * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
 * SPDX-License-Identifier: Apache-2.0
 */

//! Mock transfer implementations for testing scheduler behavior.

use std::future::Future;
use std::pin::Pin;
use std::sync::atomic::{AtomicBool, AtomicU64, AtomicU8, AtomicUsize, Ordering};
use std::sync::Arc;
use std::time::Duration;

use crate::transfer::{
    IoRequest, PendingCause, PollWork, StateMachineTerminalReceiver, Transfer, TransferContext,
    TransferId, WorkOutcome,
};

/// Trait for mock state machines that drive transfer behavior.
pub(crate) trait MockStateMachine: Send + Sync + std::fmt::Debug {
    fn poll_work(&self, id: TransferId) -> PollWork;
    fn execute<'a>(
        &'a self,
        work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>>;
}

/// Mock transfer that wraps any [`MockStateMachine`].
#[derive(Clone)]
pub(crate) struct MockTransfer {
    id: TransferId,
    ctx: TransferContext,
    state_machine: Arc<dyn MockStateMachine>,
}

impl std::fmt::Debug for MockTransfer {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("MockTransfer")
            .field("id", &self.id)
            .field("state_machine", &self.state_machine)
            .finish()
    }
}

impl MockTransfer {
    pub(crate) fn new<S: MockStateMachine + 'static>(
        id: TransferId,
        state_machine: Arc<S>,
    ) -> Self {
        let s3_client = aws_smithy_mocks::mock_client!(aws_sdk_s3, []);
        let config = crate::Config::builder()
            .sdk_client(s3_client)
            .build()
            .expect("valid config");
        let handle = crate::client::Handle::new_for_test(config, 1);

        let (ctx, _completion_rx) = TransferContext::with_id(id, handle);

        Self {
            id,
            ctx,
            state_machine,
        }
    }

    /// Create a mock transfer that shares the given handle's scheduler.
    ///
    /// Use this when tests need multiple transfers routed through the same
    /// scheduler instance (e.g., composite parent + children).
    pub(crate) fn new_with_handle<S: MockStateMachine + 'static>(
        id: TransferId,
        state_machine: Arc<S>,
        handle: Arc<crate::client::Handle>,
    ) -> Self {
        let (ctx, _completion_rx) = TransferContext::with_id(id, handle);
        Self {
            id,
            ctx,
            state_machine,
        }
    }

    pub(crate) fn poll_work(&self) -> PollWork {
        let work = self.state_machine.poll_work(self.id);
        if matches!(work, PollWork::Pending) {
            self.ctx.set_pending(PendingCause::other("mock"));
        }
        work
    }

    pub(crate) async fn execute(&self, work: &mut IoRequest) -> WorkOutcome {
        let outcome = self.state_machine.execute(work).await;
        // Mirror real transfer behavior: Failed means the transfer transitions
        // itself to terminal state before returning.
        if matches!(outcome, WorkOutcome::Failed { .. }) {
            self.ctx.set_failed(crate::error::from_kind(
                crate::error::ErrorKind::RuntimeError,
            )("mock transfer failed"));
            self.ctx.signal_terminal();
        }
        outcome
    }
}

impl Transfer for MockTransfer {
    fn ctx(&self) -> &TransferContext {
        &self.ctx
    }

    fn poll_work(&self) -> PollWork {
        MockTransfer::poll_work(self)
    }

    fn execute<'a>(
        &'a self,
        work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        Box::pin(MockTransfer::execute(self, work))
    }
}

/// Simple state machine that generates N Network work items.
#[derive(Debug)]
pub(crate) struct FixedWorkCount {
    total: u64,
    generated: AtomicU64,
    completed: AtomicU64,
}

impl FixedWorkCount {
    pub(crate) fn new(count: u64) -> Self {
        Self {
            total: count,
            generated: AtomicU64::new(0),
            completed: AtomicU64::new(0),
        }
    }

    pub(crate) fn is_complete(&self) -> bool {
        self.completed.load(Ordering::SeqCst) >= self.total
    }

    pub(crate) fn completed_count(&self) -> u64 {
        self.completed.load(Ordering::SeqCst)
    }
}

impl MockStateMachine for FixedWorkCount {
    fn poll_work(&self, _id: TransferId) -> PollWork {
        let gen = self.generated.fetch_add(1, Ordering::SeqCst);
        if gen >= self.total {
            return PollWork::Done;
        }

        PollWork::ready(IoRequest { data: None })
    }

    fn execute<'a>(
        &'a self,
        _work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        Box::pin(async move {
            self.completed.fetch_add(1, Ordering::SeqCst);
            WorkOutcome::Success { data: None }
        })
    }
}

/// Wraps a state machine to add delay before each execution.
#[derive(Debug)]
pub(crate) struct WithDelay<S> {
    inner: S,
    delay: Duration,
}

impl<S: MockStateMachine> WithDelay<S> {
    pub(crate) fn new(inner: S, delay: Duration) -> Self {
        Self { inner, delay }
    }

    pub(crate) fn inner(&self) -> &S {
        &self.inner
    }
}

impl<S: MockStateMachine> MockStateMachine for WithDelay<S> {
    fn poll_work(&self, id: TransferId) -> PollWork {
        self.inner.poll_work(id)
    }

    fn execute<'a>(
        &'a self,
        work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        Box::pin(async move {
            tokio::time::sleep(self.delay).await;
            self.inner.execute(work).await
        })
    }
}

/// Wraps a state machine to override execute behavior with a custom function.
pub(crate) struct WithExecute<S> {
    inner: S,
    execute_fn: fn(&mut IoRequest) -> WorkOutcome,
}

impl<S: std::fmt::Debug> std::fmt::Debug for WithExecute<S> {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("WithExecute")
            .field("inner", &self.inner)
            .finish()
    }
}

impl<S> WithExecute<S> {
    pub(crate) fn new(inner: S, execute_fn: fn(&mut IoRequest) -> WorkOutcome) -> Self {
        Self { inner, execute_fn }
    }
}

impl<S> MockStateMachine for WithExecute<S>
where
    S: MockStateMachine,
{
    fn poll_work(&self, id: TransferId) -> PollWork {
        self.inner.poll_work(id)
    }

    fn execute<'a>(
        &'a self,
        work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        let outcome = (self.execute_fn)(work);
        Box::pin(async move { outcome })
    }
}

/// A work counter shared across children of a composite transfer.
///
/// Each child's `execute` increments this counter, allowing tests to observe
/// how many dispatches a particular tree has received.
#[derive(Debug, Clone)]
pub(crate) struct DispatchCounter {
    count: Arc<AtomicU64>,
    trace: Option<(u8, Arc<DispatchTrace>)>,
}

impl DispatchCounter {
    /// Create a new zero-valued counter.
    pub(crate) fn new() -> Self {
        Self {
            count: Arc::new(AtomicU64::new(0)),
            trace: None,
        }
    }

    /// Current count of dispatches observed.
    pub(crate) fn count(&self) -> u64 {
        self.count.load(Ordering::SeqCst)
    }

    fn increment(&self) {
        if let Some((label, trace)) = &self.trace {
            trace.record(*label);
        }
        self.count.fetch_add(1, Ordering::SeqCst);
    }
}

/// Ordered execution trace shared by a bounded set of dispatch counters.
///
/// Counters reserve trace slots atomically, so concurrent workers can record
/// their execution order without adding a mutex to the scheduler hot path.
/// The caller must wait for the corresponding counters before taking a
/// snapshot; counters publish their trace entry before incrementing.
#[derive(Debug)]
pub(crate) struct DispatchTrace {
    next: AtomicUsize,
    entries: Box<[AtomicU8]>,
}

impl DispatchTrace {
    /// Create a trace that can hold exactly `capacity` executions.
    pub(crate) fn new(capacity: usize) -> Arc<Self> {
        let entries = (0..capacity)
            .map(|_| AtomicU8::new(0))
            .collect::<Vec<_>>()
            .into_boxed_slice();
        Arc::new(Self {
            next: AtomicUsize::new(0),
            entries,
        })
    }

    /// Create a counter whose executions are recorded with `label`.
    pub(crate) fn counter(self: &Arc<Self>, label: u8) -> DispatchCounter {
        assert_ne!(label, 0, "zero is reserved for unwritten trace slots");
        DispatchCounter {
            count: Arc::new(AtomicU64::new(0)),
            trace: Some((label, Arc::clone(self))),
        }
    }

    /// Return all executions recorded before the caller's completion barrier.
    pub(crate) fn snapshot(&self) -> Vec<u8> {
        let len = self.next.load(Ordering::SeqCst);
        assert!(
            len <= self.entries.len(),
            "dispatch trace recorded {len} entries into capacity {}",
            self.entries.len()
        );
        self.entries[..len]
            .iter()
            .enumerate()
            .map(|(index, entry)| {
                let label = entry.load(Ordering::SeqCst);
                assert_ne!(label, 0, "dispatch trace slot {index} was not published");
                label
            })
            .collect()
    }

    fn record(&self, label: u8) {
        let index = self.next.fetch_add(1, Ordering::SeqCst);
        if let Some(entry) = self.entries.get(index) {
            entry.store(label, Ordering::SeqCst);
        }
    }
}

/// Mock state machine that counts work items and increments a shared dispatch counter.
///
/// Used as the child state machine in composite transfer tests. Each `execute`
/// call increments both the internal completion counter and the shared
/// `DispatchCounter`, letting tests assert per-tree dispatch ratios.
#[derive(Debug)]
pub(crate) struct CountedWork {
    total: u64,
    generated: AtomicU64,
    completed: AtomicU64,
    counter: DispatchCounter,
}

impl CountedWork {
    /// Create a counted work mock with `count` work items that increments `counter` on each execute.
    pub(crate) fn new(count: u64, counter: DispatchCounter) -> Self {
        Self {
            total: count,
            generated: AtomicU64::new(0),
            completed: AtomicU64::new(0),
            counter,
        }
    }

    pub(crate) fn is_complete(&self) -> bool {
        self.completed.load(Ordering::SeqCst) >= self.total
    }

    #[allow(dead_code)]
    pub(crate) fn completed_count(&self) -> u64 {
        self.completed.load(Ordering::SeqCst)
    }
}

impl MockStateMachine for CountedWork {
    fn poll_work(&self, _id: TransferId) -> PollWork {
        let gen = self.generated.fetch_add(1, Ordering::SeqCst);
        if gen >= self.total {
            return PollWork::Done;
        }
        PollWork::ready(IoRequest { data: None })
    }

    fn execute<'a>(
        &'a self,
        _work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        Box::pin(async move {
            self.counter.increment();
            self.completed.fetch_add(1, Ordering::SeqCst);
            WorkOutcome::Success { data: None }
        })
    }
}

/// Mock state machine whose execute blocks until a `tokio::sync::Notify` is signaled.
///
/// Used to test memory-cap behavior where children must remain in-flight
/// (not completing) so the composite can observe backpressure.
#[derive(Debug)]
pub(crate) struct BlockingWork {
    generated: AtomicU64,
    total: u64,
    completed: AtomicU64,
    notify: Arc<tokio::sync::Notify>,
    counter: DispatchCounter,
}

impl BlockingWork {
    /// Create a blocking work mock. Each `execute` waits on `notify` before completing.
    #[allow(dead_code)]
    pub(crate) fn new(
        count: u64,
        notify: Arc<tokio::sync::Notify>,
        counter: DispatchCounter,
    ) -> Self {
        Self {
            generated: AtomicU64::new(0),
            total: count,
            completed: AtomicU64::new(0),
            notify,
            counter,
        }
    }

    #[allow(dead_code)]
    pub(crate) fn completed_count(&self) -> u64 {
        self.completed.load(Ordering::SeqCst)
    }
}

impl MockStateMachine for BlockingWork {
    fn poll_work(&self, _id: TransferId) -> PollWork {
        let gen = self.generated.fetch_add(1, Ordering::SeqCst);
        if gen >= self.total {
            return PollWork::Done;
        }
        PollWork::ready(IoRequest { data: None })
    }

    fn execute<'a>(
        &'a self,
        _work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        Box::pin(async move {
            self.notify.notified().await;
            self.counter.increment();
            self.completed.fetch_add(1, Ordering::SeqCst);
            WorkOutcome::Success { data: None }
        })
    }
}

use std::sync::Mutex;

/// A child transfer that signals terminal when all work completes.
///
/// Unlike `MockTransfer` (which never calls `signal_terminal` on success),
/// this transfer properly signals its parent when done, enabling composite
/// transfers to observe child completion and resume spawning.
pub(crate) struct ChildMockTransfer {
    ctx: TransferContext,
    total: u64,
    generated: AtomicU64,
    /// Protected by `state_lock` for wake protocol correctness.
    completed: AtomicU64,
    counter: DispatchCounter,
    /// If set, execute blocks on this notify before completing.
    notify: Option<Arc<tokio::sync::Notify>>,
    /// Lock shared between poll_work and execute for wake protocol.
    state_lock: Mutex<()>,
    /// If set, incremented when this transfer's `poll_work` returns `Done`.
    /// Composite parents track child terminations through this so they can
    /// gate their own `Done` on all children having actually finished
    /// (not merely on `execute` having run, which fires before the
    /// child's terminating poll).
    terminated_counter: Option<Arc<AtomicU64>>,
    /// If set, this transfer's `TransferId.id` is appended each time its
    /// `poll_work` is entered. Shared with the parent composite so a test can
    /// observe the parent/child poll interleaving order.
    poll_log: Option<Arc<Mutex<Vec<u64>>>>,
}

impl std::fmt::Debug for ChildMockTransfer {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("ChildMockTransfer")
            .field("id", &self.ctx.id)
            .finish_non_exhaustive()
    }
}

impl ChildMockTransfer {
    /// Create a child transfer that increments `counter` on each dispatch and
    /// signals terminal when all work completes.
    pub(crate) fn new(
        id: TransferId,
        handle: Arc<crate::client::Handle>,
        work_count: u64,
        counter: DispatchCounter,
    ) -> Self {
        let (ctx, _rx) = TransferContext::with_id(id, handle);
        Self {
            ctx,
            total: work_count,
            generated: AtomicU64::new(0),
            completed: AtomicU64::new(0),
            counter,
            notify: None,
            state_lock: Mutex::new(()),
            terminated_counter: None,
            poll_log: None,
        }
    }

    /// Create a child transfer whose execute blocks until `notify` is signaled.
    pub(crate) fn new_blocking(
        id: TransferId,
        handle: Arc<crate::client::Handle>,
        counter: DispatchCounter,
        notify: Arc<tokio::sync::Notify>,
    ) -> Self {
        let (ctx, _rx) = TransferContext::with_id(id, handle);
        Self {
            ctx,
            total: 1,
            generated: AtomicU64::new(0),
            completed: AtomicU64::new(0),
            counter,
            notify: Some(notify),
            state_lock: Mutex::new(()),
            terminated_counter: None,
            poll_log: None,
        }
    }

    /// Set the parent's terminated counter. Incremented by 1 when this
    /// transfer's `poll_work` returns `Done`. Used by composite parents to
    /// track child terminations so they can wait for all children to finish
    /// before returning `Done` themselves.
    pub(crate) fn with_terminated_counter(mut self, counter: Arc<AtomicU64>) -> Self {
        self.terminated_counter = Some(counter);
        self
    }

    /// Share a poll-order log. This transfer's id is appended on each
    /// `poll_work` entry so a test can observe parent/child interleaving.
    pub(crate) fn with_poll_log(mut self, log: Arc<Mutex<Vec<u64>>>) -> Self {
        self.poll_log = Some(log);
        self
    }
}

impl Transfer for ChildMockTransfer {
    fn ctx(&self) -> &TransferContext {
        &self.ctx
    }

    fn poll_work(&self) -> PollWork {
        if let Some(ref log) = self.poll_log {
            log.lock().unwrap().push(self.ctx.id.id);
        }
        // Only generate work if we haven't generated all items yet
        let gen = self.generated.load(Ordering::SeqCst);
        if gen >= self.total {
            // All work generated. Follow the wake protocol:
            // lock → set_pending → check condition → unlock
            let _guard = self.state_lock.lock().unwrap();
            self.ctx.set_pending(PendingCause::other("test"));
            if self.completed.load(Ordering::SeqCst) >= self.total {
                // All completed
                drop(_guard);
                self.ctx.set_completed();
                // Increment terminated_counter BEFORE signal_terminal so the
                // parent's wake observes the up-to-date count. signal_terminal
                // calls scheduler.wake(parent), which can synchronously drive
                // the parent's poll_work via generate_work; the parent must
                // see this child counted as terminated to make the right
                // Done/Pending decision.
                if let Some(ref tc) = self.terminated_counter {
                    tc.fetch_add(1, Ordering::SeqCst);
                }
                self.ctx.signal_terminal();
                return PollWork::Done;
            }
            return PollWork::Pending;
        }
        self.generated.fetch_add(1, Ordering::SeqCst);
        PollWork::ready(IoRequest { data: None })
    }

    fn execute<'a>(
        &'a self,
        _work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        Box::pin(async move {
            if let Some(ref notify) = self.notify {
                // Poll for either the notify signal or cancellation
                loop {
                    if self.ctx.is_cancelled() {
                        return WorkOutcome::Cancelled;
                    }
                    match tokio::time::timeout(Duration::from_millis(10), notify.notified()).await {
                        Ok(()) => break,
                        Err(_) => continue,
                    }
                }
            }
            if self.ctx.is_cancelled() {
                return WorkOutcome::Cancelled;
            }
            self.counter.increment();
            // Mutator pattern: lock → mutate → unlock → try_wake
            {
                let _guard = self.state_lock.lock().unwrap();
                self.completed.fetch_add(1, Ordering::SeqCst);
            }
            self.ctx.try_wake();
            WorkOutcome::Success { data: None }
        })
    }
}

/// Internal state for the composite mock transfer.
struct CompositeMockState {
    total_children: u64,
    spawned: u64,
}

/// A composite transfer mock that spawns child transfers into the scheduler.
///
/// Implements `Transfer` directly (not `MockStateMachine`) because composites
/// need access to the parent `TransferContext` for lifecycle management and
/// the shared `Handle` for enqueueing children.
///
/// Each `poll_work` call spawns children (up to a memory cap) and returns
/// `Pending` while waiting for children to complete, or `Done` when all
/// children have terminated. Done is gated on child *termination* (each
/// child's `poll_work` returning `Done` after its work is complete), not on
/// the work counter alone. The work counter is incremented inside `execute`,
/// which fires strictly before the child's terminating poll. Returning
/// `Done` based only on the work counter is a contract violation: the
/// parent would dismiss its group while children are still in the middle
/// of their wake-then-Done sequence, leaving them orphaned in the scheduler.
pub(crate) struct CompositeMock {
    ctx: TransferContext,
    handle: Arc<crate::client::Handle>,
    state: Mutex<CompositeMockState>,
    work_per_child: u64,
    memory_cap: u64,
    counter: DispatchCounter,
    /// Notify used for blocking children (if provided).
    child_notify: Option<Arc<tokio::sync::Notify>>,
    /// Next child id counter (global atomic to avoid collisions).
    next_child_id: AtomicU64,
    /// Shared with all children. Incremented when a child's `poll_work`
    /// returns `Done`. Used to determine when this composite can return
    /// `Done` without leaking unreaped children.
    terminated_counter: Arc<AtomicU64>,
}

impl std::fmt::Debug for CompositeMock {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("CompositeMock")
            .field("id", &self.ctx.id)
            .finish_non_exhaustive()
    }
}

impl CompositeMock {
    /// Create a new composite mock transfer.
    ///
    /// # Arguments
    /// - `id`: The transfer's identity (must have `parent: None` for a top-level composite).
    /// - `handle`: Shared handle whose scheduler receives child transfers.
    /// - `total_children`: How many child transfers to spawn over the composite's lifetime.
    /// - `work_per_child`: Work items each child produces.
    /// - `memory_cap`: Maximum children spawned before waiting for completions.
    /// - `counter`: Shared dispatch counter incremented by each child's execute.
    pub(crate) fn new(
        id: TransferId,
        handle: Arc<crate::client::Handle>,
        total_children: u64,
        work_per_child: u64,
        memory_cap: u64,
        counter: DispatchCounter,
    ) -> Self {
        let (ctx, _rx) = TransferContext::with_id(id, handle.clone());
        Self {
            ctx,
            handle,
            state: Mutex::new(CompositeMockState {
                total_children,
                spawned: 0,
            }),
            work_per_child,
            memory_cap,
            counter,
            child_notify: None,
            next_child_id: AtomicU64::new(id.id * 1_000_000 + 1),
            terminated_counter: Arc::new(AtomicU64::new(0)),
        }
    }

    /// Create a composite whose children block in execute until `notify` is signaled.
    ///
    /// Used to test memory-cap backpressure where children must remain in-flight.
    pub(crate) fn new_blocking(
        id: TransferId,
        handle: Arc<crate::client::Handle>,
        total_children: u64,
        memory_cap: u64,
        counter: DispatchCounter,
        notify: Arc<tokio::sync::Notify>,
    ) -> Self {
        let (ctx, _rx) = TransferContext::with_id(id, handle.clone());
        Self {
            ctx,
            handle,
            state: Mutex::new(CompositeMockState {
                total_children,
                spawned: 0,
            }),
            work_per_child: 1,
            memory_cap,
            counter,
            child_notify: Some(notify),
            next_child_id: AtomicU64::new(id.id * 1_000_000 + 1),
            terminated_counter: Arc::new(AtomicU64::new(0)),
        }
    }

    /// Total children spawned so far.
    #[allow(dead_code)]
    pub(crate) fn total_spawned(&self) -> u64 {
        self.state.lock().unwrap().spawned
    }

    /// Total children that have terminated (their `poll_work` returned `Done`).
    #[allow(dead_code)]
    pub(crate) fn total_terminated(&self) -> u64 {
        self.terminated_counter.load(Ordering::SeqCst)
    }

    /// Whether all children have been spawned and terminated.
    #[allow(dead_code)]
    pub(crate) fn is_complete(&self) -> bool {
        let s = self.state.lock().unwrap();
        let terminated = self.terminated_counter.load(Ordering::SeqCst);
        terminated >= s.total_children && s.spawned >= s.total_children
    }

    /// The dispatch counter shared with all children.
    #[allow(dead_code)]
    pub(crate) fn dispatch_counter(&self) -> &DispatchCounter {
        &self.counter
    }

    fn spawn_children(&self, state: &mut CompositeMockState) {
        let terminated = self.terminated_counter.load(Ordering::SeqCst);
        let in_flight = state.spawned.saturating_sub(terminated);
        let available = self.memory_cap.saturating_sub(in_flight);
        let remaining = state.total_children - state.spawned;
        let to_spawn = available.min(remaining).min(32); // batch cap

        for _ in 0..to_spawn {
            let child_id_num = self.next_child_id.fetch_add(1, Ordering::Relaxed);
            let child_id = TransferId {
                id: child_id_num,
                parent: Some(self.ctx.id.id),
            };

            let child: Box<dyn Transfer> = if let Some(ref notify) = self.child_notify {
                Box::new(
                    ChildMockTransfer::new_blocking(
                        child_id,
                        self.handle.clone(),
                        self.counter.clone(),
                        notify.clone(),
                    )
                    .with_terminated_counter(self.terminated_counter.clone()),
                )
            } else {
                Box::new(
                    ChildMockTransfer::new(
                        child_id,
                        self.handle.clone(),
                        self.work_per_child,
                        self.counter.clone(),
                    )
                    .with_terminated_counter(self.terminated_counter.clone()),
                )
            };

            self.handle.scheduler.enqueue_transfer(child);
            state.spawned += 1;
        }
    }
}

impl Transfer for CompositeMock {
    fn ctx(&self) -> &TransferContext {
        &self.ctx
    }

    fn poll_work(&self) -> PollWork {
        let mut state = self.state.lock().unwrap();

        // Done condition: all children spawned AND all children terminated
        // (their poll_work returned Done). The work counter is NOT used for
        // termination because it is incremented in execute, which fires
        // before the child's terminating poll - using it would race against
        // children mid-wake and orphan them.
        let terminated = self.terminated_counter.load(Ordering::SeqCst);
        if terminated >= state.total_children && state.spawned >= state.total_children {
            drop(state);
            self.ctx.set_completed();
            self.ctx.signal_terminal();
            return PollWork::Done;
        }

        // Spawn more children if under cap
        if state.spawned < state.total_children {
            self.spawn_children(&mut state);
        }

        // Still waiting for children to complete
        drop(state);
        self.ctx.set_pending(PendingCause::other("test"));
        PollWork::Pending
    }

    fn execute<'a>(
        &'a self,
        _work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        unreachable!("CompositeMock never returns PollWork::Ready")
    }
}

/// A composite mock that panics on its first `poll_work` invocation.
///
/// Used to test the scheduler's panic recovery: the scheduler catches the
/// panic, force-terminates the transfer, and continues processing peers.
pub(crate) struct PanickingCompositeMock {
    ctx: TransferContext,
}

impl std::fmt::Debug for PanickingCompositeMock {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("PanickingCompositeMock").finish()
    }
}

impl PanickingCompositeMock {
    /// Create a panicking composite mock with the given identity.
    pub(crate) fn new(id: TransferId, handle: Arc<crate::client::Handle>) -> Self {
        let (ctx, _rx) = TransferContext::with_id(id, handle);
        Self { ctx }
    }
}

impl Transfer for PanickingCompositeMock {
    fn ctx(&self) -> &TransferContext {
        &self.ctx
    }

    fn poll_work(&self) -> PollWork {
        panic!("PanickingCompositeMock: intentional panic in poll_work")
    }

    fn execute<'a>(
        &'a self,
        _work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        unreachable!("PanickingCompositeMock never returns PollWork::Ready")
    }
}

/// A composite that violates the Transfer contract by returning `Done`
/// while children are still alive in the scheduler. Used to test the
/// scheduler's defensive cleanup of orphaned children in
/// `generate_work`'s Done branch.
///
/// On first `poll_work`, spawns `num_children` no-op children whose
/// `poll_work` returns `Pending` indefinitely. Then signals terminal
/// and returns `Done`. Without defensive cleanup, the children would
/// remain in the transfers map forever (their handles never resolving).
pub(crate) struct BuggyDoneMock {
    ctx: TransferContext,
    handle: Arc<crate::client::Handle>,
    num_children: u64,
    children_spawned: AtomicBool,
    /// Senders we hand off to the children via construction. Filled on
    /// first `poll_work`. The caller holds a clone of this Arc so it
    /// can take the receivers after enqueue ownership-transfers the
    /// mock to the scheduler.
    child_terminals: Arc<std::sync::Mutex<Option<Vec<StateMachineTerminalReceiver>>>>,
}

/// Handle returned by `BuggyDoneMock::new` so the test can observe each
/// child's termination after the mock has been moved into the scheduler.
pub(crate) type BuggyDoneChildTerminals =
    Arc<std::sync::Mutex<Option<Vec<StateMachineTerminalReceiver>>>>;

impl std::fmt::Debug for BuggyDoneMock {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("BuggyDoneMock").finish()
    }
}

impl BuggyDoneMock {
    pub(crate) fn new(
        id: TransferId,
        handle: Arc<crate::client::Handle>,
        num_children: u64,
    ) -> (Self, BuggyDoneChildTerminals) {
        let (ctx, _rx) = TransferContext::with_id(id, handle.clone());
        let terminals: BuggyDoneChildTerminals = Arc::new(std::sync::Mutex::new(Some(
            Vec::with_capacity(num_children as usize),
        )));
        let mock = Self {
            ctx,
            handle,
            num_children,
            children_spawned: AtomicBool::new(false),
            child_terminals: terminals.clone(),
        };
        (mock, terminals)
    }
}

impl Transfer for BuggyDoneMock {
    fn ctx(&self) -> &TransferContext {
        &self.ctx
    }

    fn poll_work(&self) -> PollWork {
        if !self
            .children_spawned
            .swap(true, std::sync::atomic::Ordering::SeqCst)
        {
            // Spawn children with NoopChild::poll_work returning Pending,
            // so they sit in the transfers map indefinitely until cleaned
            // up by the Done branch's defensive code.
            let mut terminals = Vec::with_capacity(self.num_children as usize);
            for i in 0..self.num_children {
                let child_id = TransferId {
                    id: 100_000 + i,
                    parent: Some(self.ctx.id.id),
                };
                let (child, term_rx) = NoopChild::new(child_id, self.handle.clone());
                terminals.push(term_rx);
                self.handle.scheduler.enqueue_transfer(Box::new(child));
            }
            *self.child_terminals.lock().unwrap() = Some(terminals);
        }
        // Contract violation: return Done while children are still alive.
        self.ctx.set_completed();
        self.ctx.signal_terminal();
        PollWork::Done
    }

    fn execute<'a>(
        &'a self,
        _work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        unreachable!("BuggyDoneMock never returns PollWork::Ready")
    }
}

/// A child transfer that always returns `Pending` from `poll_work` and
/// never produces work. Used by `BuggyDoneMock` so children remain in
/// the transfers map until cancelled.
pub(crate) struct NoopChild {
    ctx: TransferContext,
}

impl std::fmt::Debug for NoopChild {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("NoopChild").finish()
    }
}

impl NoopChild {
    pub(crate) fn new(
        id: TransferId,
        handle: Arc<crate::client::Handle>,
    ) -> (Self, StateMachineTerminalReceiver) {
        let (ctx, rx) = TransferContext::with_id(id, handle);
        (Self { ctx }, rx)
    }
}

impl Transfer for NoopChild {
    fn ctx(&self) -> &TransferContext {
        &self.ctx
    }

    fn poll_work(&self) -> PollWork {
        self.ctx.set_pending(PendingCause::other("test"));
        PollWork::Pending
    }

    fn execute<'a>(
        &'a self,
        _work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        unreachable!("NoopChild never returns PollWork::Ready")
    }
}

/// A parent that transitions itself to a terminal state in an execute callback
/// without calling `signal_terminal`, while a child is still registered. Models
/// a state machine that calls `set_failed`/`set_completed` without the paired
/// `signal_terminal` (e.g. an `Abort`-policy directory transfer): the scheduler
/// observes the parent terminal-and-idle and removes it, and the owning handle's
/// `join()` resolves only if the scheduler signals the removed transfer.
pub(crate) struct TerminalWithoutSignalMock {
    ctx: TransferContext,
    handle: Arc<crate::client::Handle>,
    spawned: AtomicBool,
}

impl std::fmt::Debug for TerminalWithoutSignalMock {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("TerminalWithoutSignalMock").finish()
    }
}

impl TerminalWithoutSignalMock {
    /// Returns the mock plus its own completion receiver (the parent handle's
    /// channel) so a test can assert the parent's terminal was signaled.
    pub(crate) fn new(
        id: TransferId,
        handle: Arc<crate::client::Handle>,
    ) -> (Self, StateMachineTerminalReceiver) {
        let (ctx, completion_rx) = TransferContext::with_id(id, handle.clone());
        (
            Self {
                ctx,
                handle,
                spawned: AtomicBool::new(false),
            },
            completion_rx,
        )
    }
}

impl Transfer for TerminalWithoutSignalMock {
    fn ctx(&self) -> &TransferContext {
        &self.ctx
    }

    fn poll_work(&self) -> PollWork {
        if !self.spawned.swap(true, Ordering::SeqCst) {
            // Register a live child that never completes on its own, then emit
            // one work item. After it executes (set_failed without signal), the
            // parent is terminal-and-idle with a live child.
            let child_id = TransferId {
                id: 200_000,
                parent: Some(self.ctx.id.id),
            };
            let (child, _term_rx) = NoopChild::new(child_id, self.handle.clone());
            self.handle.scheduler.enqueue_transfer(Box::new(child));
            return PollWork::ready(IoRequest { data: None });
        }
        // No further work; the transfer is already terminal (set in execute).
        self.ctx.set_pending(PendingCause::other("test"));
        PollWork::Pending
    }

    fn execute<'a>(
        &'a self,
        _work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        Box::pin(async move {
            // Go terminal without signaling. Return Success (not Failed) so the
            // transfer is not auto-signaled; completion flows through the
            // scheduler's on_completion terminal+idle path.
            self.ctx.set_failed(crate::error::from_kind(
                crate::error::ErrorKind::RuntimeError,
            )("terminal without signal"));
            WorkOutcome::Success { data: None }
        })
    }
}

/// A composite transfer mock that spawns exactly one child per `poll_work` call,
/// returning `PollWork::Spawned` each time, so the scheduler re-polls it while
/// capacity remains.
///
/// This exercises the single-ticket spawn path: the scheduler's `Spawned` arm
/// charges vruntime (spin guard) and re-inserts without incrementing `dispatched`,
/// letting the spawned child account for itself when it later yields a work item.
pub(crate) struct SingleTicketCompositeMock {
    ctx: TransferContext,
    handle: Arc<crate::client::Handle>,
    state: Mutex<CompositeMockState>,
    work_per_child: u64,
    memory_cap: u64,
    counter: DispatchCounter,
    child_notify: Option<Arc<tokio::sync::Notify>>,
    next_child_id: AtomicU64,
    terminated_counter: Arc<AtomicU64>,
    /// Mirror of `state.spawned` as an Arc-wrapped atomic, allowing external
    /// observation after the composite is moved into the scheduler.
    spawned_counter: Arc<AtomicU64>,
    /// If set, this composite's id (on each `poll_work`) and each spawned
    /// child's id (on each of its `poll_work`s) are appended, so a test can
    /// observe the parent/child poll interleaving order.
    poll_log: Option<Arc<Mutex<Vec<u64>>>>,
}

impl std::fmt::Debug for SingleTicketCompositeMock {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("SingleTicketCompositeMock")
            .field("id", &self.ctx.id)
            .finish_non_exhaustive()
    }
}

impl SingleTicketCompositeMock {
    /// Create a new single-ticket composite mock transfer.
    ///
    /// Identical arguments to `CompositeMock::new`, but `poll_work` spawns exactly
    /// one child per call and returns `PollWork::Spawned` instead of batching.
    pub(crate) fn new(
        id: TransferId,
        handle: Arc<crate::client::Handle>,
        total_children: u64,
        work_per_child: u64,
        memory_cap: u64,
        counter: DispatchCounter,
    ) -> Self {
        let (ctx, _rx) = TransferContext::with_id(id, handle.clone());
        Self {
            ctx,
            handle,
            state: Mutex::new(CompositeMockState {
                total_children,
                spawned: 0,
            }),
            work_per_child,
            memory_cap,
            counter,
            child_notify: None,
            next_child_id: AtomicU64::new(id.id * 1_000_000 + 1),
            terminated_counter: Arc::new(AtomicU64::new(0)),
            spawned_counter: Arc::new(AtomicU64::new(0)),
            poll_log: None,
        }
    }

    /// Create a single-ticket composite whose children block in execute until
    /// `notify` is signaled.
    pub(crate) fn new_blocking(
        id: TransferId,
        handle: Arc<crate::client::Handle>,
        total_children: u64,
        memory_cap: u64,
        counter: DispatchCounter,
        notify: Arc<tokio::sync::Notify>,
    ) -> Self {
        let (ctx, _rx) = TransferContext::with_id(id, handle.clone());
        Self {
            ctx,
            handle,
            state: Mutex::new(CompositeMockState {
                total_children,
                spawned: 0,
            }),
            work_per_child: 1,
            memory_cap,
            counter,
            child_notify: Some(notify),
            next_child_id: AtomicU64::new(id.id * 1_000_000 + 1),
            terminated_counter: Arc::new(AtomicU64::new(0)),
            spawned_counter: Arc::new(AtomicU64::new(0)),
            poll_log: None,
        }
    }

    /// Share a poll-order log with this composite and every child it spawns.
    /// Each `poll_work` entry (parent or child) appends its `TransferId.id`,
    /// so a test can observe the parent/child poll interleaving order.
    pub(crate) fn with_poll_log(mut self, log: Arc<Mutex<Vec<u64>>>) -> Self {
        self.poll_log = Some(log);
        self
    }

    /// Total children spawned so far.
    #[allow(dead_code)]
    pub(crate) fn total_spawned(&self) -> u64 {
        self.state.lock().unwrap().spawned
    }

    /// Total children that have terminated (their `poll_work` returned `Done`).
    #[allow(dead_code)]
    pub(crate) fn total_terminated(&self) -> u64 {
        self.terminated_counter.load(Ordering::SeqCst)
    }

    /// Whether all children have been spawned and terminated.
    #[allow(dead_code)]
    pub(crate) fn is_complete(&self) -> bool {
        let s = self.state.lock().unwrap();
        let terminated = self.terminated_counter.load(Ordering::SeqCst);
        terminated >= s.total_children && s.spawned >= s.total_children
    }

    /// The dispatch counter shared with all children.
    #[allow(dead_code)]
    pub(crate) fn dispatch_counter(&self) -> &DispatchCounter {
        &self.counter
    }

    /// Cloneable handles for observing spawned/terminated counts after the
    /// composite is moved into the scheduler. Returns (spawned_arc, terminated_arc).
    #[allow(dead_code)]
    pub(crate) fn observer_handles(&self) -> (Arc<AtomicU64>, Arc<AtomicU64>) {
        (
            self.spawned_counter.clone(),
            self.terminated_counter.clone(),
        )
    }

    /// Spawn exactly one child. Returns true if a child was spawned.
    fn spawn_one_child(&self, state: &mut CompositeMockState) -> bool {
        let terminated = self.terminated_counter.load(Ordering::SeqCst);
        let in_flight = state.spawned.saturating_sub(terminated);
        if in_flight >= self.memory_cap {
            return false;
        }
        if state.spawned >= state.total_children {
            return false;
        }

        let child_id_num = self.next_child_id.fetch_add(1, Ordering::Relaxed);
        let child_id = TransferId {
            id: child_id_num,
            parent: Some(self.ctx.id.id),
        };

        let mut child = if let Some(ref notify) = self.child_notify {
            ChildMockTransfer::new_blocking(
                child_id,
                self.handle.clone(),
                self.counter.clone(),
                notify.clone(),
            )
            .with_terminated_counter(self.terminated_counter.clone())
        } else {
            ChildMockTransfer::new(
                child_id,
                self.handle.clone(),
                self.work_per_child,
                self.counter.clone(),
            )
            .with_terminated_counter(self.terminated_counter.clone())
        };
        if let Some(ref log) = self.poll_log {
            child = child.with_poll_log(log.clone());
        }
        let child: Box<dyn Transfer> = Box::new(child);

        self.handle.scheduler.enqueue_transfer(child);
        state.spawned += 1;
        self.spawned_counter.fetch_add(1, Ordering::SeqCst);
        true
    }
}

impl Transfer for SingleTicketCompositeMock {
    fn ctx(&self) -> &TransferContext {
        &self.ctx
    }

    fn poll_work(&self) -> PollWork {
        if let Some(ref log) = self.poll_log {
            log.lock().unwrap().push(self.ctx.id.id);
        }
        let mut state = self.state.lock().unwrap();

        // Done condition: all children spawned AND all children terminated.
        let terminated = self.terminated_counter.load(Ordering::SeqCst);
        if terminated >= state.total_children && state.spawned >= state.total_children {
            drop(state);
            self.ctx.set_completed();
            self.ctx.signal_terminal();
            return PollWork::Done;
        }

        // Try to spawn exactly one child.
        if self.spawn_one_child(&mut state) {
            return PollWork::Spawned;
        }

        // Cannot spawn (at memory cap or all spawned but not all terminated).
        drop(state);
        self.ctx.set_pending(PendingCause::other("test"));
        PollWork::Pending
    }

    fn execute<'a>(
        &'a self,
        _work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        unreachable!("SingleTicketCompositeMock never returns PollWork::Ready")
    }
}

/// A mock that returns `PollWork::Ready { io, spawned: true }` on its first
/// poll and `Pending` thereafter. Exercises the scheduler's fused reap+spawn
/// arm which charges both `work_generated` (for the IO) and
/// `work_generated_spawn` (for the fused child spawn) in one pass. Returns
/// `Pending` (rather than `Done`) so the descriptor stays in `transfers` for
/// vruntime observation.
#[derive(Debug)]
pub(crate) struct FusedReadySpawnedMock {
    polled: AtomicBool,
    completed: AtomicU64,
}

impl FusedReadySpawnedMock {
    pub(crate) fn new() -> Self {
        Self {
            polled: AtomicBool::new(false),
            completed: AtomicU64::new(0),
        }
    }

    #[allow(dead_code)]
    pub(crate) fn completed_count(&self) -> u64 {
        self.completed.load(Ordering::SeqCst)
    }
}

impl MockStateMachine for FusedReadySpawnedMock {
    fn poll_work(&self, _id: TransferId) -> PollWork {
        if !self.polled.swap(true, Ordering::SeqCst) {
            return PollWork::Ready {
                io: IoRequest { data: None },
                spawned: true,
            };
        }
        PollWork::Pending
    }

    fn execute<'a>(
        &'a self,
        _work: &'a mut IoRequest,
    ) -> Pin<Box<dyn Future<Output = WorkOutcome> + Send + 'a>> {
        Box::pin(async move {
            self.completed.fetch_add(1, Ordering::SeqCst);
            WorkOutcome::Success { data: None }
        })
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    fn test_id() -> TransferId {
        TransferId {
            id: 1,
            parent: None,
        }
    }

    #[cfg_attr(miri, ignore)]
    #[tokio::test]
    async fn test_fixed_work_count() {
        let sm = FixedWorkCount::new(3);
        let id = test_id();

        for _ in 0..3 {
            assert!(matches!(sm.poll_work(id), PollWork::Ready { .. }));
        }
        assert!(matches!(sm.poll_work(id), PollWork::Done));
    }

    #[cfg_attr(miri, ignore)]
    #[tokio::test]
    async fn test_with_delay() {
        let sm = WithDelay::new(FixedWorkCount::new(1), Duration::from_millis(50));
        let id = test_id();

        let mut work = match sm.poll_work(id) {
            PollWork::Ready { io, .. } => io,
            _ => panic!("expected Ready"),
        };

        let start = std::time::Instant::now();
        sm.execute(&mut work).await;
        assert!(start.elapsed() >= Duration::from_millis(50));
    }
}