// Copyright 2021 The Dawn Authors // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #include "dawn_native/ChainUtils_autogen.h" #include namespace dawn_native { {% for value in types["s type"].values %} {% if value.valid %} void FindInChain(const ChainedStruct* chain, const {{as_cppEnum(value.name)}}** out) { for (; chain; chain = chain->nextInChain) { if (chain->sType == wgpu::SType::{{as_cppEnum(value.name)}}) { *out = static_cast(chain); break; } } } {% endif %} {% endfor %} MaybeError ValidateSTypes(const ChainedStruct* chain, std::vector> oneOfConstraints) { std::unordered_set allSTypes; for (; chain; chain = chain->nextInChain) { if (allSTypes.find(chain->sType) != allSTypes.end()) { return DAWN_VALIDATION_ERROR("Chain cannot have duplicate sTypes"); } allSTypes.insert(chain->sType); } for (const auto& oneOfConstraint : oneOfConstraints) { bool satisfied = false; for (wgpu::SType oneOfSType : oneOfConstraint) { if (allSTypes.find(oneOfSType) != allSTypes.end()) { if (satisfied) { return DAWN_VALIDATION_ERROR("Unsupported sType combination"); } satisfied = true; allSTypes.erase(oneOfSType); } } } if (!allSTypes.empty()) { return DAWN_VALIDATION_ERROR("Unsupported sType"); } return {}; } } // namespace dawn_native