SPIRV-Tools/source/opt/loop_fusion_pass.cpp
Toomas Remmelg 1dc2458060 Add a loop fusion pass.
This pass will look for adjacent loops that are compatible and legal to
be fused.

Loops are compatible if:

- they both have one induction variable
- they have the same upper and lower bounds
    - same initial value
    - same condition
- they have the same update step
- they are adjacent
- there are no break/continue in either of them

Fusion is legal if:

- fused loops do not have any dependencies with dependence distance
  greater than 0 that did not exist in the original loops.
- there are no function calls in the loops (could have side-effects)
- there are no barriers in the loops

It will fuse all such loops as long as the number of registers used for
the fused loop stays under the threshold defined by
max_registers_per_loop.
2018-05-01 15:40:37 -04:00

71 lines
2.2 KiB
C++

// Copyright (c) 2018 Google LLC.
//
// 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 "opt/loop_fusion_pass.h"
#include "opt/ir_context.h"
#include "opt/loop_descriptor.h"
#include "opt/loop_fusion.h"
#include "opt/register_pressure.h"
namespace spvtools {
namespace opt {
Pass::Status LoopFusionPass::Process(ir::IRContext* c) {
bool modified = false;
ir::Module* module = c->module();
// Process each function in the module
for (ir::Function& f : *module) {
modified |= ProcessFunction(&f);
}
return modified ? Status::SuccessWithChange : Status::SuccessWithoutChange;
}
bool LoopFusionPass::ProcessFunction(ir::Function* function) {
auto c = function->context();
ir::LoopDescriptor& ld = *c->GetLoopDescriptor(function);
// If a loop doesn't have a preheader needs then it needs to be created. Make
// sure to return Status::SuccessWithChange in that case.
auto modified = ld.CreatePreHeaderBlocksIfMissing();
// TODO(tremmelg): Could the only loop that |loop| could possibly be fused be
// picked out so don't have to check every loop
for (auto& loop_0 : ld) {
for (auto& loop_1 : ld) {
LoopFusion fusion(c, &loop_0, &loop_1);
if (fusion.AreCompatible() && fusion.IsLegal()) {
RegisterLiveness liveness(c, function);
RegisterLiveness::RegionRegisterLiveness reg_pressure{};
liveness.SimulateFusion(loop_0, loop_1, &reg_pressure);
if (reg_pressure.used_registers_ <= max_registers_per_loop_) {
fusion.Fuse();
// Recurse, as the current iterators will have been invalidated.
ProcessFunction(function);
return true;
}
}
}
}
return modified;
}
} // namespace opt
} // namespace spvtools