enact-core 0.0.2

Core agent runtime for Enact - Graph-Native AI agents
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
//! Enforcement - Kernel-owned limits, quotas, and rate limiting
//!
//! This module provides the enforcement layer that ensures executions
//! respect their resource boundaries. All limit enforcement happens
//! in the kernel, not in providers.
//!
//! ## Design Principles
//!
//! 1. **Kernel Owns Enforcement**: Providers are dumb adapters
//! 2. **Hard Limits**: Quota exceeded = execution halts immediately
//! 3. **Deterministic**: Same limits → same enforcement behavior
//! 4. **Observable**: All enforcement decisions are logged/events
//!
//! ## Key Components
//!
//! - `UsageTracker`: Tracks resource consumption per execution
//! - `EnforcementPolicy`: Defines limits and enforcement rules
//! - `EnforcementResult`: Outcome of limit checks
//!
//! @see docs/feat-03-limits-quotas.md

use super::error::{ExecutionError, ExecutionErrorCategory};
use super::ids::{ExecutionId, StepId, TenantId};
use crate::context::ResourceLimits;
use serde::{Deserialize, Serialize};
use std::collections::HashMap;
use std::sync::atomic::{AtomicU32, AtomicU64, Ordering};
use std::sync::Arc;
use std::time::{Duration, Instant};
use tokio::sync::RwLock;

// =============================================================================
// Usage Tracking
// =============================================================================

/// Tracks resource usage for a single execution
#[derive(Debug)]
pub struct ExecutionUsage {
    /// Execution ID
    pub execution_id: ExecutionId,
    /// Tenant ID
    pub tenant_id: TenantId,
    /// Number of steps executed
    pub steps: AtomicU32,
    /// Total input tokens consumed
    pub input_tokens: AtomicU32,
    /// Total output tokens consumed
    pub output_tokens: AtomicU32,
    /// Wall clock start time
    pub started_at: Instant,
    /// Last activity timestamp
    pub last_activity: RwLock<Instant>,
    // === Long-running execution tracking ===
    /// Number of dynamically discovered steps (StepSource::Discovered)
    pub discovered_steps: AtomicU32,
    /// Current discovery chain depth (how deep in the discovery tree)
    pub discovery_depth: AtomicU32,
    /// Maximum discovery depth reached during execution
    pub max_discovery_depth_reached: AtomicU32,
    /// Cumulative cost in cents (USD * 100 for integer precision)
    pub cost_cents: AtomicU64,
}

impl ExecutionUsage {
    /// Create a new usage tracker for an execution
    pub fn new(execution_id: ExecutionId, tenant_id: TenantId) -> Self {
        let now = Instant::now();
        Self {
            execution_id,
            tenant_id,
            steps: AtomicU32::new(0),
            input_tokens: AtomicU32::new(0),
            output_tokens: AtomicU32::new(0),
            started_at: now,
            last_activity: RwLock::new(now),
            discovered_steps: AtomicU32::new(0),
            discovery_depth: AtomicU32::new(0),
            max_discovery_depth_reached: AtomicU32::new(0),
            cost_cents: AtomicU64::new(0),
        }
    }

    /// Record step execution
    pub fn record_step(&self) {
        self.steps.fetch_add(1, Ordering::SeqCst);
    }

    /// Record a discovered step (dynamically added to DAG)
    pub fn record_discovered_step(&self) {
        self.discovered_steps.fetch_add(1, Ordering::SeqCst);
    }

    /// Record token usage
    pub fn record_tokens(&self, input: u32, output: u32) {
        self.input_tokens.fetch_add(input, Ordering::SeqCst);
        self.output_tokens.fetch_add(output, Ordering::SeqCst);
    }

    /// Record cost in USD (converted to cents for storage)
    pub fn record_cost_usd(&self, cost_usd: f64) {
        let cents = (cost_usd * 100.0) as u64;
        self.cost_cents.fetch_add(cents, Ordering::SeqCst);
    }

    /// Push discovery depth (entering a discovered step)
    pub fn push_discovery_depth(&self) {
        let new_depth = self.discovery_depth.fetch_add(1, Ordering::SeqCst) + 1;
        // Update max if this is deeper than before
        let current_max = self.max_discovery_depth_reached.load(Ordering::SeqCst);
        if new_depth > current_max {
            self.max_discovery_depth_reached
                .store(new_depth, Ordering::SeqCst);
        }
    }

    /// Pop discovery depth (exiting a discovered step)
    pub fn pop_discovery_depth(&self) {
        self.discovery_depth.fetch_sub(1, Ordering::SeqCst);
    }

    /// Update last activity timestamp
    pub async fn touch(&self) {
        let mut last = self.last_activity.write().await;
        *last = Instant::now();
    }

    /// Get current step count
    pub fn step_count(&self) -> u32 {
        self.steps.load(Ordering::SeqCst)
    }

    /// Get discovered step count
    pub fn discovered_step_count(&self) -> u32 {
        self.discovered_steps.load(Ordering::SeqCst)
    }

