mirror of
https://github.com/encounter/dawn-cmake.git
synced 2025-07-14 00:56:05 +00:00
They are always used together, and can actually be simplified when combined. This transform cannot currently deal with shadowing, and will need need to depend on a new 'unshadow' transform. Fixes a long-standing bug where we'd get an ICE if we attempt to inline a pointer let declaration with side-effects in a for-loop initializer. Fixed: tint:1321 Bug: tint:819 Change-Id: I236fed688e33a4996e47310b5ece44c991b5249f Reviewed-on: https://dawn-review.googlesource.com/c/tint/+/70661 Kokoro: Kokoro <noreply+kokoro@google.com> Reviewed-by: James Price <jrprice@google.com>
66 lines
2.1 KiB
C++
66 lines
2.1 KiB
C++
// Copyright 2020 The Tint 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 "src/reader/spirv/parser.h"
|
|
|
|
#include <utility>
|
|
|
|
#include "src/reader/spirv/parser_impl.h"
|
|
#include "src/transform/decompose_strided_matrix.h"
|
|
#include "src/transform/manager.h"
|
|
#include "src/transform/simplify_pointers.h"
|
|
|
|
namespace tint {
|
|
namespace reader {
|
|
namespace spirv {
|
|
|
|
Program Parse(const std::vector<uint32_t>& input) {
|
|
ParserImpl parser(input);
|
|
bool parsed = parser.Parse();
|
|
|
|
ProgramBuilder& builder = parser.builder();
|
|
if (!parsed) {
|
|
// TODO(bclayton): Migrate spirv::ParserImpl to using diagnostics.
|
|
builder.Diagnostics().add_error(diag::System::Reader, parser.error());
|
|
return Program(std::move(builder));
|
|
}
|
|
|
|
// The SPIR-V parser can construct disjoint AST nodes, which is invalid for
|
|
// the Resolver. Clone the Program to clean these up.
|
|
builder.SetResolveOnBuild(false);
|
|
Program program_with_disjoint_ast(std::move(builder));
|
|
|
|
ProgramBuilder output;
|
|
CloneContext(&output, &program_with_disjoint_ast, false).Clone();
|
|
auto program = Program(std::move(output));
|
|
if (!program.IsValid()) {
|
|
return program;
|
|
}
|
|
|
|
// If the generated program contains matrices with a custom MatrixStride
|
|
// attribute then we need to decompose these into an array of vectors
|
|
if (transform::DecomposeStridedMatrix::ShouldRun(&program)) {
|
|
transform::Manager manager;
|
|
manager.Add<transform::SimplifyPointers>();
|
|
manager.Add<transform::DecomposeStridedMatrix>();
|
|
return manager.Run(&program).program;
|
|
}
|
|
|
|
return program;
|
|
}
|
|
|
|
} // namespace spirv
|
|
} // namespace reader
|
|
} // namespace tint
|