mirror of
https://github.com/shadps4-emu/shadPS4.git
synced 2025-08-03 07:52:31 +00:00
a7c9bfa5c5
* translator: Implemtn f32 to f16 convert * shader_recompiler: Add bit instructions * shader_recompiler: More data share instructions * shader_recompiler: Remove exec contexts, fix S_MOV_B64 * shader_recompiler: Split instruction parsing into categories * shader_recompiler: Better BFS search * shader_recompiler: Constant propagation pass for cmp_class_f32 * shader_recompiler: Partial readfirstlane implementation * shader_recompiler: Stub readlane/writelane only for non-compute * hack: Fix swizzle on RDR * Will properly fix this when merging this * clang format * address_space: Bump user area size to full * shader_recompiler: V_INTERP_MOV_F32 * Should work the same as spirv will emit flat decoration on demand * kernel: Add MAP_OP_MAP_FLEXIBLE * image_view: Attempt to apply storage swizzle on format * vk_scheduler: Barrier attachments on renderpass end * clang format * liverpool: cs state backup * shader_recompiler: More instructions and formats * vector_alu: Proper V_MBCNT_U32_B32 * shader_recompiler: Port some dark souls things * file_system: Implement sceKernelRename * more formats * clang format * resource_tracking_pass: Back to assert * translate: Tracedata * kernel: Remove tracy lock * Solves random crashes in Dark Souls * code: Review comments
63 lines
2.0 KiB
C++
63 lines
2.0 KiB
C++
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
|
|
|
#pragma once
|
|
|
|
#include <optional>
|
|
#include <type_traits>
|
|
#include <boost/container/small_vector.hpp>
|
|
#include <queue>
|
|
#include "shader_recompiler/ir/value.h"
|
|
|
|
namespace Shader::IR {
|
|
|
|
template <typename Pred>
|
|
auto BreadthFirstSearch(const Inst* inst, Pred&& pred) -> std::invoke_result_t<Pred, const Inst*> {
|
|
// Most often case the instruction is the desired already.
|
|
if (const std::optional result = pred(inst)) {
|
|
return result;
|
|
}
|
|
|
|
// Breadth-first search visiting the right most arguments first
|
|
boost::container::small_vector<const Inst*, 2> visited;
|
|
std::queue<const Inst*> queue;
|
|
queue.push(inst);
|
|
|
|
while (!queue.empty()) {
|
|
// Pop one instruction from the queue
|
|
const Inst* const inst{queue.front()};
|
|
queue.pop();
|
|
if (const std::optional result = pred(inst)) {
|
|
// This is the instruction we were looking for
|
|
return result;
|
|
}
|
|
// Visit the right most arguments first
|
|
for (size_t arg = inst->NumArgs(); arg--;) {
|
|
const Value arg_value{inst->Arg(arg)};
|
|
if (arg_value.IsImmediate()) {
|
|
continue;
|
|
}
|
|
// Queue instruction if it hasn't been visited
|
|
const Inst* const arg_inst{arg_value.InstRecursive()};
|
|
if (std::ranges::find(visited, arg_inst) == visited.end()) {
|
|
visited.push_back(arg_inst);
|
|
queue.push(arg_inst);
|
|
}
|
|
}
|
|
}
|
|
// SSA tree has been traversed and the result hasn't been found
|
|
return std::nullopt;
|
|
}
|
|
|
|
template <typename Pred>
|
|
auto BreadthFirstSearch(const Value& value, Pred&& pred)
|
|
-> std::invoke_result_t<Pred, const Inst*> {
|
|
if (value.IsImmediate()) {
|
|
// Nothing to do with immediates
|
|
return std::nullopt;
|
|
}
|
|
return BreadthFirstSearch(value.InstRecursive(), pred);
|
|
}
|
|
|
|
} // namespace Shader::IR
|