blob: 201717d91597c0e81af5ba1191f1e7c0edc64fb0 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
#pragma once
#ifdef __GNUC__
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-parameter"
#endif
//===------- 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
#ifdef __GNUC__
#pragma GCC diagnostic pop
#endif
|
