本文整理汇总了C++中Pipeline::GetTaskGraph方法的典型用法代码示例。如果您正苦于以下问题：C++ Pipeline::GetTaskGraph方法的具体用法？C++ Pipeline::GetTaskGraph怎么用？C++ Pipeline::GetTaskGraph使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Pipeline的用法示例。
在下文中一共展示了Pipeline::GetTaskGraph方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: ret
jobs::Future<std::any> SchedulerCPU::OnExecuteNode(const FrameContextEx& context, const Pipeline& pipeline, lemon::ListDigraph::Node node, std::any forwarded) {
GraphicsTask* task = pipeline.GetTaskFunctionMap()[node];
if (task != nullptr) {
// See if we inherited anything.
std::optional<ProducedCommands> heritage;
if (forwarded.has_value()) {
ProducedCommands& commands = *std::any_cast<std::shared_ptr<ProducedCommands>&>(forwarded); // Throws if wrong.
heritage = std::move(commands);
}
// Execute task.
ProducedCommands commands = ExecuteNode(*task, heritage, context);
// Enqueue heritage.
if (heritage) {
assert(heritage->list);
co_await context.schedulerGpu->Enqueue(std::move(heritage->list), std::move(heritage->vheap));
heritage.reset();
}
// Determine if next node can inherit.
const auto& taskGraph = pipeline.GetTaskGraph();
bool canNextInherit = false;
if (lemon::countOutArcs(taskGraph, node) == 1) {
lemon::ListDigraph::OutArcIt theOnlyOutArc(taskGraph, node);
lemon::ListDigraph::Node theOnlyNextNode = taskGraph.target(theOnlyOutArc);
canNextInherit = lemon::countInArcs(taskGraph, theOnlyNextNode) == 1;
}
// Pass on command lists to next node if possible.
if (canNextInherit) {
std::any ret(std::make_shared<ProducedCommands>(std::move(commands)));
co_return ret;
}
else {
// Enqueue commands.
if (commands.list) {
co_await context.schedulerGpu->Enqueue(std::move(commands.list), std::move(commands.vheap));
}
}
}
co_return std::any{};
}