Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 1 | //===- DAGISelMatcherEmitter.cpp - Matcher Emitter ------------------------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This file contains code to generate C++ code a matcher. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
| 14 | #include "DAGISelMatcher.h" |
| 15 | #include "CodeGenDAGPatterns.h" |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 16 | #include "Record.h" |
Chris Lattner | e609a51 | 2010-02-17 00:31:50 +0000 | [diff] [blame] | 17 | #include "llvm/ADT/DenseMap.h" |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 18 | #include "llvm/ADT/SmallString.h" |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 19 | #include "llvm/ADT/StringMap.h" |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 20 | #include "llvm/Support/FormattedStream.h" |
| 21 | using namespace llvm; |
| 22 | |
| 23 | namespace { |
| 24 | enum { |
Chris Lattner | 5be6e59 | 2010-02-17 00:39:26 +0000 | [diff] [blame] | 25 | CommentIndent = 30 |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 26 | }; |
| 27 | } |
| 28 | |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 29 | /// ClassifyInt - Classify an integer by size, return '1','2','4','8' if this |
| 30 | /// fits in 1, 2, 4, or 8 sign extended bytes. |
| 31 | static char ClassifyInt(int64_t Val) { |
| 32 | if (Val == int8_t(Val)) return '1'; |
| 33 | if (Val == int16_t(Val)) return '2'; |
| 34 | if (Val == int32_t(Val)) return '4'; |
| 35 | return '8'; |
| 36 | } |
| 37 | |
| 38 | /// EmitInt - Emit the specified integer, returning the number of bytes emitted. |
| 39 | static unsigned EmitInt(int64_t Val, formatted_raw_ostream &OS) { |
| 40 | unsigned BytesEmitted = 1; |
| 41 | OS << (int)(unsigned char)Val << ", "; |
| 42 | if (Val == int8_t(Val)) { |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 43 | OS << '\n'; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 44 | return BytesEmitted; |
| 45 | } |
| 46 | |
| 47 | OS << (int)(unsigned char)(Val >> 8) << ", "; |
| 48 | ++BytesEmitted; |
| 49 | |
| 50 | if (Val != int16_t(Val)) { |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 51 | OS << (int)(unsigned char)(Val >> 16) << ", " |
| 52 | << (int)(unsigned char)(Val >> 24) << ", "; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 53 | BytesEmitted += 2; |
| 54 | |
| 55 | if (Val != int32_t(Val)) { |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 56 | OS << (int)(unsigned char)(Val >> 32) << ", " |
| 57 | << (int)(unsigned char)(Val >> 40) << ", " |
| 58 | << (int)(unsigned char)(Val >> 48) << ", " |
| 59 | << (int)(unsigned char)(Val >> 56) << ", "; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 60 | BytesEmitted += 4; |
| 61 | } |
| 62 | } |
| 63 | |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 64 | OS.PadToColumn(CommentIndent) << "// " << Val << " aka 0x"; |
| 65 | OS.write_hex(Val) << '\n'; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 66 | return BytesEmitted; |
| 67 | } |
| 68 | |
Chris Lattner | e02ea54 | 2010-02-16 06:52:01 +0000 | [diff] [blame] | 69 | namespace { |
| 70 | class MatcherTableEmitter { |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 71 | StringMap<unsigned> NodePredicateMap, PatternPredicateMap; |
| 72 | std::vector<std::string> NodePredicates, PatternPredicates; |
Chris Lattner | e609a51 | 2010-02-17 00:31:50 +0000 | [diff] [blame] | 73 | |
| 74 | DenseMap<const ComplexPattern*, unsigned> ComplexPatternMap; |
| 75 | std::vector<const ComplexPattern*> ComplexPatterns; |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 76 | |
| 77 | |
| 78 | DenseMap<Record*, unsigned> NodeXFormMap; |
| 79 | std::vector<const Record*> NodeXForms; |
| 80 | |
Chris Lattner | e02ea54 | 2010-02-16 06:52:01 +0000 | [diff] [blame] | 81 | public: |
Chris Lattner | 984e188 | 2010-02-21 06:30:04 +0000 | [diff] [blame] | 82 | MatcherTableEmitter() {} |
Chris Lattner | e02ea54 | 2010-02-16 06:52:01 +0000 | [diff] [blame] | 83 | |
Chris Lattner | 984e188 | 2010-02-21 06:30:04 +0000 | [diff] [blame] | 84 | unsigned EmitMatcherList(const MatcherNode *N, unsigned Indent, |
Chris Lattner | 8fbad24 | 2010-02-21 07:16:41 +0000 | [diff] [blame] | 85 | unsigned StartIdx, formatted_raw_ostream &OS); |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 86 | |
Chris Lattner | 984e188 | 2010-02-21 06:30:04 +0000 | [diff] [blame] | 87 | void EmitPredicateFunctions(formatted_raw_ostream &OS); |
Chris Lattner | e02ea54 | 2010-02-16 06:52:01 +0000 | [diff] [blame] | 88 | private: |
Chris Lattner | 984e188 | 2010-02-21 06:30:04 +0000 | [diff] [blame] | 89 | unsigned EmitMatcher(const MatcherNode *N, unsigned Indent, |
| 90 | formatted_raw_ostream &OS); |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 91 | |
| 92 | unsigned getNodePredicate(StringRef PredName) { |
| 93 | unsigned &Entry = NodePredicateMap[PredName]; |
| 94 | if (Entry == 0) { |
| 95 | NodePredicates.push_back(PredName.str()); |
| 96 | Entry = NodePredicates.size(); |
| 97 | } |
| 98 | return Entry-1; |
| 99 | } |
| 100 | unsigned getPatternPredicate(StringRef PredName) { |
| 101 | unsigned &Entry = PatternPredicateMap[PredName]; |
| 102 | if (Entry == 0) { |
| 103 | PatternPredicates.push_back(PredName.str()); |
| 104 | Entry = PatternPredicates.size(); |
| 105 | } |
| 106 | return Entry-1; |
| 107 | } |
Chris Lattner | e609a51 | 2010-02-17 00:31:50 +0000 | [diff] [blame] | 108 | |
| 109 | unsigned getComplexPat(const ComplexPattern &P) { |
| 110 | unsigned &Entry = ComplexPatternMap[&P]; |
| 111 | if (Entry == 0) { |
| 112 | ComplexPatterns.push_back(&P); |
| 113 | Entry = ComplexPatterns.size(); |
| 114 | } |
| 115 | return Entry-1; |
| 116 | } |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 117 | |
| 118 | unsigned getNodeXFormID(Record *Rec) { |
| 119 | unsigned &Entry = NodeXFormMap[Rec]; |
| 120 | if (Entry == 0) { |
| 121 | NodeXForms.push_back(Rec); |
| 122 | Entry = NodeXForms.size(); |
| 123 | } |
| 124 | return Entry-1; |
| 125 | } |
| 126 | |
Chris Lattner | e02ea54 | 2010-02-16 06:52:01 +0000 | [diff] [blame] | 127 | }; |
| 128 | } // end anonymous namespace. |
| 129 | |
Chris Lattner | 5007e1e | 2010-02-23 00:59:59 +0000 | [diff] [blame] | 130 | /// EmitVBRValue - Emit the specified value as a VBR, returning the number of |
| 131 | /// bytes emitted. |
| 132 | static unsigned EmitVBRValue(unsigned Val, raw_ostream &OS) { |
| 133 | if (Val <= 127) { |
| 134 | OS << Val << ", "; |
| 135 | return 1; |
| 136 | } |
| 137 | |
| 138 | unsigned InVal = Val; |
| 139 | unsigned NumBytes = 0; |
Chris Lattner | 860d4a7 | 2010-02-23 01:07:39 +0000 | [diff] [blame] | 140 | while (Val >= 128) { |
Chris Lattner | 5007e1e | 2010-02-23 00:59:59 +0000 | [diff] [blame] | 141 | OS << (Val&127) << "|128,"; |
| 142 | Val >>= 7; |
| 143 | ++NumBytes; |
| 144 | } |
| 145 | OS << Val << "/*" << InVal << "*/, "; |
| 146 | return NumBytes+1; |
| 147 | } |
| 148 | |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 149 | /// EmitMatcherOpcodes - Emit bytes for the specified matcher and return |
| 150 | /// the number of bytes emitted. |
Chris Lattner | e02ea54 | 2010-02-16 06:52:01 +0000 | [diff] [blame] | 151 | unsigned MatcherTableEmitter:: |
Chris Lattner | 984e188 | 2010-02-21 06:30:04 +0000 | [diff] [blame] | 152 | EmitMatcher(const MatcherNode *N, unsigned Indent, formatted_raw_ostream &OS) { |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 153 | OS.PadToColumn(Indent*2); |
| 154 | |
| 155 | switch (N->getKind()) { |
| 156 | case MatcherNode::Push: assert(0 && "Should be handled by caller"); |
Chris Lattner | 845c042 | 2010-02-18 22:03:03 +0000 | [diff] [blame] | 157 | case MatcherNode::RecordNode: |
| 158 | OS << "OPC_RecordNode,"; |
Chris Lattner | c96087b | 2010-02-17 01:03:09 +0000 | [diff] [blame] | 159 | OS.PadToColumn(CommentIndent) << "// " |
| 160 | << cast<RecordMatcherNode>(N)->getWhatFor() << '\n'; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 161 | return 1; |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 162 | |
| 163 | case MatcherNode::RecordMemRef: |
| 164 | OS << "OPC_RecordMemRef,\n"; |
| 165 | return 1; |
| 166 | |
| 167 | case MatcherNode::CaptureFlagInput: |
| 168 | OS << "OPC_CaptureFlagInput,\n"; |
| 169 | return 1; |
| 170 | |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 171 | case MatcherNode::MoveChild: |
| 172 | OS << "OPC_MoveChild, " |
| 173 | << cast<MoveChildMatcherNode>(N)->getChildNo() << ",\n"; |
| 174 | return 2; |
| 175 | |
| 176 | case MatcherNode::MoveParent: |
| 177 | OS << "OPC_MoveParent,\n"; |
| 178 | return 1; |
| 179 | |
| 180 | case MatcherNode::CheckSame: |
| 181 | OS << "OPC_CheckSame, " |
| 182 | << cast<CheckSameMatcherNode>(N)->getMatchNumber() << ",\n"; |
| 183 | return 2; |
| 184 | |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 185 | case MatcherNode::CheckPatternPredicate: { |
| 186 | StringRef Pred = cast<CheckPatternPredicateMatcherNode>(N)->getPredicate(); |
| 187 | OS << "OPC_CheckPatternPredicate, " << getPatternPredicate(Pred) << ','; |
| 188 | OS.PadToColumn(CommentIndent) << "// " << Pred << '\n'; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 189 | return 2; |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 190 | } |
| 191 | case MatcherNode::CheckPredicate: { |
| 192 | StringRef Pred = cast<CheckPredicateMatcherNode>(N)->getPredicateName(); |
| 193 | OS << "OPC_CheckPredicate, " << getNodePredicate(Pred) << ','; |
| 194 | OS.PadToColumn(CommentIndent) << "// " << Pred << '\n'; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 195 | return 2; |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 196 | } |
| 197 | |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 198 | case MatcherNode::CheckOpcode: |
| 199 | OS << "OPC_CheckOpcode, " |
| 200 | << cast<CheckOpcodeMatcherNode>(N)->getOpcodeName() << ",\n"; |
| 201 | return 2; |
| 202 | |
Chris Lattner | 12a667c | 2010-02-22 22:30:37 +0000 | [diff] [blame] | 203 | case MatcherNode::CheckMultiOpcode: { |
| 204 | const CheckMultiOpcodeMatcherNode *CMO=cast<CheckMultiOpcodeMatcherNode>(N); |
| 205 | OS << "OPC_CheckMultiOpcode, " << CMO->getNumOpcodeNames() << ", "; |
| 206 | for (unsigned i = 0, e = CMO->getNumOpcodeNames(); i != e; ++i) |
| 207 | OS << CMO->getOpcodeName(i) << ", "; |
| 208 | OS << '\n'; |
| 209 | return 2 + CMO->getNumOpcodeNames(); |
| 210 | } |
| 211 | |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 212 | case MatcherNode::CheckType: |
| 213 | OS << "OPC_CheckType, " |
| 214 | << getEnumName(cast<CheckTypeMatcherNode>(N)->getType()) << ",\n"; |
| 215 | return 2; |
| 216 | |
| 217 | case MatcherNode::CheckInteger: { |
| 218 | int64_t Val = cast<CheckIntegerMatcherNode>(N)->getValue(); |
| 219 | OS << "OPC_CheckInteger" << ClassifyInt(Val) << ", "; |
| 220 | return EmitInt(Val, OS)+1; |
| 221 | } |
| 222 | case MatcherNode::CheckCondCode: |
| 223 | OS << "OPC_CheckCondCode, ISD::" |
| 224 | << cast<CheckCondCodeMatcherNode>(N)->getCondCodeName() << ",\n"; |
| 225 | return 2; |
| 226 | |
| 227 | case MatcherNode::CheckValueType: |
| 228 | OS << "OPC_CheckValueType, MVT::" |
| 229 | << cast<CheckValueTypeMatcherNode>(N)->getTypeName() << ",\n"; |
| 230 | return 2; |
| 231 | |
Chris Lattner | 5be6e59 | 2010-02-17 00:39:26 +0000 | [diff] [blame] | 232 | case MatcherNode::CheckComplexPat: { |
| 233 | const ComplexPattern &Pattern = |
| 234 | cast<CheckComplexPatMatcherNode>(N)->getPattern(); |
| 235 | OS << "OPC_CheckComplexPat, " << getComplexPat(Pattern) << ','; |
Chris Lattner | 781f359 | 2010-02-17 06:47:35 +0000 | [diff] [blame] | 236 | OS.PadToColumn(CommentIndent) << "// " << Pattern.getSelectFunc(); |
| 237 | OS << ": " << Pattern.getNumOperands() << " operands"; |
| 238 | if (Pattern.hasProperty(SDNPHasChain)) |
| 239 | OS << " + chain result and input"; |
| 240 | OS << '\n'; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 241 | return 2; |
Chris Lattner | 5be6e59 | 2010-02-17 00:39:26 +0000 | [diff] [blame] | 242 | } |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 243 | |
| 244 | case MatcherNode::CheckAndImm: { |
| 245 | int64_t Val = cast<CheckAndImmMatcherNode>(N)->getValue(); |
| 246 | OS << "OPC_CheckAndImm" << ClassifyInt(Val) << ", "; |
| 247 | return EmitInt(Val, OS)+1; |
| 248 | } |
| 249 | |
| 250 | case MatcherNode::CheckOrImm: { |
| 251 | int64_t Val = cast<CheckOrImmMatcherNode>(N)->getValue(); |
| 252 | OS << "OPC_CheckOrImm" << ClassifyInt(Val) << ", "; |
| 253 | return EmitInt(Val, OS)+1; |
| 254 | } |
Chris Lattner | 21390d7 | 2010-02-16 19:15:55 +0000 | [diff] [blame] | 255 | case MatcherNode::CheckFoldableChainNode: |
| 256 | OS << "OPC_CheckFoldableChainNode,\n"; |
Chris Lattner | e39650a | 2010-02-16 06:10:58 +0000 | [diff] [blame] | 257 | return 1; |
Chris Lattner | 9a747f1 | 2010-02-17 06:23:39 +0000 | [diff] [blame] | 258 | case MatcherNode::CheckChainCompatible: |
| 259 | OS << "OPC_CheckChainCompatible, " |
| 260 | << cast<CheckChainCompatibleMatcherNode>(N)->getPreviousOp() << ",\n"; |
| 261 | return 2; |
Chris Lattner | 845c042 | 2010-02-18 22:03:03 +0000 | [diff] [blame] | 262 | |
Chris Lattner | 906b499 | 2010-02-19 07:49:56 +0000 | [diff] [blame] | 263 | case MatcherNode::EmitInteger: { |
| 264 | int64_t Val = cast<EmitIntegerMatcherNode>(N)->getValue(); |
| 265 | OS << "OPC_EmitInteger" << ClassifyInt(Val) << ", " |
| 266 | << getEnumName(cast<EmitIntegerMatcherNode>(N)->getVT()) << ", "; |
| 267 | return EmitInt(Val, OS)+2; |
| 268 | } |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 269 | case MatcherNode::EmitStringInteger: { |
| 270 | const std::string &Val = cast<EmitStringIntegerMatcherNode>(N)->getValue(); |
| 271 | // These should always fit into one byte. |
| 272 | OS << "OPC_EmitInteger1, " |
| 273 | << getEnumName(cast<EmitStringIntegerMatcherNode>(N)->getVT()) << ", " |
| 274 | << Val << ",\n"; |
| 275 | return 3; |
| 276 | } |
Chris Lattner | 906b499 | 2010-02-19 07:49:56 +0000 | [diff] [blame] | 277 | |
Chris Lattner | 845c042 | 2010-02-18 22:03:03 +0000 | [diff] [blame] | 278 | case MatcherNode::EmitRegister: |
Chris Lattner | 906b499 | 2010-02-19 07:49:56 +0000 | [diff] [blame] | 279 | OS << "OPC_EmitRegister, " |
| 280 | << getEnumName(cast<EmitRegisterMatcherNode>(N)->getVT()) << ", "; |
| 281 | if (Record *R = cast<EmitRegisterMatcherNode>(N)->getReg()) |
| 282 | OS << getQualifiedName(R) << ",\n"; |
| 283 | else |
| 284 | OS << "0 /*zero_reg*/,\n"; |
| 285 | return 3; |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 286 | |
| 287 | case MatcherNode::EmitConvertToTarget: |
| 288 | OS << "OPC_EmitConvertToTarget, " |
| 289 | << cast<EmitConvertToTargetMatcherNode>(N)->getSlot() << ",\n"; |
| 290 | return 2; |
| 291 | |
| 292 | case MatcherNode::EmitMergeInputChains: { |
| 293 | const EmitMergeInputChainsMatcherNode *MN = |
| 294 | cast<EmitMergeInputChainsMatcherNode>(N); |
| 295 | OS << "OPC_EmitMergeInputChains, " << MN->getNumNodes() << ", "; |
| 296 | for (unsigned i = 0, e = MN->getNumNodes(); i != e; ++i) |
| 297 | OS << MN->getNode(i) << ", "; |
| 298 | OS << '\n'; |
| 299 | return 2+MN->getNumNodes(); |
| 300 | } |
| 301 | case MatcherNode::EmitCopyToReg: |
| 302 | OS << "OPC_EmitCopyToReg, " |
| 303 | << cast<EmitCopyToRegMatcherNode>(N)->getSrcSlot() << ", " |
| 304 | << getQualifiedName(cast<EmitCopyToRegMatcherNode>(N)->getDestPhysReg()) |
| 305 | << ",\n"; |
| 306 | return 3; |
| 307 | case MatcherNode::EmitNodeXForm: { |
| 308 | const EmitNodeXFormMatcherNode *XF = cast<EmitNodeXFormMatcherNode>(N); |
| 309 | OS << "OPC_EmitNodeXForm, " << getNodeXFormID(XF->getNodeXForm()) << ", " |
| 310 | << XF->getSlot() << ','; |
| 311 | OS.PadToColumn(CommentIndent) << "// "<<XF->getNodeXForm()->getName()<<'\n'; |
| 312 | return 3; |
| 313 | } |
| 314 | |
| 315 | case MatcherNode::EmitNode: { |
| 316 | const EmitNodeMatcherNode *EN = cast<EmitNodeMatcherNode>(N); |
| 317 | OS << "OPC_EmitNode, TARGET_OPCODE(" << EN->getOpcodeName() << "), 0"; |
| 318 | |
| 319 | if (EN->hasChain()) OS << "|OPFL_Chain"; |
| 320 | if (EN->hasFlag()) OS << "|OPFL_Flag"; |
| 321 | if (EN->hasMemRefs()) OS << "|OPFL_MemRefs"; |
| 322 | if (EN->getNumFixedArityOperands() != -1) |
| 323 | OS << "|OPFL_Variadic" << EN->getNumFixedArityOperands(); |
| 324 | OS << ",\n"; |
| 325 | |
| 326 | OS.PadToColumn(Indent*2+4) << EN->getNumVTs() << "/*#VTs*/, "; |
| 327 | for (unsigned i = 0, e = EN->getNumVTs(); i != e; ++i) |
| 328 | OS << getEnumName(EN->getVT(i)) << ", "; |
| 329 | |
| 330 | OS << EN->getNumOperands() << "/*#Ops*/, "; |
Chris Lattner | 5007e1e | 2010-02-23 00:59:59 +0000 | [diff] [blame] | 331 | unsigned NumOperandBytes = 0; |
| 332 | for (unsigned i = 0, e = EN->getNumOperands(); i != e; ++i) { |
| 333 | // We emit the operand numbers in VBR encoded format, in case the number |
| 334 | // is too large to represent with a byte. |
| 335 | NumOperandBytes += EmitVBRValue(EN->getOperand(i), OS); |
| 336 | } |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 337 | OS << '\n'; |
Chris Lattner | 5007e1e | 2010-02-23 00:59:59 +0000 | [diff] [blame] | 338 | return 6+EN->getNumVTs()+NumOperandBytes; |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 339 | } |
Chris Lattner | 02f7358 | 2010-02-24 05:33:42 +0000 | [diff] [blame] | 340 | case MatcherNode::MarkFlagResults: { |
| 341 | const MarkFlagResultsMatcherNode *CFR = cast<MarkFlagResultsMatcherNode>(N); |
| 342 | OS << "OPC_MarkFlagResults, " << CFR->getNumNodes() << ", "; |
| 343 | unsigned NumOperandBytes = 0; |
| 344 | for (unsigned i = 0, e = CFR->getNumNodes(); i != e; ++i) |
| 345 | NumOperandBytes += EmitVBRValue(CFR->getNode(i), OS); |
| 346 | OS << '\n'; |
| 347 | return 2+NumOperandBytes; |
| 348 | } |
Chris Lattner | 77f2e27 | 2010-02-21 06:03:07 +0000 | [diff] [blame] | 349 | case MatcherNode::CompleteMatch: { |
| 350 | const CompleteMatchMatcherNode *CM = cast<CompleteMatchMatcherNode>(N); |
| 351 | OS << "OPC_CompleteMatch, " << CM->getNumResults() << ", "; |
Chris Lattner | 5007e1e | 2010-02-23 00:59:59 +0000 | [diff] [blame] | 352 | unsigned NumResultBytes = 0; |
Chris Lattner | 77f2e27 | 2010-02-21 06:03:07 +0000 | [diff] [blame] | 353 | for (unsigned i = 0, e = CM->getNumResults(); i != e; ++i) |
Chris Lattner | 5007e1e | 2010-02-23 00:59:59 +0000 | [diff] [blame] | 354 | NumResultBytes += EmitVBRValue(CM->getResult(i), OS); |
Chris Lattner | 77f2e27 | 2010-02-21 06:03:07 +0000 | [diff] [blame] | 355 | OS << '\n'; |
| 356 | OS.PadToColumn(Indent*2) << "// Src: " |
| 357 | << *CM->getPattern().getSrcPattern() << '\n'; |
| 358 | OS.PadToColumn(Indent*2) << "// Dst: " |
| 359 | << *CM->getPattern().getDstPattern() << '\n'; |
Chris Lattner | 5007e1e | 2010-02-23 00:59:59 +0000 | [diff] [blame] | 360 | return 2 + NumResultBytes; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 361 | } |
Chris Lattner | 77f2e27 | 2010-02-21 06:03:07 +0000 | [diff] [blame] | 362 | } |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 363 | assert(0 && "Unreachable"); |
| 364 | return 0; |
| 365 | } |
| 366 | |
Chris Lattner | bd8227f | 2010-02-18 02:53:41 +0000 | [diff] [blame] | 367 | /// EmitMatcherList - Emit the bytes for the specified matcher subtree. |
Chris Lattner | e02ea54 | 2010-02-16 06:52:01 +0000 | [diff] [blame] | 368 | unsigned MatcherTableEmitter:: |
Chris Lattner | 8fbad24 | 2010-02-21 07:16:41 +0000 | [diff] [blame] | 369 | EmitMatcherList(const MatcherNode *N, unsigned Indent, unsigned CurrentIdx, |
Chris Lattner | 984e188 | 2010-02-21 06:30:04 +0000 | [diff] [blame] | 370 | formatted_raw_ostream &OS) { |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 371 | unsigned Size = 0; |
Chris Lattner | 8ef9c79 | 2010-02-18 02:49:24 +0000 | [diff] [blame] | 372 | while (N) { |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 373 | // Push is a special case since it is binary. |
| 374 | if (const PushMatcherNode *PMN = dyn_cast<PushMatcherNode>(N)) { |
| 375 | // We need to encode the child and the offset of the failure code before |
| 376 | // emitting either of them. Handle this by buffering the output into a |
| 377 | // string while we get the size. |
| 378 | SmallString<128> TmpBuf; |
Chris Lattner | bd8227f | 2010-02-18 02:53:41 +0000 | [diff] [blame] | 379 | unsigned NextSize; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 380 | { |
| 381 | raw_svector_ostream OS(TmpBuf); |
| 382 | formatted_raw_ostream FOS(OS); |
Chris Lattner | bd8227f | 2010-02-18 02:53:41 +0000 | [diff] [blame] | 383 | NextSize = EmitMatcherList(cast<PushMatcherNode>(N)->getNext(), |
Chris Lattner | 8fbad24 | 2010-02-21 07:16:41 +0000 | [diff] [blame] | 384 | Indent+1, CurrentIdx+2, FOS); |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 385 | } |
Chris Lattner | 3e22f2d | 2010-02-22 23:55:39 +0000 | [diff] [blame] | 386 | |
| 387 | // In the unlikely event that we have something too big to emit with a |
| 388 | // one byte offset, regenerate it with a two-byte one. |
Chris Lattner | bd8227f | 2010-02-18 02:53:41 +0000 | [diff] [blame] | 389 | if (NextSize > 255) { |
Chris Lattner | 3e22f2d | 2010-02-22 23:55:39 +0000 | [diff] [blame] | 390 | TmpBuf.clear(); |
| 391 | raw_svector_ostream OS(TmpBuf); |
| 392 | formatted_raw_ostream FOS(OS); |
| 393 | NextSize = EmitMatcherList(cast<PushMatcherNode>(N)->getNext(), |
| 394 | Indent+1, CurrentIdx+3, FOS); |
| 395 | if (NextSize > 65535) { |
| 396 | errs() << |
| 397 | "Tblgen internal error: can't handle pattern this complex yet\n"; |
| 398 | exit(1); |
| 399 | } |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 400 | } |
| 401 | |
Chris Lattner | 8fbad24 | 2010-02-21 07:16:41 +0000 | [diff] [blame] | 402 | OS << "/*" << CurrentIdx << "*/"; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 403 | OS.PadToColumn(Indent*2); |
Chris Lattner | 3e22f2d | 2010-02-22 23:55:39 +0000 | [diff] [blame] | 404 | |
| 405 | if (NextSize < 256) |
| 406 | OS << "OPC_Push, " << NextSize << ",\n"; |
| 407 | else |
| 408 | OS << "OPC_Push2, " << (NextSize&255) << ", " << (NextSize>>8) << ",\n"; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 409 | OS << TmpBuf.str(); |
| 410 | |
Chris Lattner | 8fbad24 | 2010-02-21 07:16:41 +0000 | [diff] [blame] | 411 | Size += 2+NextSize; |
| 412 | CurrentIdx += 2+NextSize; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 413 | N = PMN->getFailure(); |
| 414 | continue; |
| 415 | } |
| 416 | |
Chris Lattner | 8fbad24 | 2010-02-21 07:16:41 +0000 | [diff] [blame] | 417 | OS << "/*" << CurrentIdx << "*/"; |
| 418 | unsigned MatcherSize = EmitMatcher(N, Indent, OS); |
| 419 | Size += MatcherSize; |
| 420 | CurrentIdx += MatcherSize; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 421 | |
Chris Lattner | bd8227f | 2010-02-18 02:53:41 +0000 | [diff] [blame] | 422 | // If there are other nodes in this list, iterate to them, otherwise we're |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 423 | // done. |
Chris Lattner | bd8227f | 2010-02-18 02:53:41 +0000 | [diff] [blame] | 424 | N = N->getNext(); |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 425 | } |
Chris Lattner | 8ef9c79 | 2010-02-18 02:49:24 +0000 | [diff] [blame] | 426 | return Size; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 427 | } |
| 428 | |
Chris Lattner | 984e188 | 2010-02-21 06:30:04 +0000 | [diff] [blame] | 429 | void MatcherTableEmitter::EmitPredicateFunctions(formatted_raw_ostream &OS) { |
Chris Lattner | b49985a | 2010-02-18 06:47:49 +0000 | [diff] [blame] | 430 | // FIXME: Don't build off the DAGISelEmitter's predicates, emit them directly |
| 431 | // here into the case stmts. |
| 432 | |
Chris Lattner | e609a51 | 2010-02-17 00:31:50 +0000 | [diff] [blame] | 433 | // Emit pattern predicates. |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 434 | OS << "bool CheckPatternPredicate(unsigned PredNo) const {\n"; |
| 435 | OS << " switch (PredNo) {\n"; |
| 436 | OS << " default: assert(0 && \"Invalid predicate in table?\");\n"; |
| 437 | for (unsigned i = 0, e = PatternPredicates.size(); i != e; ++i) |
| 438 | OS << " case " << i << ": return " << PatternPredicates[i] << ";\n"; |
| 439 | OS << " }\n"; |
| 440 | OS << "}\n\n"; |
| 441 | |
Chris Lattner | e609a51 | 2010-02-17 00:31:50 +0000 | [diff] [blame] | 442 | // Emit Node predicates. |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 443 | OS << "bool CheckNodePredicate(SDNode *N, unsigned PredNo) const {\n"; |
| 444 | OS << " switch (PredNo) {\n"; |
| 445 | OS << " default: assert(0 && \"Invalid predicate in table?\");\n"; |
| 446 | for (unsigned i = 0, e = NodePredicates.size(); i != e; ++i) |
| 447 | OS << " case " << i << ": return " << NodePredicates[i] << "(N);\n"; |
| 448 | OS << " }\n"; |
| 449 | OS << "}\n\n"; |
Chris Lattner | e609a51 | 2010-02-17 00:31:50 +0000 | [diff] [blame] | 450 | |
| 451 | // Emit CompletePattern matchers. |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 452 | // FIXME: This should be const. |
Chris Lattner | e609a51 | 2010-02-17 00:31:50 +0000 | [diff] [blame] | 453 | OS << "bool CheckComplexPattern(SDNode *Root, SDValue N,\n"; |
| 454 | OS << " unsigned PatternNo, SmallVectorImpl<SDValue> &Result) {\n"; |
| 455 | OS << " switch (PatternNo) {\n"; |
| 456 | OS << " default: assert(0 && \"Invalid pattern # in table?\");\n"; |
| 457 | for (unsigned i = 0, e = ComplexPatterns.size(); i != e; ++i) { |
| 458 | const ComplexPattern &P = *ComplexPatterns[i]; |
| 459 | unsigned NumOps = P.getNumOperands(); |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 460 | |
Chris Lattner | e609a51 | 2010-02-17 00:31:50 +0000 | [diff] [blame] | 461 | if (P.hasProperty(SDNPHasChain)) |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 462 | ++NumOps; // Get the chained node too. |
| 463 | |
Chris Lattner | e609a51 | 2010-02-17 00:31:50 +0000 | [diff] [blame] | 464 | OS << " case " << i << ":\n"; |
| 465 | OS << " Result.resize(Result.size()+" << NumOps << ");\n"; |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 466 | OS << " return " << P.getSelectFunc(); |
| 467 | |
| 468 | // FIXME: Temporary hack until old isel dies. |
| 469 | if (P.hasProperty(SDNPHasChain)) |
| 470 | OS << "XXX"; |
| 471 | |
| 472 | OS << "(Root, N"; |
Chris Lattner | e609a51 | 2010-02-17 00:31:50 +0000 | [diff] [blame] | 473 | for (unsigned i = 0; i != NumOps; ++i) |
| 474 | OS << ", Result[Result.size()-" << (NumOps-i) << ']'; |
| 475 | OS << ");\n"; |
| 476 | } |
| 477 | OS << " }\n"; |
| 478 | OS << "}\n\n"; |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 479 | |
| 480 | // Emit SDNodeXForm handlers. |
| 481 | // FIXME: This should be const. |
| 482 | OS << "SDValue RunSDNodeXForm(SDValue V, unsigned XFormNo) {\n"; |
| 483 | OS << " switch (XFormNo) {\n"; |
| 484 | OS << " default: assert(0 && \"Invalid xform # in table?\");\n"; |
| 485 | |
| 486 | // FIXME: The node xform could take SDValue's instead of SDNode*'s. |
| 487 | for (unsigned i = 0, e = NodeXForms.size(); i != e; ++i) |
| 488 | OS << " case " << i << ": return Transform_" << NodeXForms[i]->getName() |
| 489 | << "(V.getNode());\n"; |
| 490 | OS << " }\n"; |
| 491 | OS << "}\n\n"; |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 492 | } |
| 493 | |
| 494 | |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 495 | void llvm::EmitMatcherTable(const MatcherNode *Matcher, raw_ostream &O) { |
| 496 | formatted_raw_ostream OS(O); |
| 497 | |
| 498 | OS << "// The main instruction selector code.\n"; |
| 499 | OS << "SDNode *SelectCode2(SDNode *N) {\n"; |
| 500 | |
Chris Lattner | 984e188 | 2010-02-21 06:30:04 +0000 | [diff] [blame] | 501 | MatcherTableEmitter MatcherEmitter; |
Chris Lattner | e02ea54 | 2010-02-16 06:52:01 +0000 | [diff] [blame] | 502 | |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 503 | OS << " // Opcodes are emitted as 2 bytes, TARGET_OPCODE handles this.\n"; |
| 504 | OS << " #define TARGET_OPCODE(X) X & 255, unsigned(X) >> 8\n"; |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 505 | OS << " static const unsigned char MatcherTable[] = {\n"; |
Chris Lattner | 8fbad24 | 2010-02-21 07:16:41 +0000 | [diff] [blame] | 506 | unsigned TotalSize = MatcherEmitter.EmitMatcherList(Matcher, 5, 0, OS); |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 507 | OS << " 0\n }; // Total Array size is " << (TotalSize+1) << " bytes\n\n"; |
Chris Lattner | 8e946be | 2010-02-21 03:22:59 +0000 | [diff] [blame] | 508 | OS << " #undef TARGET_OPCODE\n"; |
Chris Lattner | e02ea54 | 2010-02-16 06:52:01 +0000 | [diff] [blame] | 509 | OS << " return SelectCodeCommon(N, MatcherTable,sizeof(MatcherTable));\n}\n"; |
Chris Lattner | 050a03d | 2010-02-16 07:21:10 +0000 | [diff] [blame] | 510 | OS << "\n"; |
| 511 | |
| 512 | // Next up, emit the function for node and pattern predicates: |
Chris Lattner | 984e188 | 2010-02-21 06:30:04 +0000 | [diff] [blame] | 513 | MatcherEmitter.EmitPredicateFunctions(OS); |
Chris Lattner | da272d1 | 2010-02-15 08:04:42 +0000 | [diff] [blame] | 514 | } |