zenith-net 0.1.0

Zenith 网络地址与传输层抽象:L2-L4 协议解析、TCP/UDP/QUIC 状态机、来源准入引擎、单队列 Worker 数据面循环
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
//! 层级时间轮 - 零堆分配定时器管理
//!
//! 设计:
//! - 单级 65536 槽时间轮(16-bit tick 空间),简化实现
//! - 预分配固定大小节点池,零堆分配
//! - 索引链表实现同槽多定时器
//! - O(1) 添加/删除/推进

use smallvec::SmallVec;

/// 槽位数(16-bit)
const SLOT_BITS: u32 = 16;
/// 槽数(65536)
const SLOT_COUNT: usize = 1 << SLOT_BITS;
/// 槽位掩码
const SLOT_MASK: u64 = (SLOT_COUNT as u64) - 1;
/// 最大节点数(预分配)
const MAX_TIMERS: usize = 65536;
/// 空节点标记
const FREE: u32 = u32::MAX;

/// 定时器类型
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum TimerType {
    /// TCP 重传超时
    TcpRetransmit,
    /// TCP 连接超时(SYN-RECEIVED 等)
    TcpConnectionTimeout,
    /// TCP TIME_WAIT 超时
    TcpTimeWait,
    /// TCP FIN_WAIT_2 超时
    TcpFinWait2,
    /// UDP 会话超时
    UdpSessionTimeout,
    /// QUIC PTO(探测超时)
    QuicPto,
    /// QUIC 连接关闭超时
    QuicCloseTimeout,
    /// QUIC 握手超时
    QuicHandshakeTimeout,
}

/// 定时器类型变体总数(用于定长数组索引)
pub const TIMER_TYPE_COUNT: usize = 8;

impl TimerType {
    /// 将定时器类型映射为 `[0, TIMER_TYPE_COUNT)` 区间内的索引,
    /// 供 `TcpConnection::timer_handles` 等定长数组使用。
    ///
    /// # 极致性能
    /// 编译期确定的 `match`,无运行期开销。
    #[inline]
    pub const fn as_index(self) -> usize {
        match self {
            TimerType::TcpRetransmit => 0,
            TimerType::TcpConnectionTimeout => 1,
            TimerType::TcpTimeWait => 2,
            TimerType::TcpFinWait2 => 3,
            TimerType::UdpSessionTimeout => 4,
            TimerType::QuicPto => 5,
            TimerType::QuicCloseTimeout => 6,
            TimerType::QuicHandshakeTimeout => 7,
        }
    }
}

/// 定时器动作
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct TimerAction {
    /// 定时器类型
    pub timer_type: TimerType,
    /// 目标对象索引(如连接或会话索引)
    pub target_idx: usize,
}

/// 定时器节点
#[derive(Clone)]
struct TimerNode {
    /// 过期 tick(绝对)
    expires_at: u64,
    /// 插入时的 tick
    inserted_at: u64,
    /// 定时器类型
    timer_type: TimerType,
    /// 目标对象索引
    target_idx: usize,
    /// 下一个节点索引
    next: u32,
    /// 上一个节点索引
    prev: u32,
    /// 是否激活
    active: bool,
}

impl core::fmt::Debug for TimerNode {
    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
        f.debug_struct("TimerNode")
            .field("expires_at", &self.expires_at)
            .field("timer_type", &self.timer_type)
            .field("target_idx", &self.target_idx)
            .finish()
    }
}

impl TimerNode {
    const fn empty() -> Self {
        Self {
            expires_at: 0,
            inserted_at: 0,
            timer_type: TimerType::UdpSessionTimeout,
            target_idx: 0,
            next: FREE,
            prev: FREE,
            active: false,
        }
    }
}

/// 时间轮
pub struct TimerWheel {
    /// 槽链表头节点(65536 槽)
    slots: Vec<u32>,
    /// 预分配节点池
    nodes: Vec<TimerNode>,
    /// 空闲链表头
    free_head: u32,
    /// 空闲计数
    free_count: u32,
    /// 当前 tick
    current_tick: u64,
    /// tick 间隔(毫秒)
    tick_ms: u64,
}

impl core::fmt::Debug for TimerWheel {
    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
        f.debug_struct("TimerWheel")
            .field("current_tick", &self.current_tick)
            .field("tick_ms", &self.tick_ms)
            .field("active", &(MAX_TIMERS as u32 - self.free_count))
            .finish()
    }
}

