mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-21 20:12:56 +02:00
5b13afc1d2
Reappy r284044 after revert in r284051. Krzysztof fixed the error in r284049.
The original summary:
This patch tries to fully unroll loops having break statement like this
for (int i = 0; i < 8; i++) {
if (a[i] == value) {
found = true;
break;
}
}
GCC can fully unroll such loops, but currently LLVM cannot because LLVM only
supports loops having exact constant trip counts.
The upper bound of the trip count can be obtained from calling
ScalarEvolution::getMaxBackedgeTakenCount(). Part of the patch is the
refactoring work in SCEV to prevent duplicating code.
The feature of using the upper bound is enabled under the same circumstance
when runtime unrolling is enabled since both are used to unroll loops without
knowing the exact constant trip count.
llvm-svn: 284053
31 lines
957 B
C++
31 lines
957 B
C++
//===- LoopUnrollPass.h -----------------------------------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_TRANSFORMS_SCALAR_LOOPUNROLLPASS_H
|
|
#define LLVM_TRANSFORMS_SCALAR_LOOPUNROLLPASS_H
|
|
|
|
#include "llvm/Analysis/LoopInfo.h"
|
|
#include "llvm/Analysis/LoopPassManager.h"
|
|
#include "llvm/IR/PassManager.h"
|
|
|
|
namespace llvm {
|
|
|
|
struct LoopUnrollPass : public PassInfoMixin<LoopUnrollPass> {
|
|
Optional<unsigned> ProvidedCount;
|
|
Optional<unsigned> ProvidedThreshold;
|
|
Optional<bool> ProvidedAllowPartial;
|
|
Optional<bool> ProvidedRuntime;
|
|
Optional<bool> ProvidedUpperBound;
|
|
|
|
PreservedAnalyses run(Loop &L, LoopAnalysisManager &AM);
|
|
};
|
|
} // end namespace llvm
|
|
|
|
#endif // LLVM_TRANSFORMS_SCALAR_LOOPUNROLLPASS_H
|