//===- 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 { … }; template <> struct DenseMapInfo<DivRemMapKey> { … }; /// 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