awa 0.6.6

Postgres-native background job queue — transactional enqueue, heartbeat crash recovery, SKIP LOCKED dispatch
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
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
//! Benchmark and smoke tests for the queue storage engine.
//!
//! `test_queue_storage_storage_benchmark` is intentionally a smoke benchmark:
//! it emits raw overlap/rotation/prune data for ADR validation, but it is not
//! the source of truth for release claims. Throughput/latency thresholds live
//! in `benchmark_test.rs`, and the reproducible validation output is checked in
//! under `docs/adr/bench/`.

mod bench_output;

use awa::model::{
    migrations, AwaError, InsertOpts, InsertParams, PruneOutcome, QueueStorage, QueueStorageConfig,
    RotateOutcome,
};
use bench_output::{BenchLatency, BenchMetrics, BenchThroughput, BenchmarkResult, SCHEMA_VERSION};
use serde::Serialize;
use sqlx::postgres::PgPoolOptions;
use std::collections::HashMap;
use std::sync::atomic::{AtomicU64, Ordering};
use std::sync::{Arc, Mutex};
use std::time::{Duration, Instant};

fn is_lock_contention_sqlx(err: &sqlx::Error) -> bool {
    matches!(
        err,
        sqlx::Error::Database(db_err) if db_err.code().as_deref() == Some("55P03")
    )
}

fn is_lock_contention_awa(err: &AwaError) -> bool {
    matches!(err, AwaError::Database(db_err) if is_lock_contention_sqlx(db_err))
}

fn base_database_url() -> String {
    std::env::var("DATABASE_URL")
        .unwrap_or_else(|_| "postgres://postgres:test@localhost:15432/awa_test".to_string())
}

fn replace_database_name(url: &str, database_name: &str) -> String {
    let (without_query, query_suffix) = match url.split_once('?') {
        Some((prefix, query)) => (prefix, Some(query)),
        None => (url, None),
    };
    let (base, _) = without_query
        .rsplit_once('/')
        .expect("database URL should include a database name");
    let mut out = format!("{base}/{database_name}");
    if let Some(query) = query_suffix {
        out.push('?');
        out.push_str(query);
    }
    out
}

fn database_name(url: &str) -> String {
    let without_query = url.split_once('?').map(|(prefix, _)| prefix).unwrap_or(url);
    without_query
        .rsplit_once('/')
        .map(|(_, database_name)| database_name.to_string())
        .expect("database URL should include a database name")
}

fn validate_database_name(database_name: &str) {
    assert!(
        !database_name.is_empty()
            && database_name
                .chars()
                .all(|ch| ch.is_ascii_alphanumeric() || ch == '_'),
        "queue_storage benchmark database names must use only [A-Za-z0-9_]"
    );
}

fn database_url() -> String {
    std::env::var("DATABASE_URL_QUEUE_STORAGE")
        .unwrap_or_else(|_| replace_database_name(&base_database_url(), "awa_test_queue_storage"))
}

async fn ensure_database_exists(url: &str) {
    let database_name = database_name(url);
    validate_database_name(&database_name);
    let admin_url = replace_database_name(url, "postgres");
    let admin_pool = PgPoolOptions::new()
        .max_connections(1)
        .connect(&admin_url)
        .await
        .expect("Failed to connect to admin database for queue_storage benchmarks");
    let create_sql = format!("CREATE DATABASE {database_name}");
    match sqlx::query(&create_sql).execute(&admin_pool).await {
        Ok(_) => {}
        Err(sqlx::Error::Database(db_err)) if db_err.code().as_deref() == Some("42P04") => {}
        Err(err) => {
            panic!("Failed to create queue_storage benchmark database {database_name}: {err}")
        }
    }
}

async fn pool_with(max_conns: u32) -> sqlx::PgPool {
    let url = database_url();
    ensure_database_exists(&url).await;
    let pool = PgPoolOptions::new()
        .max_connections(max_conns)
        .connect(&url)
        .await
        .expect("Failed to connect to database");
    migrations::run(&pool)
        .await
        .expect("Failed to run queue_storage benchmark migrations");
    pool
}

fn env_u32(name: &str, default: u32) -> u32 {
    std::env::var(name)
        .ok()
        .and_then(|value| value.parse::<u32>().ok())
        .unwrap_or(default)
}

fn env_u64(name: &str, default: u64) -> u64 {
    std::env::var(name)
        .ok()
        .and_then(|value| value.parse::<u64>().ok())
        .unwrap_or(default)
}

fn env_string(name: &str, default: &str) -> String {
    std::env::var(name).unwrap_or_else(|_| default.to_string())
}

#[derive(Debug, Clone, Serialize)]
struct QueueStorageSample {
    second: u64,
    seeded_total: u64,
    completed_total: u64,
    completed_delta: u64,
    available: i64,
    running: i64,
    completed: i64,
    queue_lanes_dead_tup: i64,
    ready_dead_tup: i64,
    done_dead_tup: i64,
    leases_dead_tup: i64,
    attempt_state_dead_tup: i64,
    queue_prune_ok: u64,
    queue_prune_blocked: u64,
    queue_prune_skipped_active: u64,
    lease_prune_ok: u64,
    lease_prune_blocked: u64,
    lease_prune_skipped_active: u64,
}

#[derive(Debug, Clone)]
struct QueueStorageSnapshot {
    available: i64,
    running: i64,
    completed: i64,
    queue_lanes_dead_tup: i64,
    ready_dead_tup: i64,
    done_dead_tup: i64,
    leases_dead_tup: i64,
    attempt_state_dead_tup: i64,
}

#[derive(Debug, Clone, Copy, Default, Serialize)]
struct ExactDeadTuples {
    queue_lanes: i64,
    ready: i64,
    done: i64,
    leases: i64,
    attempt_state: i64,
}

#[derive(Debug, Clone)]
struct DbProfileSnapshot {
    wal_insert_lsn: String,
    xact_commit: i64,
    xact_rollback: i64,
    tup_inserted: i64,
    temp_bytes: i64,
    temp_files: i64,
}

#[derive(Default)]
struct MaintenanceCounters {
    queue_prune_ok: AtomicU64,
    queue_prune_blocked: AtomicU64,
    queue_prune_skipped_active: AtomicU64,
    queue_rotate_ok: AtomicU64,
    queue_rotate_skipped_busy: AtomicU64,
    lease_prune_ok: AtomicU64,
    lease_prune_blocked: AtomicU64,
    lease_prune_skipped_active: AtomicU64,
    lease_rotate_ok: AtomicU64,
    lease_rotate_skipped_busy: AtomicU64,
}

async fn ensure_pgstattuple(pool: &sqlx::PgPool) {
    sqlx::query("CREATE EXTENSION IF NOT EXISTS pgstattuple")
        .execute(pool)
        .await
        .expect("Failed to create pgstattuple extension for queue-storage benchmark sampling");
}

