Method InvalidateMetadataValues

pxr/exec/exec/program.cpp:320–367

}

Exec_MetadataInvalidationResult
Exec_Program::InvalidateMetadataValues(
    TfSpan<const std::pair<SdfPath, TfToken>> invalidFields)
{
    TRACE_FUNCTION();

    const size_t numInvalidFields = invalidFields.size();

    VdfMaskedOutputVector leafInvalidationRequest;
    leafInvalidationRequest.reserve(numInvalidFields);
    TfBits compiledProperties(numInvalidFields);
    _inputNodesRequiringInvalidation.reserve(
        _inputNodesRequiringInvalidation.size() + numInvalidFields);

    for (size_t i = 0; i < numInvalidFields; ++i) {
        const auto it = _metadataInputNodes.find(invalidFields[i]);

        // The corresponding metadata input may not have been compiled.
        if (it == _metadataInputNodes.end()) {
            continue;
        }

        Exec_MetadataInputNode *const node = it->second;

        // Since this is an input node to the exec network, we need to make sure
        // that executors are invalidated before the next round of evaluation.
        _inputNodesRequiringInvalidation.push_back(node->GetId());

        // Queue the input node's output(s) for leaf node invalidation.
        leafInvalidationRequest.emplace_back(
            node->GetOutput(), VdfMask::AllOnes(1));
    }

    // Find all the leaf nodes reachable from the input nodes.
    //
    // We won't ask the leaf node cache to incur the cost of performing
    // incremental updates on the resulting cached traversal, because it is not
    // guaranteed that we will repeatedly see the exact same authored value
    // invalidation across rounds of structural change processing (in contrast
    // to time invalidation).
    const std::vector<const VdfNode *> &leafNodes = _leafNodeCache.FindNodes(
        leafInvalidationRequest, /* updateIncrementally */ false);

    return {
        std::move(leafInvalidationRequest),
        leafNodes
    };
}

Exec_TimeChangeInvalidationResult
Exec_Program::InvalidateTime(const EfTime &oldTime, const EfTime &newTime)