    /// Get current discovery depth
    pub fn current_discovery_depth(&self) -> u32 {
        self.discovery_depth.load(Ordering::SeqCst)
    }

    /// Get total token count
    pub fn total_tokens(&self) -> u32 {
        self.input_tokens.load(Ordering::SeqCst) + self.output_tokens.load(Ordering::SeqCst)
    }

    /// Get cumulative cost in USD
    pub fn cost_usd(&self) -> f64 {
        self.cost_cents.load(Ordering::SeqCst) as f64 / 100.0
    }

    /// Get wall clock duration
    pub fn wall_time(&self) -> Duration {
        self.started_at.elapsed()
    }

    /// Get wall time in milliseconds
    pub fn wall_time_ms(&self) -> u64 {
        self.wall_time().as_millis() as u64
    }

    /// Get idle duration (time since last activity)
    pub async fn idle_duration(&self) -> Duration {
        let last = self.last_activity.read().await;
        last.elapsed()
    }

    /// Get idle duration in seconds
    pub async fn idle_seconds(&self) -> u64 {
        self.idle_duration().await.as_secs()
    }
}

/// Serializable snapshot of execution usage
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct UsageSnapshot {
    pub execution_id: String,
    pub tenant_id: String,
    pub steps: u32,
    pub input_tokens: u32,
    pub output_tokens: u32,
    pub total_tokens: u32,
    pub wall_time_ms: u64,
    // Long-running execution metrics
    pub discovered_steps: u32,
    pub discovery_depth: u32,
    pub max_discovery_depth: u32,
    pub cost_usd: f64,
}

impl From<&ExecutionUsage> for UsageSnapshot {
    fn from(usage: &ExecutionUsage) -> Self {
        let input = usage.input_tokens.load(Ordering::SeqCst);
        let output = usage.output_tokens.load(Ordering::SeqCst);
        Self {
            execution_id: usage.execution_id.as_str().to_string(),
            tenant_id: usage.tenant_id.as_str().to_string(),
            steps: usage.steps.load(Ordering::SeqCst),
            input_tokens: input,
            output_tokens: output,
            total_tokens: input + output,
            wall_time_ms: usage.wall_time_ms(),
            discovered_steps: usage.discovered_steps.load(Ordering::SeqCst),
            discovery_depth: usage.discovery_depth.load(Ordering::SeqCst),
            max_discovery_depth: usage.max_discovery_depth_reached.load(Ordering::SeqCst),
            cost_usd: usage.cost_usd(),
        }
    }
}

// =============================================================================
// Enforcement Results
// =============================================================================

/// Result of an enforcement check
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum EnforcementResult {
    /// Operation is allowed to proceed
    Allowed,
    /// Operation is blocked due to limit exceeded
    Blocked(EnforcementViolation),
    /// Operation is allowed but near limit (warning)
    Warning(EnforcementWarning),
}

impl EnforcementResult {
    /// Check if the result allows the operation
    pub fn is_allowed(&self) -> bool {
        matches!(self, Self::Allowed | Self::Warning(_))
    }

    /// Check if the result blocks the operation
    pub fn is_blocked(&self) -> bool {
        matches!(self, Self::Blocked(_))
    }

    /// Convert to an ExecutionError if blocked
    pub fn to_error(&self) -> Option<ExecutionError> {
        match self {
            Self::Blocked(violation) => Some(violation.to_error()),
            _ => None,
        }
    }
}

/// Type of enforcement violation
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
pub enum ViolationType {
    /// Maximum steps exceeded
    StepLimit,
    /// Maximum tokens exceeded
    TokenLimit,
    /// Wall clock timeout exceeded
    WallTimeLimit,
    /// Memory limit exceeded
    MemoryLimit,
    /// Concurrent execution limit exceeded
    ConcurrencyLimit,
    /// Rate limit exceeded
    RateLimit,
    /// Network access denied in air-gapped mode
    NetworkViolation,
    // === Long-running execution controls ===
    /// Maximum discovered steps exceeded (agentic DAG)
    DiscoveredStepLimit,
    /// Discovery chain depth exceeded (prevents infinite discovery)
    DiscoveryDepthLimit,
    /// Cost threshold exceeded (USD-based alerting)
    CostThreshold,
    /// No activity for too long (idle timeout)
    IdleTimeout,
    /// Agent repeating same methodology (semantic loop)
    SameStepLoop,
}

impl std::fmt::Display for ViolationType {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        match self {
            Self::StepLimit => write!(f, "step_limit"),
            Self::TokenLimit => write!(f, "token_limit"),
            Self::WallTimeLimit => write!(f, "wall_time_limit"),
            Self::MemoryLimit => write!(f, "memory_limit"),
            Self::ConcurrencyLimit => write!(f, "concurrency_limit"),
            Self::RateLimit => write!(f, "rate_limit"),
            Self::NetworkViolation => write!(f, "network_violation"),
            Self::DiscoveredStepLimit => write!(f, "discovered_step_limit"),
            Self::DiscoveryDepthLimit => write!(f, "discovery_depth_limit"),
            Self::CostThreshold => write!(f, "cost_threshold"),
            Self::IdleTimeout => write!(f, "idle_timeout"),
            Self::SameStepLoop => write!(f, "same_step_loop"),
        }
    }
}

