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