async fn capture_db_profile(pool: &sqlx::PgPool) -> Option<DbProfileSnapshot> {
    let _ = sqlx::query("SELECT pg_stat_force_next_flush()")
        .execute(pool)
        .await;
    let _ = sqlx::query("SELECT pg_stat_clear_snapshot()")
        .execute(pool)
        .await;

    let row = sqlx::query_as::<_, (String, i64, i64, i64, i64, i64)>(
        r#"
        SELECT
            pg_current_wal_insert_lsn()::text,
            COALESCE(xact_commit, 0),
            COALESCE(xact_rollback, 0),
            COALESCE(tup_inserted, 0),
            COALESCE(temp_bytes, 0),
            COALESCE(temp_files, 0)
        FROM pg_stat_database
        WHERE datname = current_database()
        "#,
    )
    .fetch_optional(pool)
    .await
    .ok()??;

    Some(DbProfileSnapshot {
        wal_insert_lsn: row.0,
        xact_commit: row.1,
        xact_rollback: row.2,
        tup_inserted: row.3,
        temp_bytes: row.4,
        temp_files: row.5,
    })
}

async fn capture_db_profile_delta(
    pool: &sqlx::PgPool,
    start: &DbProfileSnapshot,
) -> Option<serde_json::Value> {
    let end = capture_db_profile(pool).await?;
    let wal_bytes: i64 =
        sqlx::query_scalar("SELECT pg_wal_lsn_diff($1::pg_lsn, $2::pg_lsn)::bigint")
            .bind(&end.wal_insert_lsn)
            .bind(&start.wal_insert_lsn)
            .fetch_one(pool)
            .await
            .ok()?;

    Some(serde_json::json!({
        "wal_bytes": wal_bytes,
        "xact_commit_delta": end.xact_commit - start.xact_commit,
        "xact_rollback_delta": end.xact_rollback - start.xact_rollback,
        "tup_inserted_delta": end.tup_inserted - start.tup_inserted,
        "temp_bytes_delta": end.temp_bytes - start.temp_bytes,
        "temp_files_delta": end.temp_files - start.temp_files,
    }))
}

async fn recreate_store_schema(pool: &sqlx::PgPool, store: &QueueStorage) {
    let drop_sql = format!("DROP SCHEMA IF EXISTS {} CASCADE", store.schema());
    sqlx::query(&drop_sql)
        .execute(pool)
        .await
        .expect("Failed to drop experimental queue storage schema");
}

async fn sample_dead_tuples(pool: &sqlx::PgPool, schema: &str, relname_filter: &str) -> i64 {
    sqlx::query_scalar::<_, i64>(
        r#"
        SELECT COALESCE(sum(n_dead_tup), 0)::bigint
        FROM pg_stat_user_tables
        WHERE schemaname = $1
          AND relname LIKE $2
        "#,
    )
    .bind(schema)
    .bind(relname_filter)
    .fetch_one(pool)
    .await
    .expect("Failed to sample dead tuples")
}

async fn sample_pgstattuple_dead_tuples(
    pool: &sqlx::PgPool,
    schema: &str,
    relname_filter: &str,
) -> Option<i64> {
    let mut conn = pool
        .acquire()
        .await
        .expect("Failed to acquire pgstattuple connection");

    sqlx::query_scalar::<_, i64>(
        r#"
        SELECT COALESCE(sum((pgstattuple(c.oid::regclass)).dead_tuple_count), 0)::bigint
        FROM pg_class AS c
        INNER JOIN pg_namespace AS n
            ON n.oid = c.relnamespace
        WHERE n.nspname = $1
          AND c.relkind = 'r'
          AND c.relname LIKE $2
        "#,
    )
    .bind(schema)
    .bind(relname_filter)
    .fetch_one(conn.as_mut())
    .await
    .ok()
}

async fn sample_exact_dead_tuples(
    pool: &sqlx::PgPool,
    store: &QueueStorage,
) -> Option<ExactDeadTuples> {
    Some(ExactDeadTuples {
        queue_lanes: sample_pgstattuple_dead_tuples(pool, store.schema(), "queue_lanes").await?,
        ready: sample_pgstattuple_dead_tuples(pool, store.schema(), "ready_entries_%").await?,
        done: sample_pgstattuple_dead_tuples(pool, store.schema(), "done_entries_%").await?,
        leases: sample_pgstattuple_dead_tuples(pool, store.schema(), "leases_%").await?,
        attempt_state: sample_pgstattuple_dead_tuples(pool, store.schema(), "attempt_state")
            .await?,
    })
}

async fn sample_snapshot(
    pool: &sqlx::PgPool,
    store: &QueueStorage,
    queue: &str,
) -> QueueStorageSnapshot {
    let _ = sqlx::query("SELECT pg_stat_force_next_flush()")
        .execute(pool)
        .await;
    let _ = sqlx::query("SELECT pg_stat_clear_snapshot()")
        .execute(pool)
        .await;

    let counts = store
        .queue_counts(pool, queue)
        .await
        .expect("Failed to sample queue counts");

    let queue_lanes_dead_tup = sample_dead_tuples(pool, store.schema(), "queue_lanes").await;
    let ready_dead_tup = sample_dead_tuples(pool, store.schema(), "ready_entries_%").await;
    let done_dead_tup = sample_dead_tuples(pool, store.schema(), "done_entries_%").await;
    let leases_dead_tup = sample_dead_tuples(pool, store.schema(), "leases_%").await;
    let attempt_state_dead_tup = sample_dead_tuples(pool, store.schema(), "attempt_state").await;

    QueueStorageSnapshot {
        available: counts.available,
        running: counts.running,
        completed: counts.terminal,
        queue_lanes_dead_tup,
        ready_dead_tup,
        done_dead_tup,
        leases_dead_tup,
        attempt_state_dead_tup,
    }
}

async fn upsert_enqueue_shards(pool: &sqlx::PgPool, queue: &str, enqueue_shards: i16) {
    sqlx::query(
        r#"
        INSERT INTO awa.queue_meta (queue, enqueue_shards)
        VALUES ($1, $2)
        ON CONFLICT (queue)
        DO UPDATE SET enqueue_shards = EXCLUDED.enqueue_shards
        "#,
    )
    .bind(queue)
    .bind(enqueue_shards)
    .execute(pool)
    .await
    .expect("Failed to configure queue_meta.enqueue_shards");
}

fn deep_backlog_job(queue: &str, priority: i16, seq: u64) -> InsertParams {
    InsertParams {
        kind: "deep_backlog_job".to_string(),
        args: serde_json::json!({ "seq": seq }),
        opts: InsertOpts {
            queue: queue.to_string(),
            priority,
            ..Default::default()
        },
    }
}

async fn seed_deep_backlog_copy(
    pool: &sqlx::PgPool,
    store: &QueueStorage,
    queue: &str,
    priority: i16,
    total_jobs: u64,
    chunk_size: usize,
) -> u64 {
    let mut inserted = 0_u64;
    let chunk_size = chunk_size.max(1);

    for chunk_start in (0..total_jobs).step_by(chunk_size) {
        let chunk_end = (chunk_start + chunk_size as u64).min(total_jobs);
        let jobs: Vec<_> = (chunk_start..chunk_end)
            .map(|seq| deep_backlog_job(queue, priority, seq))
            .collect();
        inserted += store
            .enqueue_params_copy(pool, &jobs)
            .await
            .expect("Deep-backlog direct COPY seed failed") as u64;
    }

    inserted
}