/// Details of an enforcement violation
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
pub struct EnforcementViolation {
    /// Type of violation
    pub violation_type: ViolationType,
    /// Current value
    pub current: u64,
    /// Limit value
    pub limit: u64,
    /// Human-readable message
    pub message: String,
}

impl EnforcementViolation {
    /// Create a new violation
    pub fn new(violation_type: ViolationType, current: u64, limit: u64) -> Self {
        let message = format!(
            "{} exceeded: {} / {} ({}%)",
            violation_type,
            current,
            limit,
            (current as f64 / limit as f64 * 100.0) as u32
        );
        Self {
            violation_type,
            current,
            limit,
            message,
        }
    }

    /// Convert to an ExecutionError
    pub fn to_error(&self) -> ExecutionError {
        let category = match self.violation_type {
            ViolationType::WallTimeLimit => ExecutionErrorCategory::Timeout,
            ViolationType::RateLimit => ExecutionErrorCategory::LlmError, // Rate limits are retryable
            ViolationType::NetworkViolation => ExecutionErrorCategory::PolicyViolation, // Non-retryable policy
            _ => ExecutionErrorCategory::QuotaExceeded,
        };

        ExecutionError::new(category, self.message.clone())
            .with_code(self.violation_type.to_string())
            .with_details(serde_json::json!({
                "current": self.current,
                "limit": self.limit,
                "violation_type": self.violation_type.to_string(),
            }))
    }
}

/// Warning about approaching limits
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
pub struct EnforcementWarning {
    /// Type of limit being approached
    pub warning_type: ViolationType,
    /// Current usage percentage (0-100)
    pub usage_percent: u32,
    /// Human-readable message
    pub message: String,
}

impl EnforcementWarning {
    /// Create a new warning
    pub fn new(warning_type: ViolationType, current: u64, limit: u64) -> Self {
        let percent = (current as f64 / limit as f64 * 100.0) as u32;
        let message = format!("{} at {}%: {} / {}", warning_type, percent, current, limit);
        Self {
            warning_type,
            usage_percent: percent,
            message,
        }
    }
}

// =============================================================================
// Enforcement Policy
// =============================================================================

/// Configuration for enforcement behavior
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct EnforcementPolicy {
    /// Warning threshold (percentage of limit, 0-100)
    pub warning_threshold: u32,
    /// Whether to emit events on warnings
    pub emit_warning_events: bool,
    /// Whether to emit events on blocks
    pub emit_block_events: bool,
    /// Grace period for timeouts (milliseconds)
    pub timeout_grace_ms: u64,
}

impl Default for EnforcementPolicy {
    fn default() -> Self {
        Self {
            warning_threshold: 80, // Warn at 80% usage
            emit_warning_events: true,
            emit_block_events: true,
            timeout_grace_ms: 1000, // 1 second grace period
        }
    }
}

// =============================================================================
// Long-Running Execution Policy
// =============================================================================

/// Policy configuration for long-running agentic executions
///
/// These controls prevent runaway costs, infinite discovery loops, and idle
/// executions from consuming resources in the Agentic DAG model.
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct LongRunningExecutionPolicy {
    /// Maximum number of dynamically discovered steps before intervention
    /// (Steps with StepSource::Discovered)
    pub max_discovered_steps: Option<u32>,
    /// Maximum depth of discovery chains (prevents infinite discovery)
    /// e.g., agent discovers step A, which discovers step B, which discovers C...
    pub max_discovery_depth: Option<u32>,
    /// Alert threshold for cumulative cost in USD
    /// When exceeded, execution pauses for approval
    pub cost_alert_threshold_usd: Option<f64>,
    /// Maximum time without activity before idle timeout (seconds)
    pub idle_timeout_seconds: Option<u64>,
    /// Maximum repetitions of same methodology before loop detection (default: 3)
    pub max_same_step_repetitions: Option<u32>,
}

impl Default for LongRunningExecutionPolicy {
    fn default() -> Self {
        Self::standard()
    }
}

impl LongRunningExecutionPolicy {
    /// Standard preset - balanced limits for typical long-running executions
    /// - Max duration: ~30 minutes (via idle timeout)
    /// - Discovered steps: 50
    /// - Discovery depth: 5
    /// - Cost alert: $5.00 USD
    pub fn standard() -> Self {
        Self {
            max_discovered_steps: Some(50),
            max_discovery_depth: Some(5),
            cost_alert_threshold_usd: Some(5.0),
            idle_timeout_seconds: Some(1800), // 30 minutes
            max_same_step_repetitions: Some(3),
        }
    }