impl TimerWheel {
    /// 创建时间轮
    pub fn new(tick_ms: u64) -> Self {
        let mut nodes = Vec::with_capacity(MAX_TIMERS);
        for i in 0..MAX_TIMERS {
            let mut node = TimerNode::empty();
            node.next = if i + 1 < MAX_TIMERS {
                (i + 1) as u32
            } else {
                FREE
            };
            nodes.push(node);
        }

        Self {
            slots: vec![FREE; SLOT_COUNT],
            nodes,
            free_head: 0,
            free_count: MAX_TIMERS as u32,
            current_tick: 0,
            tick_ms,
        }
    }

    /// 当前 tick
    #[inline]
    pub fn current_tick(&self) -> u64 {
        self.current_tick
    }

    /// tick 间隔
    #[inline]
    pub fn tick_ms(&self) -> u64 {
        self.tick_ms
    }

    /// 已激活定时器数
    #[inline]
    pub fn active_count(&self) -> u32 {
        (MAX_TIMERS as u32) - self.free_count
    }

    /// 添加定时器
    ///
    /// # Arguments
    /// * `duration_ms` - 延迟毫秒数
    /// * `timer_type` - 定时器类型
    /// * `target_idx` - 目标对象索引
    ///
    /// # Returns
    /// * `Option<u32>` - 定时器句柄
    pub fn add_timer(
        &mut self,
        duration_ms: u64,
        timer_type: TimerType,
        target_idx: usize,
    ) -> Option<u32> {
        if self.free_count == 0 {
            return None;
        }

        // 分配节点
        let node_idx = self.free_head;
        self.free_head = self.nodes[node_idx as usize].next;
        self.free_count -= 1;

        let duration = duration_ms.max(1);
        // checked 算术:tick 溢出即 fail-closed(拒绝注册,节点已回收)
        let Some(expires_at) = self.current_tick.checked_add(duration) else {
            self.free_node(node_idx);
            return None;
        };
        // 长延迟钳制:超过时间轮槽位数的延迟会回绕导致定时器错误触发,
        // 钳制到最大可表示延迟(current_tick + SLOT_COUNT - 1)
        let expires_at = if duration > SLOT_COUNT as u64 {
            tracing::warn!(
                duration_ms,
                max_ms = SLOT_COUNT as u64 * self.tick_ms,
                "定时器延迟超过时间轮容量,已钳制到最大延迟"
            );
            self.current_tick + (SLOT_COUNT as u64 - 1)
        } else {
            expires_at
        };
        let slot = (expires_at & SLOT_MASK) as usize;

        self.nodes[node_idx as usize].expires_at = expires_at;
        self.nodes[node_idx as usize].inserted_at = self.current_tick;
        self.nodes[node_idx as usize].timer_type = timer_type;
        self.nodes[node_idx as usize].target_idx = target_idx;
        self.nodes[node_idx as usize].active = true;

        // 插入槽链表
        let old_head = self.slots[slot];
        self.nodes[node_idx as usize].next = old_head;
        self.nodes[node_idx as usize].prev = FREE;
        if old_head != FREE {
            self.nodes[old_head as usize].prev = node_idx;
        }
        self.slots[slot] = node_idx;

        Some(node_idx)
    }

    /// 按目标和类型删除定时器
    pub fn remove_timer(&mut self, target_idx: usize, timer_type: TimerType) -> bool {
        for slot in 0..SLOT_COUNT {
            let mut ni = self.slots[slot];
            while ni != FREE {
                let next = self.nodes[ni as usize].next;
                if self.nodes[ni as usize].target_idx == target_idx
                    && self.nodes[ni as usize].timer_type == timer_type
                {
                    self.unlink_node(ni, slot);
                    self.free_node(ni);
                    return true;
                }
                ni = next;
            }
        }
        false
    }

    /// 按句柄删除
    ///
    /// # 极致性能:O(1) 算槽定位
    /// 节点的槽位由 `expires_at & SLOT_MASK` 唯一确定(与 `add_timer` / `reinsert_node`
    /// 使用的公式一致)。因此直接从节点存储的 `expires_at` 计算槽位,仅在单条
    /// 槽链表内遍历至多链长度(通常 O(1)),而非扫描全部 65536 槽。
    ///
    /// # 安全不变量
    /// - `handle` 范围校验 + `active` 标志校验保证不会操作空闲节点
    /// - 槽位计算与插入时一致(`(expires_at & SLOT_MASK) as usize`)
    /// - 若链表中未找到 handle(理论不可能,除非状态被破坏),返回 None
    pub fn remove_by_handle(&mut self, handle: u32) -> Option<TimerAction> {
        if (handle as usize) >= MAX_TIMERS || !self.nodes[handle as usize].active {
            return None;
        }

        // O(1) 算槽:与 add_timer / reinsert_node 完全一致的公式
        let expires_at = self.nodes[handle as usize].expires_at;
        let slot = (expires_at & SLOT_MASK) as usize;

        // 仅遍历该槽的链表(长度通常为 1-2,O(1))
        let mut ni = self.slots[slot];
        while ni != FREE {
            let next = self.nodes[ni as usize].next;
            if ni == handle {
                let action = TimerAction {
                    timer_type: self.nodes[ni as usize].timer_type,
                    target_idx: self.nodes[ni as usize].target_idx,
                };
                self.unlink_node(ni, slot);
                self.free_node(ni);
                return Some(action);
            }
            ni = next;
        }
        // 理论不可达:节点 active 但不在其 expires_at 对应的槽中,
        // 说明内部状态被破坏。fail-closed 返回 None。
        None
    }

