2012-09-04 18:22:17 +00:00
|
|
|
//===- llvm/Transforms/Utils/BypassSlowDivision.h --------------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// 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 TRANSFORMS_UTILS_BYPASSSLOWDIVISION_H
|
|
|
|
#define TRANSFORMS_UTILS_BYPASSSLOWDIVISION_H
|
|
|
|
|
2012-12-03 16:50:05 +00:00
|
|
|
#include "llvm/ADT/DenseMap.h"
|
2012-09-04 18:22:17 +00:00
|
|
|
#include "llvm/Function.h"
|
|
|
|
|
2012-09-10 11:52:08 +00:00
|
|
|
namespace llvm {
|
|
|
|
|
2012-09-04 18:22:17 +00:00
|
|
|
/// This optimization identifies DIV instructions that can be
|
|
|
|
/// profitably bypassed and carried out with a shorter, faster divide.
|
2012-09-10 11:52:08 +00:00
|
|
|
bool bypassSlowDivision(Function &F,
|
|
|
|
Function::iterator &I,
|
2012-10-04 21:33:40 +00:00
|
|
|
const DenseMap<unsigned int, unsigned int> &BypassWidth);
|
2012-09-10 11:52:08 +00:00
|
|
|
|
|
|
|
} // End llvm namespace
|
2012-09-04 18:22:17 +00:00
|
|
|
|
|
|
|
#endif
|