Reid Spencer | b7c11e3 | 2005-04-25 03:59:26 +0000 | [diff] [blame] | 1 | //===- SimplifyLibCalls.cpp - Optimize specific well-known library calls --===// |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | 4ee451d | 2007-12-29 20:36:04 +0000 | [diff] [blame^] | 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 10 | // This file implements a module pass that applies a variety of small |
| 11 | // optimizations for calls to specific well-known function calls (e.g. runtime |
| 12 | // library functions). For example, a call to the function "exit(3)" that |
Reid Spencer | 0660f75 | 2005-05-21 00:57:44 +0000 | [diff] [blame] | 13 | // occurs within the main() function can be transformed into a simple "return 3" |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 14 | // instruction. Any optimization that takes this form (replace call to library |
| 15 | // function with simpler code that provides the same result) belongs in this |
| 16 | // file. |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 17 | // |
| 18 | //===----------------------------------------------------------------------===// |
| 19 | |
Reid Spencer | ef99ea3 | 2005-04-26 23:05:17 +0000 | [diff] [blame] | 20 | #define DEBUG_TYPE "simplify-libcalls" |
Reid Spencer | 8f13261 | 2005-04-26 23:02:16 +0000 | [diff] [blame] | 21 | #include "llvm/Constants.h" |
| 22 | #include "llvm/DerivedTypes.h" |
| 23 | #include "llvm/Instructions.h" |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 24 | #include "llvm/Module.h" |
| 25 | #include "llvm/Pass.h" |
Reid Spencer | b7c11e3 | 2005-04-25 03:59:26 +0000 | [diff] [blame] | 26 | #include "llvm/ADT/hash_map" |
Reid Spencer | 8f13261 | 2005-04-26 23:02:16 +0000 | [diff] [blame] | 27 | #include "llvm/ADT/Statistic.h" |
Reid Spencer | aa87e05 | 2006-01-19 08:36:56 +0000 | [diff] [blame] | 28 | #include "llvm/Config/config.h" |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 29 | #include "llvm/Support/Compiler.h" |
Reid Spencer | 8f13261 | 2005-04-26 23:02:16 +0000 | [diff] [blame] | 30 | #include "llvm/Support/Debug.h" |
Reid Spencer | fcbdb9c | 2005-04-26 19:13:17 +0000 | [diff] [blame] | 31 | #include "llvm/Target/TargetData.h" |
Reid Spencer | 8f13261 | 2005-04-26 23:02:16 +0000 | [diff] [blame] | 32 | #include "llvm/Transforms/IPO.h" |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 33 | using namespace llvm; |
| 34 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 35 | /// This statistic keeps track of the total number of library calls that have |
| 36 | /// been simplified regardless of which call it is. |
Chris Lattner | 86453c5 | 2006-12-19 22:09:18 +0000 | [diff] [blame] | 37 | STATISTIC(SimplifiedLibCalls, "Number of library calls simplified"); |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 38 | |
Chris Lattner | 86453c5 | 2006-12-19 22:09:18 +0000 | [diff] [blame] | 39 | namespace { |
| 40 | // Forward declarations |
| 41 | class LibCallOptimization; |
| 42 | class SimplifyLibCalls; |
| 43 | |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 44 | /// This list is populated by the constructor for LibCallOptimization class. |
Reid Spencer | 8902602 | 2005-05-21 01:27:04 +0000 | [diff] [blame] | 45 | /// Therefore all subclasses are registered here at static initialization time |
| 46 | /// and this list is what the SimplifyLibCalls pass uses to apply the individual |
| 47 | /// optimizations to the call sites. |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 48 | /// @brief The list of optimizations deriving from LibCallOptimization |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 49 | static LibCallOptimization *OptList = 0; |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 50 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 51 | /// This class is the abstract base class for the set of optimizations that |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 52 | /// corresponds to one library call. The SimplifyLibCalls pass will call the |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 53 | /// ValidateCalledFunction method to ask the optimization if a given Function |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 54 | /// is the kind that the optimization can handle. If the subclass returns true, |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 55 | /// then SImplifyLibCalls will also call the OptimizeCall method to perform, |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 56 | /// or attempt to perform, the optimization(s) for the library call. Otherwise, |
| 57 | /// OptimizeCall won't be called. Subclasses are responsible for providing the |
| 58 | /// name of the library call (strlen, strcpy, etc.) to the LibCallOptimization |
| 59 | /// constructor. This is used to efficiently select which call instructions to |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 60 | /// optimize. The criteria for a "lib call" is "anything with well known |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 61 | /// semantics", typically a library function that is defined by an international |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 62 | /// standard. Because the semantics are well known, the optimizations can |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 63 | /// generally short-circuit actually calling the function if there's a simpler |
| 64 | /// way (e.g. strlen(X) can be reduced to a constant if X is a constant global). |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 65 | /// @brief Base class for library call optimizations |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 66 | class VISIBILITY_HIDDEN LibCallOptimization { |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 67 | LibCallOptimization **Prev, *Next; |
| 68 | const char *FunctionName; ///< Name of the library call we optimize |
| 69 | #ifndef NDEBUG |
Chris Lattner | ac0b6ae | 2006-12-06 17:46:33 +0000 | [diff] [blame] | 70 | Statistic occurrences; ///< debug statistic (-debug-only=simplify-libcalls) |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 71 | #endif |
Jeff Cohen | 5882b92 | 2005-04-29 03:05:44 +0000 | [diff] [blame] | 72 | public: |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 73 | /// The \p fname argument must be the name of the library function being |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 74 | /// optimized by the subclass. |
| 75 | /// @brief Constructor that registers the optimization. |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 76 | LibCallOptimization(const char *FName, const char *Description) |
Chris Lattner | 1c560ad | 2006-12-19 23:16:47 +0000 | [diff] [blame] | 77 | : FunctionName(FName) { |
| 78 | |
Reid Spencer | 1ea099c | 2005-04-27 00:05:45 +0000 | [diff] [blame] | 79 | #ifndef NDEBUG |
Chris Lattner | 1c560ad | 2006-12-19 23:16:47 +0000 | [diff] [blame] | 80 | occurrences.construct("simplify-libcalls", Description); |
Reid Spencer | 1ea099c | 2005-04-27 00:05:45 +0000 | [diff] [blame] | 81 | #endif |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 82 | // Register this optimizer in the list of optimizations. |
| 83 | Next = OptList; |
| 84 | OptList = this; |
| 85 | Prev = &OptList; |
| 86 | if (Next) Next->Prev = &Next; |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 87 | } |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 88 | |
| 89 | /// getNext - All libcall optimizations are chained together into a list, |
| 90 | /// return the next one in the list. |
| 91 | LibCallOptimization *getNext() { return Next; } |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 92 | |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 93 | /// @brief Deregister from the optlist |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 94 | virtual ~LibCallOptimization() { |
| 95 | *Prev = Next; |
| 96 | if (Next) Next->Prev = Prev; |
| 97 | } |
Reid Spencer | 43e0bae | 2005-04-26 03:26:15 +0000 | [diff] [blame] | 98 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 99 | /// The implementation of this function in subclasses should determine if |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 100 | /// \p F is suitable for the optimization. This method is called by |
| 101 | /// SimplifyLibCalls::runOnModule to short circuit visiting all the call |
| 102 | /// sites of such a function if that function is not suitable in the first |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 103 | /// place. If the called function is suitabe, this method should return true; |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 104 | /// false, otherwise. This function should also perform any lazy |
| 105 | /// initialization that the LibCallOptimization needs to do, if its to return |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 106 | /// true. This avoids doing initialization until the optimizer is actually |
| 107 | /// going to be called upon to do some optimization. |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 108 | /// @brief Determine if the function is suitable for optimization |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 109 | virtual bool ValidateCalledFunction( |
| 110 | const Function* F, ///< The function that is the target of call sites |
| 111 | SimplifyLibCalls& SLC ///< The pass object invoking us |
| 112 | ) = 0; |
Reid Spencer | fcbdb9c | 2005-04-26 19:13:17 +0000 | [diff] [blame] | 113 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 114 | /// The implementations of this function in subclasses is the heart of the |
| 115 | /// SimplifyLibCalls algorithm. Sublcasses of this class implement |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 116 | /// OptimizeCall to determine if (a) the conditions are right for optimizing |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 117 | /// the call and (b) to perform the optimization. If an action is taken |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 118 | /// against ci, the subclass is responsible for returning true and ensuring |
| 119 | /// that ci is erased from its parent. |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 120 | /// @brief Optimize a call, if possible. |
| 121 | virtual bool OptimizeCall( |
| 122 | CallInst* ci, ///< The call instruction that should be optimized. |
| 123 | SimplifyLibCalls& SLC ///< The pass object invoking us |
| 124 | ) = 0; |
Reid Spencer | fcbdb9c | 2005-04-26 19:13:17 +0000 | [diff] [blame] | 125 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 126 | /// @brief Get the name of the library call being optimized |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 127 | const char *getFunctionName() const { return FunctionName; } |
Reid Spencer | fcbdb9c | 2005-04-26 19:13:17 +0000 | [diff] [blame] | 128 | |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 129 | bool ReplaceCallWith(CallInst *CI, Value *V) { |
| 130 | if (!CI->use_empty()) |
| 131 | CI->replaceAllUsesWith(V); |
| 132 | CI->eraseFromParent(); |
| 133 | return true; |
| 134 | } |
| 135 | |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 136 | /// @brief Called by SimplifyLibCalls to update the occurrences statistic. |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 137 | void succeeded() { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 138 | #ifndef NDEBUG |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 139 | DEBUG(++occurrences); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 140 | #endif |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 141 | } |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 142 | }; |
| 143 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 144 | /// This class is an LLVM Pass that applies each of the LibCallOptimization |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 145 | /// instances to all the call sites in a module, relatively efficiently. The |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 146 | /// purpose of this pass is to provide optimizations for calls to well-known |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 147 | /// functions with well-known semantics, such as those in the c library. The |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 148 | /// class provides the basic infrastructure for handling runOnModule. Whenever |
| 149 | /// this pass finds a function call, it asks the appropriate optimizer to |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 150 | /// validate the call (ValidateLibraryCall). If it is validated, then |
| 151 | /// the OptimizeCall method is also called. |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 152 | /// @brief A ModulePass for optimizing well-known function calls. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 153 | class VISIBILITY_HIDDEN SimplifyLibCalls : public ModulePass { |
Jeff Cohen | 5882b92 | 2005-04-29 03:05:44 +0000 | [diff] [blame] | 154 | public: |
Nick Lewycky | ecd94c8 | 2007-05-06 13:37:16 +0000 | [diff] [blame] | 155 | static char ID; // Pass identification, replacement for typeid |
Devang Patel | 794fd75 | 2007-05-01 21:15:47 +0000 | [diff] [blame] | 156 | SimplifyLibCalls() : ModulePass((intptr_t)&ID) {} |
| 157 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 158 | /// We need some target data for accurate signature details that are |
| 159 | /// target dependent. So we require target data in our AnalysisUsage. |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 160 | /// @brief Require TargetData from AnalysisUsage. |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 161 | virtual void getAnalysisUsage(AnalysisUsage& Info) const { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 162 | // Ask that the TargetData analysis be performed before us so we can use |
| 163 | // the target data. |
| 164 | Info.addRequired<TargetData>(); |
| 165 | } |
| 166 | |
| 167 | /// For this pass, process all of the function calls in the module, calling |
| 168 | /// ValidateLibraryCall and OptimizeCall as appropriate. |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 169 | /// @brief Run all the lib call optimizations on a Module. |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 170 | virtual bool runOnModule(Module &M) { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 171 | reset(M); |
| 172 | |
| 173 | bool result = false; |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 174 | hash_map<std::string, LibCallOptimization*> OptznMap; |
| 175 | for (LibCallOptimization *Optzn = OptList; Optzn; Optzn = Optzn->getNext()) |
| 176 | OptznMap[Optzn->getFunctionName()] = Optzn; |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 177 | |
| 178 | // The call optimizations can be recursive. That is, the optimization might |
| 179 | // generate a call to another function which can also be optimized. This way |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 180 | // we make the LibCallOptimization instances very specific to the case they |
| 181 | // handle. It also means we need to keep running over the function calls in |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 182 | // the module until we don't get any more optimizations possible. |
| 183 | bool found_optimization = false; |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 184 | do { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 185 | found_optimization = false; |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 186 | for (Module::iterator FI = M.begin(), FE = M.end(); FI != FE; ++FI) { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 187 | // All the "well-known" functions are external and have external linkage |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 188 | // because they live in a runtime library somewhere and were (probably) |
| 189 | // not compiled by LLVM. So, we only act on external functions that |
Anton Korobeynikov | b74ed07 | 2006-09-14 18:23:27 +0000 | [diff] [blame] | 190 | // have external or dllimport linkage and non-empty uses. |
Reid Spencer | 5cbf985 | 2007-01-30 20:08:39 +0000 | [diff] [blame] | 191 | if (!FI->isDeclaration() || |
Anton Korobeynikov | b74ed07 | 2006-09-14 18:23:27 +0000 | [diff] [blame] | 192 | !(FI->hasExternalLinkage() || FI->hasDLLImportLinkage()) || |
| 193 | FI->use_empty()) |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 194 | continue; |
| 195 | |
| 196 | // Get the optimization class that pertains to this function |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 197 | hash_map<std::string, LibCallOptimization*>::iterator OMI = |
| 198 | OptznMap.find(FI->getName()); |
| 199 | if (OMI == OptznMap.end()) continue; |
| 200 | |
| 201 | LibCallOptimization *CO = OMI->second; |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 202 | |
| 203 | // Make sure the called function is suitable for the optimization |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 204 | if (!CO->ValidateCalledFunction(FI, *this)) |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 205 | continue; |
| 206 | |
| 207 | // Loop over each of the uses of the function |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 208 | for (Value::use_iterator UI = FI->use_begin(), UE = FI->use_end(); |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 209 | UI != UE ; ) { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 210 | // If the use of the function is a call instruction |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 211 | if (CallInst* CI = dyn_cast<CallInst>(*UI++)) { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 212 | // Do the optimization on the LibCallOptimization. |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 213 | if (CO->OptimizeCall(CI, *this)) { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 214 | ++SimplifiedLibCalls; |
| 215 | found_optimization = result = true; |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 216 | CO->succeeded(); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 217 | } |
Reid Spencer | fcbdb9c | 2005-04-26 19:13:17 +0000 | [diff] [blame] | 218 | } |
| 219 | } |
| 220 | } |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 221 | } while (found_optimization); |
Chris Lattner | e05cf71 | 2006-01-22 23:10:26 +0000 | [diff] [blame] | 222 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 223 | return result; |
| 224 | } |
Reid Spencer | fcbdb9c | 2005-04-26 19:13:17 +0000 | [diff] [blame] | 225 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 226 | /// @brief Return the *current* module we're working on. |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 227 | Module* getModule() const { return M; } |
Reid Spencer | fcbdb9c | 2005-04-26 19:13:17 +0000 | [diff] [blame] | 228 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 229 | /// @brief Return the *current* target data for the module we're working on. |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 230 | TargetData* getTargetData() const { return TD; } |
| 231 | |
| 232 | /// @brief Return the size_t type -- syntactic shortcut |
| 233 | const Type* getIntPtrType() const { return TD->getIntPtrType(); } |
| 234 | |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 235 | /// @brief Return a Function* for the putchar libcall |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 236 | Constant *get_putchar() { |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 237 | if (!putchar_func) |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 238 | putchar_func = |
| 239 | M->getOrInsertFunction("putchar", Type::Int32Ty, Type::Int32Ty, NULL); |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 240 | return putchar_func; |
| 241 | } |
| 242 | |
| 243 | /// @brief Return a Function* for the puts libcall |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 244 | Constant *get_puts() { |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 245 | if (!puts_func) |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 246 | puts_func = M->getOrInsertFunction("puts", Type::Int32Ty, |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 247 | PointerType::getUnqual(Type::Int8Ty), |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 248 | NULL); |
| 249 | return puts_func; |
| 250 | } |
| 251 | |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 252 | /// @brief Return a Function* for the fputc libcall |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 253 | Constant *get_fputc(const Type* FILEptr_type) { |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 254 | if (!fputc_func) |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 255 | fputc_func = M->getOrInsertFunction("fputc", Type::Int32Ty, Type::Int32Ty, |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 256 | FILEptr_type, NULL); |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 257 | return fputc_func; |
| 258 | } |
| 259 | |
Evan Cheng | 9528952 | 2006-06-16 04:52:30 +0000 | [diff] [blame] | 260 | /// @brief Return a Function* for the fputs libcall |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 261 | Constant *get_fputs(const Type* FILEptr_type) { |
Evan Cheng | 9528952 | 2006-06-16 04:52:30 +0000 | [diff] [blame] | 262 | if (!fputs_func) |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 263 | fputs_func = M->getOrInsertFunction("fputs", Type::Int32Ty, |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 264 | PointerType::getUnqual(Type::Int8Ty), |
Evan Cheng | 9528952 | 2006-06-16 04:52:30 +0000 | [diff] [blame] | 265 | FILEptr_type, NULL); |
| 266 | return fputs_func; |
| 267 | } |
| 268 | |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 269 | /// @brief Return a Function* for the fwrite libcall |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 270 | Constant *get_fwrite(const Type* FILEptr_type) { |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 271 | if (!fwrite_func) |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 272 | fwrite_func = M->getOrInsertFunction("fwrite", TD->getIntPtrType(), |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 273 | PointerType::getUnqual(Type::Int8Ty), |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 274 | TD->getIntPtrType(), |
| 275 | TD->getIntPtrType(), |
| 276 | FILEptr_type, NULL); |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 277 | return fwrite_func; |
| 278 | } |
| 279 | |
| 280 | /// @brief Return a Function* for the sqrt libcall |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 281 | Constant *get_sqrt() { |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 282 | if (!sqrt_func) |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 283 | sqrt_func = M->getOrInsertFunction("sqrt", Type::DoubleTy, |
| 284 | Type::DoubleTy, NULL); |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 285 | return sqrt_func; |
| 286 | } |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 287 | |
Owen Anderson | f4d5de4 | 2007-01-20 10:07:23 +0000 | [diff] [blame] | 288 | /// @brief Return a Function* for the strcpy libcall |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 289 | Constant *get_strcpy() { |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 290 | if (!strcpy_func) |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 291 | strcpy_func = M->getOrInsertFunction("strcpy", |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 292 | PointerType::getUnqual(Type::Int8Ty), |
| 293 | PointerType::getUnqual(Type::Int8Ty), |
| 294 | PointerType::getUnqual(Type::Int8Ty), |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 295 | NULL); |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 296 | return strcpy_func; |
| 297 | } |
| 298 | |
| 299 | /// @brief Return a Function* for the strlen libcall |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 300 | Constant *get_strlen() { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 301 | if (!strlen_func) |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 302 | strlen_func = M->getOrInsertFunction("strlen", TD->getIntPtrType(), |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 303 | PointerType::getUnqual(Type::Int8Ty), |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 304 | NULL); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 305 | return strlen_func; |
Reid Spencer | 43e0bae | 2005-04-26 03:26:15 +0000 | [diff] [blame] | 306 | } |
| 307 | |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 308 | /// @brief Return a Function* for the memchr libcall |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 309 | Constant *get_memchr() { |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 310 | if (!memchr_func) |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 311 | memchr_func = M->getOrInsertFunction("memchr", |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 312 | PointerType::getUnqual(Type::Int8Ty), |
| 313 | PointerType::getUnqual(Type::Int8Ty), |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 314 | Type::Int32Ty, TD->getIntPtrType(), |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 315 | NULL); |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 316 | return memchr_func; |
| 317 | } |
| 318 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 319 | /// @brief Return a Function* for the memcpy libcall |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 320 | Constant *get_memcpy() { |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 321 | if (!memcpy_func) { |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 322 | const Type *SBP = PointerType::getUnqual(Type::Int8Ty); |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 323 | const char *N = TD->getIntPtrType() == Type::Int32Ty ? |
Chris Lattner | aecb062 | 2006-03-03 01:30:23 +0000 | [diff] [blame] | 324 | "llvm.memcpy.i32" : "llvm.memcpy.i64"; |
| 325 | memcpy_func = M->getOrInsertFunction(N, Type::VoidTy, SBP, SBP, |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 326 | TD->getIntPtrType(), Type::Int32Ty, |
Chris Lattner | aecb062 | 2006-03-03 01:30:23 +0000 | [diff] [blame] | 327 | NULL); |
Reid Spencer | 43e0bae | 2005-04-26 03:26:15 +0000 | [diff] [blame] | 328 | } |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 329 | return memcpy_func; |
Reid Spencer | 43e0bae | 2005-04-26 03:26:15 +0000 | [diff] [blame] | 330 | } |
Reid Spencer | 912401c | 2005-04-26 05:24:00 +0000 | [diff] [blame] | 331 | |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 332 | Constant *getUnaryFloatFunction(const char *Name, Constant *&Cache) { |
Chris Lattner | e46f6e9 | 2006-01-23 06:24:46 +0000 | [diff] [blame] | 333 | if (!Cache) |
| 334 | Cache = M->getOrInsertFunction(Name, Type::FloatTy, Type::FloatTy, NULL); |
| 335 | return Cache; |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 336 | } |
| 337 | |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 338 | Constant *get_floorf() { return getUnaryFloatFunction("floorf", floorf_func);} |
| 339 | Constant *get_ceilf() { return getUnaryFloatFunction( "ceilf", ceilf_func);} |
| 340 | Constant *get_roundf() { return getUnaryFloatFunction("roundf", roundf_func);} |
| 341 | Constant *get_rintf() { return getUnaryFloatFunction( "rintf", rintf_func);} |
| 342 | Constant *get_nearbyintf() { return getUnaryFloatFunction("nearbyintf", |
Chris Lattner | e46f6e9 | 2006-01-23 06:24:46 +0000 | [diff] [blame] | 343 | nearbyintf_func); } |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 344 | private: |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 345 | /// @brief Reset our cached data for a new Module |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 346 | void reset(Module& mod) { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 347 | M = &mod; |
| 348 | TD = &getAnalysis<TargetData>(); |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 349 | putchar_func = 0; |
| 350 | puts_func = 0; |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 351 | fputc_func = 0; |
Evan Cheng | 9528952 | 2006-06-16 04:52:30 +0000 | [diff] [blame] | 352 | fputs_func = 0; |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 353 | fwrite_func = 0; |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 354 | memcpy_func = 0; |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 355 | memchr_func = 0; |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 356 | sqrt_func = 0; |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 357 | strcpy_func = 0; |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 358 | strlen_func = 0; |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 359 | floorf_func = 0; |
Chris Lattner | e46f6e9 | 2006-01-23 06:24:46 +0000 | [diff] [blame] | 360 | ceilf_func = 0; |
| 361 | roundf_func = 0; |
| 362 | rintf_func = 0; |
| 363 | nearbyintf_func = 0; |
Reid Spencer | 912401c | 2005-04-26 05:24:00 +0000 | [diff] [blame] | 364 | } |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 365 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 366 | private: |
Chris Lattner | e46f6e9 | 2006-01-23 06:24:46 +0000 | [diff] [blame] | 367 | /// Caches for function pointers. |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 368 | Constant *putchar_func, *puts_func; |
| 369 | Constant *fputc_func, *fputs_func, *fwrite_func; |
| 370 | Constant *memcpy_func, *memchr_func; |
| 371 | Constant *sqrt_func; |
| 372 | Constant *strcpy_func, *strlen_func; |
| 373 | Constant *floorf_func, *ceilf_func, *roundf_func; |
| 374 | Constant *rintf_func, *nearbyintf_func; |
Chris Lattner | e46f6e9 | 2006-01-23 06:24:46 +0000 | [diff] [blame] | 375 | Module *M; ///< Cached Module |
| 376 | TargetData *TD; ///< Cached TargetData |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 377 | }; |
| 378 | |
Devang Patel | 1997473 | 2007-05-03 01:11:54 +0000 | [diff] [blame] | 379 | char SimplifyLibCalls::ID = 0; |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 380 | // Register the pass |
Chris Lattner | 7f8897f | 2006-08-27 22:42:52 +0000 | [diff] [blame] | 381 | RegisterPass<SimplifyLibCalls> |
| 382 | X("simplify-libcalls", "Simplify well-known library calls"); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 383 | |
| 384 | } // anonymous namespace |
| 385 | |
| 386 | // The only public symbol in this file which just instantiates the pass object |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 387 | ModulePass *llvm::createSimplifyLibCallsPass() { |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 388 | return new SimplifyLibCalls(); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 389 | } |
| 390 | |
| 391 | // Classes below here, in the anonymous namespace, are all subclasses of the |
| 392 | // LibCallOptimization class, each implementing all optimizations possible for a |
| 393 | // single well-known library call. Each has a static singleton instance that |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 394 | // auto registers it into the "optlist" global above. |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 395 | namespace { |
| 396 | |
Reid Spencer | 134d2e4 | 2005-06-18 17:46:28 +0000 | [diff] [blame] | 397 | // Forward declare utility functions. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 398 | static bool GetConstantStringInfo(Value *V, std::string &Str); |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 399 | static Value *CastToCStr(Value *V, Instruction *IP); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 400 | |
| 401 | /// This LibCallOptimization will find instances of a call to "exit" that occurs |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 402 | /// within the "main" function and change it to a simple "ret" instruction with |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 403 | /// the same value passed to the exit function. When this is done, it splits the |
| 404 | /// basic block at the exit(3) call and deletes the call instruction. |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 405 | /// @brief Replace calls to exit in main with a simple return |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 406 | struct VISIBILITY_HIDDEN ExitInMainOptimization : public LibCallOptimization { |
Reid Spencer | 9974dda | 2005-05-03 02:54:54 +0000 | [diff] [blame] | 407 | ExitInMainOptimization() : LibCallOptimization("exit", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 408 | "Number of 'exit' calls simplified") {} |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 409 | |
| 410 | // Make sure the called function looks like exit (int argument, int return |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 411 | // type, external linkage, not varargs). |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 412 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
Chris Lattner | 42a7551 | 2007-01-15 02:27:26 +0000 | [diff] [blame] | 413 | return F->arg_size() >= 1 && F->arg_begin()->getType()->isInteger(); |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 414 | } |
| 415 | |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 416 | virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& SLC) { |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 417 | // To be careful, we check that the call to exit is coming from "main", that |
| 418 | // main has external linkage, and the return type of main and the argument |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 419 | // to exit have the same type. |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 420 | Function *from = ci->getParent()->getParent(); |
| 421 | if (from->hasExternalLinkage()) |
| 422 | if (from->getReturnType() == ci->getOperand(1)->getType()) |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 423 | if (from->getName() == "main") { |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 424 | // Okay, time to actually do the optimization. First, get the basic |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 425 | // block of the call instruction |
| 426 | BasicBlock* bb = ci->getParent(); |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 427 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 428 | // Create a return instruction that we'll replace the call with. |
| 429 | // Note that the argument of the return is the argument of the call |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 430 | // instruction. |
Chris Lattner | 2144c25 | 2006-05-12 23:35:26 +0000 | [diff] [blame] | 431 | new ReturnInst(ci->getOperand(1), ci); |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 432 | |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 433 | // Split the block at the call instruction which places it in a new |
| 434 | // basic block. |
Reid Spencer | 43e0bae | 2005-04-26 03:26:15 +0000 | [diff] [blame] | 435 | bb->splitBasicBlock(ci); |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 436 | |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 437 | // The block split caused a branch instruction to be inserted into |
| 438 | // the end of the original block, right after the return instruction |
| 439 | // that we put there. That's not a valid block, so delete the branch |
| 440 | // instruction. |
Reid Spencer | 43e0bae | 2005-04-26 03:26:15 +0000 | [diff] [blame] | 441 | bb->getInstList().pop_back(); |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 442 | |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 443 | // Now we can finally get rid of the call instruction which now lives |
| 444 | // in the new basic block. |
| 445 | ci->eraseFromParent(); |
| 446 | |
| 447 | // Optimization succeeded, return true. |
| 448 | return true; |
| 449 | } |
| 450 | // We didn't pass the criteria for this optimization so return false |
| 451 | return false; |
Reid Spencer | b7c11e3 | 2005-04-25 03:59:26 +0000 | [diff] [blame] | 452 | } |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 453 | } ExitInMainOptimizer; |
| 454 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 455 | /// This LibCallOptimization will simplify a call to the strcat library |
| 456 | /// function. The simplification is possible only if the string being |
| 457 | /// concatenated is a constant array or a constant expression that results in |
| 458 | /// a constant string. In this case we can replace it with strlen + llvm.memcpy |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 459 | /// of the constant string. Both of these calls are further reduced, if possible |
| 460 | /// on subsequent passes. |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 461 | /// @brief Simplify the strcat library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 462 | struct VISIBILITY_HIDDEN StrCatOptimization : public LibCallOptimization { |
Reid Spencer | 43e0bae | 2005-04-26 03:26:15 +0000 | [diff] [blame] | 463 | public: |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 464 | /// @brief Default constructor |
Reid Spencer | 9974dda | 2005-05-03 02:54:54 +0000 | [diff] [blame] | 465 | StrCatOptimization() : LibCallOptimization("strcat", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 466 | "Number of 'strcat' calls simplified") {} |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 467 | |
| 468 | public: |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 469 | |
| 470 | /// @brief Make sure that the "strcat" function has the right prototype |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 471 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
| 472 | const FunctionType *FT = F->getFunctionType(); |
| 473 | return FT->getNumParams() == 2 && |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 474 | FT->getReturnType() == PointerType::getUnqual(Type::Int8Ty) && |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 475 | FT->getParamType(0) == FT->getReturnType() && |
| 476 | FT->getParamType(1) == FT->getReturnType(); |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 477 | } |
| 478 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 479 | /// @brief Optimize the strcat library function |
Chris Lattner | 09c11aa | 2007-04-06 22:59:33 +0000 | [diff] [blame] | 480 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
Reid Spencer | 3f7d8c6 | 2005-04-27 17:46:54 +0000 | [diff] [blame] | 481 | // Extract some information from the instruction |
Chris Lattner | 09c11aa | 2007-04-06 22:59:33 +0000 | [diff] [blame] | 482 | Value *Dst = CI->getOperand(1); |
| 483 | Value *Src = CI->getOperand(2); |
Reid Spencer | 3f7d8c6 | 2005-04-27 17:46:54 +0000 | [diff] [blame] | 484 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 485 | // Extract the initializer (while making numerous checks) from the |
Chris Lattner | 09c11aa | 2007-04-06 22:59:33 +0000 | [diff] [blame] | 486 | // source operand of the call to strcat. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 487 | std::string SrcStr; |
| 488 | if (!GetConstantStringInfo(Src, SrcStr)) |
Reid Spencer | 43e0bae | 2005-04-26 03:26:15 +0000 | [diff] [blame] | 489 | return false; |
| 490 | |
Reid Spencer | 20754ac | 2005-04-26 07:45:18 +0000 | [diff] [blame] | 491 | // Handle the simple, do-nothing case |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 492 | if (SrcStr.empty()) |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 493 | return ReplaceCallWith(CI, Dst); |
Reid Spencer | 43e0bae | 2005-04-26 03:26:15 +0000 | [diff] [blame] | 494 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 495 | // We need to find the end of the destination string. That's where the |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 496 | // memory is to be moved to. We just generate a call to strlen. |
Chris Lattner | 09c11aa | 2007-04-06 22:59:33 +0000 | [diff] [blame] | 497 | CallInst *DstLen = new CallInst(SLC.get_strlen(), Dst, |
| 498 | Dst->getName()+".len", CI); |
Reid Spencer | 20754ac | 2005-04-26 07:45:18 +0000 | [diff] [blame] | 499 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 500 | // Now that we have the destination's length, we must index into the |
Reid Spencer | 20754ac | 2005-04-26 07:45:18 +0000 | [diff] [blame] | 501 | // destination's pointer to get the actual memcpy destination (end of |
| 502 | // the string .. we're concatenating). |
Chris Lattner | 09c11aa | 2007-04-06 22:59:33 +0000 | [diff] [blame] | 503 | Dst = new GetElementPtrInst(Dst, DstLen, Dst->getName()+".indexed", CI); |
Reid Spencer | 20754ac | 2005-04-26 07:45:18 +0000 | [diff] [blame] | 504 | |
| 505 | // We have enough information to now generate the memcpy call to |
| 506 | // do the concatenation for us. |
Chris Lattner | 09c11aa | 2007-04-06 22:59:33 +0000 | [diff] [blame] | 507 | Value *Vals[] = { |
| 508 | Dst, Src, |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 509 | ConstantInt::get(SLC.getIntPtrType(), SrcStr.size()+1), // copy nul byte. |
Chris Lattner | 09c11aa | 2007-04-06 22:59:33 +0000 | [diff] [blame] | 510 | ConstantInt::get(Type::Int32Ty, 1) // alignment |
| 511 | }; |
David Greene | 52eec54 | 2007-08-01 03:43:44 +0000 | [diff] [blame] | 512 | new CallInst(SLC.get_memcpy(), Vals, Vals + 4, "", CI); |
Reid Spencer | 20754ac | 2005-04-26 07:45:18 +0000 | [diff] [blame] | 513 | |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 514 | return ReplaceCallWith(CI, Dst); |
Reid Spencer | b7c11e3 | 2005-04-25 03:59:26 +0000 | [diff] [blame] | 515 | } |
| 516 | } StrCatOptimizer; |
| 517 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 518 | /// This LibCallOptimization will simplify a call to the strchr library |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 519 | /// function. It optimizes out cases where the arguments are both constant |
| 520 | /// and the result can be determined statically. |
| 521 | /// @brief Simplify the strcmp library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 522 | struct VISIBILITY_HIDDEN StrChrOptimization : public LibCallOptimization { |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 523 | public: |
| 524 | StrChrOptimization() : LibCallOptimization("strchr", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 525 | "Number of 'strchr' calls simplified") {} |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 526 | |
| 527 | /// @brief Make sure that the "strchr" function has the right prototype |
Chris Lattner | 6897fe5 | 2007-04-06 23:38:55 +0000 | [diff] [blame] | 528 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
| 529 | const FunctionType *FT = F->getFunctionType(); |
| 530 | return FT->getNumParams() == 2 && |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 531 | FT->getReturnType() == PointerType::getUnqual(Type::Int8Ty) && |
Chris Lattner | 6897fe5 | 2007-04-06 23:38:55 +0000 | [diff] [blame] | 532 | FT->getParamType(0) == FT->getReturnType() && |
| 533 | isa<IntegerType>(FT->getParamType(1)); |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 534 | } |
| 535 | |
Chris Lattner | 9375135 | 2005-05-20 22:22:25 +0000 | [diff] [blame] | 536 | /// @brief Perform the strchr optimizations |
Chris Lattner | 6897fe5 | 2007-04-06 23:38:55 +0000 | [diff] [blame] | 537 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 538 | // Check that the first argument to strchr is a constant array of sbyte. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 539 | std::string Str; |
| 540 | if (!GetConstantStringInfo(CI->getOperand(1), Str)) |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 541 | return false; |
| 542 | |
Chris Lattner | 6897fe5 | 2007-04-06 23:38:55 +0000 | [diff] [blame] | 543 | // If the second operand is not constant, just lower this to memchr since we |
| 544 | // know the length of the input string. |
| 545 | ConstantInt *CSI = dyn_cast<ConstantInt>(CI->getOperand(2)); |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 546 | if (!CSI) { |
Chris Lattner | 6897fe5 | 2007-04-06 23:38:55 +0000 | [diff] [blame] | 547 | Value *Args[3] = { |
| 548 | CI->getOperand(1), |
| 549 | CI->getOperand(2), |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 550 | ConstantInt::get(SLC.getIntPtrType(), Str.size()+1) |
Chris Lattner | c18470c | 2007-02-13 05:58:53 +0000 | [diff] [blame] | 551 | }; |
David Greene | 52eec54 | 2007-08-01 03:43:44 +0000 | [diff] [blame] | 552 | return ReplaceCallWith(CI, new CallInst(SLC.get_memchr(), Args, Args + 3, |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 553 | CI->getName(), CI)); |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 554 | } |
| 555 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 556 | // strchr can find the nul character. |
| 557 | Str += '\0'; |
Chris Lattner | 6897fe5 | 2007-04-06 23:38:55 +0000 | [diff] [blame] | 558 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 559 | // Get the character we're looking for |
| 560 | char CharValue = CSI->getSExtValue(); |
| 561 | |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 562 | // Compute the offset |
Chris Lattner | 6897fe5 | 2007-04-06 23:38:55 +0000 | [diff] [blame] | 563 | uint64_t i = 0; |
| 564 | while (1) { |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 565 | if (i == Str.size()) // Didn't find the char. strchr returns null. |
| 566 | return ReplaceCallWith(CI, Constant::getNullValue(CI->getType())); |
| 567 | // Did we find our match? |
| 568 | if (Str[i] == CharValue) |
| 569 | break; |
Chris Lattner | 6897fe5 | 2007-04-06 23:38:55 +0000 | [diff] [blame] | 570 | ++i; |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 571 | } |
| 572 | |
Chris Lattner | 6897fe5 | 2007-04-06 23:38:55 +0000 | [diff] [blame] | 573 | // strchr(s+n,c) -> gep(s+n+i,c) |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 574 | // (if c is a constant integer and s is a constant string) |
Chris Lattner | 6897fe5 | 2007-04-06 23:38:55 +0000 | [diff] [blame] | 575 | Value *Idx = ConstantInt::get(Type::Int64Ty, i); |
| 576 | Value *GEP = new GetElementPtrInst(CI->getOperand(1), Idx, |
| 577 | CI->getOperand(1)->getName() + |
| 578 | ".strchr", CI); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 579 | return ReplaceCallWith(CI, GEP); |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 580 | } |
| 581 | } StrChrOptimizer; |
| 582 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 583 | /// This LibCallOptimization will simplify a call to the strcmp library |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 584 | /// function. It optimizes out cases where one or both arguments are constant |
| 585 | /// and the result can be determined statically. |
| 586 | /// @brief Simplify the strcmp library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 587 | struct VISIBILITY_HIDDEN StrCmpOptimization : public LibCallOptimization { |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 588 | public: |
Reid Spencer | 9974dda | 2005-05-03 02:54:54 +0000 | [diff] [blame] | 589 | StrCmpOptimization() : LibCallOptimization("strcmp", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 590 | "Number of 'strcmp' calls simplified") {} |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 591 | |
Chris Lattner | 9375135 | 2005-05-20 22:22:25 +0000 | [diff] [blame] | 592 | /// @brief Make sure that the "strcmp" function has the right prototype |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 593 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
Chris Lattner | ceb375e | 2007-04-07 00:01:51 +0000 | [diff] [blame] | 594 | const FunctionType *FT = F->getFunctionType(); |
| 595 | return FT->getReturnType() == Type::Int32Ty && FT->getNumParams() == 2 && |
| 596 | FT->getParamType(0) == FT->getParamType(1) && |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 597 | FT->getParamType(0) == PointerType::getUnqual(Type::Int8Ty); |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 598 | } |
| 599 | |
Chris Lattner | 9375135 | 2005-05-20 22:22:25 +0000 | [diff] [blame] | 600 | /// @brief Perform the strcmp optimization |
Chris Lattner | ceb375e | 2007-04-07 00:01:51 +0000 | [diff] [blame] | 601 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 602 | // First, check to see if src and destination are the same. If they are, |
Reid Spencer | 63a7513 | 2005-04-30 06:45:47 +0000 | [diff] [blame] | 603 | // then the optimization is to replace the CallInst with a constant 0 |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 604 | // because the call is a no-op. |
Chris Lattner | ceb375e | 2007-04-07 00:01:51 +0000 | [diff] [blame] | 605 | Value *Str1P = CI->getOperand(1); |
| 606 | Value *Str2P = CI->getOperand(2); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 607 | if (Str1P == Str2P) // strcmp(x,x) -> 0 |
| 608 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), 0)); |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 609 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 610 | std::string Str1; |
| 611 | if (!GetConstantStringInfo(Str1P, Str1)) |
| 612 | return false; |
| 613 | if (Str1.empty()) { |
Chris Lattner | ceb375e | 2007-04-07 00:01:51 +0000 | [diff] [blame] | 614 | // strcmp("", x) -> *x |
| 615 | Value *V = new LoadInst(Str2P, CI->getName()+".load", CI); |
| 616 | V = new ZExtInst(V, CI->getType(), CI->getName()+".int", CI); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 617 | return ReplaceCallWith(CI, V); |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 618 | } |
| 619 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 620 | std::string Str2; |
| 621 | if (!GetConstantStringInfo(Str2P, Str2)) |
| 622 | return false; |
| 623 | if (Str2.empty()) { |
Chris Lattner | ceb375e | 2007-04-07 00:01:51 +0000 | [diff] [blame] | 624 | // strcmp(x,"") -> *x |
| 625 | Value *V = new LoadInst(Str1P, CI->getName()+".load", CI); |
| 626 | V = new ZExtInst(V, CI->getType(), CI->getName()+".int", CI); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 627 | return ReplaceCallWith(CI, V); |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 628 | } |
| 629 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 630 | // strcmp(x, y) -> cnst (if both x and y are constant strings) |
| 631 | int R = strcmp(Str1.c_str(), Str2.c_str()); |
| 632 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), R)); |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 633 | } |
| 634 | } StrCmpOptimizer; |
| 635 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 636 | /// This LibCallOptimization will simplify a call to the strncmp library |
Reid Spencer | e6ec8cc | 2005-05-03 01:43:45 +0000 | [diff] [blame] | 637 | /// function. It optimizes out cases where one or both arguments are constant |
| 638 | /// and the result can be determined statically. |
| 639 | /// @brief Simplify the strncmp library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 640 | struct VISIBILITY_HIDDEN StrNCmpOptimization : public LibCallOptimization { |
Reid Spencer | e6ec8cc | 2005-05-03 01:43:45 +0000 | [diff] [blame] | 641 | public: |
Reid Spencer | 9974dda | 2005-05-03 02:54:54 +0000 | [diff] [blame] | 642 | StrNCmpOptimization() : LibCallOptimization("strncmp", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 643 | "Number of 'strncmp' calls simplified") {} |
Reid Spencer | e6ec8cc | 2005-05-03 01:43:45 +0000 | [diff] [blame] | 644 | |
Chris Lattner | 9375135 | 2005-05-20 22:22:25 +0000 | [diff] [blame] | 645 | /// @brief Make sure that the "strncmp" function has the right prototype |
Chris Lattner | 7b50c8f | 2007-04-07 00:06:57 +0000 | [diff] [blame] | 646 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
| 647 | const FunctionType *FT = F->getFunctionType(); |
| 648 | return FT->getReturnType() == Type::Int32Ty && FT->getNumParams() == 3 && |
| 649 | FT->getParamType(0) == FT->getParamType(1) && |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 650 | FT->getParamType(0) == PointerType::getUnqual(Type::Int8Ty) && |
Chris Lattner | 7b50c8f | 2007-04-07 00:06:57 +0000 | [diff] [blame] | 651 | isa<IntegerType>(FT->getParamType(2)); |
Reid Spencer | e6ec8cc | 2005-05-03 01:43:45 +0000 | [diff] [blame] | 652 | return false; |
| 653 | } |
| 654 | |
Chris Lattner | 7b50c8f | 2007-04-07 00:06:57 +0000 | [diff] [blame] | 655 | /// @brief Perform the strncmp optimization |
| 656 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
Reid Spencer | e6ec8cc | 2005-05-03 01:43:45 +0000 | [diff] [blame] | 657 | // First, check to see if src and destination are the same. If they are, |
| 658 | // then the optimization is to replace the CallInst with a constant 0 |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 659 | // because the call is a no-op. |
Chris Lattner | 7b50c8f | 2007-04-07 00:06:57 +0000 | [diff] [blame] | 660 | Value *Str1P = CI->getOperand(1); |
| 661 | Value *Str2P = CI->getOperand(2); |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 662 | if (Str1P == Str2P) // strncmp(x,x, n) -> 0 |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 663 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), 0)); |
Chris Lattner | 7b50c8f | 2007-04-07 00:06:57 +0000 | [diff] [blame] | 664 | |
Reid Spencer | e6ec8cc | 2005-05-03 01:43:45 +0000 | [diff] [blame] | 665 | // Check the length argument, if it is Constant zero then the strings are |
| 666 | // considered equal. |
Chris Lattner | db895b8 | 2007-04-07 00:26:18 +0000 | [diff] [blame] | 667 | uint64_t Length; |
| 668 | if (ConstantInt *LengthArg = dyn_cast<ConstantInt>(CI->getOperand(3))) |
| 669 | Length = LengthArg->getZExtValue(); |
| 670 | else |
| 671 | return false; |
| 672 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 673 | if (Length == 0) // strncmp(x,y,0) -> 0 |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 674 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), 0)); |
Chris Lattner | 7b50c8f | 2007-04-07 00:06:57 +0000 | [diff] [blame] | 675 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 676 | std::string Str1; |
| 677 | if (!GetConstantStringInfo(Str1P, Str1)) |
| 678 | return false; |
| 679 | if (Str1.empty()) { |
| 680 | // strncmp("", x, n) -> *x |
Chris Lattner | 7b50c8f | 2007-04-07 00:06:57 +0000 | [diff] [blame] | 681 | Value *V = new LoadInst(Str2P, CI->getName()+".load", CI); |
| 682 | V = new ZExtInst(V, CI->getType(), CI->getName()+".int", CI); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 683 | return ReplaceCallWith(CI, V); |
Reid Spencer | e6ec8cc | 2005-05-03 01:43:45 +0000 | [diff] [blame] | 684 | } |
Chris Lattner | 7b50c8f | 2007-04-07 00:06:57 +0000 | [diff] [blame] | 685 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 686 | std::string Str2; |
| 687 | if (!GetConstantStringInfo(Str2P, Str2)) |
| 688 | return false; |
| 689 | if (Str2.empty()) { |
| 690 | // strncmp(x, "", n) -> *x |
Chris Lattner | 7b50c8f | 2007-04-07 00:06:57 +0000 | [diff] [blame] | 691 | Value *V = new LoadInst(Str1P, CI->getName()+".load", CI); |
| 692 | V = new ZExtInst(V, CI->getType(), CI->getName()+".int", CI); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 693 | return ReplaceCallWith(CI, V); |
Reid Spencer | e6ec8cc | 2005-05-03 01:43:45 +0000 | [diff] [blame] | 694 | } |
Chris Lattner | 7b50c8f | 2007-04-07 00:06:57 +0000 | [diff] [blame] | 695 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 696 | // strncmp(x, y, n) -> cnst (if both x and y are constant strings) |
| 697 | int R = strncmp(Str1.c_str(), Str2.c_str(), Length); |
| 698 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), R)); |
Reid Spencer | e6ec8cc | 2005-05-03 01:43:45 +0000 | [diff] [blame] | 699 | } |
| 700 | } StrNCmpOptimizer; |
| 701 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 702 | /// This LibCallOptimization will simplify a call to the strcpy library |
| 703 | /// function. Two optimizations are possible: |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 704 | /// (1) If src and dest are the same and not volatile, just return dest |
| 705 | /// (2) If the src is a constant then we can convert to llvm.memmove |
| 706 | /// @brief Simplify the strcpy library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 707 | struct VISIBILITY_HIDDEN StrCpyOptimization : public LibCallOptimization { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 708 | public: |
Reid Spencer | 9974dda | 2005-05-03 02:54:54 +0000 | [diff] [blame] | 709 | StrCpyOptimization() : LibCallOptimization("strcpy", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 710 | "Number of 'strcpy' calls simplified") {} |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 711 | |
| 712 | /// @brief Make sure that the "strcpy" function has the right prototype |
Chris Lattner | db895b8 | 2007-04-07 00:26:18 +0000 | [diff] [blame] | 713 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
| 714 | const FunctionType *FT = F->getFunctionType(); |
| 715 | return FT->getNumParams() == 2 && |
| 716 | FT->getParamType(0) == FT->getParamType(1) && |
| 717 | FT->getReturnType() == FT->getParamType(0) && |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 718 | FT->getParamType(0) == PointerType::getUnqual(Type::Int8Ty); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 719 | } |
| 720 | |
| 721 | /// @brief Perform the strcpy optimization |
Chris Lattner | db895b8 | 2007-04-07 00:26:18 +0000 | [diff] [blame] | 722 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 723 | // First, check to see if src and destination are the same. If they are, |
| 724 | // then the optimization is to replace the CallInst with the destination |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 725 | // because the call is a no-op. Note that this corresponds to the |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 726 | // degenerate strcpy(X,X) case which should have "undefined" results |
| 727 | // according to the C specification. However, it occurs sometimes and |
| 728 | // we optimize it as a no-op. |
Chris Lattner | db895b8 | 2007-04-07 00:26:18 +0000 | [diff] [blame] | 729 | Value *Dst = CI->getOperand(1); |
| 730 | Value *Src = CI->getOperand(2); |
| 731 | if (Dst == Src) { |
| 732 | // strcpy(x, x) -> x |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 733 | return ReplaceCallWith(CI, Dst); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 734 | } |
Chris Lattner | db895b8 | 2007-04-07 00:26:18 +0000 | [diff] [blame] | 735 | |
| 736 | // Get the length of the constant string referenced by the Src operand. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 737 | std::string SrcStr; |
| 738 | if (!GetConstantStringInfo(Src, SrcStr)) |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 739 | return false; |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 740 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 741 | // If the constant string's length is zero we can optimize this by just |
| 742 | // doing a store of 0 at the first byte of the destination |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 743 | if (SrcStr.size() == 0) { |
Chris Lattner | db895b8 | 2007-04-07 00:26:18 +0000 | [diff] [blame] | 744 | new StoreInst(ConstantInt::get(Type::Int8Ty, 0), Dst, CI); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 745 | return ReplaceCallWith(CI, Dst); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 746 | } |
| 747 | |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 748 | // We have enough information to now generate the memcpy call to |
| 749 | // do the concatenation for us. |
Chris Lattner | db895b8 | 2007-04-07 00:26:18 +0000 | [diff] [blame] | 750 | Value *MemcpyOps[] = { |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 751 | Dst, Src, // Pass length including nul byte. |
| 752 | ConstantInt::get(SLC.getIntPtrType(), SrcStr.size()+1), |
Chris Lattner | c18470c | 2007-02-13 05:58:53 +0000 | [diff] [blame] | 753 | ConstantInt::get(Type::Int32Ty, 1) // alignment |
| 754 | }; |
David Greene | 52eec54 | 2007-08-01 03:43:44 +0000 | [diff] [blame] | 755 | new CallInst(SLC.get_memcpy(), MemcpyOps, MemcpyOps + 4, "", CI); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 756 | |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 757 | return ReplaceCallWith(CI, Dst); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 758 | } |
| 759 | } StrCpyOptimizer; |
| 760 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 761 | /// This LibCallOptimization will simplify a call to the strlen library |
| 762 | /// function by replacing it with a constant value if the string provided to |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 763 | /// it is a constant array. |
Reid Spencer | 912401c | 2005-04-26 05:24:00 +0000 | [diff] [blame] | 764 | /// @brief Simplify the strlen library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 765 | struct VISIBILITY_HIDDEN StrLenOptimization : public LibCallOptimization { |
Reid Spencer | 9974dda | 2005-05-03 02:54:54 +0000 | [diff] [blame] | 766 | StrLenOptimization() : LibCallOptimization("strlen", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 767 | "Number of 'strlen' calls simplified") {} |
Reid Spencer | 912401c | 2005-04-26 05:24:00 +0000 | [diff] [blame] | 768 | |
| 769 | /// @brief Make sure that the "strlen" function has the right prototype |
Chris Lattner | db895b8 | 2007-04-07 00:26:18 +0000 | [diff] [blame] | 770 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
Chris Lattner | 71bf3e2 | 2007-04-07 01:02:00 +0000 | [diff] [blame] | 771 | const FunctionType *FT = F->getFunctionType(); |
| 772 | return FT->getNumParams() == 1 && |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 773 | FT->getParamType(0) == PointerType::getUnqual(Type::Int8Ty) && |
Chris Lattner | 71bf3e2 | 2007-04-07 01:02:00 +0000 | [diff] [blame] | 774 | isa<IntegerType>(FT->getReturnType()); |
Reid Spencer | 912401c | 2005-04-26 05:24:00 +0000 | [diff] [blame] | 775 | } |
| 776 | |
| 777 | /// @brief Perform the strlen optimization |
Chris Lattner | 71bf3e2 | 2007-04-07 01:02:00 +0000 | [diff] [blame] | 778 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 779 | // Make sure we're dealing with an sbyte* here. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 780 | Value *Src = CI->getOperand(1); |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 781 | |
| 782 | // Does the call to strlen have exactly one use? |
Chris Lattner | 71bf3e2 | 2007-04-07 01:02:00 +0000 | [diff] [blame] | 783 | if (CI->hasOneUse()) { |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 784 | // Is that single use a icmp operator? |
Chris Lattner | 71bf3e2 | 2007-04-07 01:02:00 +0000 | [diff] [blame] | 785 | if (ICmpInst *Cmp = dyn_cast<ICmpInst>(CI->use_back())) |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 786 | // Is it compared against a constant integer? |
Chris Lattner | 71bf3e2 | 2007-04-07 01:02:00 +0000 | [diff] [blame] | 787 | if (ConstantInt *Cst = dyn_cast<ConstantInt>(Cmp->getOperand(1))) { |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 788 | // If its compared against length 0 with == or != |
Chris Lattner | 71bf3e2 | 2007-04-07 01:02:00 +0000 | [diff] [blame] | 789 | if (Cst->getZExtValue() == 0 && Cmp->isEquality()) { |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 790 | // strlen(x) != 0 -> *x != 0 |
| 791 | // strlen(x) == 0 -> *x == 0 |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 792 | Value *V = new LoadInst(Src, Src->getName()+".first", CI); |
Chris Lattner | 71bf3e2 | 2007-04-07 01:02:00 +0000 | [diff] [blame] | 793 | V = new ICmpInst(Cmp->getPredicate(), V, |
| 794 | ConstantInt::get(Type::Int8Ty, 0), |
| 795 | Cmp->getName()+".strlen", CI); |
| 796 | Cmp->replaceAllUsesWith(V); |
| 797 | Cmp->eraseFromParent(); |
| 798 | return ReplaceCallWith(CI, 0); // no uses. |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 799 | } |
| 800 | } |
Chris Lattner | 71bf3e2 | 2007-04-07 01:02:00 +0000 | [diff] [blame] | 801 | } |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 802 | |
| 803 | // Get the length of the constant string operand |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 804 | std::string Str; |
| 805 | if (!GetConstantStringInfo(Src, Str)) |
Reid Spencer | 912401c | 2005-04-26 05:24:00 +0000 | [diff] [blame] | 806 | return false; |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 807 | |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 808 | // strlen("xyz") -> 3 (for example) |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 809 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), Str.size())); |
Reid Spencer | 912401c | 2005-04-26 05:24:00 +0000 | [diff] [blame] | 810 | } |
| 811 | } StrLenOptimizer; |
| 812 | |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 813 | /// IsOnlyUsedInEqualsComparison - Return true if it only matters that the value |
| 814 | /// is equal or not-equal to zero. |
| 815 | static bool IsOnlyUsedInEqualsZeroComparison(Instruction *I) { |
| 816 | for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); |
| 817 | UI != E; ++UI) { |
Chris Lattner | ef4fd35 | 2007-04-07 01:03:46 +0000 | [diff] [blame] | 818 | if (ICmpInst *IC = dyn_cast<ICmpInst>(*UI)) |
| 819 | if (IC->isEquality()) |
| 820 | if (Constant *C = dyn_cast<Constant>(IC->getOperand(1))) |
| 821 | if (C->isNullValue()) |
| 822 | continue; |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 823 | // Unknown instruction. |
| 824 | return false; |
| 825 | } |
| 826 | return true; |
| 827 | } |
| 828 | |
| 829 | /// This memcmpOptimization will simplify a call to the memcmp library |
| 830 | /// function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 831 | struct VISIBILITY_HIDDEN memcmpOptimization : public LibCallOptimization { |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 832 | /// @brief Default Constructor |
| 833 | memcmpOptimization() |
| 834 | : LibCallOptimization("memcmp", "Number of 'memcmp' calls simplified") {} |
| 835 | |
| 836 | /// @brief Make sure that the "memcmp" function has the right prototype |
| 837 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &TD) { |
| 838 | Function::const_arg_iterator AI = F->arg_begin(); |
| 839 | if (F->arg_size() != 3 || !isa<PointerType>(AI->getType())) return false; |
| 840 | if (!isa<PointerType>((++AI)->getType())) return false; |
Chris Lattner | 42a7551 | 2007-01-15 02:27:26 +0000 | [diff] [blame] | 841 | if (!(++AI)->getType()->isInteger()) return false; |
| 842 | if (!F->getReturnType()->isInteger()) return false; |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 843 | return true; |
| 844 | } |
| 845 | |
| 846 | /// Because of alignment and instruction information that we don't have, we |
| 847 | /// leave the bulk of this to the code generators. |
| 848 | /// |
| 849 | /// Note that we could do much more if we could force alignment on otherwise |
| 850 | /// small aligned allocas, or if we could indicate that loads have a small |
| 851 | /// alignment. |
| 852 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &TD) { |
| 853 | Value *LHS = CI->getOperand(1), *RHS = CI->getOperand(2); |
| 854 | |
| 855 | // If the two operands are the same, return zero. |
| 856 | if (LHS == RHS) { |
| 857 | // memcmp(s,s,x) -> 0 |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 858 | return ReplaceCallWith(CI, Constant::getNullValue(CI->getType())); |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 859 | } |
| 860 | |
| 861 | // Make sure we have a constant length. |
| 862 | ConstantInt *LenC = dyn_cast<ConstantInt>(CI->getOperand(3)); |
| 863 | if (!LenC) return false; |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 864 | uint64_t Len = LenC->getZExtValue(); |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 865 | |
| 866 | // If the length is zero, this returns 0. |
| 867 | switch (Len) { |
| 868 | case 0: |
| 869 | // memcmp(s1,s2,0) -> 0 |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 870 | return ReplaceCallWith(CI, Constant::getNullValue(CI->getType())); |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 871 | case 1: { |
| 872 | // memcmp(S1,S2,1) -> *(ubyte*)S1 - *(ubyte*)S2 |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 873 | const Type *UCharPtr = PointerType::getUnqual(Type::Int8Ty); |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 874 | CastInst *Op1Cast = CastInst::create( |
| 875 | Instruction::BitCast, LHS, UCharPtr, LHS->getName(), CI); |
| 876 | CastInst *Op2Cast = CastInst::create( |
| 877 | Instruction::BitCast, RHS, UCharPtr, RHS->getName(), CI); |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 878 | Value *S1V = new LoadInst(Op1Cast, LHS->getName()+".val", CI); |
| 879 | Value *S2V = new LoadInst(Op2Cast, RHS->getName()+".val", CI); |
| 880 | Value *RV = BinaryOperator::createSub(S1V, S2V, CI->getName()+".diff",CI); |
| 881 | if (RV->getType() != CI->getType()) |
Reid Spencer | 7b06bd5 | 2006-12-13 00:50:17 +0000 | [diff] [blame] | 882 | RV = CastInst::createIntegerCast(RV, CI->getType(), false, |
| 883 | RV->getName(), CI); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 884 | return ReplaceCallWith(CI, RV); |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 885 | } |
| 886 | case 2: |
| 887 | if (IsOnlyUsedInEqualsZeroComparison(CI)) { |
| 888 | // TODO: IF both are aligned, use a short load/compare. |
| 889 | |
| 890 | // memcmp(S1,S2,2) -> S1[0]-S2[0] | S1[1]-S2[1] iff only ==/!= 0 matters |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 891 | const Type *UCharPtr = PointerType::getUnqual(Type::Int8Ty); |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 892 | CastInst *Op1Cast = CastInst::create( |
| 893 | Instruction::BitCast, LHS, UCharPtr, LHS->getName(), CI); |
| 894 | CastInst *Op2Cast = CastInst::create( |
| 895 | Instruction::BitCast, RHS, UCharPtr, RHS->getName(), CI); |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 896 | Value *S1V1 = new LoadInst(Op1Cast, LHS->getName()+".val1", CI); |
| 897 | Value *S2V1 = new LoadInst(Op2Cast, RHS->getName()+".val1", CI); |
| 898 | Value *D1 = BinaryOperator::createSub(S1V1, S2V1, |
| 899 | CI->getName()+".d1", CI); |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 900 | Constant *One = ConstantInt::get(Type::Int32Ty, 1); |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 901 | Value *G1 = new GetElementPtrInst(Op1Cast, One, "next1v", CI); |
| 902 | Value *G2 = new GetElementPtrInst(Op2Cast, One, "next2v", CI); |
| 903 | Value *S1V2 = new LoadInst(G1, LHS->getName()+".val2", CI); |
Chris Lattner | 2144c25 | 2006-05-12 23:35:26 +0000 | [diff] [blame] | 904 | Value *S2V2 = new LoadInst(G2, RHS->getName()+".val2", CI); |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 905 | Value *D2 = BinaryOperator::createSub(S1V2, S2V2, |
| 906 | CI->getName()+".d1", CI); |
| 907 | Value *Or = BinaryOperator::createOr(D1, D2, CI->getName()+".res", CI); |
| 908 | if (Or->getType() != CI->getType()) |
Reid Spencer | 7b06bd5 | 2006-12-13 00:50:17 +0000 | [diff] [blame] | 909 | Or = CastInst::createIntegerCast(Or, CI->getType(), false /*ZExt*/, |
| 910 | Or->getName(), CI); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 911 | return ReplaceCallWith(CI, Or); |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 912 | } |
| 913 | break; |
| 914 | default: |
| 915 | break; |
| 916 | } |
| 917 | |
Chris Lattner | c330069 | 2005-09-29 04:54:20 +0000 | [diff] [blame] | 918 | return false; |
| 919 | } |
| 920 | } memcmpOptimizer; |
| 921 | |
| 922 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 923 | /// This LibCallOptimization will simplify a call to the memcpy library |
| 924 | /// function by expanding it out to a single store of size 0, 1, 2, 4, or 8 |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 925 | /// bytes depending on the length of the string and the alignment. Additional |
| 926 | /// optimizations are possible in code generation (sequence of immediate store) |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 927 | /// @brief Simplify the memcpy library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 928 | struct VISIBILITY_HIDDEN LLVMMemCpyMoveOptzn : public LibCallOptimization { |
Chris Lattner | aecb062 | 2006-03-03 01:30:23 +0000 | [diff] [blame] | 929 | LLVMMemCpyMoveOptzn(const char* fname, const char* desc) |
| 930 | : LibCallOptimization(fname, desc) {} |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 931 | |
| 932 | /// @brief Make sure that the "memcpy" function has the right prototype |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 933 | virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& TD) { |
Reid Spencer | fcbdb9c | 2005-04-26 19:13:17 +0000 | [diff] [blame] | 934 | // Just make sure this has 4 arguments per LLVM spec. |
Reid Spencer | 8f13261 | 2005-04-26 23:02:16 +0000 | [diff] [blame] | 935 | return (f->arg_size() == 4); |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 936 | } |
| 937 | |
Reid Spencer | 20754ac | 2005-04-26 07:45:18 +0000 | [diff] [blame] | 938 | /// Because of alignment and instruction information that we don't have, we |
| 939 | /// leave the bulk of this to the code generators. The optimization here just |
| 940 | /// deals with a few degenerate cases where the length of the string and the |
| 941 | /// alignment match the sizes of our intrinsic types so we can do a load and |
| 942 | /// store instead of the memcpy call. |
| 943 | /// @brief Perform the memcpy optimization. |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 944 | virtual bool OptimizeCall(CallInst* ci, SimplifyLibCalls& TD) { |
Reid Spencer | 43fd4d0 | 2005-04-26 19:55:57 +0000 | [diff] [blame] | 945 | // Make sure we have constant int values to work with |
| 946 | ConstantInt* LEN = dyn_cast<ConstantInt>(ci->getOperand(3)); |
| 947 | if (!LEN) |
| 948 | return false; |
| 949 | ConstantInt* ALIGN = dyn_cast<ConstantInt>(ci->getOperand(4)); |
| 950 | if (!ALIGN) |
| 951 | return false; |
| 952 | |
| 953 | // If the length is larger than the alignment, we can't optimize |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 954 | uint64_t len = LEN->getZExtValue(); |
| 955 | uint64_t alignment = ALIGN->getZExtValue(); |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 956 | if (alignment == 0) |
| 957 | alignment = 1; // Alignment 0 is identity for alignment 1 |
Reid Spencer | fcbdb9c | 2005-04-26 19:13:17 +0000 | [diff] [blame] | 958 | if (len > alignment) |
Reid Spencer | 20754ac | 2005-04-26 07:45:18 +0000 | [diff] [blame] | 959 | return false; |
| 960 | |
Reid Spencer | 3f7d8c6 | 2005-04-27 17:46:54 +0000 | [diff] [blame] | 961 | // Get the type we will cast to, based on size of the string |
Reid Spencer | 20754ac | 2005-04-26 07:45:18 +0000 | [diff] [blame] | 962 | Value* dest = ci->getOperand(1); |
| 963 | Value* src = ci->getOperand(2); |
Reid Spencer | 3c62862 | 2007-01-07 21:45:41 +0000 | [diff] [blame] | 964 | const Type* castType = 0; |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 965 | switch (len) { |
Reid Spencer | fcbdb9c | 2005-04-26 19:13:17 +0000 | [diff] [blame] | 966 | case 0: |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 967 | // memcpy(d,s,0,a) -> d |
| 968 | return ReplaceCallWith(ci, 0); |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 969 | case 1: castType = Type::Int8Ty; break; |
| 970 | case 2: castType = Type::Int16Ty; break; |
| 971 | case 4: castType = Type::Int32Ty; break; |
| 972 | case 8: castType = Type::Int64Ty; break; |
Reid Spencer | 20754ac | 2005-04-26 07:45:18 +0000 | [diff] [blame] | 973 | default: |
| 974 | return false; |
| 975 | } |
Reid Spencer | 3f7d8c6 | 2005-04-27 17:46:54 +0000 | [diff] [blame] | 976 | |
| 977 | // Cast source and dest to the right sized primitive and then load/store |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 978 | CastInst* SrcCast = CastInst::create(Instruction::BitCast, |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 979 | src, PointerType::getUnqual(castType), src->getName()+".cast", ci); |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 980 | CastInst* DestCast = CastInst::create(Instruction::BitCast, |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 981 | dest, PointerType::getUnqual(castType),dest->getName()+".cast", ci); |
Reid Spencer | 3f7d8c6 | 2005-04-27 17:46:54 +0000 | [diff] [blame] | 982 | LoadInst* LI = new LoadInst(SrcCast,SrcCast->getName()+".val",ci); |
Reid Spencer | 3ed469c | 2006-11-02 20:25:50 +0000 | [diff] [blame] | 983 | new StoreInst(LI, DestCast, ci); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 984 | return ReplaceCallWith(ci, 0); |
Reid Spencer | 6cc0311 | 2005-04-25 21:11:48 +0000 | [diff] [blame] | 985 | } |
Chris Lattner | aecb062 | 2006-03-03 01:30:23 +0000 | [diff] [blame] | 986 | }; |
Reid Spencer | fcbdb9c | 2005-04-26 19:13:17 +0000 | [diff] [blame] | 987 | |
Chris Lattner | aecb062 | 2006-03-03 01:30:23 +0000 | [diff] [blame] | 988 | /// This LibCallOptimization will simplify a call to the memcpy/memmove library |
| 989 | /// functions. |
| 990 | LLVMMemCpyMoveOptzn LLVMMemCpyOptimizer32("llvm.memcpy.i32", |
| 991 | "Number of 'llvm.memcpy' calls simplified"); |
| 992 | LLVMMemCpyMoveOptzn LLVMMemCpyOptimizer64("llvm.memcpy.i64", |
| 993 | "Number of 'llvm.memcpy' calls simplified"); |
| 994 | LLVMMemCpyMoveOptzn LLVMMemMoveOptimizer32("llvm.memmove.i32", |
| 995 | "Number of 'llvm.memmove' calls simplified"); |
| 996 | LLVMMemCpyMoveOptzn LLVMMemMoveOptimizer64("llvm.memmove.i64", |
| 997 | "Number of 'llvm.memmove' calls simplified"); |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 998 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 999 | /// This LibCallOptimization will simplify a call to the memset library |
| 1000 | /// function by expanding it out to a single store of size 0, 1, 2, 4, or 8 |
| 1001 | /// bytes depending on the length argument. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1002 | struct VISIBILITY_HIDDEN LLVMMemSetOptimization : public LibCallOptimization { |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1003 | /// @brief Default Constructor |
Chris Lattner | aecb062 | 2006-03-03 01:30:23 +0000 | [diff] [blame] | 1004 | LLVMMemSetOptimization(const char *Name) : LibCallOptimization(Name, |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1005 | "Number of 'llvm.memset' calls simplified") {} |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1006 | |
| 1007 | /// @brief Make sure that the "memset" function has the right prototype |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1008 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &TD) { |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1009 | // Just make sure this has 3 arguments per LLVM spec. |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1010 | return F->arg_size() == 4; |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1011 | } |
| 1012 | |
| 1013 | /// Because of alignment and instruction information that we don't have, we |
| 1014 | /// leave the bulk of this to the code generators. The optimization here just |
| 1015 | /// deals with a few degenerate cases where the length parameter is constant |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1016 | /// and the alignment matches the sizes of our intrinsic types so we can do |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1017 | /// store instead of the memcpy call. Other calls are transformed into the |
| 1018 | /// llvm.memset intrinsic. |
| 1019 | /// @brief Perform the memset optimization. |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1020 | virtual bool OptimizeCall(CallInst *ci, SimplifyLibCalls &TD) { |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1021 | // Make sure we have constant int values to work with |
| 1022 | ConstantInt* LEN = dyn_cast<ConstantInt>(ci->getOperand(3)); |
| 1023 | if (!LEN) |
| 1024 | return false; |
| 1025 | ConstantInt* ALIGN = dyn_cast<ConstantInt>(ci->getOperand(4)); |
| 1026 | if (!ALIGN) |
| 1027 | return false; |
| 1028 | |
| 1029 | // Extract the length and alignment |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 1030 | uint64_t len = LEN->getZExtValue(); |
| 1031 | uint64_t alignment = ALIGN->getZExtValue(); |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1032 | |
| 1033 | // Alignment 0 is identity for alignment 1 |
| 1034 | if (alignment == 0) |
| 1035 | alignment = 1; |
| 1036 | |
| 1037 | // If the length is zero, this is a no-op |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1038 | if (len == 0) { |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1039 | // memset(d,c,0,a) -> noop |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1040 | return ReplaceCallWith(ci, 0); |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1041 | } |
| 1042 | |
| 1043 | // If the length is larger than the alignment, we can't optimize |
| 1044 | if (len > alignment) |
| 1045 | return false; |
| 1046 | |
| 1047 | // Make sure we have a constant ubyte to work with so we can extract |
| 1048 | // the value to be filled. |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 1049 | ConstantInt* FILL = dyn_cast<ConstantInt>(ci->getOperand(2)); |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1050 | if (!FILL) |
| 1051 | return false; |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1052 | if (FILL->getType() != Type::Int8Ty) |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1053 | return false; |
| 1054 | |
| 1055 | // memset(s,c,n) -> store s, c (for n=1,2,4,8) |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1056 | |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1057 | // Extract the fill character |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 1058 | uint64_t fill_char = FILL->getZExtValue(); |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1059 | uint64_t fill_value = fill_char; |
| 1060 | |
| 1061 | // Get the type we will cast to, based on size of memory area to fill, and |
| 1062 | // and the value we will store there. |
| 1063 | Value* dest = ci->getOperand(1); |
Reid Spencer | 3c62862 | 2007-01-07 21:45:41 +0000 | [diff] [blame] | 1064 | const Type* castType = 0; |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1065 | switch (len) { |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1066 | case 1: |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1067 | castType = Type::Int8Ty; |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1068 | break; |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1069 | case 2: |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1070 | castType = Type::Int16Ty; |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1071 | fill_value |= fill_char << 8; |
| 1072 | break; |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1073 | case 4: |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1074 | castType = Type::Int32Ty; |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1075 | fill_value |= fill_char << 8 | fill_char << 16 | fill_char << 24; |
| 1076 | break; |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1077 | case 8: |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1078 | castType = Type::Int64Ty; |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1079 | fill_value |= fill_char << 8 | fill_char << 16 | fill_char << 24; |
| 1080 | fill_value |= fill_char << 32 | fill_char << 40 | fill_char << 48; |
| 1081 | fill_value |= fill_char << 56; |
| 1082 | break; |
| 1083 | default: |
| 1084 | return false; |
| 1085 | } |
| 1086 | |
| 1087 | // Cast dest to the right sized primitive and then load/store |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 1088 | CastInst* DestCast = new BitCastInst(dest, PointerType::getUnqual(castType), |
Reid Spencer | 7b06bd5 | 2006-12-13 00:50:17 +0000 | [diff] [blame] | 1089 | dest->getName()+".cast", ci); |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 1090 | new StoreInst(ConstantInt::get(castType,fill_value),DestCast, ci); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1091 | return ReplaceCallWith(ci, 0); |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1092 | } |
Chris Lattner | aecb062 | 2006-03-03 01:30:23 +0000 | [diff] [blame] | 1093 | }; |
| 1094 | |
| 1095 | LLVMMemSetOptimization MemSet32Optimizer("llvm.memset.i32"); |
| 1096 | LLVMMemSetOptimization MemSet64Optimizer("llvm.memset.i64"); |
| 1097 | |
Reid Spencer | fcbdb9c | 2005-04-26 19:13:17 +0000 | [diff] [blame] | 1098 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1099 | /// This LibCallOptimization will simplify calls to the "pow" library |
| 1100 | /// function. It looks for cases where the result of pow is well known and |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1101 | /// substitutes the appropriate value. |
| 1102 | /// @brief Simplify the pow library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1103 | struct VISIBILITY_HIDDEN PowOptimization : public LibCallOptimization { |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1104 | public: |
| 1105 | /// @brief Default Constructor |
Reid Spencer | 9974dda | 2005-05-03 02:54:54 +0000 | [diff] [blame] | 1106 | PowOptimization() : LibCallOptimization("pow", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 1107 | "Number of 'pow' calls simplified") {} |
Reid Spencer | 9974dda | 2005-05-03 02:54:54 +0000 | [diff] [blame] | 1108 | |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1109 | /// @brief Make sure that the "pow" function has the right prototype |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1110 | virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC){ |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1111 | // Just make sure this has 2 arguments |
| 1112 | return (f->arg_size() == 2); |
| 1113 | } |
| 1114 | |
| 1115 | /// @brief Perform the pow optimization. |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1116 | virtual bool OptimizeCall(CallInst *ci, SimplifyLibCalls &SLC) { |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1117 | const Type *Ty = cast<Function>(ci->getOperand(0))->getReturnType(); |
Dale Johannesen | 4292d1c | 2007-09-28 18:06:58 +0000 | [diff] [blame] | 1118 | if (Ty!=Type::FloatTy && Ty!=Type::DoubleTy) |
| 1119 | return false; // FIXME long double not yet supported |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1120 | Value* base = ci->getOperand(1); |
| 1121 | Value* expn = ci->getOperand(2); |
| 1122 | if (ConstantFP *Op1 = dyn_cast<ConstantFP>(base)) { |
Dale Johannesen | 43421b3 | 2007-09-06 18:13:44 +0000 | [diff] [blame] | 1123 | if (Op1->isExactlyValue(1.0)) // pow(1.0,x) -> 1.0 |
| 1124 | return ReplaceCallWith(ci, ConstantFP::get(Ty, |
| 1125 | Ty==Type::FloatTy ? APFloat(1.0f) : APFloat(1.0))); |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1126 | } else if (ConstantFP* Op2 = dyn_cast<ConstantFP>(expn)) { |
Dale Johannesen | 43421b3 | 2007-09-06 18:13:44 +0000 | [diff] [blame] | 1127 | if (Op2->getValueAPF().isZero()) { |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1128 | // pow(x,0.0) -> 1.0 |
Dale Johannesen | 43421b3 | 2007-09-06 18:13:44 +0000 | [diff] [blame] | 1129 | return ReplaceCallWith(ci, ConstantFP::get(Ty, |
| 1130 | Ty==Type::FloatTy ? APFloat(1.0f) : APFloat(1.0))); |
| 1131 | } else if (Op2->isExactlyValue(0.5)) { |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1132 | // pow(x,0.5) -> sqrt(x) |
| 1133 | CallInst* sqrt_inst = new CallInst(SLC.get_sqrt(), base, |
| 1134 | ci->getName()+".pow",ci); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1135 | return ReplaceCallWith(ci, sqrt_inst); |
Dale Johannesen | 43421b3 | 2007-09-06 18:13:44 +0000 | [diff] [blame] | 1136 | } else if (Op2->isExactlyValue(1.0)) { |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1137 | // pow(x,1.0) -> x |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1138 | return ReplaceCallWith(ci, base); |
Dale Johannesen | 43421b3 | 2007-09-06 18:13:44 +0000 | [diff] [blame] | 1139 | } else if (Op2->isExactlyValue(-1.0)) { |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1140 | // pow(x,-1.0) -> 1.0/x |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1141 | Value *div_inst = |
Dale Johannesen | 43421b3 | 2007-09-06 18:13:44 +0000 | [diff] [blame] | 1142 | BinaryOperator::createFDiv(ConstantFP::get(Ty, |
| 1143 | Ty==Type::FloatTy ? APFloat(1.0f) : APFloat(1.0)), |
| 1144 | base, ci->getName()+".pow", ci); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1145 | return ReplaceCallWith(ci, div_inst); |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1146 | } |
| 1147 | } |
| 1148 | return false; // opt failed |
| 1149 | } |
| 1150 | } PowOptimizer; |
| 1151 | |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 1152 | /// This LibCallOptimization will simplify calls to the "printf" library |
| 1153 | /// function. It looks for cases where the result of printf is not used and the |
| 1154 | /// operation can be reduced to something simpler. |
| 1155 | /// @brief Simplify the printf library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1156 | struct VISIBILITY_HIDDEN PrintfOptimization : public LibCallOptimization { |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 1157 | public: |
| 1158 | /// @brief Default Constructor |
| 1159 | PrintfOptimization() : LibCallOptimization("printf", |
| 1160 | "Number of 'printf' calls simplified") {} |
| 1161 | |
| 1162 | /// @brief Make sure that the "printf" function has the right prototype |
Chris Lattner | 045af54 | 2007-04-07 01:18:36 +0000 | [diff] [blame] | 1163 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
Chris Lattner | 35b9b49 | 2007-04-14 01:17:48 +0000 | [diff] [blame] | 1164 | // Just make sure this has at least 1 argument and returns an integer or |
| 1165 | // void type. |
| 1166 | const FunctionType *FT = F->getFunctionType(); |
| 1167 | return FT->getNumParams() >= 1 && |
| 1168 | (isa<IntegerType>(FT->getReturnType()) || |
| 1169 | FT->getReturnType() == Type::VoidTy); |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 1170 | } |
| 1171 | |
| 1172 | /// @brief Perform the printf optimization. |
Chris Lattner | 045af54 | 2007-04-07 01:18:36 +0000 | [diff] [blame] | 1173 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 1174 | // All the optimizations depend on the length of the first argument and the |
| 1175 | // fact that it is a constant string array. Check that now |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1176 | std::string FormatStr; |
| 1177 | if (!GetConstantStringInfo(CI->getOperand(1), FormatStr)) |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 1178 | return false; |
Chris Lattner | 35b9b49 | 2007-04-14 01:17:48 +0000 | [diff] [blame] | 1179 | |
| 1180 | // If this is a simple constant string with no format specifiers that ends |
| 1181 | // with a \n, turn it into a puts call. |
| 1182 | if (FormatStr.empty()) { |
| 1183 | // Tolerate printf's declared void. |
| 1184 | if (CI->use_empty()) return ReplaceCallWith(CI, 0); |
| 1185 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), 0)); |
| 1186 | } |
| 1187 | |
| 1188 | if (FormatStr.size() == 1) { |
| 1189 | // Turn this into a putchar call, even if it is a %. |
| 1190 | Value *V = ConstantInt::get(Type::Int32Ty, FormatStr[0]); |
| 1191 | new CallInst(SLC.get_putchar(), V, "", CI); |
| 1192 | if (CI->use_empty()) return ReplaceCallWith(CI, 0); |
| 1193 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), 1)); |
| 1194 | } |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 1195 | |
Chris Lattner | 35b9b49 | 2007-04-14 01:17:48 +0000 | [diff] [blame] | 1196 | // Check to see if the format str is something like "foo\n", in which case |
| 1197 | // we convert it to a puts call. We don't allow it to contain any format |
| 1198 | // characters. |
| 1199 | if (FormatStr[FormatStr.size()-1] == '\n' && |
| 1200 | FormatStr.find('%') == std::string::npos) { |
| 1201 | // Create a string literal with no \n on it. We expect the constant merge |
| 1202 | // pass to be run after this pass, to merge duplicate strings. |
| 1203 | FormatStr.erase(FormatStr.end()-1); |
| 1204 | Constant *Init = ConstantArray::get(FormatStr, true); |
| 1205 | Constant *GV = new GlobalVariable(Init->getType(), true, |
| 1206 | GlobalVariable::InternalLinkage, |
| 1207 | Init, "str", |
| 1208 | CI->getParent()->getParent()->getParent()); |
| 1209 | // Cast GV to be a pointer to char. |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 1210 | GV = ConstantExpr::getBitCast(GV, PointerType::getUnqual(Type::Int8Ty)); |
Chris Lattner | 35b9b49 | 2007-04-14 01:17:48 +0000 | [diff] [blame] | 1211 | new CallInst(SLC.get_puts(), GV, "", CI); |
| 1212 | |
| 1213 | if (CI->use_empty()) return ReplaceCallWith(CI, 0); |
Dale Johannesen | 0fcee06 | 2007-10-24 20:14:50 +0000 | [diff] [blame] | 1214 | // The return value from printf includes the \n we just removed, so +1. |
Chris Lattner | 35b9b49 | 2007-04-14 01:17:48 +0000 | [diff] [blame] | 1215 | return ReplaceCallWith(CI, |
Dale Johannesen | 0fcee06 | 2007-10-24 20:14:50 +0000 | [diff] [blame] | 1216 | ConstantInt::get(CI->getType(), |
| 1217 | FormatStr.size()+1)); |
Chris Lattner | 35b9b49 | 2007-04-14 01:17:48 +0000 | [diff] [blame] | 1218 | } |
| 1219 | |
| 1220 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1221 | // Only support %c or "%s\n" for now. |
| 1222 | if (FormatStr.size() < 2 || FormatStr[0] != '%') |
Chris Lattner | 045af54 | 2007-04-07 01:18:36 +0000 | [diff] [blame] | 1223 | return false; |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 1224 | |
| 1225 | // Get the second character and switch on its value |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1226 | switch (FormatStr[1]) { |
Chris Lattner | 045af54 | 2007-04-07 01:18:36 +0000 | [diff] [blame] | 1227 | default: return false; |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1228 | case 's': |
Chris Lattner | 35b9b49 | 2007-04-14 01:17:48 +0000 | [diff] [blame] | 1229 | if (FormatStr != "%s\n" || CI->getNumOperands() < 3 || |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1230 | // TODO: could insert strlen call to compute string length. |
| 1231 | !CI->use_empty()) |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 1232 | return false; |
Chris Lattner | 045af54 | 2007-04-07 01:18:36 +0000 | [diff] [blame] | 1233 | |
| 1234 | // printf("%s\n",str) -> puts(str) |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1235 | new CallInst(SLC.get_puts(), CastToCStr(CI->getOperand(2), CI), |
Chris Lattner | 045af54 | 2007-04-07 01:18:36 +0000 | [diff] [blame] | 1236 | CI->getName(), CI); |
| 1237 | return ReplaceCallWith(CI, 0); |
Chris Lattner | 045af54 | 2007-04-07 01:18:36 +0000 | [diff] [blame] | 1238 | case 'c': { |
| 1239 | // printf("%c",c) -> putchar(c) |
Chris Lattner | 35b9b49 | 2007-04-14 01:17:48 +0000 | [diff] [blame] | 1240 | if (FormatStr.size() != 2 || CI->getNumOperands() < 3) |
Chris Lattner | 045af54 | 2007-04-07 01:18:36 +0000 | [diff] [blame] | 1241 | return false; |
| 1242 | |
| 1243 | Value *V = CI->getOperand(2); |
| 1244 | if (!isa<IntegerType>(V->getType()) || |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1245 | cast<IntegerType>(V->getType())->getBitWidth() > 32) |
Chris Lattner | 045af54 | 2007-04-07 01:18:36 +0000 | [diff] [blame] | 1246 | return false; |
| 1247 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1248 | V = CastInst::createZExtOrBitCast(V, Type::Int32Ty, CI->getName()+".int", |
Chris Lattner | 045af54 | 2007-04-07 01:18:36 +0000 | [diff] [blame] | 1249 | CI); |
| 1250 | new CallInst(SLC.get_putchar(), V, "", CI); |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1251 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), 1)); |
Chris Lattner | 045af54 | 2007-04-07 01:18:36 +0000 | [diff] [blame] | 1252 | } |
| 1253 | } |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 1254 | } |
| 1255 | } PrintfOptimizer; |
| 1256 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1257 | /// This LibCallOptimization will simplify calls to the "fprintf" library |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1258 | /// function. It looks for cases where the result of fprintf is not used and the |
| 1259 | /// operation can be reduced to something simpler. |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 1260 | /// @brief Simplify the fprintf library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1261 | struct VISIBILITY_HIDDEN FPrintFOptimization : public LibCallOptimization { |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1262 | public: |
| 1263 | /// @brief Default Constructor |
Reid Spencer | 9974dda | 2005-05-03 02:54:54 +0000 | [diff] [blame] | 1264 | FPrintFOptimization() : LibCallOptimization("fprintf", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 1265 | "Number of 'fprintf' calls simplified") {} |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1266 | |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1267 | /// @brief Make sure that the "fprintf" function has the right prototype |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1268 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
| 1269 | const FunctionType *FT = F->getFunctionType(); |
| 1270 | return FT->getNumParams() == 2 && // two fixed arguments. |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 1271 | FT->getParamType(1) == PointerType::getUnqual(Type::Int8Ty) && |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1272 | isa<PointerType>(FT->getParamType(0)) && |
| 1273 | isa<IntegerType>(FT->getReturnType()); |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1274 | } |
| 1275 | |
| 1276 | /// @brief Perform the fprintf optimization. |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1277 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1278 | // If the call has more than 3 operands, we can't optimize it |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1279 | if (CI->getNumOperands() != 3 && CI->getNumOperands() != 4) |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1280 | return false; |
| 1281 | |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1282 | // All the optimizations depend on the format string. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1283 | std::string FormatStr; |
| 1284 | if (!GetConstantStringInfo(CI->getOperand(2), FormatStr)) |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1285 | return false; |
| 1286 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1287 | // If this is just a format string, turn it into fwrite. |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1288 | if (CI->getNumOperands() == 3) { |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1289 | for (unsigned i = 0, e = FormatStr.size(); i != e; ++i) |
| 1290 | if (FormatStr[i] == '%') |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1291 | return false; // we found a format specifier |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1292 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1293 | // fprintf(file,fmt) -> fwrite(fmt,strlen(fmt),file) |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1294 | const Type *FILEty = CI->getOperand(1)->getType(); |
John Criswell | 1d231ec | 2005-06-29 15:03:18 +0000 | [diff] [blame] | 1295 | |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1296 | Value *FWriteArgs[] = { |
| 1297 | CI->getOperand(2), |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1298 | ConstantInt::get(SLC.getIntPtrType(), FormatStr.size()), |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1299 | ConstantInt::get(SLC.getIntPtrType(), 1), |
| 1300 | CI->getOperand(1) |
Chris Lattner | c18470c | 2007-02-13 05:58:53 +0000 | [diff] [blame] | 1301 | }; |
David Greene | 52eec54 | 2007-08-01 03:43:44 +0000 | [diff] [blame] | 1302 | new CallInst(SLC.get_fwrite(FILEty), FWriteArgs, FWriteArgs + 4, CI->getName(), CI); |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1303 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), |
| 1304 | FormatStr.size())); |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1305 | } |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1306 | |
| 1307 | // The remaining optimizations require the format string to be length 2: |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1308 | // "%s" or "%c". |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1309 | if (FormatStr.size() != 2 || FormatStr[0] != '%') |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1310 | return false; |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1311 | |
| 1312 | // Get the second character and switch on its value |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1313 | switch (FormatStr[1]) { |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1314 | case 'c': { |
| 1315 | // fprintf(file,"%c",c) -> fputc(c,file) |
| 1316 | const Type *FILETy = CI->getOperand(1)->getType(); |
| 1317 | Value *C = CastInst::createZExtOrBitCast(CI->getOperand(3), Type::Int32Ty, |
| 1318 | CI->getName()+".int", CI); |
David Greene | 52eec54 | 2007-08-01 03:43:44 +0000 | [diff] [blame] | 1319 | SmallVector<Value *, 2> Args; |
| 1320 | Args.push_back(C); |
| 1321 | Args.push_back(CI->getOperand(1)); |
| 1322 | new CallInst(SLC.get_fputc(FILETy), Args.begin(), Args.end(), "", CI); |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1323 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), 1)); |
| 1324 | } |
| 1325 | case 's': { |
| 1326 | const Type *FILETy = CI->getOperand(1)->getType(); |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1327 | |
| 1328 | // If the result of the fprintf call is used, we can't do this. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1329 | // TODO: we should insert a strlen call. |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1330 | if (!CI->use_empty()) |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1331 | return false; |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1332 | |
| 1333 | // fprintf(file,"%s",str) -> fputs(str,file) |
David Greene | 52eec54 | 2007-08-01 03:43:44 +0000 | [diff] [blame] | 1334 | SmallVector<Value *, 2> Args; |
| 1335 | Args.push_back(CastToCStr(CI->getOperand(3), CI)); |
| 1336 | Args.push_back(CI->getOperand(1)); |
| 1337 | new CallInst(SLC.get_fputs(FILETy), Args.begin(), |
| 1338 | Args.end(), CI->getName(), CI); |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1339 | return ReplaceCallWith(CI, 0); |
| 1340 | } |
| 1341 | default: |
| 1342 | return false; |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1343 | } |
Reid Spencer | a1b4390 | 2005-05-02 23:59:26 +0000 | [diff] [blame] | 1344 | } |
| 1345 | } FPrintFOptimizer; |
| 1346 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1347 | /// This LibCallOptimization will simplify calls to the "sprintf" library |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 1348 | /// function. It looks for cases where the result of sprintf is not used and the |
| 1349 | /// operation can be reduced to something simpler. |
Evan Cheng | 21abac2 | 2006-06-16 08:36:35 +0000 | [diff] [blame] | 1350 | /// @brief Simplify the sprintf library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1351 | struct VISIBILITY_HIDDEN SPrintFOptimization : public LibCallOptimization { |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 1352 | public: |
| 1353 | /// @brief Default Constructor |
| 1354 | SPrintFOptimization() : LibCallOptimization("sprintf", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 1355 | "Number of 'sprintf' calls simplified") {} |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 1356 | |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1357 | /// @brief Make sure that the "sprintf" function has the right prototype |
| 1358 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
| 1359 | const FunctionType *FT = F->getFunctionType(); |
| 1360 | return FT->getNumParams() == 2 && // two fixed arguments. |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 1361 | FT->getParamType(1) == PointerType::getUnqual(Type::Int8Ty) && |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1362 | FT->getParamType(0) == FT->getParamType(1) && |
| 1363 | isa<IntegerType>(FT->getReturnType()); |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 1364 | } |
| 1365 | |
| 1366 | /// @brief Perform the sprintf optimization. |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1367 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 1368 | // If the call has more than 3 operands, we can't optimize it |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1369 | if (CI->getNumOperands() != 3 && CI->getNumOperands() != 4) |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 1370 | return false; |
| 1371 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1372 | std::string FormatStr; |
| 1373 | if (!GetConstantStringInfo(CI->getOperand(2), FormatStr)) |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 1374 | return false; |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1375 | |
| 1376 | if (CI->getNumOperands() == 3) { |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 1377 | // Make sure there's no % in the constant array |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1378 | for (unsigned i = 0, e = FormatStr.size(); i != e; ++i) |
| 1379 | if (FormatStr[i] == '%') |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1380 | return false; // we found a format specifier |
| 1381 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1382 | // sprintf(str,fmt) -> llvm.memcpy(str,fmt,strlen(fmt),1) |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1383 | Value *MemCpyArgs[] = { |
| 1384 | CI->getOperand(1), CI->getOperand(2), |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1385 | ConstantInt::get(SLC.getIntPtrType(), |
| 1386 | FormatStr.size()+1), // Copy the nul byte. |
Chris Lattner | c18470c | 2007-02-13 05:58:53 +0000 | [diff] [blame] | 1387 | ConstantInt::get(Type::Int32Ty, 1) |
| 1388 | }; |
David Greene | 52eec54 | 2007-08-01 03:43:44 +0000 | [diff] [blame] | 1389 | new CallInst(SLC.get_memcpy(), MemCpyArgs, MemCpyArgs + 4, "", CI); |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1390 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), |
| 1391 | FormatStr.size())); |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 1392 | } |
| 1393 | |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1394 | // The remaining optimizations require the format string to be "%s" or "%c". |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1395 | if (FormatStr.size() != 2 || FormatStr[0] != '%') |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 1396 | return false; |
| 1397 | |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 1398 | // Get the second character and switch on its value |
Chris Lattner | 5104785 | 2007-04-08 18:11:26 +0000 | [diff] [blame] | 1399 | switch (FormatStr[1]) { |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1400 | case 'c': { |
| 1401 | // sprintf(dest,"%c",chr) -> store chr, dest |
| 1402 | Value *V = CastInst::createTruncOrBitCast(CI->getOperand(3), |
| 1403 | Type::Int8Ty, "char", CI); |
| 1404 | new StoreInst(V, CI->getOperand(1), CI); |
| 1405 | Value *Ptr = new GetElementPtrInst(CI->getOperand(1), |
| 1406 | ConstantInt::get(Type::Int32Ty, 1), |
| 1407 | CI->getOperand(1)->getName()+".end", |
| 1408 | CI); |
| 1409 | new StoreInst(ConstantInt::get(Type::Int8Ty,0), Ptr, CI); |
| 1410 | return ReplaceCallWith(CI, ConstantInt::get(Type::Int32Ty, 1)); |
| 1411 | } |
Chris Lattner | 5d735bf | 2005-09-24 22:17:06 +0000 | [diff] [blame] | 1412 | case 's': { |
| 1413 | // sprintf(dest,"%s",str) -> llvm.memcpy(dest, str, strlen(str)+1, 1) |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 1414 | Value *Len = new CallInst(SLC.get_strlen(), |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1415 | CastToCStr(CI->getOperand(3), CI), |
| 1416 | CI->getOperand(3)->getName()+".len", CI); |
| 1417 | Value *UnincLen = Len; |
| 1418 | Len = BinaryOperator::createAdd(Len, ConstantInt::get(Len->getType(), 1), |
| 1419 | Len->getName()+"1", CI); |
| 1420 | Value *MemcpyArgs[4] = { |
| 1421 | CI->getOperand(1), |
| 1422 | CastToCStr(CI->getOperand(3), CI), |
| 1423 | Len, |
| 1424 | ConstantInt::get(Type::Int32Ty, 1) |
Chris Lattner | c18470c | 2007-02-13 05:58:53 +0000 | [diff] [blame] | 1425 | }; |
David Greene | 52eec54 | 2007-08-01 03:43:44 +0000 | [diff] [blame] | 1426 | new CallInst(SLC.get_memcpy(), MemcpyArgs, MemcpyArgs + 4, "", CI); |
Chris Lattner | 5d735bf | 2005-09-24 22:17:06 +0000 | [diff] [blame] | 1427 | |
| 1428 | // The strlen result is the unincremented number of bytes in the string. |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1429 | if (!CI->use_empty()) { |
| 1430 | if (UnincLen->getType() != CI->getType()) |
| 1431 | UnincLen = CastInst::createIntegerCast(UnincLen, CI->getType(), false, |
| 1432 | Len->getName(), CI); |
| 1433 | CI->replaceAllUsesWith(UnincLen); |
Chris Lattner | aebac50 | 2005-09-25 07:06:48 +0000 | [diff] [blame] | 1434 | } |
Chris Lattner | 73f5d42 | 2007-04-07 21:17:51 +0000 | [diff] [blame] | 1435 | return ReplaceCallWith(CI, 0); |
Chris Lattner | 5d735bf | 2005-09-24 22:17:06 +0000 | [diff] [blame] | 1436 | } |
| 1437 | } |
| 1438 | return false; |
Reid Spencer | 58b563c | 2005-05-04 03:20:21 +0000 | [diff] [blame] | 1439 | } |
| 1440 | } SPrintFOptimizer; |
| 1441 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1442 | /// This LibCallOptimization will simplify calls to the "fputs" library |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1443 | /// function. It looks for cases where the result of fputs is not used and the |
| 1444 | /// operation can be reduced to something simpler. |
Chris Lattner | 5cef3c6 | 2007-04-08 07:00:35 +0000 | [diff] [blame] | 1445 | /// @brief Simplify the fputs library function. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1446 | struct VISIBILITY_HIDDEN FPutsOptimization : public LibCallOptimization { |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1447 | public: |
| 1448 | /// @brief Default Constructor |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1449 | FPutsOptimization() : LibCallOptimization("fputs", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 1450 | "Number of 'fputs' calls simplified") {} |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1451 | |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1452 | /// @brief Make sure that the "fputs" function has the right prototype |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1453 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1454 | // Just make sure this has 2 arguments |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1455 | return F->arg_size() == 2; |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1456 | } |
| 1457 | |
| 1458 | /// @brief Perform the fputs optimization. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1459 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
| 1460 | // If the result is used, none of these optimizations work. |
| 1461 | if (!CI->use_empty()) |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1462 | return false; |
| 1463 | |
| 1464 | // All the optimizations depend on the length of the first argument and the |
| 1465 | // fact that it is a constant string array. Check that now |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1466 | std::string Str; |
| 1467 | if (!GetConstantStringInfo(CI->getOperand(1), Str)) |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1468 | return false; |
| 1469 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1470 | const Type *FILETy = CI->getOperand(2)->getType(); |
Chris Lattner | 5cef3c6 | 2007-04-08 07:00:35 +0000 | [diff] [blame] | 1471 | // fputs(s,F) -> fwrite(s,1,len,F) (if s is constant and strlen(s) > 1) |
| 1472 | Value *FWriteParms[4] = { |
| 1473 | CI->getOperand(1), |
| 1474 | ConstantInt::get(SLC.getIntPtrType(), Str.size()), |
| 1475 | ConstantInt::get(SLC.getIntPtrType(), 1), |
| 1476 | CI->getOperand(2) |
| 1477 | }; |
David Greene | 52eec54 | 2007-08-01 03:43:44 +0000 | [diff] [blame] | 1478 | new CallInst(SLC.get_fwrite(FILETy), FWriteParms, FWriteParms + 4, "", CI); |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1479 | return ReplaceCallWith(CI, 0); // Known to have no uses (see above). |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1480 | } |
Chris Lattner | 5cef3c6 | 2007-04-08 07:00:35 +0000 | [diff] [blame] | 1481 | } FPutsOptimizer; |
| 1482 | |
| 1483 | /// This LibCallOptimization will simplify calls to the "fwrite" function. |
| 1484 | struct VISIBILITY_HIDDEN FWriteOptimization : public LibCallOptimization { |
| 1485 | public: |
| 1486 | /// @brief Default Constructor |
| 1487 | FWriteOptimization() : LibCallOptimization("fwrite", |
| 1488 | "Number of 'fwrite' calls simplified") {} |
| 1489 | |
| 1490 | /// @brief Make sure that the "fputs" function has the right prototype |
| 1491 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
| 1492 | const FunctionType *FT = F->getFunctionType(); |
| 1493 | return FT->getNumParams() == 4 && |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 1494 | FT->getParamType(0) == PointerType::getUnqual(Type::Int8Ty) && |
Chris Lattner | 5cef3c6 | 2007-04-08 07:00:35 +0000 | [diff] [blame] | 1495 | FT->getParamType(1) == FT->getParamType(2) && |
| 1496 | isa<IntegerType>(FT->getParamType(1)) && |
| 1497 | isa<PointerType>(FT->getParamType(3)) && |
| 1498 | isa<IntegerType>(FT->getReturnType()); |
| 1499 | } |
| 1500 | |
| 1501 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
| 1502 | // Get the element size and count. |
| 1503 | uint64_t EltSize, EltCount; |
| 1504 | if (ConstantInt *C = dyn_cast<ConstantInt>(CI->getOperand(2))) |
| 1505 | EltSize = C->getZExtValue(); |
| 1506 | else |
| 1507 | return false; |
| 1508 | if (ConstantInt *C = dyn_cast<ConstantInt>(CI->getOperand(3))) |
| 1509 | EltCount = C->getZExtValue(); |
| 1510 | else |
| 1511 | return false; |
| 1512 | |
| 1513 | // If this is writing zero records, remove the call (it's a noop). |
| 1514 | if (EltSize * EltCount == 0) |
| 1515 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), 0)); |
| 1516 | |
| 1517 | // If this is writing one byte, turn it into fputc. |
| 1518 | if (EltSize == 1 && EltCount == 1) { |
David Greene | 52eec54 | 2007-08-01 03:43:44 +0000 | [diff] [blame] | 1519 | SmallVector<Value *, 2> Args; |
Chris Lattner | 5cef3c6 | 2007-04-08 07:00:35 +0000 | [diff] [blame] | 1520 | // fwrite(s,1,1,F) -> fputc(s[0],F) |
| 1521 | Value *Ptr = CI->getOperand(1); |
| 1522 | Value *Val = new LoadInst(Ptr, Ptr->getName()+".byte", CI); |
David Greene | 52eec54 | 2007-08-01 03:43:44 +0000 | [diff] [blame] | 1523 | Args.push_back(new ZExtInst(Val, Type::Int32Ty, Val->getName()+".int", CI)); |
| 1524 | Args.push_back(CI->getOperand(4)); |
Chris Lattner | 5cef3c6 | 2007-04-08 07:00:35 +0000 | [diff] [blame] | 1525 | const Type *FILETy = CI->getOperand(4)->getType(); |
David Greene | 52eec54 | 2007-08-01 03:43:44 +0000 | [diff] [blame] | 1526 | new CallInst(SLC.get_fputc(FILETy), Args.begin(), Args.end(), "", CI); |
Chris Lattner | 5cef3c6 | 2007-04-08 07:00:35 +0000 | [diff] [blame] | 1527 | return ReplaceCallWith(CI, ConstantInt::get(CI->getType(), 1)); |
| 1528 | } |
| 1529 | return false; |
| 1530 | } |
| 1531 | } FWriteOptimizer; |
Reid Spencer | ff5525d | 2005-04-29 09:39:47 +0000 | [diff] [blame] | 1532 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1533 | /// This LibCallOptimization will simplify calls to the "isdigit" library |
Reid Spencer | cea6559 | 2005-05-04 18:58:28 +0000 | [diff] [blame] | 1534 | /// function. It simply does range checks the parameter explicitly. |
| 1535 | /// @brief Simplify the isdigit library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1536 | struct VISIBILITY_HIDDEN isdigitOptimization : public LibCallOptimization { |
Reid Spencer | cea6559 | 2005-05-04 18:58:28 +0000 | [diff] [blame] | 1537 | public: |
Chris Lattner | e9b6242 | 2005-09-29 06:16:11 +0000 | [diff] [blame] | 1538 | isdigitOptimization() : LibCallOptimization("isdigit", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 1539 | "Number of 'isdigit' calls simplified") {} |
Reid Spencer | cea6559 | 2005-05-04 18:58:28 +0000 | [diff] [blame] | 1540 | |
Chris Lattner | e9b6242 | 2005-09-29 06:16:11 +0000 | [diff] [blame] | 1541 | /// @brief Make sure that the "isdigit" function has the right prototype |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1542 | virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC){ |
Reid Spencer | cea6559 | 2005-05-04 18:58:28 +0000 | [diff] [blame] | 1543 | // Just make sure this has 1 argument |
| 1544 | return (f->arg_size() == 1); |
| 1545 | } |
| 1546 | |
| 1547 | /// @brief Perform the toascii optimization. |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1548 | virtual bool OptimizeCall(CallInst *ci, SimplifyLibCalls &SLC) { |
| 1549 | if (ConstantInt* CI = dyn_cast<ConstantInt>(ci->getOperand(1))) { |
Reid Spencer | cea6559 | 2005-05-04 18:58:28 +0000 | [diff] [blame] | 1550 | // isdigit(c) -> 0 or 1, if 'c' is constant |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 1551 | uint64_t val = CI->getZExtValue(); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1552 | if (val >= '0' && val <= '9') |
| 1553 | return ReplaceCallWith(ci, ConstantInt::get(Type::Int32Ty, 1)); |
Reid Spencer | cea6559 | 2005-05-04 18:58:28 +0000 | [diff] [blame] | 1554 | else |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1555 | return ReplaceCallWith(ci, ConstantInt::get(Type::Int32Ty, 0)); |
Reid Spencer | cea6559 | 2005-05-04 18:58:28 +0000 | [diff] [blame] | 1556 | } |
| 1557 | |
| 1558 | // isdigit(c) -> (unsigned)c - '0' <= 9 |
Reid Spencer | 7b06bd5 | 2006-12-13 00:50:17 +0000 | [diff] [blame] | 1559 | CastInst* cast = CastInst::createIntegerCast(ci->getOperand(1), |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1560 | Type::Int32Ty, false/*ZExt*/, ci->getOperand(1)->getName()+".uint", ci); |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 1561 | BinaryOperator* sub_inst = BinaryOperator::createSub(cast, |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1562 | ConstantInt::get(Type::Int32Ty,0x30), |
Reid Spencer | cea6559 | 2005-05-04 18:58:28 +0000 | [diff] [blame] | 1563 | ci->getOperand(1)->getName()+".sub",ci); |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 1564 | ICmpInst* setcond_inst = new ICmpInst(ICmpInst::ICMP_ULE,sub_inst, |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1565 | ConstantInt::get(Type::Int32Ty,9), |
Reid Spencer | cea6559 | 2005-05-04 18:58:28 +0000 | [diff] [blame] | 1566 | ci->getOperand(1)->getName()+".cmp",ci); |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1567 | CastInst* c2 = new ZExtInst(setcond_inst, Type::Int32Ty, |
Reid Spencer | 7b06bd5 | 2006-12-13 00:50:17 +0000 | [diff] [blame] | 1568 | ci->getOperand(1)->getName()+".isdigit", ci); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1569 | return ReplaceCallWith(ci, c2); |
Reid Spencer | cea6559 | 2005-05-04 18:58:28 +0000 | [diff] [blame] | 1570 | } |
Chris Lattner | e9b6242 | 2005-09-29 06:16:11 +0000 | [diff] [blame] | 1571 | } isdigitOptimizer; |
| 1572 | |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1573 | struct VISIBILITY_HIDDEN isasciiOptimization : public LibCallOptimization { |
Chris Lattner | a48bc53 | 2005-09-29 06:17:27 +0000 | [diff] [blame] | 1574 | public: |
| 1575 | isasciiOptimization() |
| 1576 | : LibCallOptimization("isascii", "Number of 'isascii' calls simplified") {} |
| 1577 | |
| 1578 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
Chris Lattner | 42a7551 | 2007-01-15 02:27:26 +0000 | [diff] [blame] | 1579 | return F->arg_size() == 1 && F->arg_begin()->getType()->isInteger() && |
| 1580 | F->getReturnType()->isInteger(); |
Chris Lattner | a48bc53 | 2005-09-29 06:17:27 +0000 | [diff] [blame] | 1581 | } |
| 1582 | |
| 1583 | /// @brief Perform the isascii optimization. |
| 1584 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
| 1585 | // isascii(c) -> (unsigned)c < 128 |
| 1586 | Value *V = CI->getOperand(1); |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 1587 | Value *Cmp = new ICmpInst(ICmpInst::ICMP_ULT, V, |
| 1588 | ConstantInt::get(V->getType(), 128), |
| 1589 | V->getName()+".isascii", CI); |
Chris Lattner | a48bc53 | 2005-09-29 06:17:27 +0000 | [diff] [blame] | 1590 | if (Cmp->getType() != CI->getType()) |
Chris Lattner | 83ae2fc | 2007-04-15 05:38:40 +0000 | [diff] [blame] | 1591 | Cmp = new ZExtInst(Cmp, CI->getType(), Cmp->getName(), CI); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1592 | return ReplaceCallWith(CI, Cmp); |
Chris Lattner | a48bc53 | 2005-09-29 06:17:27 +0000 | [diff] [blame] | 1593 | } |
| 1594 | } isasciiOptimizer; |
Chris Lattner | e9b6242 | 2005-09-29 06:16:11 +0000 | [diff] [blame] | 1595 | |
Reid Spencer | cea6559 | 2005-05-04 18:58:28 +0000 | [diff] [blame] | 1596 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1597 | /// This LibCallOptimization will simplify calls to the "toascii" library |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 1598 | /// function. It simply does the corresponding and operation to restrict the |
| 1599 | /// range of values to the ASCII character set (0-127). |
| 1600 | /// @brief Simplify the toascii library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1601 | struct VISIBILITY_HIDDEN ToAsciiOptimization : public LibCallOptimization { |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 1602 | public: |
| 1603 | /// @brief Default Constructor |
Reid Spencer | 9974dda | 2005-05-03 02:54:54 +0000 | [diff] [blame] | 1604 | ToAsciiOptimization() : LibCallOptimization("toascii", |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 1605 | "Number of 'toascii' calls simplified") {} |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 1606 | |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 1607 | /// @brief Make sure that the "fputs" function has the right prototype |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1608 | virtual bool ValidateCalledFunction(const Function* f, SimplifyLibCalls& SLC){ |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 1609 | // Just make sure this has 2 arguments |
| 1610 | return (f->arg_size() == 1); |
| 1611 | } |
| 1612 | |
| 1613 | /// @brief Perform the toascii optimization. |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1614 | virtual bool OptimizeCall(CallInst *ci, SimplifyLibCalls &SLC) { |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 1615 | // toascii(c) -> (c & 0x7f) |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1616 | Value *chr = ci->getOperand(1); |
| 1617 | Value *and_inst = BinaryOperator::createAnd(chr, |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 1618 | ConstantInt::get(chr->getType(),0x7F),ci->getName()+".toascii",ci); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1619 | return ReplaceCallWith(ci, and_inst); |
Reid Spencer | 9f56b1f | 2005-04-30 03:17:54 +0000 | [diff] [blame] | 1620 | } |
| 1621 | } ToAsciiOptimizer; |
| 1622 | |
Reid Spencer | c29b13d | 2005-05-14 16:42:52 +0000 | [diff] [blame] | 1623 | /// This LibCallOptimization will simplify calls to the "ffs" library |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1624 | /// calls which find the first set bit in an int, long, or long long. The |
Reid Spencer | c29b13d | 2005-05-14 16:42:52 +0000 | [diff] [blame] | 1625 | /// optimization is to compute the result at compile time if the argument is |
| 1626 | /// a constant. |
| 1627 | /// @brief Simplify the ffs library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1628 | struct VISIBILITY_HIDDEN FFSOptimization : public LibCallOptimization { |
Reid Spencer | c29b13d | 2005-05-14 16:42:52 +0000 | [diff] [blame] | 1629 | protected: |
| 1630 | /// @brief Subclass Constructor |
| 1631 | FFSOptimization(const char* funcName, const char* description) |
Chris Lattner | f91e97a | 2006-01-17 18:27:17 +0000 | [diff] [blame] | 1632 | : LibCallOptimization(funcName, description) {} |
Reid Spencer | c29b13d | 2005-05-14 16:42:52 +0000 | [diff] [blame] | 1633 | |
| 1634 | public: |
| 1635 | /// @brief Default Constructor |
| 1636 | FFSOptimization() : LibCallOptimization("ffs", |
| 1637 | "Number of 'ffs' calls simplified") {} |
| 1638 | |
Chris Lattner | f91e97a | 2006-01-17 18:27:17 +0000 | [diff] [blame] | 1639 | /// @brief Make sure that the "ffs" function has the right prototype |
| 1640 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
Reid Spencer | c29b13d | 2005-05-14 16:42:52 +0000 | [diff] [blame] | 1641 | // Just make sure this has 2 arguments |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1642 | return F->arg_size() == 1 && F->getReturnType() == Type::Int32Ty; |
Reid Spencer | c29b13d | 2005-05-14 16:42:52 +0000 | [diff] [blame] | 1643 | } |
| 1644 | |
| 1645 | /// @brief Perform the ffs optimization. |
Chris Lattner | f91e97a | 2006-01-17 18:27:17 +0000 | [diff] [blame] | 1646 | virtual bool OptimizeCall(CallInst *TheCall, SimplifyLibCalls &SLC) { |
| 1647 | if (ConstantInt *CI = dyn_cast<ConstantInt>(TheCall->getOperand(1))) { |
Reid Spencer | c29b13d | 2005-05-14 16:42:52 +0000 | [diff] [blame] | 1648 | // ffs(cnst) -> bit# |
| 1649 | // ffsl(cnst) -> bit# |
Reid Spencer | f74eb3f | 2005-05-15 21:19:45 +0000 | [diff] [blame] | 1650 | // ffsll(cnst) -> bit# |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 1651 | uint64_t val = CI->getZExtValue(); |
Reid Spencer | f74eb3f | 2005-05-15 21:19:45 +0000 | [diff] [blame] | 1652 | int result = 0; |
Chris Lattner | f91e97a | 2006-01-17 18:27:17 +0000 | [diff] [blame] | 1653 | if (val) { |
| 1654 | ++result; |
| 1655 | while ((val & 1) == 0) { |
| 1656 | ++result; |
| 1657 | val >>= 1; |
| 1658 | } |
Reid Spencer | f74eb3f | 2005-05-15 21:19:45 +0000 | [diff] [blame] | 1659 | } |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1660 | return ReplaceCallWith(TheCall, ConstantInt::get(Type::Int32Ty, result)); |
Reid Spencer | c29b13d | 2005-05-14 16:42:52 +0000 | [diff] [blame] | 1661 | } |
Reid Spencer | f74eb3f | 2005-05-15 21:19:45 +0000 | [diff] [blame] | 1662 | |
Chris Lattner | f91e97a | 2006-01-17 18:27:17 +0000 | [diff] [blame] | 1663 | // ffs(x) -> x == 0 ? 0 : llvm.cttz(x)+1 |
| 1664 | // ffsl(x) -> x == 0 ? 0 : llvm.cttz(x)+1 |
| 1665 | // ffsll(x) -> x == 0 ? 0 : llvm.cttz(x)+1 |
| 1666 | const Type *ArgType = TheCall->getOperand(1)->getType(); |
Chris Lattner | f91e97a | 2006-01-17 18:27:17 +0000 | [diff] [blame] | 1667 | const char *CTTZName; |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 1668 | assert(ArgType->getTypeID() == Type::IntegerTyID && |
| 1669 | "llvm.cttz argument is not an integer?"); |
| 1670 | unsigned BitWidth = cast<IntegerType>(ArgType)->getBitWidth(); |
Chris Lattner | 720922f | 2007-01-12 22:49:11 +0000 | [diff] [blame] | 1671 | if (BitWidth == 8) |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 1672 | CTTZName = "llvm.cttz.i8"; |
Chris Lattner | 720922f | 2007-01-12 22:49:11 +0000 | [diff] [blame] | 1673 | else if (BitWidth == 16) |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 1674 | CTTZName = "llvm.cttz.i16"; |
Chris Lattner | 720922f | 2007-01-12 22:49:11 +0000 | [diff] [blame] | 1675 | else if (BitWidth == 32) |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 1676 | CTTZName = "llvm.cttz.i32"; |
Chris Lattner | 720922f | 2007-01-12 22:49:11 +0000 | [diff] [blame] | 1677 | else { |
| 1678 | assert(BitWidth == 64 && "Unknown bitwidth"); |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 1679 | CTTZName = "llvm.cttz.i64"; |
Chris Lattner | 720922f | 2007-01-12 22:49:11 +0000 | [diff] [blame] | 1680 | } |
Chris Lattner | f91e97a | 2006-01-17 18:27:17 +0000 | [diff] [blame] | 1681 | |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 1682 | Constant *F = SLC.getModule()->getOrInsertFunction(CTTZName, ArgType, |
Chris Lattner | f91e97a | 2006-01-17 18:27:17 +0000 | [diff] [blame] | 1683 | ArgType, NULL); |
Reid Spencer | 7b06bd5 | 2006-12-13 00:50:17 +0000 | [diff] [blame] | 1684 | Value *V = CastInst::createIntegerCast(TheCall->getOperand(1), ArgType, |
| 1685 | false/*ZExt*/, "tmp", TheCall); |
Chris Lattner | f91e97a | 2006-01-17 18:27:17 +0000 | [diff] [blame] | 1686 | Value *V2 = new CallInst(F, V, "tmp", TheCall); |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1687 | V2 = CastInst::createIntegerCast(V2, Type::Int32Ty, false/*ZExt*/, |
Reid Spencer | 7b06bd5 | 2006-12-13 00:50:17 +0000 | [diff] [blame] | 1688 | "tmp", TheCall); |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1689 | V2 = BinaryOperator::createAdd(V2, ConstantInt::get(Type::Int32Ty, 1), |
Chris Lattner | f91e97a | 2006-01-17 18:27:17 +0000 | [diff] [blame] | 1690 | "tmp", TheCall); |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 1691 | Value *Cond = new ICmpInst(ICmpInst::ICMP_EQ, V, |
| 1692 | Constant::getNullValue(V->getType()), "tmp", |
| 1693 | TheCall); |
Reid Spencer | c5b206b | 2006-12-31 05:48:39 +0000 | [diff] [blame] | 1694 | V2 = new SelectInst(Cond, ConstantInt::get(Type::Int32Ty, 0), V2, |
Chris Lattner | f91e97a | 2006-01-17 18:27:17 +0000 | [diff] [blame] | 1695 | TheCall->getName(), TheCall); |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1696 | return ReplaceCallWith(TheCall, V2); |
Reid Spencer | c29b13d | 2005-05-14 16:42:52 +0000 | [diff] [blame] | 1697 | } |
| 1698 | } FFSOptimizer; |
| 1699 | |
| 1700 | /// This LibCallOptimization will simplify calls to the "ffsl" library |
| 1701 | /// calls. It simply uses FFSOptimization for which the transformation is |
| 1702 | /// identical. |
| 1703 | /// @brief Simplify the ffsl library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1704 | struct VISIBILITY_HIDDEN FFSLOptimization : public FFSOptimization { |
Reid Spencer | c29b13d | 2005-05-14 16:42:52 +0000 | [diff] [blame] | 1705 | public: |
| 1706 | /// @brief Default Constructor |
| 1707 | FFSLOptimization() : FFSOptimization("ffsl", |
| 1708 | "Number of 'ffsl' calls simplified") {} |
| 1709 | |
| 1710 | } FFSLOptimizer; |
| 1711 | |
| 1712 | /// This LibCallOptimization will simplify calls to the "ffsll" library |
| 1713 | /// calls. It simply uses FFSOptimization for which the transformation is |
| 1714 | /// identical. |
| 1715 | /// @brief Simplify the ffsl library function. |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1716 | struct VISIBILITY_HIDDEN FFSLLOptimization : public FFSOptimization { |
Reid Spencer | c29b13d | 2005-05-14 16:42:52 +0000 | [diff] [blame] | 1717 | public: |
| 1718 | /// @brief Default Constructor |
| 1719 | FFSLLOptimization() : FFSOptimization("ffsll", |
| 1720 | "Number of 'ffsll' calls simplified") {} |
| 1721 | |
| 1722 | } FFSLLOptimizer; |
| 1723 | |
Chris Lattner | 7070c5f | 2006-01-23 05:57:36 +0000 | [diff] [blame] | 1724 | /// This optimizes unary functions that take and return doubles. |
| 1725 | struct UnaryDoubleFPOptimizer : public LibCallOptimization { |
| 1726 | UnaryDoubleFPOptimizer(const char *Fn, const char *Desc) |
| 1727 | : LibCallOptimization(Fn, Desc) {} |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 1728 | |
Chris Lattner | 7070c5f | 2006-01-23 05:57:36 +0000 | [diff] [blame] | 1729 | // Make sure that this function has the right prototype |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 1730 | virtual bool ValidateCalledFunction(const Function *F, SimplifyLibCalls &SLC){ |
| 1731 | return F->arg_size() == 1 && F->arg_begin()->getType() == Type::DoubleTy && |
| 1732 | F->getReturnType() == Type::DoubleTy; |
| 1733 | } |
Chris Lattner | 7070c5f | 2006-01-23 05:57:36 +0000 | [diff] [blame] | 1734 | |
| 1735 | /// ShrinkFunctionToFloatVersion - If the input to this function is really a |
| 1736 | /// float, strength reduce this to a float version of the function, |
| 1737 | /// e.g. floor((double)FLT) -> (double)floorf(FLT). This can only be called |
| 1738 | /// when the target supports the destination function and where there can be |
| 1739 | /// no precision loss. |
| 1740 | static bool ShrinkFunctionToFloatVersion(CallInst *CI, SimplifyLibCalls &SLC, |
Chris Lattner | b76efb7 | 2007-01-07 08:12:01 +0000 | [diff] [blame] | 1741 | Constant *(SimplifyLibCalls::*FP)()){ |
Chris Lattner | 679d718 | 2007-04-07 00:42:32 +0000 | [diff] [blame] | 1742 | if (FPExtInst *Cast = dyn_cast<FPExtInst>(CI->getOperand(1))) |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 1743 | if (Cast->getOperand(0)->getType() == Type::FloatTy) { |
Chris Lattner | 7070c5f | 2006-01-23 05:57:36 +0000 | [diff] [blame] | 1744 | Value *New = new CallInst((SLC.*FP)(), Cast->getOperand(0), |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 1745 | CI->getName(), CI); |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 1746 | New = new FPExtInst(New, Type::DoubleTy, CI->getName(), CI); |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 1747 | CI->replaceAllUsesWith(New); |
| 1748 | CI->eraseFromParent(); |
| 1749 | if (Cast->use_empty()) |
| 1750 | Cast->eraseFromParent(); |
| 1751 | return true; |
| 1752 | } |
Chris Lattner | 7070c5f | 2006-01-23 05:57:36 +0000 | [diff] [blame] | 1753 | return false; |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 1754 | } |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1755 | }; |
| 1756 | |
Chris Lattner | 7070c5f | 2006-01-23 05:57:36 +0000 | [diff] [blame] | 1757 | |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1758 | struct VISIBILITY_HIDDEN FloorOptimization : public UnaryDoubleFPOptimizer { |
Chris Lattner | 7070c5f | 2006-01-23 05:57:36 +0000 | [diff] [blame] | 1759 | FloorOptimization() |
| 1760 | : UnaryDoubleFPOptimizer("floor", "Number of 'floor' calls simplified") {} |
| 1761 | |
| 1762 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1763 | #ifdef HAVE_FLOORF |
Chris Lattner | 7070c5f | 2006-01-23 05:57:36 +0000 | [diff] [blame] | 1764 | // If this is a float argument passed in, convert to floorf. |
| 1765 | if (ShrinkFunctionToFloatVersion(CI, SLC, &SimplifyLibCalls::get_floorf)) |
| 1766 | return true; |
Reid Spencer | aa87e05 | 2006-01-19 08:36:56 +0000 | [diff] [blame] | 1767 | #endif |
Chris Lattner | 7070c5f | 2006-01-23 05:57:36 +0000 | [diff] [blame] | 1768 | return false; // opt failed |
| 1769 | } |
| 1770 | } FloorOptimizer; |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 1771 | |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1772 | struct VISIBILITY_HIDDEN CeilOptimization : public UnaryDoubleFPOptimizer { |
Chris Lattner | e46f6e9 | 2006-01-23 06:24:46 +0000 | [diff] [blame] | 1773 | CeilOptimization() |
| 1774 | : UnaryDoubleFPOptimizer("ceil", "Number of 'ceil' calls simplified") {} |
| 1775 | |
| 1776 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
| 1777 | #ifdef HAVE_CEILF |
| 1778 | // If this is a float argument passed in, convert to ceilf. |
| 1779 | if (ShrinkFunctionToFloatVersion(CI, SLC, &SimplifyLibCalls::get_ceilf)) |
| 1780 | return true; |
| 1781 | #endif |
| 1782 | return false; // opt failed |
| 1783 | } |
| 1784 | } CeilOptimizer; |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 1785 | |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1786 | struct VISIBILITY_HIDDEN RoundOptimization : public UnaryDoubleFPOptimizer { |
Chris Lattner | e46f6e9 | 2006-01-23 06:24:46 +0000 | [diff] [blame] | 1787 | RoundOptimization() |
| 1788 | : UnaryDoubleFPOptimizer("round", "Number of 'round' calls simplified") {} |
| 1789 | |
| 1790 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
| 1791 | #ifdef HAVE_ROUNDF |
| 1792 | // If this is a float argument passed in, convert to roundf. |
| 1793 | if (ShrinkFunctionToFloatVersion(CI, SLC, &SimplifyLibCalls::get_roundf)) |
| 1794 | return true; |
| 1795 | #endif |
| 1796 | return false; // opt failed |
| 1797 | } |
| 1798 | } RoundOptimizer; |
| 1799 | |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1800 | struct VISIBILITY_HIDDEN RintOptimization : public UnaryDoubleFPOptimizer { |
Chris Lattner | e46f6e9 | 2006-01-23 06:24:46 +0000 | [diff] [blame] | 1801 | RintOptimization() |
| 1802 | : UnaryDoubleFPOptimizer("rint", "Number of 'rint' calls simplified") {} |
| 1803 | |
| 1804 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
| 1805 | #ifdef HAVE_RINTF |
| 1806 | // If this is a float argument passed in, convert to rintf. |
| 1807 | if (ShrinkFunctionToFloatVersion(CI, SLC, &SimplifyLibCalls::get_rintf)) |
| 1808 | return true; |
| 1809 | #endif |
| 1810 | return false; // opt failed |
| 1811 | } |
| 1812 | } RintOptimizer; |
| 1813 | |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 1814 | struct VISIBILITY_HIDDEN NearByIntOptimization : public UnaryDoubleFPOptimizer { |
Chris Lattner | e46f6e9 | 2006-01-23 06:24:46 +0000 | [diff] [blame] | 1815 | NearByIntOptimization() |
| 1816 | : UnaryDoubleFPOptimizer("nearbyint", |
| 1817 | "Number of 'nearbyint' calls simplified") {} |
| 1818 | |
| 1819 | virtual bool OptimizeCall(CallInst *CI, SimplifyLibCalls &SLC) { |
| 1820 | #ifdef HAVE_NEARBYINTF |
| 1821 | // If this is a float argument passed in, convert to nearbyintf. |
| 1822 | if (ShrinkFunctionToFloatVersion(CI, SLC,&SimplifyLibCalls::get_nearbyintf)) |
| 1823 | return true; |
| 1824 | #endif |
| 1825 | return false; // opt failed |
| 1826 | } |
| 1827 | } NearByIntOptimizer; |
Chris Lattner | 5324986 | 2005-08-24 17:22:17 +0000 | [diff] [blame] | 1828 | |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1829 | /// GetConstantStringInfo - This function computes the length of a |
| 1830 | /// null-terminated constant array of integers. This function can't rely on the |
| 1831 | /// size of the constant array because there could be a null terminator in the |
| 1832 | /// middle of the array. |
| 1833 | /// |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1834 | /// We also have to bail out if we find a non-integer constant initializer |
| 1835 | /// of one of the elements or if there is no null-terminator. The logic |
Reid Spencer | 716f49e | 2005-04-27 21:29:20 +0000 | [diff] [blame] | 1836 | /// below checks each of these conditions and will return true only if all |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1837 | /// conditions are met. If the conditions aren't met, this returns false. |
| 1838 | /// |
| 1839 | /// If successful, the \p Array param is set to the constant array being |
| 1840 | /// indexed, the \p Length parameter is set to the length of the null-terminated |
| 1841 | /// string pointed to by V, the \p StartIdx value is set to the first |
| 1842 | /// element of the Array that V points to, and true is returned. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1843 | static bool GetConstantStringInfo(Value *V, std::string &Str) { |
| 1844 | // Look through noop bitcast instructions. |
| 1845 | if (BitCastInst *BCI = dyn_cast<BitCastInst>(V)) { |
| 1846 | if (BCI->getType() == BCI->getOperand(0)->getType()) |
| 1847 | return GetConstantStringInfo(BCI->getOperand(0), Str); |
| 1848 | return false; |
| 1849 | } |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1850 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1851 | // If the value is not a GEP instruction nor a constant expression with a |
| 1852 | // GEP instruction, then return false because ConstantArray can't occur |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1853 | // any other way |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1854 | User *GEP = 0; |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1855 | if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(V)) { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1856 | GEP = GEPI; |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1857 | } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) { |
| 1858 | if (CE->getOpcode() != Instruction::GetElementPtr) |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1859 | return false; |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1860 | GEP = CE; |
| 1861 | } else { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1862 | return false; |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1863 | } |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1864 | |
| 1865 | // Make sure the GEP has exactly three arguments. |
| 1866 | if (GEP->getNumOperands() != 3) |
| 1867 | return false; |
| 1868 | |
| 1869 | // Check to make sure that the first operand of the GEP is an integer and |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1870 | // has value 0 so that we are sure we're indexing into the initializer. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1871 | if (ConstantInt *Idx = dyn_cast<ConstantInt>(GEP->getOperand(1))) { |
| 1872 | if (!Idx->isZero()) |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1873 | return false; |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1874 | } else |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1875 | return false; |
| 1876 | |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1877 | // If the second index isn't a ConstantInt, then this is a variable index |
| 1878 | // into the array. If this occurs, we can't say anything meaningful about |
| 1879 | // the string. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1880 | uint64_t StartIdx = 0; |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1881 | if (ConstantInt *CI = dyn_cast<ConstantInt>(GEP->getOperand(2))) |
| 1882 | StartIdx = CI->getZExtValue(); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1883 | else |
| 1884 | return false; |
| 1885 | |
| 1886 | // The GEP instruction, constant or instruction, must reference a global |
| 1887 | // variable that is a constant and is initialized. The referenced constant |
| 1888 | // initializer is the array that we'll use for optimization. |
| 1889 | GlobalVariable* GV = dyn_cast<GlobalVariable>(GEP->getOperand(0)); |
| 1890 | if (!GV || !GV->isConstant() || !GV->hasInitializer()) |
| 1891 | return false; |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1892 | Constant *GlobalInit = GV->getInitializer(); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1893 | |
| 1894 | // Handle the ConstantAggregateZero case |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1895 | if (isa<ConstantAggregateZero>(GlobalInit)) { |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1896 | // This is a degenerate case. The initializer is constant zero so the |
| 1897 | // length of the string must be zero. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1898 | Str.clear(); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1899 | return true; |
| 1900 | } |
| 1901 | |
| 1902 | // Must be a Constant Array |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1903 | ConstantArray *Array = dyn_cast<ConstantArray>(GlobalInit); |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1904 | if (!Array) return false; |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1905 | |
| 1906 | // Get the number of elements in the array |
Chris Lattner | c8e1741 | 2007-04-06 22:54:17 +0000 | [diff] [blame] | 1907 | uint64_t NumElts = Array->getType()->getNumElements(); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1908 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1909 | // Traverse the constant array from StartIdx (derived above) which is |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1910 | // the place the GEP refers to in the array. |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1911 | for (unsigned i = StartIdx; i < NumElts; ++i) { |
| 1912 | Constant *Elt = Array->getOperand(i); |
| 1913 | ConstantInt *CI = dyn_cast<ConstantInt>(Elt); |
| 1914 | if (!CI) // This array isn't suitable, non-int initializer. |
| 1915 | return false; |
| 1916 | if (CI->isZero()) |
| 1917 | return true; // we found end of string, success! |
| 1918 | Str += (char)CI->getZExtValue(); |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1919 | } |
Chris Lattner | 0f9f8c3 | 2006-01-22 22:35:08 +0000 | [diff] [blame] | 1920 | |
Chris Lattner | 0cd3a23 | 2007-04-07 21:58:02 +0000 | [diff] [blame] | 1921 | return false; // The array isn't null terminated. |
Reid Spencer | a16d5a5 | 2005-04-27 07:54:40 +0000 | [diff] [blame] | 1922 | } |
| 1923 | |
Reid Spencer | 134d2e4 | 2005-06-18 17:46:28 +0000 | [diff] [blame] | 1924 | /// CastToCStr - Return V if it is an sbyte*, otherwise cast it to sbyte*, |
| 1925 | /// inserting the cast before IP, and return the cast. |
| 1926 | /// @brief Cast a value to a "C" string. |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1927 | static Value *CastToCStr(Value *V, Instruction *IP) { |
Reid Spencer | dccd9fe | 2006-12-13 08:04:32 +0000 | [diff] [blame] | 1928 | assert(isa<PointerType>(V->getType()) && |
Reid Spencer | 7b06bd5 | 2006-12-13 00:50:17 +0000 | [diff] [blame] | 1929 | "Can't cast non-pointer type to C string type"); |
Christopher Lamb | 43ad6b3 | 2007-12-17 01:12:55 +0000 | [diff] [blame] | 1930 | const Type *SBPTy = PointerType::getUnqual(Type::Int8Ty); |
Reid Spencer | 134d2e4 | 2005-06-18 17:46:28 +0000 | [diff] [blame] | 1931 | if (V->getType() != SBPTy) |
Chris Lattner | 3492cda | 2007-04-07 21:04:50 +0000 | [diff] [blame] | 1932 | return new BitCastInst(V, SBPTy, V->getName(), IP); |
Reid Spencer | 134d2e4 | 2005-06-18 17:46:28 +0000 | [diff] [blame] | 1933 | return V; |
| 1934 | } |
| 1935 | |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1936 | // TODO: |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1937 | // Additional cases that we need to add to this file: |
| 1938 | // |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1939 | // cbrt: |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1940 | // * cbrt(expN(X)) -> expN(x/3) |
| 1941 | // * cbrt(sqrt(x)) -> pow(x,1/6) |
| 1942 | // * cbrt(sqrt(x)) -> pow(x,1/9) |
| 1943 | // |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1944 | // cos, cosf, cosl: |
Reid Spencer | 5624c75 | 2005-04-28 18:05:16 +0000 | [diff] [blame] | 1945 | // * cos(-x) -> cos(x) |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1946 | // |
| 1947 | // exp, expf, expl: |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1948 | // * exp(log(x)) -> x |
| 1949 | // |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1950 | // log, logf, logl: |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1951 | // * log(exp(x)) -> x |
| 1952 | // * log(x**y) -> y*log(x) |
| 1953 | // * log(exp(y)) -> y*log(e) |
| 1954 | // * log(exp2(y)) -> y*log(2) |
| 1955 | // * log(exp10(y)) -> y*log(10) |
| 1956 | // * log(sqrt(x)) -> 0.5*log(x) |
| 1957 | // * log(pow(x,y)) -> y*log(x) |
| 1958 | // |
| 1959 | // lround, lroundf, lroundl: |
| 1960 | // * lround(cnst) -> cnst' |
| 1961 | // |
| 1962 | // memcmp: |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1963 | // * memcmp(x,y,l) -> cnst |
| 1964 | // (if all arguments are constant and strlen(x) <= l and strlen(y) <= l) |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1965 | // |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1966 | // memmove: |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 1967 | // * memmove(d,s,l,a) -> memcpy(d,s,l,a) |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1968 | // (if s is a global constant array) |
| 1969 | // |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1970 | // pow, powf, powl: |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1971 | // * pow(exp(x),y) -> exp(x*y) |
| 1972 | // * pow(sqrt(x),y) -> pow(x,y*0.5) |
| 1973 | // * pow(pow(x,y),z)-> pow(x,y*z) |
| 1974 | // |
| 1975 | // puts: |
Chris Lattner | 35b9b49 | 2007-04-14 01:17:48 +0000 | [diff] [blame] | 1976 | // * puts("") -> putchar("\n") |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1977 | // |
| 1978 | // round, roundf, roundl: |
| 1979 | // * round(cnst) -> cnst' |
| 1980 | // |
| 1981 | // signbit: |
| 1982 | // * signbit(cnst) -> cnst' |
| 1983 | // * signbit(nncst) -> 0 (if pstv is a non-negative constant) |
| 1984 | // |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1985 | // sqrt, sqrtf, sqrtl: |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1986 | // * sqrt(expN(x)) -> expN(x*0.5) |
| 1987 | // * sqrt(Nroot(x)) -> pow(x,1/(2*N)) |
| 1988 | // * sqrt(pow(x,y)) -> pow(|x|,y*0.5) |
| 1989 | // |
Reid Spencer | 789082a | 2005-05-07 20:15:59 +0000 | [diff] [blame] | 1990 | // stpcpy: |
| 1991 | // * stpcpy(str, "literal") -> |
| 1992 | // llvm.memcpy(str,"literal",strlen("literal")+1,1) |
Reid Spencer | 21506ff | 2005-05-03 07:23:44 +0000 | [diff] [blame] | 1993 | // strrchr: |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1994 | // * strrchr(s,c) -> reverse_offset_of_in(c,s) |
| 1995 | // (if c is a constant integer and s is a constant string) |
| 1996 | // * strrchr(s1,0) -> strchr(s1,0) |
| 1997 | // |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 1998 | // strncat: |
| 1999 | // * strncat(x,y,0) -> x |
| 2000 | // * strncat(x,y,0) -> x (if strlen(y) = 0) |
| 2001 | // * strncat(x,y,l) -> strcat(x,y) (if y and l are constants an l > strlen(y)) |
| 2002 | // |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 2003 | // strncpy: |
| 2004 | // * strncpy(d,s,0) -> d |
| 2005 | // * strncpy(d,s,l) -> memcpy(d,s,l,1) |
| 2006 | // (if s and l are constants) |
| 2007 | // |
| 2008 | // strpbrk: |
| 2009 | // * strpbrk(s,a) -> offset_in_for(s,a) |
| 2010 | // (if s and a are both constant strings) |
| 2011 | // * strpbrk(s,"") -> 0 |
| 2012 | // * strpbrk(s,a) -> strchr(s,a[0]) (if a is constant string of length 1) |
| 2013 | // |
| 2014 | // strspn, strcspn: |
| 2015 | // * strspn(s,a) -> const_int (if both args are constant) |
| 2016 | // * strspn("",a) -> 0 |
| 2017 | // * strspn(s,"") -> 0 |
| 2018 | // * strcspn(s,a) -> const_int (if both args are constant) |
| 2019 | // * strcspn("",a) -> 0 |
| 2020 | // * strcspn(s,"") -> strlen(a) |
| 2021 | // |
| 2022 | // strstr: |
| 2023 | // * strstr(x,x) -> x |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 2024 | // * strstr(s1,s2) -> offset_of_s2_in(s1) |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 2025 | // (if s1 and s2 are constant strings) |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 2026 | // |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 2027 | // tan, tanf, tanl: |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 2028 | // * tan(atan(x)) -> x |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 2029 | // |
Reid Spencer | 8441a01 | 2005-04-28 04:40:06 +0000 | [diff] [blame] | 2030 | // trunc, truncf, truncl: |
| 2031 | // * trunc(cnst) -> cnst' |
| 2032 | // |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 2033 | // |
Reid Spencer | a7c049b | 2005-04-25 02:53:12 +0000 | [diff] [blame] | 2034 | } |