Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 1 | //===-- llvm/CodeGen/SelectionDAGISel.h - Common Base Class------*- C++ -*-===// |
Misha Brukman | ea61c35 | 2005-04-21 20:39:54 +0000 | [diff] [blame] | 2 | // |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | 7ed47a1 | 2007-12-29 19:59:42 +0000 | [diff] [blame] | 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
Misha Brukman | ea61c35 | 2005-04-21 20:39:54 +0000 | [diff] [blame] | 7 | // |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This file implements the SelectionDAGISel class, which is used as the common |
| 11 | // base class for SelectionDAG-based instruction selectors. |
| 12 | // |
| 13 | //===----------------------------------------------------------------------===// |
| 14 | |
| 15 | #ifndef LLVM_CODEGEN_SELECTIONDAG_ISEL_H |
| 16 | #define LLVM_CODEGEN_SELECTIONDAG_ISEL_H |
| 17 | |
Dan Gohman | f350b27 | 2008-08-23 02:25:05 +0000 | [diff] [blame] | 18 | #include "llvm/BasicBlock.h" |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 19 | #include "llvm/Pass.h" |
Evan Cheng | fe8dc2e | 2006-08-07 22:16:08 +0000 | [diff] [blame] | 20 | #include "llvm/CodeGen/SelectionDAG.h" |
Dan Gohman | ad2afc2 | 2009-07-31 18:16:33 +0000 | [diff] [blame] | 21 | #include "llvm/CodeGen/MachineFunctionPass.h" |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 22 | |
| 23 | namespace llvm { |
Dan Gohman | 3df24e6 | 2008-09-03 23:12:08 +0000 | [diff] [blame] | 24 | class FastISel; |
Dan Gohman | 2048b85 | 2009-11-23 18:04:58 +0000 | [diff] [blame] | 25 | class SelectionDAGBuilder; |
Dan Gohman | 475871a | 2008-07-27 21:46:04 +0000 | [diff] [blame] | 26 | class SDValue; |
Chris Lattner | 84bc542 | 2007-12-31 04:13:23 +0000 | [diff] [blame] | 27 | class MachineRegisterInfo; |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 28 | class MachineBasicBlock; |
| 29 | class MachineFunction; |
| 30 | class MachineInstr; |
| 31 | class TargetLowering; |
Dan Gohman | dd5b58a | 2008-10-14 23:54:11 +0000 | [diff] [blame] | 32 | class TargetInstrInfo; |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 33 | class FunctionLoweringInfo; |
Dan Gohman | fc54c55 | 2009-01-15 22:18:12 +0000 | [diff] [blame] | 34 | class ScheduleHazardRecognizer; |
Gordon Henriksen | 5eca075 | 2008-08-17 18:44:35 +0000 | [diff] [blame] | 35 | class GCFunctionInfo; |
Dan Gohman | 47ac0f0 | 2009-02-11 04:27:20 +0000 | [diff] [blame] | 36 | class ScheduleDAGSDNodes; |
Anton Korobeynikov | d0b82b3 | 2007-03-07 16:25:09 +0000 | [diff] [blame] | 37 | |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 38 | /// SelectionDAGISel - This is the common base class used for SelectionDAG-based |
| 39 | /// pattern-matching instruction selectors. |
Dan Gohman | ad2afc2 | 2009-07-31 18:16:33 +0000 | [diff] [blame] | 40 | class SelectionDAGISel : public MachineFunctionPass { |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 41 | public: |
Dan Gohman | 79ce276 | 2009-01-15 19:20:50 +0000 | [diff] [blame] | 42 | const TargetMachine &TM; |
Dan Gohman | d858e90 | 2010-04-17 15:26:15 +0000 | [diff] [blame^] | 43 | const TargetLowering &TLI; |
Dan Gohman | 7c3234c | 2008-08-27 23:52:12 +0000 | [diff] [blame] | 44 | FunctionLoweringInfo *FuncInfo; |
Dan Gohman | 79ce276 | 2009-01-15 19:20:50 +0000 | [diff] [blame] | 45 | MachineFunction *MF; |
| 46 | MachineRegisterInfo *RegInfo; |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 47 | SelectionDAG *CurDAG; |
Dan Gohman | 2048b85 | 2009-11-23 18:04:58 +0000 | [diff] [blame] | 48 | SelectionDAGBuilder *SDB; |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 49 | MachineBasicBlock *BB; |
Dan Gohman | 5f43f92 | 2007-08-27 16:26:13 +0000 | [diff] [blame] | 50 | AliasAnalysis *AA; |
Gordon Henriksen | 5eca075 | 2008-08-17 18:44:35 +0000 | [diff] [blame] | 51 | GCFunctionInfo *GFI; |
Bill Wendling | 98a366d | 2009-04-29 23:29:43 +0000 | [diff] [blame] | 52 | CodeGenOpt::Level OptLevel; |
Devang Patel | 1997473 | 2007-05-03 01:11:54 +0000 | [diff] [blame] | 53 | static char ID; |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 54 | |
Bill Wendling | 98a366d | 2009-04-29 23:29:43 +0000 | [diff] [blame] | 55 | explicit SelectionDAGISel(TargetMachine &tm, |
| 56 | CodeGenOpt::Level OL = CodeGenOpt::Default); |
Dan Gohman | 7c3234c | 2008-08-27 23:52:12 +0000 | [diff] [blame] | 57 | virtual ~SelectionDAGISel(); |
Jim Laskey | 9373beb | 2006-08-01 19:14:14 +0000 | [diff] [blame] | 58 | |
Dan Gohman | d858e90 | 2010-04-17 15:26:15 +0000 | [diff] [blame^] | 59 | const TargetLowering &getTargetLowering() { return TLI; } |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 60 | |
Chris Lattner | c809b68 | 2005-08-17 06:46:50 +0000 | [diff] [blame] | 61 | virtual void getAnalysisUsage(AnalysisUsage &AU) const; |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 62 | |
Dan Gohman | ad2afc2 | 2009-07-31 18:16:33 +0000 | [diff] [blame] | 63 | virtual bool runOnMachineFunction(MachineFunction &MF); |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 64 | |
Dan Gohman | 6465265 | 2010-04-14 20:17:22 +0000 | [diff] [blame] | 65 | virtual void EmitFunctionEntryCode() {} |
Evan Cheng | db8d56b | 2008-06-30 20:45:06 +0000 | [diff] [blame] | 66 | |
Chris Lattner | 7c306da | 2010-03-02 06:34:30 +0000 | [diff] [blame] | 67 | /// PreprocessISelDAG - This hook allows targets to hack on the graph before |
| 68 | /// instruction selection starts. |
| 69 | virtual void PreprocessISelDAG() {} |
| 70 | |
| 71 | /// PostprocessISelDAG() - This hook allows the target to hack on the graph |
| 72 | /// right after selection. |
| 73 | virtual void PostprocessISelDAG() {} |
| 74 | |
| 75 | /// Select - Main hook targets implement to select a node. |
| 76 | virtual SDNode *Select(SDNode *N) = 0; |
| 77 | |
Chris Lattner | 4c12e71 | 2006-02-24 02:12:52 +0000 | [diff] [blame] | 78 | /// SelectInlineAsmMemoryOperand - Select the specified address as a target |
| 79 | /// addressing mode, according to the specified constraint code. If this does |
| 80 | /// not match or is not implemented, return true. The resultant operands |
| 81 | /// (which will appear in the machine instruction) should be added to the |
| 82 | /// OutOps vector. |
Dan Gohman | 475871a | 2008-07-27 21:46:04 +0000 | [diff] [blame] | 83 | virtual bool SelectInlineAsmMemoryOperand(const SDValue &Op, |
Chris Lattner | 4c12e71 | 2006-02-24 02:12:52 +0000 | [diff] [blame] | 84 | char ConstraintCode, |
Dan Gohman | f350b27 | 2008-08-23 02:25:05 +0000 | [diff] [blame] | 85 | std::vector<SDValue> &OutOps) { |
Chris Lattner | 4c12e71 | 2006-02-24 02:12:52 +0000 | [diff] [blame] | 86 | return true; |
| 87 | } |
Evan Cheng | b2c121a | 2006-07-27 06:36:49 +0000 | [diff] [blame] | 88 | |
Evan Cheng | 014bf21 | 2010-02-15 19:41:07 +0000 | [diff] [blame] | 89 | /// IsProfitableToFold - Returns true if it's profitable to fold the specific |
| 90 | /// operand node N of U during instruction selection that starts at Root. |
| 91 | virtual bool IsProfitableToFold(SDValue N, SDNode *U, SDNode *Root) const; |
| 92 | |
| 93 | /// IsLegalToFold - Returns true if the specific operand node N of |
| 94 | /// U can be folded during instruction selection that starts at Root. |
Dan Gohman | d858e90 | 2010-04-17 15:26:15 +0000 | [diff] [blame^] | 95 | /// FIXME: This is a static member function because the PIC16 target, |
| 96 | /// which uses it during lowering. |
| 97 | static bool IsLegalToFold(SDValue N, SDNode *U, SDNode *Root, |
| 98 | CodeGenOpt::Level OptLevel, |
| 99 | bool IgnoreChains = false); |
Anton Korobeynikov | c1c6ef8 | 2009-05-08 18:51:58 +0000 | [diff] [blame] | 100 | |
Jim Laskey | 9ff542f | 2006-08-01 18:29:48 +0000 | [diff] [blame] | 101 | /// CreateTargetHazardRecognizer - Return a newly allocated hazard recognizer |
| 102 | /// to use for this target when scheduling the DAG. |
Dan Gohman | fc54c55 | 2009-01-15 22:18:12 +0000 | [diff] [blame] | 103 | virtual ScheduleHazardRecognizer *CreateTargetHazardRecognizer(); |
Jim Laskey | 9ff542f | 2006-08-01 18:29:48 +0000 | [diff] [blame] | 104 | |
Chris Lattner | aa6d708 | 2010-02-28 21:58:42 +0000 | [diff] [blame] | 105 | |
| 106 | // Opcodes used by the DAG state machine: |
| 107 | enum BuiltinOpcodes { |
| 108 | OPC_Scope, |
| 109 | OPC_RecordNode, |
| 110 | OPC_RecordChild0, OPC_RecordChild1, OPC_RecordChild2, OPC_RecordChild3, |
| 111 | OPC_RecordChild4, OPC_RecordChild5, OPC_RecordChild6, OPC_RecordChild7, |
| 112 | OPC_RecordMemRef, |
| 113 | OPC_CaptureFlagInput, |
| 114 | OPC_MoveChild, |
| 115 | OPC_MoveParent, |
| 116 | OPC_CheckSame, |
| 117 | OPC_CheckPatternPredicate, |
| 118 | OPC_CheckPredicate, |
| 119 | OPC_CheckOpcode, |
Chris Lattner | eb66921 | 2010-03-01 06:59:22 +0000 | [diff] [blame] | 120 | OPC_SwitchOpcode, |
Chris Lattner | aa6d708 | 2010-02-28 21:58:42 +0000 | [diff] [blame] | 121 | OPC_CheckType, |
Chris Lattner | cfe2eab | 2010-03-03 06:28:15 +0000 | [diff] [blame] | 122 | OPC_SwitchType, |
Chris Lattner | aa6d708 | 2010-02-28 21:58:42 +0000 | [diff] [blame] | 123 | OPC_CheckChild0Type, OPC_CheckChild1Type, OPC_CheckChild2Type, |
| 124 | OPC_CheckChild3Type, OPC_CheckChild4Type, OPC_CheckChild5Type, |
| 125 | OPC_CheckChild6Type, OPC_CheckChild7Type, |
Chris Lattner | 5310654 | 2010-02-28 22:14:32 +0000 | [diff] [blame] | 126 | OPC_CheckInteger, |
Chris Lattner | aa6d708 | 2010-02-28 21:58:42 +0000 | [diff] [blame] | 127 | OPC_CheckCondCode, |
| 128 | OPC_CheckValueType, |
| 129 | OPC_CheckComplexPat, |
Chris Lattner | 5310654 | 2010-02-28 22:14:32 +0000 | [diff] [blame] | 130 | OPC_CheckAndImm, OPC_CheckOrImm, |
Chris Lattner | aa6d708 | 2010-02-28 21:58:42 +0000 | [diff] [blame] | 131 | OPC_CheckFoldableChainNode, |
Chris Lattner | aa6d708 | 2010-02-28 21:58:42 +0000 | [diff] [blame] | 132 | |
Chris Lattner | 5310654 | 2010-02-28 22:14:32 +0000 | [diff] [blame] | 133 | OPC_EmitInteger, |
Chris Lattner | aa6d708 | 2010-02-28 21:58:42 +0000 | [diff] [blame] | 134 | OPC_EmitRegister, |
| 135 | OPC_EmitConvertToTarget, |
| 136 | OPC_EmitMergeInputChains, |
Chris Lattner | aa4e339 | 2010-03-28 05:50:16 +0000 | [diff] [blame] | 137 | OPC_EmitMergeInputChains1_0, |
| 138 | OPC_EmitMergeInputChains1_1, |
Chris Lattner | aa6d708 | 2010-02-28 21:58:42 +0000 | [diff] [blame] | 139 | OPC_EmitCopyToReg, |
| 140 | OPC_EmitNodeXForm, |
| 141 | OPC_EmitNode, |
| 142 | OPC_MorphNodeTo, |
| 143 | OPC_MarkFlagResults, |
| 144 | OPC_CompleteMatch |
| 145 | }; |
| 146 | |
| 147 | enum { |
| 148 | OPFL_None = 0, // Node has no chain or flag input and isn't variadic. |
| 149 | OPFL_Chain = 1, // Node has a chain input. |
| 150 | OPFL_FlagInput = 2, // Node has a flag input. |
| 151 | OPFL_FlagOutput = 4, // Node has a flag output. |
| 152 | OPFL_MemRefs = 8, // Node gets accumulated MemRefs. |
| 153 | OPFL_Variadic0 = 1<<4, // Node is variadic, root has 0 fixed inputs. |
| 154 | OPFL_Variadic1 = 2<<4, // Node is variadic, root has 1 fixed inputs. |
| 155 | OPFL_Variadic2 = 3<<4, // Node is variadic, root has 2 fixed inputs. |
| 156 | OPFL_Variadic3 = 4<<4, // Node is variadic, root has 3 fixed inputs. |
| 157 | OPFL_Variadic4 = 5<<4, // Node is variadic, root has 4 fixed inputs. |
| 158 | OPFL_Variadic5 = 6<<4, // Node is variadic, root has 5 fixed inputs. |
| 159 | OPFL_Variadic6 = 7<<4, // Node is variadic, root has 6 fixed inputs. |
| 160 | |
| 161 | OPFL_VariadicInfo = OPFL_Variadic6 |
| 162 | }; |
| 163 | |
Chris Lattner | 2a49d57 | 2010-02-28 22:37:22 +0000 | [diff] [blame] | 164 | /// getNumFixedFromVariadicInfo - Transform an EmitNode flags word into the |
| 165 | /// number of fixed arity values that should be skipped when copying from the |
| 166 | /// root. |
| 167 | static inline int getNumFixedFromVariadicInfo(unsigned Flags) { |
| 168 | return ((Flags&OPFL_VariadicInfo) >> 4)-1; |
| 169 | } |
| 170 | |
| 171 | |
Chris Lattner | 66bac3c | 2005-08-18 18:44:33 +0000 | [diff] [blame] | 172 | protected: |
Evan Cheng | e2c0a4f | 2008-07-01 18:49:06 +0000 | [diff] [blame] | 173 | /// DAGSize - Size of DAG being instruction selected. |
| 174 | /// |
| 175 | unsigned DAGSize; |
Chris Lattner | 17b4b17 | 2010-03-02 06:04:12 +0000 | [diff] [blame] | 176 | |
| 177 | /// ISelPosition - Node iterator marking the current position of |
| 178 | /// instruction selection as it procedes through the topologically-sorted |
| 179 | /// node list. |
| 180 | SelectionDAG::allnodes_iterator ISelPosition; |
| 181 | |
| 182 | |
| 183 | /// ISelUpdater - helper class to handle updates of the |
| 184 | /// instruction selection graph. |
| 185 | class ISelUpdater : public SelectionDAG::DAGUpdateListener { |
| 186 | SelectionDAG::allnodes_iterator &ISelPosition; |
| 187 | public: |
| 188 | explicit ISelUpdater(SelectionDAG::allnodes_iterator &isp) |
| 189 | : ISelPosition(isp) {} |
| 190 | |
| 191 | /// NodeDeleted - Handle nodes deleted from the graph. If the |
| 192 | /// node being deleted is the current ISelPosition node, update |
| 193 | /// ISelPosition. |
| 194 | /// |
| 195 | virtual void NodeDeleted(SDNode *N, SDNode *E) { |
| 196 | if (ISelPosition == SelectionDAG::allnodes_iterator(N)) |
| 197 | ++ISelPosition; |
| 198 | } |
| 199 | |
| 200 | /// NodeUpdated - Ignore updates for now. |
| 201 | virtual void NodeUpdated(SDNode *N) {} |
| 202 | }; |
| 203 | |
| 204 | /// ReplaceUses - replace all uses of the old node F with the use |
| 205 | /// of the new node T. |
| 206 | void ReplaceUses(SDValue F, SDValue T) { |
| 207 | ISelUpdater ISU(ISelPosition); |
| 208 | CurDAG->ReplaceAllUsesOfValueWith(F, T, &ISU); |
| 209 | } |
| 210 | |
| 211 | /// ReplaceUses - replace all uses of the old nodes F with the use |
| 212 | /// of the new nodes T. |
| 213 | void ReplaceUses(const SDValue *F, const SDValue *T, unsigned Num) { |
| 214 | ISelUpdater ISU(ISelPosition); |
| 215 | CurDAG->ReplaceAllUsesOfValuesWith(F, T, Num, &ISU); |
| 216 | } |
| 217 | |
| 218 | /// ReplaceUses - replace all uses of the old node F with the use |
| 219 | /// of the new node T. |
| 220 | void ReplaceUses(SDNode *F, SDNode *T) { |
| 221 | ISelUpdater ISU(ISelPosition); |
| 222 | CurDAG->ReplaceAllUsesWith(F, T, &ISU); |
| 223 | } |
| 224 | |
Evan Cheng | e2c0a4f | 2008-07-01 18:49:06 +0000 | [diff] [blame] | 225 | |
Chris Lattner | 4c12e71 | 2006-02-24 02:12:52 +0000 | [diff] [blame] | 226 | /// SelectInlineAsmMemoryOperands - Calls to this are automatically generated |
| 227 | /// by tblgen. Others should not call it. |
Dan Gohman | f350b27 | 2008-08-23 02:25:05 +0000 | [diff] [blame] | 228 | void SelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops); |
Evan Cheng | b2c121a | 2006-07-27 06:36:49 +0000 | [diff] [blame] | 229 | |
Chris Lattner | f1b7c7d | 2010-03-03 07:31:15 +0000 | [diff] [blame] | 230 | |
| 231 | public: |
Chris Lattner | 7554806 | 2006-10-11 03:58:02 +0000 | [diff] [blame] | 232 | // Calls to these predicates are generated by tblgen. |
Dan Gohman | 475871a | 2008-07-27 21:46:04 +0000 | [diff] [blame] | 233 | bool CheckAndMask(SDValue LHS, ConstantSDNode *RHS, |
Dan Gohman | dc9b3d0 | 2007-07-24 23:00:27 +0000 | [diff] [blame] | 234 | int64_t DesiredMaskS) const; |
Dan Gohman | 475871a | 2008-07-27 21:46:04 +0000 | [diff] [blame] | 235 | bool CheckOrMask(SDValue LHS, ConstantSDNode *RHS, |
Dan Gohman | dc9b3d0 | 2007-07-24 23:00:27 +0000 | [diff] [blame] | 236 | int64_t DesiredMaskS) const; |
Chris Lattner | 7554806 | 2006-10-11 03:58:02 +0000 | [diff] [blame] | 237 | |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 238 | |
| 239 | /// CheckPatternPredicate - This function is generated by tblgen in the |
| 240 | /// target. It runs the specified pattern predicate and returns true if it |
| 241 | /// succeeds or false if it fails. The number is a private implementation |
| 242 | /// detail to the code tblgen produces. |
| 243 | virtual bool CheckPatternPredicate(unsigned PredNo) const { |
| 244 | assert(0 && "Tblgen should generate the implementation of this!"); |
| 245 | return 0; |
| 246 | } |
| 247 | |
Dan Gohman | fb76fe0 | 2010-02-22 04:10:52 +0000 | [diff] [blame] | 248 | /// CheckNodePredicate - This function is generated by tblgen in the target. |
| 249 | /// It runs node predicate number PredNo and returns true if it succeeds or |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 250 | /// false if it fails. The number is a private implementation |
| 251 | /// detail to the code tblgen produces. |
| 252 | virtual bool CheckNodePredicate(SDNode *N, unsigned PredNo) const { |
| 253 | assert(0 && "Tblgen should generate the implementation of this!"); |
| 254 | return 0; |
| 255 | } |
| 256 | |
Chris Lattner | bd12fe8 | 2010-02-17 00:41:34 +0000 | [diff] [blame] | 257 | virtual bool CheckComplexPattern(SDNode *Root, SDValue N, unsigned PatternNo, |
| 258 | SmallVectorImpl<SDValue> &Result) { |
| 259 | assert(0 && "Tblgen should generate the implementation of this!"); |
| 260 | return false; |
| 261 | } |
| 262 | |
Chris Lattner | beff6a3 | 2010-02-21 03:15:11 +0000 | [diff] [blame] | 263 | virtual SDValue RunSDNodeXForm(SDValue V, unsigned XFormNo) { |
| 264 | assert(0 && "Tblgen shoudl generate this!"); |
| 265 | return SDValue(); |
| 266 | } |
| 267 | |
Chris Lattner | f1b7c7d | 2010-03-03 07:31:15 +0000 | [diff] [blame] | 268 | SDNode *SelectCodeCommon(SDNode *NodeToMatch, |
| 269 | const unsigned char *MatcherTable, |
| 270 | unsigned TableSize); |
| 271 | |
| 272 | private: |
Chris Lattner | beff6a3 | 2010-02-21 03:15:11 +0000 | [diff] [blame] | 273 | |
Dan Gohman | e1f188f | 2009-10-29 22:30:23 +0000 | [diff] [blame] | 274 | // Calls to these functions are generated by tblgen. |
Dan Gohman | eeb3a00 | 2010-01-05 01:24:18 +0000 | [diff] [blame] | 275 | SDNode *Select_INLINEASM(SDNode *N); |
| 276 | SDNode *Select_UNDEF(SDNode *N); |
Dan Gohman | eeb3a00 | 2010-01-05 01:24:18 +0000 | [diff] [blame] | 277 | void CannotYetSelect(SDNode *N); |
Dan Gohman | e1f188f | 2009-10-29 22:30:23 +0000 | [diff] [blame] | 278 | |
Chris Lattner | 80d8a93 | 2005-01-17 17:14:43 +0000 | [diff] [blame] | 279 | private: |
Chris Lattner | 7c306da | 2010-03-02 06:34:30 +0000 | [diff] [blame] | 280 | void DoInstructionSelection(); |
Chris Lattner | 3ff1e4d | 2010-03-02 06:55:04 +0000 | [diff] [blame] | 281 | SDNode *MorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTs, |
| 282 | const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo); |
Chris Lattner | 7c306da | 2010-03-02 06:34:30 +0000 | [diff] [blame] | 283 | |
Dan Gohman | 2520864 | 2010-04-14 19:53:31 +0000 | [diff] [blame] | 284 | void PrepareEHLandingPad(MachineBasicBlock *BB); |
Dan Gohman | 46510a7 | 2010-04-15 01:51:59 +0000 | [diff] [blame] | 285 | void SelectAllBasicBlocks(const Function &Fn); |
Dan Gohman | 7c3234c | 2008-08-27 23:52:12 +0000 | [diff] [blame] | 286 | void FinishBasicBlock(); |
Misha Brukman | ea61c35 | 2005-04-21 20:39:54 +0000 | [diff] [blame] | 287 | |
Dan Gohman | 46510a7 | 2010-04-15 01:51:59 +0000 | [diff] [blame] | 288 | void SelectBasicBlock(const BasicBlock *LLVMBB, |
| 289 | BasicBlock::const_iterator Begin, |
| 290 | BasicBlock::const_iterator End, |
Dan Gohman | b4afb13 | 2009-11-20 02:51:26 +0000 | [diff] [blame] | 291 | bool &HadTailCall); |
Dan Gohman | f350b27 | 2008-08-23 02:25:05 +0000 | [diff] [blame] | 292 | void CodeGenAndEmitDAG(); |
Dan Gohman | 46510a7 | 2010-04-15 01:51:59 +0000 | [diff] [blame] | 293 | void LowerArguments(const BasicBlock *BB); |
Chris Lattner | ead0d88 | 2008-06-17 06:09:18 +0000 | [diff] [blame] | 294 | |
Evan Cheng | d40d03e | 2010-01-06 19:38:29 +0000 | [diff] [blame] | 295 | void ShrinkDemandedOps(); |
Dan Gohman | f350b27 | 2008-08-23 02:25:05 +0000 | [diff] [blame] | 296 | void ComputeLiveOutVRegInfo(); |
| 297 | |
Dan Gohman | 46510a7 | 2010-04-15 01:51:59 +0000 | [diff] [blame] | 298 | void HandlePHINodesInSuccessorBlocks(const BasicBlock *LLVMBB); |
Nate Begeman | f15485a | 2006-03-27 01:32:24 +0000 | [diff] [blame] | 299 | |
Dan Gohman | 46510a7 | 2010-04-15 01:51:59 +0000 | [diff] [blame] | 300 | bool HandlePHINodesInSuccessorBlocksFast(const BasicBlock *LLVMBB, |
| 301 | FastISel *F); |
Dan Gohman | 3df24e6 | 2008-09-03 23:12:08 +0000 | [diff] [blame] | 302 | |
Dan Gohman | 0a3776d | 2009-02-06 18:26:51 +0000 | [diff] [blame] | 303 | /// Create the scheduler. If a specific scheduler was specified |
| 304 | /// via the SchedulerRegistry, use it, otherwise select the |
| 305 | /// one preferred by the target. |
| 306 | /// |
Dan Gohman | 47ac0f0 | 2009-02-11 04:27:20 +0000 | [diff] [blame] | 307 | ScheduleDAGSDNodes *CreateScheduler(); |
Chris Lattner | 7390eeb | 2010-03-01 18:47:11 +0000 | [diff] [blame] | 308 | |
| 309 | /// OpcodeOffset - This is a cache used to dispatch efficiently into isel |
| 310 | /// state machines that start with a OPC_SwitchOpcode node. |
| 311 | std::vector<unsigned> OpcodeOffset; |
Chris Lattner | 82dd3d3 | 2010-03-02 07:50:03 +0000 | [diff] [blame] | 312 | |
| 313 | void UpdateChainsAndFlags(SDNode *NodeToMatch, SDValue InputChain, |
| 314 | const SmallVectorImpl<SDNode*> &ChainNodesMatched, |
| 315 | SDValue InputFlag,const SmallVectorImpl<SDNode*> &F, |
| 316 | bool isMorphNodeTo); |
| 317 | |
Chris Lattner | cc524ca | 2005-01-07 07:46:03 +0000 | [diff] [blame] | 318 | }; |
| 319 | |
| 320 | } |
| 321 | |
| 322 | #endif /* LLVM_CODEGEN_SELECTIONDAG_ISEL_H */ |