mirror of
https://github.com/Toastconcern/FrameStudio.git
synced 2026-10-29 04:02:56 +01:00
ToastconcernandClaude Opus 5.5
6d0b4fcd2f
Frame Studio - Gaussian splats (PLY, SPZ v2-v4), PLY vertex colours, panorama skies - Copy, cut, paste and duplicate for objects, splats and world items - Walkable-area rebake moved off the UI thread; viewport one frame sooner; refresh-locked pacing (FS_PACE=timer for the old one) - Fixed: bundle thumbnail use-after-free crash, auto-save deleting environments, saves into scratch copies, edits lost on non-ASCII paths, unopenable manifests with inf/nan, bundle save data loss, opening a home marking it changed, gizmo NaN, long paths, many malformed-file crashes - Updater verifies sha256, journals the swap and never leaves the exe missing Frame Home - Seats turn you to face their way - Draw batching (Hand Tutorials up to ~20% less GPU time), cut-out EQUAL pass, late head-pose read before submit - Proper queue-family hand-over to the compositor layer; layer descriptor generations and seqlocked slots; structural SPIR-V check - Fixed: hangs/crashes on damaged .fenv files and shaders, render-pass validation error, sync hazard in the foveation smoothing pass, unverified update downloads, half-done installs Tests: tests_loco/env_share/spv_check wired into CMake (FRAME_TESTS) and CI. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01VsaXGU27gsrXjDoFtyFJP9
63 lines
2.0 KiB
C++
63 lines
2.0 KiB
C++
// Copyright (c) 2017 Google Inc.
|
|
//
|
|
// 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 "source/opt/redundancy_elimination.h"
|
|
|
|
#include "source/opt/value_number_table.h"
|
|
|
|
namespace spvtools {
|
|
namespace opt {
|
|
|
|
Pass::Status RedundancyEliminationPass::Process() {
|
|
bool modified = false;
|
|
ValueNumberTable vnTable(context());
|
|
|
|
for (auto& func : *get_module()) {
|
|
if (func.IsDeclaration()) {
|
|
continue;
|
|
}
|
|
|
|
// Build the dominator tree for this function. It is how the code is
|
|
// traversed.
|
|
DominatorTree& dom_tree =
|
|
context()->GetDominatorAnalysis(&func)->GetDomTree();
|
|
|
|
if (EliminateRedundanciesFrom(dom_tree.GetRoot(), vnTable)) {
|
|
modified = true;
|
|
}
|
|
}
|
|
return (modified ? Status::SuccessWithChange : Status::SuccessWithoutChange);
|
|
}
|
|
|
|
bool RedundancyEliminationPass::EliminateRedundanciesFrom(
|
|
DominatorTreeNode* bb, const ValueNumberTable& vnTable) {
|
|
struct State {
|
|
DominatorTreeNode* node;
|
|
std::map<uint32_t, uint32_t> value_to_id_map;
|
|
};
|
|
std::vector<State> todo;
|
|
todo.push_back({bb, std::map<uint32_t, uint32_t>()});
|
|
bool modified = false;
|
|
for (size_t next_node = 0; next_node < todo.size(); next_node++) {
|
|
modified |= EliminateRedundanciesInBB(todo[next_node].node->bb_, vnTable,
|
|
&todo[next_node].value_to_id_map);
|
|
for (DominatorTreeNode* child : todo[next_node].node->children_) {
|
|
todo.push_back({child, todo[next_node].value_to_id_map});
|
|
}
|
|
}
|
|
return modified;
|
|
}
|
|
} // namespace opt
|
|
} // namespace spvtools
|