mirror of
https://github.com/RPCS3/llvm.git
synced 2026-01-31 01:25:19 +01:00
6b547686c5
to reflect the new license. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@351636 91177308-0d34-0410-b5e6-96231b3b80d8
41 lines
1.5 KiB
C++
41 lines
1.5 KiB
C++
//===- LoopRotationUtils.h - Utilities to perform loop rotation -*- 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file provides utilities to convert a loop into a loop with bottom test.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_TRANSFORMS_UTILS_LOOPROTATIONUTILS_H
|
|
#define LLVM_TRANSFORMS_UTILS_LOOPROTATIONUTILS_H
|
|
|
|
namespace llvm {
|
|
|
|
class AssumptionCache;
|
|
class DominatorTree;
|
|
class Loop;
|
|
class LoopInfo;
|
|
class MemorySSAUpdater;
|
|
class ScalarEvolution;
|
|
struct SimplifyQuery;
|
|
class TargetTransformInfo;
|
|
|
|
/// Convert a loop into a loop with bottom test. It may
|
|
/// perform loop latch simplication as well if the flag RotationOnly
|
|
/// is false. The flag Threshold represents the size threshold of the loop
|
|
/// header. If the loop header's size exceeds the threshold, the loop rotation
|
|
/// will give up. The flag IsUtilMode controls the heuristic used in the
|
|
/// LoopRotation. If it is true, the profitability heuristic will be ignored.
|
|
bool LoopRotation(Loop *L, LoopInfo *LI, const TargetTransformInfo *TTI,
|
|
AssumptionCache *AC, DominatorTree *DT, ScalarEvolution *SE,
|
|
MemorySSAUpdater *MSSAU, const SimplifyQuery &SQ,
|
|
bool RotationOnly, unsigned Threshold, bool IsUtilMode);
|
|
|
|
} // namespace llvm
|
|
|
|
#endif
|