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