    /// Extended preset - higher limits for complex, supervised workflows
    /// - Max duration: ~4 hours
    /// - Discovered steps: 300
    /// - Discovery depth: 10
    /// - Cost alert: $50.00 USD
    pub fn extended() -> Self {
        Self {
            max_discovered_steps: Some(300),
            max_discovery_depth: Some(10),
            cost_alert_threshold_usd: Some(50.0),
            idle_timeout_seconds: Some(14400), // 4 hours
            max_same_step_repetitions: Some(5),
        }
    }

    /// Unlimited preset - no discovery limits, but requires cost monitoring
    /// - No step/depth limits
    /// - Cost alert: $100.00 USD (mandatory safety net)
    /// - Idle timeout: 24 hours
    pub fn unlimited() -> Self {
        Self {
            max_discovered_steps: None,
            max_discovery_depth: None,
            cost_alert_threshold_usd: Some(100.0), // Required safety net
            idle_timeout_seconds: Some(86400),     // 24 hours
            max_same_step_repetitions: None,
        }
    }

    /// Disabled - no long-running controls (use with caution)
    pub fn disabled() -> Self {
        Self {
            max_discovered_steps: None,
            max_discovery_depth: None,
            cost_alert_threshold_usd: None,
            idle_timeout_seconds: None,
            max_same_step_repetitions: None,
        }
    }
}

// =============================================================================
// Enforcement Middleware
// =============================================================================

/// Enforcement middleware for checking limits before operations
#[derive(Debug)]
pub struct EnforcementMiddleware {
    /// Active executions and their usage
    executions: RwLock<HashMap<ExecutionId, Arc<ExecutionUsage>>>,
    /// Active execution count per tenant
    tenant_executions: RwLock<HashMap<TenantId, AtomicU32>>,
    /// Global rate limiter state
    #[allow(dead_code)]
    rate_limiter: RwLock<RateLimiterState>,
    /// Enforcement policy
    policy: EnforcementPolicy,
}

impl EnforcementMiddleware {
    /// Create a new enforcement middleware
    pub fn new() -> Self {
        Self::with_policy(EnforcementPolicy::default())
    }

    /// Create with custom policy
    pub fn with_policy(policy: EnforcementPolicy) -> Self {
        Self {
            executions: RwLock::new(HashMap::new()),
            tenant_executions: RwLock::new(HashMap::new()),
            rate_limiter: RwLock::new(RateLimiterState::new()),
            policy,
        }
    }

    /// Whether warning events should be emitted when limits are near
    pub fn emit_warning_events_enabled(&self) -> bool {
        self.policy.emit_warning_events
    }

    /// Register a new execution
    pub async fn register_execution(
        &self,
        execution_id: ExecutionId,
        tenant_id: TenantId,
    ) -> Arc<ExecutionUsage> {
        let usage = Arc::new(ExecutionUsage::new(execution_id.clone(), tenant_id.clone()));

        // Register in executions map
        {
            let mut executions = self.executions.write().await;
            executions.insert(execution_id, Arc::clone(&usage));
        }

        // Increment tenant execution count
        {
            let mut tenant_execs = self.tenant_executions.write().await;
            tenant_execs
                .entry(tenant_id)
                .or_insert_with(|| AtomicU32::new(0))
                .fetch_add(1, Ordering::SeqCst);
        }

        usage
    }

    /// Unregister an execution
    pub async fn unregister_execution(&self, execution_id: &ExecutionId) {
        let tenant_id = {
            let mut executions = self.executions.write().await;
            executions.remove(execution_id).map(|u| u.tenant_id.clone())
        };

        // Decrement tenant execution count
        if let Some(tenant_id) = tenant_id {
            let tenant_execs = self.tenant_executions.read().await;
            if let Some(count) = tenant_execs.get(&tenant_id) {
                count.fetch_sub(1, Ordering::SeqCst);
            }
        }
    }

    /// Get usage for an execution
    pub async fn get_usage(&self, execution_id: &ExecutionId) -> Option<Arc<ExecutionUsage>> {
        let executions = self.executions.read().await;
        executions.get(execution_id).cloned()
    }

    /// Get usage snapshot for an execution
    pub async fn get_usage_snapshot(&self, execution_id: &ExecutionId) -> Option<UsageSnapshot> {
        self.get_usage(execution_id)
            .await
            .map(|u| UsageSnapshot::from(u.as_ref()))
    }

    /// Check if a new step can be started
    pub async fn check_step_allowed(
        &self,
        execution_id: &ExecutionId,
        limits: &ResourceLimits,
    ) -> EnforcementResult {
        let usage = match self.get_usage(execution_id).await {
            Some(u) => u,
            None => return EnforcementResult::Allowed, // No tracking = allowed
        };

        let current = usage.step_count() as u64 + 1; // +1 for the step we're about to start
        let limit = limits.max_steps as u64;

        if current > limit {
            return EnforcementResult::Blocked(EnforcementViolation::new(
                ViolationType::StepLimit,
                current,
                limit,
            ));
        }

        let percent = (current as f64 / limit as f64 * 100.0) as u32;
        if percent >= self.policy.warning_threshold {
            return EnforcementResult::Warning(EnforcementWarning::new(
                ViolationType::StepLimit,
                current,
                limit,
            ));
        }

        EnforcementResult::Allowed
    }