    /// 推进时间轮
    ///
    /// # Arguments
    /// * `elapsed_ms` - 经过的毫秒数
    ///
    /// # Returns
    /// * `SmallVec<[TimerAction; 16]>` - 过期定时器
    ///   (≤16 个时栈上存储,热路径零堆分配;超出才溢出到堆)
    pub fn advance(&mut self, elapsed_ms: u64) -> SmallVec<[TimerAction; 16]> {
        let mut expired = SmallVec::new();
        let mut remaining = elapsed_ms;

        while remaining >= self.tick_ms {
            self.current_tick += 1;
            remaining -= self.tick_ms;
            self.process_current_slot(&mut expired);
        }

        expired
    }

    /// 处理当前 tick 对应的槽
    fn process_current_slot(&mut self, expired: &mut SmallVec<[TimerAction; 16]>) {
        let slot = (self.current_tick & SLOT_MASK) as usize;
        let mut ni = self.slots[slot];
        self.slots[slot] = FREE;

        while ni != FREE {
            let next = self.nodes[ni as usize].next;
            if self.nodes[ni as usize].expires_at <= self.current_tick {
                // 已过期
                let action = TimerAction {
                    timer_type: self.nodes[ni as usize].timer_type,
                    target_idx: self.nodes[ni as usize].target_idx,
                };
                expired.push(action);
                self.free_node(ni);
            } else {
                // 尚未过期,需要重新定位到新槽
                self.reinsert_node(ni);
            }
            ni = next;
        }
    }

    /// 重新插入节点到正确槽
    fn reinsert_node(&mut self, node_idx: u32) {
        let expires_at = self.nodes[node_idx as usize].expires_at;
        let new_slot = (expires_at & SLOT_MASK) as usize;

        self.nodes[node_idx as usize].next = self.slots[new_slot];
        self.nodes[node_idx as usize].prev = FREE;
        if self.slots[new_slot] != FREE {
            self.nodes[self.slots[new_slot] as usize].prev = node_idx;
        }
        self.slots[new_slot] = node_idx;
    }

    /// 从指定槽解除节点
    fn unlink_node(&mut self, node_idx: u32, slot: usize) {
        let prev = self.nodes[node_idx as usize].prev;
        let next = self.nodes[node_idx as usize].next;

        if prev != FREE {
            self.nodes[prev as usize].next = next;
        } else {
            self.slots[slot] = next;
        }

        if next != FREE {
            self.nodes[next as usize].prev = prev;
        }

        self.nodes[node_idx as usize].next = FREE;
        self.nodes[node_idx as usize].prev = FREE;
    }

