Method update

Source/Falcor/RenderGraph/RenderGraph.cpp:455–524

}

void RenderGraph::update(const ref<RenderGraph>& pGraph)
{
    // Fill in missing passes from referenced graph.
    for (const auto& nameIndexPair : pGraph->mNameToIndex)
    {
        ref<RenderPass> pRenderPass = pGraph->mNodeData[nameIndexPair.second].pPass;
        if (!doesPassExist(nameIndexPair.first))
            addPass(pRenderPass, nameIndexPair.first);
    }

    // Remove nodes that should no longer be within the graph.
    std::vector<std::string> passesToRemove;

    for (const auto& nameIndexPair : mNameToIndex)
    {
        if (!pGraph->doesPassExist(nameIndexPair.first))
        {
            passesToRemove.push_back(nameIndexPair.first);
        }
    }

    for (const std::string& passName : passesToRemove)
    {
        removePass(passName);
    }

    // Remove all edges from this graph.
    for (uint32_t i = 0; i < mpGraph->getCurrentEdgeId(); ++i)
    {
        if (!mpGraph->doesEdgeExist(i))
        {
            continue;
        }

        mpGraph->removeEdge(i);
    }
    mEdgeData.clear();

    // Add all edges from the other graph.
    for (uint32_t i = 0; i < pGraph->mpGraph->getCurrentEdgeId(); ++i)
    {
        if (!pGraph->mpGraph->doesEdgeExist(i))
        {
            continue;
        }

        const DirectedGraph::Edge* pEdge = pGraph->mpGraph->getEdge(i);
        std::string dst = pGraph->mNodeData.find(pEdge->getDestNode())->second.name;
        std::string src = pGraph->mNodeData.find(pEdge->getSourceNode())->second.name;

        if ((mNameToIndex.find(src) != mNameToIndex.end()) && (mNameToIndex.find(dst) != mNameToIndex.end()))
        {
            if (pGraph->mEdgeData[i].dstField.size())
                dst += std::string(".") + pGraph->mEdgeData[i].dstField;
            if (pGraph->mEdgeData[i].srcField.size())
                src += std::string(".") + pGraph->mEdgeData[i].srcField;
            addEdge(src, dst);
        }