    /// Check if token usage is within limits
    pub async fn check_tokens_allowed(
        &self,
        execution_id: &ExecutionId,
        limits: &ResourceLimits,
        additional_tokens: u32,
    ) -> EnforcementResult {
        let usage = match self.get_usage(execution_id).await {
            Some(u) => u,
            None => return EnforcementResult::Allowed,
        };

        let current = usage.total_tokens() as u64 + additional_tokens as u64;
        let limit = limits.max_tokens as u64;

        if current > limit {
            return EnforcementResult::Blocked(EnforcementViolation::new(
                ViolationType::TokenLimit,
                current,
                limit,
            ));
        }

        let percent = (current as f64 / limit as f64 * 100.0) as u32;
        if percent >= self.policy.warning_threshold {
            return EnforcementResult::Warning(EnforcementWarning::new(
                ViolationType::TokenLimit,
                current,
                limit,
            ));
        }

        EnforcementResult::Allowed
    }

    /// Check if wall time is within limits
    pub async fn check_wall_time_allowed(
        &self,
        execution_id: &ExecutionId,
        limits: &ResourceLimits,
    ) -> EnforcementResult {
        let usage = match self.get_usage(execution_id).await {
            Some(u) => u,
            None => return EnforcementResult::Allowed,
        };

        let current = usage.wall_time_ms();
        let limit = limits.max_wall_time_ms;

        // Add grace period
        let effective_limit = limit + self.policy.timeout_grace_ms;

        if current > effective_limit {
            return EnforcementResult::Blocked(EnforcementViolation::new(
                ViolationType::WallTimeLimit,
                current,
                limit,
            ));
        }

        let percent = (current as f64 / limit as f64 * 100.0) as u32;
        if percent >= self.policy.warning_threshold {
            return EnforcementResult::Warning(EnforcementWarning::new(
                ViolationType::WallTimeLimit,
                current,
                limit,
            ));
        }

        EnforcementResult::Allowed
    }

    /// Check if concurrent execution limit is respected
    pub async fn check_concurrency_allowed(
        &self,
        tenant_id: &TenantId,
        limits: &ResourceLimits,
    ) -> EnforcementResult {
        let max_concurrent = match limits.max_concurrent_executions {
            Some(max) => max,
            None => return EnforcementResult::Allowed, // No limit set
        };

        let current = {
            let tenant_execs = self.tenant_executions.read().await;
            tenant_execs
                .get(tenant_id)
                .map(|c| c.load(Ordering::SeqCst))
                .unwrap_or(0) as u64
        };

        let limit = max_concurrent as u64;

        if current >= limit {
            return EnforcementResult::Blocked(EnforcementViolation::new(
                ViolationType::ConcurrencyLimit,
                current + 1, // +1 for the execution we're about to start
                limit,
            ));
        }

        EnforcementResult::Allowed
    }

    /// Perform all limit checks before starting a step
    pub async fn check_all_limits(
        &self,
        execution_id: &ExecutionId,
        limits: &ResourceLimits,
    ) -> EnforcementResult {
        // Check wall time first (most likely to timeout)
        let wall_check = self.check_wall_time_allowed(execution_id, limits).await;
        if wall_check.is_blocked() {
            return wall_check;
        }

        // Check step limit
        let step_check = self.check_step_allowed(execution_id, limits).await;
        if step_check.is_blocked() {
            return step_check;
        }

        // Check token limit
        let token_check = self.check_tokens_allowed(execution_id, limits, 0).await;
        if token_check.is_blocked() {
            return token_check;
        }

        // Return warnings if any
        if let EnforcementResult::Warning(w) = wall_check {
            return EnforcementResult::Warning(w);
        }
        if let EnforcementResult::Warning(w) = step_check {
            return EnforcementResult::Warning(w);
        }
        if let EnforcementResult::Warning(w) = token_check {
            return EnforcementResult::Warning(w);
        }

        EnforcementResult::Allowed
    }

    /// Record step completion and update usage
    pub async fn record_step(&self, execution_id: &ExecutionId) {
        if let Some(usage) = self.get_usage(execution_id).await {
            usage.record_step();
            usage.touch().await;
        }
    }

    /// Record token usage
    pub async fn record_tokens(&self, execution_id: &ExecutionId, input: u32, output: u32) {
        if let Some(usage) = self.get_usage(execution_id).await {
            usage.record_tokens(input, output);
            usage.touch().await;
        }
    }

    /// Record a discovered step and update usage
    pub async fn record_discovered_step(&self, execution_id: &ExecutionId) {
        if let Some(usage) = self.get_usage(execution_id).await {
            usage.record_discovered_step();
            usage.touch().await;
        }
    }

    /// Record cost in USD
    pub async fn record_cost(&self, execution_id: &ExecutionId, cost_usd: f64) {
        if let Some(usage) = self.get_usage(execution_id).await {
            usage.record_cost_usd(cost_usd);
            usage.touch().await;
        }
    }

