|
| 1 | +// Copyright 2024 The XLS Authors |
| 2 | +// |
| 3 | +// Licensed under the Apache License, Version 2.0 (the "License"); |
| 4 | +// you may not use this file except in compliance with the License. |
| 5 | +// You may obtain a copy of the License at |
| 6 | +// |
| 7 | +// http://www.apache.org/licenses/LICENSE-2.0 |
| 8 | +// |
| 9 | +// Unless required by applicable law or agreed to in writing, software |
| 10 | +// distributed under the License is distributed on an "AS IS" BASIS, |
| 11 | +// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 12 | +// See the License for the specific language governing permissions and |
| 13 | +// limitations under the License. |
| 14 | + |
| 15 | +#include "xls/codegen/register_combining_pass.h" |
| 16 | + |
| 17 | +#include <vector> |
| 18 | + |
| 19 | +#include "absl/algorithm/container.h" |
| 20 | +#include "absl/container/flat_hash_set.h" |
| 21 | +#include "absl/log/check.h" |
| 22 | +#include "absl/status/status.h" |
| 23 | +#include "absl/status/statusor.h" |
| 24 | +#include "absl/types/span.h" |
| 25 | +#include "xls/codegen/codegen_pass.h" |
| 26 | +#include "xls/codegen/register_chaining_analysis.h" |
| 27 | +#include "xls/common/logging/logging.h" |
| 28 | +#include "xls/common/status/ret_check.h" |
| 29 | +#include "xls/common/status/status_macros.h" |
| 30 | +#include "xls/ir/node.h" |
| 31 | +#include "xls/ir/nodes.h" |
| 32 | +#include "xls/ir/register.h" |
| 33 | +#include "xls/passes/pass_base.h" |
| 34 | + |
| 35 | +namespace xls::verilog { |
| 36 | + |
| 37 | +namespace { |
| 38 | +absl::Status CombineRegisters(absl::Span<const RegisterData> mutex_group, |
| 39 | + CodegenPassUnit* unit) { |
| 40 | + XLS_RET_CHECK_GE(mutex_group.size(), 2) |
| 41 | + << "Attempting to combine a single register is not meaningful. Single " |
| 42 | + "element mutex groups should have been filtered out."; |
| 43 | + // Registers are listed so that 'last' one is at the end. |
| 44 | + // The register with a loop-back write (write from a later stage) is always |
| 45 | + // at the front, if one exists. |
| 46 | + // Merge from the front back. |
| 47 | + const RegisterData& first = mutex_group.front(); |
| 48 | + std::vector<Node*> cleanup_nodes; |
| 49 | + absl::flat_hash_set<Register*> cleanup_regs; |
| 50 | + |
| 51 | + // No need to change load-enable bits, we're merging into the top which has |
| 52 | + // the right bits already. |
| 53 | + XLS_VLOG(2) << "Collapsing " << mutex_group.size() << " registers into " |
| 54 | + << mutex_group.front().reg->ToString(); |
| 55 | + for (const RegisterData& merge : mutex_group.subspan(1)) { |
| 56 | + XLS_RETURN_IF_ERROR(merge.read->ReplaceUsesWith(first.read)); |
| 57 | + cleanup_regs.insert(merge.reg); |
| 58 | + cleanup_nodes.push_back(merge.read); |
| 59 | + cleanup_nodes.push_back(merge.write); |
| 60 | + } |
| 61 | + |
| 62 | + // Do cleanup. |
| 63 | + for (auto& stage : unit->streaming_io_and_pipeline.pipeline_registers) { |
| 64 | + std::erase_if(stage, [&](const PipelineRegister& pr) { |
| 65 | + return cleanup_regs.contains(pr.reg); |
| 66 | + }); |
| 67 | + } |
| 68 | + for (auto& state_reg : unit->streaming_io_and_pipeline.state_registers) { |
| 69 | + CHECK(!state_reg || !cleanup_regs.contains(state_reg->reg)) |
| 70 | + << "Removed a state register: " << state_reg->reg->ToString(); |
| 71 | + } |
| 72 | + for (Node* n : cleanup_nodes) { |
| 73 | + XLS_RETURN_IF_ERROR(unit->block->RemoveNode(n)) << "can't remove " << n; |
| 74 | + } |
| 75 | + for (Register* r : cleanup_regs) { |
| 76 | + XLS_RETURN_IF_ERROR(unit->block->RemoveRegister(r)); |
| 77 | + } |
| 78 | + return absl::OkStatus(); |
| 79 | +} |
| 80 | +} // namespace |
| 81 | + |
| 82 | +absl::StatusOr<bool> RegisterCombiningPass::RunInternal( |
| 83 | + CodegenPassUnit* unit, const CodegenPassOptions& options, |
| 84 | + PassResults* results) const { |
| 85 | + if (!unit->concurrent_stages) { |
| 86 | + return false; |
| 87 | + } |
| 88 | + std::vector<RegisterData> candidate_registers; |
| 89 | + candidate_registers.reserve(unit->block->GetRegisters().size()); |
| 90 | + // State registers (but not their valid/reset regs) are candidates for |
| 91 | + // merging. |
| 92 | + XLS_VLOG(2) << unit->block->DumpIr(); |
| 93 | + for (const auto& maybe_reg : |
| 94 | + unit->streaming_io_and_pipeline.state_registers) { |
| 95 | + if (maybe_reg) { |
| 96 | + CHECK(!maybe_reg->next_values.empty()); |
| 97 | + auto write_stage = |
| 98 | + absl::c_min_element(maybe_reg->next_values, [](const auto& l, |
| 99 | + const auto& r) { |
| 100 | + return l.stage < r.stage; |
| 101 | + })->stage; |
| 102 | + if (maybe_reg->read_stage == write_stage) { |
| 103 | + // Immediate back edge. |
| 104 | + continue; |
| 105 | + } |
| 106 | + candidate_registers.push_back({.reg = maybe_reg->reg, |
| 107 | + .read = maybe_reg->reg_read, |
| 108 | + .read_stage = maybe_reg->read_stage, |
| 109 | + .write = maybe_reg->reg_write, |
| 110 | + .write_stage = write_stage}); |
| 111 | + } |
| 112 | + } |
| 113 | + // pipeline registers (but not their valid/reset regs) are candidates for |
| 114 | + // merging. |
| 115 | + for (const auto& stg_regs : |
| 116 | + unit->streaming_io_and_pipeline.pipeline_registers) { |
| 117 | + for (const auto& reg : stg_regs) { |
| 118 | + CHECK(unit->streaming_io_and_pipeline.node_to_stage_map.contains( |
| 119 | + reg.reg_read)) |
| 120 | + << reg.reg_read; |
| 121 | + CHECK(unit->streaming_io_and_pipeline.node_to_stage_map.contains( |
| 122 | + reg.reg_write)) |
| 123 | + << reg.reg_write; |
| 124 | + Stage read_stage = |
| 125 | + unit->streaming_io_and_pipeline.node_to_stage_map.at(reg.reg_read); |
| 126 | + Stage write_stage = |
| 127 | + unit->streaming_io_and_pipeline.node_to_stage_map.at(reg.reg_write); |
| 128 | + CHECK_EQ(write_stage + 1, read_stage) |
| 129 | + << "pipeline register skipping stage? " << reg.reg->ToString() |
| 130 | + << "\nread: " << reg.reg_read << "\nwrite: " << reg.reg_write; |
| 131 | + candidate_registers.push_back({ |
| 132 | + .reg = reg.reg, |
| 133 | + .read = reg.reg_read, |
| 134 | + .read_stage = read_stage, |
| 135 | + .write = reg.reg_write, |
| 136 | + .write_stage = write_stage, |
| 137 | + }); |
| 138 | + } |
| 139 | + } |
| 140 | + // chains of registers which are possibly combinable. |
| 141 | + RegisterChains reg_groups; |
| 142 | + |
| 143 | + for (const RegisterData& rd : candidate_registers) { |
| 144 | + reg_groups.InsertAndReduce(rd); |
| 145 | + } |
| 146 | + XLS_ASSIGN_OR_RETURN( |
| 147 | + std::vector<std::vector<RegisterData>> mutex_chains, |
| 148 | + reg_groups.SplitBetweenMutexRegions(*unit->concurrent_stages, options)); |
| 149 | + bool changed = !mutex_chains.empty(); |
| 150 | + |
| 151 | + for (const std::vector<RegisterData>& group : mutex_chains) { |
| 152 | + XLS_RETURN_IF_ERROR(CombineRegisters(group, unit)); |
| 153 | + } |
| 154 | + |
| 155 | + if (changed) { |
| 156 | + unit->GcMetadata(); |
| 157 | + } |
| 158 | + |
| 159 | + return changed; |
| 160 | +} |
| 161 | + |
| 162 | +} // namespace xls::verilog |
0 commit comments