#include "llvm/Pass.h"
#include "llvm/ADT/hash_map"
#include "llvm/ADT/Statistic.h"
+#include "llvm/Config/config.h"
#include "llvm/Support/Debug.h"
#include "llvm/Target/TargetData.h"
#include "llvm/Transforms/IPO.h"
-#include <iostream>
using namespace llvm;
namespace {
class LibCallOptimization;
class SimplifyLibCalls;
-/// This hash map is populated by the constructor for LibCallOptimization class.
+/// This list is populated by the constructor for LibCallOptimization class.
/// Therefore all subclasses are registered here at static initialization time
/// and this list is what the SimplifyLibCalls pass uses to apply the individual
/// optimizations to the call sites.
/// @brief The list of optimizations deriving from LibCallOptimization
-static hash_map<std::string,LibCallOptimization*> optlist;
+static LibCallOptimization *OptList = 0;
/// This class is the abstract base class for the set of optimizations that
/// corresponds to one library call. The SimplifyLibCalls pass will call the
/// generally short-circuit actually calling the function if there's a simpler
/// way (e.g. strlen(X) can be reduced to a constant if X is a constant global).
/// @brief Base class for library call optimizations
-class LibCallOptimization
-{
+class LibCallOptimization {
+ LibCallOptimization **Prev, *Next;
+ const char *FunctionName; ///< Name of the library call we optimize
+#ifndef NDEBUG
+ Statistic<> occurrences; ///< debug statistic (-debug-only=simplify-libcalls)
+#endif
public:
/// The \p fname argument must be the name of the library function being
/// optimized by the subclass.
/// @brief Constructor that registers the optimization.
- LibCallOptimization(const char* fname, const char* description )
- : func_name(fname)
+ LibCallOptimization(const char *FName, const char *Description)
+ : FunctionName(FName)
#ifndef NDEBUG
- , occurrences("simplify-libcalls",description)
+ , occurrences("simplify-libcalls", Description)
#endif
{
- // Register this call optimizer in the optlist (a hash_map)
- optlist[fname] = this;
+ // Register this optimizer in the list of optimizations.
+ Next = OptList;
+ OptList = this;
+ Prev = &OptList;
+ if (Next) Next->Prev = &Next;
}
+
+ /// getNext - All libcall optimizations are chained together into a list,
+ /// return the next one in the list.
+ LibCallOptimization *getNext() { return Next; }
/// @brief Deregister from the optlist
- virtual ~LibCallOptimization() { optlist.erase(func_name); }
+ virtual ~LibCallOptimization() {
+ *Prev = Next;
+ if (Next) Next->Prev = Prev;
+ }
/// The implementation of this function in subclasses should determine if
/// \p F is suitable for the optimization. This method is called by
) = 0;
/// @brief Get the name of the library call being optimized
- const char * getFunctionName() const { return func_name; }
+ const char *getFunctionName() const { return FunctionName; }
-#ifndef NDEBUG
/// @brief Called by SimplifyLibCalls to update the occurrences statistic.
- void succeeded() { DEBUG(++occurrences); }
-#endif
-
-private:
- const char* func_name; ///< Name of the library call we optimize
+ void succeeded() {
#ifndef NDEBUG
- Statistic<> occurrences; ///< debug statistic (-debug-only=simplify-libcalls)
+ DEBUG(++occurrences);
#endif
+ }
};
/// This class is an LLVM Pass that applies each of the LibCallOptimization
/// validate the call (ValidateLibraryCall). If it is validated, then
/// the OptimizeCall method is also called.
/// @brief A ModulePass for optimizing well-known function calls.
-class SimplifyLibCalls : public ModulePass
-{
+class SimplifyLibCalls : public ModulePass {
public:
/// We need some target data for accurate signature details that are
/// target dependent. So we require target data in our AnalysisUsage.
/// @brief Require TargetData from AnalysisUsage.
- virtual void getAnalysisUsage(AnalysisUsage& Info) const
- {
+ virtual void getAnalysisUsage(AnalysisUsage& Info) const {
// Ask that the TargetData analysis be performed before us so we can use
// the target data.
Info.addRequired<TargetData>();
/// For this pass, process all of the function calls in the module, calling
/// ValidateLibraryCall and OptimizeCall as appropriate.
/// @brief Run all the lib call optimizations on a Module.
- virtual bool runOnModule(Module &M)
- {
+ virtual bool runOnModule(Module &M) {
reset(M);
bool result = false;
+ hash_map<std::string, LibCallOptimization*> OptznMap;
+ for (LibCallOptimization *Optzn = OptList; Optzn; Optzn = Optzn->getNext())
+ OptznMap[Optzn->getFunctionName()] = Optzn;
// The call optimizations can be recursive. That is, the optimization might
// generate a call to another function which can also be optimized. This way
// handle. It also means we need to keep running over the function calls in
// the module until we don't get any more optimizations possible.
bool found_optimization = false;
- do
- {
+ do {
found_optimization = false;
- for (Module::iterator FI = M.begin(), FE = M.end(); FI != FE; ++FI)
- {
+ for (Module::iterator FI = M.begin(), FE = M.end(); FI != FE; ++FI) {
// All the "well-known" functions are external and have external linkage
// because they live in a runtime library somewhere and were (probably)
// not compiled by LLVM. So, we only act on external functions that
- // have external linkage and non-empty uses.
- if (!FI->isExternal() || !FI->hasExternalLinkage() || FI->use_empty())
+ // have external or dllimport linkage and non-empty uses.
+ if (!FI->isExternal() ||
+ !(FI->hasExternalLinkage() || FI->hasDLLImportLinkage()) ||
+ FI->use_empty())
continue;
// Get the optimization class that pertains to this function
- LibCallOptimization* CO = optlist[FI->getName().c_str()];
- if (!CO)
- continue;
+ hash_map<std::string, LibCallOptimization*>::iterator OMI =
+ OptznMap.find(FI->getName());
+ if (OMI == OptznMap.end()) continue;
+
+ LibCallOptimization *CO = OMI->second;
// Make sure the called function is suitable for the optimization
- if (!CO->ValidateCalledFunction(FI,*this))
+ if (!CO->ValidateCalledFunction(FI, *this))
continue;
// Loop over each of the uses of the function
for (Value::use_iterator UI = FI->use_begin(), UE = FI->use_end();
- UI != UE ; )
- {
+ UI != UE ; ) {
// If the use of the function is a call instruction
- if (CallInst* CI = dyn_cast<CallInst>(*UI++))
- {
+ if (CallInst* CI = dyn_cast<CallInst>(*UI++)) {
// Do the optimization on the LibCallOptimization.
- if (CO->OptimizeCall(CI,*this))
- {
+ if (CO->OptimizeCall(CI, *this)) {
++SimplifiedLibCalls;
found_optimization = result = true;
-#ifndef NDEBUG
CO->succeeded();
-#endif
}
}
}
}
} while (found_optimization);
+
return result;
}
/// @brief Return the size_t type -- syntactic shortcut
const Type* getIntPtrType() const { return TD->getIntPtrType(); }
+ /// @brief Return a Function* for the putchar libcall
+ Function* get_putchar() {
+ if (!putchar_func)
+ putchar_func = M->getOrInsertFunction("putchar", Type::IntTy, Type::IntTy,
+ NULL);
+ return putchar_func;
+ }
+
+ /// @brief Return a Function* for the puts libcall
+ Function* get_puts() {
+ if (!puts_func)
+ puts_func = M->getOrInsertFunction("puts", Type::IntTy,
+ PointerType::get(Type::SByteTy),
+ NULL);
+ return puts_func;
+ }
+
/// @brief Return a Function* for the fputc libcall
- Function* get_fputc(const Type* FILEptr_type)
- {
+ Function* get_fputc(const Type* FILEptr_type) {
if (!fputc_func)
- {
- std::vector<const Type*> args;
- args.push_back(Type::IntTy);
- args.push_back(FILEptr_type);
- FunctionType* fputc_type =
- FunctionType::get(Type::IntTy, args, false);
- fputc_func = M->getOrInsertFunction("fputc",fputc_type);
- }
+ fputc_func = M->getOrInsertFunction("fputc", Type::IntTy, Type::IntTy,
+ FILEptr_type, NULL);
return fputc_func;
}
+ /// @brief Return a Function* for the fputs libcall
+ Function* get_fputs(const Type* FILEptr_type) {
+ if (!fputs_func)
+ fputs_func = M->getOrInsertFunction("fputs", Type::IntTy,
+ PointerType::get(Type::SByteTy),
+ FILEptr_type, NULL);
+ return fputs_func;
+ }
+
/// @brief Return a Function* for the fwrite libcall
- Function* get_fwrite(const Type* FILEptr_type)
- {
+ Function* get_fwrite(const Type* FILEptr_type) {
if (!fwrite_func)
- {
- std::vector<const Type*> args;
- args.push_back(PointerType::get(Type::SByteTy));
- args.push_back(TD->getIntPtrType());
- args.push_back(TD->getIntPtrType());
- args.push_back(FILEptr_type);
- FunctionType* fwrite_type =
- FunctionType::get(TD->getIntPtrType(), args, false);
- fwrite_func = M->getOrInsertFunction("fwrite",fwrite_type);
- }
+ fwrite_func = M->getOrInsertFunction("fwrite", TD->getIntPtrType(),
+ PointerType::get(Type::SByteTy),
+ TD->getIntPtrType(),
+ TD->getIntPtrType(),
+ FILEptr_type, NULL);
return fwrite_func;
}
/// @brief Return a Function* for the sqrt libcall
- Function* get_sqrt()
- {
+ Function* get_sqrt() {
if (!sqrt_func)
- {
- std::vector<const Type*> args;
- args.push_back(Type::DoubleTy);
- FunctionType* sqrt_type =
- FunctionType::get(Type::DoubleTy, args, false);
- sqrt_func = M->getOrInsertFunction("sqrt",sqrt_type);
- }
+ sqrt_func = M->getOrInsertFunction("sqrt", Type::DoubleTy,
+ Type::DoubleTy, NULL);
return sqrt_func;
}
/// @brief Return a Function* for the strlen libcall
- Function* get_strcpy()
- {
+ Function* get_strcpy() {
if (!strcpy_func)
- {
- std::vector<const Type*> args;
- args.push_back(PointerType::get(Type::SByteTy));
- args.push_back(PointerType::get(Type::SByteTy));
- FunctionType* strcpy_type =
- FunctionType::get(PointerType::get(Type::SByteTy), args, false);
- strcpy_func = M->getOrInsertFunction("strcpy",strcpy_type);
- }
+ strcpy_func = M->getOrInsertFunction("strcpy",
+ PointerType::get(Type::SByteTy),
+ PointerType::get(Type::SByteTy),
+ PointerType::get(Type::SByteTy),
+ NULL);
return strcpy_func;
}
/// @brief Return a Function* for the strlen libcall
- Function* get_strlen()
- {
+ Function* get_strlen() {
if (!strlen_func)
- {
- std::vector<const Type*> args;
- args.push_back(PointerType::get(Type::SByteTy));
- FunctionType* strlen_type =
- FunctionType::get(TD->getIntPtrType(), args, false);
- strlen_func = M->getOrInsertFunction("strlen",strlen_type);
- }
+ strlen_func = M->getOrInsertFunction("strlen", TD->getIntPtrType(),
+ PointerType::get(Type::SByteTy),
+ NULL);
return strlen_func;
}
/// @brief Return a Function* for the memchr libcall
- Function* get_memchr()
- {
+ Function* get_memchr() {
if (!memchr_func)
- {
- std::vector<const Type*> args;
- args.push_back(PointerType::get(Type::SByteTy));
- args.push_back(Type::IntTy);
- args.push_back(TD->getIntPtrType());
- FunctionType* memchr_type = FunctionType::get(
- PointerType::get(Type::SByteTy), args, false);
- memchr_func = M->getOrInsertFunction("memchr",memchr_type);
- }
+ memchr_func = M->getOrInsertFunction("memchr",
+ PointerType::get(Type::SByteTy),
+ PointerType::get(Type::SByteTy),
+ Type::IntTy, TD->getIntPtrType(),
+ NULL);
return memchr_func;
}
Function* get_memcpy() {
if (!memcpy_func) {
const Type *SBP = PointerType::get(Type::SByteTy);
- memcpy_func = M->getOrInsertFunction("llvm.memcpy", Type::VoidTy,SBP, SBP,
- Type::UIntTy, Type::UIntTy, 0);
+ const char *N = TD->getIntPtrType() == Type::UIntTy ?
+ "llvm.memcpy.i32" : "llvm.memcpy.i64";
+ memcpy_func = M->getOrInsertFunction(N, Type::VoidTy, SBP, SBP,
+ TD->getIntPtrType(), Type::UIntTy,
+ NULL);
}
return memcpy_func;
}
- Function* get_floorf() {
- if (!floorf_func)
- floorf_func = M->getOrInsertFunction("floorf", Type::FloatTy,
- Type::FloatTy, 0);
- return floorf_func;
+ Function *getUnaryFloatFunction(const char *Name, Function *&Cache) {
+ if (!Cache)
+ Cache = M->getOrInsertFunction(Name, Type::FloatTy, Type::FloatTy, NULL);
+ return Cache;
}
+ Function *get_floorf() { return getUnaryFloatFunction("floorf", floorf_func);}
+ Function *get_ceilf() { return getUnaryFloatFunction( "ceilf", ceilf_func);}
+ Function *get_roundf() { return getUnaryFloatFunction("roundf", roundf_func);}
+ Function *get_rintf() { return getUnaryFloatFunction( "rintf", rintf_func);}
+ Function *get_nearbyintf() { return getUnaryFloatFunction("nearbyintf",
+ nearbyintf_func); }
private:
/// @brief Reset our cached data for a new Module
- void reset(Module& mod)
- {
+ void reset(Module& mod) {
M = &mod;
TD = &getAnalysis<TargetData>();
+ putchar_func = 0;
+ puts_func = 0;
fputc_func = 0;
+ fputs_func = 0;
fwrite_func = 0;
memcpy_func = 0;
memchr_func = 0;
strcpy_func = 0;
strlen_func = 0;
floorf_func = 0;
+ ceilf_func = 0;
+ roundf_func = 0;
+ rintf_func = 0;
+ nearbyintf_func = 0;
}
private:
- Function* fputc_func; ///< Cached fputc function
- Function* fwrite_func; ///< Cached fwrite function
- Function* memcpy_func; ///< Cached llvm.memcpy function
- Function* memchr_func; ///< Cached memchr function
- Function* sqrt_func; ///< Cached sqrt function
- Function* strcpy_func; ///< Cached strcpy function
- Function* strlen_func; ///< Cached strlen function
- Function* floorf_func; ///< Cached floorf function
- Module* M; ///< Cached Module
- TargetData* TD; ///< Cached TargetData
+ /// Caches for function pointers.
+ Function *putchar_func, *puts_func;
+ Function *fputc_func, *fputs_func, *fwrite_func;
+ Function *memcpy_func, *memchr_func;
+ Function* sqrt_func;
+ Function *strcpy_func, *strlen_func;
+ Function *floorf_func, *ceilf_func, *roundf_func;
+ Function *rintf_func, *nearbyintf_func;
+ Module *M; ///< Cached Module
+ TargetData *TD; ///< Cached TargetData
};
// Register the pass
-RegisterOpt<SimplifyLibCalls>
-X("simplify-libcalls","Simplify well-known library calls");
+RegisterPass<SimplifyLibCalls>
+X("simplify-libcalls", "Simplify well-known library calls");
} // anonymous namespace
// The only public symbol in this file which just instantiates the pass object
-ModulePass *llvm::createSimplifyLibCallsPass()
-{
+ModulePass *llvm::createSimplifyLibCallsPass() {
return new SimplifyLibCalls();
}
/// the same value passed to the exit function. When this is done, it splits the
/// basic block at the exit(3) call and deletes the call instruction.
/// @brief Replace calls to exit in main with a simple return
-struct ExitInMainOptimization : public LibCallOptimization
-{
+struct ExitInMainOptimization : public LibCallOptimization {
ExitInMainOptimization() : LibCallOptimization("exit",
"Number of 'exit' calls simplified") {}
- virtual ~ExitInMainOptimization() {}
// Make sure the called function looks like exit (int argument, int return
// type, external linkage, not varargs).
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
- if (f->arg_size() >= 1)
- if (f->arg_begin()->getType()->isInteger())
- return true;
- return false;
+ virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){
+ return F->arg_size() >= 1 && F->arg_begin()->getType()->isInteger();
}
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
+ virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC) {
// To be careful, we check that the call to exit is coming from "main", that
// main has external linkage, and the return type of main and the argument
// to exit have the same type.
Function *from = ci->getParent()->getParent();
if (from->hasExternalLinkage())
if (from->getReturnType() == ci->getOperand(1)->getType())
- if (from->getName() == "main")
- {
+ if (from->getName() == "main") {
// Okay, time to actually do the optimization. First, get the basic
// block of the call instruction
BasicBlock* bb = ci->getParent();
// Create a return instruction that we'll replace the call with.
// Note that the argument of the return is the argument of the call
// instruction.
- ReturnInst* ri = new ReturnInst(ci->getOperand(1), ci);
+ new ReturnInst(ci->getOperand(1), ci);
// Split the block at the call instruction which places it in a new
// basic block.
/// of the constant string. Both of these calls are further reduced, if possible
/// on subsequent passes.
/// @brief Simplify the strcat library function.
-struct StrCatOptimization : public LibCallOptimization
-{
+struct StrCatOptimization : public LibCallOptimization {
public:
/// @brief Default constructor
StrCatOptimization() : LibCallOptimization("strcat",
"Number of 'strcat' calls simplified") {}
public:
- /// @breif Destructor
- virtual ~StrCatOptimization() {}
/// @brief Make sure that the "strcat" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
+ virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC){
if (f->getReturnType() == PointerType::get(Type::SByteTy))
if (f->arg_size() == 2)
{
}
/// @brief Optimize the strcat library function
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
+ virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC) {
// Extract some information from the instruction
- Module* M = ci->getParent()->getParent()->getParent();
Value* dest = ci->getOperand(1);
Value* src = ci->getOperand(2);
return false;
// Handle the simple, do-nothing case
- if (len == 0)
- {
+ if (len == 0) {
ci->replaceAllUsesWith(dest);
ci->eraseFromParent();
return true;
std::vector<Value*> vals;
vals.push_back(gep); // destination
vals.push_back(ci->getOperand(2)); // source
- vals.push_back(ConstantUInt::get(Type::UIntTy,len)); // length
+ vals.push_back(ConstantUInt::get(SLC.getIntPtrType(),len)); // length
vals.push_back(ConstantUInt::get(Type::UIntTy,1)); // alignment
new CallInst(SLC.get_memcpy(), vals, "", ci);
/// function. It optimizes out cases where the arguments are both constant
/// and the result can be determined statically.
/// @brief Simplify the strcmp library function.
-struct StrChrOptimization : public LibCallOptimization
-{
+struct StrChrOptimization : public LibCallOptimization {
public:
StrChrOptimization() : LibCallOptimization("strchr",
"Number of 'strchr' calls simplified") {}
- virtual ~StrChrOptimization() {}
/// @brief Make sure that the "strchr" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
+ virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC){
if (f->getReturnType() == PointerType::get(Type::SByteTy) &&
f->arg_size() == 2)
return true;
}
/// @brief Perform the strchr optimizations
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
+ virtual bool OptimizeCall(CallInst *ci, SimplifyLibCalls &SLC) {
// If there aren't three operands, bail
if (ci->getNumOperands() != 3)
return false;
// Check that the second argument to strchr is a constant int, return false
// if it isn't
ConstantSInt* CSI = dyn_cast<ConstantSInt>(ci->getOperand(2));
- if (!CSI)
- {
+ if (!CSI) {
// Just lower this to memchr since we know the length of the string as
// it is constant.
Function* f = SLC.get_memchr();
// Compute the offset
uint64_t offset = 0;
bool char_found = false;
- for (uint64_t i = 0; i < len; ++i)
- {
- if (ConstantSInt* CI = dyn_cast<ConstantSInt>(CA->getOperand(i)))
- {
+ for (uint64_t i = 0; i < len; ++i) {
+ if (ConstantSInt* CI = dyn_cast<ConstantSInt>(CA->getOperand(i))) {
// Check for the null terminator
if (CI->isNullValue())
break; // we found end of string
- else if (CI->getValue() == chr)
- {
+ else if (CI->getValue() == chr) {
char_found = true;
offset = i;
break;
// strchr(s,c) -> offset_of_in(c,s)
// (if c is a constant integer and s is a constant string)
- if (char_found)
- {
+ if (char_found) {
std::vector<Value*> indices;
indices.push_back(ConstantUInt::get(Type::ULongTy,offset));
GetElementPtrInst* GEP = new GetElementPtrInst(ci->getOperand(1),indices,
ci->getOperand(1)->getName()+".strchr",ci);
ci->replaceAllUsesWith(GEP);
- }
- else
+ } else {
ci->replaceAllUsesWith(
ConstantPointerNull::get(PointerType::get(Type::SByteTy)));
-
+ }
ci->eraseFromParent();
return true;
}
/// function. It optimizes out cases where one or both arguments are constant
/// and the result can be determined statically.
/// @brief Simplify the strcmp library function.
-struct StrCmpOptimization : public LibCallOptimization
-{
+struct StrCmpOptimization : public LibCallOptimization {
public:
StrCmpOptimization() : LibCallOptimization("strcmp",
"Number of 'strcmp' calls simplified") {}
- virtual ~StrCmpOptimization() {}
/// @brief Make sure that the "strcmp" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
- if (f->getReturnType() == Type::IntTy && f->arg_size() == 2)
- return true;
- return false;
+ virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){
+ return F->getReturnType() == Type::IntTy && F->arg_size() == 2;
}
/// @brief Perform the strcmp optimization
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
+ virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC) {
// First, check to see if src and destination are the same. If they are,
// then the optimization is to replace the CallInst with a constant 0
// because the call is a no-op.
Value* s1 = ci->getOperand(1);
Value* s2 = ci->getOperand(2);
- if (s1 == s2)
- {
+ if (s1 == s2) {
// strcmp(x,x) -> 0
ci->replaceAllUsesWith(ConstantInt::get(Type::IntTy,0));
ci->eraseFromParent();
bool isstr_1 = false;
uint64_t len_1 = 0;
ConstantArray* A1;
- if (getConstantStringLength(s1,len_1,&A1))
- {
+ if (getConstantStringLength(s1,len_1,&A1)) {
isstr_1 = true;
- if (len_1 == 0)
- {
+ if (len_1 == 0) {
// strcmp("",x) -> *x
LoadInst* load =
new LoadInst(CastToCStr(s2,*ci), ci->getName()+".load",ci);
bool isstr_2 = false;
uint64_t len_2 = 0;
ConstantArray* A2;
- if (getConstantStringLength(s2,len_2,&A2))
- {
+ if (getConstantStringLength(s2, len_2, &A2)) {
isstr_2 = true;
- if (len_2 == 0)
- {
+ if (len_2 == 0) {
// strcmp(x,"") -> *x
LoadInst* load =
new LoadInst(CastToCStr(s1,*ci),ci->getName()+".val",ci);
}
}
- if (isstr_1 && isstr_2)
- {
+ if (isstr_1 && isstr_2) {
// strcmp(x,y) -> cnst (if both x and y are constant strings)
std::string str1 = A1->getAsString();
std::string str2 = A2->getAsString();
/// function. It optimizes out cases where one or both arguments are constant
/// and the result can be determined statically.
/// @brief Simplify the strncmp library function.
-struct StrNCmpOptimization : public LibCallOptimization
-{
+struct StrNCmpOptimization : public LibCallOptimization {
public:
StrNCmpOptimization() : LibCallOptimization("strncmp",
"Number of 'strncmp' calls simplified") {}
- virtual ~StrNCmpOptimization() {}
/// @brief Make sure that the "strncmp" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
+ virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC){
if (f->getReturnType() == Type::IntTy && f->arg_size() == 3)
return true;
return false;
}
/// @brief Perform the strncpy optimization
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
+ virtual bool OptimizeCall(CallInst *ci, SimplifyLibCalls &SLC) {
// First, check to see if src and destination are the same. If they are,
// then the optimization is to replace the CallInst with a constant 0
// because the call is a no-op.
Value* s1 = ci->getOperand(1);
Value* s2 = ci->getOperand(2);
- if (s1 == s2)
- {
+ if (s1 == s2) {
// strncmp(x,x,l) -> 0
ci->replaceAllUsesWith(ConstantInt::get(Type::IntTy,0));
ci->eraseFromParent();
// considered equal.
uint64_t len_arg = 0;
bool len_arg_is_const = false;
- if (ConstantInt* len_CI = dyn_cast<ConstantInt>(ci->getOperand(3)))
- {
+ if (ConstantInt* len_CI = dyn_cast<ConstantInt>(ci->getOperand(3))) {
len_arg_is_const = true;
len_arg = len_CI->getRawValue();
- if (len_arg == 0)
- {
+ if (len_arg == 0) {
// strncmp(x,y,0) -> 0
ci->replaceAllUsesWith(ConstantInt::get(Type::IntTy,0));
ci->eraseFromParent();
bool isstr_1 = false;
uint64_t len_1 = 0;
ConstantArray* A1;
- if (getConstantStringLength(s1,len_1,&A1))
- {
+ if (getConstantStringLength(s1, len_1, &A1)) {
isstr_1 = true;
- if (len_1 == 0)
- {
+ if (len_1 == 0) {
// strncmp("",x) -> *x
LoadInst* load = new LoadInst(s1,ci->getName()+".load",ci);
CastInst* cast =
bool isstr_2 = false;
uint64_t len_2 = 0;
ConstantArray* A2;
- if (getConstantStringLength(s2,len_2,&A2))
- {
+ if (getConstantStringLength(s2,len_2,&A2)) {
isstr_2 = true;
- if (len_2 == 0)
- {
+ if (len_2 == 0) {
// strncmp(x,"") -> *x
LoadInst* load = new LoadInst(s2,ci->getName()+".val",ci);
CastInst* cast =
}
}
- if (isstr_1 && isstr_2 && len_arg_is_const)
- {
+ if (isstr_1 && isstr_2 && len_arg_is_const) {
// strncmp(x,y,const) -> constant
std::string str1 = A1->getAsString();
std::string str2 = A2->getAsString();
/// (1) If src and dest are the same and not volatile, just return dest
/// (2) If the src is a constant then we can convert to llvm.memmove
/// @brief Simplify the strcpy library function.
-struct StrCpyOptimization : public LibCallOptimization
-{
+struct StrCpyOptimization : public LibCallOptimization {
public:
StrCpyOptimization() : LibCallOptimization("strcpy",
"Number of 'strcpy' calls simplified") {}
- virtual ~StrCpyOptimization() {}
/// @brief Make sure that the "strcpy" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
+ virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC){
if (f->getReturnType() == PointerType::get(Type::SByteTy))
- if (f->arg_size() == 2)
- {
+ if (f->arg_size() == 2) {
Function::const_arg_iterator AI = f->arg_begin();
if (AI++->getType() == PointerType::get(Type::SByteTy))
- if (AI->getType() == PointerType::get(Type::SByteTy))
- {
+ if (AI->getType() == PointerType::get(Type::SByteTy)) {
// Indicate this is a suitable call type.
return true;
}
}
/// @brief Perform the strcpy optimization
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
+ virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC) {
// First, check to see if src and destination are the same. If they are,
// then the optimization is to replace the CallInst with the destination
// because the call is a no-op. Note that this corresponds to the
// we optimize it as a no-op.
Value* dest = ci->getOperand(1);
Value* src = ci->getOperand(2);
- if (dest == src)
- {
+ if (dest == src) {
ci->replaceAllUsesWith(dest);
ci->eraseFromParent();
return true;
// If the constant string's length is zero we can optimize this by just
// doing a store of 0 at the first byte of the destination
- if (len == 0)
- {
+ if (len == 0) {
new StoreInst(ConstantInt::get(Type::SByteTy,0),ci->getOperand(1),ci);
ci->replaceAllUsesWith(dest);
ci->eraseFromParent();
// terminator as well.
len++;
- // Extract some information from the instruction
- Module* M = ci->getParent()->getParent()->getParent();
-
// We have enough information to now generate the memcpy call to
// do the concatenation for us.
std::vector<Value*> vals;
vals.push_back(dest); // destination
vals.push_back(src); // source
- vals.push_back(ConstantUInt::get(Type::UIntTy,len)); // length
+ vals.push_back(ConstantUInt::get(SLC.getIntPtrType(),len)); // length
vals.push_back(ConstantUInt::get(Type::UIntTy,1)); // alignment
new CallInst(SLC.get_memcpy(), vals, "", ci);
/// function by replacing it with a constant value if the string provided to
/// it is a constant array.
/// @brief Simplify the strlen library function.
-struct StrLenOptimization : public LibCallOptimization
-{
+struct StrLenOptimization : public LibCallOptimization {
StrLenOptimization() : LibCallOptimization("strlen",
"Number of 'strlen' calls simplified") {}
- virtual ~StrLenOptimization() {}
/// @brief Make sure that the "strlen" function has the right prototype
virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
Value *G1 = new GetElementPtrInst(Op1Cast, One, "next1v", CI);
Value *G2 = new GetElementPtrInst(Op2Cast, One, "next2v", CI);
Value *S1V2 = new LoadInst(G1, LHS->getName()+".val2", CI);
- Value *S2V2 = new LoadInst(G1, RHS->getName()+".val2", CI);
+ Value *S2V2 = new LoadInst(G2, RHS->getName()+".val2", CI);
Value *D2 = BinaryOperator::createSub(S1V2, S2V2,
CI->getName()+".d1", CI);
Value *Or = BinaryOperator::createOr(D1, D2, CI->getName()+".res", CI);
break;
}
-
-
return false;
}
} memcmpOptimizer;
-
-
-
/// This LibCallOptimization will simplify a call to the memcpy library
/// function by expanding it out to a single store of size 0, 1, 2, 4, or 8
/// bytes depending on the length of the string and the alignment. Additional
/// optimizations are possible in code generation (sequence of immediate store)
/// @brief Simplify the memcpy library function.
-struct LLVMMemCpyOptimization : public LibCallOptimization
-{
- /// @brief Default Constructor
- LLVMMemCpyOptimization() : LibCallOptimization("llvm.memcpy",
- "Number of 'llvm.memcpy' calls simplified") {}
-
-protected:
- /// @brief Subclass Constructor
- LLVMMemCpyOptimization(const char* fname, const char* desc)
- : LibCallOptimization(fname, desc) {}
-public:
- /// @brief Destructor
- virtual ~LLVMMemCpyOptimization() {}
+struct LLVMMemCpyMoveOptzn : public LibCallOptimization {
+ LLVMMemCpyMoveOptzn(const char* fname, const char* desc)
+ : LibCallOptimization(fname, desc) {}
/// @brief Make sure that the "memcpy" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& TD)
- {
+ virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& TD) {
// Just make sure this has 4 arguments per LLVM spec.
return (f->arg_size() == 4);
}
/// alignment match the sizes of our intrinsic types so we can do a load and
/// store instead of the memcpy call.
/// @brief Perform the memcpy optimization.
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& TD)
- {
+ virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& TD) {
// Make sure we have constant int values to work with
ConstantInt* LEN = dyn_cast<ConstantInt>(ci->getOperand(3));
if (!LEN)
ci->eraseFromParent();
return true;
}
-} LLVMMemCpyOptimizer;
-
-/// This LibCallOptimization will simplify a call to the memmove library
-/// function. It is identical to MemCopyOptimization except for the name of
-/// the intrinsic.
-/// @brief Simplify the memmove library function.
-struct LLVMMemMoveOptimization : public LLVMMemCpyOptimization
-{
- /// @brief Default Constructor
- LLVMMemMoveOptimization() : LLVMMemCpyOptimization("llvm.memmove",
- "Number of 'llvm.memmove' calls simplified") {}
+};
-} LLVMMemMoveOptimizer;
+/// This LibCallOptimization will simplify a call to the memcpy/memmove library
+/// functions.
+LLVMMemCpyMoveOptzn LLVMMemCpyOptimizer32("llvm.memcpy.i32",
+ "Number of 'llvm.memcpy' calls simplified");
+LLVMMemCpyMoveOptzn LLVMMemCpyOptimizer64("llvm.memcpy.i64",
+ "Number of 'llvm.memcpy' calls simplified");
+LLVMMemCpyMoveOptzn LLVMMemMoveOptimizer32("llvm.memmove.i32",
+ "Number of 'llvm.memmove' calls simplified");
+LLVMMemCpyMoveOptzn LLVMMemMoveOptimizer64("llvm.memmove.i64",
+ "Number of 'llvm.memmove' calls simplified");
/// This LibCallOptimization will simplify a call to the memset library
/// function by expanding it out to a single store of size 0, 1, 2, 4, or 8
/// bytes depending on the length argument.
-struct LLVMMemSetOptimization : public LibCallOptimization
-{
+struct LLVMMemSetOptimization : public LibCallOptimization {
/// @brief Default Constructor
- LLVMMemSetOptimization() : LibCallOptimization("llvm.memset",
+ LLVMMemSetOptimization(const char *Name) : LibCallOptimization(Name,
"Number of 'llvm.memset' calls simplified") {}
-public:
- /// @brief Destructor
- virtual ~LLVMMemSetOptimization() {}
-
/// @brief Make sure that the "memset" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& TD)
- {
+ virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &TD) {
// Just make sure this has 3 arguments per LLVM spec.
- return (f->arg_size() == 4);
+ return F->arg_size() == 4;
}
/// Because of alignment and instruction information that we don't have, we
/// store instead of the memcpy call. Other calls are transformed into the
/// llvm.memset intrinsic.
/// @brief Perform the memset optimization.
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& TD)
- {
+ virtual bool OptimizeCall(CallInst *ci, SimplifyLibCalls &TD) {
// Make sure we have constant int values to work with
ConstantInt* LEN = dyn_cast<ConstantInt>(ci->getOperand(3));
if (!LEN)
alignment = 1;
// If the length is zero, this is a no-op
- if (len == 0)
- {
+ if (len == 0) {
// memset(d,c,0,a) -> noop
ci->eraseFromParent();
return true;
// and the value we will store there.
Value* dest = ci->getOperand(1);
Type* castType = 0;
- switch (len)
- {
+ switch (len) {
case 1:
castType = Type::UByteTy;
break;
ci->eraseFromParent();
return true;
}
-} LLVMMemSetOptimizer;
+};
+
+LLVMMemSetOptimization MemSet32Optimizer("llvm.memset.i32");
+LLVMMemSetOptimization MemSet64Optimizer("llvm.memset.i64");
+
/// This LibCallOptimization will simplify calls to the "pow" library
/// function. It looks for cases where the result of pow is well known and
/// substitutes the appropriate value.
/// @brief Simplify the pow library function.
-struct PowOptimization : public LibCallOptimization
-{
+struct PowOptimization : public LibCallOptimization {
public:
/// @brief Default Constructor
PowOptimization() : LibCallOptimization("pow",
"Number of 'pow' calls simplified") {}
- /// @brief Destructor
- virtual ~PowOptimization() {}
-
/// @brief Make sure that the "pow" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
+ virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC){
// Just make sure this has 2 arguments
return (f->arg_size() == 2);
}
/// @brief Perform the pow optimization.
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
+ virtual bool OptimizeCall(CallInst *ci, SimplifyLibCalls &SLC) {
const Type *Ty = cast<Function>(ci->getOperand(0))->getReturnType();
Value* base = ci->getOperand(1);
Value* expn = ci->getOperand(2);
if (ConstantFP *Op1 = dyn_cast<ConstantFP>(base)) {
double Op1V = Op1->getValue();
- if (Op1V == 1.0)
- {
+ if (Op1V == 1.0) {
// pow(1.0,x) -> 1.0
ci->replaceAllUsesWith(ConstantFP::get(Ty,1.0));
ci->eraseFromParent();
return true;
}
- }
- else if (ConstantFP* Op2 = dyn_cast<ConstantFP>(expn))
- {
+ } else if (ConstantFP* Op2 = dyn_cast<ConstantFP>(expn)) {
double Op2V = Op2->getValue();
- if (Op2V == 0.0)
- {
+ if (Op2V == 0.0) {
// pow(x,0.0) -> 1.0
ci->replaceAllUsesWith(ConstantFP::get(Ty,1.0));
ci->eraseFromParent();
return true;
- }
- else if (Op2V == 0.5)
- {
+ } else if (Op2V == 0.5) {
// pow(x,0.5) -> sqrt(x)
CallInst* sqrt_inst = new CallInst(SLC.get_sqrt(), base,
ci->getName()+".pow",ci);
ci->replaceAllUsesWith(sqrt_inst);
ci->eraseFromParent();
return true;
- }
- else if (Op2V == 1.0)
- {
+ } else if (Op2V == 1.0) {
// pow(x,1.0) -> x
ci->replaceAllUsesWith(base);
ci->eraseFromParent();
return true;
- }
- else if (Op2V == -1.0)
- {
+ } else if (Op2V == -1.0) {
// pow(x,-1.0) -> 1.0/x
BinaryOperator* div_inst= BinaryOperator::createDiv(
ConstantFP::get(Ty,1.0), base, ci->getName()+".pow", ci);
}
} PowOptimizer;
+/// This LibCallOptimization will simplify calls to the "printf" library
+/// function. It looks for cases where the result of printf is not used and the
+/// operation can be reduced to something simpler.
+/// @brief Simplify the printf library function.
+struct PrintfOptimization : public LibCallOptimization {
+public:
+ /// @brief Default Constructor
+ PrintfOptimization() : LibCallOptimization("printf",
+ "Number of 'printf' calls simplified") {}
+
+ /// @brief Make sure that the "printf" function has the right prototype
+ virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC){
+ // Just make sure this has at least 1 arguments
+ return (f->arg_size() >= 1);
+ }
+
+ /// @brief Perform the printf optimization.
+ virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC) {
+ // If the call has more than 2 operands, we can't optimize it
+ if (ci->getNumOperands() > 3 || ci->getNumOperands() <= 2)
+ return false;
+
+ // If the result of the printf call is used, none of these optimizations
+ // can be made.
+ if (!ci->use_empty())
+ return false;
+
+ // All the optimizations depend on the length of the first argument and the
+ // fact that it is a constant string array. Check that now
+ uint64_t len = 0;
+ ConstantArray* CA = 0;
+ if (!getConstantStringLength(ci->getOperand(1), len, &CA))
+ return false;
+
+ if (len != 2 && len != 3)
+ return false;
+
+ // The first character has to be a %
+ if (ConstantInt* CI = dyn_cast<ConstantInt>(CA->getOperand(0)))
+ if (CI->getRawValue() != '%')
+ return false;
+
+ // Get the second character and switch on its value
+ ConstantInt* CI = dyn_cast<ConstantInt>(CA->getOperand(1));
+ switch (CI->getRawValue()) {
+ case 's':
+ {
+ if (len != 3 ||
+ dyn_cast<ConstantInt>(CA->getOperand(2))->getRawValue() != '\n')
+ return false;
+
+ // printf("%s\n",str) -> puts(str)
+ Function* puts_func = SLC.get_puts();
+ if (!puts_func)
+ return false;
+ std::vector<Value*> args;
+ args.push_back(CastToCStr(ci->getOperand(2), *ci));
+ new CallInst(puts_func,args,ci->getName(),ci);
+ ci->replaceAllUsesWith(ConstantSInt::get(Type::IntTy,len));
+ break;
+ }
+ case 'c':
+ {
+ // printf("%c",c) -> putchar(c)
+ if (len != 2)
+ return false;
+
+ Function* putchar_func = SLC.get_putchar();
+ if (!putchar_func)
+ return false;
+ CastInst* cast = new CastInst(ci->getOperand(2), Type::IntTy,
+ CI->getName()+".int", ci);
+ new CallInst(putchar_func, cast, "", ci);
+ ci->replaceAllUsesWith(ConstantSInt::get(Type::IntTy, 1));
+ break;
+ }
+ default:
+ return false;
+ }
+ ci->eraseFromParent();
+ return true;
+ }
+} PrintfOptimizer;
+
/// This LibCallOptimization will simplify calls to the "fprintf" library
/// function. It looks for cases where the result of fprintf is not used and the
/// operation can be reduced to something simpler.
-/// @brief Simplify the pow library function.
-struct FPrintFOptimization : public LibCallOptimization
-{
+/// @brief Simplify the fprintf library function.
+struct FPrintFOptimization : public LibCallOptimization {
public:
/// @brief Default Constructor
FPrintFOptimization() : LibCallOptimization("fprintf",
"Number of 'fprintf' calls simplified") {}
- /// @brief Destructor
- virtual ~FPrintFOptimization() {}
-
/// @brief Make sure that the "fprintf" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
+ virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC){
// Just make sure this has at least 2 arguments
return (f->arg_size() >= 2);
}
/// @brief Perform the fprintf optimization.
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
+ virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC) {
// If the call has more than 3 operands, we can't optimize it
if (ci->getNumOperands() > 4 || ci->getNumOperands() <= 2)
return false;
if (!getConstantStringLength(ci->getOperand(2), len, &CA))
return false;
- if (ci->getNumOperands() == 3)
- {
+ if (ci->getNumOperands() == 3) {
// Make sure there's no % in the constant array
- for (unsigned i = 0; i < len; ++i)
- {
- if (ConstantInt* CI = dyn_cast<ConstantInt>(CA->getOperand(i)))
- {
+ for (unsigned i = 0; i < len; ++i) {
+ if (ConstantInt* CI = dyn_cast<ConstantInt>(CA->getOperand(i))) {
// Check for the null terminator
if (CI->getRawValue() == '%')
return false; // we found end of string
- }
- else
+ } else {
return false;
+ }
}
// fprintf(file,fmt) -> fwrite(fmt,strlen(fmt),file)
// Get the second character and switch on its value
ConstantInt* CI = dyn_cast<ConstantInt>(CA->getOperand(1));
- switch (CI->getRawValue())
- {
+ switch (CI->getRawValue()) {
case 's':
{
uint64_t len = 0;
ConstantArray* CA = 0;
- if (!getConstantStringLength(ci->getOperand(3), len, &CA))
- return false;
-
- // fprintf(file,"%s",str) -> fwrite(fmt,strlen(fmt),1,file)
- const Type* FILEptr_type = ci->getOperand(1)->getType();
- Function* fwrite_func = SLC.get_fwrite(FILEptr_type);
- if (!fwrite_func)
- return false;
- std::vector<Value*> args;
- args.push_back(CastToCStr(ci->getOperand(3), *ci));
- args.push_back(ConstantUInt::get(SLC.getIntPtrType(),len));
- args.push_back(ConstantUInt::get(SLC.getIntPtrType(),1));
- args.push_back(ci->getOperand(1));
- new CallInst(fwrite_func,args,ci->getName(),ci);
- ci->replaceAllUsesWith(ConstantSInt::get(Type::IntTy,len));
+ if (getConstantStringLength(ci->getOperand(3), len, &CA)) {
+ // fprintf(file,"%s",str) -> fwrite(str,strlen(str),1,file)
+ const Type* FILEptr_type = ci->getOperand(1)->getType();
+ Function* fwrite_func = SLC.get_fwrite(FILEptr_type);
+ if (!fwrite_func)
+ return false;
+ std::vector<Value*> args;
+ args.push_back(CastToCStr(ci->getOperand(3), *ci));
+ args.push_back(ConstantUInt::get(SLC.getIntPtrType(),len));
+ args.push_back(ConstantUInt::get(SLC.getIntPtrType(),1));
+ args.push_back(ci->getOperand(1));
+ new CallInst(fwrite_func,args,ci->getName(),ci);
+ ci->replaceAllUsesWith(ConstantSInt::get(Type::IntTy,len));
+ } else {
+ // fprintf(file,"%s",str) -> fputs(str,file)
+ const Type* FILEptr_type = ci->getOperand(1)->getType();
+ Function* fputs_func = SLC.get_fputs(FILEptr_type);
+ if (!fputs_func)
+ return false;
+ std::vector<Value*> args;
+ args.push_back(CastToCStr(ci->getOperand(3), *ci));
+ args.push_back(ci->getOperand(1));
+ new CallInst(fputs_func,args,ci->getName(),ci);
+ ci->replaceAllUsesWith(ConstantSInt::get(Type::IntTy,len));
+ }
break;
}
case 'c':
{
- ConstantInt* CI = dyn_cast<ConstantInt>(ci->getOperand(3));
- if (!CI)
- return false;
-
+ // fprintf(file,"%c",c) -> fputc(c,file)
const Type* FILEptr_type = ci->getOperand(1)->getType();
Function* fputc_func = SLC.get_fputc(FILEptr_type);
if (!fputc_func)
return false;
- CastInst* cast = new CastInst(CI,Type::IntTy,CI->getName()+".int",ci);
+ CastInst* cast = new CastInst(ci->getOperand(3), Type::IntTy,
+ CI->getName()+".int", ci);
new CallInst(fputc_func,cast,ci->getOperand(1),"",ci);
ci->replaceAllUsesWith(ConstantSInt::get(Type::IntTy,1));
break;
/// This LibCallOptimization will simplify calls to the "sprintf" library
/// function. It looks for cases where the result of sprintf is not used and the
/// operation can be reduced to something simpler.
-/// @brief Simplify the pow library function.
-struct SPrintFOptimization : public LibCallOptimization
-{
+/// @brief Simplify the sprintf library function.
+struct SPrintFOptimization : public LibCallOptimization {
public:
/// @brief Default Constructor
SPrintFOptimization() : LibCallOptimization("sprintf",
"Number of 'sprintf' calls simplified") {}
- /// @brief Destructor
- virtual ~SPrintFOptimization() {}
-
/// @brief Make sure that the "fprintf" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
+ virtual bool ValidateCalledFunction(const Function *f, SimplifyLibCalls &SLC){
// Just make sure this has at least 2 arguments
return (f->getReturnType() == Type::IntTy && f->arg_size() >= 2);
}
/// @brief Perform the sprintf optimization.
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
+ virtual bool OptimizeCall(CallInst *ci, SimplifyLibCalls &SLC) {
// If the call has more than 3 operands, we can't optimize it
if (ci->getNumOperands() > 4 || ci->getNumOperands() < 3)
return false;
if (!getConstantStringLength(ci->getOperand(2), len, &CA))
return false;
- if (ci->getNumOperands() == 3)
- {
- if (len == 0)
- {
+ if (ci->getNumOperands() == 3) {
+ if (len == 0) {
// If the length is 0, we just need to store a null byte
new StoreInst(ConstantInt::get(Type::SByteTy,0),ci->getOperand(1),ci);
ci->replaceAllUsesWith(ConstantSInt::get(Type::IntTy,0));
}
// Make sure there's no % in the constant array
- for (unsigned i = 0; i < len; ++i)
- {
- if (ConstantInt* CI = dyn_cast<ConstantInt>(CA->getOperand(i)))
- {
+ for (unsigned i = 0; i < len; ++i) {
+ if (ConstantInt* CI = dyn_cast<ConstantInt>(CA->getOperand(i))) {
// Check for the null terminator
if (CI->getRawValue() == '%')
return false; // we found a %, can't optimize
- }
- else
+ } else {
return false; // initializer is not constant int, can't optimize
+ }
}
// Increment length because we want to copy the null byte too
std::vector<Value*> args;
args.push_back(ci->getOperand(1));
args.push_back(ci->getOperand(2));
- args.push_back(ConstantUInt::get(Type::UIntTy,len));
+ args.push_back(ConstantUInt::get(SLC.getIntPtrType(),len));
args.push_back(ConstantUInt::get(Type::UIntTy,1));
new CallInst(memcpy_func,args,"",ci);
ci->replaceAllUsesWith(ConstantSInt::get(Type::IntTy,len));
Value *Len1 = BinaryOperator::createAdd(Len,
ConstantInt::get(Len->getType(), 1),
Len->getName()+"1", ci);
- if (Len1->getType() != Type::UIntTy)
- Len1 = new CastInst(Len1, Type::UIntTy, Len1->getName(), ci);
+ if (Len1->getType() != SLC.getIntPtrType())
+ Len1 = new CastInst(Len1, SLC.getIntPtrType(), Len1->getName(), ci);
std::vector<Value*> args;
args.push_back(CastToCStr(ci->getOperand(1), *ci));
args.push_back(CastToCStr(ci->getOperand(3), *ci));
/// This LibCallOptimization will simplify calls to the "fputs" library
/// function. It looks for cases where the result of fputs is not used and the
/// operation can be reduced to something simpler.
-/// @brief Simplify the pow library function.
-struct PutsOptimization : public LibCallOptimization
-{
+/// @brief Simplify the puts library function.
+struct PutsOptimization : public LibCallOptimization {
public:
/// @brief Default Constructor
PutsOptimization() : LibCallOptimization("fputs",
"Number of 'fputs' calls simplified") {}
- /// @brief Destructor
- virtual ~PutsOptimization() {}
-
/// @brief Make sure that the "fputs" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
+ virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){
// Just make sure this has 2 arguments
- return (f->arg_size() == 2);
+ return F->arg_size() == 2;
}
/// @brief Perform the fputs optimization.
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
+ virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC) {
// If the result is used, none of these optimizations work
if (!ci->use_empty())
return false;
if (!getConstantStringLength(ci->getOperand(1), len))
return false;
- switch (len)
- {
+ switch (len) {
case 0:
// fputs("",F) -> noop
break;
/// This LibCallOptimization will simplify calls to the "isdigit" library
/// function. It simply does range checks the parameter explicitly.
/// @brief Simplify the isdigit library function.
-struct IsDigitOptimization : public LibCallOptimization
-{
+struct isdigitOptimization : public LibCallOptimization {
public:
- /// @brief Default Constructor
- IsDigitOptimization() : LibCallOptimization("isdigit",
+ isdigitOptimization() : LibCallOptimization("isdigit",
"Number of 'isdigit' calls simplified") {}
- /// @brief Destructor
- virtual ~IsDigitOptimization() {}
-
- /// @brief Make sure that the "fputs" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
+ /// @brief Make sure that the "isdigit" function has the right prototype
+ virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC){
// Just make sure this has 1 argument
return (f->arg_size() == 1);
}
/// @brief Perform the toascii optimization.
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
- if (ConstantInt* CI = dyn_cast<ConstantInt>(ci->getOperand(1)))
- {
+ virtual bool OptimizeCall(CallInst *ci, SimplifyLibCalls &SLC) {
+ if (ConstantInt* CI = dyn_cast<ConstantInt>(ci->getOperand(1))) {
// isdigit(c) -> 0 or 1, if 'c' is constant
uint64_t val = CI->getRawValue();
if (val >= '0' && val <='9')
ci->eraseFromParent();
return true;
}
-} IsDigitOptimizer;
+} isdigitOptimizer;
+
+struct isasciiOptimization : public LibCallOptimization {
+public:
+ isasciiOptimization()
+ : LibCallOptimization("isascii", "Number of 'isascii' calls simplified") {}
+
+ virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){
+ return F->arg_size() == 1 && F->arg_begin()->getType()->isInteger() &&
+ F->getReturnType()->isInteger();
+ }
+
+ /// @brief Perform the isascii optimization.
+ virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) {
+ // isascii(c) -> (unsigned)c < 128
+ Value *V = CI->getOperand(1);
+ if (V->getType()->isSigned())
+ V = new CastInst(V, V->getType()->getUnsignedVersion(), V->getName(), CI);
+ Value *Cmp = BinaryOperator::createSetLT(V, ConstantUInt::get(V->getType(),
+ 128),
+ V->getName()+".isascii", CI);
+ if (Cmp->getType() != CI->getType())
+ Cmp = new CastInst(Cmp, CI->getType(), Cmp->getName(), CI);
+ CI->replaceAllUsesWith(Cmp);
+ CI->eraseFromParent();
+ return true;
+ }
+} isasciiOptimizer;
+
/// This LibCallOptimization will simplify calls to the "toascii" library
/// function. It simply does the corresponding and operation to restrict the
/// range of values to the ASCII character set (0-127).
/// @brief Simplify the toascii library function.
-struct ToAsciiOptimization : public LibCallOptimization
-{
+struct ToAsciiOptimization : public LibCallOptimization {
public:
/// @brief Default Constructor
ToAsciiOptimization() : LibCallOptimization("toascii",
"Number of 'toascii' calls simplified") {}
- /// @brief Destructor
- virtual ~ToAsciiOptimization() {}
-
/// @brief Make sure that the "fputs" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
+ virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC){
// Just make sure this has 2 arguments
return (f->arg_size() == 1);
}
/// @brief Perform the toascii optimization.
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
+ virtual bool OptimizeCall(CallInst *ci, SimplifyLibCalls &SLC) {
// toascii(c) -> (c & 0x7f)
Value* chr = ci->getOperand(1);
BinaryOperator* and_inst = BinaryOperator::createAnd(chr,
/// optimization is to compute the result at compile time if the argument is
/// a constant.
/// @brief Simplify the ffs library function.
-struct FFSOptimization : public LibCallOptimization
-{
+struct FFSOptimization : public LibCallOptimization {
protected:
/// @brief Subclass Constructor
FFSOptimization(const char* funcName, const char* description)
- : LibCallOptimization(funcName, description)
- {}
+ : LibCallOptimization(funcName, description) {}
public:
/// @brief Default Constructor
FFSOptimization() : LibCallOptimization("ffs",
"Number of 'ffs' calls simplified") {}
- /// @brief Destructor
- virtual ~FFSOptimization() {}
-
- /// @brief Make sure that the "fputs" function has the right prototype
- virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC)
- {
+ /// @brief Make sure that the "ffs" function has the right prototype
+ virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){
// Just make sure this has 2 arguments
- return (f->arg_size() == 1 && f->getReturnType() == Type::IntTy);
+ return F->arg_size() == 1 && F->getReturnType() == Type::IntTy;
}
/// @brief Perform the ffs optimization.
- virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC)
- {
- if (ConstantInt* CI = dyn_cast<ConstantInt>(ci->getOperand(1)))
- {
+ virtual bool OptimizeCall(CallInst *TheCall, SimplifyLibCalls &SLC) {
+ if (ConstantInt *CI = dyn_cast<ConstantInt>(TheCall->getOperand(1))) {
// ffs(cnst) -> bit#
// ffsl(cnst) -> bit#
// ffsll(cnst) -> bit#
uint64_t val = CI->getRawValue();
int result = 0;
- while (val != 0) {
- result +=1;
- if (val&1)
- break;
- val >>= 1;
+ if (val) {
+ ++result;
+ while ((val & 1) == 0) {
+ ++result;
+ val >>= 1;
+ }
}
- ci->replaceAllUsesWith(ConstantSInt::get(Type::IntTy, result));
- ci->eraseFromParent();
+ TheCall->replaceAllUsesWith(ConstantSInt::get(Type::IntTy, result));
+ TheCall->eraseFromParent();
return true;
}
- // ffs(x) -> ( x == 0 ? 0 : llvm.cttz(x)+1)
- // ffsl(x) -> ( x == 0 ? 0 : llvm.cttz(x)+1)
- // ffsll(x) -> ( x == 0 ? 0 : llvm.cttz(x)+1)
- const Type* arg_type = ci->getOperand(1)->getType();
- std::vector<const Type*> args;
- args.push_back(arg_type);
- FunctionType* llvm_cttz_type = FunctionType::get(arg_type,args,false);
- Function* F =
- SLC.getModule()->getOrInsertFunction("llvm.cttz",llvm_cttz_type);
- std::string inst_name(ci->getName()+".ffs");
- Instruction* call =
- new CallInst(F, ci->getOperand(1), inst_name, ci);
- if (arg_type != Type::IntTy)
- call = new CastInst(call, Type::IntTy, inst_name, ci);
- BinaryOperator* add = BinaryOperator::createAdd(call,
- ConstantSInt::get(Type::IntTy,1), inst_name, ci);
- SetCondInst* eq = new SetCondInst(Instruction::SetEQ,ci->getOperand(1),
- ConstantSInt::get(ci->getOperand(1)->getType(),0),inst_name,ci);
- SelectInst* select = new SelectInst(eq,ConstantSInt::get(Type::IntTy,0),add,
- inst_name,ci);
- ci->replaceAllUsesWith(select);
- ci->eraseFromParent();
+ // ffs(x) -> x == 0 ? 0 : llvm.cttz(x)+1
+ // ffsl(x) -> x == 0 ? 0 : llvm.cttz(x)+1
+ // ffsll(x) -> x == 0 ? 0 : llvm.cttz(x)+1
+ const Type *ArgType = TheCall->getOperand(1)->getType();
+ ArgType = ArgType->getUnsignedVersion();
+ const char *CTTZName;
+ switch (ArgType->getTypeID()) {
+ default: assert(0 && "Unknown unsigned type!");
+ case Type::UByteTyID : CTTZName = "llvm.cttz.i8" ; break;
+ case Type::UShortTyID: CTTZName = "llvm.cttz.i16"; break;
+ case Type::UIntTyID : CTTZName = "llvm.cttz.i32"; break;
+ case Type::ULongTyID : CTTZName = "llvm.cttz.i64"; break;
+ }
+
+ Function *F = SLC.getModule()->getOrInsertFunction(CTTZName, ArgType,
+ ArgType, NULL);
+ Value *V = new CastInst(TheCall->getOperand(1), ArgType, "tmp", TheCall);
+ Value *V2 = new CallInst(F, V, "tmp", TheCall);
+ V2 = new CastInst(V2, Type::IntTy, "tmp", TheCall);
+ V2 = BinaryOperator::createAdd(V2, ConstantSInt::get(Type::IntTy, 1),
+ "tmp", TheCall);
+ Value *Cond =
+ BinaryOperator::createSetEQ(V, Constant::getNullValue(V->getType()),
+ "tmp", TheCall);
+ V2 = new SelectInst(Cond, ConstantInt::get(Type::IntTy, 0), V2,
+ TheCall->getName(), TheCall);
+ TheCall->replaceAllUsesWith(V2);
+ TheCall->eraseFromParent();
return true;
}
} FFSOptimizer;
/// calls. It simply uses FFSOptimization for which the transformation is
/// identical.
/// @brief Simplify the ffsl library function.
-struct FFSLOptimization : public FFSOptimization
-{
+struct FFSLOptimization : public FFSOptimization {
public:
/// @brief Default Constructor
FFSLOptimization() : FFSOptimization("ffsl",
/// calls. It simply uses FFSOptimization for which the transformation is
/// identical.
/// @brief Simplify the ffsl library function.
-struct FFSLLOptimization : public FFSOptimization
-{
+struct FFSLLOptimization : public FFSOptimization {
public:
/// @brief Default Constructor
FFSLLOptimization() : FFSOptimization("ffsll",
} FFSLLOptimizer;
-
-/// This LibCallOptimization will simplify calls to the "floor" library
-/// function.
-/// @brief Simplify the floor library function.
-struct FloorOptimization : public LibCallOptimization {
- FloorOptimization()
- : LibCallOptimization("floor", "Number of 'floor' calls simplified") {}
+/// This optimizes unary functions that take and return doubles.
+struct UnaryDoubleFPOptimizer : public LibCallOptimization {
+ UnaryDoubleFPOptimizer(const char *Fn, const char *Desc)
+ : LibCallOptimization(Fn, Desc) {}
- /// @brief Make sure that the "floor" function has the right prototype
+ // Make sure that this function has the right prototype
virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){
return F->arg_size() == 1 && F->arg_begin()->getType() == Type::DoubleTy &&
F->getReturnType() == Type::DoubleTy;
}
-
- virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) {
- // If this is a float argument passed in, convert to floorf.
- // e.g. floor((double)FLT) -> (double)floorf(FLT). There can be no loss of
- // precision due to this.
+
+ /// ShrinkFunctionToFloatVersion - If the input to this function is really a
+ /// float, strength reduce this to a float version of the function,
+ /// e.g. floor((double)FLT) -> (double)floorf(FLT). This can only be called
+ /// when the target supports the destination function and where there can be
+ /// no precision loss.
+ static bool ShrinkFunctionToFloatVersion(CallInst *CI, SimplifyLibCalls &SLC,
+ Function *(SimplifyLibCalls::*FP)()){
if (CastInst *Cast = dyn_cast<CastInst>(CI->getOperand(1)))
if (Cast->getOperand(0)->getType() == Type::FloatTy) {
- Value *New = new CallInst(SLC.get_floorf(), Cast->getOperand(0),
+ Value *New = new CallInst((SLC.*FP)(), Cast->getOperand(0),
CI->getName(), CI);
New = new CastInst(New, Type::DoubleTy, CI->getName(), CI);
CI->replaceAllUsesWith(New);
Cast->eraseFromParent();
return true;
}
+ return false;
+ }
+};
+
+
+struct FloorOptimization : public UnaryDoubleFPOptimizer {
+ FloorOptimization()
+ : UnaryDoubleFPOptimizer("floor", "Number of 'floor' calls simplified") {}
+
+ virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) {
+#ifdef HAVE_FLOORF
+ // If this is a float argument passed in, convert to floorf.
+ if (ShrinkFunctionToFloatVersion(CI, SLC, &SimplifyLibCalls::get_floorf))
+ return true;
+#endif
return false; // opt failed
}
} FloorOptimizer;
+struct CeilOptimization : public UnaryDoubleFPOptimizer {
+ CeilOptimization()
+ : UnaryDoubleFPOptimizer("ceil", "Number of 'ceil' calls simplified") {}
+
+ virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) {
+#ifdef HAVE_CEILF
+ // If this is a float argument passed in, convert to ceilf.
+ if (ShrinkFunctionToFloatVersion(CI, SLC, &SimplifyLibCalls::get_ceilf))
+ return true;
+#endif
+ return false; // opt failed
+ }
+} CeilOptimizer;
+
+struct RoundOptimization : public UnaryDoubleFPOptimizer {
+ RoundOptimization()
+ : UnaryDoubleFPOptimizer("round", "Number of 'round' calls simplified") {}
+
+ virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) {
+#ifdef HAVE_ROUNDF
+ // If this is a float argument passed in, convert to roundf.
+ if (ShrinkFunctionToFloatVersion(CI, SLC, &SimplifyLibCalls::get_roundf))
+ return true;
+#endif
+ return false; // opt failed
+ }
+} RoundOptimizer;
+
+struct RintOptimization : public UnaryDoubleFPOptimizer {
+ RintOptimization()
+ : UnaryDoubleFPOptimizer("rint", "Number of 'rint' calls simplified") {}
+
+ virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) {
+#ifdef HAVE_RINTF
+ // If this is a float argument passed in, convert to rintf.
+ if (ShrinkFunctionToFloatVersion(CI, SLC, &SimplifyLibCalls::get_rintf))
+ return true;
+#endif
+ return false; // opt failed
+ }
+} RintOptimizer;
+struct NearByIntOptimization : public UnaryDoubleFPOptimizer {
+ NearByIntOptimization()
+ : UnaryDoubleFPOptimizer("nearbyint",
+ "Number of 'nearbyint' calls simplified") {}
+
+ virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) {
+#ifdef HAVE_NEARBYINTF
+ // If this is a float argument passed in, convert to nearbyintf.
+ if (ShrinkFunctionToFloatVersion(CI, SLC,&SimplifyLibCalls::get_nearbyintf))
+ return true;
+#endif
+ return false; // opt failed
+ }
+} NearByIntOptimizer;
/// A function to compute the length of a null-terminated constant array of
/// integers. This function can't rely on the size of the constant array
/// of the null-terminated string. If false is returned, the conditions were
/// not met and len is set to 0.
/// @brief Get the length of a constant string (null-terminated array).
-bool getConstantStringLength(Value* V, uint64_t& len, ConstantArray** CA )
-{
+bool getConstantStringLength(Value *V, uint64_t &len, ConstantArray **CA) {
assert(V != 0 && "Invalid args to getConstantStringLength");
len = 0; // make sure we initialize this
User* GEP = 0;
// Check to make sure that the first operand of the GEP is an integer and
// has value 0 so that we are sure we're indexing into the initializer.
- if (ConstantInt* op1 = dyn_cast<ConstantInt>(GEP->getOperand(1)))
- {
+ if (ConstantInt* op1 = dyn_cast<ConstantInt>(GEP->getOperand(1))) {
if (!op1->isNullValue())
return false;
- }
- else
+ } else
return false;
// Ensure that the second operand is a ConstantInt. If it isn't then this
Constant* INTLZR = GV->getInitializer();
// Handle the ConstantAggregateZero case
- if (ConstantAggregateZero* CAZ = dyn_cast<ConstantAggregateZero>(INTLZR))
- {
+ if (ConstantAggregateZero *CAZ = dyn_cast<ConstantAggregateZero>(INTLZR)) {
// This is a degenerate case. The initializer is constant zero so the
// length of the string must be zero.
len = 0;
// Traverse the constant array from start_idx (derived above) which is
// the place the GEP refers to in the array.
- for ( len = start_idx; len < max_elems; len++)
- {
- if (ConstantInt* CI = dyn_cast<ConstantInt>(A->getOperand(len)))
- {
+ for (len = start_idx; len < max_elems; len++) {
+ if (ConstantInt *CI = dyn_cast<ConstantInt>(A->getOperand(len))) {
// Check for the null terminator
if (CI->isNullValue())
break; // we found end of string
- }
- else
+ } else
return false; // This array isn't suitable, non-int initializer
}
+
if (len >= max_elems)
return false; // This array isn't null terminated
// exp, expf, expl:
// * exp(log(x)) -> x
//
-// isascii:
-// * isascii(c) -> ((c & ~0x7f) == 0)
-//
-// isdigit:
-// * isdigit(c) -> (unsigned)(c) - '0' <= 9
-//
// log, logf, logl:
// * log(exp(x)) -> x
// * log(x**y) -> y*log(x)
projects / oota-llvm.git / blobdiff