    /// Push discovery depth (entering a discovered step's sub-execution)
    pub async fn push_discovery_depth(&self, execution_id: &ExecutionId) {
        if let Some(usage) = self.get_usage(execution_id).await {
            usage.push_discovery_depth();
        }
    }

    /// Pop discovery depth (exiting a discovered step's sub-execution)
    pub async fn pop_discovery_depth(&self, execution_id: &ExecutionId) {
        if let Some(usage) = self.get_usage(execution_id).await {
            usage.pop_discovery_depth();
        }
    }

    // =========================================================================
    // Long-Running Execution Checks
    // =========================================================================

    /// Check if discovered step limit is within bounds
    pub async fn check_discovered_step_limit(
        &self,
        execution_id: &ExecutionId,
        policy: &LongRunningExecutionPolicy,
    ) -> EnforcementResult {
        let max_discovered = match policy.max_discovered_steps {
            Some(max) => max,
            None => return EnforcementResult::Allowed,
        };

        let usage = match self.get_usage(execution_id).await {
            Some(u) => u,
            None => return EnforcementResult::Allowed,
        };

        let current = usage.discovered_step_count() as u64 + 1; // +1 for step we're about to discover
        let limit = max_discovered as u64;

        if current > limit {
            return EnforcementResult::Blocked(EnforcementViolation::new(
                ViolationType::DiscoveredStepLimit,
                current,
                limit,
            ));
        }

        let percent = (current as f64 / limit as f64 * 100.0) as u32;
        if percent >= self.policy.warning_threshold {
            return EnforcementResult::Warning(EnforcementWarning::new(
                ViolationType::DiscoveredStepLimit,
                current,
                limit,
            ));
        }

        EnforcementResult::Allowed
    }

    /// Check if discovery depth is within bounds
    pub async fn check_discovery_depth_limit(
        &self,
        execution_id: &ExecutionId,
        policy: &LongRunningExecutionPolicy,
    ) -> EnforcementResult {
        let max_depth = match policy.max_discovery_depth {
            Some(max) => max,
            None => return EnforcementResult::Allowed,
        };

        let usage = match self.get_usage(execution_id).await {
            Some(u) => u,
            None => return EnforcementResult::Allowed,
        };

        let current = usage.current_discovery_depth() as u64 + 1; // +1 for depth we're about to enter
        let limit = max_depth as u64;

        if current > limit {
            return EnforcementResult::Blocked(EnforcementViolation::new(
                ViolationType::DiscoveryDepthLimit,
                current,
                limit,
            ));
        }

        // No warning for depth - it's either allowed or not
        EnforcementResult::Allowed
    }

    /// Check if cost threshold has been exceeded
    pub async fn check_cost_threshold(
        &self,
        execution_id: &ExecutionId,
        policy: &LongRunningExecutionPolicy,
    ) -> EnforcementResult {
        let threshold = match policy.cost_alert_threshold_usd {
            Some(t) => t,
            None => return EnforcementResult::Allowed,
        };

        let usage = match self.get_usage(execution_id).await {
            Some(u) => u,
            None => return EnforcementResult::Allowed,
        };

        let current_cents = usage.cost_cents.load(Ordering::SeqCst);
        let current_usd = current_cents as f64 / 100.0;
        let limit_cents = (threshold * 100.0) as u64;

        if current_usd >= threshold {
            return EnforcementResult::Blocked(EnforcementViolation::new(
                ViolationType::CostThreshold,
                current_cents,
                limit_cents,
            ));
        }

        let percent = (current_usd / threshold * 100.0) as u32;
        if percent >= self.policy.warning_threshold {
            return EnforcementResult::Warning(EnforcementWarning::new(
                ViolationType::CostThreshold,
                current_cents,
                limit_cents,
            ));
        }

        EnforcementResult::Allowed
    }

    /// Check if idle timeout has been exceeded
    pub async fn check_idle_timeout(
        &self,
        execution_id: &ExecutionId,
        policy: &LongRunningExecutionPolicy,
    ) -> EnforcementResult {
        let timeout_secs = match policy.idle_timeout_seconds {
            Some(t) => t,
            None => return EnforcementResult::Allowed,
        };

        let usage = match self.get_usage(execution_id).await {
            Some(u) => u,
            None => return EnforcementResult::Allowed,
        };

        let idle_secs = usage.idle_seconds().await;

        if idle_secs >= timeout_secs {
            return EnforcementResult::Blocked(EnforcementViolation::new(
                ViolationType::IdleTimeout,
                idle_secs,
                timeout_secs,
            ));
        }

        // Warn at 80% of idle timeout
        let percent = (idle_secs as f64 / timeout_secs as f64 * 100.0) as u32;
        if percent >= self.policy.warning_threshold {
            return EnforcementResult::Warning(EnforcementWarning::new(
                ViolationType::IdleTimeout,
                idle_secs,
                timeout_secs,
            ));
        }

        EnforcementResult::Allowed
    }

