Brian Gaeke | 3ca4fcc | 2004-04-25 07:04:49 +0000 | [diff] [blame] | 1 | //===- SparcV9PreSelection.cpp - Specialize LLVM code for SparcV9 ---------===// |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file was developed by the LLVM research group and is distributed under |
| 6 | // the University of Illinois Open Source License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 9 | // |
Brian Gaeke | 3ca4fcc | 2004-04-25 07:04:49 +0000 | [diff] [blame] | 10 | // This file defines the PreSelection pass which specializes LLVM code for |
| 11 | // the SparcV9 instruction selector, while remaining in legal portable LLVM |
| 12 | // form and preserving type information and type safety. This is meant to enable |
| 13 | // dataflow optimizations on SparcV9-specific operations such as accesses to |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 14 | // constants, globals, and array indexing. |
| 15 | // |
| 16 | //===----------------------------------------------------------------------===// |
| 17 | |
Brian Gaeke | e3d6807 | 2004-02-25 18:44:15 +0000 | [diff] [blame] | 18 | #include "SparcV9Internals.h" |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 19 | #include "llvm/Constants.h" |
Misha Brukman | bb8c863 | 2003-10-22 04:51:36 +0000 | [diff] [blame] | 20 | #include "llvm/DerivedTypes.h" |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 21 | #include "llvm/iMemory.h" |
| 22 | #include "llvm/iPHINode.h" |
| 23 | #include "llvm/iOther.h" |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 24 | #include "llvm/Module.h" |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 25 | #include "llvm/Pass.h" |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 26 | #include "llvm/Support/InstVisitor.h" |
Chris Lattner | 97220b7 | 2004-04-04 20:44:05 +0000 | [diff] [blame] | 27 | #include "llvm/Support/GetElementPtrTypeIterator.h" |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 28 | #include "llvm/Target/TargetInstrInfo.h" |
| 29 | #include "llvm/Target/TargetMachine.h" |
| 30 | #include "llvm/Transforms/Scalar.h" |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 31 | #include <algorithm> |
Chris Lattner | 97220b7 | 2004-04-04 20:44:05 +0000 | [diff] [blame] | 32 | using namespace llvm; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 33 | |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 34 | namespace { |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 35 | |
| 36 | //===--------------------------------------------------------------------===// |
Brian Gaeke | 3ca4fcc | 2004-04-25 07:04:49 +0000 | [diff] [blame] | 37 | // PreSelection Pass - Specialize LLVM code for the SparcV9 instr. selector. |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 38 | // |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 39 | class PreSelection : public FunctionPass, public InstVisitor<PreSelection> { |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 40 | const TargetInstrInfo &instrInfo; |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 41 | |
| 42 | public: |
Chris Lattner | dac9131 | 2003-10-21 14:49:19 +0000 | [diff] [blame] | 43 | PreSelection(const TargetMachine &T) |
Chris Lattner | d029cd2 | 2004-06-02 05:55:25 +0000 | [diff] [blame] | 44 | : instrInfo(*T.getInstrInfo()) {} |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 45 | |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 46 | // runOnFunction - apply this pass to each Function |
| 47 | bool runOnFunction(Function &F) { |
| 48 | visit(F); |
Chris Lattner | dac9131 | 2003-10-21 14:49:19 +0000 | [diff] [blame] | 49 | return true; |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 50 | } |
Brian Gaeke | c46f8a4 | 2004-03-11 19:23:15 +0000 | [diff] [blame] | 51 | const char *getPassName() const { return "SparcV9 Instr. Pre-selection"; } |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 52 | |
| 53 | // These methods do the actual work of specializing code |
| 54 | void visitInstruction(Instruction &I); // common work for every instr. |
| 55 | void visitGetElementPtrInst(GetElementPtrInst &I); |
Vikram S. Adve | 9635867 | 2003-05-31 07:34:57 +0000 | [diff] [blame] | 56 | void visitCallInst(CallInst &I); |
Chris Lattner | 4c62e79 | 2003-10-21 16:09:23 +0000 | [diff] [blame] | 57 | void visitPHINode(PHINode &PN); |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 58 | |
| 59 | // Helper functions for visiting operands of every instruction |
Vikram S. Adve | 9635867 | 2003-05-31 07:34:57 +0000 | [diff] [blame] | 60 | // |
| 61 | // visitOperands() works on every operand in [firstOp, lastOp-1]. |
| 62 | // If lastOp==0, lastOp defaults to #operands or #incoming Phi values. |
| 63 | // |
| 64 | // visitOneOperand() does all the work for one operand. |
| 65 | // |
Chris Lattner | d48a1d7 | 2003-10-21 16:06:07 +0000 | [diff] [blame] | 66 | void visitOperands(Instruction &I, int firstOp=0); |
Vikram S. Adve | 9635867 | 2003-05-31 07:34:57 +0000 | [diff] [blame] | 67 | void visitOneOperand(Instruction &I, Value* Op, unsigned opNum, |
| 68 | Instruction& insertBefore); |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 69 | }; |
Chris Lattner | ec8aae3 | 2003-04-24 18:35:51 +0000 | [diff] [blame] | 70 | |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 71 | #if 0 |
Chris Lattner | ec8aae3 | 2003-04-24 18:35:51 +0000 | [diff] [blame] | 72 | // Register the pass... |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 73 | RegisterPass<PreSelection> X("preselect", |
| 74 | "Specialize LLVM code for a target machine" |
| 75 | createPreselectionPass); |
| 76 | #endif |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 77 | |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 78 | } // end anonymous namespace |
| 79 | |
| 80 | |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 81 | //------------------------------------------------------------------------------ |
| 82 | // Helper functions used by methods of class PreSelection |
| 83 | //------------------------------------------------------------------------------ |
| 84 | |
| 85 | |
| 86 | // getGlobalAddr(): Put address of a global into a v. register. |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 87 | static GetElementPtrInst* getGlobalAddr(Value* ptr, Instruction& insertBefore) { |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 88 | if (isa<ConstantPointerRef>(ptr)) |
| 89 | ptr = cast<ConstantPointerRef>(ptr)->getValue(); |
| 90 | |
Chris Lattner | 2ab5e12 | 2003-06-04 01:24:40 +0000 | [diff] [blame] | 91 | return (isa<GlobalVariable>(ptr)) |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 92 | ? new GetElementPtrInst(ptr, |
| 93 | std::vector<Value*>(1, ConstantSInt::get(Type::LongTy, 0U)), |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 94 | "addrOfGlobal", &insertBefore) |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 95 | : NULL; |
| 96 | } |
| 97 | |
Misha Brukman | c3402cd | 2003-12-17 22:06:08 +0000 | [diff] [blame] | 98 | // Wrapper on Constant::classof to use in find_if |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 99 | inline static bool nonConstant(const Use& U) { |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 100 | return ! isa<Constant>(U); |
| 101 | } |
| 102 | |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 103 | static Instruction* DecomposeConstantExpr(ConstantExpr* CE, |
| 104 | Instruction& insertBefore) |
| 105 | { |
| 106 | Value *getArg1, *getArg2; |
Brian Gaeke | 142e22a | 2004-04-02 17:52:29 +0000 | [diff] [blame] | 107 | |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 108 | switch(CE->getOpcode()) |
| 109 | { |
| 110 | case Instruction::Cast: |
| 111 | getArg1 = CE->getOperand(0); |
| 112 | if (ConstantExpr* CEarg = dyn_cast<ConstantExpr>(getArg1)) |
| 113 | getArg1 = DecomposeConstantExpr(CEarg, insertBefore); |
| 114 | return new CastInst(getArg1, CE->getType(), "constantCast",&insertBefore); |
| 115 | |
| 116 | case Instruction::GetElementPtr: |
Chris Lattner | dc476b8 | 2002-10-27 19:09:51 +0000 | [diff] [blame] | 117 | assert(find_if(CE->op_begin()+1, CE->op_end(),nonConstant) == CE->op_end() |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 118 | && "All indices in ConstantExpr getelementptr must be constant!"); |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 119 | getArg1 = CE->getOperand(0); |
| 120 | if (ConstantExpr* CEarg = dyn_cast<ConstantExpr>(getArg1)) |
| 121 | getArg1 = DecomposeConstantExpr(CEarg, insertBefore); |
| 122 | else if (GetElementPtrInst* gep = getGlobalAddr(getArg1, insertBefore)) |
| 123 | getArg1 = gep; |
| 124 | return new GetElementPtrInst(getArg1, |
Chris Lattner | dc476b8 | 2002-10-27 19:09:51 +0000 | [diff] [blame] | 125 | std::vector<Value*>(CE->op_begin()+1, CE->op_end()), |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 126 | "constantGEP", &insertBefore); |
Brian Gaeke | 142e22a | 2004-04-02 17:52:29 +0000 | [diff] [blame] | 127 | |
| 128 | case Instruction::Select: { |
| 129 | Value *C, *S1, *S2; |
| 130 | C = CE->getOperand (0); |
| 131 | if (ConstantExpr* CEarg = dyn_cast<ConstantExpr> (C)) |
| 132 | C = DecomposeConstantExpr (CEarg, insertBefore); |
| 133 | S1 = CE->getOperand (1); |
| 134 | if (ConstantExpr* CEarg = dyn_cast<ConstantExpr> (S1)) |
| 135 | S1 = DecomposeConstantExpr (CEarg, insertBefore); |
| 136 | S2 = CE->getOperand (2); |
| 137 | if (ConstantExpr* CEarg = dyn_cast<ConstantExpr> (S2)) |
| 138 | S2 = DecomposeConstantExpr (CEarg, insertBefore); |
Brian Gaeke | 58fe769 | 2004-04-07 18:31:47 +0000 | [diff] [blame] | 139 | return new SelectInst (C, S1, S2, "constantSelect", &insertBefore); |
Brian Gaeke | 142e22a | 2004-04-02 17:52:29 +0000 | [diff] [blame] | 140 | } |
| 141 | |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 142 | default: // must be a binary operator |
Chris Lattner | 0b16ae2 | 2002-10-13 19:39:16 +0000 | [diff] [blame] | 143 | assert(CE->getOpcode() >= Instruction::BinaryOpsBegin && |
| 144 | CE->getOpcode() < Instruction::BinaryOpsEnd && |
Brian Gaeke | 142e22a | 2004-04-02 17:52:29 +0000 | [diff] [blame] | 145 | "Unhandled opcode in ConstantExpr"); |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 146 | getArg1 = CE->getOperand(0); |
| 147 | if (ConstantExpr* CEarg = dyn_cast<ConstantExpr>(getArg1)) |
| 148 | getArg1 = DecomposeConstantExpr(CEarg, insertBefore); |
| 149 | getArg2 = CE->getOperand(1); |
| 150 | if (ConstantExpr* CEarg = dyn_cast<ConstantExpr>(getArg2)) |
| 151 | getArg2 = DecomposeConstantExpr(CEarg, insertBefore); |
| 152 | return BinaryOperator::create((Instruction::BinaryOps) CE->getOpcode(), |
| 153 | getArg1, getArg2, |
| 154 | "constantBinaryOp", &insertBefore); |
| 155 | } |
| 156 | } |
| 157 | |
| 158 | |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 159 | //------------------------------------------------------------------------------ |
| 160 | // Instruction visitor methods to perform instruction-specific operations |
| 161 | //------------------------------------------------------------------------------ |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 162 | inline void |
| 163 | PreSelection::visitOneOperand(Instruction &I, Value* Op, unsigned opNum, |
| 164 | Instruction& insertBefore) |
| 165 | { |
Vikram S. Adve | 799ffee | 2003-07-02 01:23:15 +0000 | [diff] [blame] | 166 | assert(&insertBefore != NULL && "Must have instruction to insert before."); |
| 167 | |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 168 | if (GetElementPtrInst* gep = getGlobalAddr(Op, insertBefore)) { |
| 169 | I.setOperand(opNum, gep); // replace global operand |
Vikram S. Adve | 799ffee | 2003-07-02 01:23:15 +0000 | [diff] [blame] | 170 | return; // nothing more to do for this op. |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 171 | } |
| 172 | |
| 173 | Constant* CV = dyn_cast<Constant>(Op); |
| 174 | if (CV == NULL) |
| 175 | return; |
| 176 | |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 177 | if (ConstantExpr* CE = dyn_cast<ConstantExpr>(CV)) { |
| 178 | // load-time constant: factor it out so we optimize as best we can |
| 179 | Instruction* computeConst = DecomposeConstantExpr(CE, insertBefore); |
| 180 | I.setOperand(opNum, computeConst); // replace expr operand with result |
| 181 | } else if (instrInfo.ConstantTypeMustBeLoaded(CV)) { |
| 182 | // load address of constant into a register, then load the constant |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 183 | // this is now done during instruction selection |
| 184 | // the constant will live in the MachineConstantPool later on |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 185 | } else if (instrInfo.ConstantMayNotFitInImmedField(CV, &I)) { |
| 186 | // put the constant into a virtual register using a cast |
| 187 | CastInst* castI = new CastInst(CV, CV->getType(), "copyConst", |
| 188 | &insertBefore); |
| 189 | I.setOperand(opNum, castI); // replace operand with copy in v.reg. |
| 190 | } |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 191 | } |
| 192 | |
Misha Brukman | c3402cd | 2003-12-17 22:06:08 +0000 | [diff] [blame] | 193 | /// visitOperands - transform individual operands of all instructions: |
| 194 | /// -- Load "large" int constants into a virtual register. What is large |
| 195 | /// depends on the type of instruction and on the target architecture. |
| 196 | /// -- For any constants that cannot be put in an immediate field, |
| 197 | /// load address into virtual register first, and then load the constant. |
| 198 | /// |
| 199 | /// firstOp and lastOp can be used to skip leading and trailing operands. |
| 200 | /// If lastOp is 0, it defaults to #operands or #incoming Phi values. |
| 201 | /// |
Chris Lattner | d48a1d7 | 2003-10-21 16:06:07 +0000 | [diff] [blame] | 202 | inline void PreSelection::visitOperands(Instruction &I, int firstOp) { |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 203 | // For any instruction other than PHI, copies go just before the instr. |
Chris Lattner | 4c62e79 | 2003-10-21 16:09:23 +0000 | [diff] [blame] | 204 | for (unsigned i = firstOp, e = I.getNumOperands(); i != e; ++i) |
| 205 | visitOneOperand(I, I.getOperand(i), i, I); |
| 206 | } |
| 207 | |
| 208 | |
| 209 | void PreSelection::visitPHINode(PHINode &PN) { |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 210 | // For a PHI, operand copies must be before the terminator of the |
| 211 | // appropriate predecessor basic block. Remaining logic is simple |
| 212 | // so just handle PHIs and other instructions separately. |
| 213 | // |
Chris Lattner | 4c62e79 | 2003-10-21 16:09:23 +0000 | [diff] [blame] | 214 | for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) |
Chris Lattner | 08d702b | 2003-10-21 17:22:23 +0000 | [diff] [blame] | 215 | visitOneOperand(PN, PN.getIncomingValue(i), |
Chris Lattner | 4c62e79 | 2003-10-21 16:09:23 +0000 | [diff] [blame] | 216 | PN.getOperandNumForIncomingValue(i), |
| 217 | *PN.getIncomingBlock(i)->getTerminator()); |
| 218 | // do not call visitOperands! |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 219 | } |
| 220 | |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 221 | // Common work for *all* instructions. This needs to be called explicitly |
| 222 | // by other visit<InstructionType> functions. |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 223 | inline void PreSelection::visitInstruction(Instruction &I) { |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 224 | visitOperands(I); // Perform operand transformations |
| 225 | } |
| 226 | |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 227 | // GetElementPtr instructions: check if pointer is a global |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 228 | void PreSelection::visitGetElementPtrInst(GetElementPtrInst &I) { |
Vikram S. Adve | 799ffee | 2003-07-02 01:23:15 +0000 | [diff] [blame] | 229 | Instruction* curI = &I; |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 230 | |
Chris Lattner | 97220b7 | 2004-04-04 20:44:05 +0000 | [diff] [blame] | 231 | // The Sparc backend doesn't handle array indexes that are not long types, so |
| 232 | // insert a cast from whatever it is to long, if the sequential type index is |
| 233 | // not a long already. |
| 234 | unsigned Idx = 1; |
| 235 | for (gep_type_iterator TI = gep_type_begin(I), E = gep_type_end(I); TI != E; |
| 236 | ++TI, ++Idx) |
| 237 | if (isa<SequentialType>(*TI) && |
| 238 | I.getOperand(Idx)->getType() != Type::LongTy) { |
| 239 | Value *Op = I.getOperand(Idx); |
| 240 | if (Op->getType()->isUnsigned()) // Must sign extend! |
| 241 | Op = new CastInst(Op, Op->getType()->getSignedVersion(), "v9", &I); |
| 242 | if (Op->getType() != Type::LongTy) |
| 243 | Op = new CastInst(Op, Type::LongTy, "v9", &I); |
| 244 | I.setOperand(Idx, Op); |
| 245 | } |
| 246 | |
| 247 | |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 248 | // Decompose multidimensional array references |
Vikram S. Adve | 799ffee | 2003-07-02 01:23:15 +0000 | [diff] [blame] | 249 | if (I.getNumIndices() >= 2) { |
| 250 | // DecomposeArrayRef() replaces I and deletes it, if successful, |
| 251 | // so remember predecessor in order to find the replacement instruction. |
| 252 | // Also remember the basic block in case there is no predecessor. |
| 253 | Instruction* prevI = I.getPrev(); |
| 254 | BasicBlock* bb = I.getParent(); |
| 255 | if (DecomposeArrayRef(&I)) |
| 256 | // first instr. replacing I |
| 257 | curI = cast<GetElementPtrInst>(prevI? prevI->getNext() : &bb->front()); |
| 258 | } |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 259 | |
| 260 | // Perform other transformations common to all instructions |
Vikram S. Adve | 799ffee | 2003-07-02 01:23:15 +0000 | [diff] [blame] | 261 | visitInstruction(*curI); |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 262 | } |
| 263 | |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 264 | void PreSelection::visitCallInst(CallInst &I) { |
Vikram S. Adve | 9635867 | 2003-05-31 07:34:57 +0000 | [diff] [blame] | 265 | // Tell visitOperands to ignore the function name if this is a direct call. |
| 266 | visitOperands(I, (/*firstOp=*/ I.getCalledFunction()? 1 : 0)); |
| 267 | } |
| 268 | |
Misha Brukman | c3402cd | 2003-12-17 22:06:08 +0000 | [diff] [blame] | 269 | /// createPreSelectionPass - Public entry point for the PreSelection pass |
| 270 | /// |
Chris Lattner | 97220b7 | 2004-04-04 20:44:05 +0000 | [diff] [blame] | 271 | FunctionPass* llvm::createPreSelectionPass(const TargetMachine &TM) { |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 272 | return new PreSelection(TM); |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 273 | } |