Method AddTask

src/task/task_manager.cpp:94–163

}

auto TaskManager::AddTask(etl::unique_ptr<TaskControlBlock> task) -> void {
  assert(task.get() != nullptr && "AddTask: task must not be null");
  assert(task->GetStatus() == TaskStatus::kUnInit &&
         "AddTask: task status must be kUnInit");
  // 分配 PID
  if (task->pid == 0) {
    task->pid = AllocatePid();
  }

  // 如果 tgid 未设置，则将其设为自己的 pid (单线程进程或线程组的主线程)
  if (task->aux->tgid == 0) {
    task->aux->tgid = task->pid;
  }

  auto* task_ptr = task.get();
  Pid pid = task_ptr->pid;

  // 加入全局任务表
  {
    LockGuard lock_guard{task_table_lock_};
    if (task_table_.full()) {
      klog::Err("AddTask: task_table_ full, cannot add task (pid={})", pid);
      return;
    }
    task_table_[pid] = std::move(task);
  }

  // 设置任务状态为 kReady
  // Transition: kUnInit -> kReady
  task_ptr->fsm.Receive(MsgSchedule{});

  // 简单的负载均衡：如果指定了亲和性，放入对应核心，否则放入当前核心
  // 更复杂的逻辑可以是：寻找最空闲的核心
  size_t target_core = cpu_io::GetCurrentCoreId();

  if (task_ptr->aux->cpu_affinity.value() != UINT64_MAX) {
    // 寻找第一个允许的核心
    for (size_t core_id = 0; core_id < SIMPLEKERNEL_MAX_CORE_COUNT; ++core_id) {
      if (task_ptr->aux->cpu_affinity.value() & (1UL << core_id)) {
        target_core = core_id;
        break;
      }
    }
  }

  auto& cpu_sched = cpu_schedulers_[target_core];

  {
    LockGuard<SpinLock> lock_guard(cpu_sched.lock);
    if (task_ptr->policy < SchedPolicy::kPolicyCount) {
      if (cpu_sched.schedulers[static_cast<uint8_t>(task_ptr->policy)]) {
        cpu_sched.schedulers[static_cast<uint8_t>(task_ptr->policy)]->Enqueue(
            task_ptr);
      }
    }
  }

  // 如果是当前核心，且添加了比当前任务优先级更高的任务，触发抢占