    /// Perform all long-running execution checks
    pub async fn check_long_running_limits(
        &self,
        execution_id: &ExecutionId,
        policy: &LongRunningExecutionPolicy,
    ) -> EnforcementResult {
        // Check cost threshold first (most critical for runaway costs)
        let cost_check = self.check_cost_threshold(execution_id, policy).await;
        if cost_check.is_blocked() {
            return cost_check;
        }

        // Check discovery depth (prevents infinite discovery)
        let depth_check = self.check_discovery_depth_limit(execution_id, policy).await;
        if depth_check.is_blocked() {
            return depth_check;
        }

        // Check discovered step count
        let discovered_check = self.check_discovered_step_limit(execution_id, policy).await;
        if discovered_check.is_blocked() {
            return discovered_check;
        }

        // Check idle timeout
        let idle_check = self.check_idle_timeout(execution_id, policy).await;
        if idle_check.is_blocked() {
            return idle_check;
        }

        // Return warnings if any
        if let EnforcementResult::Warning(w) = cost_check {
            return EnforcementResult::Warning(w);
        }
        if let EnforcementResult::Warning(w) = discovered_check {
            return EnforcementResult::Warning(w);
        }
        if let EnforcementResult::Warning(w) = idle_check {
            return EnforcementResult::Warning(w);
        }

        EnforcementResult::Allowed
    }
}

impl Default for EnforcementMiddleware {
    fn default() -> Self {
        Self::new()
    }
}

// =============================================================================
// Rate Limiter
// =============================================================================

/// Rate limiter state using token bucket algorithm
#[derive(Debug)]
struct RateLimiterState {
    /// Tokens per provider
    #[allow(dead_code)]
    provider_tokens: HashMap<String, TokenBucket>,
}

impl RateLimiterState {
    fn new() -> Self {
        Self {
            provider_tokens: HashMap::new(),
        }
    }
}

/// Token bucket for rate limiting
#[derive(Debug)]
struct TokenBucket {
    /// Current token count
    tokens: AtomicU64,
    /// Maximum tokens (bucket size)
    max_tokens: u64,
    /// Tokens added per second
    refill_rate: u64,
    /// Last refill timestamp
    last_refill: RwLock<Instant>,
}

impl TokenBucket {
    /// Create a new token bucket
    #[allow(dead_code)]
    fn new(max_tokens: u64, refill_rate: u64) -> Self {
        Self {
            tokens: AtomicU64::new(max_tokens),
            max_tokens,
            refill_rate,
            last_refill: RwLock::new(Instant::now()),
        }
    }

    /// Try to acquire tokens
    #[allow(dead_code)]
    async fn try_acquire(&self, count: u64) -> bool {
        // Refill tokens based on elapsed time
        {
            let mut last = self.last_refill.write().await;
            let elapsed = last.elapsed();
            let new_tokens = (elapsed.as_secs_f64() * self.refill_rate as f64) as u64;
            if new_tokens > 0 {
                let current = self.tokens.load(Ordering::SeqCst);
                let new_total = std::cmp::min(current + new_tokens, self.max_tokens);
                self.tokens.store(new_total, Ordering::SeqCst);
                *last = Instant::now();
            }
        }

        // Try to acquire
        let current = self.tokens.load(Ordering::SeqCst);
        if current >= count {
            self.tokens.fetch_sub(count, Ordering::SeqCst);
            true
        } else {
            false
        }
    }
}

// =============================================================================
// Step Timeout Guard
// =============================================================================

/// Guard for enforcing step timeouts
pub struct StepTimeoutGuard {
    step_id: StepId,
    timeout: Duration,
    started_at: Instant,
}

impl StepTimeoutGuard {
    /// Create a new timeout guard
    pub fn new(step_id: StepId, timeout: Duration) -> Self {
        Self {
            step_id,
            timeout,
            started_at: Instant::now(),
        }
    }

    /// Check if the timeout has been exceeded
    pub fn is_timed_out(&self) -> bool {
        self.started_at.elapsed() > self.timeout
    }

    /// Get remaining time
    pub fn remaining(&self) -> Duration {
        self.timeout.saturating_sub(self.started_at.elapsed())
    }

    /// Get elapsed time
    pub fn elapsed(&self) -> Duration {
        self.started_at.elapsed()
    }

    /// Check and return an error if timed out
    #[allow(clippy::result_large_err)]
    pub fn check(&self) -> Result<(), ExecutionError> {
        if self.is_timed_out() {
            Err(ExecutionError::timeout(format!(
                "Step {} timed out after {:?}",
                self.step_id, self.timeout
            ))
            .with_step_id(self.step_id.clone()))
        } else {
            Ok(())
        }
    }
}