fn percentile(values: &[f64], percentile: f64) -> Option<f64> {
    if values.is_empty() {
        return None;
    }
    let mut sorted = values.to_vec();
    sorted.sort_by(|a, b| a.partial_cmp(b).expect("latency percentile NaN"));
    let rank = ((sorted.len() - 1) as f64 * percentile).round() as usize;
    sorted.get(rank).copied()
}

async fn wait_or_stop(duration: Duration, stop: &mut tokio::sync::watch::Receiver<bool>) -> bool {
    if *stop.borrow() {
        return true;
    }
    tokio::select! {
        _ = tokio::time::sleep(duration) => false,
        changed = stop.changed() => changed.is_err() || *stop.borrow(),
    }
}

#[allow(clippy::too_many_arguments)]
async fn producer_loop(
    pool: sqlx::PgPool,
    store: Arc<QueueStorage>,
    queue: String,
    priority: i16,
    jobs_per_sec: u64,
    tick: Duration,
    seeded: Arc<AtomicU64>,
    mut stop: tokio::sync::watch::Receiver<bool>,
) {
    let mut interval = tokio::time::interval(tick);
    interval.set_missed_tick_behavior(tokio::time::MissedTickBehavior::Skip);
    let mut carry = 0.0_f64;

    loop {
        tokio::select! {
            _ = stop.changed() => {
                if *stop.borrow() {
                    break;
                }
            }
            _ = interval.tick() => {
                carry += jobs_per_sec as f64 * tick.as_secs_f64();
                let batch = carry.floor() as i64;
                carry -= batch as f64;
                if batch <= 0 {
                    continue;
                }

                store
                    .enqueue_batch(&pool, &queue, priority, batch)
                    .await
                    .expect("Vacuum-aware enqueue batch failed");
                seeded.fetch_add(batch as u64, Ordering::Relaxed);
            }
        }
    }
}

async fn consumer_loop(
    pool: sqlx::PgPool,
    store: Arc<QueueStorage>,
    queue: String,
    batch_size: i64,
    claim_latencies_ms: Arc<Mutex<Vec<f64>>>,
    completed: Arc<AtomicU64>,
    mut stop: tokio::sync::watch::Receiver<bool>,
) {
    loop {
        if *stop.borrow() {
            break;
        }

        let claim_started = Instant::now();
        let claimed = store
            .claim_batch(&pool, &queue, batch_size)
            .await
            .expect("Vacuum-aware claim batch failed");

        if claimed.is_empty() {
            tokio::select! {
                _ = stop.changed() => {
                    if *stop.borrow() {
                        break;
                    }
                }
                _ = tokio::time::sleep(Duration::from_millis(2)) => {}
            }
            continue;
        }

        claim_latencies_ms
            .lock()
            .expect("claim latency lock poisoned")
            .push(claim_started.elapsed().as_secs_f64() * 1000.0);

        let completed_rows = store
            .complete_batch(&pool, &claimed)
            .await
            .expect("Vacuum-aware completion batch failed");
        completed.fetch_add(completed_rows as u64, Ordering::Relaxed);
    }
}

async fn maintenance_loop(
    pool: sqlx::PgPool,
    store: Arc<QueueStorage>,
    queue_rotate_interval: Duration,
    lease_rotate_interval: Duration,
    vacuum_interval: Option<Duration>,
    counters: Arc<MaintenanceCounters>,
    mut stop: tokio::sync::watch::Receiver<bool>,
) {
    let mut queue_rotate_timer = tokio::time::interval(queue_rotate_interval);
    queue_rotate_timer.tick().await;
    let mut lease_rotate_timer = tokio::time::interval(lease_rotate_interval);
    lease_rotate_timer.tick().await;
    let mut vacuum_timer = vacuum_interval.map(tokio::time::interval);
    if let Some(timer) = &mut vacuum_timer {
        timer.tick().await;
    }

    loop {
        tokio::select! {
            _ = stop.changed() => {
                if *stop.borrow() {
                    break;
                }
            }
            _ = queue_rotate_timer.tick() => {
                match store.rotate(&pool).await.expect("Vacuum-aware rotate failed") {
                    RotateOutcome::Rotated { .. } => {
                        counters.queue_rotate_ok.fetch_add(1, Ordering::Relaxed);
                    }
                    RotateOutcome::SkippedBusy { .. } => {
                        counters.queue_rotate_skipped_busy.fetch_add(1, Ordering::Relaxed);
                    }
                }

                match store.prune_oldest(&pool, Duration::ZERO).await {
                    Ok(PruneOutcome::Noop) => {}
                    Ok(PruneOutcome::Pruned { .. }) => {
                        counters.queue_prune_ok.fetch_add(1, Ordering::Relaxed);
                    }
                    Ok(PruneOutcome::Blocked { .. }) => {
                        counters.queue_prune_blocked.fetch_add(1, Ordering::Relaxed);
                    }
                    Ok(PruneOutcome::SkippedActive { .. }) => {
                        counters
                            .queue_prune_skipped_active
                            .fetch_add(1, Ordering::Relaxed);
                    }
                    Err(err) if is_lock_contention_awa(&err) => {
                        counters.queue_prune_blocked.fetch_add(1, Ordering::Relaxed);
                    }
                    Err(err) => panic!("Vacuum-aware prune failed: {err:?}"),
                }
            }
            _ = lease_rotate_timer.tick() => {
                match store.rotate_leases(&pool).await.expect("Vacuum-aware lease rotate failed") {
                    RotateOutcome::Rotated { .. } => {
                        counters.lease_rotate_ok.fetch_add(1, Ordering::Relaxed);
                    }
                    RotateOutcome::SkippedBusy { .. } => {
                        counters
                            .lease_rotate_skipped_busy
                            .fetch_add(1, Ordering::Relaxed);
                    }
                }

                match store.prune_oldest_leases(&pool).await {
                    Ok(PruneOutcome::Noop) => {}
                    Ok(PruneOutcome::Pruned { .. }) => {
                        counters.lease_prune_ok.fetch_add(1, Ordering::Relaxed);
                    }
                    Ok(PruneOutcome::Blocked { .. }) => {
                        counters
                            .lease_prune_blocked
                            .fetch_add(1, Ordering::Relaxed);
                    }
                    Ok(PruneOutcome::SkippedActive { .. }) => {
                        counters
                            .lease_prune_skipped_active
                            .fetch_add(1, Ordering::Relaxed);
                    }
                    Err(err) if is_lock_contention_awa(&err) => {
                        counters
                            .lease_prune_blocked
                            .fetch_add(1, Ordering::Relaxed);
                    }
                    Err(err) => panic!("Vacuum-aware lease prune failed: {err:?}"),
                }
            }
            _ = async {
                if let Some(timer) = &mut vacuum_timer {
                    timer.tick().await;
                } else {
                    std::future::pending::<()>().await;
                }
            }, if vacuum_timer.is_some() => {
                store
                    .vacuum_leases(&pool)
                    .await
                    .expect("Vacuum-aware lease vacuum failed");
            }
        }
    }
}

