Function test_fifo_ordering

tests/system_test/fifo_scheduler_test.cpp:67–100

}

auto test_fifo_ordering() -> bool {
  klog::Info("Running test_fifo_ordering...");

  FifoScheduler scheduler;
  constexpr size_t kTaskCount = 10;
  TaskControlBlock* tasks[kTaskCount];

  // 初始化任务
  for (size_t i = 0; i < kTaskCount; ++i) {
    tasks[i] = new TaskControlBlock("Task", 10, nullptr, nullptr);
    tasks[i]->fsm.Receive(MsgSchedule{});
    scheduler.Enqueue(tasks[i]);
  }

  EXPECT_EQ(scheduler.GetQueueSize(), kTaskCount,
            "Queue size should match task count");

  // 验证严格的 FIFO 顺序
  for (size_t i = 0; i < kTaskCount; ++i) {
    auto* picked = scheduler.PickNext();
    EXPECT_NE(picked, nullptr, "Picked task should not be nullptr");
    EXPECT_EQ(picked, tasks[i], "Task should be picked in FIFO order");
  }

  EXPECT_TRUE(scheduler.IsEmpty(), "Scheduler should be empty after all picks");

  // 清理内存
  for (size_t i = 0; i < kTaskCount; ++i) {
    delete tasks[i];
  }

  klog::Info("test_fifo_ordering passed");
  return true;
}

auto test_fifo_dequeue() -> bool {
  klog::Info("Running test_fifo_dequeue...");