    /// 释放节点
    fn free_node(&mut self, node_idx: u32) {
        self.nodes[node_idx as usize].active = false;
        self.nodes[node_idx as usize].next = self.free_head;
        self.free_head = node_idx;
        self.free_count += 1;
    }
}

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

    #[test]
    fn test_single_timer_expire() {
        let mut wheel = TimerWheel::new(1); // 1ms tick

        wheel.add_timer(10, TimerType::TcpRetransmit, 0);
        assert_eq!(wheel.active_count(), 1);

        // 推进 10ms - 应过期
        let expired = wheel.advance(10);
        assert_eq!(expired.len(), 1);
        assert_eq!(expired[0].timer_type, TimerType::TcpRetransmit);
        assert_eq!(expired[0].target_idx, 0);
        assert_eq!(wheel.active_count(), 0);
    }

    #[test]
    fn test_multiple_timers_different_delays() {
        let mut wheel = TimerWheel::new(1);

        wheel.add_timer(10, TimerType::TcpRetransmit, 0);
        wheel.add_timer(20, TimerType::UdpSessionTimeout, 1);
        wheel.add_timer(5, TimerType::TcpTimeWait, 2);

        assert_eq!(wheel.active_count(), 3);

        // 推进 5ms - 只有 5ms 定时器过期
        let expired = wheel.advance(5);
        assert_eq!(expired.len(), 1);
        assert_eq!(expired[0].timer_type, TimerType::TcpTimeWait);
        assert_eq!(wheel.active_count(), 2);

        // 推进 5ms - 10ms 定时器过期
        let expired = wheel.advance(5);
        assert_eq!(expired.len(), 1);
        assert_eq!(expired[0].target_idx, 0);
        assert_eq!(wheel.active_count(), 1);

        // 推进 10ms - 20ms 定时器过期
        let expired = wheel.advance(10);
        assert_eq!(expired.len(), 1);
        assert_eq!(expired[0].target_idx, 1);
        assert_eq!(wheel.active_count(), 0);
    }

    #[test]
    fn test_remove_by_handle() {
        let mut wheel = TimerWheel::new(1);

        let h = wheel.add_timer(100, TimerType::TcpConnectionTimeout, 42).unwrap();
        assert_eq!(wheel.active_count(), 1);

        let action = wheel.remove_by_handle(h).unwrap();
        assert_eq!(action.target_idx, 42);
        assert_eq!(wheel.active_count(), 0);

        // 再次返回 None
        assert!(wheel.remove_by_handle(h).is_none());
    }

    #[test]
    fn test_remove_by_target() {
        let mut wheel = TimerWheel::new(1);

        wheel.add_timer(100, TimerType::TcpRetransmit, 5);
        wheel.add_timer(200, TimerType::UdpSessionTimeout, 10);

        assert_eq!(wheel.active_count(), 2);

        let removed = wheel.remove_timer(5, TimerType::TcpRetransmit);
        assert!(removed);
        assert_eq!(wheel.active_count(), 1);

        // 推进 300ms - 只有 10 的过期
        let expired = wheel.advance(300);
        assert_eq!(expired.len(), 1);
        assert_eq!(expired[0].target_idx, 10);
    }

    #[test]
    fn test_many_timers_same_slot() {
        let mut wheel = TimerWheel::new(1);

        for i in 0..10u32 {
            wheel.add_timer(50, TimerType::UdpSessionTimeout, i as usize);
        }
        assert_eq!(wheel.active_count(), 10);

        let expired = wheel.advance(50);
        assert_eq!(expired.len(), 10);
        assert_eq!(wheel.active_count(), 0);
    }

    #[test]
    fn test_wraparound() {
        let mut wheel = TimerWheel::new(1);

        // 超过 65536 槽的定时器
        wheel.add_timer(70000, TimerType::TcpTimeWait, 99);
        assert_eq!(wheel.active_count(), 1);

        // 逐步推进
        for _ in 0..70 {
            wheel.advance(1000);
        }

        // 应已过期
        assert_eq!(wheel.active_count(), 0);
    }

    #[test]
    fn test_bulk_operations() {
        let mut wheel = TimerWheel::new(1);

        for i in 0..500 {
            let delay = (i % 100) as u64 + 1;
            wheel.add_timer(delay, TimerType::UdpSessionTimeout, i);
        }
        assert_eq!(wheel.active_count(), 500);

        let mut total = 0;
        for _ in 0..200 {
            total += wheel.advance(1).len();
        }
        assert_eq!(total, 500);
        assert_eq!(wheel.active_count(), 0);
    }

    #[test]
    fn test_multiple_fifo_same_slot() {
        let mut wheel = TimerWheel::new(1);

        // 同时过期的定时器保持插入顺序
        wheel.add_timer(10, TimerType::TcpRetransmit, 0);
        wheel.add_timer(10, TimerType::TcpRetransmit, 1);
        wheel.add_timer(10, TimerType::TcpRetransmit, 2);

        let expired = wheel.advance(10);
        assert_eq!(expired.len(), 3);
        // 链表头插入顺序:2, 1, 0(后进先出)
        assert_eq!(expired[0].target_idx, 2);
        assert_eq!(expired[1].target_idx, 1);
        assert_eq!(expired[2].target_idx, 0);
    }

    #[test]
    fn test_timer_wheel_initial_state() {
        let wheel = TimerWheel::new(10);
        assert_eq!(wheel.current_tick(), 0);
        assert_eq!(wheel.tick_ms(), 10);
        assert_eq!(wheel.active_count(), 0);
    }

    #[test]
    fn test_timer_zero_duration() {
        let mut wheel = TimerWheel::new(1);
        // 0 延迟会被 max(1) 提升为 1
        let h = wheel.add_timer(0, TimerType::UdpSessionTimeout, 0).unwrap();
        assert_eq!(wheel.active_count(), 1);

        let expired = wheel.advance(1);
        assert_eq!(expired.len(), 1);
        assert_eq!(expired[0].target_idx, 0);
        let _ = h;
    }

    #[test]
    fn test_timer_remove_by_handle_invalid() {
        let mut wheel = TimerWheel::new(1);
        assert!(wheel.remove_by_handle(u32::MAX).is_none());
        assert!(wheel.remove_by_handle(0).is_none());
    }

    #[test]
    fn test_timer_remove_by_target_not_found() {
        let mut wheel = TimerWheel::new(1);
        assert!(!wheel.remove_timer(999, TimerType::TcpRetransmit));
    }

    #[test]
    fn test_timer_wheel_65536_wraparound() {
        let mut wheel = TimerWheel::new(1);

        wheel.add_timer(65536, TimerType::TcpTimeWait, 42);
        assert_eq!(wheel.active_count(), 1);

        for _ in 0..65536 {
            wheel.advance(1);
        }

        assert_eq!(wheel.active_count(), 0);
        assert_eq!(wheel.current_tick(), 65536);
    }

    #[test]
    fn test_timer_wheel_slot_zero() {
        let mut wheel = TimerWheel::new(1);

        wheel.add_timer(1, TimerType::UdpSessionTimeout, 100);
        assert_eq!(wheel.active_count(), 1);

        let expired = wheel.advance(1);
        assert_eq!(expired.len(), 1);
        assert_eq!(expired[0].target_idx, 100);
    }

    #[test]
    fn test_timer_wheel_max_slot() {
        let mut wheel = TimerWheel::new(1);

        wheel.add_timer(65535, TimerType::TcpFinWait2, 200);
        assert_eq!(wheel.active_count(), 1);

        let expired = wheel.advance(65535);
        assert_eq!(expired.len(), 1);
        assert_eq!(expired[0].target_idx, 200);
    }

    #[test]
    fn test_timer_multiple_advances() {
        let mut wheel = TimerWheel::new(1);

        wheel.add_timer(100, TimerType::TcpRetransmit, 0);
        wheel.add_timer(200, TimerType::UdpSessionTimeout, 1);

        let mut total_expired = 0;
        for _ in 0..50 {
            total_expired += wheel.advance(5).len();
        }

        assert_eq!(total_expired, 2);
        assert_eq!(wheel.active_count(), 0);
    }

    #[test]
    fn test_timer_action_fields() {
        let action = TimerAction {
            timer_type: TimerType::TcpRetransmit,
            target_idx: 42,
        };
        assert_eq!(action.timer_type, TimerType::TcpRetransmit);
        assert_eq!(action.target_idx, 42);
    }

    #[test]
    fn test_timer_type_all_variants() {
        let types = vec![
            TimerType::TcpRetransmit,
            TimerType::TcpConnectionTimeout,
            TimerType::TcpTimeWait,
            TimerType::TcpFinWait2,
            TimerType::UdpSessionTimeout,
            TimerType::QuicPto,
            TimerType::QuicCloseTimeout,
            TimerType::QuicHandshakeTimeout,
        ];
        for t in &types {
            let _ = format!("{:?}", t);
        }
    }

    #[test]
    fn test_timer_node_debug() {
        let node = TimerNode::empty();
        let debug = format!("{:?}", node);
        assert!(debug.contains("TimerNode"));
    }

    #[test]
    fn test_timer_wheel_debug() {
        let wheel = TimerWheel::new(100);
        let debug = format!("{:?}", wheel);
        assert!(debug.contains("TimerWheel"));
        assert!(debug.contains("current_tick"));
    }

    #[test]
    fn test_bulk_expire_many_timers() {
        let mut wheel = TimerWheel::new(1);

        for i in 0..100u32 {
            wheel.add_timer(50, TimerType::UdpSessionTimeout, i as usize);
        }
        assert_eq!(wheel.active_count(), 100);

        let expired = wheel.advance(50);
        assert_eq!(expired.len(), 100);
        assert_eq!(wheel.active_count(), 0);
    }

    #[test]
    fn test_add_after_expiry() {
        let mut wheel = TimerWheel::new(1);

        wheel.add_timer(10, TimerType::TcpRetransmit, 0);
        wheel.advance(10);
        assert_eq!(wheel.active_count(), 0);

        wheel.add_timer(5, TimerType::UdpSessionTimeout, 1);
        assert_eq!(wheel.active_count(), 1);

        let expired = wheel.advance(5);
        assert_eq!(expired.len(), 1);
        assert_eq!(expired[0].target_idx, 1);
    }
}