async fn overlap_reader(
    pool: sqlx::PgPool,
    schema: String,
    queue: String,
    initial_delay: Duration,
    hold_time: Duration,
    reader_mode: String,
    mut stop: tokio::sync::watch::Receiver<bool>,
) {
    if wait_or_stop(initial_delay, &mut stop).await {
        return;
    }

    loop {
        if *stop.borrow() {
            break;
        }

        let mut conn = pool
            .acquire()
            .await
            .expect("Failed to acquire overlap reader connection");

        sqlx::query("BEGIN ISOLATION LEVEL REPEATABLE READ READ ONLY")
            .execute(conn.as_mut())
            .await
            .expect("Failed to start overlap reader transaction");

        match reader_mode.as_str() {
            "history_snapshot" => {
                let query =
                    format!("SELECT count(*)::bigint FROM {schema}.ready_entries WHERE queue = $1");
                let _: i64 = sqlx::query_scalar(&query)
                    .bind(&queue)
                    .fetch_one(conn.as_mut())
                    .await
                    .expect("Failed to pin history reader snapshot");
            }
            _ => {
                let query = format!(
                    "WITH available AS (\
                         SELECT count(*)::bigint AS current_available \
                         FROM {schema}.ready_entries AS ready \
                         JOIN {schema}.queue_claim_heads AS claims \
                           ON claims.queue = ready.queue \
                          AND claims.priority = ready.priority \
                          AND claims.enqueue_shard = ready.enqueue_shard \
                         WHERE ready.queue = $1 \
                           AND ready.lane_seq >= {schema}.sequence_next_value(claims.seq_name)\
                     ), pruned AS (\
                         SELECT COALESCE(sum(pruned_completed_count), 0)::bigint AS terminal_rollup \
                         FROM {schema}.queue_terminal_rollups \
                         WHERE queue = $1\
                     ) \
                     SELECT available.current_available + pruned.terminal_rollup \
                     FROM available CROSS JOIN pruned"
                );
                let _: i64 = sqlx::query_scalar(&query)
                    .bind(&queue)
                    .fetch_one(conn.as_mut())
                    .await
                    .expect("Failed to pin cache reader snapshot");
            }
        }

        if wait_or_stop(hold_time, &mut stop).await {
            sqlx::query("COMMIT")
                .execute(conn.as_mut())
                .await
                .expect("Failed to commit overlap reader transaction");
            break;
        }

        sqlx::query("COMMIT")
            .execute(conn.as_mut())
            .await
            .expect("Failed to commit overlap reader transaction");

        if *stop.borrow() {
            break;
        }
    }
}

fn average_completed_rate(samples: &[QueueStorageSample]) -> f64 {
    if samples.is_empty() {
        0.0
    } else {
        samples
            .iter()
            .map(|sample| sample.completed_delta as f64)
            .sum::<f64>()
            / samples.len() as f64
    }
}

#[tokio::test]
async fn test_queue_storage_round_trip_smoke() {
    let pool = pool_with(12).await;
    // Use a dedicated schema, separate from the awa control plane.
    // The default queue-storage schema is now `awa`, so
    // `recreate_store_schema`'s `DROP SCHEMA … CASCADE` would also
    // drop `awa.job_state` and the rest of the migrations the
    // queue-storage tables themselves depend on.
    let store = QueueStorage::new(QueueStorageConfig {
        schema: "awa_qs_smoke".to_string(),
        // This test exercises the lease-row complete path
        // (`complete_batch` deletes from `{schema}.leases`). With
        // receipts mode on — the 0.6 default — short-job claims land
        // in `lease_claims` instead, so `complete_batch` would have
        // nothing to delete. Receipt-aware completion has its own
        // coverage; keep this fixture on the legacy path so we don't
        // lose coverage for it.
        lease_claim_receipts: false,
        ..Default::default()
    })
    .expect("Failed to construct queue storage store");
    recreate_store_schema(&pool, &store).await;
    store.install(&pool).await.expect("Failed to install store");
    store.reset(&pool).await.expect("Failed to reset store");

    store
        .enqueue_batch(&pool, "smoke", 2, 10)
        .await
        .expect("Failed to enqueue smoke jobs");
    let claimed = store
        .claim_batch(&pool, "smoke", 4)
        .await
        .expect("Failed to claim smoke jobs");
    assert_eq!(claimed.len(), 4);

    let counts = store
        .queue_counts(&pool, "smoke")
        .await
        .expect("Failed to sample smoke counts");
    assert_eq!(counts.available, 6);
    assert_eq!(counts.running, 4);
    assert_eq!(counts.terminal, 0);

    let completed = store
        .complete_batch(&pool, &claimed)
        .await
        .expect("Failed to complete smoke claims");
    assert_eq!(completed, 4);

    loop {
        let batch = store
            .claim_batch(&pool, "smoke", 8)
            .await
            .expect("Failed to drain smoke queue");
        if batch.is_empty() {
            break;
        }
        store
            .complete_batch(&pool, &batch)
            .await
            .expect("Failed to finish smoke claims");
    }

    let rotated_queue = store
        .rotate(&pool)
        .await
        .expect("Failed to rotate smoke queue slot");
    assert!(matches!(rotated_queue, RotateOutcome::Rotated { .. }));
    let pruned_queue = store
        .prune_oldest(&pool, Duration::ZERO)
        .await
        .expect("Failed to prune smoke queue slot");
    assert!(matches!(pruned_queue, PruneOutcome::Pruned { slot: 0, .. }));

    let rotated_leases = store
        .rotate_leases(&pool)
        .await
        .expect("Failed to rotate smoke lease slot");
    assert!(matches!(rotated_leases, RotateOutcome::Rotated { .. }));
    let pruned_leases = store
        .prune_oldest_leases(&pool)
        .await
        .expect("Failed to prune smoke lease slot");
    // The legacy complete path DELETEs each lease row in `complete_batch`, so
    // after draining, sealed lease slot 0 is already empty. The idle-prune
    // guard therefore skips the (no-op) TRUNCATE and reports Noop; a Pruned
    // outcome would mean the slot still held rows.
    assert!(
        matches!(pruned_leases, PruneOutcome::Noop),
        "drained (empty) lease slot 0 should report Noop, got {pruned_leases:?}"
    );

    let final_counts = store
        .queue_counts(&pool, "smoke")
        .await
        .expect("Failed to sample final smoke counts");
    assert_eq!(final_counts.available, 0);
    assert_eq!(final_counts.running, 0);
    assert_eq!(final_counts.terminal, 10);
}

