6024e5c395
clang 20.0.0 (based on r547379) from build 12806354. Bug: http://b/379133546 Test: N/A Change-Id: I2eb8938af55d809de674be63cb30cf27e801862b Upstream-Commit: ad834e67b1105d15ef907f6255d4c96e8e733f57
43 lines
1.5 KiB
C++
43 lines
1.5 KiB
C++
//===------- LoopBoundSplit.h - Split Loop Bound ----------------*- C++ -*-===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_TRANSFORMS_SCALAR_LOOPBOUNDSPLIT_H
|
|
#define LLVM_TRANSFORMS_SCALAR_LOOPBOUNDSPLIT_H
|
|
|
|
#include "llvm/Analysis/LoopAnalysisManager.h"
|
|
#include "llvm/IR/PassManager.h"
|
|
|
|
namespace llvm {
|
|
class LPMUpdater;
|
|
class Loop;
|
|
|
|
/// This pass transforms loops that contain a conditional branch with induction
|
|
/// variable. For example, it transforms left code to right code:
|
|
///
|
|
/// newbound = min(n, c)
|
|
/// while (iv < n) { while(iv < newbound) {
|
|
/// A A
|
|
/// if (iv < c) B
|
|
/// B C
|
|
/// C }
|
|
/// if (iv != n) {
|
|
/// while (iv < n) {
|
|
/// A
|
|
/// C
|
|
/// }
|
|
/// }
|
|
class LoopBoundSplitPass : public PassInfoMixin<LoopBoundSplitPass> {
|
|
public:
|
|
PreservedAnalyses run(Loop &L, LoopAnalysisManager &AM,
|
|
LoopStandardAnalysisResults &AR, LPMUpdater &U);
|
|
};
|
|
|
|
} // end namespace llvm
|
|
|
|
#endif // LLVM_TRANSFORMS_SCALAR_LOOPBOUNDSPLIT_H
|