File Manager

003 File Manager

Current Path: /usr/src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils

usr / src / contrib / llvm-project / llvm / include / llvm / Transforms / Utils /

📁 ..
📄 AMDGPUEmitPrintf.h(864 B)
📄 ASanStackFrameLayout.h(3.51 KB)
📄 AddDiscriminators.h(1.04 KB)
📄 AssumeBundleBuilder.h(2.29 KB)
📄 BasicBlockUtils.h(20.81 KB)
📄 BreakCriticalEdges.h(1.16 KB)
📄 BuildLibCalls.h(9.67 KB)
📄 BypassSlowDivision.h(2.55 KB)
📄 CallGraphUpdater.h(3.84 KB)
📄 CallPromotionUtils.h(3.41 KB)
📄 CanonicalizeAliases.h(998 B)
📄 CanonicalizeFreezeInLoops.h(1.15 KB)
📄 Cloning.h(12.34 KB)
📄 CodeExtractor.h(9.58 KB)
📄 CodeMoverUtils.h(2.85 KB)
📄 CtorUtils.h(1021 B)
📄 Debugify.h(3.36 KB)
📄 EntryExitInstrumenter.h(1.16 KB)
📄 EscapeEnumerator.h(1.56 KB)
📄 Evaluator.h(4.69 KB)
📄 FunctionComparator.h(17.12 KB)
📄 FunctionImportUtils.h(5.73 KB)
📄 GlobalStatus.h(2.97 KB)
📄 GuardUtils.h(1.92 KB)
📄 ImportedFunctionsInliningStatistics.h(4.35 KB)
📄 InjectTLIMappings.h(1.27 KB)
📄 IntegerDivision.h(2.88 KB)
📄 LCSSA.h(1.56 KB)
📄 LibCallsShrinkWrap.h(908 B)
📄 Local.h(24.77 KB)
📄 LoopRotationUtils.h(1.54 KB)
📄 LoopSimplify.h(2.85 KB)
📄 LoopUtils.h(21.25 KB)
📄 LoopVersioning.h(5.87 KB)
📄 LowerInvoke.h(1.08 KB)
📄 LowerMemIntrinsics.h(2.14 KB)
📄 Mem2Reg.h(921 B)
📄 MisExpect.h(1.81 KB)
📄 ModuleUtils.h(5.04 KB)
📄 NameAnonGlobals.h(1.03 KB)
📄 PredicateInfo.h(7.76 KB)
📄 PromoteMemToReg.h(1.57 KB)
📄 SSAUpdater.h(6.12 KB)
📄 SSAUpdaterBulk.h(3.18 KB)
📄 SSAUpdaterImpl.h(15.75 KB)
📄 SanitizerStats.h(1.53 KB)
📄 ScalarEvolutionExpander.h(17.87 KB)
📄 SimplifyIndVar.h(2.12 KB)
📄 SimplifyLibCalls.h(10.85 KB)
📄 SizeOpts.h(4.84 KB)
📄 SplitModule.h(1.53 KB)
📄 SymbolRewriter.h(5.02 KB)
📄 UnifyFunctionExitNodes.h(1.83 KB)
📄 UniqueInternalLinkageNames.h(1.07 KB)
📄 UnrollLoop.h(6.05 KB)
📄 VNCoercion.h(4.99 KB)
📄 ValueMapper.h(11.67 KB)

Editing: LoopSimplify.h

//===- LoopSimplify.h - Loop Canonicalization Pass --------------*- 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 pass performs several transformations to transform natural loops into a
// simpler form, which makes subsequent analyses and transformations simpler and
// more effective.
//
// Loop pre-header insertion guarantees that there is a single, non-critical
// entry edge from outside of the loop to the loop header.  This simplifies a
// number of analyses and transformations, such as LICM.
//
// Loop exit-block insertion guarantees that all exit blocks from the loop
// (blocks which are outside of the loop that have predecessors inside of the
// loop) only have predecessors from inside of the loop (and are thus dominated
// by the loop header).  This simplifies transformations such as store-sinking
// that are built into LICM.
//
// This pass also guarantees that loops will have exactly one backedge.
//
// Indirectbr instructions introduce several complications. If the loop
// contains or is entered by an indirectbr instruction, it may not be possible
// to transform the loop and make these guarantees. Client code should check
// that these conditions are true before relying on them.
//
// Note that the simplifycfg pass will clean up blocks which are split out but
// end up being unnecessary, so usage of this pass should not pessimize
// generated code.
//
// This pass obviously modifies the CFG, but updates loop information and
// dominator information.
//
//===----------------------------------------------------------------------===//
#ifndef LLVM_TRANSFORMS_UTILS_LOOPSIMPLIFY_H
#define LLVM_TRANSFORMS_UTILS_LOOPSIMPLIFY_H

#include "llvm/IR/PassManager.h"

namespace llvm {

class AssumptionCache;
class DominatorTree;
class Loop;
class LoopInfo;
class MemorySSAUpdater;
class ScalarEvolution;

/// This pass is responsible for loop canonicalization.
class LoopSimplifyPass : public PassInfoMixin<LoopSimplifyPass> {
public:
  PreservedAnalyses run(Function &F, FunctionAnalysisManager &AM);
};

/// Simplify each loop in a loop nest recursively.
///
/// This takes a potentially un-simplified loop L (and its children) and turns
/// it into a simplified loop nest with preheaders and single backedges. It will
/// update \c DominatorTree, \c LoopInfo, \c ScalarEvolution and \c MemorySSA
/// analyses if they're non-null, and LCSSA if \c PreserveLCSSA is true.
bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, ScalarEvolution *SE,
                  AssumptionCache *AC, MemorySSAUpdater *MSSAU,
                  bool PreserveLCSSA);

} // end namespace llvm

#endif // LLVM_TRANSFORMS_UTILS_LOOPSIMPLIFY_H

003 File Manager

Editing: LoopSimplify.h

Upload File

Create Folder