#[tokio::test(flavor = "multi_thread", worker_threads = 6)]
#[ignore]
async fn test_queue_storage_storage_benchmark() {
    let max_conns = env_u32("AWA_VA_POOL_MAX", 24);
    let pool = pool_with(max_conns).await;
    ensure_pgstattuple(&pool).await;

    let queue_slot_count = env_u32("AWA_VA_QUEUE_SLOT_COUNT", env_u32("AWA_VA_SLOT_COUNT", 16));
    let lease_slot_count = env_u32("AWA_VA_LEASE_SLOT_COUNT", 8);
    let store = Arc::new(
        QueueStorage::new(QueueStorageConfig {
            // Same isolation reasoning as the smoke test above: avoid
            // dropping the awa control-plane schema as a side-effect.
            schema: "awa_qs_bench".to_string(),
            // The benchmark drives `claim_batch` → `complete_batch`
            // directly. Receipts-mode short-job claims write to
            // `lease_claims` instead of `leases`, so the legacy
            // `complete_batch` path here has nothing to delete.
            // Force the lease-row path so the benchmark exercises
            // what its harness measures.
            lease_claim_receipts: false,
            queue_slot_count: queue_slot_count as usize,
            lease_slot_count: lease_slot_count as usize,
            ..Default::default()
        })
        .expect("Failed to construct queue storage benchmark store"),
    );
    recreate_store_schema(&pool, &store).await;
    store
        .install(&pool)
        .await
        .expect("Failed to install queue storage store");

    let queue = env_string("AWA_VA_QUEUE", "bench_queue_storage");
    let priority = env_u32("AWA_VA_PRIORITY", 2) as i16;
    let producer_rate = env_u64("AWA_VA_ENQUEUE_RATE", 4_000);
    let producer_tick_ms = env_u64("AWA_VA_PRODUCER_TICK_MS", 50);
    let claim_batch_size = env_u64("AWA_VA_CLAIM_BATCH_SIZE", 512) as i64;
    let baseline_secs = env_u64("AWA_VA_BASELINE_SECS", 4);
    let overlap_secs = env_u64("AWA_VA_OVERLAP_SECS", 8);
    let cooldown_secs = env_u64("AWA_VA_COOLDOWN_SECS", 4);
    let overlap_readers = env_u32("AWA_VA_OVERLAP_READERS", 1);
    let overlap_hold_secs = env_u64("AWA_VA_OVERLAP_HOLD_SECS", 8);
    let overlap_stagger_secs = env_u64("AWA_VA_OVERLAP_STAGGER_SECS", 0);
    let reader_mode = env_string("AWA_VA_READER_MODE", "cache_snapshot");
    let queue_rotate_interval_ms = env_u64(
        "AWA_VA_QUEUE_ROTATE_INTERVAL_MS",
        env_u64("AWA_VA_ROTATE_INTERVAL_MS", 1_000),
    );
    let lease_rotate_interval_ms = env_u64("AWA_VA_LEASE_ROTATE_INTERVAL_MS", 100);
    let vacuum_interval_ms = env_u64("AWA_VA_VACUUM_INTERVAL_MS", 250);
    let vacuum_interval = if env_u32("AWA_VA_VACUUM_LEASES", 0) != 0 {
        Some(Duration::from_millis(vacuum_interval_ms))
    } else {
        None
    };
    let total_secs = baseline_secs + overlap_secs + cooldown_secs;

    store
        .reset(&pool)
        .await
        .expect("Failed to reset queue storage benchmark store");

    let seeded = Arc::new(AtomicU64::new(0));
    let completed = Arc::new(AtomicU64::new(0));
    let claim_latencies_ms = Arc::new(Mutex::new(Vec::new()));
    let maintenance_counters = Arc::new(MaintenanceCounters::default());

    let (producer_tx, producer_rx) = tokio::sync::watch::channel(false);
    let (consumer_tx, consumer_rx) = tokio::sync::watch::channel(false);
    let (reader_tx, reader_rx) = tokio::sync::watch::channel(false);
    let (maintenance_tx, maintenance_rx) = tokio::sync::watch::channel(false);

    let producer_handle = tokio::spawn(producer_loop(
        pool.clone(),
        store.clone(),
        queue.clone(),
        priority,
        producer_rate,
        Duration::from_millis(producer_tick_ms),
        seeded.clone(),
        producer_rx,
    ));

    let consumer_handle = tokio::spawn(consumer_loop(
        pool.clone(),
        store.clone(),
        queue.clone(),
        claim_batch_size,
        claim_latencies_ms.clone(),
        completed.clone(),
        consumer_rx,
    ));

    let maintenance_handle = tokio::spawn(maintenance_loop(
        pool.clone(),
        store.clone(),
        Duration::from_millis(queue_rotate_interval_ms),
        Duration::from_millis(lease_rotate_interval_ms),
        vacuum_interval,
        maintenance_counters.clone(),
        maintenance_rx,
    ));

    let initial = sample_snapshot(&pool, &store, &queue).await;
    let db_profile_start = capture_db_profile(&pool).await;
    let mut samples = Vec::with_capacity(total_secs as usize);
    let mut overlap_handles = Vec::new();
    let benchmark_started = Instant::now();
    let mut previous_completed = 0_u64;
    let mut readers_started = false;

    for second in 1..=total_secs {
        if !readers_started && second == baseline_secs + 1 {
            readers_started = true;
            for index in 0..overlap_readers {
                overlap_handles.push(tokio::spawn(overlap_reader(
                    pool.clone(),
                    store.schema().to_string(),
                    queue.clone(),
                    Duration::from_secs(overlap_stagger_secs * index as u64),
                    Duration::from_secs(overlap_hold_secs),
                    reader_mode.clone(),
                    reader_rx.clone(),
                )));
            }
        }

        tokio::time::sleep(Duration::from_secs(1)).await;
        let snapshot = sample_snapshot(&pool, &store, &queue).await;
        let completed_total = completed.load(Ordering::Relaxed);
        let completed_delta = completed_total.saturating_sub(previous_completed);
        previous_completed = completed_total;

        let sample = QueueStorageSample {
            second,
            seeded_total: seeded.load(Ordering::Relaxed),
            completed_total,
            completed_delta,
            available: snapshot.available,
            running: snapshot.running,
            completed: snapshot.completed,
            queue_lanes_dead_tup: snapshot.queue_lanes_dead_tup,
            ready_dead_tup: snapshot.ready_dead_tup,
            done_dead_tup: snapshot.done_dead_tup,
            leases_dead_tup: snapshot.leases_dead_tup,
            attempt_state_dead_tup: snapshot.attempt_state_dead_tup,
            queue_prune_ok: maintenance_counters.queue_prune_ok.load(Ordering::Relaxed),
            queue_prune_blocked: maintenance_counters
                .queue_prune_blocked
                .load(Ordering::Relaxed),
            queue_prune_skipped_active: maintenance_counters
                .queue_prune_skipped_active
                .load(Ordering::Relaxed),
            lease_prune_ok: maintenance_counters.lease_prune_ok.load(Ordering::Relaxed),
            lease_prune_blocked: maintenance_counters
                .lease_prune_blocked
                .load(Ordering::Relaxed),
            lease_prune_skipped_active: maintenance_counters
                .lease_prune_skipped_active
                .load(Ordering::Relaxed),
        };

        println!(
            "[queue storage] second={:>2} seeded={} completed={} (+{}) available={} running={} dead(q_lanes/ready/done/leases/attempt)={}/{}/{}/{}/{} queue_prune_ok={} queue_prune_blocked={} lease_prune_ok={} lease_prune_blocked={}",
            sample.second,
            sample.seeded_total,
            sample.completed_total,
            sample.completed_delta,
            sample.available,
            sample.running,
            sample.queue_lanes_dead_tup,
            sample.ready_dead_tup,
            sample.done_dead_tup,
            sample.leases_dead_tup,
            sample.attempt_state_dead_tup,
            sample.queue_prune_ok,
            sample.queue_prune_blocked,
            sample.lease_prune_ok,
            sample.lease_prune_blocked,
        );

        samples.push(sample);
    }

    let _ = producer_tx.send(true);
    producer_handle
        .await
        .expect("Vacuum-aware producer task failed");

    tokio::time::sleep(Duration::from_millis(250)).await;
    let _ = consumer_tx.send(true);
    let _ = maintenance_tx.send(true);
    let _ = reader_tx.send(true);

    consumer_handle
        .await
        .expect("Vacuum-aware consumer task failed");
    maintenance_handle
        .await
        .expect("Vacuum-aware maintenance task failed");
    for handle in overlap_handles {
        handle.await.expect("Vacuum-aware overlap reader failed");
    }

    let final_snapshot = sample_snapshot(&pool, &store, &queue).await;
    let final_exact_dead = sample_exact_dead_tuples(&pool, &store).await;
    let elapsed = benchmark_started.elapsed();
    let baseline_window = &samples[..baseline_secs as usize];
    let overlap_end = (baseline_secs + overlap_secs) as usize;
    let overlap_window = &samples[baseline_secs as usize..overlap_end];
    let cooldown_window = &samples[overlap_end..];

    let baseline_rate = average_completed_rate(baseline_window);
    let overlap_rate = average_completed_rate(overlap_window);
    let cooldown_rate = average_completed_rate(cooldown_window);

    let max_total_dead_tup = samples
        .iter()
        .map(|sample| {
            sample.queue_lanes_dead_tup
                + sample.ready_dead_tup
                + sample.done_dead_tup
                + sample.leases_dead_tup
                + sample.attempt_state_dead_tup
        })
        .max()
        .unwrap_or(0);
    let final_total_dead_tup = final_snapshot.queue_lanes_dead_tup
        + final_snapshot.ready_dead_tup
        + final_snapshot.done_dead_tup
        + final_snapshot.leases_dead_tup
        + final_snapshot.attempt_state_dead_tup;

    let claim_latencies = claim_latencies_ms
        .lock()
        .expect("claim latency lock poisoned")
        .clone();
    let p50 = percentile(&claim_latencies, 0.50);
    let p95 = percentile(&claim_latencies, 0.95);
    let p99 = percentile(&claim_latencies, 0.99);

    println!(
        "[queue storage] baseline={baseline_rate:.0}/s overlap={overlap_rate:.0}/s cooldown={cooldown_rate:.0}/s max_dead={} final_dead={} queue_prune_ok={} queue_prune_blocked={} queue_rotate_ok={} queue_rotate_skipped_busy={} lease_prune_ok={} lease_prune_blocked={} lease_rotate_ok={} lease_rotate_skipped_busy={}",
        max_total_dead_tup,
        final_total_dead_tup,
        maintenance_counters.queue_prune_ok.load(Ordering::Relaxed),
        maintenance_counters.queue_prune_blocked.load(Ordering::Relaxed),
        maintenance_counters.queue_rotate_ok.load(Ordering::Relaxed),
        maintenance_counters
            .queue_rotate_skipped_busy
            .load(Ordering::Relaxed),
        maintenance_counters.lease_prune_ok.load(Ordering::Relaxed),
        maintenance_counters
            .lease_prune_blocked
            .load(Ordering::Relaxed),
        maintenance_counters.lease_rotate_ok.load(Ordering::Relaxed),
        maintenance_counters
            .lease_rotate_skipped_busy
            .load(Ordering::Relaxed),
    );
    println!(
        "[queue storage] claim_latency_ms p50={:.3} p95={:.3} p99={:.3}",
        p50.unwrap_or(0.0),
        p95.unwrap_or(0.0),
        p99.unwrap_or(0.0),
    );
    if let Some(exact) = final_exact_dead {
        println!(
            "[queue storage] exact_dead_tuples queue_lanes={} ready={} done={} leases={} attempt_state={} total={}",
            exact.queue_lanes,
            exact.ready,
            exact.done,
            exact.leases,
            exact.attempt_state,
            exact.queue_lanes + exact.ready + exact.done + exact.leases + exact.attempt_state,
        );
    } else {
        println!("[queue storage] exact_dead_tuples unavailable");
    }

    let mut outcomes = HashMap::new();
    outcomes.insert("completed".to_string(), final_snapshot.completed as u64);
    outcomes.insert("available".to_string(), final_snapshot.available as u64);
    outcomes.insert("running".to_string(), final_snapshot.running as u64);

    let mut metadata = serde_json::json!({
        "profile": "queue_storage_storage",
        "queue": queue,
        "priority": priority,
        "queue_slot_count": store.queue_slot_count(),
        "lease_slot_count": store.lease_slot_count(),
        "producer_rate_per_s": producer_rate,
        "claim_batch_size": claim_batch_size,
        "baseline_secs": baseline_secs,
        "overlap_secs": overlap_secs,
        "cooldown_secs": cooldown_secs,
        "overlap_readers": overlap_readers,
        "overlap_hold_secs": overlap_hold_secs,
        "overlap_stagger_secs": overlap_stagger_secs,
        "reader_mode": reader_mode,
        "queue_rotate_interval_ms": queue_rotate_interval_ms,
        "lease_rotate_interval_ms": lease_rotate_interval_ms,
        "vacuum_leases": vacuum_interval.is_some(),
        "vacuum_interval_ms": vacuum_interval.map(|d| d.as_millis() as u64),
        "baseline_completed_per_s": baseline_rate,
        "overlap_completed_per_s": overlap_rate,
        "cooldown_completed_per_s": cooldown_rate,
        "initial_total_dead_tup": initial.queue_lanes_dead_tup + initial.ready_dead_tup + initial.done_dead_tup + initial.leases_dead_tup + initial.attempt_state_dead_tup,
        "max_total_dead_tup": max_total_dead_tup,
        "final_total_dead_tup": final_total_dead_tup,
        "final_queue_lanes_dead_tup": final_snapshot.queue_lanes_dead_tup,
        "final_ready_dead_tup": final_snapshot.ready_dead_tup,
        "final_done_dead_tup": final_snapshot.done_dead_tup,
        "final_leases_dead_tup": final_snapshot.leases_dead_tup,
        "final_attempt_state_dead_tup": final_snapshot.attempt_state_dead_tup,
        "exact_final_dead_tuples": final_exact_dead,
        "queue_prune_ok": maintenance_counters.queue_prune_ok.load(Ordering::Relaxed),
        "queue_prune_blocked": maintenance_counters.queue_prune_blocked.load(Ordering::Relaxed),
        "queue_prune_skipped_active": maintenance_counters.queue_prune_skipped_active.load(Ordering::Relaxed),
        "queue_rotate_ok": maintenance_counters.queue_rotate_ok.load(Ordering::Relaxed),
        "queue_rotate_skipped_busy": maintenance_counters.queue_rotate_skipped_busy.load(Ordering::Relaxed),
        "lease_prune_ok": maintenance_counters.lease_prune_ok.load(Ordering::Relaxed),
        "lease_prune_blocked": maintenance_counters.lease_prune_blocked.load(Ordering::Relaxed),
        "lease_prune_skipped_active": maintenance_counters.lease_prune_skipped_active.load(Ordering::Relaxed),
        "lease_rotate_ok": maintenance_counters.lease_rotate_ok.load(Ordering::Relaxed),
        "lease_rotate_skipped_busy": maintenance_counters.lease_rotate_skipped_busy.load(Ordering::Relaxed),
        "samples": samples,
    });
    if let Some(start) = db_profile_start.as_ref() {
        if let Some(db_profile) = capture_db_profile_delta(&pool, start).await {
            let completed = completed.load(Ordering::Relaxed).max(1);
            if let Some(wal_bytes) = db_profile
                .get("wal_bytes")
                .and_then(serde_json::Value::as_i64)
            {
                metadata
                    .as_object_mut()
                    .expect("benchmark metadata should be an object")
                    .insert(
                        "wal_bytes_per_completed_job".to_string(),
                        serde_json::json!(wal_bytes as f64 / completed as f64),
                    );
            }
            metadata
                .as_object_mut()
                .expect("benchmark metadata should be an object")
                .insert("db_profile".to_string(), db_profile);
        }
    }

    BenchmarkResult {
        schema_version: SCHEMA_VERSION,
        scenario: format!("queue_storage_{}", reader_mode),
        language: "rust".to_string(),
        seeded: seeded.load(Ordering::Relaxed),
        metrics: BenchMetrics {
            throughput: Some(BenchThroughput {
                handler_per_s: overlap_rate,
                db_finalized_per_s: overlap_rate,
            }),
            enqueue_per_s: Some(producer_rate as f64),
            drain_time_s: Some(elapsed.as_secs_f64()),
            latency_ms: Some(BenchLatency { p50, p95, p99 }),
            rescue: None,
        },
        outcomes,
        metadata: Some(metadata),
    }
    .emit();
}

