DAGISelMatcherEmitter.cpp revision c78f2a39945339752a163949a2d7c27f28635d99
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" 16#include "Record.h" 17#include "llvm/ADT/DenseMap.h" 18#include "llvm/ADT/SmallString.h" 19#include "llvm/ADT/StringMap.h" 20#include "llvm/Support/FormattedStream.h" 21using namespace llvm; 22 23enum { 24 CommentIndent = 30 25}; 26 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. 29static 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. 37static 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)) { 41 OS << '\n'; 42 return BytesEmitted; 43 } 44 45 OS << (int)(unsigned char)(Val >> 8) << ", "; 46 ++BytesEmitted; 47 48 if (Val != int16_t(Val)) { 49 OS << (int)(unsigned char)(Val >> 16) << ", " 50 << (int)(unsigned char)(Val >> 24) << ", "; 51 BytesEmitted += 2; 52 53 if (Val != int32_t(Val)) { 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) << ", "; 58 BytesEmitted += 4; 59 } 60 } 61 62 OS.PadToColumn(CommentIndent) << "// " << Val << " aka 0x"; 63 OS.write_hex(Val) << '\n'; 64 return BytesEmitted; 65} 66 67namespace { 68class MatcherTableEmitter { 69 StringMap<unsigned> NodePredicateMap, PatternPredicateMap; 70 std::vector<std::string> NodePredicates, PatternPredicates; 71 72 DenseMap<const ComplexPattern*, unsigned> ComplexPatternMap; 73 std::vector<const ComplexPattern*> ComplexPatterns; 74 75 76 DenseMap<Record*, unsigned> NodeXFormMap; 77 std::vector<const Record*> NodeXForms; 78 79 // Per opcode frequence count. 80 std::vector<unsigned> Histogram; 81public: 82 MatcherTableEmitter() {} 83 84 unsigned EmitMatcherList(const Matcher *N, unsigned Indent, 85 unsigned StartIdx, formatted_raw_ostream &OS); 86 87 void EmitPredicateFunctions(formatted_raw_ostream &OS); 88 89 void EmitHistogram(formatted_raw_ostream &OS); 90private: 91 unsigned EmitMatcher(const Matcher *N, unsigned Indent, unsigned CurrentIdx, 92 formatted_raw_ostream &OS); 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 } 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 } 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 129}; 130} // end anonymous namespace. 131 132static unsigned GetVBRSize(unsigned Val) { 133 if (Val <= 127) return 1; 134 135 unsigned NumBytes = 0; 136 while (Val >= 128) { 137 Val >>= 7; 138 ++NumBytes; 139 } 140 return NumBytes+1; 141} 142 143/// EmitVBRValue - Emit the specified value as a VBR, returning the number of 144/// bytes emitted. 145static unsigned EmitVBRValue(unsigned Val, raw_ostream &OS) { 146 if (Val <= 127) { 147 OS << Val << ", "; 148 return 1; 149 } 150 151 unsigned InVal = Val; 152 unsigned NumBytes = 0; 153 while (Val >= 128) { 154 OS << (Val&127) << "|128,"; 155 Val >>= 7; 156 ++NumBytes; 157 } 158 OS << Val << "/*" << InVal << "*/, "; 159 return NumBytes+1; 160} 161 162/// EmitMatcherOpcodes - Emit bytes for the specified matcher and return 163/// the number of bytes emitted. 164unsigned MatcherTableEmitter:: 165EmitMatcher(const Matcher *N, unsigned Indent, unsigned CurrentIdx, 166 formatted_raw_ostream &OS) { 167 OS.PadToColumn(Indent*2); 168 169 switch (N->getKind()) { 170 case Matcher::Scope: { 171 const ScopeMatcher *SM = cast<ScopeMatcher>(N); 172 assert(SM->getNext() == 0 && "Shouldn't have next after scope"); 173 174 unsigned StartIdx = CurrentIdx; 175 176 // Emit all of the children. 177 for (unsigned i = 0, e = SM->getNumChildren(); i != e; ++i) { 178 if (i == 0) { 179 OS << "OPC_Scope, "; 180 ++CurrentIdx; 181 } else { 182 OS << "/*" << CurrentIdx << "*/"; 183 OS.PadToColumn(Indent*2) << "/*Scope*/ "; 184 } 185 186 // We need to encode the child and the offset of the failure code before 187 // emitting either of them. Handle this by buffering the output into a 188 // string while we get the size. Unfortunately, the offset of the 189 // children depends on the VBR size of the child, so for large children we 190 // have to iterate a bit. 191 SmallString<128> TmpBuf; 192 unsigned ChildSize = 0; 193 unsigned VBRSize = 0; 194 do { 195 VBRSize = GetVBRSize(ChildSize); 196 197 TmpBuf.clear(); 198 raw_svector_ostream OS(TmpBuf); 199 formatted_raw_ostream FOS(OS); 200 ChildSize = EmitMatcherList(cast<ScopeMatcher>(N)->getChild(i), 201 Indent+1, CurrentIdx+VBRSize, FOS); 202 } while (GetVBRSize(ChildSize) != VBRSize); 203 204 assert(ChildSize != 0 && "Should not have a zero-sized child!"); 205 206 CurrentIdx += EmitVBRValue(ChildSize, OS); 207 OS << "/*->" << CurrentIdx+ChildSize << "*/"; 208 209 if (i == 0) 210 OS.PadToColumn(CommentIndent) << "// " << SM->getNumChildren() 211 << " children in Scope"; 212 213 OS << '\n' << TmpBuf.str(); 214 CurrentIdx += ChildSize; 215 } 216 217 // Emit a zero as a sentinel indicating end of 'Scope'. 218 OS << "/*" << CurrentIdx << "*/"; 219 OS.PadToColumn(Indent*2) << "0, /*End of Scope*/\n"; 220 return CurrentIdx - StartIdx + 1; 221 } 222 223 case Matcher::RecordNode: 224 OS << "OPC_RecordNode,"; 225 OS.PadToColumn(CommentIndent) << "// " 226 << cast<RecordMatcher>(N)->getWhatFor() << '\n'; 227 return 1; 228 229 case Matcher::RecordChild: 230 OS << "OPC_RecordChild" << cast<RecordChildMatcher>(N)->getChildNo() 231 << ','; 232 OS.PadToColumn(CommentIndent) << "// " 233 << cast<RecordChildMatcher>(N)->getWhatFor() << '\n'; 234 return 1; 235 236 case Matcher::RecordMemRef: 237 OS << "OPC_RecordMemRef,\n"; 238 return 1; 239 240 case Matcher::CaptureFlagInput: 241 OS << "OPC_CaptureFlagInput,\n"; 242 return 1; 243 244 case Matcher::MoveChild: 245 OS << "OPC_MoveChild, " << cast<MoveChildMatcher>(N)->getChildNo() << ",\n"; 246 return 2; 247 248 case Matcher::MoveParent: 249 OS << "OPC_MoveParent,\n"; 250 return 1; 251 252 case Matcher::CheckSame: 253 OS << "OPC_CheckSame, " 254 << cast<CheckSameMatcher>(N)->getMatchNumber() << ",\n"; 255 return 2; 256 257 case Matcher::CheckPatternPredicate: { 258 StringRef Pred = cast<CheckPatternPredicateMatcher>(N)->getPredicate(); 259 OS << "OPC_CheckPatternPredicate, " << getPatternPredicate(Pred) << ','; 260 OS.PadToColumn(CommentIndent) << "// " << Pred << '\n'; 261 return 2; 262 } 263 case Matcher::CheckPredicate: { 264 StringRef Pred = cast<CheckPredicateMatcher>(N)->getPredicateName(); 265 OS << "OPC_CheckPredicate, " << getNodePredicate(Pred) << ','; 266 OS.PadToColumn(CommentIndent) << "// " << Pred << '\n'; 267 return 2; 268 } 269 270 case Matcher::CheckOpcode: 271 OS << "OPC_CheckOpcode, " 272 << cast<CheckOpcodeMatcher>(N)->getOpcode().getEnumName() << ",\n"; 273 return 2; 274 275 case Matcher::CheckMultiOpcode: { 276 const CheckMultiOpcodeMatcher *CMO = cast<CheckMultiOpcodeMatcher>(N); 277 OS << "OPC_CheckMultiOpcode, " << CMO->getNumOpcodes() << ", "; 278 for (unsigned i = 0, e = CMO->getNumOpcodes(); i != e; ++i) 279 OS << CMO->getOpcode(i).getEnumName() << ", "; 280 OS << '\n'; 281 return 2 + CMO->getNumOpcodes(); 282 } 283 284 case Matcher::CheckType: 285 OS << "OPC_CheckType, " 286 << getEnumName(cast<CheckTypeMatcher>(N)->getType()) << ",\n"; 287 return 2; 288 case Matcher::CheckChildType: 289 OS << "OPC_CheckChild" 290 << cast<CheckChildTypeMatcher>(N)->getChildNo() << "Type, " 291 << getEnumName(cast<CheckChildTypeMatcher>(N)->getType()) << ",\n"; 292 return 2; 293 294 case Matcher::CheckInteger: { 295 int64_t Val = cast<CheckIntegerMatcher>(N)->getValue(); 296 OS << "OPC_CheckInteger" << ClassifyInt(Val) << ", "; 297 return EmitInt(Val, OS)+1; 298 } 299 case Matcher::CheckCondCode: 300 OS << "OPC_CheckCondCode, ISD::" 301 << cast<CheckCondCodeMatcher>(N)->getCondCodeName() << ",\n"; 302 return 2; 303 304 case Matcher::CheckValueType: 305 OS << "OPC_CheckValueType, MVT::" 306 << cast<CheckValueTypeMatcher>(N)->getTypeName() << ",\n"; 307 return 2; 308 309 case Matcher::CheckComplexPat: { 310 const ComplexPattern &Pattern = 311 cast<CheckComplexPatMatcher>(N)->getPattern(); 312 OS << "OPC_CheckComplexPat, " << getComplexPat(Pattern) << ','; 313 OS.PadToColumn(CommentIndent) << "// " << Pattern.getSelectFunc(); 314 OS << ": " << Pattern.getNumOperands() << " operands"; 315 if (Pattern.hasProperty(SDNPHasChain)) 316 OS << " + chain result and input"; 317 OS << '\n'; 318 return 2; 319 } 320 321 case Matcher::CheckAndImm: { 322 int64_t Val = cast<CheckAndImmMatcher>(N)->getValue(); 323 OS << "OPC_CheckAndImm" << ClassifyInt(Val) << ", "; 324 return EmitInt(Val, OS)+1; 325 } 326 327 case Matcher::CheckOrImm: { 328 int64_t Val = cast<CheckOrImmMatcher>(N)->getValue(); 329 OS << "OPC_CheckOrImm" << ClassifyInt(Val) << ", "; 330 return EmitInt(Val, OS)+1; 331 } 332 case Matcher::CheckFoldableChainNode: 333 OS << "OPC_CheckFoldableChainNode,\n"; 334 return 1; 335 case Matcher::CheckChainCompatible: 336 OS << "OPC_CheckChainCompatible, " 337 << cast<CheckChainCompatibleMatcher>(N)->getPreviousOp() << ",\n"; 338 return 2; 339 340 case Matcher::EmitInteger: { 341 int64_t Val = cast<EmitIntegerMatcher>(N)->getValue(); 342 OS << "OPC_EmitInteger" << ClassifyInt(Val) << ", " 343 << getEnumName(cast<EmitIntegerMatcher>(N)->getVT()) << ", "; 344 return EmitInt(Val, OS)+2; 345 } 346 case Matcher::EmitStringInteger: { 347 const std::string &Val = cast<EmitStringIntegerMatcher>(N)->getValue(); 348 // These should always fit into one byte. 349 OS << "OPC_EmitInteger1, " 350 << getEnumName(cast<EmitStringIntegerMatcher>(N)->getVT()) << ", " 351 << Val << ",\n"; 352 return 3; 353 } 354 355 case Matcher::EmitRegister: 356 OS << "OPC_EmitRegister, " 357 << getEnumName(cast<EmitRegisterMatcher>(N)->getVT()) << ", "; 358 if (Record *R = cast<EmitRegisterMatcher>(N)->getReg()) 359 OS << getQualifiedName(R) << ",\n"; 360 else 361 OS << "0 /*zero_reg*/,\n"; 362 return 3; 363 364 case Matcher::EmitConvertToTarget: 365 OS << "OPC_EmitConvertToTarget, " 366 << cast<EmitConvertToTargetMatcher>(N)->getSlot() << ",\n"; 367 return 2; 368 369 case Matcher::EmitMergeInputChains: { 370 const EmitMergeInputChainsMatcher *MN = 371 cast<EmitMergeInputChainsMatcher>(N); 372 OS << "OPC_EmitMergeInputChains, " << MN->getNumNodes() << ", "; 373 for (unsigned i = 0, e = MN->getNumNodes(); i != e; ++i) 374 OS << MN->getNode(i) << ", "; 375 OS << '\n'; 376 return 2+MN->getNumNodes(); 377 } 378 case Matcher::EmitCopyToReg: 379 OS << "OPC_EmitCopyToReg, " 380 << cast<EmitCopyToRegMatcher>(N)->getSrcSlot() << ", " 381 << getQualifiedName(cast<EmitCopyToRegMatcher>(N)->getDestPhysReg()) 382 << ",\n"; 383 return 3; 384 case Matcher::EmitNodeXForm: { 385 const EmitNodeXFormMatcher *XF = cast<EmitNodeXFormMatcher>(N); 386 OS << "OPC_EmitNodeXForm, " << getNodeXFormID(XF->getNodeXForm()) << ", " 387 << XF->getSlot() << ','; 388 OS.PadToColumn(CommentIndent) << "// "<<XF->getNodeXForm()->getName()<<'\n'; 389 return 3; 390 } 391 392 case Matcher::EmitNode: 393 case Matcher::SelectNodeTo: { 394 const EmitNodeMatcherCommon *EN = cast<EmitNodeMatcherCommon>(N); 395 OS << (isa<EmitNodeMatcher>(EN) ? "OPC_EmitNode" : "OPC_SelectNodeTo"); 396 OS << ", TARGET_OPCODE(" << EN->getOpcodeName() << "), 0"; 397 398 if (EN->hasChain()) OS << "|OPFL_Chain"; 399 if (EN->hasFlag()) OS << "|OPFL_Flag"; 400 if (EN->hasMemRefs()) OS << "|OPFL_MemRefs"; 401 if (EN->getNumFixedArityOperands() != -1) 402 OS << "|OPFL_Variadic" << EN->getNumFixedArityOperands(); 403 OS << ",\n"; 404 405 OS.PadToColumn(Indent*2+4) << EN->getNumVTs() << "/*#VTs*/, "; 406 for (unsigned i = 0, e = EN->getNumVTs(); i != e; ++i) 407 OS << getEnumName(EN->getVT(i)) << ", "; 408 409 OS << EN->getNumOperands() << "/*#Ops*/, "; 410 unsigned NumOperandBytes = 0; 411 for (unsigned i = 0, e = EN->getNumOperands(); i != e; ++i) { 412 // We emit the operand numbers in VBR encoded format, in case the number 413 // is too large to represent with a byte. 414 NumOperandBytes += EmitVBRValue(EN->getOperand(i), OS); 415 } 416 417 // Print the result #'s for EmitNode. 418 if (const EmitNodeMatcher *E = dyn_cast<EmitNodeMatcher>(EN)) { 419 if (unsigned NumResults = EN->getNumNonChainFlagVTs()) { 420 OS.PadToColumn(CommentIndent) << "// Results = "; 421 unsigned First = E->getFirstResultSlot(); 422 for (unsigned i = 0; i != NumResults; ++i) 423 OS << "#" << First+i << " "; 424 } 425 } 426 OS << '\n'; 427 428 if (const SelectNodeToMatcher *SNT = dyn_cast<SelectNodeToMatcher>(N)) { 429 OS.PadToColumn(Indent*2) << "// Src: " 430 << *SNT->getPattern().getSrcPattern() << '\n'; 431 OS.PadToColumn(Indent*2) << "// Dst: " 432 << *SNT->getPattern().getDstPattern() << '\n'; 433 434 } 435 436 return 6+EN->getNumVTs()+NumOperandBytes; 437 } 438 case Matcher::MarkFlagResults: { 439 const MarkFlagResultsMatcher *CFR = cast<MarkFlagResultsMatcher>(N); 440 OS << "OPC_MarkFlagResults, " << CFR->getNumNodes() << ", "; 441 unsigned NumOperandBytes = 0; 442 for (unsigned i = 0, e = CFR->getNumNodes(); i != e; ++i) 443 NumOperandBytes += EmitVBRValue(CFR->getNode(i), OS); 444 OS << '\n'; 445 return 2+NumOperandBytes; 446 } 447 case Matcher::CompleteMatch: { 448 const CompleteMatchMatcher *CM = cast<CompleteMatchMatcher>(N); 449 OS << "OPC_CompleteMatch, " << CM->getNumResults() << ", "; 450 unsigned NumResultBytes = 0; 451 for (unsigned i = 0, e = CM->getNumResults(); i != e; ++i) 452 NumResultBytes += EmitVBRValue(CM->getResult(i), OS); 453 OS << '\n'; 454 OS.PadToColumn(Indent*2) << "// Src: " 455 << *CM->getPattern().getSrcPattern() << '\n'; 456 OS.PadToColumn(Indent*2) << "// Dst: " 457 << *CM->getPattern().getDstPattern() << '\n'; 458 return 2 + NumResultBytes; 459 } 460 } 461 assert(0 && "Unreachable"); 462 return 0; 463} 464 465/// EmitMatcherList - Emit the bytes for the specified matcher subtree. 466unsigned MatcherTableEmitter:: 467EmitMatcherList(const Matcher *N, unsigned Indent, unsigned CurrentIdx, 468 formatted_raw_ostream &OS) { 469 unsigned Size = 0; 470 while (N) { 471 if (unsigned(N->getKind()) >= Histogram.size()) 472 Histogram.resize(N->getKind()+1); 473 Histogram[N->getKind()]++; 474 475 OS << "/*" << CurrentIdx << "*/"; 476 unsigned MatcherSize = EmitMatcher(N, Indent, CurrentIdx, OS); 477 Size += MatcherSize; 478 CurrentIdx += MatcherSize; 479 480 // If there are other nodes in this list, iterate to them, otherwise we're 481 // done. 482 N = N->getNext(); 483 } 484 return Size; 485} 486 487void MatcherTableEmitter::EmitPredicateFunctions(formatted_raw_ostream &OS) { 488 // FIXME: Don't build off the DAGISelEmitter's predicates, emit them directly 489 // here into the case stmts. 490 491 // Emit pattern predicates. 492 OS << "bool CheckPatternPredicate(unsigned PredNo) const {\n"; 493 OS << " switch (PredNo) {\n"; 494 OS << " default: assert(0 && \"Invalid predicate in table?\");\n"; 495 for (unsigned i = 0, e = PatternPredicates.size(); i != e; ++i) 496 OS << " case " << i << ": return " << PatternPredicates[i] << ";\n"; 497 OS << " }\n"; 498 OS << "}\n\n"; 499 500 // Emit Node predicates. 501 OS << "bool CheckNodePredicate(SDNode *N, unsigned PredNo) const {\n"; 502 OS << " switch (PredNo) {\n"; 503 OS << " default: assert(0 && \"Invalid predicate in table?\");\n"; 504 for (unsigned i = 0, e = NodePredicates.size(); i != e; ++i) 505 OS << " case " << i << ": return " << NodePredicates[i] << "(N);\n"; 506 OS << " }\n"; 507 OS << "}\n\n"; 508 509 // Emit CompletePattern matchers. 510 // FIXME: This should be const. 511 OS << "bool CheckComplexPattern(SDNode *Root, SDValue N,\n"; 512 OS << " unsigned PatternNo, SmallVectorImpl<SDValue> &Result) {\n"; 513 OS << " switch (PatternNo) {\n"; 514 OS << " default: assert(0 && \"Invalid pattern # in table?\");\n"; 515 for (unsigned i = 0, e = ComplexPatterns.size(); i != e; ++i) { 516 const ComplexPattern &P = *ComplexPatterns[i]; 517 unsigned NumOps = P.getNumOperands(); 518 519 if (P.hasProperty(SDNPHasChain)) 520 ++NumOps; // Get the chained node too. 521 522 OS << " case " << i << ":\n"; 523 OS << " Result.resize(Result.size()+" << NumOps << ");\n"; 524 OS << " return " << P.getSelectFunc(); 525 526 // FIXME: Temporary hack until old isel dies. 527 if (P.hasProperty(SDNPHasChain)) 528 OS << "XXX"; 529 530 OS << "(Root, N"; 531 for (unsigned i = 0; i != NumOps; ++i) 532 OS << ", Result[Result.size()-" << (NumOps-i) << ']'; 533 OS << ");\n"; 534 } 535 OS << " }\n"; 536 OS << "}\n\n"; 537 538 // Emit SDNodeXForm handlers. 539 // FIXME: This should be const. 540 OS << "SDValue RunSDNodeXForm(SDValue V, unsigned XFormNo) {\n"; 541 OS << " switch (XFormNo) {\n"; 542 OS << " default: assert(0 && \"Invalid xform # in table?\");\n"; 543 544 // FIXME: The node xform could take SDValue's instead of SDNode*'s. 545 for (unsigned i = 0, e = NodeXForms.size(); i != e; ++i) 546 OS << " case " << i << ": return Transform_" << NodeXForms[i]->getName() 547 << "(V.getNode());\n"; 548 OS << " }\n"; 549 OS << "}\n\n"; 550} 551 552void MatcherTableEmitter::EmitHistogram(formatted_raw_ostream &OS) { 553 OS << " // Opcode Histogram:\n"; 554 for (unsigned i = 0, e = Histogram.size(); i != e; ++i) { 555 OS << " // #"; 556 switch ((Matcher::KindTy)i) { 557 case Matcher::Scope: OS << "OPC_Scope"; break; 558 case Matcher::RecordNode: OS << "OPC_RecordNode"; break; 559 case Matcher::RecordChild: OS << "OPC_RecordChild"; break; 560 case Matcher::RecordMemRef: OS << "OPC_RecordMemRef"; break; 561 case Matcher::CaptureFlagInput: OS << "OPC_CaptureFlagInput"; break; 562 case Matcher::MoveChild: OS << "OPC_MoveChild"; break; 563 case Matcher::MoveParent: OS << "OPC_MoveParent"; break; 564 case Matcher::CheckSame: OS << "OPC_CheckSame"; break; 565 case Matcher::CheckPatternPredicate: 566 OS << "OPC_CheckPatternPredicate"; break; 567 case Matcher::CheckPredicate: OS << "OPC_CheckPredicate"; break; 568 case Matcher::CheckOpcode: OS << "OPC_CheckOpcode"; break; 569 case Matcher::CheckMultiOpcode: OS << "OPC_CheckMultiOpcode"; break; 570 case Matcher::CheckType: OS << "OPC_CheckType"; break; 571 case Matcher::CheckChildType: OS << "OPC_CheckChildType"; break; 572 case Matcher::CheckInteger: OS << "OPC_CheckInteger"; break; 573 case Matcher::CheckCondCode: OS << "OPC_CheckCondCode"; break; 574 case Matcher::CheckValueType: OS << "OPC_CheckValueType"; break; 575 case Matcher::CheckComplexPat: OS << "OPC_CheckComplexPat"; break; 576 case Matcher::CheckAndImm: OS << "OPC_CheckAndImm"; break; 577 case Matcher::CheckOrImm: OS << "OPC_CheckOrImm"; break; 578 case Matcher::CheckFoldableChainNode: 579 OS << "OPC_CheckFoldableChainNode"; break; 580 case Matcher::CheckChainCompatible: OS << "OPC_CheckChainCompatible"; break; 581 case Matcher::EmitInteger: OS << "OPC_EmitInteger"; break; 582 case Matcher::EmitStringInteger: OS << "OPC_EmitStringInteger"; break; 583 case Matcher::EmitRegister: OS << "OPC_EmitRegister"; break; 584 case Matcher::EmitConvertToTarget: OS << "OPC_EmitConvertToTarget"; break; 585 case Matcher::EmitMergeInputChains: OS << "OPC_EmitMergeInputChains"; break; 586 case Matcher::EmitCopyToReg: OS << "OPC_EmitCopyToReg"; break; 587 case Matcher::EmitNode: OS << "OPC_EmitNode"; break; 588 case Matcher::SelectNodeTo: OS << "OPC_SelectNodeTo"; break; 589 case Matcher::EmitNodeXForm: OS << "OPC_EmitNodeXForm"; break; 590 case Matcher::MarkFlagResults: OS << "OPC_MarkFlagResults"; break; 591 case Matcher::CompleteMatch: OS << "OPC_CompleteMatch"; break; 592 } 593 594 OS.PadToColumn(40) << " = " << Histogram[i] << '\n'; 595 } 596 OS << '\n'; 597} 598 599 600void llvm::EmitMatcherTable(const Matcher *TheMatcher, raw_ostream &O) { 601 formatted_raw_ostream OS(O); 602 603 OS << "// The main instruction selector code.\n"; 604 OS << "SDNode *SelectCode(SDNode *N) {\n"; 605 606 MatcherTableEmitter MatcherEmitter; 607 608 OS << " // Opcodes are emitted as 2 bytes, TARGET_OPCODE handles this.\n"; 609 OS << " #define TARGET_OPCODE(X) X & 255, unsigned(X) >> 8\n"; 610 OS << " static const unsigned char MatcherTable[] = {\n"; 611 unsigned TotalSize = MatcherEmitter.EmitMatcherList(TheMatcher, 5, 0, OS); 612 OS << " 0\n }; // Total Array size is " << (TotalSize+1) << " bytes\n\n"; 613 614 MatcherEmitter.EmitHistogram(OS); 615 616 OS << " #undef TARGET_OPCODE\n"; 617 OS << " return SelectCodeCommon(N, MatcherTable,sizeof(MatcherTable));\n}\n"; 618 OS << "\n"; 619 620 // Next up, emit the function for node and pattern predicates: 621 MatcherEmitter.EmitPredicateFunctions(OS); 622} 623