scene/tables/connections.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // SPDX-License-Identifier: BSD-3-Clause | ||
| 2 | #include "chrono_batch_render/scene/tables/connections.h" | ||
| 3 | |||
| 4 | #include <algorithm> | ||
| 5 | #include <cstddef> | ||
| 6 | |||
| 7 | #include "chrono_batch_render/scene/schema/columns.h" | ||
| 8 | #include "chrono_batch_render/stage/publish/change_set.h" | ||
| 9 | #include "chrono_batch_render/stage/structure/structure.h" | ||
| 10 | #include "chrono_batch_render/util/profiler.h" | ||
| 11 | #include "chrono_batch_render/util/span.h" | ||
| 12 | |||
| 13 | namespace chrono::batch_render { | ||
| 14 | |||
| 15 | 789 | void ConnectionCache::Update(const ChangeSet& changes) { | |
| 16 | 789 | CHRONO_BATCH_RENDER_ZONE("Connections/Update"); | |
| 17 | 789 | const Prims& prims = m_structure.GetPrims(); | |
| 18 | 1627 | const auto accepted = [&](uint32_t prim) { | |
| 19 | 838 | return std::ranges::any_of( | |
| 20 | 1952 | m_schemas, [&](SchemaId schema) { return IsA(prims.Record(prim).schema, schema); }); | |
| 21 | 789 | }; | |
| 22 | 241 | if (!changes.resync && changes.added.empty() && changes.removed.empty() && | |
| 23 | 829 | changes.apis.empty() && m_connections.size() == prims.Size()) { | |
| 24 | 29 | std::vector<uint32_t> owners; | |
| 25 | 29 | bool known = true; | |
| 26 | 87 | for (const ColumnRef column : | |
| 27 | {kConnectableConnectionsSources, kConnectableConnectionsInputs, | ||
| 28 | 116 | kConnectableConnectionsOutputs}) { | |
| 29 | 159 | for (const uint32_t row : changes.ArrayRows(column)) { | |
| 30 | 72 | const uint32_t prim = row < m_rowPrims.size() ? m_rowPrims[row] : kNoPrim; | |
| 31 | 72 | known = known && prim != kNoPrim; | |
| 32 | 108 | if (prim != kNoPrim && accepted(prim) && | |
| 33 | 72 | std::ranges::find(owners, prim) == owners.end()) { | |
| 34 | 12 | owners.push_back(prim); | |
| 35 | } | ||
| 36 | } | ||
| 37 | } | ||
| 38 | 29 | if (known) { | |
| 39 | 29 | Read(owners); | |
| 40 | 29 | return; | |
| 41 | } | ||
| 42 | 29 | } | |
| 43 | 760 | std::vector<uint32_t> owners; | |
| 44 | 760 | m_rowPrims.clear(); | |
| 45 | 14086 | for (uint32_t prim = 0; prim < prims.Size(); ++prim) { | |
| 46 | 13326 | if (!prims.Alive(prim) || !IsA(prims.Record(prim).schema, SchemaId::Connectable)) { | |
| 47 | 12560 | continue; | |
| 48 | } | ||
| 49 | 766 | const uint32_t row = prims.Row(prim, SchemaId::Connectable); | |
| 50 | 766 | if (row >= m_rowPrims.size()) { | |
| 51 | 766 | m_rowPrims.resize(row + 1, kNoPrim); | |
| 52 | } | ||
| 53 | 766 | m_rowPrims[row] = prim; | |
| 54 | 766 | if (accepted(prim)) { | |
| 55 | 565 | owners.push_back(prim); | |
| 56 | } | ||
| 57 | } | ||
| 58 | 760 | m_connections.assign(prims.Size(), {}); | |
| 59 | 760 | Read(owners); | |
| 60 | 789 | } | |
| 61 | |||
| 62 | 789 | void ConnectionCache::Read(std::span<const uint32_t> owners) { | |
| 63 | 789 | const Prims& prims = m_structure.GetPrims(); | |
| 64 | 789 | ColumnStore& store = m_structure.GetColumnStore(); | |
| 65 | 789 | std::vector<ArrayRef> sources; | |
| 66 | 789 | std::vector<ArrayRef> tokens; | |
| 67 | 1366 | for (const uint32_t prim : owners) { | |
| 68 | 577 | const uint32_t row = prims.Row(prim, SchemaId::Connectable); | |
| 69 | 577 | sources.push_back(store.Array(kConnectableConnectionsSources, row)); | |
| 70 | 1154 | tokens.push_back(store.Array(kConnectableConnectionsInputs, row)); | |
| 71 | } | ||
| 72 | 1366 | for (const uint32_t prim : owners) { | |
| 73 | 1154 | tokens.push_back( | |
| 74 | 1154 | store.Array(kConnectableConnectionsOutputs, prims.Row(prim, SchemaId::Connectable))); | |
| 75 | } | ||
| 76 | 789 | const std::vector<std::vector<std::byte>> sourceBytes = | |
| 77 | 789 | store.Arrays(ColumnType::PrimArray).Read(sources); | |
| 78 | 789 | const std::vector<std::vector<std::byte>> tokenBytes = | |
| 79 | 789 | store.Arrays(ColumnType::TokenArray).Read(tokens); | |
| 80 | 789 | const Tokens& text = m_structure.GetTokens(); | |
| 81 | 1366 | for (size_t k = 0; k < owners.size(); ++k) { | |
| 82 | 577 | const std::vector<uint32_t> from = Items<uint32_t>(sourceBytes[k]); | |
| 83 | 577 | const std::vector<uint32_t> to = Items<uint32_t>(tokenBytes[k]); | |
| 84 | 577 | const std::vector<uint32_t> out = Items<uint32_t>(tokenBytes[owners.size() + k]); | |
| 85 | 577 | std::vector<Connection>& connections = m_connections[owners[k]]; | |
| 86 | 577 | connections.clear(); | |
| 87 | 577 | const size_t count = std::min({from.size(), to.size(), out.size()}); | |
| 88 | 996 | for (size_t i = 0; i < count; ++i) { | |
| 89 | 419 | const uint32_t source = from[i] != kNoPrim && prims.Alive(from[i]) ? from[i] : kNoPrim; | |
| 90 | 838 | connections.push_back({text.Text(Token{to[i]}), source, text.Text(Token{out[i]})}); | |
| 91 | } | ||
| 92 | 577 | } | |
| 93 | 789 | } | |
| 94 | |||
| 95 | } | ||
| 96 |