#[tokio::test(flavor = "multi_thread", worker_threads = 8)]
#[ignore]
async fn test_queue_storage_deep_backlog_drain_benchmark() {
    let total_jobs = env_u64("AWA_QS_DEEP_BACKLOG_JOBS", 100_000);
    let duration_secs = env_u64("AWA_QS_DEEP_BACKLOG_SECONDS", 60);
    let copy_chunk_size = env_u64("AWA_QS_DEEP_BACKLOG_COPY_BATCH", 1_000) as usize;
    let consumers = env_u32("AWA_QS_DEEP_BACKLOG_CONSUMERS", 8);
    let claim_batch_size = env_u64("AWA_QS_DEEP_BACKLOG_CLAIM_BATCH_SIZE", 512) as i64;
    let enqueue_shards = env_u32("AWA_QS_DEEP_BACKLOG_SHARDS", 16);
    let queue_slot_count = env_u32("AWA_QS_DEEP_BACKLOG_QUEUE_SLOT_COUNT", 16);
    let lease_slot_count = env_u32("AWA_QS_DEEP_BACKLOG_LEASE_SLOT_COUNT", 8);
    let schema = env_string("AWA_QS_DEEP_BACKLOG_SCHEMA", "awa_qs_deep_backlog");
    let queue = env_string("AWA_QS_DEEP_BACKLOG_QUEUE", "qs_deep_backlog");
    let priority = env_u32("AWA_QS_DEEP_BACKLOG_PRIORITY", 2) as i16;
    let analyze_ready = env_u32("AWA_QS_DEEP_BACKLOG_ANALYZE", 1) != 0;
    let max_conns = env_u32("AWA_QS_DEEP_BACKLOG_POOL", consumers + 8);

    assert!(total_jobs > 0, "AWA_QS_DEEP_BACKLOG_JOBS must be > 0");
    assert!(duration_secs > 0, "AWA_QS_DEEP_BACKLOG_SECONDS must be > 0");
    assert!(consumers > 0, "AWA_QS_DEEP_BACKLOG_CONSUMERS must be > 0");
    assert!(
        claim_batch_size > 0,
        "AWA_QS_DEEP_BACKLOG_CLAIM_BATCH_SIZE must be > 0"
    );
    assert!(
        (1..=64).contains(&enqueue_shards),
        "AWA_QS_DEEP_BACKLOG_SHARDS must be between 1 and 64"
    );
    let enqueue_shards = enqueue_shards as i16;

    let pool = pool_with(max_conns).await;
    ensure_pgstattuple(&pool).await;
    let store = Arc::new(
        QueueStorage::new(QueueStorageConfig {
            schema,
            queue_slot_count: queue_slot_count as usize,
            lease_slot_count: lease_slot_count as usize,
            // This benchmark measures the ready-claim path under depth
            // using `claim_batch` -> `complete_batch` directly. Keep the
            // legacy lease-row completion path so completion bookkeeping
            // does not short-circuit the harness.
            lease_claim_receipts: false,
            ..Default::default()
        })
        .expect("Failed to construct deep-backlog queue storage store"),
    );

    recreate_store_schema(&pool, &store).await;
    store
        .install(&pool)
        .await
        .expect("Failed to install deep-backlog queue storage store");
    store
        .reset(&pool)
        .await
        .expect("Failed to reset deep-backlog queue storage store");
    upsert_enqueue_shards(&pool, &queue, enqueue_shards).await;

    let seed_started = Instant::now();
    let inserted =
        seed_deep_backlog_copy(&pool, &store, &queue, priority, total_jobs, copy_chunk_size).await;
    let seed_elapsed = seed_started.elapsed();
    let seed_rate = inserted as f64 / seed_elapsed.as_secs_f64().max(0.001);

    if analyze_ready {
        sqlx::query(&format!("ANALYZE {}.ready_entries", store.schema()))
            .execute(&pool)
            .await
            .expect("Failed to analyze ready_entries after deep-backlog seed");
    }

    println!(
        "[queue storage deep backlog] seeded={} copy_batch={} enqueue_shards={} seed_elapsed={:.3}s seed_rate={:.0}/s analyze_ready={}",
        inserted,
        copy_chunk_size,
        enqueue_shards,
        seed_elapsed.as_secs_f64(),
        seed_rate,
        analyze_ready,
    );

    let initial = sample_snapshot(&pool, &store, &queue).await;
    let db_profile_start = capture_db_profile(&pool).await;
    let completed = Arc::new(AtomicU64::new(0));
    let claim_latencies_ms = Arc::new(Mutex::new(Vec::new()));
    let (consumer_tx, consumer_rx) = tokio::sync::watch::channel(false);
    let mut consumer_handles = Vec::new();

    for _ in 0..consumers {
        consumer_handles.push(tokio::spawn(consumer_loop(
            pool.clone(),
            store.clone(),
            queue.clone(),
            claim_batch_size,
            claim_latencies_ms.clone(),
            completed.clone(),
            consumer_rx.clone(),
        )));
    }

    let drain_started = Instant::now();
    let mut samples = Vec::with_capacity(duration_secs as usize);
    let mut previous_completed = 0_u64;
    for second in 1..=duration_secs {
        tokio::time::sleep(Duration::from_secs(1)).await;

        let snapshot = sample_snapshot(&pool, &store, &queue).await;
        let completed_total = completed.load(Ordering::Relaxed);
        let completed_delta = completed_total.saturating_sub(previous_completed);
        previous_completed = completed_total;

        let sample = QueueStorageSample {
            second,
            seeded_total: inserted,
            completed_total,
            completed_delta,
            available: snapshot.available,
            running: snapshot.running,
            completed: snapshot.completed,
            queue_lanes_dead_tup: snapshot.queue_lanes_dead_tup,
            ready_dead_tup: snapshot.ready_dead_tup,
            done_dead_tup: snapshot.done_dead_tup,
            leases_dead_tup: snapshot.leases_dead_tup,
            attempt_state_dead_tup: snapshot.attempt_state_dead_tup,
            queue_prune_ok: 0,
            queue_prune_blocked: 0,
            queue_prune_skipped_active: 0,
            lease_prune_ok: 0,
            lease_prune_blocked: 0,
            lease_prune_skipped_active: 0,
        };

        println!(
            "[queue storage deep backlog] second={:>3} completed={} (+{}) available={} running={} claim_samples={}",
            sample.second,
            sample.completed_total,
            sample.completed_delta,
            sample.available,
            sample.running,
            claim_latencies_ms
                .lock()
                .expect("claim latency lock poisoned")
                .len(),
        );

        samples.push(sample);
        if completed_total >= inserted {
            break;
        }
    }

    let _ = consumer_tx.send(true);
    for handle in consumer_handles {
        handle.await.expect("Deep-backlog consumer task failed");
    }

    let drain_elapsed = drain_started.elapsed();
    let final_snapshot = sample_snapshot(&pool, &store, &queue).await;
    let final_exact_dead = sample_exact_dead_tuples(&pool, &store).await;
    let completed_total = completed.load(Ordering::Relaxed);
    let observed_completed_per_s = average_completed_rate(&samples);
    let elapsed_completed_per_s = completed_total as f64 / drain_elapsed.as_secs_f64().max(0.001);
    let claim_latencies = claim_latencies_ms
        .lock()
        .expect("claim latency lock poisoned")
        .clone();
    let p50 = percentile(&claim_latencies, 0.50);
    let p95 = percentile(&claim_latencies, 0.95);
    let p99 = percentile(&claim_latencies, 0.99);

    println!(
        "[queue storage deep backlog] completed={} observed_rate={:.0}/s elapsed_rate={:.0}/s final_available={} final_running={} claim_latency_ms p50={:.3} p95={:.3} p99={:.3}",
        completed_total,
        observed_completed_per_s,
        elapsed_completed_per_s,
        final_snapshot.available,
        final_snapshot.running,
        p50.unwrap_or(0.0),
        p95.unwrap_or(0.0),
        p99.unwrap_or(0.0),
    );
    if let Some(exact) = final_exact_dead {
        println!(
            "[queue storage deep backlog] exact_dead_tuples queue_lanes={} ready={} done={} leases={} attempt_state={} total={}",
            exact.queue_lanes,
            exact.ready,
            exact.done,
            exact.leases,
            exact.attempt_state,
            exact.queue_lanes + exact.ready + exact.done + exact.leases + exact.attempt_state,
        );
    }

    let mut outcomes = HashMap::new();
    outcomes.insert("completed".to_string(), completed_total);
    outcomes.insert("available".to_string(), final_snapshot.available as u64);
    outcomes.insert("running".to_string(), final_snapshot.running as u64);

    let mut metadata = serde_json::json!({
        "profile": "queue_storage_deep_backlog_drain",
        "queue": queue,
        "priority": priority,
        "queue_slot_count": store.queue_slot_count(),
        "lease_slot_count": store.lease_slot_count(),
        "claim_slot_count": store.claim_slot_count(),
        "lease_claim_receipts": false,
        "copy_chunk_size": copy_chunk_size,
        "seed_elapsed_s": seed_elapsed.as_secs_f64(),
        "seed_enqueue_per_s": seed_rate,
        "consumers": consumers,
        "claim_batch_size": claim_batch_size,
        "enqueue_shards": enqueue_shards,
        "duration_secs": duration_secs,
        "observed_completed_per_s": observed_completed_per_s,
        "elapsed_completed_per_s": elapsed_completed_per_s,
        "initial_available": initial.available,
        "initial_running": initial.running,
        "initial_completed": initial.completed,
        "final_available": final_snapshot.available,
        "final_running": final_snapshot.running,
        "final_completed": final_snapshot.completed,
        "final_ready_dead_tup": final_snapshot.ready_dead_tup,
        "final_done_dead_tup": final_snapshot.done_dead_tup,
        "final_leases_dead_tup": final_snapshot.leases_dead_tup,
        "exact_final_dead_tuples": final_exact_dead,
        "samples": samples,
    });
    if let Some(start) = db_profile_start.as_ref() {
        if let Some(db_profile) = capture_db_profile_delta(&pool, start).await {
            metadata
                .as_object_mut()
                .expect("benchmark metadata should be an object")
                .insert("db_profile".to_string(), db_profile);
        }
    }

    BenchmarkResult {
        schema_version: SCHEMA_VERSION,
        scenario: "queue_storage_deep_backlog_drain".to_string(),
        language: "rust".to_string(),
        seeded: inserted,
        metrics: BenchMetrics {
            throughput: Some(BenchThroughput {
                handler_per_s: observed_completed_per_s,
                db_finalized_per_s: observed_completed_per_s,
            }),
            enqueue_per_s: Some(seed_rate),
            drain_time_s: Some(drain_elapsed.as_secs_f64()),
            latency_ms: Some(BenchLatency { p50, p95, p99 }),
            rescue: None,
        },
        outcomes,
        metadata: Some(metadata),
    }
    .emit();
}

#[allow(dead_code)]
fn _assert_send_sync() {
    fn assert_send_sync<T: Send + Sync>() {}
    assert_send_sync::<QueueStorage>();
    assert_send_sync::<AwaError>();
}