From: Jakub Staszak Date: Tue, 4 Sep 2012 19:49:17 +0000 (+0000) Subject: Remove unneeded code. X-Git-Url: http://plrg.eecs.uci.edu/git/?a=commitdiff_plain;h=f2d8190b814697ef8e36f9d839c64c60e78760db;p=oota-llvm.git Remove unneeded code. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@163160 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/include/llvm/Transforms/Utils/BypassSlowDivision.h b/include/llvm/Transforms/Utils/BypassSlowDivision.h index 4a9838aa75d..3646d736aba 100644 --- a/include/llvm/Transforms/Utils/BypassSlowDivision.h +++ b/include/llvm/Transforms/Utils/BypassSlowDivision.h @@ -27,32 +27,3 @@ bool bypassSlowDivision(llvm::Function &F, const llvm::DenseMap &BypassTypeMap); #endif -//===- 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 - -#include "llvm/Function.h" - -/// This optimization identifies DIV instructions that can be -/// profitably bypassed and carried out with a shorter, faster divide. -bool bypassSlowDivision(llvm::Function &F, - llvm::Function::iterator &I, - const llvm::DenseMap &BypassTypeMap); - -#endif