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: BypassSlowDivision.h

//===- llvm/Transforms/Utils/BypassSlowDivision.h ---------------*- 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 contains an optimization for div and rem on architectures that
// execute short instructions significantly faster than longer instructions.
// For example, on Intel Atom 32-bit divides are slow enough that during
// runtime it is profitable to check the value of the operands, and if they are
// positive and less than 256 use an unsigned 8-bit divide.
//
//===----------------------------------------------------------------------===//

#ifndef LLVM_TRANSFORMS_UTILS_BYPASSSLOWDIVISION_H
#define LLVM_TRANSFORMS_UTILS_BYPASSSLOWDIVISION_H

#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/DenseMapInfo.h"
#include "llvm/IR/ValueHandle.h"
#include <cstdint>

namespace llvm {

class BasicBlock;
class Value;

struct DivRemMapKey {
  bool SignedOp;
  AssertingVH<Value> Dividend;
  AssertingVH<Value> Divisor;

DivRemMapKey() = default;

DivRemMapKey(bool InSignedOp, Value *InDividend, Value *InDivisor)
      : SignedOp(InSignedOp), Dividend(InDividend), Divisor(InDivisor) {}
};

template <> struct DenseMapInfo<DivRemMapKey> {
  static bool isEqual(const DivRemMapKey &Val1, const DivRemMapKey &Val2) {
    return Val1.SignedOp == Val2.SignedOp && Val1.Dividend == Val2.Dividend &&
           Val1.Divisor == Val2.Divisor;
  }

static DivRemMapKey getEmptyKey() {
    return DivRemMapKey(false, nullptr, nullptr);
  }

static DivRemMapKey getTombstoneKey() {
    return DivRemMapKey(true, nullptr, nullptr);
  }

static unsigned getHashValue(const DivRemMapKey &Val) {
    return (unsigned)(reinterpret_cast<uintptr_t>(
                          static_cast<Value *>(Val.Dividend)) ^
                      reinterpret_cast<uintptr_t>(
                          static_cast<Value *>(Val.Divisor))) ^
           (unsigned)Val.SignedOp;
  }
};

/// This optimization identifies DIV instructions in a BB that can be
/// profitably bypassed and carried out with a shorter, faster divide.
///
/// This optimization may add basic blocks immediately after BB; for obvious
/// reasons, you shouldn't pass those blocks to bypassSlowDivision.
bool bypassSlowDivision(
    BasicBlock *BB, const DenseMap<unsigned int, unsigned int> &BypassWidth);

} // end namespace llvm

#endif // LLVM_TRANSFORMS_UTILS_BYPASSSLOWDIVISION_H

003 File Manager

Editing: BypassSlowDivision.h

Upload File

Create Folder