Chris Lattner | 035dfbe | 2002-08-09 20:08:06 +0000 | [diff] [blame] | 1 | //===-- SparcInstrSelection.cpp -------------------------------------------===// |
| 2 | // |
| 3 | // BURS instruction selection for SPARC V9 architecture. |
| 4 | // |
| 5 | //===----------------------------------------------------------------------===// |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 6 | |
| 7 | #include "SparcInternals.h" |
Vikram S. Adve | 7fe2787 | 2001-10-18 00:26:20 +0000 | [diff] [blame] | 8 | #include "SparcInstrSelectionSupport.h" |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 9 | #include "SparcRegClassInfo.h" |
Vikram S. Adve | 8557b22 | 2001-10-10 20:56:33 +0000 | [diff] [blame] | 10 | #include "llvm/CodeGen/InstrSelectionSupport.h" |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 11 | #include "llvm/CodeGen/MachineInstr.h" |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 12 | #include "llvm/CodeGen/MachineInstrAnnot.h" |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 13 | #include "llvm/CodeGen/InstrForest.h" |
| 14 | #include "llvm/CodeGen/InstrSelection.h" |
Misha Brukman | fce1143 | 2002-10-28 00:28:31 +0000 | [diff] [blame] | 15 | #include "llvm/CodeGen/MachineFunction.h" |
Chris Lattner | 9c46108 | 2002-02-03 07:50:56 +0000 | [diff] [blame] | 16 | #include "llvm/CodeGen/MachineCodeForInstruction.h" |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 17 | #include "llvm/DerivedTypes.h" |
| 18 | #include "llvm/iTerminators.h" |
| 19 | #include "llvm/iMemory.h" |
| 20 | #include "llvm/iOther.h" |
Chris Lattner | 2fbfdcf | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 21 | #include "llvm/Function.h" |
Chris Lattner | 31bcdb8 | 2002-04-28 19:55:58 +0000 | [diff] [blame] | 22 | #include "llvm/Constants.h" |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 23 | #include "llvm/ConstantHandling.h" |
Chris Lattner | cee8f9a | 2001-11-27 00:03:19 +0000 | [diff] [blame] | 24 | #include "Support/MathExtras.h" |
Chris Lattner | 749655f | 2001-10-13 06:54:30 +0000 | [diff] [blame] | 25 | #include <math.h> |
Chris Lattner | 697954c | 2002-01-20 22:54:45 +0000 | [diff] [blame] | 26 | using std::vector; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 27 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 28 | //************************ Internal Functions ******************************/ |
| 29 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 30 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 31 | static inline MachineOpCode |
| 32 | ChooseBprInstruction(const InstructionNode* instrNode) |
| 33 | { |
| 34 | MachineOpCode opCode; |
| 35 | |
| 36 | Instruction* setCCInstr = |
| 37 | ((InstructionNode*) instrNode->leftChild())->getInstruction(); |
| 38 | |
| 39 | switch(setCCInstr->getOpcode()) |
| 40 | { |
| 41 | case Instruction::SetEQ: opCode = BRZ; break; |
| 42 | case Instruction::SetNE: opCode = BRNZ; break; |
| 43 | case Instruction::SetLE: opCode = BRLEZ; break; |
| 44 | case Instruction::SetGE: opCode = BRGEZ; break; |
| 45 | case Instruction::SetLT: opCode = BRLZ; break; |
| 46 | case Instruction::SetGT: opCode = BRGZ; break; |
| 47 | default: |
| 48 | assert(0 && "Unrecognized VM instruction!"); |
| 49 | opCode = INVALID_OPCODE; |
| 50 | break; |
| 51 | } |
| 52 | |
| 53 | return opCode; |
| 54 | } |
| 55 | |
| 56 | |
| 57 | static inline MachineOpCode |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 58 | ChooseBpccInstruction(const InstructionNode* instrNode, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 59 | const BinaryOperator* setCCInstr) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 60 | { |
| 61 | MachineOpCode opCode = INVALID_OPCODE; |
| 62 | |
| 63 | bool isSigned = setCCInstr->getOperand(0)->getType()->isSigned(); |
| 64 | |
| 65 | if (isSigned) |
| 66 | { |
| 67 | switch(setCCInstr->getOpcode()) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 68 | { |
| 69 | case Instruction::SetEQ: opCode = BE; break; |
| 70 | case Instruction::SetNE: opCode = BNE; break; |
| 71 | case Instruction::SetLE: opCode = BLE; break; |
| 72 | case Instruction::SetGE: opCode = BGE; break; |
| 73 | case Instruction::SetLT: opCode = BL; break; |
| 74 | case Instruction::SetGT: opCode = BG; break; |
| 75 | default: |
| 76 | assert(0 && "Unrecognized VM instruction!"); |
| 77 | break; |
| 78 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 79 | } |
| 80 | else |
| 81 | { |
| 82 | switch(setCCInstr->getOpcode()) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 83 | { |
| 84 | case Instruction::SetEQ: opCode = BE; break; |
| 85 | case Instruction::SetNE: opCode = BNE; break; |
| 86 | case Instruction::SetLE: opCode = BLEU; break; |
| 87 | case Instruction::SetGE: opCode = BCC; break; |
| 88 | case Instruction::SetLT: opCode = BCS; break; |
| 89 | case Instruction::SetGT: opCode = BGU; break; |
| 90 | default: |
| 91 | assert(0 && "Unrecognized VM instruction!"); |
| 92 | break; |
| 93 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 94 | } |
| 95 | |
| 96 | return opCode; |
| 97 | } |
| 98 | |
| 99 | static inline MachineOpCode |
| 100 | ChooseBFpccInstruction(const InstructionNode* instrNode, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 101 | const BinaryOperator* setCCInstr) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 102 | { |
| 103 | MachineOpCode opCode = INVALID_OPCODE; |
| 104 | |
| 105 | switch(setCCInstr->getOpcode()) |
| 106 | { |
| 107 | case Instruction::SetEQ: opCode = FBE; break; |
| 108 | case Instruction::SetNE: opCode = FBNE; break; |
| 109 | case Instruction::SetLE: opCode = FBLE; break; |
| 110 | case Instruction::SetGE: opCode = FBGE; break; |
| 111 | case Instruction::SetLT: opCode = FBL; break; |
| 112 | case Instruction::SetGT: opCode = FBG; break; |
| 113 | default: |
| 114 | assert(0 && "Unrecognized VM instruction!"); |
| 115 | break; |
| 116 | } |
| 117 | |
| 118 | return opCode; |
| 119 | } |
| 120 | |
| 121 | |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 122 | // Create a unique TmpInstruction for a boolean value, |
| 123 | // representing the CC register used by a branch on that value. |
| 124 | // For now, hack this using a little static cache of TmpInstructions. |
| 125 | // Eventually the entire BURG instruction selection should be put |
| 126 | // into a separate class that can hold such information. |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 127 | // The static cache is not too bad because the memory for these |
Chris Lattner | 2fbfdcf | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 128 | // TmpInstructions will be freed along with the rest of the Function anyway. |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 129 | // |
| 130 | static TmpInstruction* |
Chris Lattner | 2fbfdcf | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 131 | GetTmpForCC(Value* boolVal, const Function *F, const Type* ccType) |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 132 | { |
Chris Lattner | 09ff112 | 2002-07-24 21:21:32 +0000 | [diff] [blame] | 133 | typedef hash_map<const Value*, TmpInstruction*> BoolTmpCache; |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 134 | static BoolTmpCache boolToTmpCache; // Map boolVal -> TmpInstruction* |
Chris Lattner | 2fbfdcf | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 135 | static const Function *lastFunction = 0;// Use to flush cache between funcs |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 136 | |
| 137 | assert(boolVal->getType() == Type::BoolTy && "Weird but ok! Delete assert"); |
| 138 | |
Chris Lattner | 2fbfdcf | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 139 | if (lastFunction != F) |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 140 | { |
Chris Lattner | 2fbfdcf | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 141 | lastFunction = F; |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 142 | boolToTmpCache.clear(); |
| 143 | } |
| 144 | |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 145 | // Look for tmpI and create a new one otherwise. The new value is |
| 146 | // directly written to map using the ref returned by operator[]. |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 147 | TmpInstruction*& tmpI = boolToTmpCache[boolVal]; |
| 148 | if (tmpI == NULL) |
Chris Lattner | 9c46108 | 2002-02-03 07:50:56 +0000 | [diff] [blame] | 149 | tmpI = new TmpInstruction(ccType, boolVal); |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 150 | |
| 151 | return tmpI; |
| 152 | } |
| 153 | |
| 154 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 155 | static inline MachineOpCode |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 156 | ChooseBccInstruction(const InstructionNode* instrNode, |
| 157 | bool& isFPBranch) |
| 158 | { |
| 159 | InstructionNode* setCCNode = (InstructionNode*) instrNode->leftChild(); |
Vikram S. Adve | 30a6f49 | 2002-08-22 02:56:10 +0000 | [diff] [blame] | 160 | assert(setCCNode->getOpLabel() == SetCCOp); |
| 161 | BinaryOperator* setCCInstr =cast<BinaryOperator>(setCCNode->getInstruction()); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 162 | const Type* setCCType = setCCInstr->getOperand(0)->getType(); |
| 163 | |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 164 | isFPBranch = setCCType->isFloatingPoint(); // Return value: don't delete! |
| 165 | |
| 166 | if (isFPBranch) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 167 | return ChooseBFpccInstruction(instrNode, setCCInstr); |
| 168 | else |
| 169 | return ChooseBpccInstruction(instrNode, setCCInstr); |
| 170 | } |
| 171 | |
| 172 | |
| 173 | static inline MachineOpCode |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 174 | ChooseMovFpccInstruction(const InstructionNode* instrNode) |
| 175 | { |
| 176 | MachineOpCode opCode = INVALID_OPCODE; |
| 177 | |
| 178 | switch(instrNode->getInstruction()->getOpcode()) |
| 179 | { |
| 180 | case Instruction::SetEQ: opCode = MOVFE; break; |
| 181 | case Instruction::SetNE: opCode = MOVFNE; break; |
| 182 | case Instruction::SetLE: opCode = MOVFLE; break; |
| 183 | case Instruction::SetGE: opCode = MOVFGE; break; |
| 184 | case Instruction::SetLT: opCode = MOVFL; break; |
| 185 | case Instruction::SetGT: opCode = MOVFG; break; |
| 186 | default: |
| 187 | assert(0 && "Unrecognized VM instruction!"); |
| 188 | break; |
| 189 | } |
| 190 | |
| 191 | return opCode; |
| 192 | } |
| 193 | |
| 194 | |
| 195 | // Assumes that SUBcc v1, v2 -> v3 has been executed. |
| 196 | // In most cases, we want to clear v3 and then follow it by instruction |
| 197 | // MOVcc 1 -> v3. |
| 198 | // Set mustClearReg=false if v3 need not be cleared before conditional move. |
| 199 | // Set valueToMove=0 if we want to conditionally move 0 instead of 1 |
| 200 | // (i.e., we want to test inverse of a condition) |
Vikram S. Adve | 243dd45 | 2001-09-18 13:03:13 +0000 | [diff] [blame] | 201 | // (The latter two cases do not seem to arise because SetNE needs nothing.) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 202 | // |
| 203 | static MachineOpCode |
| 204 | ChooseMovpccAfterSub(const InstructionNode* instrNode, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 205 | bool& mustClearReg, |
| 206 | int& valueToMove) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 207 | { |
| 208 | MachineOpCode opCode = INVALID_OPCODE; |
| 209 | mustClearReg = true; |
| 210 | valueToMove = 1; |
| 211 | |
| 212 | switch(instrNode->getInstruction()->getOpcode()) |
| 213 | { |
Vikram S. Adve | 243dd45 | 2001-09-18 13:03:13 +0000 | [diff] [blame] | 214 | case Instruction::SetEQ: opCode = MOVE; break; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 215 | case Instruction::SetLE: opCode = MOVLE; break; |
| 216 | case Instruction::SetGE: opCode = MOVGE; break; |
| 217 | case Instruction::SetLT: opCode = MOVL; break; |
| 218 | case Instruction::SetGT: opCode = MOVG; break; |
Vikram S. Adve | 243dd45 | 2001-09-18 13:03:13 +0000 | [diff] [blame] | 219 | case Instruction::SetNE: assert(0 && "No move required!"); break; |
| 220 | default: assert(0 && "Unrecognized VM instr!"); break; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 221 | } |
| 222 | |
| 223 | return opCode; |
| 224 | } |
| 225 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 226 | static inline MachineOpCode |
Vikram S. Adve | dbc4fad | 2002-04-25 04:37:51 +0000 | [diff] [blame] | 227 | ChooseConvertToFloatInstr(OpLabel vopCode, const Type* opType) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 228 | { |
| 229 | MachineOpCode opCode = INVALID_OPCODE; |
| 230 | |
Vikram S. Adve | dbc4fad | 2002-04-25 04:37:51 +0000 | [diff] [blame] | 231 | switch(vopCode) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 232 | { |
| 233 | case ToFloatTy: |
| 234 | if (opType == Type::SByteTy || opType == Type::ShortTy || opType == Type::IntTy) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 235 | opCode = FITOS; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 236 | else if (opType == Type::LongTy) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 237 | opCode = FXTOS; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 238 | else if (opType == Type::DoubleTy) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 239 | opCode = FDTOS; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 240 | else if (opType == Type::FloatTy) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 241 | ; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 242 | else |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 243 | assert(0 && "Cannot convert this type to FLOAT on SPARC"); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 244 | break; |
| 245 | |
| 246 | case ToDoubleTy: |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 247 | // This is usually used in conjunction with CreateCodeToCopyIntToFloat(). |
| 248 | // Both functions should treat the integer as a 32-bit value for types |
| 249 | // of 4 bytes or less, and as a 64-bit value otherwise. |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 250 | if (opType == Type::SByteTy || opType == Type::UByteTy || |
| 251 | opType == Type::ShortTy || opType == Type::UShortTy || |
| 252 | opType == Type::IntTy || opType == Type::UIntTy) |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 253 | opCode = FITOD; |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 254 | else if (opType == Type::LongTy || opType == Type::ULongTy) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 255 | opCode = FXTOD; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 256 | else if (opType == Type::FloatTy) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 257 | opCode = FSTOD; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 258 | else if (opType == Type::DoubleTy) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 259 | ; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 260 | else |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 261 | assert(0 && "Cannot convert this type to DOUBLE on SPARC"); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 262 | break; |
| 263 | |
| 264 | default: |
| 265 | break; |
| 266 | } |
| 267 | |
| 268 | return opCode; |
| 269 | } |
| 270 | |
| 271 | static inline MachineOpCode |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 272 | ChooseConvertFPToIntInstr(Type::PrimitiveID tid, const Type* opType) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 273 | { |
| 274 | MachineOpCode opCode = INVALID_OPCODE;; |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 275 | |
| 276 | assert((opType == Type::FloatTy || opType == Type::DoubleTy) |
| 277 | && "This function should only be called for FLOAT or DOUBLE"); |
| 278 | |
| 279 | if (tid==Type::UIntTyID) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 280 | { |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 281 | assert(tid != Type::UIntTyID && "FP-to-uint conversions must be expanded" |
| 282 | " into FP->long->uint for SPARC v9: SO RUN PRESELECTION PASS!"); |
| 283 | } |
| 284 | else if (tid==Type::SByteTyID || tid==Type::ShortTyID || tid==Type::IntTyID || |
| 285 | tid==Type::UByteTyID || tid==Type::UShortTyID) |
| 286 | { |
| 287 | opCode = (opType == Type::FloatTy)? FSTOI : FDTOI; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 288 | } |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 289 | else if (tid==Type::LongTyID || tid==Type::ULongTyID) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 290 | { |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 291 | opCode = (opType == Type::FloatTy)? FSTOX : FDTOX; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 292 | } |
| 293 | else |
| 294 | assert(0 && "Should not get here, Mo!"); |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 295 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 296 | return opCode; |
| 297 | } |
| 298 | |
Vikram S. Adve | dbc4fad | 2002-04-25 04:37:51 +0000 | [diff] [blame] | 299 | MachineInstr* |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 300 | CreateConvertFPToIntInstr(Type::PrimitiveID destTID, |
| 301 | Value* srcVal, Value* destVal) |
Vikram S. Adve | dbc4fad | 2002-04-25 04:37:51 +0000 | [diff] [blame] | 302 | { |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 303 | MachineOpCode opCode = ChooseConvertFPToIntInstr(destTID, srcVal->getType()); |
Vikram S. Adve | dbc4fad | 2002-04-25 04:37:51 +0000 | [diff] [blame] | 304 | assert(opCode != INVALID_OPCODE && "Expected to need conversion!"); |
| 305 | |
| 306 | MachineInstr* M = new MachineInstr(opCode); |
| 307 | M->SetMachineOperandVal(0, MachineOperand::MO_VirtualRegister, srcVal); |
| 308 | M->SetMachineOperandVal(1, MachineOperand::MO_VirtualRegister, destVal); |
| 309 | return M; |
| 310 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 311 | |
Vikram S. Adve | 8cfffd3 | 2002-08-24 20:56:53 +0000 | [diff] [blame] | 312 | // CreateCodeToConvertFloatToInt: Convert FP value to signed or unsigned integer |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 313 | // The FP value must be converted to the dest type in an FP register, |
| 314 | // and the result is then copied from FP to int register via memory. |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 315 | // |
| 316 | // Since fdtoi converts to signed integers, any FP value V between MAXINT+1 |
| 317 | // and MAXUNSIGNED (i.e., 2^31 <= V <= 2^32-1) would be converted incorrectly |
| 318 | // *only* when converting to an unsigned int. (Unsigned byte, short or long |
| 319 | // don't have this problem.) |
| 320 | // For unsigned int, we therefore have to generate the code sequence: |
| 321 | // |
| 322 | // if (V > (float) MAXINT) { |
| 323 | // unsigned result = (unsigned) (V - (float) MAXINT); |
| 324 | // result = result + (unsigned) MAXINT; |
| 325 | // } |
| 326 | // else |
| 327 | // result = (unsigned int) V; |
| 328 | // |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 329 | static void |
Vikram S. Adve | 8cfffd3 | 2002-08-24 20:56:53 +0000 | [diff] [blame] | 330 | CreateCodeToConvertFloatToInt(const TargetMachine& target, |
| 331 | Value* opVal, |
| 332 | Instruction* destI, |
| 333 | std::vector<MachineInstr*>& mvec, |
| 334 | MachineCodeForInstruction& mcfi) |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 335 | { |
| 336 | // Create a temporary to represent the FP register into which the |
| 337 | // int value will placed after conversion. The type of this temporary |
| 338 | // depends on the type of FP register to use: single-prec for a 32-bit |
| 339 | // int or smaller; double-prec for a 64-bit int. |
| 340 | // |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 341 | size_t destSize = target.DataLayout.getTypeSize(destI->getType()); |
| 342 | const Type* destTypeToUse = (destSize > 4)? Type::DoubleTy : Type::FloatTy; |
| 343 | TmpInstruction* destForCast = new TmpInstruction(destTypeToUse, opVal); |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 344 | mcfi.addTemp(destForCast); |
| 345 | |
| 346 | // Create the fp-to-int conversion code |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 347 | MachineInstr* M =CreateConvertFPToIntInstr(destI->getType()->getPrimitiveID(), |
| 348 | opVal, destForCast); |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 349 | mvec.push_back(M); |
| 350 | |
| 351 | // Create the fpreg-to-intreg copy code |
| 352 | target.getInstrInfo(). |
| 353 | CreateCodeToCopyFloatToInt(target, destI->getParent()->getParent(), |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 354 | destForCast, destI, mvec, mcfi); |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 355 | } |
| 356 | |
| 357 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 358 | static inline MachineOpCode |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 359 | ChooseAddInstruction(const InstructionNode* instrNode) |
| 360 | { |
| 361 | return ChooseAddInstructionByType(instrNode->getInstruction()->getType()); |
| 362 | } |
| 363 | |
| 364 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 365 | static inline MachineInstr* |
| 366 | CreateMovFloatInstruction(const InstructionNode* instrNode, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 367 | const Type* resultType) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 368 | { |
| 369 | MachineInstr* minstr = new MachineInstr((resultType == Type::FloatTy) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 370 | ? FMOVS : FMOVD); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 371 | minstr->SetMachineOperandVal(0, MachineOperand::MO_VirtualRegister, |
| 372 | instrNode->leftChild()->getValue()); |
| 373 | minstr->SetMachineOperandVal(1, MachineOperand::MO_VirtualRegister, |
| 374 | instrNode->getValue()); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 375 | return minstr; |
| 376 | } |
| 377 | |
| 378 | static inline MachineInstr* |
| 379 | CreateAddConstInstruction(const InstructionNode* instrNode) |
| 380 | { |
| 381 | MachineInstr* minstr = NULL; |
| 382 | |
| 383 | Value* constOp = ((InstrTreeNode*) instrNode->rightChild())->getValue(); |
Chris Lattner | e9bb2df | 2001-12-03 22:26:30 +0000 | [diff] [blame] | 384 | assert(isa<Constant>(constOp)); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 385 | |
| 386 | // Cases worth optimizing are: |
| 387 | // (1) Add with 0 for float or double: use an FMOV of appropriate type, |
| 388 | // instead of an FADD (1 vs 3 cycles). There is no integer MOV. |
| 389 | // |
Chris Lattner | 9b62503 | 2002-05-06 16:15:30 +0000 | [diff] [blame] | 390 | if (ConstantFP *FPC = dyn_cast<ConstantFP>(constOp)) { |
| 391 | double dval = FPC->getValue(); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 392 | if (dval == 0.0) |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 393 | minstr = CreateMovFloatInstruction(instrNode, |
| 394 | instrNode->getInstruction()->getType()); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 395 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 396 | |
| 397 | return minstr; |
| 398 | } |
| 399 | |
| 400 | |
| 401 | static inline MachineOpCode |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 402 | ChooseSubInstructionByType(const Type* resultType) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 403 | { |
| 404 | MachineOpCode opCode = INVALID_OPCODE; |
| 405 | |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 406 | if (resultType->isInteger() || isa<PointerType>(resultType)) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 407 | { |
| 408 | opCode = SUB; |
| 409 | } |
| 410 | else |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 411 | switch(resultType->getPrimitiveID()) |
| 412 | { |
| 413 | case Type::FloatTyID: opCode = FSUBS; break; |
| 414 | case Type::DoubleTyID: opCode = FSUBD; break; |
| 415 | default: assert(0 && "Invalid type for SUB instruction"); break; |
| 416 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 417 | |
| 418 | return opCode; |
| 419 | } |
| 420 | |
| 421 | |
| 422 | static inline MachineInstr* |
| 423 | CreateSubConstInstruction(const InstructionNode* instrNode) |
| 424 | { |
| 425 | MachineInstr* minstr = NULL; |
| 426 | |
| 427 | Value* constOp = ((InstrTreeNode*) instrNode->rightChild())->getValue(); |
Chris Lattner | e9bb2df | 2001-12-03 22:26:30 +0000 | [diff] [blame] | 428 | assert(isa<Constant>(constOp)); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 429 | |
| 430 | // Cases worth optimizing are: |
| 431 | // (1) Sub with 0 for float or double: use an FMOV of appropriate type, |
| 432 | // instead of an FSUB (1 vs 3 cycles). There is no integer MOV. |
| 433 | // |
Chris Lattner | 9b62503 | 2002-05-06 16:15:30 +0000 | [diff] [blame] | 434 | if (ConstantFP *FPC = dyn_cast<ConstantFP>(constOp)) { |
| 435 | double dval = FPC->getValue(); |
| 436 | if (dval == 0.0) |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 437 | minstr = CreateMovFloatInstruction(instrNode, |
| 438 | instrNode->getInstruction()->getType()); |
Chris Lattner | 9b62503 | 2002-05-06 16:15:30 +0000 | [diff] [blame] | 439 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 440 | |
| 441 | return minstr; |
| 442 | } |
| 443 | |
| 444 | |
| 445 | static inline MachineOpCode |
| 446 | ChooseFcmpInstruction(const InstructionNode* instrNode) |
| 447 | { |
| 448 | MachineOpCode opCode = INVALID_OPCODE; |
| 449 | |
| 450 | Value* operand = ((InstrTreeNode*) instrNode->leftChild())->getValue(); |
| 451 | switch(operand->getType()->getPrimitiveID()) { |
| 452 | case Type::FloatTyID: opCode = FCMPS; break; |
| 453 | case Type::DoubleTyID: opCode = FCMPD; break; |
| 454 | default: assert(0 && "Invalid type for FCMP instruction"); break; |
| 455 | } |
| 456 | |
| 457 | return opCode; |
| 458 | } |
| 459 | |
| 460 | |
| 461 | // Assumes that leftArg and rightArg are both cast instructions. |
| 462 | // |
| 463 | static inline bool |
| 464 | BothFloatToDouble(const InstructionNode* instrNode) |
| 465 | { |
| 466 | InstrTreeNode* leftArg = instrNode->leftChild(); |
| 467 | InstrTreeNode* rightArg = instrNode->rightChild(); |
| 468 | InstrTreeNode* leftArgArg = leftArg->leftChild(); |
| 469 | InstrTreeNode* rightArgArg = rightArg->leftChild(); |
| 470 | assert(leftArg->getValue()->getType() == rightArg->getValue()->getType()); |
| 471 | |
| 472 | // Check if both arguments are floats cast to double |
| 473 | return (leftArg->getValue()->getType() == Type::DoubleTy && |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 474 | leftArgArg->getValue()->getType() == Type::FloatTy && |
| 475 | rightArgArg->getValue()->getType() == Type::FloatTy); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 476 | } |
| 477 | |
| 478 | |
| 479 | static inline MachineOpCode |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 480 | ChooseMulInstructionByType(const Type* resultType) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 481 | { |
| 482 | MachineOpCode opCode = INVALID_OPCODE; |
| 483 | |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 484 | if (resultType->isInteger()) |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 485 | opCode = MULX; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 486 | else |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 487 | switch(resultType->getPrimitiveID()) |
| 488 | { |
| 489 | case Type::FloatTyID: opCode = FMULS; break; |
| 490 | case Type::DoubleTyID: opCode = FMULD; break; |
| 491 | default: assert(0 && "Invalid type for MUL instruction"); break; |
| 492 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 493 | |
| 494 | return opCode; |
| 495 | } |
| 496 | |
| 497 | |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 498 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 499 | static inline MachineInstr* |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 500 | CreateIntNegInstruction(const TargetMachine& target, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 501 | Value* vreg) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 502 | { |
| 503 | MachineInstr* minstr = new MachineInstr(SUB); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 504 | minstr->SetMachineOperandReg(0, target.getRegInfo().getZeroRegNum()); |
| 505 | minstr->SetMachineOperandVal(1, MachineOperand::MO_VirtualRegister, vreg); |
| 506 | minstr->SetMachineOperandVal(2, MachineOperand::MO_VirtualRegister, vreg); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 507 | return minstr; |
| 508 | } |
| 509 | |
| 510 | |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 511 | // Create instruction sequence for any shift operation. |
| 512 | // SLL or SLLX on an operand smaller than the integer reg. size (64bits) |
| 513 | // requires a second instruction for explicit sign-extension. |
| 514 | // Note that we only have to worry about a sign-bit appearing in the |
| 515 | // most significant bit of the operand after shifting (e.g., bit 32 of |
| 516 | // Int or bit 16 of Short), so we do not have to worry about results |
| 517 | // that are as large as a normal integer register. |
| 518 | // |
| 519 | static inline void |
| 520 | CreateShiftInstructions(const TargetMachine& target, |
| 521 | Function* F, |
| 522 | MachineOpCode shiftOpCode, |
| 523 | Value* argVal1, |
| 524 | Value* optArgVal2, /* Use optArgVal2 if not NULL */ |
| 525 | unsigned int optShiftNum, /* else use optShiftNum */ |
| 526 | Instruction* destVal, |
| 527 | vector<MachineInstr*>& mvec, |
| 528 | MachineCodeForInstruction& mcfi) |
| 529 | { |
| 530 | assert((optArgVal2 != NULL || optShiftNum <= 64) && |
| 531 | "Large shift sizes unexpected, but can be handled below: " |
| 532 | "You need to check whether or not it fits in immed field below"); |
| 533 | |
| 534 | // If this is a logical left shift of a type smaller than the standard |
| 535 | // integer reg. size, we have to extend the sign-bit into upper bits |
| 536 | // of dest, so we need to put the result of the SLL into a temporary. |
| 537 | // |
| 538 | Value* shiftDest = destVal; |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 539 | unsigned opSize = target.DataLayout.getTypeSize(argVal1->getType()); |
| 540 | if ((shiftOpCode == SLL || shiftOpCode == SLLX) |
| 541 | && opSize < target.DataLayout.getIntegerRegize()) |
| 542 | { // put SLL result into a temporary |
| 543 | shiftDest = new TmpInstruction(argVal1, optArgVal2, "sllTmp"); |
| 544 | mcfi.addTemp(shiftDest); |
| 545 | } |
| 546 | |
| 547 | MachineInstr* M = (optArgVal2 != NULL) |
| 548 | ? Create3OperandInstr(shiftOpCode, argVal1, optArgVal2, shiftDest) |
| 549 | : Create3OperandInstr_UImmed(shiftOpCode, argVal1, optShiftNum, shiftDest); |
| 550 | mvec.push_back(M); |
| 551 | |
| 552 | if (shiftDest != destVal) |
| 553 | { // extend the sign-bit of the result into all upper bits of dest |
| 554 | assert(8*opSize <= 32 && "Unexpected type size > 4 and < IntRegSize?"); |
| 555 | target.getInstrInfo(). |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 556 | CreateSignExtensionInstructions(target, F, shiftDest, destVal, |
| 557 | 8*opSize, mvec, mcfi); |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 558 | } |
| 559 | } |
| 560 | |
| 561 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 562 | // Does not create any instructions if we cannot exploit constant to |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 563 | // create a cheaper instruction. |
| 564 | // This returns the approximate cost of the instructions generated, |
| 565 | // which is used to pick the cheapest when both operands are constant. |
| 566 | static inline unsigned int |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 567 | CreateMulConstInstruction(const TargetMachine &target, Function* F, |
| 568 | Value* lval, Value* rval, Instruction* destVal, |
| 569 | vector<MachineInstr*>& mvec, |
| 570 | MachineCodeForInstruction& mcfi) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 571 | { |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 572 | /* Use max. multiply cost, viz., cost of MULX */ |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 573 | unsigned int cost = target.getInstrInfo().minLatency(MULX); |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 574 | unsigned int firstNewInstr = mvec.size(); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 575 | |
| 576 | Value* constOp = rval; |
| 577 | if (! isa<Constant>(constOp)) |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 578 | return cost; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 579 | |
| 580 | // Cases worth optimizing are: |
| 581 | // (1) Multiply by 0 or 1 for any type: replace with copy (ADD or FMOV) |
| 582 | // (2) Multiply by 2^x for integer types: replace with Shift |
| 583 | // |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 584 | const Type* resultType = destVal->getType(); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 585 | |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 586 | if (resultType->isInteger() || isa<PointerType>(resultType)) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 587 | { |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 588 | bool isValidConst; |
| 589 | int64_t C = GetConstantValueAsSignedInt(constOp, isValidConst); |
| 590 | if (isValidConst) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 591 | { |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 592 | unsigned pow; |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 593 | bool needNeg = false; |
| 594 | if (C < 0) |
| 595 | { |
| 596 | needNeg = true; |
| 597 | C = -C; |
| 598 | } |
| 599 | |
| 600 | if (C == 0 || C == 1) |
| 601 | { |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 602 | cost = target.getInstrInfo().minLatency(ADD); |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 603 | MachineInstr* M = (C == 0) |
| 604 | ? Create3OperandInstr_Reg(ADD, |
| 605 | target.getRegInfo().getZeroRegNum(), |
| 606 | target.getRegInfo().getZeroRegNum(), |
| 607 | destVal) |
| 608 | : Create3OperandInstr_Reg(ADD, lval, |
| 609 | target.getRegInfo().getZeroRegNum(), |
| 610 | destVal); |
| 611 | mvec.push_back(M); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 612 | } |
Chris Lattner | 36346c7 | 2002-05-19 21:20:19 +0000 | [diff] [blame] | 613 | else if (isPowerOf2(C, pow)) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 614 | { |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 615 | unsigned int opSize = target.DataLayout.getTypeSize(resultType); |
| 616 | MachineOpCode opCode = (opSize <= 32)? SLL : SLLX; |
| 617 | CreateShiftInstructions(target, F, opCode, lval, NULL, pow, |
| 618 | destVal, mvec, mcfi); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 619 | } |
| 620 | |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 621 | if (mvec.size() > 0 && needNeg) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 622 | { // insert <reg = SUB 0, reg> after the instr to flip the sign |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 623 | MachineInstr* M = CreateIntNegInstruction(target, destVal); |
| 624 | mvec.push_back(M); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 625 | } |
| 626 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 627 | } |
| 628 | else |
| 629 | { |
Chris Lattner | 9b62503 | 2002-05-06 16:15:30 +0000 | [diff] [blame] | 630 | if (ConstantFP *FPC = dyn_cast<ConstantFP>(constOp)) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 631 | { |
Chris Lattner | 9b62503 | 2002-05-06 16:15:30 +0000 | [diff] [blame] | 632 | double dval = FPC->getValue(); |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 633 | if (fabs(dval) == 1) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 634 | { |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 635 | MachineOpCode opCode = (dval < 0) |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 636 | ? (resultType == Type::FloatTy? FNEGS : FNEGD) |
| 637 | : (resultType == Type::FloatTy? FMOVS : FMOVD); |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 638 | MachineInstr* M = Create2OperandInstr(opCode, lval, destVal); |
| 639 | mvec.push_back(M); |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 640 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 641 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 642 | } |
| 643 | |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 644 | if (firstNewInstr < mvec.size()) |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 645 | { |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 646 | cost = 0; |
| 647 | for (unsigned int i=firstNewInstr; i < mvec.size(); ++i) |
| 648 | cost += target.getInstrInfo().minLatency(mvec[i]->getOpCode()); |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 649 | } |
| 650 | |
| 651 | return cost; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 652 | } |
| 653 | |
| 654 | |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 655 | // Does not create any instructions if we cannot exploit constant to |
| 656 | // create a cheaper instruction. |
| 657 | // |
| 658 | static inline void |
| 659 | CreateCheapestMulConstInstruction(const TargetMachine &target, |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 660 | Function* F, |
| 661 | Value* lval, Value* rval, |
| 662 | Instruction* destVal, |
| 663 | vector<MachineInstr*>& mvec, |
| 664 | MachineCodeForInstruction& mcfi) |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 665 | { |
| 666 | Value* constOp; |
| 667 | if (isa<Constant>(lval) && isa<Constant>(rval)) |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 668 | { // both operands are constant: evaluate and "set" in dest |
| 669 | Constant* P = ConstantFoldBinaryInstruction(Instruction::Mul, |
| 670 | cast<Constant>(lval), cast<Constant>(rval)); |
| 671 | target.getInstrInfo().CreateCodeToLoadConst(target,F,P,destVal,mvec,mcfi); |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 672 | } |
| 673 | else if (isa<Constant>(rval)) // rval is constant, but not lval |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 674 | CreateMulConstInstruction(target, F, lval, rval, destVal, mvec, mcfi); |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 675 | else if (isa<Constant>(lval)) // lval is constant, but not rval |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 676 | CreateMulConstInstruction(target, F, lval, rval, destVal, mvec, mcfi); |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 677 | |
| 678 | // else neither is constant |
| 679 | return; |
| 680 | } |
| 681 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 682 | // Return NULL if we cannot exploit constant to create a cheaper instruction |
| 683 | static inline void |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 684 | CreateMulInstruction(const TargetMachine &target, Function* F, |
| 685 | Value* lval, Value* rval, Instruction* destVal, |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 686 | vector<MachineInstr*>& mvec, |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 687 | MachineCodeForInstruction& mcfi, |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 688 | MachineOpCode forceMulOp = INVALID_MACHINE_OPCODE) |
| 689 | { |
| 690 | unsigned int L = mvec.size(); |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 691 | CreateCheapestMulConstInstruction(target,F, lval, rval, destVal, mvec, mcfi); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 692 | if (mvec.size() == L) |
| 693 | { // no instructions were added so create MUL reg, reg, reg. |
| 694 | // Use FSMULD if both operands are actually floats cast to doubles. |
| 695 | // Otherwise, use the default opcode for the appropriate type. |
| 696 | MachineOpCode mulOp = ((forceMulOp != INVALID_MACHINE_OPCODE) |
| 697 | ? forceMulOp |
| 698 | : ChooseMulInstructionByType(destVal->getType())); |
| 699 | MachineInstr* M = new MachineInstr(mulOp); |
| 700 | M->SetMachineOperandVal(0, MachineOperand::MO_VirtualRegister, lval); |
| 701 | M->SetMachineOperandVal(1, MachineOperand::MO_VirtualRegister, rval); |
| 702 | M->SetMachineOperandVal(2, MachineOperand::MO_VirtualRegister, destVal); |
| 703 | mvec.push_back(M); |
| 704 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 705 | } |
| 706 | |
| 707 | |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 708 | // Generate a divide instruction for Div or Rem. |
| 709 | // For Rem, this assumes that the operand type will be signed if the result |
| 710 | // type is signed. This is correct because they must have the same sign. |
| 711 | // |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 712 | static inline MachineOpCode |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 713 | ChooseDivInstruction(TargetMachine &target, |
| 714 | const InstructionNode* instrNode) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 715 | { |
| 716 | MachineOpCode opCode = INVALID_OPCODE; |
| 717 | |
| 718 | const Type* resultType = instrNode->getInstruction()->getType(); |
| 719 | |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 720 | if (resultType->isInteger()) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 721 | opCode = resultType->isSigned()? SDIVX : UDIVX; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 722 | else |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 723 | switch(resultType->getPrimitiveID()) |
| 724 | { |
| 725 | case Type::FloatTyID: opCode = FDIVS; break; |
| 726 | case Type::DoubleTyID: opCode = FDIVD; break; |
| 727 | default: assert(0 && "Invalid type for DIV instruction"); break; |
| 728 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 729 | |
| 730 | return opCode; |
| 731 | } |
| 732 | |
| 733 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 734 | // Return NULL if we cannot exploit constant to create a cheaper instruction |
| 735 | static inline void |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 736 | CreateDivConstInstruction(TargetMachine &target, |
| 737 | const InstructionNode* instrNode, |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 738 | vector<MachineInstr*>& mvec) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 739 | { |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 740 | MachineInstr* minstr1 = NULL; |
| 741 | MachineInstr* minstr2 = NULL; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 742 | |
| 743 | Value* constOp = ((InstrTreeNode*) instrNode->rightChild())->getValue(); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 744 | if (! isa<Constant>(constOp)) |
| 745 | return; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 746 | |
| 747 | // Cases worth optimizing are: |
| 748 | // (1) Divide by 1 for any type: replace with copy (ADD or FMOV) |
| 749 | // (2) Divide by 2^x for integer types: replace with SR[L or A]{X} |
| 750 | // |
| 751 | const Type* resultType = instrNode->getInstruction()->getType(); |
| 752 | |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 753 | if (resultType->isInteger()) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 754 | { |
| 755 | unsigned pow; |
| 756 | bool isValidConst; |
| 757 | int64_t C = GetConstantValueAsSignedInt(constOp, isValidConst); |
| 758 | if (isValidConst) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 759 | { |
| 760 | bool needNeg = false; |
| 761 | if (C < 0) |
| 762 | { |
| 763 | needNeg = true; |
| 764 | C = -C; |
| 765 | } |
| 766 | |
| 767 | if (C == 1) |
| 768 | { |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 769 | minstr1 = new MachineInstr(ADD); |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 770 | minstr1->SetMachineOperandVal(0, |
| 771 | MachineOperand::MO_VirtualRegister, |
| 772 | instrNode->leftChild()->getValue()); |
| 773 | minstr1->SetMachineOperandReg(1, |
| 774 | target.getRegInfo().getZeroRegNum()); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 775 | } |
Chris Lattner | 36346c7 | 2002-05-19 21:20:19 +0000 | [diff] [blame] | 776 | else if (isPowerOf2(C, pow)) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 777 | { |
| 778 | MachineOpCode opCode= ((resultType->isSigned()) |
| 779 | ? (resultType==Type::LongTy)? SRAX : SRA |
| 780 | : (resultType==Type::LongTy)? SRLX : SRL); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 781 | minstr1 = new MachineInstr(opCode); |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 782 | minstr1->SetMachineOperandVal(0, |
| 783 | MachineOperand::MO_VirtualRegister, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 784 | instrNode->leftChild()->getValue()); |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 785 | minstr1->SetMachineOperandConst(1, |
| 786 | MachineOperand::MO_UnextendedImmed, |
| 787 | pow); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 788 | } |
| 789 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 790 | if (minstr1 && needNeg) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 791 | { // insert <reg = SUB 0, reg> after the instr to flip the sign |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 792 | minstr2 = CreateIntNegInstruction(target, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 793 | instrNode->getValue()); |
| 794 | } |
| 795 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 796 | } |
| 797 | else |
| 798 | { |
Chris Lattner | 9b62503 | 2002-05-06 16:15:30 +0000 | [diff] [blame] | 799 | if (ConstantFP *FPC = dyn_cast<ConstantFP>(constOp)) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 800 | { |
Chris Lattner | 9b62503 | 2002-05-06 16:15:30 +0000 | [diff] [blame] | 801 | double dval = FPC->getValue(); |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 802 | if (fabs(dval) == 1) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 803 | { |
| 804 | bool needNeg = (dval < 0); |
| 805 | |
| 806 | MachineOpCode opCode = needNeg |
| 807 | ? (resultType == Type::FloatTy? FNEGS : FNEGD) |
| 808 | : (resultType == Type::FloatTy? FMOVS : FMOVD); |
| 809 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 810 | minstr1 = new MachineInstr(opCode); |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 811 | minstr1->SetMachineOperandVal(0, |
| 812 | MachineOperand::MO_VirtualRegister, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 813 | instrNode->leftChild()->getValue()); |
| 814 | } |
| 815 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 816 | } |
| 817 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 818 | if (minstr1 != NULL) |
| 819 | minstr1->SetMachineOperandVal(2, MachineOperand::MO_VirtualRegister, |
| 820 | instrNode->getValue()); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 821 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 822 | if (minstr1) |
| 823 | mvec.push_back(minstr1); |
| 824 | if (minstr2) |
| 825 | mvec.push_back(minstr2); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 826 | } |
| 827 | |
| 828 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 829 | static void |
| 830 | CreateCodeForVariableSizeAlloca(const TargetMachine& target, |
| 831 | Instruction* result, |
| 832 | unsigned int tsize, |
| 833 | Value* numElementsVal, |
| 834 | vector<MachineInstr*>& getMvec) |
| 835 | { |
| 836 | MachineInstr* M; |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 837 | MachineCodeForInstruction& mcfi = MachineCodeForInstruction::get(result); |
| 838 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 839 | // Create a Value to hold the (constant) element size |
| 840 | Value* tsizeVal = ConstantSInt::get(Type::IntTy, tsize); |
| 841 | |
| 842 | // Get the constant offset from SP for dynamically allocated storage |
| 843 | // and create a temporary Value to hold it. |
Chris Lattner | 2fbfdcf | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 844 | assert(result && result->getParent() && "Result value is not part of a fn?"); |
| 845 | Function *F = result->getParent()->getParent(); |
Misha Brukman | fce1143 | 2002-10-28 00:28:31 +0000 | [diff] [blame] | 846 | MachineFunction& mcInfo = MachineFunction::get(F); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 847 | bool growUp; |
| 848 | ConstantSInt* dynamicAreaOffset = |
| 849 | ConstantSInt::get(Type::IntTy, |
| 850 | target.getFrameInfo().getDynamicAreaOffset(mcInfo,growUp)); |
| 851 | assert(! growUp && "Has SPARC v9 stack frame convention changed?"); |
| 852 | |
| 853 | // Create a temporary value to hold the result of MUL |
| 854 | TmpInstruction* tmpProd = new TmpInstruction(numElementsVal, tsizeVal); |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 855 | mcfi.addTemp(tmpProd); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 856 | |
| 857 | // Instruction 1: mul numElements, typeSize -> tmpProd |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 858 | CreateMulInstruction(target, F, numElementsVal, tsizeVal, tmpProd, getMvec, |
| 859 | mcfi, INVALID_MACHINE_OPCODE); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 860 | |
| 861 | // Instruction 2: sub %sp, tmpProd -> %sp |
| 862 | M = new MachineInstr(SUB); |
| 863 | M->SetMachineOperandReg(0, target.getRegInfo().getStackPointer()); |
| 864 | M->SetMachineOperandVal(1, MachineOperand::MO_VirtualRegister, tmpProd); |
| 865 | M->SetMachineOperandReg(2, target.getRegInfo().getStackPointer()); |
| 866 | getMvec.push_back(M); |
| 867 | |
| 868 | // Instruction 3: add %sp, frameSizeBelowDynamicArea -> result |
| 869 | M = new MachineInstr(ADD); |
| 870 | M->SetMachineOperandReg(0, target.getRegInfo().getStackPointer()); |
| 871 | M->SetMachineOperandVal(1, MachineOperand::MO_VirtualRegister, dynamicAreaOffset); |
| 872 | M->SetMachineOperandVal(2, MachineOperand::MO_VirtualRegister, result); |
| 873 | getMvec.push_back(M); |
| 874 | } |
| 875 | |
| 876 | |
| 877 | static void |
| 878 | CreateCodeForFixedSizeAlloca(const TargetMachine& target, |
| 879 | Instruction* result, |
| 880 | unsigned int tsize, |
| 881 | unsigned int numElements, |
| 882 | vector<MachineInstr*>& getMvec) |
| 883 | { |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 884 | assert(tsize > 0 && "Illegal (zero) type size for alloca"); |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 885 | assert(result && result->getParent() && |
Chris Lattner | 2fbfdcf | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 886 | "Result value is not part of a function?"); |
| 887 | Function *F = result->getParent()->getParent(); |
Misha Brukman | fce1143 | 2002-10-28 00:28:31 +0000 | [diff] [blame] | 888 | MachineFunction &mcInfo = MachineFunction::get(F); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 889 | |
Chris Lattner | 2fbfdcf | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 890 | // Check if the offset would small enough to use as an immediate in |
| 891 | // load/stores (check LDX because all load/stores have the same-size immediate |
| 892 | // field). If not, put the variable in the dynamically sized area of the |
| 893 | // frame. |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 894 | unsigned int paddedSizeIgnored; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 895 | int offsetFromFP = mcInfo.computeOffsetforLocalVar(target, result, |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 896 | paddedSizeIgnored, |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 897 | tsize * numElements); |
| 898 | if (! target.getInstrInfo().constantFitsInImmedField(LDX, offsetFromFP)) |
| 899 | { |
| 900 | CreateCodeForVariableSizeAlloca(target, result, tsize, |
| 901 | ConstantSInt::get(Type::IntTy,numElements), |
| 902 | getMvec); |
| 903 | return; |
| 904 | } |
| 905 | |
| 906 | // else offset fits in immediate field so go ahead and allocate it. |
| 907 | offsetFromFP = mcInfo.allocateLocalVar(target, result, tsize * numElements); |
| 908 | |
| 909 | // Create a temporary Value to hold the constant offset. |
| 910 | // This is needed because it may not fit in the immediate field. |
| 911 | ConstantSInt* offsetVal = ConstantSInt::get(Type::IntTy, offsetFromFP); |
| 912 | |
| 913 | // Instruction 1: add %fp, offsetFromFP -> result |
| 914 | MachineInstr* M = new MachineInstr(ADD); |
| 915 | M->SetMachineOperandReg(0, target.getRegInfo().getFramePointer()); |
| 916 | M->SetMachineOperandVal(1, MachineOperand::MO_VirtualRegister, offsetVal); |
| 917 | M->SetMachineOperandVal(2, MachineOperand::MO_VirtualRegister, result); |
| 918 | |
| 919 | getMvec.push_back(M); |
| 920 | } |
| 921 | |
| 922 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 923 | //------------------------------------------------------------------------ |
| 924 | // Function SetOperandsForMemInstr |
| 925 | // |
| 926 | // Choose addressing mode for the given load or store instruction. |
| 927 | // Use [reg+reg] if it is an indexed reference, and the index offset is |
| 928 | // not a constant or if it cannot fit in the offset field. |
| 929 | // Use [reg+offset] in all other cases. |
| 930 | // |
| 931 | // This assumes that all array refs are "lowered" to one of these forms: |
| 932 | // %x = load (subarray*) ptr, constant ; single constant offset |
| 933 | // %x = load (subarray*) ptr, offsetVal ; single non-constant offset |
| 934 | // Generally, this should happen via strength reduction + LICM. |
| 935 | // Also, strength reduction should take care of using the same register for |
| 936 | // the loop index variable and an array index, when that is profitable. |
| 937 | //------------------------------------------------------------------------ |
| 938 | |
| 939 | static void |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 940 | SetOperandsForMemInstr(vector<MachineInstr*>& mvec, |
Vikram S. Adve | efc9433 | 2002-10-14 16:32:24 +0000 | [diff] [blame] | 941 | InstructionNode* vmInstrNode, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 942 | const TargetMachine& target) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 943 | { |
Vikram S. Adve | 8cfffd3 | 2002-08-24 20:56:53 +0000 | [diff] [blame] | 944 | Instruction* memInst = vmInstrNode->getInstruction(); |
| 945 | vector<MachineInstr*>::iterator mvecI = mvec.end() - 1; |
| 946 | |
| 947 | // Index vector, ptr value, and flag if all indices are const. |
Vikram S. Adve | a10d1a7 | 2002-03-31 19:07:35 +0000 | [diff] [blame] | 948 | vector<Value*> idxVec; |
Vikram S. Adve | 8cfffd3 | 2002-08-24 20:56:53 +0000 | [diff] [blame] | 949 | bool allConstantIndices; |
| 950 | Value* ptrVal = GetMemInstArgs(vmInstrNode, idxVec, allConstantIndices); |
Vikram S. Adve | ed3fefb | 2002-08-03 13:48:21 +0000 | [diff] [blame] | 951 | |
Vikram S. Adve | 8cfffd3 | 2002-08-24 20:56:53 +0000 | [diff] [blame] | 952 | // Now create the appropriate operands for the machine instruction. |
| 953 | // First, initialize so we default to storing the offset in a register. |
Chris Lattner | 8e5c0b4 | 2001-11-07 14:01:59 +0000 | [diff] [blame] | 954 | int64_t smallConstOffset = 0; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 955 | Value* valueForRegOffset = NULL; |
Vikram S. Adve | ed3fefb | 2002-08-03 13:48:21 +0000 | [diff] [blame] | 956 | MachineOperand::MachineOperandType offsetOpType = |
| 957 | MachineOperand::MO_VirtualRegister; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 958 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 959 | // Check if there is an index vector and if so, compute the |
| 960 | // right offset for structures and for arrays |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 961 | // |
Chris Lattner | 3bb8ad2 | 2002-08-22 23:37:24 +0000 | [diff] [blame] | 962 | if (!idxVec.empty()) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 963 | { |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 964 | const PointerType* ptrType = cast<PointerType>(ptrVal->getType()); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 965 | |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 966 | // If all indices are constant, compute the combined offset directly. |
| 967 | if (allConstantIndices) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 968 | { |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 969 | // Compute the offset value using the index vector. Create a |
| 970 | // virtual reg. for it since it may not fit in the immed field. |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 971 | uint64_t offset = target.DataLayout.getIndexedOffset(ptrType,idxVec); |
| 972 | valueForRegOffset = ConstantSInt::get(Type::LongTy, offset); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 973 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 974 | else |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 975 | { |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 976 | // There is at least one non-constant offset. Therefore, this must |
Vikram S. Adve | ed3fefb | 2002-08-03 13:48:21 +0000 | [diff] [blame] | 977 | // be an array ref, and must have been lowered to a single non-zero |
| 978 | // offset. (An extra leading zero offset, if any, can be ignored.) |
| 979 | // Generate code sequence to compute address from index. |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 980 | // |
Chris Lattner | 0374b8d | 2002-09-11 01:21:35 +0000 | [diff] [blame] | 981 | bool firstIdxIsZero = |
| 982 | (idxVec[0] == Constant::getNullValue(idxVec[0]->getType())); |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 983 | assert(idxVec.size() == 1U + firstIdxIsZero |
Vikram S. Adve | ed3fefb | 2002-08-03 13:48:21 +0000 | [diff] [blame] | 984 | && "Array refs must be lowered before Instruction Selection"); |
| 985 | |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 986 | Value* idxVal = idxVec[firstIdxIsZero]; |
Vikram S. Adve | ed3fefb | 2002-08-03 13:48:21 +0000 | [diff] [blame] | 987 | |
| 988 | vector<MachineInstr*> mulVec; |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 989 | Instruction* addr = new TmpInstruction(Type::ULongTy, memInst); |
Vikram S. Adve | ed3fefb | 2002-08-03 13:48:21 +0000 | [diff] [blame] | 990 | MachineCodeForInstruction::get(memInst).addTemp(addr); |
| 991 | |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 992 | // Get the array type indexed by idxVal, and compute its element size. |
Vikram S. Adve | ed3fefb | 2002-08-03 13:48:21 +0000 | [diff] [blame] | 993 | // The call to getTypeSize() will fail if size is not constant. |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 994 | const Type* vecType = (firstIdxIsZero |
| 995 | ? GetElementPtrInst::getIndexedType(ptrType, |
| 996 | std::vector<Value*>(1U, idxVec[0]), |
| 997 | /*AllowCompositeLeaf*/ true) |
| 998 | : ptrType); |
| 999 | const Type* eltType = cast<SequentialType>(vecType)->getElementType(); |
Vikram S. Adve | e102a64 | 2002-09-16 15:56:45 +0000 | [diff] [blame] | 1000 | ConstantUInt* eltSizeVal = ConstantUInt::get(Type::ULongTy, |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 1001 | target.DataLayout.getTypeSize(eltType)); |
Vikram S. Adve | ed3fefb | 2002-08-03 13:48:21 +0000 | [diff] [blame] | 1002 | |
| 1003 | // CreateMulInstruction() folds constants intelligently enough. |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 1004 | CreateMulInstruction(target, memInst->getParent()->getParent(), |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 1005 | idxVal, /* lval, not likely to be const*/ |
| 1006 | eltSizeVal, /* rval, likely to be constant */ |
| 1007 | addr, /* result */ |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 1008 | mulVec, MachineCodeForInstruction::get(memInst), |
Vikram S. Adve | ed3fefb | 2002-08-03 13:48:21 +0000 | [diff] [blame] | 1009 | INVALID_MACHINE_OPCODE); |
| 1010 | |
| 1011 | // Insert mulVec[] before *mvecI in mvec[] and update mvecI |
| 1012 | // to point to the same instruction it pointed to before. |
| 1013 | assert(mulVec.size() > 0 && "No multiply code created?"); |
| 1014 | vector<MachineInstr*>::iterator oldMvecI = mvecI; |
| 1015 | for (unsigned i=0, N=mulVec.size(); i < N; ++i) |
| 1016 | mvecI = mvec.insert(mvecI, mulVec[i]) + 1; // pts to mem instr |
| 1017 | |
| 1018 | valueForRegOffset = addr; |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1019 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1020 | } |
| 1021 | else |
| 1022 | { |
| 1023 | offsetOpType = MachineOperand::MO_SignExtendedImmed; |
| 1024 | smallConstOffset = 0; |
| 1025 | } |
Vikram S. Adve | ed3fefb | 2002-08-03 13:48:21 +0000 | [diff] [blame] | 1026 | |
Vikram S. Adve | a10d1a7 | 2002-03-31 19:07:35 +0000 | [diff] [blame] | 1027 | // For STORE: |
| 1028 | // Operand 0 is value, operand 1 is ptr, operand 2 is offset |
| 1029 | // For LOAD or GET_ELEMENT_PTR, |
| 1030 | // Operand 0 is ptr, operand 1 is offset, operand 2 is result. |
| 1031 | // |
| 1032 | unsigned offsetOpNum, ptrOpNum; |
| 1033 | if (memInst->getOpcode() == Instruction::Store) |
| 1034 | { |
| 1035 | (*mvecI)->SetMachineOperandVal(0, MachineOperand::MO_VirtualRegister, |
| 1036 | vmInstrNode->leftChild()->getValue()); |
| 1037 | ptrOpNum = 1; |
| 1038 | offsetOpNum = 2; |
| 1039 | } |
| 1040 | else |
| 1041 | { |
| 1042 | ptrOpNum = 0; |
| 1043 | offsetOpNum = 1; |
| 1044 | (*mvecI)->SetMachineOperandVal(2, MachineOperand::MO_VirtualRegister, |
| 1045 | memInst); |
| 1046 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1047 | |
Vikram S. Adve | a10d1a7 | 2002-03-31 19:07:35 +0000 | [diff] [blame] | 1048 | (*mvecI)->SetMachineOperandVal(ptrOpNum, MachineOperand::MO_VirtualRegister, |
| 1049 | ptrVal); |
| 1050 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1051 | if (offsetOpType == MachineOperand::MO_VirtualRegister) |
| 1052 | { |
| 1053 | assert(valueForRegOffset != NULL); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1054 | (*mvecI)->SetMachineOperandVal(offsetOpNum, offsetOpType, |
| 1055 | valueForRegOffset); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1056 | } |
| 1057 | else |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1058 | (*mvecI)->SetMachineOperandConst(offsetOpNum, offsetOpType, |
| 1059 | smallConstOffset); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1060 | } |
| 1061 | |
| 1062 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1063 | // |
| 1064 | // Substitute operand `operandNum' of the instruction in node `treeNode' |
Vikram S. Adve | c025fc1 | 2001-10-14 23:28:43 +0000 | [diff] [blame] | 1065 | // in place of the use(s) of that instruction in node `parent'. |
| 1066 | // Check both explicit and implicit operands! |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1067 | // Also make sure to skip over a parent who: |
| 1068 | // (1) is a list node in the Burg tree, or |
| 1069 | // (2) itself had its results forwarded to its parent |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1070 | // |
| 1071 | static void |
| 1072 | ForwardOperand(InstructionNode* treeNode, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1073 | InstrTreeNode* parent, |
| 1074 | int operandNum) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1075 | { |
Vikram S. Adve | 243dd45 | 2001-09-18 13:03:13 +0000 | [diff] [blame] | 1076 | assert(treeNode && parent && "Invalid invocation of ForwardOperand"); |
| 1077 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1078 | Instruction* unusedOp = treeNode->getInstruction(); |
| 1079 | Value* fwdOp = unusedOp->getOperand(operandNum); |
Vikram S. Adve | 243dd45 | 2001-09-18 13:03:13 +0000 | [diff] [blame] | 1080 | |
| 1081 | // The parent itself may be a list node, so find the real parent instruction |
| 1082 | while (parent->getNodeType() != InstrTreeNode::NTInstructionNode) |
| 1083 | { |
| 1084 | parent = parent->parent(); |
| 1085 | assert(parent && "ERROR: Non-instruction node has no parent in tree."); |
| 1086 | } |
| 1087 | InstructionNode* parentInstrNode = (InstructionNode*) parent; |
| 1088 | |
| 1089 | Instruction* userInstr = parentInstrNode->getInstruction(); |
Chris Lattner | 9c46108 | 2002-02-03 07:50:56 +0000 | [diff] [blame] | 1090 | MachineCodeForInstruction &mvec = MachineCodeForInstruction::get(userInstr); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1091 | |
| 1092 | // The parent's mvec would be empty if it was itself forwarded. |
| 1093 | // Recursively call ForwardOperand in that case... |
| 1094 | // |
| 1095 | if (mvec.size() == 0) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1096 | { |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1097 | assert(parent->parent() != NULL && |
| 1098 | "Parent could not have been forwarded, yet has no instructions?"); |
| 1099 | ForwardOperand(treeNode, parent->parent(), operandNum); |
| 1100 | } |
| 1101 | else |
| 1102 | { |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1103 | for (unsigned i=0, N=mvec.size(); i < N; i++) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1104 | { |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1105 | MachineInstr* minstr = mvec[i]; |
| 1106 | for (unsigned i=0, numOps=minstr->getNumOperands(); i < numOps; ++i) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1107 | { |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1108 | const MachineOperand& mop = minstr->getOperand(i); |
Chris Lattner | 133f079 | 2002-10-28 04:45:29 +0000 | [diff] [blame^] | 1109 | if (mop.getType() == MachineOperand::MO_VirtualRegister && |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1110 | mop.getVRegValue() == unusedOp) |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1111 | minstr->SetMachineOperandVal(i, |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1112 | MachineOperand::MO_VirtualRegister, fwdOp); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1113 | } |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1114 | |
| 1115 | for (unsigned i=0,numOps=minstr->getNumImplicitRefs(); i<numOps; ++i) |
| 1116 | if (minstr->getImplicitRef(i) == unusedOp) |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1117 | minstr->setImplicitRef(i, fwdOp, |
Vikram S. Adve | 6418eac | 2002-07-08 23:30:14 +0000 | [diff] [blame] | 1118 | minstr->implicitRefIsDefined(i), |
| 1119 | minstr->implicitRefIsDefinedAndUsed(i)); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1120 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1121 | } |
| 1122 | } |
| 1123 | |
| 1124 | |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1125 | inline bool |
| 1126 | AllUsesAreBranches(const Instruction* setccI) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1127 | { |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1128 | for (Value::use_const_iterator UI=setccI->use_begin(), UE=setccI->use_end(); |
| 1129 | UI != UE; ++UI) |
| 1130 | if (! isa<TmpInstruction>(*UI) // ignore tmp instructions here |
| 1131 | && cast<Instruction>(*UI)->getOpcode() != Instruction::Br) |
| 1132 | return false; |
| 1133 | return true; |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1134 | } |
| 1135 | |
Vikram S. Adve | fb36112 | 2001-10-22 13:36:31 +0000 | [diff] [blame] | 1136 | //******************* Externally Visible Functions *************************/ |
| 1137 | |
Vikram S. Adve | fb36112 | 2001-10-22 13:36:31 +0000 | [diff] [blame] | 1138 | //------------------------------------------------------------------------ |
| 1139 | // External Function: ThisIsAChainRule |
| 1140 | // |
| 1141 | // Purpose: |
| 1142 | // Check if a given BURG rule is a chain rule. |
| 1143 | //------------------------------------------------------------------------ |
| 1144 | |
| 1145 | extern bool |
| 1146 | ThisIsAChainRule(int eruleno) |
| 1147 | { |
| 1148 | switch(eruleno) |
| 1149 | { |
| 1150 | case 111: // stmt: reg |
Vikram S. Adve | fb36112 | 2001-10-22 13:36:31 +0000 | [diff] [blame] | 1151 | case 123: |
| 1152 | case 124: |
| 1153 | case 125: |
| 1154 | case 126: |
| 1155 | case 127: |
| 1156 | case 128: |
| 1157 | case 129: |
| 1158 | case 130: |
| 1159 | case 131: |
| 1160 | case 132: |
| 1161 | case 133: |
| 1162 | case 155: |
| 1163 | case 221: |
| 1164 | case 222: |
| 1165 | case 241: |
| 1166 | case 242: |
| 1167 | case 243: |
| 1168 | case 244: |
Vikram S. Adve | 30a6f49 | 2002-08-22 02:56:10 +0000 | [diff] [blame] | 1169 | case 245: |
Vikram S. Adve | 85e1e9c | 2002-04-01 20:28:48 +0000 | [diff] [blame] | 1170 | case 321: |
Vikram S. Adve | fb36112 | 2001-10-22 13:36:31 +0000 | [diff] [blame] | 1171 | return true; break; |
Vikram S. Adve | 30a6f49 | 2002-08-22 02:56:10 +0000 | [diff] [blame] | 1172 | |
Vikram S. Adve | fb36112 | 2001-10-22 13:36:31 +0000 | [diff] [blame] | 1173 | default: |
| 1174 | return false; break; |
| 1175 | } |
| 1176 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1177 | |
| 1178 | |
| 1179 | //------------------------------------------------------------------------ |
| 1180 | // External Function: GetInstructionsByRule |
| 1181 | // |
| 1182 | // Purpose: |
| 1183 | // Choose machine instructions for the SPARC according to the |
| 1184 | // patterns chosen by the BURG-generated parser. |
| 1185 | //------------------------------------------------------------------------ |
| 1186 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1187 | void |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1188 | GetInstructionsByRule(InstructionNode* subtreeRoot, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1189 | int ruleForNode, |
| 1190 | short* nts, |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1191 | TargetMachine &target, |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1192 | vector<MachineInstr*>& mvec) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1193 | { |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1194 | bool checkCast = false; // initialize here to use fall-through |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 1195 | bool maskUnsignedResult = false; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1196 | int nextRule; |
| 1197 | int forwardOperandNum = -1; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1198 | unsigned int allocaSize = 0; |
| 1199 | MachineInstr* M, *M2; |
| 1200 | unsigned int L; |
| 1201 | |
| 1202 | mvec.clear(); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1203 | |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1204 | // If the code for this instruction was folded into the parent (user), |
| 1205 | // then do nothing! |
| 1206 | if (subtreeRoot->isFoldedIntoParent()) |
| 1207 | return; |
| 1208 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1209 | // |
| 1210 | // Let's check for chain rules outside the switch so that we don't have |
| 1211 | // to duplicate the list of chain rule production numbers here again |
| 1212 | // |
| 1213 | if (ThisIsAChainRule(ruleForNode)) |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1214 | { |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1215 | // Chain rules have a single nonterminal on the RHS. |
| 1216 | // Get the rule that matches the RHS non-terminal and use that instead. |
| 1217 | // |
| 1218 | assert(nts[0] && ! nts[1] |
| 1219 | && "A chain rule should have only one RHS non-terminal!"); |
| 1220 | nextRule = burm_rule(subtreeRoot->state, nts[0]); |
| 1221 | nts = burm_nts[nextRule]; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1222 | GetInstructionsByRule(subtreeRoot, nextRule, nts, target, mvec); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1223 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1224 | else |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1225 | { |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1226 | switch(ruleForNode) { |
| 1227 | case 1: // stmt: Ret |
| 1228 | case 2: // stmt: RetValue(reg) |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1229 | { // NOTE: Prepass of register allocation is responsible |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1230 | // for moving return value to appropriate register. |
| 1231 | // Mark the return-address register as a hidden virtual reg. |
Vikram S. Adve | a995e60 | 2001-10-11 04:23:19 +0000 | [diff] [blame] | 1232 | // Mark the return value register as an implicit ref of |
| 1233 | // the machine instruction. |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1234 | // Finally put a NOP in the delay slot. |
Chris Lattner | e9bb2df | 2001-12-03 22:26:30 +0000 | [diff] [blame] | 1235 | ReturnInst *returnInstr = |
| 1236 | cast<ReturnInst>(subtreeRoot->getInstruction()); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1237 | assert(returnInstr->getOpcode() == Instruction::Ret); |
| 1238 | |
Chris Lattner | 9c46108 | 2002-02-03 07:50:56 +0000 | [diff] [blame] | 1239 | Instruction* returnReg = new TmpInstruction(returnInstr); |
| 1240 | MachineCodeForInstruction::get(returnInstr).addTemp(returnReg); |
Vikram S. Adve | fb36112 | 2001-10-22 13:36:31 +0000 | [diff] [blame] | 1241 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1242 | M = new MachineInstr(JMPLRET); |
| 1243 | M->SetMachineOperandReg(0, MachineOperand::MO_VirtualRegister, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1244 | returnReg); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1245 | M->SetMachineOperandConst(1,MachineOperand::MO_SignExtendedImmed, |
Chris Lattner | 697954c | 2002-01-20 22:54:45 +0000 | [diff] [blame] | 1246 | (int64_t)8); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1247 | M->SetMachineOperandReg(2, target.getRegInfo().getZeroRegNum()); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1248 | |
Vikram S. Adve | a995e60 | 2001-10-11 04:23:19 +0000 | [diff] [blame] | 1249 | if (returnInstr->getReturnValue() != NULL) |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1250 | M->addImplicitRef(returnInstr->getReturnValue()); |
Vikram S. Adve | a995e60 | 2001-10-11 04:23:19 +0000 | [diff] [blame] | 1251 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1252 | mvec.push_back(M); |
| 1253 | mvec.push_back(new MachineInstr(NOP)); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1254 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1255 | break; |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1256 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1257 | |
| 1258 | case 3: // stmt: Store(reg,reg) |
| 1259 | case 4: // stmt: Store(reg,ptrreg) |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1260 | mvec.push_back(new MachineInstr( |
| 1261 | ChooseStoreInstruction( |
| 1262 | subtreeRoot->leftChild()->getValue()->getType()))); |
Vikram S. Adve | 8cfffd3 | 2002-08-24 20:56:53 +0000 | [diff] [blame] | 1263 | SetOperandsForMemInstr(mvec, subtreeRoot, target); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1264 | break; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1265 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1266 | case 5: // stmt: BrUncond |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1267 | M = new MachineInstr(BA); |
Vikram S. Adve | 6418eac | 2002-07-08 23:30:14 +0000 | [diff] [blame] | 1268 | M->SetMachineOperandVal(0, MachineOperand::MO_PCRelativeDisp, |
Chris Lattner | e9bb2df | 2001-12-03 22:26:30 +0000 | [diff] [blame] | 1269 | cast<BranchInst>(subtreeRoot->getInstruction())->getSuccessor(0)); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1270 | mvec.push_back(M); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1271 | |
| 1272 | // delay slot |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1273 | mvec.push_back(new MachineInstr(NOP)); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1274 | break; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1275 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1276 | case 206: // stmt: BrCond(setCCconst) |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1277 | { // setCCconst => boolean was computed with `%b = setCC type reg1 const' |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1278 | // If the constant is ZERO, we can use the branch-on-integer-register |
| 1279 | // instructions and avoid the SUBcc instruction entirely. |
| 1280 | // Otherwise this is just the same as case 5, so just fall through. |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1281 | // |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1282 | InstrTreeNode* constNode = subtreeRoot->leftChild()->rightChild(); |
| 1283 | assert(constNode && |
| 1284 | constNode->getNodeType() ==InstrTreeNode::NTConstNode); |
Chris Lattner | e9bb2df | 2001-12-03 22:26:30 +0000 | [diff] [blame] | 1285 | Constant *constVal = cast<Constant>(constNode->getValue()); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1286 | bool isValidConst; |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1287 | |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 1288 | if ((constVal->getType()->isInteger() |
Chris Lattner | 9b62503 | 2002-05-06 16:15:30 +0000 | [diff] [blame] | 1289 | || isa<PointerType>(constVal->getType())) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1290 | && GetConstantValueAsSignedInt(constVal, isValidConst) == 0 |
| 1291 | && isValidConst) |
| 1292 | { |
| 1293 | // That constant is a zero after all... |
| 1294 | // Use the left child of setCC as the first argument! |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1295 | // Mark the setCC node so that no code is generated for it. |
| 1296 | InstructionNode* setCCNode = (InstructionNode*) |
| 1297 | subtreeRoot->leftChild(); |
| 1298 | assert(setCCNode->getOpLabel() == SetCCOp); |
| 1299 | setCCNode->markFoldedIntoParent(); |
| 1300 | |
| 1301 | BranchInst* brInst=cast<BranchInst>(subtreeRoot->getInstruction()); |
| 1302 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1303 | M = new MachineInstr(ChooseBprInstruction(subtreeRoot)); |
| 1304 | M->SetMachineOperandVal(0, MachineOperand::MO_VirtualRegister, |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1305 | setCCNode->leftChild()->getValue()); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1306 | M->SetMachineOperandVal(1, MachineOperand::MO_PCRelativeDisp, |
| 1307 | brInst->getSuccessor(0)); |
| 1308 | mvec.push_back(M); |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1309 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1310 | // delay slot |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1311 | mvec.push_back(new MachineInstr(NOP)); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1312 | |
| 1313 | // false branch |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1314 | M = new MachineInstr(BA); |
Vikram S. Adve | 6418eac | 2002-07-08 23:30:14 +0000 | [diff] [blame] | 1315 | M->SetMachineOperandVal(0, MachineOperand::MO_PCRelativeDisp, |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1316 | brInst->getSuccessor(1)); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1317 | mvec.push_back(M); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1318 | |
| 1319 | // delay slot |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1320 | mvec.push_back(new MachineInstr(NOP)); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1321 | |
| 1322 | break; |
| 1323 | } |
| 1324 | // ELSE FALL THROUGH |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1325 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1326 | |
Vikram S. Adve | 30a6f49 | 2002-08-22 02:56:10 +0000 | [diff] [blame] | 1327 | case 6: // stmt: BrCond(setCC) |
| 1328 | { // bool => boolean was computed with SetCC. |
| 1329 | // The branch to use depends on whether it is FP, signed, or unsigned. |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1330 | // If it is an integer CC, we also need to find the unique |
| 1331 | // TmpInstruction representing that CC. |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1332 | // |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1333 | BranchInst* brInst = cast<BranchInst>(subtreeRoot->getInstruction()); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1334 | bool isFPBranch; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1335 | M = new MachineInstr(ChooseBccInstruction(subtreeRoot, isFPBranch)); |
Vikram S. Adve | 30a6f49 | 2002-08-22 02:56:10 +0000 | [diff] [blame] | 1336 | |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1337 | Value* ccValue = GetTmpForCC(subtreeRoot->leftChild()->getValue(), |
| 1338 | brInst->getParent()->getParent(), |
| 1339 | isFPBranch? Type::FloatTy : Type::IntTy); |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1340 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1341 | M->SetMachineOperandVal(0, MachineOperand::MO_CCRegister, ccValue); |
| 1342 | M->SetMachineOperandVal(1, MachineOperand::MO_PCRelativeDisp, |
| 1343 | brInst->getSuccessor(0)); |
| 1344 | mvec.push_back(M); |
Vikram S. Adve | 30a6f49 | 2002-08-22 02:56:10 +0000 | [diff] [blame] | 1345 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1346 | // delay slot |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1347 | mvec.push_back(new MachineInstr(NOP)); |
Vikram S. Adve | 30a6f49 | 2002-08-22 02:56:10 +0000 | [diff] [blame] | 1348 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1349 | // false branch |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1350 | M = new MachineInstr(BA); |
Vikram S. Adve | 6418eac | 2002-07-08 23:30:14 +0000 | [diff] [blame] | 1351 | M->SetMachineOperandVal(0, MachineOperand::MO_PCRelativeDisp, |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1352 | brInst->getSuccessor(1)); |
| 1353 | mvec.push_back(M); |
Vikram S. Adve | 30a6f49 | 2002-08-22 02:56:10 +0000 | [diff] [blame] | 1354 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1355 | // delay slot |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1356 | mvec.push_back(new MachineInstr(NOP)); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1357 | break; |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1358 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1359 | |
| 1360 | case 208: // stmt: BrCond(boolconst) |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1361 | { |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1362 | // boolconst => boolean is a constant; use BA to first or second label |
Chris Lattner | e9bb2df | 2001-12-03 22:26:30 +0000 | [diff] [blame] | 1363 | Constant* constVal = |
| 1364 | cast<Constant>(subtreeRoot->leftChild()->getValue()); |
| 1365 | unsigned dest = cast<ConstantBool>(constVal)->getValue()? 0 : 1; |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1366 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1367 | M = new MachineInstr(BA); |
Vikram S. Adve | 6418eac | 2002-07-08 23:30:14 +0000 | [diff] [blame] | 1368 | M->SetMachineOperandVal(0, MachineOperand::MO_PCRelativeDisp, |
Chris Lattner | 3550420 | 2002-04-27 03:14:39 +0000 | [diff] [blame] | 1369 | cast<BranchInst>(subtreeRoot->getInstruction())->getSuccessor(dest)); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1370 | mvec.push_back(M); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1371 | |
| 1372 | // delay slot |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1373 | mvec.push_back(new MachineInstr(NOP)); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1374 | break; |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1375 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1376 | |
| 1377 | case 8: // stmt: BrCond(boolreg) |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1378 | { // boolreg => boolean is stored in an existing register. |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1379 | // Just use the branch-on-integer-register instruction! |
| 1380 | // |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1381 | M = new MachineInstr(BRNZ); |
| 1382 | M->SetMachineOperandVal(0, MachineOperand::MO_VirtualRegister, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1383 | subtreeRoot->leftChild()->getValue()); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1384 | M->SetMachineOperandVal(1, MachineOperand::MO_PCRelativeDisp, |
Chris Lattner | 3550420 | 2002-04-27 03:14:39 +0000 | [diff] [blame] | 1385 | cast<BranchInst>(subtreeRoot->getInstruction())->getSuccessor(0)); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1386 | mvec.push_back(M); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1387 | |
| 1388 | // delay slot |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1389 | mvec.push_back(new MachineInstr(NOP)); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1390 | |
| 1391 | // false branch |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1392 | M = new MachineInstr(BA); |
Vikram S. Adve | 6418eac | 2002-07-08 23:30:14 +0000 | [diff] [blame] | 1393 | M->SetMachineOperandVal(0, MachineOperand::MO_PCRelativeDisp, |
Chris Lattner | 3550420 | 2002-04-27 03:14:39 +0000 | [diff] [blame] | 1394 | cast<BranchInst>(subtreeRoot->getInstruction())->getSuccessor(1)); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1395 | mvec.push_back(M); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1396 | |
| 1397 | // delay slot |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1398 | mvec.push_back(new MachineInstr(NOP)); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1399 | break; |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1400 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1401 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1402 | case 9: // stmt: Switch(reg) |
| 1403 | assert(0 && "*** SWITCH instruction is not implemented yet."); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1404 | break; |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 1405 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1406 | case 10: // reg: VRegList(reg, reg) |
| 1407 | assert(0 && "VRegList should never be the topmost non-chain rule"); |
| 1408 | break; |
| 1409 | |
Vikram S. Adve | ce08e1d | 2002-08-15 14:17:37 +0000 | [diff] [blame] | 1410 | case 21: // bool: Not(bool,reg): Both these are implemented as: |
| 1411 | case 421: // reg: BNot(reg,reg): reg = reg XOR-NOT 0 |
| 1412 | { // First find the unary operand. It may be left or right, usually right. |
| 1413 | Value* notArg = BinaryOperator::getNotArgument( |
| 1414 | cast<BinaryOperator>(subtreeRoot->getInstruction())); |
| 1415 | mvec.push_back(Create3OperandInstr_Reg(XNOR, notArg, |
| 1416 | target.getRegInfo().getZeroRegNum(), |
| 1417 | subtreeRoot->getValue())); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1418 | break; |
Vikram S. Adve | ce08e1d | 2002-08-15 14:17:37 +0000 | [diff] [blame] | 1419 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1420 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1421 | case 22: // reg: ToBoolTy(reg): |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 1422 | { |
| 1423 | const Type* opType = subtreeRoot->leftChild()->getValue()->getType(); |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 1424 | assert(opType->isIntegral() || isa<PointerType>(opType)); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1425 | forwardOperandNum = 0; // forward first operand to user |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1426 | break; |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 1427 | } |
| 1428 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1429 | case 23: // reg: ToUByteTy(reg) |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 1430 | case 24: // reg: ToSByteTy(reg) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1431 | case 25: // reg: ToUShortTy(reg) |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 1432 | case 26: // reg: ToShortTy(reg) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1433 | case 27: // reg: ToUIntTy(reg) |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 1434 | case 28: // reg: ToIntTy(reg) |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 1435 | { |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 1436 | //====================================================================== |
| 1437 | // Rules for integer conversions: |
| 1438 | // |
| 1439 | //-------- |
| 1440 | // From ISO 1998 C++ Standard, Sec. 4.7: |
| 1441 | // |
| 1442 | // 2. If the destination type is unsigned, the resulting value is |
| 1443 | // the least unsigned integer congruent to the source integer |
| 1444 | // (modulo 2n where n is the number of bits used to represent the |
| 1445 | // unsigned type). [Note: In a two s complement representation, |
| 1446 | // this conversion is conceptual and there is no change in the |
| 1447 | // bit pattern (if there is no truncation). ] |
| 1448 | // |
| 1449 | // 3. If the destination type is signed, the value is unchanged if |
| 1450 | // it can be represented in the destination type (and bitfield width); |
| 1451 | // otherwise, the value is implementation-defined. |
| 1452 | //-------- |
| 1453 | // |
| 1454 | // Since we assume 2s complement representations, this implies: |
| 1455 | // |
| 1456 | // -- if operand is smaller than destination, zero-extend or sign-extend |
| 1457 | // according to the signedness of the *operand*: source decides. |
| 1458 | // ==> we have to do nothing here! |
| 1459 | // |
| 1460 | // -- if operand is same size as or larger than destination, and the |
| 1461 | // destination is *unsigned*, zero-extend the operand: dest. decides |
| 1462 | // |
| 1463 | // -- if operand is same size as or larger than destination, and the |
| 1464 | // destination is *signed*, the choice is implementation defined: |
| 1465 | // we sign-extend the operand: i.e., again dest. decides. |
| 1466 | // Note: this matches both Sun's cc and gcc3.2. |
| 1467 | //====================================================================== |
| 1468 | |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1469 | Instruction* destI = subtreeRoot->getInstruction(); |
| 1470 | Value* opVal = subtreeRoot->leftChild()->getValue(); |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 1471 | const Type* opType = opVal->getType(); |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 1472 | if (opType->isIntegral() || isa<PointerType>(opType)) |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 1473 | { |
| 1474 | unsigned opSize = target.DataLayout.getTypeSize(opType); |
| 1475 | unsigned destSize = target.DataLayout.getTypeSize(destI->getType()); |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 1476 | if (opSize >= destSize) |
| 1477 | { // Operand is same size as or larger than dest: |
| 1478 | // zero- or sign-extend, according to the signeddness of |
| 1479 | // the destination (see above). |
| 1480 | if (destI->getType()->isSigned()) |
| 1481 | target.getInstrInfo().CreateSignExtensionInstructions(target, |
| 1482 | destI->getParent()->getParent(), opVal, destI, 8*destSize, |
| 1483 | mvec, MachineCodeForInstruction::get(destI)); |
| 1484 | else |
| 1485 | target.getInstrInfo().CreateZeroExtensionInstructions(target, |
| 1486 | destI->getParent()->getParent(), opVal, destI, 8*destSize, |
| 1487 | mvec, MachineCodeForInstruction::get(destI)); |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 1488 | } |
| 1489 | else |
| 1490 | forwardOperandNum = 0; // forward first operand to user |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1491 | } |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 1492 | else if (opType->isFloatingPoint()) |
Vikram S. Adve | 8cfffd3 | 2002-08-24 20:56:53 +0000 | [diff] [blame] | 1493 | { |
| 1494 | CreateCodeToConvertFloatToInt(target, opVal, destI, mvec, |
| 1495 | MachineCodeForInstruction::get(destI)); |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 1496 | if (destI->getType()->isUnsigned()) |
| 1497 | maskUnsignedResult = true; // not handled by fp->int code |
Vikram S. Adve | 8cfffd3 | 2002-08-24 20:56:53 +0000 | [diff] [blame] | 1498 | } |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1499 | else |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 1500 | assert(0 && "Unrecognized operand type for convert-to-unsigned"); |
| 1501 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1502 | break; |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 1503 | } |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 1504 | |
| 1505 | case 29: // reg: ToULongTy(reg) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1506 | case 30: // reg: ToLongTy(reg) |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 1507 | { |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1508 | Value* opVal = subtreeRoot->leftChild()->getValue(); |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1509 | const Type* opType = opVal->getType(); |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 1510 | if (opType->isIntegral() || isa<PointerType>(opType)) |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 1511 | forwardOperandNum = 0; // forward first operand to user |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 1512 | else if (opType->isFloatingPoint()) |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 1513 | { |
| 1514 | Instruction* destI = subtreeRoot->getInstruction(); |
| 1515 | CreateCodeToConvertFloatToInt(target, opVal, destI, mvec, |
| 1516 | MachineCodeForInstruction::get(destI)); |
| 1517 | } |
Vikram S. Adve | 1e60669 | 2002-07-31 21:01:34 +0000 | [diff] [blame] | 1518 | else |
| 1519 | assert(0 && "Unrecognized operand type for convert-to-signed"); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1520 | break; |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 1521 | } |
| 1522 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1523 | case 31: // reg: ToFloatTy(reg): |
| 1524 | case 32: // reg: ToDoubleTy(reg): |
| 1525 | case 232: // reg: ToDoubleTy(Constant): |
Vikram S. Adve | ec7f482 | 2002-09-09 14:54:21 +0000 | [diff] [blame] | 1526 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1527 | // If this instruction has a parent (a user) in the tree |
| 1528 | // and the user is translated as an FsMULd instruction, |
| 1529 | // then the cast is unnecessary. So check that first. |
| 1530 | // In the future, we'll want to do the same for the FdMULq instruction, |
| 1531 | // so do the check here instead of only for ToFloatTy(reg). |
| 1532 | // |
Vikram S. Adve | ec7f482 | 2002-09-09 14:54:21 +0000 | [diff] [blame] | 1533 | if (subtreeRoot->parent() != NULL) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1534 | { |
Vikram S. Adve | ec7f482 | 2002-09-09 14:54:21 +0000 | [diff] [blame] | 1535 | const MachineCodeForInstruction& mcfi = |
| 1536 | MachineCodeForInstruction::get( |
| 1537 | cast<InstructionNode>(subtreeRoot->parent())->getInstruction()); |
| 1538 | if (mcfi.size() == 0 || mcfi.front()->getOpCode() == FSMULD) |
| 1539 | forwardOperandNum = 0; // forward first operand to user |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1540 | } |
Vikram S. Adve | ec7f482 | 2002-09-09 14:54:21 +0000 | [diff] [blame] | 1541 | |
| 1542 | if (forwardOperandNum != 0) // we do need the cast |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1543 | { |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 1544 | Value* leftVal = subtreeRoot->leftChild()->getValue(); |
| 1545 | const Type* opType = leftVal->getType(); |
Vikram S. Adve | dbc4fad | 2002-04-25 04:37:51 +0000 | [diff] [blame] | 1546 | MachineOpCode opCode=ChooseConvertToFloatInstr( |
| 1547 | subtreeRoot->getOpLabel(), opType); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1548 | if (opCode == INVALID_OPCODE) // no conversion needed |
| 1549 | { |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1550 | forwardOperandNum = 0; // forward first operand to user |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1551 | } |
| 1552 | else |
| 1553 | { |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1554 | // If the source operand is a non-FP type it must be |
| 1555 | // first copied from int to float register via memory! |
| 1556 | Instruction *dest = subtreeRoot->getInstruction(); |
| 1557 | Value* srcForCast; |
| 1558 | int n = 0; |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1559 | if (! opType->isFloatingPoint()) |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1560 | { |
| 1561 | // Create a temporary to represent the FP register |
| 1562 | // into which the integer will be copied via memory. |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 1563 | // The type of this temporary will determine the FP |
| 1564 | // register used: single-prec for a 32-bit int or smaller, |
| 1565 | // double-prec for a 64-bit int. |
| 1566 | // |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 1567 | uint64_t srcSize = |
| 1568 | target.DataLayout.getTypeSize(leftVal->getType()); |
| 1569 | Type* tmpTypeToUse = |
| 1570 | (srcSize <= 4)? Type::FloatTy : Type::DoubleTy; |
| 1571 | srcForCast = new TmpInstruction(tmpTypeToUse, dest); |
Vikram S. Adve | dbc4fad | 2002-04-25 04:37:51 +0000 | [diff] [blame] | 1572 | MachineCodeForInstruction &destMCFI = |
Chris Lattner | 9c46108 | 2002-02-03 07:50:56 +0000 | [diff] [blame] | 1573 | MachineCodeForInstruction::get(dest); |
Vikram S. Adve | dbc4fad | 2002-04-25 04:37:51 +0000 | [diff] [blame] | 1574 | destMCFI.addTemp(srcForCast); |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 1575 | |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1576 | target.getInstrInfo().CreateCodeToCopyIntToFloat(target, |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1577 | dest->getParent()->getParent(), |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 1578 | leftVal, cast<Instruction>(srcForCast), |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1579 | mvec, destMCFI); |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1580 | } |
| 1581 | else |
| 1582 | srcForCast = leftVal; |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 1583 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1584 | M = new MachineInstr(opCode); |
| 1585 | M->SetMachineOperandVal(0, MachineOperand::MO_VirtualRegister, |
| 1586 | srcForCast); |
| 1587 | M->SetMachineOperandVal(1, MachineOperand::MO_VirtualRegister, |
| 1588 | dest); |
| 1589 | mvec.push_back(M); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1590 | } |
| 1591 | } |
| 1592 | break; |
| 1593 | |
| 1594 | case 19: // reg: ToArrayTy(reg): |
| 1595 | case 20: // reg: ToPointerTy(reg): |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1596 | forwardOperandNum = 0; // forward first operand to user |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1597 | break; |
| 1598 | |
| 1599 | case 233: // reg: Add(reg, Constant) |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 1600 | maskUnsignedResult = true; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1601 | M = CreateAddConstInstruction(subtreeRoot); |
| 1602 | if (M != NULL) |
| 1603 | { |
| 1604 | mvec.push_back(M); |
| 1605 | break; |
| 1606 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1607 | // ELSE FALL THROUGH |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1608 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1609 | case 33: // reg: Add(reg, reg) |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 1610 | maskUnsignedResult = true; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1611 | mvec.push_back(new MachineInstr(ChooseAddInstruction(subtreeRoot))); |
| 1612 | Set3OperandsFromInstr(mvec.back(), subtreeRoot, target); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1613 | break; |
| 1614 | |
| 1615 | case 234: // reg: Sub(reg, Constant) |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 1616 | maskUnsignedResult = true; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1617 | M = CreateSubConstInstruction(subtreeRoot); |
| 1618 | if (M != NULL) |
| 1619 | { |
| 1620 | mvec.push_back(M); |
| 1621 | break; |
| 1622 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1623 | // ELSE FALL THROUGH |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1624 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1625 | case 34: // reg: Sub(reg, reg) |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 1626 | maskUnsignedResult = true; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1627 | mvec.push_back(new MachineInstr(ChooseSubInstructionByType( |
| 1628 | subtreeRoot->getInstruction()->getType()))); |
| 1629 | Set3OperandsFromInstr(mvec.back(), subtreeRoot, target); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1630 | break; |
| 1631 | |
| 1632 | case 135: // reg: Mul(todouble, todouble) |
| 1633 | checkCast = true; |
| 1634 | // FALL THROUGH |
| 1635 | |
| 1636 | case 35: // reg: Mul(reg, reg) |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1637 | { |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 1638 | maskUnsignedResult = true; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1639 | MachineOpCode forceOp = ((checkCast && BothFloatToDouble(subtreeRoot)) |
| 1640 | ? FSMULD |
| 1641 | : INVALID_MACHINE_OPCODE); |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1642 | Instruction* mulInstr = subtreeRoot->getInstruction(); |
| 1643 | CreateMulInstruction(target, mulInstr->getParent()->getParent(), |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1644 | subtreeRoot->leftChild()->getValue(), |
| 1645 | subtreeRoot->rightChild()->getValue(), |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1646 | mulInstr, mvec, |
| 1647 | MachineCodeForInstruction::get(mulInstr),forceOp); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1648 | break; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1649 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1650 | case 335: // reg: Mul(todouble, todoubleConst) |
| 1651 | checkCast = true; |
| 1652 | // FALL THROUGH |
| 1653 | |
| 1654 | case 235: // reg: Mul(reg, Constant) |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1655 | { |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 1656 | maskUnsignedResult = true; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1657 | MachineOpCode forceOp = ((checkCast && BothFloatToDouble(subtreeRoot)) |
| 1658 | ? FSMULD |
| 1659 | : INVALID_MACHINE_OPCODE); |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1660 | Instruction* mulInstr = subtreeRoot->getInstruction(); |
| 1661 | CreateMulInstruction(target, mulInstr->getParent()->getParent(), |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1662 | subtreeRoot->leftChild()->getValue(), |
| 1663 | subtreeRoot->rightChild()->getValue(), |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1664 | mulInstr, mvec, |
| 1665 | MachineCodeForInstruction::get(mulInstr), |
| 1666 | forceOp); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1667 | break; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1668 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1669 | case 236: // reg: Div(reg, Constant) |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 1670 | maskUnsignedResult = true; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1671 | L = mvec.size(); |
| 1672 | CreateDivConstInstruction(target, subtreeRoot, mvec); |
| 1673 | if (mvec.size() > L) |
| 1674 | break; |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1675 | // ELSE FALL THROUGH |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1676 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1677 | case 36: // reg: Div(reg, reg) |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 1678 | maskUnsignedResult = true; |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1679 | mvec.push_back(new MachineInstr(ChooseDivInstruction(target, subtreeRoot))); |
| 1680 | Set3OperandsFromInstr(mvec.back(), subtreeRoot, target); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1681 | break; |
| 1682 | |
| 1683 | case 37: // reg: Rem(reg, reg) |
| 1684 | case 237: // reg: Rem(reg, Constant) |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 1685 | { |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 1686 | maskUnsignedResult = true; |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 1687 | Instruction* remInstr = subtreeRoot->getInstruction(); |
| 1688 | |
Chris Lattner | 9c46108 | 2002-02-03 07:50:56 +0000 | [diff] [blame] | 1689 | TmpInstruction* quot = new TmpInstruction( |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 1690 | subtreeRoot->leftChild()->getValue(), |
| 1691 | subtreeRoot->rightChild()->getValue()); |
Chris Lattner | 9c46108 | 2002-02-03 07:50:56 +0000 | [diff] [blame] | 1692 | TmpInstruction* prod = new TmpInstruction( |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 1693 | quot, |
| 1694 | subtreeRoot->rightChild()->getValue()); |
Chris Lattner | 9c46108 | 2002-02-03 07:50:56 +0000 | [diff] [blame] | 1695 | MachineCodeForInstruction::get(remInstr).addTemp(quot).addTemp(prod); |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 1696 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1697 | M = new MachineInstr(ChooseDivInstruction(target, subtreeRoot)); |
| 1698 | Set3OperandsFromInstr(M, subtreeRoot, target); |
| 1699 | M->SetMachineOperandVal(2, MachineOperand::MO_VirtualRegister,quot); |
| 1700 | mvec.push_back(M); |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 1701 | |
Vikram S. Adve | ce08e1d | 2002-08-15 14:17:37 +0000 | [diff] [blame] | 1702 | M = Create3OperandInstr(ChooseMulInstructionByType( |
| 1703 | subtreeRoot->getInstruction()->getType()), |
| 1704 | quot, subtreeRoot->rightChild()->getValue(), |
| 1705 | prod); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1706 | mvec.push_back(M); |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 1707 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1708 | M = new MachineInstr(ChooseSubInstructionByType( |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 1709 | subtreeRoot->getInstruction()->getType())); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1710 | Set3OperandsFromInstr(M, subtreeRoot, target); |
| 1711 | M->SetMachineOperandVal(1, MachineOperand::MO_VirtualRegister,prod); |
| 1712 | mvec.push_back(M); |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 1713 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1714 | break; |
Vikram S. Adve | 510eec7 | 2001-11-04 21:59:14 +0000 | [diff] [blame] | 1715 | } |
| 1716 | |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1717 | case 38: // bool: And(bool, bool) |
| 1718 | case 238: // bool: And(bool, boolconst) |
| 1719 | case 338: // reg : BAnd(reg, reg) |
| 1720 | case 538: // reg : BAnd(reg, Constant) |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1721 | mvec.push_back(new MachineInstr(AND)); |
| 1722 | Set3OperandsFromInstr(mvec.back(), subtreeRoot, target); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1723 | break; |
| 1724 | |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1725 | case 138: // bool: And(bool, not) |
Vikram S. Adve | ce08e1d | 2002-08-15 14:17:37 +0000 | [diff] [blame] | 1726 | case 438: // bool: BAnd(bool, bnot) |
| 1727 | { // Use the argument of NOT as the second argument! |
| 1728 | // Mark the NOT node so that no code is generated for it. |
| 1729 | InstructionNode* notNode = (InstructionNode*) subtreeRoot->rightChild(); |
| 1730 | Value* notArg = BinaryOperator::getNotArgument( |
| 1731 | cast<BinaryOperator>(notNode->getInstruction())); |
| 1732 | notNode->markFoldedIntoParent(); |
| 1733 | mvec.push_back(Create3OperandInstr(ANDN, |
| 1734 | subtreeRoot->leftChild()->getValue(), |
| 1735 | notArg, subtreeRoot->getValue())); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1736 | break; |
Vikram S. Adve | ce08e1d | 2002-08-15 14:17:37 +0000 | [diff] [blame] | 1737 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1738 | |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1739 | case 39: // bool: Or(bool, bool) |
| 1740 | case 239: // bool: Or(bool, boolconst) |
| 1741 | case 339: // reg : BOr(reg, reg) |
| 1742 | case 539: // reg : BOr(reg, Constant) |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1743 | mvec.push_back(new MachineInstr(OR)); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1744 | Set3OperandsFromInstr(mvec.back(), subtreeRoot, target); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1745 | break; |
| 1746 | |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1747 | case 139: // bool: Or(bool, not) |
Vikram S. Adve | ce08e1d | 2002-08-15 14:17:37 +0000 | [diff] [blame] | 1748 | case 439: // bool: BOr(bool, bnot) |
| 1749 | { // Use the argument of NOT as the second argument! |
| 1750 | // Mark the NOT node so that no code is generated for it. |
| 1751 | InstructionNode* notNode = (InstructionNode*) subtreeRoot->rightChild(); |
| 1752 | Value* notArg = BinaryOperator::getNotArgument( |
| 1753 | cast<BinaryOperator>(notNode->getInstruction())); |
| 1754 | notNode->markFoldedIntoParent(); |
| 1755 | mvec.push_back(Create3OperandInstr(ORN, |
| 1756 | subtreeRoot->leftChild()->getValue(), |
| 1757 | notArg, subtreeRoot->getValue())); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1758 | break; |
Vikram S. Adve | ce08e1d | 2002-08-15 14:17:37 +0000 | [diff] [blame] | 1759 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1760 | |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1761 | case 40: // bool: Xor(bool, bool) |
| 1762 | case 240: // bool: Xor(bool, boolconst) |
| 1763 | case 340: // reg : BXor(reg, reg) |
| 1764 | case 540: // reg : BXor(reg, Constant) |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1765 | mvec.push_back(new MachineInstr(XOR)); |
| 1766 | Set3OperandsFromInstr(mvec.back(), subtreeRoot, target); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1767 | break; |
| 1768 | |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1769 | case 140: // bool: Xor(bool, not) |
Vikram S. Adve | ce08e1d | 2002-08-15 14:17:37 +0000 | [diff] [blame] | 1770 | case 440: // bool: BXor(bool, bnot) |
| 1771 | { // Use the argument of NOT as the second argument! |
| 1772 | // Mark the NOT node so that no code is generated for it. |
| 1773 | InstructionNode* notNode = (InstructionNode*) subtreeRoot->rightChild(); |
| 1774 | Value* notArg = BinaryOperator::getNotArgument( |
| 1775 | cast<BinaryOperator>(notNode->getInstruction())); |
| 1776 | notNode->markFoldedIntoParent(); |
| 1777 | mvec.push_back(Create3OperandInstr(XNOR, |
| 1778 | subtreeRoot->leftChild()->getValue(), |
| 1779 | notArg, subtreeRoot->getValue())); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1780 | break; |
Vikram S. Adve | ce08e1d | 2002-08-15 14:17:37 +0000 | [diff] [blame] | 1781 | } |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1782 | |
| 1783 | case 41: // boolconst: SetCC(reg, Constant) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1784 | // |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1785 | // If the SetCC was folded into the user (parent), it will be |
| 1786 | // caught above. All other cases are the same as case 42, |
| 1787 | // so just fall through. |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1788 | // |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1789 | case 42: // bool: SetCC(reg, reg): |
| 1790 | { |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1791 | // This generates a SUBCC instruction, putting the difference in |
| 1792 | // a result register, and setting a condition code. |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1793 | // |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1794 | // If the boolean result of the SetCC is used by anything other |
Vikram S. Adve | 6418eac | 2002-07-08 23:30:14 +0000 | [diff] [blame] | 1795 | // than a branch instruction, or if it is used outside the current |
| 1796 | // basic block, the boolean must be |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1797 | // computed and stored in the result register. Otherwise, discard |
| 1798 | // the difference (by using %g0) and keep only the condition code. |
| 1799 | // |
| 1800 | // To compute the boolean result in a register we use a conditional |
| 1801 | // move, unless the result of the SUBCC instruction can be used as |
| 1802 | // the bool! This assumes that zero is FALSE and any non-zero |
| 1803 | // integer is TRUE. |
| 1804 | // |
| 1805 | InstructionNode* parentNode = (InstructionNode*) subtreeRoot->parent(); |
| 1806 | Instruction* setCCInstr = subtreeRoot->getInstruction(); |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1807 | |
Vikram S. Adve | 6418eac | 2002-07-08 23:30:14 +0000 | [diff] [blame] | 1808 | bool keepBoolVal = parentNode == NULL || |
| 1809 | ! AllUsesAreBranches(setCCInstr); |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1810 | bool subValIsBoolVal = setCCInstr->getOpcode() == Instruction::SetNE; |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1811 | bool keepSubVal = keepBoolVal && subValIsBoolVal; |
| 1812 | bool computeBoolVal = keepBoolVal && ! subValIsBoolVal; |
| 1813 | |
| 1814 | bool mustClearReg; |
| 1815 | int valueToMove; |
Chris Lattner | 8e5c0b4 | 2001-11-07 14:01:59 +0000 | [diff] [blame] | 1816 | MachineOpCode movOpCode = 0; |
Vikram S. Adve | 6418eac | 2002-07-08 23:30:14 +0000 | [diff] [blame] | 1817 | |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1818 | // Mark the 4th operand as being a CC register, and as a def |
| 1819 | // A TmpInstruction is created to represent the CC "result". |
| 1820 | // Unlike other instances of TmpInstruction, this one is used |
| 1821 | // by machine code of multiple LLVM instructions, viz., |
| 1822 | // the SetCC and the branch. Make sure to get the same one! |
| 1823 | // Note that we do this even for FP CC registers even though they |
| 1824 | // are explicit operands, because the type of the operand |
| 1825 | // needs to be a floating point condition code, not an integer |
| 1826 | // condition code. Think of this as casting the bool result to |
| 1827 | // a FP condition code register. |
| 1828 | // |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 1829 | Value* leftVal = subtreeRoot->leftChild()->getValue(); |
Chris Lattner | 9b62503 | 2002-05-06 16:15:30 +0000 | [diff] [blame] | 1830 | bool isFPCompare = leftVal->getType()->isFloatingPoint(); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1831 | |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1832 | TmpInstruction* tmpForCC = GetTmpForCC(setCCInstr, |
| 1833 | setCCInstr->getParent()->getParent(), |
Chris Lattner | 9b62503 | 2002-05-06 16:15:30 +0000 | [diff] [blame] | 1834 | isFPCompare ? Type::FloatTy : Type::IntTy); |
Chris Lattner | 9c46108 | 2002-02-03 07:50:56 +0000 | [diff] [blame] | 1835 | MachineCodeForInstruction::get(setCCInstr).addTemp(tmpForCC); |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1836 | |
| 1837 | if (! isFPCompare) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1838 | { |
| 1839 | // Integer condition: dest. should be %g0 or an integer register. |
| 1840 | // If result must be saved but condition is not SetEQ then we need |
| 1841 | // a separate instruction to compute the bool result, so discard |
| 1842 | // result of SUBcc instruction anyway. |
| 1843 | // |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1844 | M = new MachineInstr(SUBcc); |
| 1845 | Set3OperandsFromInstr(M, subtreeRoot, target, ! keepSubVal); |
| 1846 | M->SetMachineOperandVal(3, MachineOperand::MO_CCRegister, |
| 1847 | tmpForCC, /*def*/true); |
| 1848 | mvec.push_back(M); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1849 | |
| 1850 | if (computeBoolVal) |
| 1851 | { // recompute bool using the integer condition codes |
| 1852 | movOpCode = |
| 1853 | ChooseMovpccAfterSub(subtreeRoot,mustClearReg,valueToMove); |
| 1854 | } |
| 1855 | } |
| 1856 | else |
| 1857 | { |
| 1858 | // FP condition: dest of FCMP should be some FCCn register |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1859 | M = new MachineInstr(ChooseFcmpInstruction(subtreeRoot)); |
| 1860 | M->SetMachineOperandVal(0, MachineOperand::MO_CCRegister, |
Vikram S. Adve | ff5a09e | 2001-11-08 05:04:09 +0000 | [diff] [blame] | 1861 | tmpForCC); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1862 | M->SetMachineOperandVal(1,MachineOperand::MO_VirtualRegister, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1863 | subtreeRoot->leftChild()->getValue()); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1864 | M->SetMachineOperandVal(2,MachineOperand::MO_VirtualRegister, |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1865 | subtreeRoot->rightChild()->getValue()); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1866 | mvec.push_back(M); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1867 | |
| 1868 | if (computeBoolVal) |
| 1869 | {// recompute bool using the FP condition codes |
| 1870 | mustClearReg = true; |
| 1871 | valueToMove = 1; |
| 1872 | movOpCode = ChooseMovFpccInstruction(subtreeRoot); |
| 1873 | } |
| 1874 | } |
| 1875 | |
| 1876 | if (computeBoolVal) |
| 1877 | { |
| 1878 | if (mustClearReg) |
| 1879 | {// Unconditionally set register to 0 |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1880 | M = new MachineInstr(SETHI); |
| 1881 | M->SetMachineOperandConst(0,MachineOperand::MO_UnextendedImmed, |
| 1882 | (int64_t)0); |
| 1883 | M->SetMachineOperandVal(1, MachineOperand::MO_VirtualRegister, |
| 1884 | setCCInstr); |
| 1885 | mvec.push_back(M); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1886 | } |
| 1887 | |
| 1888 | // Now conditionally move `valueToMove' (0 or 1) into the register |
Vikram S. Adve | 6418eac | 2002-07-08 23:30:14 +0000 | [diff] [blame] | 1889 | // Mark the register as a use (as well as a def) because the old |
| 1890 | // value should be retained if the condition is false. |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1891 | M = new MachineInstr(movOpCode); |
| 1892 | M->SetMachineOperandVal(0, MachineOperand::MO_CCRegister, |
| 1893 | tmpForCC); |
| 1894 | M->SetMachineOperandConst(1, MachineOperand::MO_UnextendedImmed, |
| 1895 | valueToMove); |
| 1896 | M->SetMachineOperandVal(2, MachineOperand::MO_VirtualRegister, |
Vikram S. Adve | 6418eac | 2002-07-08 23:30:14 +0000 | [diff] [blame] | 1897 | setCCInstr, /*isDef*/ true, |
| 1898 | /*isDefAndUse*/ true); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1899 | mvec.push_back(M); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1900 | } |
| 1901 | break; |
| 1902 | } |
| 1903 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1904 | case 51: // reg: Load(reg) |
| 1905 | case 52: // reg: Load(ptrreg) |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1906 | mvec.push_back(new MachineInstr(ChooseLoadInstruction( |
| 1907 | subtreeRoot->getValue()->getType()))); |
Vikram S. Adve | 8cfffd3 | 2002-08-24 20:56:53 +0000 | [diff] [blame] | 1908 | SetOperandsForMemInstr(mvec, subtreeRoot, target); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1909 | break; |
| 1910 | |
| 1911 | case 55: // reg: GetElemPtr(reg) |
| 1912 | case 56: // reg: GetElemPtrIdx(reg,reg) |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1913 | // If the GetElemPtr was folded into the user (parent), it will be |
| 1914 | // caught above. For other cases, we have to compute the address. |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1915 | mvec.push_back(new MachineInstr(ADD)); |
Vikram S. Adve | 8cfffd3 | 2002-08-24 20:56:53 +0000 | [diff] [blame] | 1916 | SetOperandsForMemInstr(mvec, subtreeRoot, target); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1917 | break; |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 1918 | |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1919 | case 57: // reg: Alloca: Implement as 1 instruction: |
| 1920 | { // add %fp, offsetFromFP -> result |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1921 | AllocationInst* instr = |
| 1922 | cast<AllocationInst>(subtreeRoot->getInstruction()); |
| 1923 | unsigned int tsize = |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 1924 | target.DataLayout.getTypeSize(instr->getAllocatedType()); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1925 | assert(tsize != 0); |
| 1926 | CreateCodeForFixedSizeAlloca(target, instr, tsize, 1, mvec); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1927 | break; |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1928 | } |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 1929 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1930 | case 58: // reg: Alloca(reg): Implement as 3 instructions: |
| 1931 | // mul num, typeSz -> tmp |
| 1932 | // sub %sp, tmp -> %sp |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1933 | { // add %sp, frameSizeBelowDynamicArea -> result |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1934 | AllocationInst* instr = |
| 1935 | cast<AllocationInst>(subtreeRoot->getInstruction()); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1936 | const Type* eltType = instr->getAllocatedType(); |
| 1937 | |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1938 | // If #elements is constant, use simpler code for fixed-size allocas |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 1939 | int tsize = (int) target.DataLayout.getTypeSize(eltType); |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1940 | Value* numElementsVal = NULL; |
| 1941 | bool isArray = instr->isArrayAllocation(); |
| 1942 | |
| 1943 | if (!isArray || |
| 1944 | isa<Constant>(numElementsVal = instr->getArraySize())) |
| 1945 | { // total size is constant: generate code for fixed-size alloca |
| 1946 | unsigned int numElements = isArray? |
| 1947 | cast<ConstantUInt>(numElementsVal)->getValue() : 1; |
| 1948 | CreateCodeForFixedSizeAlloca(target, instr, tsize, |
| 1949 | numElements, mvec); |
| 1950 | } |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1951 | else // total size is not constant. |
| 1952 | CreateCodeForVariableSizeAlloca(target, instr, tsize, |
Vikram S. Adve | fd3900a | 2002-03-24 03:33:02 +0000 | [diff] [blame] | 1953 | numElementsVal, mvec); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1954 | break; |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1955 | } |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 1956 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 1957 | case 61: // reg: Call |
Vikram S. Adve | 4a8bb2b | 2002-09-28 16:55:41 +0000 | [diff] [blame] | 1958 | { // Generate a direct (CALL) or indirect (JMPL) call. |
| 1959 | // Mark the return-address register, the indirection |
| 1960 | // register (for indirect calls), the operands of the Call, |
| 1961 | // and the return value (if any) as implicit operands |
| 1962 | // of the machine instruction. |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 1963 | // |
Vikram S. Adve | dbc4fad | 2002-04-25 04:37:51 +0000 | [diff] [blame] | 1964 | // If this is a varargs function, floating point arguments |
| 1965 | // have to passed in integer registers so insert |
| 1966 | // copy-float-to-int instructions for each float operand. |
| 1967 | // |
Chris Lattner | b00c582 | 2001-10-02 03:41:24 +0000 | [diff] [blame] | 1968 | CallInst *callInstr = cast<CallInst>(subtreeRoot->getInstruction()); |
Chris Lattner | 749655f | 2001-10-13 06:54:30 +0000 | [diff] [blame] | 1969 | Value *callee = callInstr->getCalledValue(); |
Vikram S. Adve | 4a8bb2b | 2002-09-28 16:55:41 +0000 | [diff] [blame] | 1970 | |
| 1971 | // Create hidden virtual register for return address with type void* |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1972 | TmpInstruction* retAddrReg = |
Vikram S. Adve | a10d1a7 | 2002-03-31 19:07:35 +0000 | [diff] [blame] | 1973 | new TmpInstruction(PointerType::get(Type::VoidTy), callInstr); |
Chris Lattner | 9c46108 | 2002-02-03 07:50:56 +0000 | [diff] [blame] | 1974 | MachineCodeForInstruction::get(callInstr).addTemp(retAddrReg); |
Vikram S. Adve | 4a8bb2b | 2002-09-28 16:55:41 +0000 | [diff] [blame] | 1975 | |
Vikram S. Adve | ea21a6c | 2001-10-20 20:57:06 +0000 | [diff] [blame] | 1976 | // Generate the machine instruction and its operands. |
| 1977 | // Use CALL for direct function calls; this optimistically assumes |
| 1978 | // the PC-relative address fits in the CALL address field (22 bits). |
| 1979 | // Use JMPL for indirect calls. |
| 1980 | // |
Vikram S. Adve | 4a8bb2b | 2002-09-28 16:55:41 +0000 | [diff] [blame] | 1981 | if (isa<Function>(callee)) // direct function call |
| 1982 | M = Create1OperandInstr_Addr(CALL, callee); |
| 1983 | else // indirect function call |
| 1984 | M = Create3OperandInstr_SImmed(JMPLCALL, callee, |
| 1985 | (int64_t) 0, retAddrReg); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 1986 | mvec.push_back(M); |
Vikram S. Adve | a10d1a7 | 2002-03-31 19:07:35 +0000 | [diff] [blame] | 1987 | |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1988 | const FunctionType* funcType = |
| 1989 | cast<FunctionType>(cast<PointerType>(callee->getType()) |
| 1990 | ->getElementType()); |
| 1991 | bool isVarArgs = funcType->isVarArg(); |
| 1992 | bool noPrototype = isVarArgs && funcType->getNumParams() == 0; |
Vikram S. Adve | dbc4fad | 2002-04-25 04:37:51 +0000 | [diff] [blame] | 1993 | |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 1994 | // Use an annotation to pass information about call arguments |
| 1995 | // to the register allocator. |
| 1996 | CallArgsDescriptor* argDesc = new CallArgsDescriptor(callInstr, |
| 1997 | retAddrReg, isVarArgs, noPrototype); |
| 1998 | M->addAnnotation(argDesc); |
Vikram S. Adve | a995e60 | 2001-10-11 04:23:19 +0000 | [diff] [blame] | 1999 | |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 2000 | assert(callInstr->getOperand(0) == callee |
| 2001 | && "This is assumed in the loop below!"); |
| 2002 | |
| 2003 | for (unsigned i=1, N=callInstr->getNumOperands(); i < N; ++i) |
| 2004 | { |
| 2005 | Value* argVal = callInstr->getOperand(i); |
| 2006 | Instruction* intArgReg = NULL; |
| 2007 | |
| 2008 | // Check for FP arguments to varargs functions. |
| 2009 | // Any such argument in the first $K$ args must be passed in an |
| 2010 | // integer register, where K = #integer argument registers. |
| 2011 | if (isVarArgs && argVal->getType()->isFloatingPoint()) |
| 2012 | { |
| 2013 | // If it is a function with no prototype, pass value |
| 2014 | // as an FP value as well as a varargs value |
| 2015 | if (noPrototype) |
| 2016 | argDesc->getArgInfo(i-1).setUseFPArgReg(); |
| 2017 | |
| 2018 | // If this arg. is in the first $K$ regs, add a copy |
| 2019 | // float-to-int instruction to pass the value as an integer. |
Vikram S. Adve | d3e2648 | 2002-10-13 00:18:57 +0000 | [diff] [blame] | 2020 | if (i <= target.getRegInfo().GetNumOfIntArgRegs()) |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 2021 | { |
| 2022 | MachineCodeForInstruction &destMCFI = |
| 2023 | MachineCodeForInstruction::get(callInstr); |
| 2024 | intArgReg = new TmpInstruction(Type::IntTy, argVal); |
| 2025 | destMCFI.addTemp(intArgReg); |
| 2026 | |
| 2027 | vector<MachineInstr*> copyMvec; |
| 2028 | target.getInstrInfo().CreateCodeToCopyFloatToInt(target, |
| 2029 | callInstr->getParent()->getParent(), |
| 2030 | argVal, (TmpInstruction*) intArgReg, |
| 2031 | copyMvec, destMCFI); |
| 2032 | mvec.insert(mvec.begin(),copyMvec.begin(),copyMvec.end()); |
| 2033 | |
| 2034 | argDesc->getArgInfo(i-1).setUseIntArgReg(); |
| 2035 | argDesc->getArgInfo(i-1).setArgCopy(intArgReg); |
| 2036 | } |
| 2037 | else |
| 2038 | // Cannot fit in first $K$ regs so pass the arg on the stack |
| 2039 | argDesc->getArgInfo(i-1).setUseStackSlot(); |
| 2040 | } |
| 2041 | |
| 2042 | if (intArgReg) |
| 2043 | mvec.back()->addImplicitRef(intArgReg); |
| 2044 | |
| 2045 | mvec.back()->addImplicitRef(argVal); |
| 2046 | } |
| 2047 | |
| 2048 | // Add the return value as an implicit ref. The call operands |
| 2049 | // were added above. |
Vikram S. Adve | ea21a6c | 2001-10-20 20:57:06 +0000 | [diff] [blame] | 2050 | if (callInstr->getType() != Type::VoidTy) |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 2051 | mvec.back()->addImplicitRef(callInstr, /*isDef*/ true); |
Vikram S. Adve | a995e60 | 2001-10-11 04:23:19 +0000 | [diff] [blame] | 2052 | |
Vikram S. Adve | ea21a6c | 2001-10-20 20:57:06 +0000 | [diff] [blame] | 2053 | // For the CALL instruction, the ret. addr. reg. is also implicit |
Chris Lattner | b0d0472 | 2002-03-26 17:58:12 +0000 | [diff] [blame] | 2054 | if (isa<Function>(callee)) |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 2055 | mvec.back()->addImplicitRef(retAddrReg, /*isDef*/ true); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2056 | |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 2057 | // delay slot |
| 2058 | mvec.push_back(new MachineInstr(NOP)); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2059 | break; |
Vikram S. Adve | b7f06f4 | 2001-11-04 19:34:49 +0000 | [diff] [blame] | 2060 | } |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 2061 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2062 | case 62: // reg: Shl(reg, reg) |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 2063 | { |
| 2064 | Value* argVal1 = subtreeRoot->leftChild()->getValue(); |
| 2065 | Value* argVal2 = subtreeRoot->rightChild()->getValue(); |
| 2066 | Instruction* shlInstr = subtreeRoot->getInstruction(); |
| 2067 | |
| 2068 | const Type* opType = argVal1->getType(); |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 2069 | assert((opType->isInteger() || isa<PointerType>(opType)) && |
| 2070 | "Shl unsupported for other types"); |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 2071 | |
| 2072 | CreateShiftInstructions(target, shlInstr->getParent()->getParent(), |
| 2073 | (opType == Type::LongTy)? SLLX : SLL, |
| 2074 | argVal1, argVal2, 0, shlInstr, mvec, |
| 2075 | MachineCodeForInstruction::get(shlInstr)); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2076 | break; |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 2077 | } |
| 2078 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2079 | case 63: // reg: Shr(reg, reg) |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 2080 | { const Type* opType = subtreeRoot->leftChild()->getValue()->getType(); |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 2081 | assert((opType->isInteger() || isa<PointerType>(opType)) && |
| 2082 | "Shr unsupported for other types"); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 2083 | mvec.push_back(new MachineInstr((opType->isSigned() |
| 2084 | ? ((opType == Type::LongTy)? SRAX : SRA) |
| 2085 | : ((opType == Type::LongTy)? SRLX : SRL)))); |
| 2086 | Set3OperandsFromInstr(mvec.back(), subtreeRoot, target); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2087 | break; |
Vikram S. Adve | 6ad7c55 | 2001-11-09 02:18:16 +0000 | [diff] [blame] | 2088 | } |
| 2089 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2090 | case 64: // reg: Phi(reg,reg) |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 2091 | break; // don't forward the value |
| 2092 | |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2093 | case 71: // reg: VReg |
| 2094 | case 72: // reg: Constant |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 2095 | break; // don't forward the value |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2096 | |
| 2097 | default: |
| 2098 | assert(0 && "Unrecognized BURG rule"); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2099 | break; |
| 2100 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 2101 | } |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 2102 | |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 2103 | if (forwardOperandNum >= 0) |
| 2104 | { // We did not generate a machine instruction but need to use operand. |
| 2105 | // If user is in the same tree, replace Value in its machine operand. |
| 2106 | // If not, insert a copy instruction which should get coalesced away |
| 2107 | // by register allocation. |
| 2108 | if (subtreeRoot->parent() != NULL) |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2109 | ForwardOperand(subtreeRoot, subtreeRoot->parent(), forwardOperandNum); |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 2110 | else |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2111 | { |
Vikram S. Adve | 7fe2787 | 2001-10-18 00:26:20 +0000 | [diff] [blame] | 2112 | vector<MachineInstr*> minstrVec; |
Vikram S. Adve | 242a808 | 2002-05-19 15:25:51 +0000 | [diff] [blame] | 2113 | Instruction* instr = subtreeRoot->getInstruction(); |
| 2114 | target.getInstrInfo(). |
| 2115 | CreateCopyInstructionsByType(target, |
| 2116 | instr->getParent()->getParent(), |
| 2117 | instr->getOperand(forwardOperandNum), |
| 2118 | instr, minstrVec, |
| 2119 | MachineCodeForInstruction::get(instr)); |
Vikram S. Adve | 7fe2787 | 2001-10-18 00:26:20 +0000 | [diff] [blame] | 2120 | assert(minstrVec.size() > 0); |
Vikram S. Adve | 7482532 | 2002-03-18 03:15:35 +0000 | [diff] [blame] | 2121 | mvec.insert(mvec.end(), minstrVec.begin(), minstrVec.end()); |
Vikram S. Adve | 4cecdd2 | 2001-10-01 00:12:53 +0000 | [diff] [blame] | 2122 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 2123 | } |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 2124 | |
| 2125 | if (maskUnsignedResult) |
| 2126 | { // If result is unsigned and smaller than int reg size, |
| 2127 | // we need to clear high bits of result value. |
| 2128 | assert(forwardOperandNum < 0 && "Need mask but no instruction generated"); |
| 2129 | Instruction* dest = subtreeRoot->getInstruction(); |
Vikram S. Adve | 8cfffd3 | 2002-08-24 20:56:53 +0000 | [diff] [blame] | 2130 | if (dest->getType()->isUnsigned()) |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 2131 | { |
| 2132 | unsigned destSize = target.DataLayout.getTypeSize(dest->getType()); |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 2133 | if (destSize <= 4) |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 2134 | { // Mask high bits. Use a TmpInstruction to represent the |
| 2135 | // intermediate result before masking. Since those instructions |
| 2136 | // have already been generated, go back and substitute tmpI |
| 2137 | // for dest in the result position of each one of them. |
| 2138 | TmpInstruction *tmpI = new TmpInstruction(dest->getType(), dest, |
| 2139 | NULL, "maskHi"); |
| 2140 | MachineCodeForInstruction::get(dest).addTemp(tmpI); |
| 2141 | |
| 2142 | for (unsigned i=0, N=mvec.size(); i < N; ++i) |
| 2143 | mvec[i]->substituteValue(dest, tmpI); |
| 2144 | |
Vikram S. Adve | 94c4081 | 2002-09-27 14:33:08 +0000 | [diff] [blame] | 2145 | M = Create3OperandInstr_UImmed(SRL, tmpI, 8*(4-destSize), dest); |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 2146 | mvec.push_back(M); |
| 2147 | } |
Vikram S. Adve | babc0fa | 2002-09-05 18:32:13 +0000 | [diff] [blame] | 2148 | else if (destSize < target.DataLayout.getIntegerRegize()) |
| 2149 | assert(0 && "Unsupported type size: 32 < size < 64 bits"); |
Vikram S. Adve | 65a2dee | 2002-08-13 17:40:54 +0000 | [diff] [blame] | 2150 | } |
| 2151 | } |
Chris Lattner | 20b1ea0 | 2001-09-14 03:47:57 +0000 | [diff] [blame] | 2152 | } |