// =============================================================================
// Tests
// =============================================================================

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

    #[tokio::test]
    async fn test_usage_tracking() {
        let exec_id = ExecutionId::new();
        let tenant_id = TenantId::from("tenant_test123456789012345");
        let usage = ExecutionUsage::new(exec_id, tenant_id);

        usage.record_step();
        usage.record_step();
        assert_eq!(usage.step_count(), 2);

        usage.record_tokens(100, 50);
        assert_eq!(usage.total_tokens(), 150);
    }

    #[tokio::test]
    async fn test_step_limit_enforcement() {
        let middleware = EnforcementMiddleware::new();
        let exec_id = ExecutionId::new();
        let tenant_id = TenantId::from("tenant_test123456789012345");

        let limits = ResourceLimits {
            max_steps: 5,
            max_tokens: 1000,
            max_wall_time_ms: 60000,
            max_memory_mb: None,
            max_concurrent_executions: None,
        };

        let usage = middleware
            .register_execution(exec_id.clone(), tenant_id)
            .await;

        // First 5 steps should be allowed
        for _ in 0..5 {
            let result = middleware.check_step_allowed(&exec_id, &limits).await;
            assert!(result.is_allowed(), "Step should be allowed");
            usage.record_step();
        }

        // 6th step should be blocked
        let result = middleware.check_step_allowed(&exec_id, &limits).await;
        assert!(result.is_blocked(), "Step should be blocked");
    }

    #[tokio::test]
    async fn test_token_limit_enforcement() {
        let middleware = EnforcementMiddleware::new();
        let exec_id = ExecutionId::new();
        let tenant_id = TenantId::from("tenant_test123456789012345");

        let limits = ResourceLimits {
            max_steps: 100,
            max_tokens: 100,
            max_wall_time_ms: 60000,
            max_memory_mb: None,
            max_concurrent_executions: None,
        };

        let usage = middleware
            .register_execution(exec_id.clone(), tenant_id)
            .await;

        // Record some tokens
        usage.record_tokens(50, 30);

        // Check with additional tokens that would exceed
        let result = middleware.check_tokens_allowed(&exec_id, &limits, 25).await;
        assert!(
            result.is_blocked(),
            "Should be blocked when exceeding limit"
        );

        // Check with tokens that would stay within limit
        let result = middleware.check_tokens_allowed(&exec_id, &limits, 10).await;
        assert!(result.is_allowed(), "Should be allowed within limit");
    }

    #[tokio::test]
    async fn test_warning_threshold() {
        let policy = EnforcementPolicy {
            warning_threshold: 80,
            ..Default::default()
        };
        let middleware = EnforcementMiddleware::with_policy(policy);
        let exec_id = ExecutionId::new();
        let tenant_id = TenantId::from("tenant_test123456789012345");

        let limits = ResourceLimits {
            max_steps: 10,
            max_tokens: 1000,
            max_wall_time_ms: 60000,
            max_memory_mb: None,
            max_concurrent_executions: None,
        };

        let usage = middleware
            .register_execution(exec_id.clone(), tenant_id)
            .await;

        // Record 8 steps (80% = warning threshold)
        for _ in 0..7 {
            usage.record_step();
        }

        // 8th step should trigger warning
        let result = middleware.check_step_allowed(&exec_id, &limits).await;
        assert!(matches!(result, EnforcementResult::Warning(_)));
    }

    #[test]
    fn test_step_timeout_guard() {
        let step_id = StepId::new();
        let guard = StepTimeoutGuard::new(step_id, Duration::from_millis(100));

        assert!(!guard.is_timed_out());
        assert!(guard.check().is_ok());

        // Sleep past timeout
        std::thread::sleep(Duration::from_millis(150));

        assert!(guard.is_timed_out());
        assert!(guard.check().is_err());
    }

    #[tokio::test]
    async fn test_concurrency_limit() {
        let middleware = EnforcementMiddleware::new();
        let tenant_id = TenantId::from("tenant_test123456789012345");

        let limits = ResourceLimits {
            max_steps: 100,
            max_tokens: 1000,
            max_wall_time_ms: 60000,
            max_memory_mb: None,
            max_concurrent_executions: Some(2),
        };

        // Register 2 executions
        let exec1 = ExecutionId::new();
        let exec2 = ExecutionId::new();
        middleware
            .register_execution(exec1.clone(), tenant_id.clone())
            .await;
        middleware
            .register_execution(exec2.clone(), tenant_id.clone())
            .await;

        // Third should be blocked
        let result = middleware
            .check_concurrency_allowed(&tenant_id, &limits)
            .await;
        assert!(result.is_blocked());

        // Unregister one
        middleware.unregister_execution(&exec1).await;

        // Now should be allowed
        let result = middleware
            .check_concurrency_allowed(&tenant_id, &limits)
            .await;
        assert!(result.is_allowed());
    }

    #[test]
    fn test_network_violation_type() {
        // Verify NetworkViolation exists and is non-retryable
        let violation = EnforcementViolation::new(ViolationType::NetworkViolation, 0, 0);

        let error = violation.to_error();
        assert_eq!(error.category, ExecutionErrorCategory::PolicyViolation);
        assert!(!error.is_retryable());
        assert!(error.is_fatal());
    }

    #[test]
    fn test_violation_type_display_network() {
        assert_eq!(
            format!("{}", ViolationType::NetworkViolation),
            "network_violation"
        );
    }
}