1fe71893183f504feff290e343bf740bd32432129Chris Lattner//===- CodeGenDAGPatterns.cpp - Read DAG patterns from .td file -----------===// 26cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// 36cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// The LLVM Compiler Infrastructure 46cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// 56cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// This file is distributed under the University of Illinois Open Source 66cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// License. See LICENSE.TXT for details. 76cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// 86cefb77a7073057fecd721ae141140d75ce76512Chris Lattner//===----------------------------------------------------------------------===// 96cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// 10fe71893183f504feff290e343bf740bd32432129Chris Lattner// This file implements the CodeGenDAGPatterns class, which is used to read and 116cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// represent the patterns present in a .td file for instructions. 126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// 136cefb77a7073057fecd721ae141140d75ce76512Chris Lattner//===----------------------------------------------------------------------===// 146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 1593c7e418257bd65fcf8f5d9faa9487dd99358430Chris Lattner#include "CodeGenDAGPatterns.h" 162cacec55f947c716b058a39038889550d7e39b3cChris Lattner#include "llvm/ADT/STLExtras.h" 174ffd89fa4d2788611187d1a534d2ed46adf1702cChandler Carruth#include "llvm/ADT/StringExtras.h" 189b29ea4eb39b5f03ef2405c6355a9c627771c5ddJim Grosbach#include "llvm/ADT/Twine.h" 196cefb77a7073057fecd721ae141140d75ce76512Chris Lattner#include "llvm/Support/Debug.h" 20fdebc38523b397743973ff6a2d2e93b112dd96e5David Blaikie#include "llvm/Support/ErrorHandling.h" 214ffd89fa4d2788611187d1a534d2ed46adf1702cChandler Carruth#include "llvm/TableGen/Error.h" 224ffd89fa4d2788611187d1a534d2ed46adf1702cChandler Carruth#include "llvm/TableGen/Record.h" 239a79de3d091978cfee5264ee2563fc5dedd33cb7Chuck Rose III#include <algorithm> 24901b85888c2de6bf982c47ab69b7e83908b6a216Benjamin Kramer#include <cstdio> 25901b85888c2de6bf982c47ab69b7e83908b6a216Benjamin Kramer#include <set> 266cefb77a7073057fecd721ae141140d75ce76512Chris Lattnerusing namespace llvm; 276cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 28dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines#define DEBUG_TYPE "dag-patterns" 29dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 306cefb77a7073057fecd721ae141140d75ce76512Chris Lattner//===----------------------------------------------------------------------===// 312cacec55f947c716b058a39038889550d7e39b3cChris Lattner// EEVT::TypeSet Implementation 322cacec55f947c716b058a39038889550d7e39b3cChris Lattner//===----------------------------------------------------------------------===// 336cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 34825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Andersonstatic inline bool isInteger(MVT::SimpleValueType VT) { 3549909415ca9c674a459718895e8e99053e11f143Craig Topper return MVT(VT).isInteger(); 3683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands} 37825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Andersonstatic inline bool isFloatingPoint(MVT::SimpleValueType VT) { 3849909415ca9c674a459718895e8e99053e11f143Craig Topper return MVT(VT).isFloatingPoint(); 3983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands} 40825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Andersonstatic inline bool isVector(MVT::SimpleValueType VT) { 4149909415ca9c674a459718895e8e99053e11f143Craig Topper return MVT(VT).isVector(); 4283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands} 43774ce29399364823dba62217ebf7bc8701005140Chris Lattnerstatic inline bool isScalar(MVT::SimpleValueType VT) { 4449909415ca9c674a459718895e8e99053e11f143Craig Topper return !MVT(VT).isVector(); 45774ce29399364823dba62217ebf7bc8701005140Chris Lattner} 4683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands 472cacec55f947c716b058a39038889550d7e39b3cChris LattnerEEVT::TypeSet::TypeSet(MVT::SimpleValueType VT, TreePattern &TP) { 482cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (VT == MVT::iAny) 492cacec55f947c716b058a39038889550d7e39b3cChris Lattner EnforceInteger(TP); 502cacec55f947c716b058a39038889550d7e39b3cChris Lattner else if (VT == MVT::fAny) 512cacec55f947c716b058a39038889550d7e39b3cChris Lattner EnforceFloatingPoint(TP); 522cacec55f947c716b058a39038889550d7e39b3cChris Lattner else if (VT == MVT::vAny) 532cacec55f947c716b058a39038889550d7e39b3cChris Lattner EnforceVector(TP); 542cacec55f947c716b058a39038889550d7e39b3cChris Lattner else { 552cacec55f947c716b058a39038889550d7e39b3cChris Lattner assert((VT < MVT::LAST_VALUETYPE || VT == MVT::iPTR || 562cacec55f947c716b058a39038889550d7e39b3cChris Lattner VT == MVT::iPTRAny) && "Not a concrete type!"); 572cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeVec.push_back(VT); 582cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 596cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 606cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 612cacec55f947c716b058a39038889550d7e39b3cChris Lattner 6226369a930c523b75fe8f4ba18456ff86f68d5612Jakob Stoklund OlesenEEVT::TypeSet::TypeSet(ArrayRef<MVT::SimpleValueType> VTList) { 632cacec55f947c716b058a39038889550d7e39b3cChris Lattner assert(!VTList.empty() && "empty list?"); 642cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeVec.append(VTList.begin(), VTList.end()); 65fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 662cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (!VTList.empty()) 672cacec55f947c716b058a39038889550d7e39b3cChris Lattner assert(VTList[0] != MVT::iAny && VTList[0] != MVT::vAny && 682cacec55f947c716b058a39038889550d7e39b3cChris Lattner VTList[0] != MVT::fAny); 69fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 700d7952ed5ac10b6159d0e8e2449f0f471d117e0fChris Lattner // Verify no duplicates. 712cacec55f947c716b058a39038889550d7e39b3cChris Lattner array_pod_sort(TypeVec.begin(), TypeVec.end()); 720d7952ed5ac10b6159d0e8e2449f0f471d117e0fChris Lattner assert(std::unique(TypeVec.begin(), TypeVec.end()) == TypeVec.end()); 736cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 746cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 755a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner/// FillWithPossibleTypes - Set to all legal types and return true, only valid 765a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner/// on completely unknown type sets. 77774ce29399364823dba62217ebf7bc8701005140Chris Lattnerbool EEVT::TypeSet::FillWithPossibleTypes(TreePattern &TP, 78774ce29399364823dba62217ebf7bc8701005140Chris Lattner bool (*Pred)(MVT::SimpleValueType), 79774ce29399364823dba62217ebf7bc8701005140Chris Lattner const char *PredicateName) { 805a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner assert(isCompletelyUnknown()); 8126369a930c523b75fe8f4ba18456ff86f68d5612Jakob Stoklund Olesen ArrayRef<MVT::SimpleValueType> LegalTypes = 82774ce29399364823dba62217ebf7bc8701005140Chris Lattner TP.getDAGPatterns().getTargetInfo().getLegalValueTypes(); 83fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 8461131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TP.hasError()) 8561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 8661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger 87774ce29399364823dba62217ebf7bc8701005140Chris Lattner for (unsigned i = 0, e = LegalTypes.size(); i != e; ++i) 88dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (!Pred || Pred(LegalTypes[i])) 89774ce29399364823dba62217ebf7bc8701005140Chris Lattner TypeVec.push_back(LegalTypes[i]); 90774ce29399364823dba62217ebf7bc8701005140Chris Lattner 91774ce29399364823dba62217ebf7bc8701005140Chris Lattner // If we have nothing that matches the predicate, bail out. 9261131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TypeVec.empty()) { 93774ce29399364823dba62217ebf7bc8701005140Chris Lattner TP.error("Type inference contradiction found, no " + 94fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach std::string(PredicateName) + " types found"); 9561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 9661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 97774ce29399364823dba62217ebf7bc8701005140Chris Lattner // No need to sort with one element. 98774ce29399364823dba62217ebf7bc8701005140Chris Lattner if (TypeVec.size() == 1) return true; 99774ce29399364823dba62217ebf7bc8701005140Chris Lattner 100774ce29399364823dba62217ebf7bc8701005140Chris Lattner // Remove duplicates. 101774ce29399364823dba62217ebf7bc8701005140Chris Lattner array_pod_sort(TypeVec.begin(), TypeVec.end()); 102774ce29399364823dba62217ebf7bc8701005140Chris Lattner TypeVec.erase(std::unique(TypeVec.begin(), TypeVec.end()), TypeVec.end()); 103fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1045a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner return true; 1055a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner} 1062cacec55f947c716b058a39038889550d7e39b3cChris Lattner 1072cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// hasIntegerTypes - Return true if this TypeSet contains iAny or an 1082cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// integer value type. 1092cacec55f947c716b058a39038889550d7e39b3cChris Lattnerbool EEVT::TypeSet::hasIntegerTypes() const { 1102cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) 1112cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (isInteger(TypeVec[i])) 1122cacec55f947c716b058a39038889550d7e39b3cChris Lattner return true; 1132cacec55f947c716b058a39038889550d7e39b3cChris Lattner return false; 114fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach} 1152cacec55f947c716b058a39038889550d7e39b3cChris Lattner 1162cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// hasFloatingPointTypes - Return true if this TypeSet contains an fAny or 1172cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// a floating point value type. 1182cacec55f947c716b058a39038889550d7e39b3cChris Lattnerbool EEVT::TypeSet::hasFloatingPointTypes() const { 1192cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) 1202cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (isFloatingPoint(TypeVec[i])) 1212cacec55f947c716b058a39038889550d7e39b3cChris Lattner return true; 1222cacec55f947c716b058a39038889550d7e39b3cChris Lattner return false; 123fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach} 1242cacec55f947c716b058a39038889550d7e39b3cChris Lattner 12536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines/// hasScalarTypes - Return true if this TypeSet contains a scalar value type. 12636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hinesbool EEVT::TypeSet::hasScalarTypes() const { 12736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) 12836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (isScalar(TypeVec[i])) 12936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines return true; 13036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines return false; 13136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines} 13236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 1332cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// hasVectorTypes - Return true if this TypeSet contains a vAny or a vector 1342cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// value type. 1352cacec55f947c716b058a39038889550d7e39b3cChris Lattnerbool EEVT::TypeSet::hasVectorTypes() const { 1362cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) 1372cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (isVector(TypeVec[i])) 1382cacec55f947c716b058a39038889550d7e39b3cChris Lattner return true; 1392cacec55f947c716b058a39038889550d7e39b3cChris Lattner return false; 1406cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 14161fc4cf7aa0b87ceab62082cee8ef5ce3f574ffcBob Wilson 1422cacec55f947c716b058a39038889550d7e39b3cChris Lattner 1432cacec55f947c716b058a39038889550d7e39b3cChris Lattnerstd::string EEVT::TypeSet::getName() const { 144aac5b5b2e5eaf2e5bd62f9b96270e31d46125f4fChris Lattner if (TypeVec.empty()) return "<empty>"; 145fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1462cacec55f947c716b058a39038889550d7e39b3cChris Lattner std::string Result; 147fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1482cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) { 1492cacec55f947c716b058a39038889550d7e39b3cChris Lattner std::string VTName = llvm::getEnumName(TypeVec[i]); 1502cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Strip off MVT:: prefix if present. 1512cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (VTName.substr(0,5) == "MVT::") 1522cacec55f947c716b058a39038889550d7e39b3cChris Lattner VTName = VTName.substr(5); 1532cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (i) Result += ':'; 1542cacec55f947c716b058a39038889550d7e39b3cChris Lattner Result += VTName; 1552cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 156fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1572cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (TypeVec.size() == 1) 1582cacec55f947c716b058a39038889550d7e39b3cChris Lattner return Result; 1592cacec55f947c716b058a39038889550d7e39b3cChris Lattner return "{" + Result + "}"; 16061fc4cf7aa0b87ceab62082cee8ef5ce3f574ffcBob Wilson} 1612cacec55f947c716b058a39038889550d7e39b3cChris Lattner 1622cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// MergeInTypeInfo - This merges in type information from the specified 1632cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// argument. If 'this' changes, it returns true. If the two types are 16461131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger/// contradictory (e.g. merge f32 into i32) then this flags an error. 1652cacec55f947c716b058a39038889550d7e39b3cChris Lattnerbool EEVT::TypeSet::MergeInTypeInfo(const EEVT::TypeSet &InVT, TreePattern &TP){ 16661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (InVT.isCompletelyUnknown() || *this == InVT || TP.hasError()) 1672cacec55f947c716b058a39038889550d7e39b3cChris Lattner return false; 168fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1692cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (isCompletelyUnknown()) { 1702cacec55f947c716b058a39038889550d7e39b3cChris Lattner *this = InVT; 1712cacec55f947c716b058a39038889550d7e39b3cChris Lattner return true; 1722cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 173fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1742cacec55f947c716b058a39038889550d7e39b3cChris Lattner assert(TypeVec.size() >= 1 && InVT.TypeVec.size() >= 1 && "No unknowns"); 175fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1762cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Handle the abstract cases, seeing if we can resolve them better. 1772cacec55f947c716b058a39038889550d7e39b3cChris Lattner switch (TypeVec[0]) { 1782cacec55f947c716b058a39038889550d7e39b3cChris Lattner default: break; 1792cacec55f947c716b058a39038889550d7e39b3cChris Lattner case MVT::iPTR: 1802cacec55f947c716b058a39038889550d7e39b3cChris Lattner case MVT::iPTRAny: 1812cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (InVT.hasIntegerTypes()) { 1822cacec55f947c716b058a39038889550d7e39b3cChris Lattner EEVT::TypeSet InCopy(InVT); 1832cacec55f947c716b058a39038889550d7e39b3cChris Lattner InCopy.EnforceInteger(TP); 1842cacec55f947c716b058a39038889550d7e39b3cChris Lattner InCopy.EnforceScalar(TP); 185fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1862cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (InCopy.isConcrete()) { 1872cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If the RHS has one integer type, upgrade iPTR to i32. 1882cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeVec[0] = InVT.TypeVec[0]; 1892cacec55f947c716b058a39038889550d7e39b3cChris Lattner return true; 1902cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 191fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1922cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If the input has multiple scalar integers, this doesn't add any info. 1932cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (!InCopy.isCompletelyUnknown()) 1942cacec55f947c716b058a39038889550d7e39b3cChris Lattner return false; 1952cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 1962cacec55f947c716b058a39038889550d7e39b3cChris Lattner break; 1972cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 198fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1992cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If the input constraint is iAny/iPTR and this is an integer type list, 2002cacec55f947c716b058a39038889550d7e39b3cChris Lattner // remove non-integer types from the list. 2012cacec55f947c716b058a39038889550d7e39b3cChris Lattner if ((InVT.TypeVec[0] == MVT::iPTR || InVT.TypeVec[0] == MVT::iPTRAny) && 2022cacec55f947c716b058a39038889550d7e39b3cChris Lattner hasIntegerTypes()) { 2032cacec55f947c716b058a39038889550d7e39b3cChris Lattner bool MadeChange = EnforceInteger(TP); 204fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2052cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If we're merging in iPTR/iPTRAny and the node currently has a list of 2062cacec55f947c716b058a39038889550d7e39b3cChris Lattner // multiple different integer types, replace them with a single iPTR. 2072cacec55f947c716b058a39038889550d7e39b3cChris Lattner if ((InVT.TypeVec[0] == MVT::iPTR || InVT.TypeVec[0] == MVT::iPTRAny) && 2082cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeVec.size() != 1) { 2092cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeVec.resize(1); 2102cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeVec[0] = InVT.TypeVec[0]; 2112cacec55f947c716b058a39038889550d7e39b3cChris Lattner MadeChange = true; 2122cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 213fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2142cacec55f947c716b058a39038889550d7e39b3cChris Lattner return MadeChange; 2152cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 216fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2172cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If this is a type list and the RHS is a typelist as well, eliminate entries 2182cacec55f947c716b058a39038889550d7e39b3cChris Lattner // from this list that aren't in the other one. 2192cacec55f947c716b058a39038889550d7e39b3cChris Lattner bool MadeChange = false; 2202cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeSet InputSet(*this); 2212cacec55f947c716b058a39038889550d7e39b3cChris Lattner 2222cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0; i != TypeVec.size(); ++i) { 2232cacec55f947c716b058a39038889550d7e39b3cChris Lattner bool InInVT = false; 2242cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned j = 0, e = InVT.TypeVec.size(); j != e; ++j) 2252cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (TypeVec[i] == InVT.TypeVec[j]) { 2262cacec55f947c716b058a39038889550d7e39b3cChris Lattner InInVT = true; 2272cacec55f947c716b058a39038889550d7e39b3cChris Lattner break; 2282cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 229fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2302cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (InInVT) continue; 2312cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeVec.erase(TypeVec.begin()+i--); 2322cacec55f947c716b058a39038889550d7e39b3cChris Lattner MadeChange = true; 2332cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 234fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2352cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If we removed all of our types, we have a type contradiction. 2362cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (!TypeVec.empty()) 2372cacec55f947c716b058a39038889550d7e39b3cChris Lattner return MadeChange; 238fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2392cacec55f947c716b058a39038889550d7e39b3cChris Lattner // FIXME: Really want an SMLoc here! 2402cacec55f947c716b058a39038889550d7e39b3cChris Lattner TP.error("Type inference contradiction found, merging '" + 2412cacec55f947c716b058a39038889550d7e39b3cChris Lattner InVT.getName() + "' into '" + InputSet.getName() + "'"); 24261131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 2432cacec55f947c716b058a39038889550d7e39b3cChris Lattner} 2442cacec55f947c716b058a39038889550d7e39b3cChris Lattner 2452cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// EnforceInteger - Remove all non-integer types from this set. 2462cacec55f947c716b058a39038889550d7e39b3cChris Lattnerbool EEVT::TypeSet::EnforceInteger(TreePattern &TP) { 24761131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TP.hasError()) 24861131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 2492cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If we know nothing, then get the full set. 2505a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner if (TypeVec.empty()) 251774ce29399364823dba62217ebf7bc8701005140Chris Lattner return FillWithPossibleTypes(TP, isInteger, "integer"); 2522cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (!hasFloatingPointTypes()) 253774ce29399364823dba62217ebf7bc8701005140Chris Lattner return false; 254774ce29399364823dba62217ebf7bc8701005140Chris Lattner 255774ce29399364823dba62217ebf7bc8701005140Chris Lattner TypeSet InputSet(*this); 256fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2572cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Filter out all the fp types. 2582cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0; i != TypeVec.size(); ++i) 259774ce29399364823dba62217ebf7bc8701005140Chris Lattner if (!isInteger(TypeVec[i])) 2602cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeVec.erase(TypeVec.begin()+i--); 261fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 26261131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TypeVec.empty()) { 2632cacec55f947c716b058a39038889550d7e39b3cChris Lattner TP.error("Type inference contradiction found, '" + 2642cacec55f947c716b058a39038889550d7e39b3cChris Lattner InputSet.getName() + "' needs to be integer"); 26561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 26661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 267774ce29399364823dba62217ebf7bc8701005140Chris Lattner return true; 2682cacec55f947c716b058a39038889550d7e39b3cChris Lattner} 2692cacec55f947c716b058a39038889550d7e39b3cChris Lattner 2702cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// EnforceFloatingPoint - Remove all integer types from this set. 2712cacec55f947c716b058a39038889550d7e39b3cChris Lattnerbool EEVT::TypeSet::EnforceFloatingPoint(TreePattern &TP) { 27261131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TP.hasError()) 27361131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 2742cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If we know nothing, then get the full set. 2755a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner if (TypeVec.empty()) 276774ce29399364823dba62217ebf7bc8701005140Chris Lattner return FillWithPossibleTypes(TP, isFloatingPoint, "floating point"); 277774ce29399364823dba62217ebf7bc8701005140Chris Lattner 2782cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (!hasIntegerTypes()) 279774ce29399364823dba62217ebf7bc8701005140Chris Lattner return false; 280774ce29399364823dba62217ebf7bc8701005140Chris Lattner 281774ce29399364823dba62217ebf7bc8701005140Chris Lattner TypeSet InputSet(*this); 282fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2832cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Filter out all the fp types. 2842cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0; i != TypeVec.size(); ++i) 285774ce29399364823dba62217ebf7bc8701005140Chris Lattner if (!isFloatingPoint(TypeVec[i])) 2862cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeVec.erase(TypeVec.begin()+i--); 287fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 28861131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TypeVec.empty()) { 2892cacec55f947c716b058a39038889550d7e39b3cChris Lattner TP.error("Type inference contradiction found, '" + 2902cacec55f947c716b058a39038889550d7e39b3cChris Lattner InputSet.getName() + "' needs to be floating point"); 29161131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 29261131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 293774ce29399364823dba62217ebf7bc8701005140Chris Lattner return true; 2942cacec55f947c716b058a39038889550d7e39b3cChris Lattner} 2952cacec55f947c716b058a39038889550d7e39b3cChris Lattner 2962cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// EnforceScalar - Remove all vector types from this. 2972cacec55f947c716b058a39038889550d7e39b3cChris Lattnerbool EEVT::TypeSet::EnforceScalar(TreePattern &TP) { 29861131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TP.hasError()) 29961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 30061131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger 3012cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If we know nothing, then get the full set. 3025a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner if (TypeVec.empty()) 303774ce29399364823dba62217ebf7bc8701005140Chris Lattner return FillWithPossibleTypes(TP, isScalar, "scalar"); 304774ce29399364823dba62217ebf7bc8701005140Chris Lattner 3052cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (!hasVectorTypes()) 306774ce29399364823dba62217ebf7bc8701005140Chris Lattner return false; 307774ce29399364823dba62217ebf7bc8701005140Chris Lattner 308774ce29399364823dba62217ebf7bc8701005140Chris Lattner TypeSet InputSet(*this); 309fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3102cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Filter out all the vector types. 3112cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0; i != TypeVec.size(); ++i) 312774ce29399364823dba62217ebf7bc8701005140Chris Lattner if (!isScalar(TypeVec[i])) 3132cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeVec.erase(TypeVec.begin()+i--); 314fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 31561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TypeVec.empty()) { 3162cacec55f947c716b058a39038889550d7e39b3cChris Lattner TP.error("Type inference contradiction found, '" + 3172cacec55f947c716b058a39038889550d7e39b3cChris Lattner InputSet.getName() + "' needs to be scalar"); 31861131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 31961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 320774ce29399364823dba62217ebf7bc8701005140Chris Lattner return true; 3212cacec55f947c716b058a39038889550d7e39b3cChris Lattner} 3222cacec55f947c716b058a39038889550d7e39b3cChris Lattner 3232cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// EnforceVector - Remove all vector types from this. 3242cacec55f947c716b058a39038889550d7e39b3cChris Lattnerbool EEVT::TypeSet::EnforceVector(TreePattern &TP) { 32561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TP.hasError()) 32661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 32761131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger 3282cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If we know nothing, then get the full set. 3295a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner if (TypeVec.empty()) 330774ce29399364823dba62217ebf7bc8701005140Chris Lattner return FillWithPossibleTypes(TP, isVector, "vector"); 331774ce29399364823dba62217ebf7bc8701005140Chris Lattner 332774ce29399364823dba62217ebf7bc8701005140Chris Lattner TypeSet InputSet(*this); 333774ce29399364823dba62217ebf7bc8701005140Chris Lattner bool MadeChange = false; 334fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3352cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Filter out all the scalar types. 3362cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0; i != TypeVec.size(); ++i) 337774ce29399364823dba62217ebf7bc8701005140Chris Lattner if (!isVector(TypeVec[i])) { 3382cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeVec.erase(TypeVec.begin()+i--); 339774ce29399364823dba62217ebf7bc8701005140Chris Lattner MadeChange = true; 340774ce29399364823dba62217ebf7bc8701005140Chris Lattner } 341fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 34261131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TypeVec.empty()) { 3432cacec55f947c716b058a39038889550d7e39b3cChris Lattner TP.error("Type inference contradiction found, '" + 3442cacec55f947c716b058a39038889550d7e39b3cChris Lattner InputSet.getName() + "' needs to be a vector"); 34561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 34661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 3472cacec55f947c716b058a39038889550d7e39b3cChris Lattner return MadeChange; 3482cacec55f947c716b058a39038889550d7e39b3cChris Lattner} 3492cacec55f947c716b058a39038889550d7e39b3cChris Lattner 3502cacec55f947c716b058a39038889550d7e39b3cChris Lattner 3515a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner 35236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines/// EnforceSmallerThan - 'this' must be a smaller VT than Other. For vectors 35336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines/// this shoud be based on the element type. Update this and other based on 35436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines/// this information. 3552cacec55f947c716b058a39038889550d7e39b3cChris Lattnerbool EEVT::TypeSet::EnforceSmallerThan(EEVT::TypeSet &Other, TreePattern &TP) { 35661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TP.hasError()) 35761131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 35861131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger 3592cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Both operands must be integer or FP, but we don't care which. 3602cacec55f947c716b058a39038889550d7e39b3cChris Lattner bool MadeChange = false; 361fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3625a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner if (isCompletelyUnknown()) 3635a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner MadeChange = FillWithPossibleTypes(TP); 3645a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner 3655a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner if (Other.isCompletelyUnknown()) 3665a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner MadeChange = Other.FillWithPossibleTypes(TP); 367fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3682cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If one side is known to be integer or known to be FP but the other side has 3692cacec55f947c716b058a39038889550d7e39b3cChris Lattner // no information, get at least the type integrality info in there. 3705a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner if (!hasFloatingPointTypes()) 3712cacec55f947c716b058a39038889550d7e39b3cChris Lattner MadeChange |= Other.EnforceInteger(TP); 3725a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner else if (!hasIntegerTypes()) 3732cacec55f947c716b058a39038889550d7e39b3cChris Lattner MadeChange |= Other.EnforceFloatingPoint(TP); 3745a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner if (!Other.hasFloatingPointTypes()) 3752cacec55f947c716b058a39038889550d7e39b3cChris Lattner MadeChange |= EnforceInteger(TP); 3765a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner else if (!Other.hasIntegerTypes()) 3772cacec55f947c716b058a39038889550d7e39b3cChris Lattner MadeChange |= EnforceFloatingPoint(TP); 378fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3792cacec55f947c716b058a39038889550d7e39b3cChris Lattner assert(!isCompletelyUnknown() && !Other.isCompletelyUnknown() && 3802cacec55f947c716b058a39038889550d7e39b3cChris Lattner "Should have a type list now"); 381fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3822cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If one contains vectors but the other doesn't pull vectors out. 3835a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner if (!hasVectorTypes()) 3842cacec55f947c716b058a39038889550d7e39b3cChris Lattner MadeChange |= Other.EnforceScalar(TP); 38536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines else if (!hasScalarTypes()) 38636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MadeChange |= Other.EnforceVector(TP); 38736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (!Other.hasVectorTypes()) 3882cacec55f947c716b058a39038889550d7e39b3cChris Lattner MadeChange |= EnforceScalar(TP); 38936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines else if (!Other.hasScalarTypes()) 39036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MadeChange |= EnforceVector(TP); 391fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 39236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // For vectors we need to ensure that smaller size doesn't produce larger 39336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // vector and vice versa. 39436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (isConcrete() && isVector(getConcrete())) { 39536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MVT IVT = getConcrete(); 39636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines unsigned Size = IVT.getSizeInBits(); 3979d7f0111100d863f2722deab952711a5496abad4David Greene 39836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // Only keep types that have at least as many bits. 39936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TypeSet InputSet(Other); 400fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 40136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (unsigned i = 0; i != Other.TypeVec.size(); ++i) { 40236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines assert(isVector(Other.TypeVec[i]) && "EnforceVector didn't work"); 40336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (MVT(Other.TypeVec[i]).getSizeInBits() < Size) { 40436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines Other.TypeVec.erase(Other.TypeVec.begin()+i--); 40536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MadeChange = true; 40636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 4079d7f0111100d863f2722deab952711a5496abad4David Greene } 4089d7f0111100d863f2722deab952711a5496abad4David Greene 40936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (Other.TypeVec.empty()) { // FIXME: Really want an SMLoc here! 41036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TP.error("Type inference contradiction found, forcing '" + 41136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines InputSet.getName() + "' to have at least as many bits as " + 41236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines getName() + "'"); 41336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines return false; 4149d7f0111100d863f2722deab952711a5496abad4David Greene } 41536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } else if (Other.isConcrete() && isVector(Other.getConcrete())) { 41636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MVT IVT = Other.getConcrete(); 41736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines unsigned Size = IVT.getSizeInBits(); 41836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 41936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // Only keep types with the same or fewer total bits 42036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TypeSet InputSet(*this); 42136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 42236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (unsigned i = 0; i != TypeVec.size(); ++i) { 42336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines assert(isVector(TypeVec[i]) && "EnforceVector didn't work"); 42436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (MVT(TypeVec[i]).getSizeInBits() > Size) { 42536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TypeVec.erase(TypeVec.begin()+i--); 4269d7f0111100d863f2722deab952711a5496abad4David Greene MadeChange = true; 4279d7f0111100d863f2722deab952711a5496abad4David Greene } 4289d7f0111100d863f2722deab952711a5496abad4David Greene } 42936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 43036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (TypeVec.empty()) { // FIXME: Really want an SMLoc here! 43136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TP.error("Type inference contradiction found, forcing '" + 43236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines InputSet.getName() + "' to have the same or fewer bits than " + 43336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines Other.getName() + "'"); 43436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines return false; 43536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 4369d7f0111100d863f2722deab952711a5496abad4David Greene } 437fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 43836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // This code does not currently handle nodes which have multiple types, 43936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // where some types are integer, and some are fp. Assert that this is not 44036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // the case. 44136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines assert(!(hasIntegerTypes() && hasFloatingPointTypes()) && 44236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines !(Other.hasIntegerTypes() && Other.hasFloatingPointTypes()) && 44336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines "SDTCisOpSmallerThanOp does not handle mixed int/fp types!"); 44436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 44536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (TP.hasError()) 44661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 447fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 44836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // Okay, find the smallest scalar type from the other set and remove 44936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // anything the same or smaller from the current set. 45036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TypeSet InputSet(Other); 45136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MVT::SimpleValueType Smallest = TypeVec[0]; 45236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (unsigned i = 0; i != Other.TypeVec.size(); ++i) { 45336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (Other.TypeVec[i] <= Smallest) { 45436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines Other.TypeVec.erase(Other.TypeVec.begin()+i--); 45536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MadeChange = true; 4569d7f0111100d863f2722deab952711a5496abad4David Greene } 45736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 45836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 45936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (Other.TypeVec.empty()) { 46036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TP.error("Type inference contradiction found, '" + InputSet.getName() + 46136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines "' has nothing larger than '" + getName() +"'!"); 46236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines return false; 46336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 46436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 46536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // Okay, find the largest scalar type from the other set and remove 46636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // anything the same or larger from the current set. 46736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines InputSet = TypeSet(*this); 46836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MVT::SimpleValueType Largest = Other.TypeVec[Other.TypeVec.size()-1]; 46936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (unsigned i = 0; i != TypeVec.size(); ++i) { 47036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (TypeVec[i] >= Largest) { 47136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TypeVec.erase(TypeVec.begin()+i--); 47236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MadeChange = true; 4739d7f0111100d863f2722deab952711a5496abad4David Greene } 4749d7f0111100d863f2722deab952711a5496abad4David Greene } 475fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 47636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (TypeVec.empty()) { 47736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TP.error("Type inference contradiction found, '" + InputSet.getName() + 47836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines "' has nothing smaller than '" + Other.getName() +"'!"); 47961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 48061131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 481fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 4825a9b8fb95c9a4c6fd5e06c1e89fa9263d39cd252Chris Lattner return MadeChange; 4832cacec55f947c716b058a39038889550d7e39b3cChris Lattner} 4842cacec55f947c716b058a39038889550d7e39b3cChris Lattner 4852cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// EnforceVectorEltTypeIs - 'this' is now constrainted to be a vector type 48666fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner/// whose element is specified by VTOperand. 48766fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattnerbool EEVT::TypeSet::EnforceVectorEltTypeIs(EEVT::TypeSet &VTOperand, 4882cacec55f947c716b058a39038889550d7e39b3cChris Lattner TreePattern &TP) { 48961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TP.hasError()) 49061131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 49161131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger 49266fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner // "This" must be a vector and "VTOperand" must be a scalar. 4932cacec55f947c716b058a39038889550d7e39b3cChris Lattner bool MadeChange = false; 49466fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner MadeChange |= EnforceVector(TP); 49566fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner MadeChange |= VTOperand.EnforceScalar(TP); 49666fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner 49766fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner // If we know the vector type, it forces the scalar to agree. 49866fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner if (isConcrete()) { 49949909415ca9c674a459718895e8e99053e11f143Craig Topper MVT IVT = getConcrete(); 50066fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner IVT = IVT.getVectorElementType(); 501fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach return MadeChange | 50249909415ca9c674a459718895e8e99053e11f143Craig Topper VTOperand.MergeInTypeInfo(IVT.SimpleTy, TP); 50366fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner } 50466fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner 50566fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner // If the scalar type is known, filter out vector types whose element types 50666fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner // disagree. 50766fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner if (!VTOperand.isConcrete()) 50866fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner return MadeChange; 509fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 51066fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner MVT::SimpleValueType VT = VTOperand.getConcrete(); 511fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 51266fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner TypeSet InputSet(*this); 513fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 51466fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner // Filter out all the types which don't have the right element type. 51566fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner for (unsigned i = 0; i != TypeVec.size(); ++i) { 51666fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner assert(isVector(TypeVec[i]) && "EnforceVector didn't work"); 51749909415ca9c674a459718895e8e99053e11f143Craig Topper if (MVT(TypeVec[i]).getVectorElementType().SimpleTy != VT) { 5182cacec55f947c716b058a39038889550d7e39b3cChris Lattner TypeVec.erase(TypeVec.begin()+i--); 5192cacec55f947c716b058a39038889550d7e39b3cChris Lattner MadeChange = true; 5202cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 52166fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner } 522fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 52361131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TypeVec.empty()) { // FIXME: Really want an SMLoc here! 5242cacec55f947c716b058a39038889550d7e39b3cChris Lattner TP.error("Type inference contradiction found, forcing '" + 5252cacec55f947c716b058a39038889550d7e39b3cChris Lattner InputSet.getName() + "' to have a vector element"); 52661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 52761131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 5282cacec55f947c716b058a39038889550d7e39b3cChris Lattner return MadeChange; 5292cacec55f947c716b058a39038889550d7e39b3cChris Lattner} 5302cacec55f947c716b058a39038889550d7e39b3cChris Lattner 5316032269837c08a94b70b0e36f8e473c293ff5fd4David Greene/// EnforceVectorSubVectorTypeIs - 'this' is now constrainted to be a 5326032269837c08a94b70b0e36f8e473c293ff5fd4David Greene/// vector type specified by VTOperand. 5336032269837c08a94b70b0e36f8e473c293ff5fd4David Greenebool EEVT::TypeSet::EnforceVectorSubVectorTypeIs(EEVT::TypeSet &VTOperand, 5346032269837c08a94b70b0e36f8e473c293ff5fd4David Greene TreePattern &TP) { 53536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (TP.hasError()) 53636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines return false; 53736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 5386032269837c08a94b70b0e36f8e473c293ff5fd4David Greene // "This" must be a vector and "VTOperand" must be a vector. 5396032269837c08a94b70b0e36f8e473c293ff5fd4David Greene bool MadeChange = false; 5406032269837c08a94b70b0e36f8e473c293ff5fd4David Greene MadeChange |= EnforceVector(TP); 5416032269837c08a94b70b0e36f8e473c293ff5fd4David Greene MadeChange |= VTOperand.EnforceVector(TP); 5426032269837c08a94b70b0e36f8e473c293ff5fd4David Greene 54336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // If one side is known to be integer or known to be FP but the other side has 54436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // no information, get at least the type integrality info in there. 54536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (!hasFloatingPointTypes()) 54636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MadeChange |= VTOperand.EnforceInteger(TP); 54736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines else if (!hasIntegerTypes()) 54836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MadeChange |= VTOperand.EnforceFloatingPoint(TP); 54936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (!VTOperand.hasFloatingPointTypes()) 55036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MadeChange |= EnforceInteger(TP); 55136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines else if (!VTOperand.hasIntegerTypes()) 55236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MadeChange |= EnforceFloatingPoint(TP); 55336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 55436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines assert(!isCompletelyUnknown() && !VTOperand.isCompletelyUnknown() && 55536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines "Should have a type list now"); 5566032269837c08a94b70b0e36f8e473c293ff5fd4David Greene 5576032269837c08a94b70b0e36f8e473c293ff5fd4David Greene // If we know the vector type, it forces the scalar types to agree. 55836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // Also force one vector to have more elements than the other. 5596032269837c08a94b70b0e36f8e473c293ff5fd4David Greene if (isConcrete()) { 56049909415ca9c674a459718895e8e99053e11f143Craig Topper MVT IVT = getConcrete(); 56136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines unsigned NumElems = IVT.getVectorNumElements(); 5626032269837c08a94b70b0e36f8e473c293ff5fd4David Greene IVT = IVT.getVectorElementType(); 5636032269837c08a94b70b0e36f8e473c293ff5fd4David Greene 56449909415ca9c674a459718895e8e99053e11f143Craig Topper EEVT::TypeSet EltTypeSet(IVT.SimpleTy, TP); 5656032269837c08a94b70b0e36f8e473c293ff5fd4David Greene MadeChange |= VTOperand.EnforceVectorEltTypeIs(EltTypeSet, TP); 56636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 56736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // Only keep types that have less elements than VTOperand. 56836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TypeSet InputSet(VTOperand); 56936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 57036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (unsigned i = 0; i != VTOperand.TypeVec.size(); ++i) { 57136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines assert(isVector(VTOperand.TypeVec[i]) && "EnforceVector didn't work"); 57236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (MVT(VTOperand.TypeVec[i]).getVectorNumElements() >= NumElems) { 57336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines VTOperand.TypeVec.erase(VTOperand.TypeVec.begin()+i--); 57436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MadeChange = true; 57536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 57636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 57736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (VTOperand.TypeVec.empty()) { // FIXME: Really want an SMLoc here! 57836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TP.error("Type inference contradiction found, forcing '" + 57936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines InputSet.getName() + "' to have less vector elements than '" + 58036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines getName() + "'"); 58136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines return false; 58236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 5836032269837c08a94b70b0e36f8e473c293ff5fd4David Greene } else if (VTOperand.isConcrete()) { 58449909415ca9c674a459718895e8e99053e11f143Craig Topper MVT IVT = VTOperand.getConcrete(); 58536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines unsigned NumElems = IVT.getVectorNumElements(); 5866032269837c08a94b70b0e36f8e473c293ff5fd4David Greene IVT = IVT.getVectorElementType(); 5876032269837c08a94b70b0e36f8e473c293ff5fd4David Greene 58849909415ca9c674a459718895e8e99053e11f143Craig Topper EEVT::TypeSet EltTypeSet(IVT.SimpleTy, TP); 5896032269837c08a94b70b0e36f8e473c293ff5fd4David Greene MadeChange |= EnforceVectorEltTypeIs(EltTypeSet, TP); 59036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 59136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // Only keep types that have more elements than 'this'. 59236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TypeSet InputSet(*this); 59336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 59436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (unsigned i = 0; i != TypeVec.size(); ++i) { 59536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines assert(isVector(TypeVec[i]) && "EnforceVector didn't work"); 59636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (MVT(TypeVec[i]).getVectorNumElements() <= NumElems) { 59736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TypeVec.erase(TypeVec.begin()+i--); 59836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines MadeChange = true; 59936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 60036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 60136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (TypeVec.empty()) { // FIXME: Really want an SMLoc here! 60236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TP.error("Type inference contradiction found, forcing '" + 60336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines InputSet.getName() + "' to have more vector elements than '" + 60436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines VTOperand.getName() + "'"); 60536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines return false; 60636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 6076032269837c08a94b70b0e36f8e473c293ff5fd4David Greene } 6086032269837c08a94b70b0e36f8e473c293ff5fd4David Greene 6096032269837c08a94b70b0e36f8e473c293ff5fd4David Greene return MadeChange; 6106032269837c08a94b70b0e36f8e473c293ff5fd4David Greene} 6116032269837c08a94b70b0e36f8e473c293ff5fd4David Greene 6122cacec55f947c716b058a39038889550d7e39b3cChris Lattner//===----------------------------------------------------------------------===// 6132cacec55f947c716b058a39038889550d7e39b3cChris Lattner// Helpers for working with extended types. 6146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 615327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel/// Dependent variable map for CodeGenDAGPattern variant generation 616327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Micheltypedef std::map<std::string, int> DepVarMap; 617327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel 618327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel/// Const iterator shorthand for DepVarMap 619327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Micheltypedef DepVarMap::const_iterator DepVarMap_citer; 620327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel 621543790673c747ab2793fc657e239ce5f78419dc0Chris Lattnerstatic void FindDepVarsOf(TreePatternNode *N, DepVarMap &DepMap) { 622327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel if (N->isLeaf()) { 6233f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva if (isa<DefInit>(N->getLeafValue())) 624327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel DepMap[N->getName()]++; 625327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel } else { 626327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel for (size_t i = 0, e = N->getNumChildren(); i != e; ++i) 627327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel FindDepVarsOf(N->getChild(i), DepMap); 628327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel } 629327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel} 630543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner 631543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner/// Find dependent variables within child patterns 632543790673c747ab2793fc657e239ce5f78419dc0Chris Lattnerstatic void FindDepVars(TreePatternNode *N, MultipleUseVarSet &DepVars) { 633327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel DepVarMap depcounts; 634327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel FindDepVarsOf(N, depcounts); 635327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel for (DepVarMap_citer i = depcounts.begin(); i != depcounts.end(); ++i) { 636543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner if (i->second > 1) // std::pair<std::string, int> 637327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel DepVars.insert(i->first); 638327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel } 639327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel} 640327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel 6416aa526bf76ba74b79ebf4d96d2c1f12d59067530Daniel Dunbar#ifndef NDEBUG 642543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner/// Dump the dependent variable set: 643543790673c747ab2793fc657e239ce5f78419dc0Chris Lattnerstatic void DumpDepVars(MultipleUseVarSet &DepVars) { 644327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel if (DepVars.empty()) { 645569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner DEBUG(errs() << "<empty set>"); 646327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel } else { 647569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner DEBUG(errs() << "[ "); 648bb16824dc3e2ba660e8b79f49046c418aa8e1be7Jim Grosbach for (MultipleUseVarSet::const_iterator i = DepVars.begin(), 649bb16824dc3e2ba660e8b79f49046c418aa8e1be7Jim Grosbach e = DepVars.end(); i != e; ++i) { 650569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner DEBUG(errs() << (*i) << " "); 651327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel } 652569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner DEBUG(errs() << "]"); 653327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel } 654327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel} 6556aa526bf76ba74b79ebf4d96d2c1f12d59067530Daniel Dunbar#endif 6566aa526bf76ba74b79ebf4d96d2c1f12d59067530Daniel Dunbar 657543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner 658543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner//===----------------------------------------------------------------------===// 659543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner// TreePredicateFn Implementation 660543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner//===----------------------------------------------------------------------===// 661543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner 6627ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner/// TreePredicateFn constructor. Here 'N' is a subclass of PatFrag. 6637ed1391ff66012e4963081cfb20b6166e8784f50Chris LattnerTreePredicateFn::TreePredicateFn(TreePattern *N) : PatFragRec(N) { 6647ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner assert((getPredCode().empty() || getImmCode().empty()) && 6657ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner ".td file corrupt: can't have a node predicate *and* an imm predicate"); 6667ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner} 6677ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner 668543790673c747ab2793fc657e239ce5f78419dc0Chris Lattnerstd::string TreePredicateFn::getPredCode() const { 6698dd6f0c8353f80de6526810899f271d539f6929cJakob Stoklund Olesen return PatFragRec->getRecord()->getValueAsString("PredicateCode"); 670543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner} 671543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner 6727ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattnerstd::string TreePredicateFn::getImmCode() const { 6738dd6f0c8353f80de6526810899f271d539f6929cJakob Stoklund Olesen return PatFragRec->getRecord()->getValueAsString("ImmediateCode"); 6747ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner} 6757ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner 676543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner 677543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner/// isAlwaysTrue - Return true if this is a noop predicate. 678543790673c747ab2793fc657e239ce5f78419dc0Chris Lattnerbool TreePredicateFn::isAlwaysTrue() const { 6797ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner return getPredCode().empty() && getImmCode().empty(); 680543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner} 681543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner 682543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner/// Return the name to use in the generated code to reference this, this is 683543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner/// "Predicate_foo" if from a pattern fragment "foo". 684543790673c747ab2793fc657e239ce5f78419dc0Chris Lattnerstd::string TreePredicateFn::getFnName() const { 685543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner return "Predicate_" + PatFragRec->getRecord()->getName(); 686543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner} 687543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner 688543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner/// getCodeToRunOnSDNode - Return the code for the function body that 689543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner/// evaluates this predicate. The argument is expected to be in "Node", 690543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner/// not N. This handles casting and conversion to a concrete node type as 691543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner/// appropriate. 692543790673c747ab2793fc657e239ce5f78419dc0Chris Lattnerstd::string TreePredicateFn::getCodeToRunOnSDNode() const { 6937ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner // Handle immediate predicates first. 6947ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner std::string ImmCode = getImmCode(); 6957ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner if (!ImmCode.empty()) { 6967ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner std::string Result = 6977ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner " int64_t Imm = cast<ConstantSDNode>(Node)->getSExtValue();\n"; 6987ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner return Result + ImmCode; 6997ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner } 7007ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner 7017ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner // Handle arbitrary node predicates. 7027ed1391ff66012e4963081cfb20b6166e8784f50Chris Lattner assert(!getPredCode().empty() && "Don't have any predicate code!"); 703543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner std::string ClassName; 704543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner if (PatFragRec->getOnlyTree()->isLeaf()) 705543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner ClassName = "SDNode"; 706543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner else { 707543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner Record *Op = PatFragRec->getOnlyTree()->getOperator(); 708543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner ClassName = PatFragRec->getDAGPatterns().getSDNodeInfo(Op).getSDClassName(); 709543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner } 710543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner std::string Result; 711543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner if (ClassName == "SDNode") 712543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner Result = " SDNode *N = Node;\n"; 713543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner else 714543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner Result = " " + ClassName + "*N = cast<" + ClassName + ">(Node);\n"; 715543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner 716543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner return Result + getPredCode(); 717327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel} 718327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel 7196cefb77a7073057fecd721ae141140d75ce76512Chris Lattner//===----------------------------------------------------------------------===// 72022bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman// PatternToMatch implementation 72122bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman// 72222bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman 72348e86dbe29e331357b0df11075b7974009c65f34Chris Lattner 72448e86dbe29e331357b0df11075b7974009c65f34Chris Lattner/// getPatternSize - Return the 'size' of this pattern. We want to match large 72548e86dbe29e331357b0df11075b7974009c65f34Chris Lattner/// patterns before small ones. This is used to determine the size of a 72648e86dbe29e331357b0df11075b7974009c65f34Chris Lattner/// pattern. 72748e86dbe29e331357b0df11075b7974009c65f34Chris Lattnerstatic unsigned getPatternSize(const TreePatternNode *P, 72848e86dbe29e331357b0df11075b7974009c65f34Chris Lattner const CodeGenDAGPatterns &CGP) { 72948e86dbe29e331357b0df11075b7974009c65f34Chris Lattner unsigned Size = 3; // The node itself. 73048e86dbe29e331357b0df11075b7974009c65f34Chris Lattner // If the root node is a ConstantSDNode, increases its size. 73148e86dbe29e331357b0df11075b7974009c65f34Chris Lattner // e.g. (set R32:$dst, 0). 7323f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva if (P->isLeaf() && isa<IntInit>(P->getLeafValue())) 73348e86dbe29e331357b0df11075b7974009c65f34Chris Lattner Size += 2; 734fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 73548e86dbe29e331357b0df11075b7974009c65f34Chris Lattner // FIXME: This is a hack to statically increase the priority of patterns 73648e86dbe29e331357b0df11075b7974009c65f34Chris Lattner // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD. 73748e86dbe29e331357b0df11075b7974009c65f34Chris Lattner // Later we can allow complexity / cost for each pattern to be (optionally) 73848e86dbe29e331357b0df11075b7974009c65f34Chris Lattner // specified. To get best possible pattern match we'll need to dynamically 73948e86dbe29e331357b0df11075b7974009c65f34Chris Lattner // calculate the complexity of all patterns a dag can potentially map to. 74048e86dbe29e331357b0df11075b7974009c65f34Chris Lattner const ComplexPattern *AM = P->getComplexPatternInfo(CGP); 741dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (AM) { 74248e86dbe29e331357b0df11075b7974009c65f34Chris Lattner Size += AM->getNumOperands() * 3; 743fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 744dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // We don't want to count any children twice, so return early. 745dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return Size; 746dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines } 747dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 74848e86dbe29e331357b0df11075b7974009c65f34Chris Lattner // If this node has some predicate function that must match, it adds to the 74948e86dbe29e331357b0df11075b7974009c65f34Chris Lattner // complexity of this node. 75048e86dbe29e331357b0df11075b7974009c65f34Chris Lattner if (!P->getPredicateFns().empty()) 75148e86dbe29e331357b0df11075b7974009c65f34Chris Lattner ++Size; 752fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 75348e86dbe29e331357b0df11075b7974009c65f34Chris Lattner // Count children in the count if they are also nodes. 75448e86dbe29e331357b0df11075b7974009c65f34Chris Lattner for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) { 75548e86dbe29e331357b0df11075b7974009c65f34Chris Lattner TreePatternNode *Child = P->getChild(i); 75648e86dbe29e331357b0df11075b7974009c65f34Chris Lattner if (!Child->isLeaf() && Child->getNumTypes() && 75748e86dbe29e331357b0df11075b7974009c65f34Chris Lattner Child->getType(0) != MVT::Other) 75848e86dbe29e331357b0df11075b7974009c65f34Chris Lattner Size += getPatternSize(Child, CGP); 75948e86dbe29e331357b0df11075b7974009c65f34Chris Lattner else if (Child->isLeaf()) { 7603f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva if (isa<IntInit>(Child->getLeafValue())) 76148e86dbe29e331357b0df11075b7974009c65f34Chris Lattner Size += 5; // Matches a ConstantSDNode (+3) and a specific value (+2). 76248e86dbe29e331357b0df11075b7974009c65f34Chris Lattner else if (Child->getComplexPatternInfo(CGP)) 76348e86dbe29e331357b0df11075b7974009c65f34Chris Lattner Size += getPatternSize(Child, CGP); 76448e86dbe29e331357b0df11075b7974009c65f34Chris Lattner else if (!Child->getPredicateFns().empty()) 76548e86dbe29e331357b0df11075b7974009c65f34Chris Lattner ++Size; 76648e86dbe29e331357b0df11075b7974009c65f34Chris Lattner } 76748e86dbe29e331357b0df11075b7974009c65f34Chris Lattner } 768fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 76948e86dbe29e331357b0df11075b7974009c65f34Chris Lattner return Size; 77048e86dbe29e331357b0df11075b7974009c65f34Chris Lattner} 77148e86dbe29e331357b0df11075b7974009c65f34Chris Lattner 77248e86dbe29e331357b0df11075b7974009c65f34Chris Lattner/// Compute the complexity metric for the input pattern. This roughly 77348e86dbe29e331357b0df11075b7974009c65f34Chris Lattner/// corresponds to the number of nodes that are covered. 77448e86dbe29e331357b0df11075b7974009c65f34Chris Lattnerunsigned PatternToMatch:: 77548e86dbe29e331357b0df11075b7974009c65f34Chris LattnergetPatternComplexity(const CodeGenDAGPatterns &CGP) const { 77648e86dbe29e331357b0df11075b7974009c65f34Chris Lattner return getPatternSize(getSrcPattern(), CGP) + getAddedComplexity(); 77748e86dbe29e331357b0df11075b7974009c65f34Chris Lattner} 77848e86dbe29e331357b0df11075b7974009c65f34Chris Lattner 77948e86dbe29e331357b0df11075b7974009c65f34Chris Lattner 78022bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman/// getPredicateCheck - Return a single string containing all of this 78122bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman/// pattern's predicates concatenated with "&&" operators. 78222bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman/// 78322bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohmanstd::string PatternToMatch::getPredicateCheck() const { 78422bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman std::string PredicateCheck; 78522bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) { 7866cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva if (DefInit *Pred = dyn_cast<DefInit>(Predicates->getElement(i))) { 78722bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman Record *Def = Pred->getDef(); 78822bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman if (!Def->isSubClassOf("Predicate")) { 78922bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman#ifndef NDEBUG 79022bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman Def->dump(); 79122bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman#endif 792655b8de7b2ab773a977e0c524307e71354d8af29Craig Topper llvm_unreachable("Unknown predicate type!"); 79322bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman } 79422bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman if (!PredicateCheck.empty()) 79522bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman PredicateCheck += " && "; 79622bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman PredicateCheck += "(" + Def->getValueAsString("CondString") + ")"; 79722bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman } 79822bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman } 79922bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman 80022bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman return PredicateCheck; 80122bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman} 80222bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman 80322bb31103de3337f0bb74c7bee16d1817d4dca14Dan Gohman//===----------------------------------------------------------------------===// 8046cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// SDTypeConstraint implementation 8056cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// 8066cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 8076cefb77a7073057fecd721ae141140d75ce76512Chris LattnerSDTypeConstraint::SDTypeConstraint(Record *R) { 8086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OperandNo = R->getValueAsInt("OperandNum"); 809fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 8106cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (R->isSubClassOf("SDTCisVT")) { 8116cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ConstraintType = SDTCisVT; 8126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner x.SDTCisVT_Info.VT = getValueType(R->getValueAsDef("VT")); 813c812261221040ac991f0c9710036a079f208281eChris Lattner if (x.SDTCisVT_Info.VT == MVT::isVoid) 81461131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger PrintFatalError(R->getLoc(), "Cannot use 'Void' as type to SDTCisVT"); 815fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 8166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else if (R->isSubClassOf("SDTCisPtrTy")) { 8176cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ConstraintType = SDTCisPtrTy; 8186cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else if (R->isSubClassOf("SDTCisInt")) { 8196cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ConstraintType = SDTCisInt; 8206cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else if (R->isSubClassOf("SDTCisFP")) { 8216cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ConstraintType = SDTCisFP; 82236e3e668be0c4914660575d7cea800b0d51a4116Bob Wilson } else if (R->isSubClassOf("SDTCisVec")) { 82336e3e668be0c4914660575d7cea800b0d51a4116Bob Wilson ConstraintType = SDTCisVec; 8246cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else if (R->isSubClassOf("SDTCisSameAs")) { 8256cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ConstraintType = SDTCisSameAs; 8266cefb77a7073057fecd721ae141140d75ce76512Chris Lattner x.SDTCisSameAs_Info.OtherOperandNum = R->getValueAsInt("OtherOperandNum"); 8276cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else if (R->isSubClassOf("SDTCisVTSmallerThanOp")) { 8286cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ConstraintType = SDTCisVTSmallerThanOp; 829fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach x.SDTCisVTSmallerThanOp_Info.OtherOperandNum = 8306cefb77a7073057fecd721ae141140d75ce76512Chris Lattner R->getValueAsInt("OtherOperandNum"); 8316cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else if (R->isSubClassOf("SDTCisOpSmallerThanOp")) { 8326cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ConstraintType = SDTCisOpSmallerThanOp; 833fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach x.SDTCisOpSmallerThanOp_Info.BigOperandNum = 8346cefb77a7073057fecd721ae141140d75ce76512Chris Lattner R->getValueAsInt("BigOperandNum"); 835b5af3344c196de5ed3f45b250dfb864be6e9ddc5Nate Begeman } else if (R->isSubClassOf("SDTCisEltOfVec")) { 836b5af3344c196de5ed3f45b250dfb864be6e9ddc5Nate Begeman ConstraintType = SDTCisEltOfVec; 8372cacec55f947c716b058a39038889550d7e39b3cChris Lattner x.SDTCisEltOfVec_Info.OtherOperandNum = R->getValueAsInt("OtherOpNum"); 8386032269837c08a94b70b0e36f8e473c293ff5fd4David Greene } else if (R->isSubClassOf("SDTCisSubVecOfVec")) { 8396032269837c08a94b70b0e36f8e473c293ff5fd4David Greene ConstraintType = SDTCisSubVecOfVec; 8406032269837c08a94b70b0e36f8e473c293ff5fd4David Greene x.SDTCisSubVecOfVec_Info.OtherOperandNum = 8416032269837c08a94b70b0e36f8e473c293ff5fd4David Greene R->getValueAsInt("OtherOpNum"); 8426cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else { 8431a55180238dbcf11113f610aea010447e51f595bDaniel Dunbar errs() << "Unrecognized SDTypeConstraint '" << R->getName() << "'!\n"; 8446cefb77a7073057fecd721ae141140d75ce76512Chris Lattner exit(1); 8456cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 8466cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 8476cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 8486cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// getOperandNum - Return the node corresponding to operand #OpNo in tree 8492e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner/// N, and the result number in ResNo. 8502e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattnerstatic TreePatternNode *getOperandNum(unsigned OpNo, TreePatternNode *N, 8512e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner const SDNodeInfo &NodeInfo, 8522e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner unsigned &ResNo) { 8532e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner unsigned NumResults = NodeInfo.getNumResults(); 8542e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner if (OpNo < NumResults) { 8552e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner ResNo = OpNo; 8562e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner return N; 8572e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner } 858fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 8592e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner OpNo -= NumResults; 860fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 8612e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner if (OpNo >= N->getNumChildren()) { 862fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach errs() << "Invalid operand number in type constraint " 8632e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner << (OpNo+NumResults) << " "; 8646cefb77a7073057fecd721ae141140d75ce76512Chris Lattner N->dump(); 8651a55180238dbcf11113f610aea010447e51f595bDaniel Dunbar errs() << '\n'; 8666cefb77a7073057fecd721ae141140d75ce76512Chris Lattner exit(1); 8676cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 8686cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 8692e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner return N->getChild(OpNo); 8706cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 8716cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 8726cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// ApplyTypeConstraint - Given a node in a pattern, apply this type 8736cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// constraint to the nodes operands. This returns true if it makes a 87461131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger/// change, false otherwise. If a type contradiction is found, flag an error. 8756cefb77a7073057fecd721ae141140d75ce76512Chris Lattnerbool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N, 8766cefb77a7073057fecd721ae141140d75ce76512Chris Lattner const SDNodeInfo &NodeInfo, 8776cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePattern &TP) const { 87861131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TP.hasError()) 87961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 88061131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger 8812e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner unsigned ResNo = 0; // The result number being referenced. 8822e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NodeInfo, ResNo); 883fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 8846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner switch (ConstraintType) { 8856cefb77a7073057fecd721ae141140d75ce76512Chris Lattner case SDTCisVT: 8866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Operand must be a particular type. 887d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return NodeToApply->UpdateNodeType(ResNo, x.SDTCisVT_Info.VT, TP); 8882cacec55f947c716b058a39038889550d7e39b3cChris Lattner case SDTCisPtrTy: 8896cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Operand must be same as target pointer type. 890d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return NodeToApply->UpdateNodeType(ResNo, MVT::iPTR, TP); 8912cacec55f947c716b058a39038889550d7e39b3cChris Lattner case SDTCisInt: 8922cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Require it to be one of the legal integer VTs. 893d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return NodeToApply->getExtType(ResNo).EnforceInteger(TP); 8942cacec55f947c716b058a39038889550d7e39b3cChris Lattner case SDTCisFP: 8952cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Require it to be one of the legal fp VTs. 896d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return NodeToApply->getExtType(ResNo).EnforceFloatingPoint(TP); 8972cacec55f947c716b058a39038889550d7e39b3cChris Lattner case SDTCisVec: 8982cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Require it to be one of the legal vector VTs. 899d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return NodeToApply->getExtType(ResNo).EnforceVector(TP); 9006cefb77a7073057fecd721ae141140d75ce76512Chris Lattner case SDTCisSameAs: { 9012e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner unsigned OResNo = 0; 9026cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *OtherNode = 9032e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NodeInfo, OResNo); 904d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return NodeToApply->UpdateNodeType(OResNo, OtherNode->getExtType(ResNo),TP)| 905d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner OtherNode->UpdateNodeType(ResNo,NodeToApply->getExtType(OResNo),TP); 9066cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 9076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner case SDTCisVTSmallerThanOp: { 9086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // The NodeToApply must be a leaf node that is a VT. OtherOperandNum must 9096cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // have an integer type that is smaller than the VT. 9106cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!NodeToApply->isLeaf() || 9113f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva !isa<DefInit>(NodeToApply->getLeafValue()) || 91205bce0beee87512e52428d4b80f5a8e79a949576David Greene !static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef() 91361131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger ->isSubClassOf("ValueType")) { 9146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TP.error(N->getOperator()->getName() + " expects a VT operand!"); 91561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 91661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 917825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson MVT::SimpleValueType VT = 91805bce0beee87512e52428d4b80f5a8e79a949576David Greene getValueType(static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef()); 919fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 920cc8783073205dcc5feadaa0a722ab61c6d17fee7Chris Lattner EEVT::TypeSet TypeListTmp(VT, TP); 921fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 9222e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner unsigned OResNo = 0; 9236cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *OtherNode = 9242e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N, NodeInfo, 9252e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner OResNo); 9262cacec55f947c716b058a39038889550d7e39b3cChris Lattner 927cc8783073205dcc5feadaa0a722ab61c6d17fee7Chris Lattner return TypeListTmp.EnforceSmallerThan(OtherNode->getExtType(OResNo), TP); 9286cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 9296cefb77a7073057fecd721ae141140d75ce76512Chris Lattner case SDTCisOpSmallerThanOp: { 9302e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner unsigned BResNo = 0; 9316cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *BigOperand = 9322e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NodeInfo, 9332e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner BResNo); 934d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return NodeToApply->getExtType(ResNo). 935d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner EnforceSmallerThan(BigOperand->getExtType(BResNo), TP); 9366cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 937b5af3344c196de5ed3f45b250dfb864be6e9ddc5Nate Begeman case SDTCisEltOfVec: { 9382e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner unsigned VResNo = 0; 9392cacec55f947c716b058a39038889550d7e39b3cChris Lattner TreePatternNode *VecOperand = 9402e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner getOperandNum(x.SDTCisEltOfVec_Info.OtherOperandNum, N, NodeInfo, 9412e68a02c264c26abc6ed62d59f18813fa7fdb95dChris Lattner VResNo); 942fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 94366fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner // Filter vector types out of VecOperand that don't have the right element 94466fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner // type. 94566fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner return VecOperand->getExtType(VResNo). 94666fb9d26c64b75ad6619608905c4005f0777bf5dChris Lattner EnforceVectorEltTypeIs(NodeToApply->getExtType(ResNo), TP); 947b5af3344c196de5ed3f45b250dfb864be6e9ddc5Nate Begeman } 9486032269837c08a94b70b0e36f8e473c293ff5fd4David Greene case SDTCisSubVecOfVec: { 9496032269837c08a94b70b0e36f8e473c293ff5fd4David Greene unsigned VResNo = 0; 9506032269837c08a94b70b0e36f8e473c293ff5fd4David Greene TreePatternNode *BigVecOperand = 9516032269837c08a94b70b0e36f8e473c293ff5fd4David Greene getOperandNum(x.SDTCisSubVecOfVec_Info.OtherOperandNum, N, NodeInfo, 9526032269837c08a94b70b0e36f8e473c293ff5fd4David Greene VResNo); 9536032269837c08a94b70b0e36f8e473c293ff5fd4David Greene 9546032269837c08a94b70b0e36f8e473c293ff5fd4David Greene // Filter vector types out of BigVecOperand that don't have the 9556032269837c08a94b70b0e36f8e473c293ff5fd4David Greene // right subvector type. 9566032269837c08a94b70b0e36f8e473c293ff5fd4David Greene return BigVecOperand->getExtType(VResNo). 9576032269837c08a94b70b0e36f8e473c293ff5fd4David Greene EnforceVectorSubVectorTypeIs(NodeToApply->getExtType(ResNo), TP); 9586032269837c08a94b70b0e36f8e473c293ff5fd4David Greene } 959fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach } 96058bd1510a4fea29b1ea57d6a6c4038eeea0264a2David Blaikie llvm_unreachable("Invalid ConstraintType!"); 9616cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 9626cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 9634c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen// Update the node type to match an instruction operand or result as specified 9644c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen// in the ins or outs lists on the instruction definition. Return true if the 9654c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen// type was actually changed. 9664c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesenbool TreePatternNode::UpdateNodeTypeFromInst(unsigned ResNo, 9674c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen Record *Operand, 9684c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen TreePattern &TP) { 9694c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen // The 'unknown' operand indicates that types should be inferred from the 9704c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen // context. 9714c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen if (Operand->isSubClassOf("unknown_class")) 9724c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen return false; 9734c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen 9744c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen // The Operand class specifies a type directly. 9754c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen if (Operand->isSubClassOf("Operand")) 9764c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen return UpdateNodeType(ResNo, getValueType(Operand->getValueAsDef("Type")), 9774c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen TP); 9784c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen 9794c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen // PointerLikeRegClass has a type that is determined at runtime. 9804c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen if (Operand->isSubClassOf("PointerLikeRegClass")) 9814c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen return UpdateNodeType(ResNo, MVT::iPTR, TP); 9824c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen 9834c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen // Both RegisterClass and RegisterOperand operands derive their types from a 9844c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen // register class def. 985dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines Record *RC = nullptr; 9864c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen if (Operand->isSubClassOf("RegisterClass")) 9874c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen RC = Operand; 9884c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen else if (Operand->isSubClassOf("RegisterOperand")) 9894c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen RC = Operand->getValueAsDef("RegClass"); 9904c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen 9914c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen assert(RC && "Unknown operand type"); 9924c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen CodeGenTarget &Tgt = TP.getDAGPatterns().getTargetInfo(); 9934c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen return UpdateNodeType(ResNo, Tgt.getRegisterClass(RC).getValueTypes(), TP); 9944c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen} 9954c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen 9964c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen 9976cefb77a7073057fecd721ae141140d75ce76512Chris Lattner//===----------------------------------------------------------------------===// 9986cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// SDNodeInfo implementation 9996cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// 10006cefb77a7073057fecd721ae141140d75ce76512Chris LattnerSDNodeInfo::SDNodeInfo(Record *R) : Def(R) { 10016cefb77a7073057fecd721ae141140d75ce76512Chris Lattner EnumName = R->getValueAsString("Opcode"); 10026cefb77a7073057fecd721ae141140d75ce76512Chris Lattner SDClassName = R->getValueAsString("SDClass"); 10036cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Record *TypeProfile = R->getValueAsDef("TypeProfile"); 10046cefb77a7073057fecd721ae141140d75ce76512Chris Lattner NumResults = TypeProfile->getValueAsInt("NumResults"); 10056cefb77a7073057fecd721ae141140d75ce76512Chris Lattner NumOperands = TypeProfile->getValueAsInt("NumOperands"); 1006fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 10076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Parse the properties. 10086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Properties = 0; 10096cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<Record*> PropList = R->getValueAsListOfDefs("Properties"); 10106cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = PropList.size(); i != e; ++i) { 10116cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (PropList[i]->getName() == "SDNPCommutative") { 10126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Properties |= 1 << SDNPCommutative; 10136cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else if (PropList[i]->getName() == "SDNPAssociative") { 10146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Properties |= 1 << SDNPAssociative; 10156cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else if (PropList[i]->getName() == "SDNPHasChain") { 10166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Properties |= 1 << SDNPHasChain; 1017036609bd7d42ed1f57865969e059eb7d1eb6c392Chris Lattner } else if (PropList[i]->getName() == "SDNPOutGlue") { 1018036609bd7d42ed1f57865969e059eb7d1eb6c392Chris Lattner Properties |= 1 << SDNPOutGlue; 1019036609bd7d42ed1f57865969e059eb7d1eb6c392Chris Lattner } else if (PropList[i]->getName() == "SDNPInGlue") { 1020036609bd7d42ed1f57865969e059eb7d1eb6c392Chris Lattner Properties |= 1 << SDNPInGlue; 1021036609bd7d42ed1f57865969e059eb7d1eb6c392Chris Lattner } else if (PropList[i]->getName() == "SDNPOptInGlue") { 1022036609bd7d42ed1f57865969e059eb7d1eb6c392Chris Lattner Properties |= 1 << SDNPOptInGlue; 1023c8478d8b12c2d7e4cea32d0c9940f5cac2baa4ddChris Lattner } else if (PropList[i]->getName() == "SDNPMayStore") { 1024c8478d8b12c2d7e4cea32d0c9940f5cac2baa4ddChris Lattner Properties |= 1 << SDNPMayStore; 1025710e995889c71812743f3f33861c24273f4569a7Chris Lattner } else if (PropList[i]->getName() == "SDNPMayLoad") { 1026710e995889c71812743f3f33861c24273f4569a7Chris Lattner Properties |= 1 << SDNPMayLoad; 1027bc0b9f70ae072d695e0eb7ceb729b3306b0679feChris Lattner } else if (PropList[i]->getName() == "SDNPSideEffect") { 1028bc0b9f70ae072d695e0eb7ceb729b3306b0679feChris Lattner Properties |= 1 << SDNPSideEffect; 102928873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang } else if (PropList[i]->getName() == "SDNPMemOperand") { 103028873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang Properties |= 1 << SDNPMemOperand; 1031e8cabf3c2eb835f9189a39c810654d9bd302f7eeChris Lattner } else if (PropList[i]->getName() == "SDNPVariadic") { 1032e8cabf3c2eb835f9189a39c810654d9bd302f7eeChris Lattner Properties |= 1 << SDNPVariadic; 10336cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else { 10341a55180238dbcf11113f610aea010447e51f595bDaniel Dunbar errs() << "Unknown SD Node property '" << PropList[i]->getName() 10351a55180238dbcf11113f610aea010447e51f595bDaniel Dunbar << "' on node '" << R->getName() << "'!\n"; 10366cefb77a7073057fecd721ae141140d75ce76512Chris Lattner exit(1); 10376cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 10386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 1039fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1040fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 10416cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Parse the type constraints. 10426cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<Record*> ConstraintList = 10436cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TypeProfile->getValueAsListOfDefs("Constraints"); 10446cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TypeConstraints.assign(ConstraintList.begin(), ConstraintList.end()); 10456cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 10466cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 1047225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner/// getKnownType - If the type constraints on this node imply a fixed type 1048225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner/// (e.g. all stores return void, etc), then return it as an 1049aac5b5b2e5eaf2e5bd62f9b96270e31d46125f4fChris Lattner/// MVT::SimpleValueType. Otherwise, return EEVT::Other. 1050084df627c82fdf4e1829723edf0a833b5bc31f89Chris LattnerMVT::SimpleValueType SDNodeInfo::getKnownType(unsigned ResNo) const { 1051225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner unsigned NumResults = getNumResults(); 1052225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner assert(NumResults <= 1 && 1053225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner "We only work with nodes with zero or one result so far!"); 1054084df627c82fdf4e1829723edf0a833b5bc31f89Chris Lattner assert(ResNo == 0 && "Only handles single result nodes so far"); 1055fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1056225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner for (unsigned i = 0, e = TypeConstraints.size(); i != e; ++i) { 1057225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner // Make sure that this applies to the correct node result. 1058225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner if (TypeConstraints[i].OperandNo >= NumResults) // FIXME: need value # 1059225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner continue; 1060fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1061225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner switch (TypeConstraints[i].ConstraintType) { 1062225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner default: break; 1063225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner case SDTypeConstraint::SDTCisVT: 1064225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner return TypeConstraints[i].x.SDTCisVT_Info.VT; 1065225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner case SDTypeConstraint::SDTCisPtrTy: 1066225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner return MVT::iPTR; 1067225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner } 1068225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner } 1069aac5b5b2e5eaf2e5bd62f9b96270e31d46125f4fChris Lattner return MVT::Other; 1070225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner} 1071225798143dbec36685f9d1e2fa82f5c4e70b0bf5Chris Lattner 10726cefb77a7073057fecd721ae141140d75ce76512Chris Lattner//===----------------------------------------------------------------------===// 10736cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// TreePatternNode implementation 10746cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// 10756cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 10766cefb77a7073057fecd721ae141140d75ce76512Chris LattnerTreePatternNode::~TreePatternNode() { 10776cefb77a7073057fecd721ae141140d75ce76512Chris Lattner#if 0 // FIXME: implement refcounted tree nodes! 10786cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = getNumChildren(); i != e; ++i) 10796cefb77a7073057fecd721ae141140d75ce76512Chris Lattner delete getChild(i); 10806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner#endif 10816cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 10826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 1083d7349194650386d97a1d779369cb46f20ba9f252Chris Lattnerstatic unsigned GetNumNodeResults(Record *Operator, CodeGenDAGPatterns &CDP) { 1084d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (Operator->getName() == "set" || 1085310adf1c6f58921b30fde145fd15cb1798050205Chris Lattner Operator->getName() == "implicit") 1086d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return 0; // All return nothing. 1087fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 108893dc92e412fd06250e46951bffb6040eca9baebdChris Lattner if (Operator->isSubClassOf("Intrinsic")) 108993dc92e412fd06250e46951bffb6040eca9baebdChris Lattner return CDP.getIntrinsic(Operator).IS.RetVTs.size(); 1090fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1091d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (Operator->isSubClassOf("SDNode")) 1092d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return CDP.getSDNodeInfo(Operator).getNumResults(); 1093fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1094d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (Operator->isSubClassOf("PatFrag")) { 1095d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner // If we've already parsed this pattern fragment, get it. Otherwise, handle 1096d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner // the forward reference case where one pattern fragment references another 1097d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner // before it is processed. 1098d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (TreePattern *PFRec = CDP.getPatternFragmentIfRead(Operator)) 1099d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return PFRec->getOnlyTree()->getNumTypes(); 1100fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1101d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner // Get the result tree. 110205bce0beee87512e52428d4b80f5a8e79a949576David Greene DagInit *Tree = Operator->getValueAsDag("Fragment"); 1103dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines Record *Op = nullptr; 11043f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva if (Tree) 11053f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva if (DefInit *DI = dyn_cast<DefInit>(Tree->getOperator())) 11063f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva Op = DI->getDef(); 1107d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner assert(Op && "Invalid Fragment"); 1108d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return GetNumNodeResults(Op, CDP); 1109d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner } 1110fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1111d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (Operator->isSubClassOf("Instruction")) { 1112d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner CodeGenInstruction &InstInfo = CDP.getTargetInfo().getInstruction(Operator); 11130be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner 11140be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner // FIXME: Should allow access to all the results here. 1115c240bb0ede0541426254d0e0dc81d891beda4b22Chris Lattner unsigned NumDefsToAdd = InstInfo.Operands.NumDefs ? 1 : 0; 1116fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 11179414ae52911f1d62cabd5108e0381b9d17476157Chris Lattner // Add on one implicit def if it has a resolvable type. 11189414ae52911f1d62cabd5108e0381b9d17476157Chris Lattner if (InstInfo.HasOneImplicitDefWithKnownVT(CDP.getTargetInfo()) !=MVT::Other) 11199414ae52911f1d62cabd5108e0381b9d17476157Chris Lattner ++NumDefsToAdd; 11200be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner return NumDefsToAdd; 1121d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner } 1122fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1123d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (Operator->isSubClassOf("SDNodeXForm")) 1124d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return 1; // FIXME: Generalize SDNodeXForm 1125fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 112636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (Operator->isSubClassOf("ValueType")) 112736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines return 1; // A type-cast of one result. 112836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 1129dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (Operator->isSubClassOf("ComplexPattern")) 1130dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return 1; 1131dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 1132d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner Operator->dump(); 1133d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner errs() << "Unhandled node in GetNumNodeResults\n"; 1134d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner exit(1); 1135d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner} 11366cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 11371a55180238dbcf11113f610aea010447e51f595bDaniel Dunbarvoid TreePatternNode::print(raw_ostream &OS) const { 1138d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (isLeaf()) 11396cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << *getLeafValue(); 1140d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner else 1141ba1cff4450e22415bfcb960342e6d5a5918e530aChris Lattner OS << '(' << getOperator()->getName(); 1142d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner 1143d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner for (unsigned i = 0, e = Types.size(); i != e; ++i) 1144d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner OS << ':' << getExtType(i).getName(); 11456cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 11466cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!isLeaf()) { 11476cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (getNumChildren() != 0) { 11486cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << " "; 11496cefb77a7073057fecd721ae141140d75ce76512Chris Lattner getChild(0)->print(OS); 11506cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 1, e = getNumChildren(); i != e; ++i) { 11516cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << ", "; 11526cefb77a7073057fecd721ae141140d75ce76512Chris Lattner getChild(i)->print(OS); 11536cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 11546cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 11556cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << ")"; 11566cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 1157fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 11580540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman for (unsigned i = 0, e = PredicateFns.size(); i != e; ++i) 1159543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner OS << "<<P:" << PredicateFns[i].getFnName() << ">>"; 11606cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (TransformFn) 11616cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << "<<X:" << TransformFn->getName() << ">>"; 11626cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!getName().empty()) 11636cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << ":$" << getName(); 11646cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 11656cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 11666cefb77a7073057fecd721ae141140d75ce76512Chris Lattnervoid TreePatternNode::dump() const { 11671a55180238dbcf11113f610aea010447e51f595bDaniel Dunbar print(errs()); 11686cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 11696cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 1170327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel/// isIsomorphicTo - Return true if this node is recursively 1171327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel/// isomorphic to the specified node. For this comparison, the node's 1172327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel/// entire state is considered. The assigned name is ignored, since 1173327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel/// nodes with differing names are considered isomorphic. However, if 1174327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel/// the assigned name is present in the dependent variable set, then 1175327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel/// the assigned name is considered significant and the node is 1176327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel/// isomorphic if the names match. 1177327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michelbool TreePatternNode::isIsomorphicTo(const TreePatternNode *N, 1178327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel const MultipleUseVarSet &DepVars) const { 11796cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (N == this) return true; 1180d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (N->isLeaf() != isLeaf() || getExtTypes() != N->getExtTypes() || 11810540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman getPredicateFns() != N->getPredicateFns() || 11826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner getTransformFn() != N->getTransformFn()) 11836cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return false; 11846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 11856cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (isLeaf()) { 11866cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva if (DefInit *DI = dyn_cast<DefInit>(getLeafValue())) { 11876cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva if (DefInit *NDI = dyn_cast<DefInit>(N->getLeafValue())) { 118871a2cb25ebc818383dd0f80475bc166f834e8d99Chris Lattner return ((DI->getDef() == NDI->getDef()) 118971a2cb25ebc818383dd0f80475bc166f834e8d99Chris Lattner && (DepVars.find(getName()) == DepVars.end() 119071a2cb25ebc818383dd0f80475bc166f834e8d99Chris Lattner || getName() == N->getName())); 1191327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel } 1192327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel } 11936cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return getLeafValue() == N->getLeafValue(); 11946cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 1195fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 11966cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (N->getOperator() != getOperator() || 11976cefb77a7073057fecd721ae141140d75ce76512Chris Lattner N->getNumChildren() != getNumChildren()) return false; 11986cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = getNumChildren(); i != e; ++i) 1199327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel if (!getChild(i)->isIsomorphicTo(N->getChild(i), DepVars)) 12006cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return false; 12016cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return true; 12026cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 12036cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 12046cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// clone - Make a copy of this tree and all of its children. 12056cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// 12066cefb77a7073057fecd721ae141140d75ce76512Chris LattnerTreePatternNode *TreePatternNode::clone() const { 12076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *New; 12086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (isLeaf()) { 1209d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner New = new TreePatternNode(getLeafValue(), getNumTypes()); 12106cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else { 12116cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> CChildren; 12126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner CChildren.reserve(Children.size()); 12136cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = getNumChildren(); i != e; ++i) 12146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner CChildren.push_back(getChild(i)->clone()); 1215d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner New = new TreePatternNode(getOperator(), CChildren, getNumTypes()); 12166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 12176cefb77a7073057fecd721ae141140d75ce76512Chris Lattner New->setName(getName()); 1218d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner New->Types = Types; 12190540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman New->setPredicateFns(getPredicateFns()); 12206cefb77a7073057fecd721ae141140d75ce76512Chris Lattner New->setTransformFn(getTransformFn()); 12216cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return New; 12226cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 12236cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 122447661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner/// RemoveAllTypes - Recursively strip all the types of this tree. 122547661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattnervoid TreePatternNode::RemoveAllTypes() { 1226d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner for (unsigned i = 0, e = Types.size(); i != e; ++i) 1227d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner Types[i] = EEVT::TypeSet(); // Reset to unknown type. 122847661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner if (isLeaf()) return; 122947661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner for (unsigned i = 0, e = getNumChildren(); i != e; ++i) 123047661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner getChild(i)->RemoveAllTypes(); 123147661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner} 123247661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner 123347661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner 12346cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// SubstituteFormalArguments - Replace the formal arguments in this tree 12356cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// with actual values specified by ArgMap. 12366cefb77a7073057fecd721ae141140d75ce76512Chris Lattnervoid TreePatternNode:: 12376cefb77a7073057fecd721ae141140d75ce76512Chris LattnerSubstituteFormalArguments(std::map<std::string, TreePatternNode*> &ArgMap) { 12386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (isLeaf()) return; 1239fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 12406cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = getNumChildren(); i != e; ++i) { 12416cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *Child = getChild(i); 12426cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Child->isLeaf()) { 124305bce0beee87512e52428d4b80f5a8e79a949576David Greene Init *Val = Child->getLeafValue(); 124436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // Note that, when substituting into an output pattern, Val might be an 124536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // UnsetInit. 124636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (isa<UnsetInit>(Val) || (isa<DefInit>(Val) && 124736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines cast<DefInit>(Val)->getDef()->getName() == "node")) { 12486cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // We found a use of a formal argument, replace it with its value. 12490540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman TreePatternNode *NewChild = ArgMap[Child->getName()]; 12500540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman assert(NewChild && "Couldn't find formal argument!"); 12510540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman assert((Child->getPredicateFns().empty() || 12520540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman NewChild->getPredicateFns() == Child->getPredicateFns()) && 12530540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman "Non-empty child predicate clobbered!"); 12540540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman setChild(i, NewChild); 12556cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 12566cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else { 12576cefb77a7073057fecd721ae141140d75ce76512Chris Lattner getChild(i)->SubstituteFormalArguments(ArgMap); 12586cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 12596cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 12606cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 12616cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 12626cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 12636cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// InlinePatternFragments - If this pattern refers to any pattern 12646cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// fragments, inline them into place, giving us a pattern without any 12656cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// PatFrag references. 12666cefb77a7073057fecd721ae141140d75ce76512Chris LattnerTreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) { 126761131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TP.hasError()) 1268dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return nullptr; 126961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger 127061131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (isLeaf()) 127161131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return this; // nothing to do. 12726cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Record *Op = getOperator(); 1273fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 12746cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!Op->isSubClassOf("PatFrag")) { 12756cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Just recursively inline children nodes. 12760540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman for (unsigned i = 0, e = getNumChildren(); i != e; ++i) { 12770540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman TreePatternNode *Child = getChild(i); 12780540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman TreePatternNode *NewChild = Child->InlinePatternFragments(TP); 12790540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman 12800540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman assert((Child->getPredicateFns().empty() || 12810540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman NewChild->getPredicateFns() == Child->getPredicateFns()) && 12820540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman "Non-empty child predicate clobbered!"); 12830540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman 12840540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman setChild(i, NewChild); 12850540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman } 12866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return this; 12876cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 12886cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 12896cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Otherwise, we found a reference to a fragment. First, look up its 12906cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // TreePattern record. 12916cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePattern *Frag = TP.getDAGPatterns().getPatternFragment(Op); 1292fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 12936cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Verify that we are passing the right number of operands. 129461131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (Frag->getNumArgs() != Children.size()) { 12956cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TP.error("'" + Op->getName() + "' fragment requires " + 12966cefb77a7073057fecd721ae141140d75ce76512Chris Lattner utostr(Frag->getNumArgs()) + " operands!"); 1297dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return nullptr; 129861131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 12996cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 13006cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *FragTree = Frag->getOnlyTree()->clone(); 13016cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 1302543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner TreePredicateFn PredFn(Frag); 1303543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner if (!PredFn.isAlwaysTrue()) 1304543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner FragTree->addPredicateFn(PredFn); 13050540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman 13066cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Resolve formal arguments to their actual value. 13076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Frag->getNumArgs()) { 13086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Compute the map of formal to actual arguments. 13096cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::map<std::string, TreePatternNode*> ArgMap; 13106cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i) 13116cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP); 1312fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 13136cefb77a7073057fecd721ae141140d75ce76512Chris Lattner FragTree->SubstituteFormalArguments(ArgMap); 13146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 1315fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 13166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner FragTree->setName(getName()); 1317d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner for (unsigned i = 0, e = Types.size(); i != e; ++i) 1318d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner FragTree->UpdateNodeType(i, getExtType(i), TP); 13190540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman 13200540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman // Transfer in the old predicates. 13210540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman for (unsigned i = 0, e = getPredicateFns().size(); i != e; ++i) 13220540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman FragTree->addPredicateFn(getPredicateFns()[i]); 13230540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman 13246cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Get a new copy of this fragment to stitch into here. 13256cefb77a7073057fecd721ae141140d75ce76512Chris Lattner //delete this; // FIXME: implement refcounting! 1326fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 13272ca698df93421327a459987b33b045756cb47d4dChris Lattner // The fragment we inlined could have recursive inlining that is needed. See 13282ca698df93421327a459987b33b045756cb47d4dChris Lattner // if there are any pattern fragments in it and inline them as needed. 13292ca698df93421327a459987b33b045756cb47d4dChris Lattner return FragTree->InlinePatternFragments(TP); 13306cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 13316cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 13326cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// getImplicitType - Check to see if the specified record has an implicit 1333fc4c25530412907f566519dd4d0979a6570222b3Nick Lewycky/// type which should be applied to it. This will infer the type of register 13346cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// references from the register file information, for example. 13356cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// 13367a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen/// When Unnamed is set, return the type of a DAG operand with no name, such as 13377a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen/// the F8RC register class argument in: 13387a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen/// 13397a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen/// (COPY_TO_REGCLASS GPR:$src, F8RC) 13407a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen/// 13417a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen/// When Unnamed is false, return the type of a named DAG operand such as the 13427a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen/// GPR:$src operand above. 13437a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen/// 1344d7349194650386d97a1d779369cb46f20ba9f252Chris Lattnerstatic EEVT::TypeSet getImplicitType(Record *R, unsigned ResNo, 13457a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen bool NotRegisters, 13467a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen bool Unnamed, 13477a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen TreePattern &TP) { 1348bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson // Check to see if this is a register operand. 1349bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson if (R->isSubClassOf("RegisterOperand")) { 1350bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson assert(ResNo == 0 && "Regoperand ref only has one result!"); 1351bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson if (NotRegisters) 1352bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson return EEVT::TypeSet(); // Unknown. 1353bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson Record *RegClass = R->getValueAsDef("RegClass"); 1354bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo(); 1355bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson return EEVT::TypeSet(T.getRegisterClass(RegClass).getValueTypes()); 1356bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson } 1357bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson 13582cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Check to see if this is a register or a register class. 13596cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (R->isSubClassOf("RegisterClass")) { 1360640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner assert(ResNo == 0 && "Regclass ref only has one result!"); 13617a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen // An unnamed register class represents itself as an i32 immediate, for 13627a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen // example on a COPY_TO_REGCLASS instruction. 13637a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen if (Unnamed) 13647a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen return EEVT::TypeSet(MVT::i32, TP); 13657a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen 13667a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen // In a named operand, the register class provides the possible set of 13677a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen // types. 1368fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach if (NotRegisters) 13692cacec55f947c716b058a39038889550d7e39b3cChris Lattner return EEVT::TypeSet(); // Unknown. 13702cacec55f947c716b058a39038889550d7e39b3cChris Lattner const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo(); 13712cacec55f947c716b058a39038889550d7e39b3cChris Lattner return EEVT::TypeSet(T.getRegisterClass(R).getValueTypes()); 1372640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner } 1373fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1374640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner if (R->isSubClassOf("PatFrag")) { 1375640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner assert(ResNo == 0 && "FIXME: PatFrag with multiple results?"); 13766cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Pattern fragment types will be resolved when they are inlined. 13772cacec55f947c716b058a39038889550d7e39b3cChris Lattner return EEVT::TypeSet(); // Unknown. 1378640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner } 1379fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1380640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner if (R->isSubClassOf("Register")) { 1381640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner assert(ResNo == 0 && "Registers only produce one result!"); 1382fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach if (NotRegisters) 13832cacec55f947c716b058a39038889550d7e39b3cChris Lattner return EEVT::TypeSet(); // Unknown. 13846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo(); 13852cacec55f947c716b058a39038889550d7e39b3cChris Lattner return EEVT::TypeSet(T.getRegisterVTs(R)); 1386640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner } 138773ea7bf4509663267317ec3911aac00ca35a2f2cJakob Stoklund Olesen 138873ea7bf4509663267317ec3911aac00ca35a2f2cJakob Stoklund Olesen if (R->isSubClassOf("SubRegIndex")) { 138973ea7bf4509663267317ec3911aac00ca35a2f2cJakob Stoklund Olesen assert(ResNo == 0 && "SubRegisterIndices only produce one result!"); 139073ea7bf4509663267317ec3911aac00ca35a2f2cJakob Stoklund Olesen return EEVT::TypeSet(); 139173ea7bf4509663267317ec3911aac00ca35a2f2cJakob Stoklund Olesen } 1392fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1393f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen if (R->isSubClassOf("ValueType")) { 1394640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner assert(ResNo == 0 && "This node only has one result!"); 1395f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen // An unnamed VTSDNode represents itself as an MVT::Other immediate. 1396f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen // 1397f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen // (sext_inreg GPR:$src, i16) 1398f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen // ~~~ 1399f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen if (Unnamed) 1400f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen return EEVT::TypeSet(MVT::Other, TP); 1401f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen // With a name, the ValueType simply provides the type of the named 1402f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen // variable. 1403f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen // 1404f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen // (sext_inreg i32:$src, i16) 1405f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen // ~~~~~~~~ 140619209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen if (NotRegisters) 140719209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen return EEVT::TypeSet(); // Unknown. 1408f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen return EEVT::TypeSet(getValueType(R), TP); 1409f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen } 1410f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen 1411f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen if (R->isSubClassOf("CondCode")) { 1412f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen assert(ResNo == 0 && "This node only has one result!"); 1413f0a804df493e28e75cfc4ca930c53199b8d1e985Jakob Stoklund Olesen // Using a CondCodeSDNode. 14142cacec55f947c716b058a39038889550d7e39b3cChris Lattner return EEVT::TypeSet(MVT::Other, TP); 1415640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner } 1416fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1417640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner if (R->isSubClassOf("ComplexPattern")) { 1418640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner assert(ResNo == 0 && "FIXME: ComplexPattern with multiple results?"); 1419fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach if (NotRegisters) 14202cacec55f947c716b058a39038889550d7e39b3cChris Lattner return EEVT::TypeSet(); // Unknown. 14212cacec55f947c716b058a39038889550d7e39b3cChris Lattner return EEVT::TypeSet(TP.getDAGPatterns().getComplexPattern(R).getValueType(), 14222cacec55f947c716b058a39038889550d7e39b3cChris Lattner TP); 1423640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner } 1424640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner if (R->isSubClassOf("PointerLikeRegClass")) { 1425640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner assert(ResNo == 0 && "Regclass can only have one result!"); 14262cacec55f947c716b058a39038889550d7e39b3cChris Lattner return EEVT::TypeSet(MVT::iPTR, TP); 1427640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner } 1428fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1429640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner if (R->getName() == "node" || R->getName() == "srcvalue" || 1430640a3f530904a9b08228fab07ea7826af0bcab5eChris Lattner R->getName() == "zero_reg") { 14316cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Placeholder. 14322cacec55f947c716b058a39038889550d7e39b3cChris Lattner return EEVT::TypeSet(); // Unknown. 14336cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 1434fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1435dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (R->isSubClassOf("Operand")) 1436dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return EEVT::TypeSet(getValueType(R->getValueAsDef("Type"))); 1437dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 14386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TP.error("Unknown node flavor used in pattern: " + R->getName()); 14392cacec55f947c716b058a39038889550d7e39b3cChris Lattner return EEVT::TypeSet(MVT::Other, TP); 14406cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 14416cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 1442e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris Lattner 1443e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris Lattner/// getIntrinsicInfo - If this node corresponds to an intrinsic, return the 1444e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris Lattner/// CodeGenIntrinsic information for it, otherwise return a null pointer. 1445e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris Lattnerconst CodeGenIntrinsic *TreePatternNode:: 1446e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris LattnergetIntrinsicInfo(const CodeGenDAGPatterns &CDP) const { 1447e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris Lattner if (getOperator() != CDP.get_intrinsic_void_sdnode() && 1448e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris Lattner getOperator() != CDP.get_intrinsic_w_chain_sdnode() && 1449e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris Lattner getOperator() != CDP.get_intrinsic_wo_chain_sdnode()) 1450dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return nullptr; 1451fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 14523f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva unsigned IID = cast<IntInit>(getChild(0)->getLeafValue())->getValue(); 1453e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris Lattner return &CDP.getIntrinsicInfo(IID); 1454e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris Lattner} 1455e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris Lattner 145647661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner/// getComplexPatternInfo - If this node corresponds to a ComplexPattern, 145747661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner/// return the ComplexPattern information, otherwise return null. 145847661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattnerconst ComplexPattern * 145947661320363a8bf0bb1401a8c1893755fb77c8f6Chris LattnerTreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const { 1460dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines Record *Rec; 1461dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (isLeaf()) { 1462dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines DefInit *DI = dyn_cast<DefInit>(getLeafValue()); 1463dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (!DI) 1464dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return nullptr; 1465dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines Rec = DI->getDef(); 1466dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines } else 1467dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines Rec = getOperator(); 1468fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1469dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (!Rec->isSubClassOf("ComplexPattern")) 1470dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return nullptr; 1471dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return &CGP.getComplexPattern(Rec); 1472dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines} 1473dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 1474dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hinesunsigned TreePatternNode::getNumMIResults(const CodeGenDAGPatterns &CGP) const { 1475dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // A ComplexPattern specifically declares how many results it fills in. 1476dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (const ComplexPattern *CP = getComplexPatternInfo(CGP)) 1477dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return CP->getNumOperands(); 1478dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 1479dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // If MIOperandInfo is specified, that gives the count. 1480dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (isLeaf()) { 1481dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines DefInit *DI = dyn_cast<DefInit>(getLeafValue()); 1482dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (DI && DI->getDef()->isSubClassOf("Operand")) { 1483dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines DagInit *MIOps = DI->getDef()->getValueAsDag("MIOperandInfo"); 1484dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (MIOps->getNumArgs()) 1485dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return MIOps->getNumArgs(); 1486dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines } 1487dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines } 1488dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 1489dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // Otherwise there is just one result. 1490dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return 1; 149147661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner} 149247661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner 149347661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner/// NodeHasProperty - Return true if this node has the specified property. 149447661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattnerbool TreePatternNode::NodeHasProperty(SDNP Property, 1495751d5aa1eadf041f00acf76f3b641549c8be3998Chris Lattner const CodeGenDAGPatterns &CGP) const { 149647661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner if (isLeaf()) { 149747661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner if (const ComplexPattern *CP = getComplexPatternInfo(CGP)) 149847661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner return CP->hasProperty(Property); 149947661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner return false; 150047661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner } 1501fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 150247661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner Record *Operator = getOperator(); 150347661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner if (!Operator->isSubClassOf("SDNode")) return false; 1504fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 150547661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner return CGP.getSDNodeInfo(Operator).hasProperty(Property); 150647661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner} 150747661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner 150847661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner 150947661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner 151047661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner 151147661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner/// TreeHasProperty - Return true if any node in this tree has the specified 151247661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner/// property. 151347661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattnerbool TreePatternNode::TreeHasProperty(SDNP Property, 1514751d5aa1eadf041f00acf76f3b641549c8be3998Chris Lattner const CodeGenDAGPatterns &CGP) const { 151547661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner if (NodeHasProperty(Property, CGP)) 151647661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner return true; 151747661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner for (unsigned i = 0, e = getNumChildren(); i != e; ++i) 151847661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner if (getChild(i)->TreeHasProperty(Property, CGP)) 151947661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner return true; 152047661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner return false; 1521fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach} 152247661320363a8bf0bb1401a8c1893755fb77c8f6Chris Lattner 15236bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng/// isCommutativeIntrinsic - Return true if the node corresponds to a 15246bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng/// commutative intrinsic. 15256bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Chengbool 15266bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan ChengTreePatternNode::isCommutativeIntrinsic(const CodeGenDAGPatterns &CDP) const { 15276bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CDP)) 15286bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng return Int->isCommutative; 15296bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng return false; 15306bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng} 15316bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng 1532e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris Lattner 15336c01ca9e29816e36e96112ed541ecf3414a7aad2Bob Wilson/// ApplyTypeConstraints - Apply all of the type constraints relevant to 15346cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// this node and its children in the tree. This returns true if it makes a 153561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger/// change, false otherwise. If a type contradiction is found, flag an error. 15366cefb77a7073057fecd721ae141140d75ce76512Chris Lattnerbool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) { 153761131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (TP.hasError()) 153861131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 153961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger 1540fe71893183f504feff290e343bf740bd32432129Chris Lattner CodeGenDAGPatterns &CDP = TP.getDAGPatterns(); 15416cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (isLeaf()) { 15426cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva if (DefInit *DI = dyn_cast<DefInit>(getLeafValue())) { 15436cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If it's a regclass or something else known, include the type. 1544d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner bool MadeChange = false; 1545d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner for (unsigned i = 0, e = Types.size(); i != e; ++i) 1546d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= UpdateNodeType(i, getImplicitType(DI->getDef(), i, 15477a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen NotRegisters, 15487a42fb3b6e729e2446f9d53b547976e5084a59d8Jakob Stoklund Olesen !hasName(), TP), TP); 1549d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return MadeChange; 1550523f6a5848194c135168112751c36884dc704e54Chris Lattner } 1551fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 15526cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva if (IntInit *II = dyn_cast<IntInit>(getLeafValue())) { 1553d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner assert(Types.size() == 1 && "Invalid IntInit"); 1554fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 15556cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Int inits are always integers. :) 1556d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner bool MadeChange = Types[0].EnforceInteger(TP); 1557fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1558d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (!Types[0].isConcrete()) 15592cacec55f947c716b058a39038889550d7e39b3cChris Lattner return MadeChange; 1560fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1561d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MVT::SimpleValueType VT = getType(0); 15622cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (VT == MVT::iPTR || VT == MVT::iPTRAny) 15632cacec55f947c716b058a39038889550d7e39b3cChris Lattner return MadeChange; 1564fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 156549909415ca9c674a459718895e8e99053e11f143Craig Topper unsigned Size = MVT(VT).getSizeInBits(); 15662cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Make sure that the value is representable for this type. 15672cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (Size >= 32) return MadeChange; 1568fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 15691144af3c9b4da48cd581156e05b24261c8de366aRichard Smith // Check that the value doesn't use more bits than we have. It must either 15701144af3c9b4da48cd581156e05b24261c8de366aRichard Smith // be a sign- or zero-extended equivalent of the original. 15711144af3c9b4da48cd581156e05b24261c8de366aRichard Smith int64_t SignBitAndAbove = II->getValue() >> (Size - 1); 15721144af3c9b4da48cd581156e05b24261c8de366aRichard Smith if (SignBitAndAbove == -1 || SignBitAndAbove == 0 || SignBitAndAbove == 1) 15732cacec55f947c716b058a39038889550d7e39b3cChris Lattner return MadeChange; 1574fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 15751144af3c9b4da48cd581156e05b24261c8de366aRichard Smith TP.error("Integer value '" + itostr(II->getValue()) + 1576d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner "' is out of range for type '" + getEnumName(getType(0)) + "'!"); 157761131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 15786cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 15796cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return false; 15806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 1581fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 15826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // special handling for set, which isn't really an SDNode. 15836cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (getOperator()->getName() == "set") { 1584d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner assert(getNumTypes() == 0 && "Set doesn't produce a value"); 1585d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner assert(getNumChildren() >= 2 && "Missing RHS of a set?"); 15866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner unsigned NC = getNumChildren(); 1587fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1588d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner TreePatternNode *SetVal = getChild(NC-1); 1589d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner bool MadeChange = SetVal->ApplyTypeConstraints(TP, NotRegisters); 1590d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner 15916cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0; i < NC-1; ++i) { 1592d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner TreePatternNode *Child = getChild(i); 1593d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= Child->ApplyTypeConstraints(TP, NotRegisters); 1594fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 15956cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Types of operands must match. 1596d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= Child->UpdateNodeType(0, SetVal->getExtType(i), TP); 1597d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= SetVal->UpdateNodeType(i, Child->getExtType(0), TP); 15986cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 15996cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return MadeChange; 16006eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner } 1601fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1602310adf1c6f58921b30fde145fd15cb1798050205Chris Lattner if (getOperator()->getName() == "implicit") { 1603d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner assert(getNumTypes() == 0 && "Node doesn't produce a value"); 1604d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner 16056cefb77a7073057fecd721ae141140d75ce76512Chris Lattner bool MadeChange = false; 16066cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0; i < getNumChildren(); ++i) 16076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner MadeChange = getChild(i)->ApplyTypeConstraints(TP, NotRegisters); 16086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return MadeChange; 16096eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner } 1610fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 16116eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CDP)) { 16126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner bool MadeChange = false; 161383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands 16146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Apply the result type to the node. 1615cdcc3e6e12b8b4e224bd62c96768c5f5e325aaceBill Wendling unsigned NumRetVTs = Int->IS.RetVTs.size(); 1616cdcc3e6e12b8b4e224bd62c96768c5f5e325aaceBill Wendling unsigned NumParamVTs = Int->IS.ParamVTs.size(); 1617fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1618cdcc3e6e12b8b4e224bd62c96768c5f5e325aaceBill Wendling for (unsigned i = 0, e = NumRetVTs; i != e; ++i) 1619d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= UpdateNodeType(i, Int->IS.RetVTs[i], TP); 1620cdcc3e6e12b8b4e224bd62c96768c5f5e325aaceBill Wendling 162161131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (getNumChildren() != NumParamVTs + 1) { 1622e67bde5bb1959dbd7085981cb0bcf6f7c749f724Chris Lattner TP.error("Intrinsic '" + Int->Name + "' expects " + 1623d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner utostr(NumParamVTs) + " operands, not " + 1624cdcc3e6e12b8b4e224bd62c96768c5f5e325aaceBill Wendling utostr(getNumChildren() - 1) + " operands!"); 162561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 162661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 16276cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 16286cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Apply type info to the intrinsic ID. 1629d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= getChild(0)->UpdateNodeType(0, MVT::iPTR, TP); 1630fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1631d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) { 1632d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= getChild(i+1)->ApplyTypeConstraints(TP, NotRegisters); 1633fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1634d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MVT::SimpleValueType OpVT = Int->IS.ParamVTs[i]; 1635d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner assert(getChild(i+1)->getNumTypes() == 1 && "Unhandled case"); 1636d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= getChild(i+1)->UpdateNodeType(0, OpVT, TP); 16376cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 16386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return MadeChange; 16396eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner } 1640fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 16416eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner if (getOperator()->isSubClassOf("SDNode")) { 16426cefb77a7073057fecd721ae141140d75ce76512Chris Lattner const SDNodeInfo &NI = CDP.getSDNodeInfo(getOperator()); 1643fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 16442a22cdc716ea652d6c9ebdaae028b5c75ab2793aChris Lattner // Check that the number of operands is sane. Negative operands -> varargs. 16452a22cdc716ea652d6c9ebdaae028b5c75ab2793aChris Lattner if (NI.getNumOperands() >= 0 && 164661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger getNumChildren() != (unsigned)NI.getNumOperands()) { 16472a22cdc716ea652d6c9ebdaae028b5c75ab2793aChris Lattner TP.error(getOperator()->getName() + " node requires exactly " + 16482a22cdc716ea652d6c9ebdaae028b5c75ab2793aChris Lattner itostr(NI.getNumOperands()) + " operands!"); 164961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 165061131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 1651fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 16526cefb77a7073057fecd721ae141140d75ce76512Chris Lattner bool MadeChange = NI.ApplyTypeConstraints(this, TP); 16536cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = getNumChildren(); i != e; ++i) 16546cefb77a7073057fecd721ae141140d75ce76512Chris Lattner MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters); 1655d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return MadeChange; 16566eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner } 1657fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 16586eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner if (getOperator()->isSubClassOf("Instruction")) { 16596cefb77a7073057fecd721ae141140d75ce76512Chris Lattner const DAGInstruction &Inst = CDP.getInstruction(getOperator()); 16606cefb77a7073057fecd721ae141140d75ce76512Chris Lattner CodeGenInstruction &InstInfo = 1661f30187a36324fb75042d9ffd20c3fb70aff7763dChris Lattner CDP.getTargetInfo().getInstruction(getOperator()); 1662fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 16630be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner bool MadeChange = false; 16640be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner 16650be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner // Apply the result types to the node, these come from the things in the 16660be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner // (outs) list of the instruction. 16670be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner // FIXME: Cap at one result so far. 1668c240bb0ede0541426254d0e0dc81d891beda4b22Chris Lattner unsigned NumResultsToAdd = InstInfo.Operands.NumDefs ? 1 : 0; 16694c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen for (unsigned ResNo = 0; ResNo != NumResultsToAdd; ++ResNo) 16704c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen MadeChange |= UpdateNodeTypeFromInst(ResNo, Inst.getResult(ResNo), TP); 1671fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 16720be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner // If the instruction has implicit defs, we apply the first one as a result. 16730be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner // FIXME: This sucks, it should apply all implicit defs. 16740be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner if (!InstInfo.ImplicitDefs.empty()) { 16750be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner unsigned ResNo = NumResultsToAdd; 1676fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 16779414ae52911f1d62cabd5108e0381b9d17476157Chris Lattner // FIXME: Generalize to multiple possible types and multiple possible 16789414ae52911f1d62cabd5108e0381b9d17476157Chris Lattner // ImplicitDefs. 16799414ae52911f1d62cabd5108e0381b9d17476157Chris Lattner MVT::SimpleValueType VT = 16809414ae52911f1d62cabd5108e0381b9d17476157Chris Lattner InstInfo.HasOneImplicitDefWithKnownVT(CDP.getTargetInfo()); 1681fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 16829414ae52911f1d62cabd5108e0381b9d17476157Chris Lattner if (VT != MVT::Other) 16839414ae52911f1d62cabd5108e0381b9d17476157Chris Lattner MadeChange |= UpdateNodeType(ResNo, VT, TP); 16846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 1685fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 16862cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If this is an INSERT_SUBREG, constrain the source and destination VTs to 16872cacec55f947c716b058a39038889550d7e39b3cChris Lattner // be the same. 16882cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (getOperator()->getName() == "INSERT_SUBREG") { 1689d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner assert(getChild(0)->getNumTypes() == 1 && "FIXME: Unhandled"); 1690d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= UpdateNodeType(0, getChild(0)->getExtType(0), TP); 1691d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= getChild(0)->UpdateNodeType(0, getExtType(0), TP); 16922cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 16936cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 16946cefb77a7073057fecd721ae141140d75ce76512Chris Lattner unsigned ChildNo = 0; 16956cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = Inst.getNumOperands(); i != e; ++i) { 16966cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Record *OperandNode = Inst.getOperand(i); 1697fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 16986cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If the instruction expects a predicate or optional def operand, we 16996cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // codegen this by setting the operand to it's default value if it has a 17006cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // non-empty DefaultOps field. 17016d3d7656539188b496089a3313ed4d13759adba3Tom Stellard if (OperandNode->isSubClassOf("OperandWithDefaultOps") && 17026cefb77a7073057fecd721ae141140d75ce76512Chris Lattner !CDP.getDefaultOperand(OperandNode).DefaultOps.empty()) 17036cefb77a7073057fecd721ae141140d75ce76512Chris Lattner continue; 1704fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 17056cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Verify that we didn't run out of provided operands. 170661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (ChildNo >= getNumChildren()) { 17076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TP.error("Instruction '" + getOperator()->getName() + 17086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner "' expects more operands than were provided."); 170961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 171061131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 1711fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 17126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *Child = getChild(ChildNo++); 17130be6fe71390c50b211beb70e6c50e5fae060f746Chris Lattner unsigned ChildResNo = 0; // Instructions always use res #0 of their op. 1714ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand 1715ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand // If the operand has sub-operands, they may be provided by distinct 1716ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand // child patterns, so attempt to match each sub-operand separately. 1717ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand if (OperandNode->isSubClassOf("Operand")) { 1718ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand DagInit *MIOpInfo = OperandNode->getValueAsDag("MIOperandInfo"); 1719ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand if (unsigned NumArgs = MIOpInfo->getNumArgs()) { 1720ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand // But don't do that if the whole operand is being provided by 1721dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // a single ComplexPattern-related Operand. 1722dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 1723dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (Child->getNumMIResults(CDP) < NumArgs) { 1724ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand // Match first sub-operand against the child we already have. 1725ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand Record *SubRec = cast<DefInit>(MIOpInfo->getArg(0))->getDef(); 1726ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand MadeChange |= 1727ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand Child->UpdateNodeTypeFromInst(ChildResNo, SubRec, TP); 1728ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand 1729ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand // And the remaining sub-operands against subsequent children. 1730ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand for (unsigned Arg = 1; Arg < NumArgs; ++Arg) { 1731ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand if (ChildNo >= getNumChildren()) { 1732ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand TP.error("Instruction '" + getOperator()->getName() + 1733ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand "' expects more operands than were provided."); 1734ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand return false; 1735ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand } 1736ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand Child = getChild(ChildNo++); 1737ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand 1738ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand SubRec = cast<DefInit>(MIOpInfo->getArg(Arg))->getDef(); 1739ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand MadeChange |= 1740ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand Child->UpdateNodeTypeFromInst(ChildResNo, SubRec, TP); 1741ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand } 1742ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand continue; 1743ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand } 1744ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand } 1745ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand } 1746ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand 1747ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand // If we didn't match by pieces above, attempt to match the whole 1748ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand // operand now. 17494c16916883c5012e14a84b186cbfee33bfb14027Jakob Stoklund Olesen MadeChange |= Child->UpdateNodeTypeFromInst(ChildResNo, OperandNode, TP); 17506cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 17515b4153710e0b94b0af10d4838216ee112d4b37bcChristopher Lamb 175261131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (ChildNo != getNumChildren()) { 17536cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TP.error("Instruction '" + getOperator()->getName() + 17546cefb77a7073057fecd721ae141140d75ce76512Chris Lattner "' was provided too many operands!"); 175561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 175661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 1757fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1758ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand for (unsigned i = 0, e = getNumChildren(); i != e; ++i) 1759ec8d1a5b72b1cb2d230ba52b25a017231393b182Ulrich Weigand MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters); 17606cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return MadeChange; 17616cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 1762fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1763dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (getOperator()->isSubClassOf("ComplexPattern")) { 1764dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines bool MadeChange = false; 1765dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 1766dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines for (unsigned i = 0; i < getNumChildren(); ++i) 1767dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters); 1768dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 1769dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return MadeChange; 1770dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines } 1771dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 17726eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!"); 1773fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 17746eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner // Node transforms always take one operand. 177561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (getNumChildren() != 1) { 17766eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner TP.error("Node transform '" + getOperator()->getName() + 17776eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner "' requires one operand!"); 177861131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return false; 177961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger } 17806eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner 17812cacec55f947c716b058a39038889550d7e39b3cChris Lattner bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters); 17822cacec55f947c716b058a39038889550d7e39b3cChris Lattner 1783fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 17846eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner // If either the output or input of the xform does not have exact 17856eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner // type info. We assume they must be the same. Otherwise, it is perfectly 17866eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner // legal to transform from one type to a completely different type. 17872cacec55f947c716b058a39038889550d7e39b3cChris Lattner#if 0 17886eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner if (!hasTypeSet() || !getChild(0)->hasTypeSet()) { 17892cacec55f947c716b058a39038889550d7e39b3cChris Lattner bool MadeChange = UpdateNodeType(getChild(0)->getExtType(), TP); 17902cacec55f947c716b058a39038889550d7e39b3cChris Lattner MadeChange |= getChild(0)->UpdateNodeType(getExtType(), TP); 17916eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner return MadeChange; 17926eb3012b454b8dd3588236333a6bc57e9e6128b1Chris Lattner } 17932cacec55f947c716b058a39038889550d7e39b3cChris Lattner#endif 17942cacec55f947c716b058a39038889550d7e39b3cChris Lattner return MadeChange; 17956cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 17966cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 17976cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// OnlyOnRHSOfCommutative - Return true if this value is only allowed on the 17986cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// RHS of a commutative operation, not the on LHS. 17996cefb77a7073057fecd721ae141140d75ce76512Chris Lattnerstatic bool OnlyOnRHSOfCommutative(TreePatternNode *N) { 18006cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!N->isLeaf() && N->getOperator()->getName() == "imm") 18016cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return true; 18023f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva if (N->isLeaf() && isa<IntInit>(N->getLeafValue())) 18036cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return true; 18046cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return false; 18056cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 18066cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 18076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 18086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// canPatternMatch - If it is impossible for this pattern to match on this 18096cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// target, fill in Reason and return false. Otherwise, return true. This is 1810da4231f134989af7dc6bd3408821ba573def27b2Jim Grosbach/// used as a sanity check for .td files (to prevent people from writing stuff 18116cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// that can never possibly work), and to prevent the pattern permuter from 18126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// generating stuff that is useless. 1813fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbachbool TreePatternNode::canPatternMatch(std::string &Reason, 1814ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman const CodeGenDAGPatterns &CDP) { 18156cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (isLeaf()) return true; 18166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 18176cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = getNumChildren(); i != e; ++i) 18186cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!getChild(i)->canPatternMatch(Reason, CDP)) 18196cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return false; 18206cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 18216cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If this is an intrinsic, handle cases that would make it not match. For 18226cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // example, if an operand is required to be an immediate. 18236cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (getOperator()->isSubClassOf("Intrinsic")) { 18246cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // TODO: 18256cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return true; 18266cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 1827fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1828dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (getOperator()->isSubClassOf("ComplexPattern")) 1829dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return true; 1830dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 18316cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If this node is a commutative operator, check that the LHS isn't an 18326cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // immediate. 18336cefb77a7073057fecd721ae141140d75ce76512Chris Lattner const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(getOperator()); 18346bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng bool isCommIntrinsic = isCommutativeIntrinsic(CDP); 18356bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng if (NodeInfo.hasProperty(SDNPCommutative) || isCommIntrinsic) { 18366cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Scan all of the operands of the node and make sure that only the last one 18376cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // is a constant node, unless the RHS also is. 18386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) { 18396bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng bool Skip = isCommIntrinsic ? 1 : 0; // First operand is intrinsic id. 18406bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i) 18416cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (OnlyOnRHSOfCommutative(getChild(i))) { 18426cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Reason="Immediate value must be on the RHS of commutative operators!"; 18436cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return false; 18446cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 18456cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 18466cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 1847fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 18486cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return true; 18496cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 18506cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 18516cefb77a7073057fecd721ae141140d75ce76512Chris Lattner//===----------------------------------------------------------------------===// 18526cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// TreePattern implementation 18536cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// 18546cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 185505bce0beee87512e52428d4b80f5a8e79a949576David GreeneTreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput, 185661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp), 185761131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger isInputPattern(isInput), HasError(false) { 18582cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i) 1859c217305f764447eb65e7bf7f9205c14632885969Chris Lattner Trees.push_back(ParseTreePattern(RawPat->getElement(i), "")); 18606cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 18616cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 186205bce0beee87512e52428d4b80f5a8e79a949576David GreeneTreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput, 186361131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp), 186461131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger isInputPattern(isInput), HasError(false) { 1865c217305f764447eb65e7bf7f9205c14632885969Chris Lattner Trees.push_back(ParseTreePattern(Pat, "")); 18666cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 18676cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 18686cefb77a7073057fecd721ae141140d75ce76512Chris LattnerTreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput, 186961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp), 187061131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger isInputPattern(isInput), HasError(false) { 18716cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Trees.push_back(Pat); 18726cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 18736cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 187461131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenbergervoid TreePattern::error(const std::string &Msg) { 187561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger if (HasError) 187661131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger return; 18776cefb77a7073057fecd721ae141140d75ce76512Chris Lattner dump(); 187861131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger PrintError(TheRecord->getLoc(), "In " + TheRecord->getName() + ": " + Msg); 187961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger HasError = true; 18806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 18816cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 18822cacec55f947c716b058a39038889550d7e39b3cChris Lattnervoid TreePattern::ComputeNamedNodes() { 18832cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0, e = Trees.size(); i != e; ++i) 18842cacec55f947c716b058a39038889550d7e39b3cChris Lattner ComputeNamedNodes(Trees[i]); 18852cacec55f947c716b058a39038889550d7e39b3cChris Lattner} 18862cacec55f947c716b058a39038889550d7e39b3cChris Lattner 18872cacec55f947c716b058a39038889550d7e39b3cChris Lattnervoid TreePattern::ComputeNamedNodes(TreePatternNode *N) { 18882cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (!N->getName().empty()) 18892cacec55f947c716b058a39038889550d7e39b3cChris Lattner NamedNodes[N->getName()].push_back(N); 1890fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 18912cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) 18922cacec55f947c716b058a39038889550d7e39b3cChris Lattner ComputeNamedNodes(N->getChild(i)); 18932cacec55f947c716b058a39038889550d7e39b3cChris Lattner} 18942cacec55f947c716b058a39038889550d7e39b3cChris Lattner 1895d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner 189605bce0beee87512e52428d4b80f5a8e79a949576David GreeneTreePatternNode *TreePattern::ParseTreePattern(Init *TheInit, StringRef OpName){ 18976cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva if (DefInit *DI = dyn_cast<DefInit>(TheInit)) { 1898c217305f764447eb65e7bf7f9205c14632885969Chris Lattner Record *R = DI->getDef(); 1899fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1900c217305f764447eb65e7bf7f9205c14632885969Chris Lattner // Direct reference to a leaf DagNode or PatFrag? Turn it into a 190166c9ee7e6d7072a5ecc0131b9dd78a20e72cb597Jim Grosbach // TreePatternNode of its own. For example: 1902c217305f764447eb65e7bf7f9205c14632885969Chris Lattner /// (foo GPR, imm) -> (foo GPR, (imm)) 1903c217305f764447eb65e7bf7f9205c14632885969Chris Lattner if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) 1904dcd35c797d458d8b1dbc36cf7f1504166d5b2f16David Greene return ParseTreePattern( 1905dcd35c797d458d8b1dbc36cf7f1504166d5b2f16David Greene DagInit::get(DI, "", 190605bce0beee87512e52428d4b80f5a8e79a949576David Greene std::vector<std::pair<Init*, std::string> >()), 1907dcd35c797d458d8b1dbc36cf7f1504166d5b2f16David Greene OpName); 1908fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1909c217305f764447eb65e7bf7f9205c14632885969Chris Lattner // Input argument? 1910c217305f764447eb65e7bf7f9205c14632885969Chris Lattner TreePatternNode *Res = new TreePatternNode(DI, 1); 19112a22cdc716ea652d6c9ebdaae028b5c75ab2793aChris Lattner if (R->getName() == "node" && !OpName.empty()) { 1912c217305f764447eb65e7bf7f9205c14632885969Chris Lattner if (OpName.empty()) 1913c217305f764447eb65e7bf7f9205c14632885969Chris Lattner error("'node' argument requires a name to match with operand list"); 1914c217305f764447eb65e7bf7f9205c14632885969Chris Lattner Args.push_back(OpName); 1915c217305f764447eb65e7bf7f9205c14632885969Chris Lattner } 1916c217305f764447eb65e7bf7f9205c14632885969Chris Lattner 1917c217305f764447eb65e7bf7f9205c14632885969Chris Lattner Res->setName(OpName); 1918c217305f764447eb65e7bf7f9205c14632885969Chris Lattner return Res; 1919c217305f764447eb65e7bf7f9205c14632885969Chris Lattner } 1920fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 19218e3cb3ee0c6dd582f4ee78135cef2f33f6893395Jakob Stoklund Olesen // ?:$name or just $name. 19228e3cb3ee0c6dd582f4ee78135cef2f33f6893395Jakob Stoklund Olesen if (TheInit == UnsetInit::get()) { 19238e3cb3ee0c6dd582f4ee78135cef2f33f6893395Jakob Stoklund Olesen if (OpName.empty()) 19248e3cb3ee0c6dd582f4ee78135cef2f33f6893395Jakob Stoklund Olesen error("'?' argument requires a name to match with operand list"); 19258e3cb3ee0c6dd582f4ee78135cef2f33f6893395Jakob Stoklund Olesen TreePatternNode *Res = new TreePatternNode(TheInit, 1); 19268e3cb3ee0c6dd582f4ee78135cef2f33f6893395Jakob Stoklund Olesen Args.push_back(OpName); 19278e3cb3ee0c6dd582f4ee78135cef2f33f6893395Jakob Stoklund Olesen Res->setName(OpName); 19288e3cb3ee0c6dd582f4ee78135cef2f33f6893395Jakob Stoklund Olesen return Res; 19298e3cb3ee0c6dd582f4ee78135cef2f33f6893395Jakob Stoklund Olesen } 19308e3cb3ee0c6dd582f4ee78135cef2f33f6893395Jakob Stoklund Olesen 19316cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva if (IntInit *II = dyn_cast<IntInit>(TheInit)) { 1932c217305f764447eb65e7bf7f9205c14632885969Chris Lattner if (!OpName.empty()) 1933c217305f764447eb65e7bf7f9205c14632885969Chris Lattner error("Constant int argument should not have a name!"); 1934c217305f764447eb65e7bf7f9205c14632885969Chris Lattner return new TreePatternNode(II, 1); 1935c217305f764447eb65e7bf7f9205c14632885969Chris Lattner } 1936fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 19376cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva if (BitsInit *BI = dyn_cast<BitsInit>(TheInit)) { 1938c217305f764447eb65e7bf7f9205c14632885969Chris Lattner // Turn this into an IntInit. 193905bce0beee87512e52428d4b80f5a8e79a949576David Greene Init *II = BI->convertInitializerTo(IntRecTy::get()); 1940dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (!II || !isa<IntInit>(II)) 1941c217305f764447eb65e7bf7f9205c14632885969Chris Lattner error("Bits value must be constants!"); 1942b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner return ParseTreePattern(II, OpName); 1943c217305f764447eb65e7bf7f9205c14632885969Chris Lattner } 1944c217305f764447eb65e7bf7f9205c14632885969Chris Lattner 19456cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva DagInit *Dag = dyn_cast<DagInit>(TheInit); 1946c217305f764447eb65e7bf7f9205c14632885969Chris Lattner if (!Dag) { 1947c217305f764447eb65e7bf7f9205c14632885969Chris Lattner TheInit->dump(); 1948c217305f764447eb65e7bf7f9205c14632885969Chris Lattner error("Pattern has unexpected init kind!"); 1949c217305f764447eb65e7bf7f9205c14632885969Chris Lattner } 19506cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva DefInit *OpDef = dyn_cast<DefInit>(Dag->getOperator()); 19516cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!OpDef) error("Pattern has unexpected operator type!"); 19526cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Record *Operator = OpDef->getDef(); 1953fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 19546cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Operator->isSubClassOf("ValueType")) { 19556cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If the operator is a ValueType, then this must be "type cast" of a leaf 19566cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // node. 19576cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Dag->getNumArgs() != 1) 19586cefb77a7073057fecd721ae141140d75ce76512Chris Lattner error("Type cast only takes one operand!"); 1959fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1960c217305f764447eb65e7bf7f9205c14632885969Chris Lattner TreePatternNode *New = ParseTreePattern(Dag->getArg(0), Dag->getArgName(0)); 1961fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 19626cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Apply the type cast. 1963d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner assert(New->getNumTypes() == 1 && "FIXME: Unhandled"); 1964d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner New->UpdateNodeType(0, getValueType(Operator), *this); 1965fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1966c217305f764447eb65e7bf7f9205c14632885969Chris Lattner if (!OpName.empty()) 1967c217305f764447eb65e7bf7f9205c14632885969Chris Lattner error("ValueType cast should not have a name!"); 19686cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return New; 19696cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 1970fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 19716cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Verify that this is something that makes sense for an operator. 1972fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach if (!Operator->isSubClassOf("PatFrag") && 19737cee81703de8333d457ec9e560b0537b71df5a48Nate Begeman !Operator->isSubClassOf("SDNode") && 1974fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach !Operator->isSubClassOf("Instruction") && 19756cefb77a7073057fecd721ae141140d75ce76512Chris Lattner !Operator->isSubClassOf("SDNodeXForm") && 19766cefb77a7073057fecd721ae141140d75ce76512Chris Lattner !Operator->isSubClassOf("Intrinsic") && 1977dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines !Operator->isSubClassOf("ComplexPattern") && 19786cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Operator->getName() != "set" && 1979310adf1c6f58921b30fde145fd15cb1798050205Chris Lattner Operator->getName() != "implicit") 19806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner error("Unrecognized node '" + Operator->getName() + "'!"); 1981fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 19826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Check to see if this is something that is illegal in an input pattern. 1983b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner if (isInputPattern) { 1984b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner if (Operator->isSubClassOf("Instruction") || 1985b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner Operator->isSubClassOf("SDNodeXForm")) 1986b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner error("Cannot use '" + Operator->getName() + "' in an input pattern!"); 1987b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner } else { 1988b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner if (Operator->isSubClassOf("Intrinsic")) 1989b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner error("Cannot use '" + Operator->getName() + "' in an output pattern!"); 1990fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 1991b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner if (Operator->isSubClassOf("SDNode") && 1992b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner Operator->getName() != "imm" && 1993b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner Operator->getName() != "fpimm" && 1994b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner Operator->getName() != "tglobaltlsaddr" && 1995b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner Operator->getName() != "tconstpool" && 1996b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner Operator->getName() != "tjumptable" && 1997b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner Operator->getName() != "tframeindex" && 1998b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner Operator->getName() != "texternalsym" && 1999b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner Operator->getName() != "tblockaddress" && 2000b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner Operator->getName() != "tglobaladdr" && 2001b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner Operator->getName() != "bb" && 2002b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner Operator->getName() != "vt") 2003b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner error("Cannot use '" + Operator->getName() + "' in an output pattern!"); 2004b775b1e20bb9adc2a5130f7470f2f525280f1036Chris Lattner } 2005fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 20066cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> Children; 2007c217305f764447eb65e7bf7f9205c14632885969Chris Lattner 2008c217305f764447eb65e7bf7f9205c14632885969Chris Lattner // Parse all the operands. 2009c217305f764447eb65e7bf7f9205c14632885969Chris Lattner for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) 2010c217305f764447eb65e7bf7f9205c14632885969Chris Lattner Children.push_back(ParseTreePattern(Dag->getArg(i), Dag->getArgName(i))); 2011fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 20126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If the operator is an intrinsic, then this is just syntactic sugar for for 2013fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach // (intrinsic_* <number>, ..children..). Pick the right intrinsic node, and 20146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // convert the intrinsic name to a number. 20156cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Operator->isSubClassOf("Intrinsic")) { 20166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner const CodeGenIntrinsic &Int = getDAGPatterns().getIntrinsic(Operator); 20176cefb77a7073057fecd721ae141140d75ce76512Chris Lattner unsigned IID = getDAGPatterns().getIntrinsicID(Operator)+1; 20186cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 20196cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If this intrinsic returns void, it must have side-effects and thus a 20206cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // chain. 2021c217305f764447eb65e7bf7f9205c14632885969Chris Lattner if (Int.IS.RetVTs.empty()) 20226cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Operator = getDAGPatterns().get_intrinsic_void_sdnode(); 2023c217305f764447eb65e7bf7f9205c14632885969Chris Lattner else if (Int.ModRef != CodeGenIntrinsic::NoMem) 20246cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Has side-effects, requires chain. 20256cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Operator = getDAGPatterns().get_intrinsic_w_chain_sdnode(); 2026c217305f764447eb65e7bf7f9205c14632885969Chris Lattner else // Otherwise, no chain. 20276cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Operator = getDAGPatterns().get_intrinsic_wo_chain_sdnode(); 2028fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2029dcd35c797d458d8b1dbc36cf7f1504166d5b2f16David Greene TreePatternNode *IIDNode = new TreePatternNode(IntInit::get(IID), 1); 20306cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Children.insert(Children.begin(), IIDNode); 20316cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 2032fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2033dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (Operator->isSubClassOf("ComplexPattern")) { 2034dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines for (unsigned i = 0; i < Children.size(); ++i) { 2035dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines TreePatternNode *Child = Children[i]; 2036dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 2037dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (Child->getName().empty()) 2038dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines error("All arguments to a ComplexPattern must be named"); 2039dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 2040dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // Check that the ComplexPattern uses are consistent: "(MY_PAT $a, $b)" 2041dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // and "(MY_PAT $b, $a)" should not be allowed in the same pattern; 2042dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // neither should "(MY_PAT_1 $a, $b)" and "(MY_PAT_2 $a, $b)". 2043dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines auto OperandId = std::make_pair(Operator, i); 2044dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines auto PrevOp = ComplexPatternOperands.find(Child->getName()); 2045dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (PrevOp != ComplexPatternOperands.end()) { 2046dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (PrevOp->getValue() != OperandId) 2047dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines error("All ComplexPattern operands must appear consistently: " 2048dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines "in the same order in just one ComplexPattern instance."); 2049dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines } else 2050dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines ComplexPatternOperands[Child->getName()] = OperandId; 2051dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines } 2052dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines } 2053dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 2054d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner unsigned NumResults = GetNumNodeResults(Operator, CDP); 2055d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner TreePatternNode *Result = new TreePatternNode(Operator, Children, NumResults); 2056c217305f764447eb65e7bf7f9205c14632885969Chris Lattner Result->setName(OpName); 2057fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2058c217305f764447eb65e7bf7f9205c14632885969Chris Lattner if (!Dag->getName().empty()) { 2059c217305f764447eb65e7bf7f9205c14632885969Chris Lattner assert(Result->getName().empty()); 2060c217305f764447eb65e7bf7f9205c14632885969Chris Lattner Result->setName(Dag->getName()); 2061c217305f764447eb65e7bf7f9205c14632885969Chris Lattner } 20627cee81703de8333d457ec9e560b0537b71df5a48Nate Begeman return Result; 20636cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 20646cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 20657a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner/// SimplifyTree - See if we can simplify this tree to eliminate something that 20667a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner/// will never match in favor of something obvious that will. This is here 20677a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner/// strictly as a convenience to target authors because it allows them to write 20687a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner/// more type generic things and have useless type casts fold away. 20697a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner/// 20707a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner/// This returns true if any change is made. 20717a0eb91b4c238542a11ca805af15933cc8290786Chris Lattnerstatic bool SimplifyTree(TreePatternNode *&N) { 20727a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner if (N->isLeaf()) 20737a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner return false; 20747a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner 20757a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner // If we have a bitconvert with a resolved type and if the source and 20767a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner // destination types are the same, then the bitconvert is useless, remove it. 20777a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner if (N->getOperator()->getName() == "bitconvert" && 20787a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner N->getExtType(0).isConcrete() && 20797a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner N->getExtType(0) == N->getChild(0)->getExtType(0) && 20807a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner N->getName().empty()) { 20817a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner N = N->getChild(0); 20827a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner SimplifyTree(N); 20837a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner return true; 20847a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner } 20857a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner 20867a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner // Walk all children. 20877a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner bool MadeChange = false; 20887a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) { 20897a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner TreePatternNode *Child = N->getChild(i); 20907a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner MadeChange |= SimplifyTree(Child); 20917a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner N->setChild(i, Child); 20927a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner } 20937a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner return MadeChange; 20947a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner} 20957a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner 20967a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner 20977a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner 20986cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// InferAllTypes - Infer/propagate as many types throughout the expression 2099da4231f134989af7dc6bd3408821ba573def27b2Jim Grosbach/// patterns as possible. Return true if all types are inferred, false 210061131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger/// otherwise. Flags an error if a type contradiction is found. 21012cacec55f947c716b058a39038889550d7e39b3cChris Lattnerbool TreePattern:: 21022cacec55f947c716b058a39038889550d7e39b3cChris LattnerInferAllTypes(const StringMap<SmallVector<TreePatternNode*,1> > *InNamedTypes) { 21032cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (NamedNodes.empty()) 21042cacec55f947c716b058a39038889550d7e39b3cChris Lattner ComputeNamedNodes(); 21052cacec55f947c716b058a39038889550d7e39b3cChris Lattner 21066cefb77a7073057fecd721ae141140d75ce76512Chris Lattner bool MadeChange = true; 21076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner while (MadeChange) { 21086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner MadeChange = false; 21097a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner for (unsigned i = 0, e = Trees.size(); i != e; ++i) { 21106cefb77a7073057fecd721ae141140d75ce76512Chris Lattner MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false); 21117a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner MadeChange |= SimplifyTree(Trees[i]); 21127a0eb91b4c238542a11ca805af15933cc8290786Chris Lattner } 21132cacec55f947c716b058a39038889550d7e39b3cChris Lattner 21142cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If there are constraints on our named nodes, apply them. 2115fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach for (StringMap<SmallVector<TreePatternNode*,1> >::iterator 21162cacec55f947c716b058a39038889550d7e39b3cChris Lattner I = NamedNodes.begin(), E = NamedNodes.end(); I != E; ++I) { 21172cacec55f947c716b058a39038889550d7e39b3cChris Lattner SmallVectorImpl<TreePatternNode*> &Nodes = I->second; 2118fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 21192cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If we have input named node types, propagate their types to the named 21202cacec55f947c716b058a39038889550d7e39b3cChris Lattner // values here. 21212cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (InNamedTypes) { 2122cd81d94322a39503e4a3e87b6ee03d4fcb3465fbStephen Hines if (!InNamedTypes->count(I->getKey())) { 2123cd81d94322a39503e4a3e87b6ee03d4fcb3465fbStephen Hines error("Node '" + std::string(I->getKey()) + 2124cd81d94322a39503e4a3e87b6ee03d4fcb3465fbStephen Hines "' in output pattern but not input pattern"); 2125cd81d94322a39503e4a3e87b6ee03d4fcb3465fbStephen Hines return true; 2126cd81d94322a39503e4a3e87b6ee03d4fcb3465fbStephen Hines } 21272cacec55f947c716b058a39038889550d7e39b3cChris Lattner 21282cacec55f947c716b058a39038889550d7e39b3cChris Lattner const SmallVectorImpl<TreePatternNode*> &InNodes = 21292cacec55f947c716b058a39038889550d7e39b3cChris Lattner InNamedTypes->find(I->getKey())->second; 21302cacec55f947c716b058a39038889550d7e39b3cChris Lattner 21312cacec55f947c716b058a39038889550d7e39b3cChris Lattner // The input types should be fully resolved by now. 21322cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0, e = Nodes.size(); i != e; ++i) { 21332cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If this node is a register class, and it is the root of the pattern 21342cacec55f947c716b058a39038889550d7e39b3cChris Lattner // then we're mapping something onto an input register. We allow 21352cacec55f947c716b058a39038889550d7e39b3cChris Lattner // changing the type of the input register in this case. This allows 21362cacec55f947c716b058a39038889550d7e39b3cChris Lattner // us to match things like: 21372cacec55f947c716b058a39038889550d7e39b3cChris Lattner // def : Pat<(v1i64 (bitconvert(v2i32 DPR:$src))), (v1i64 DPR:$src)>; 21382cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (Nodes[i] == Trees[0] && Nodes[i]->isLeaf()) { 21396cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva DefInit *DI = dyn_cast<DefInit>(Nodes[i]->getLeafValue()); 2140bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson if (DI && (DI->getDef()->isSubClassOf("RegisterClass") || 2141bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson DI->getDef()->isSubClassOf("RegisterOperand"))) 21422cacec55f947c716b058a39038889550d7e39b3cChris Lattner continue; 21432cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 2144fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 214532f6a8b8bb9de0180036eaf7f7ac6dc030d85655Daniel Dunbar assert(Nodes[i]->getNumTypes() == 1 && 2146d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner InNodes[0]->getNumTypes() == 1 && 2147d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner "FIXME: cannot name multiple result nodes yet"); 2148d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= Nodes[i]->UpdateNodeType(0, InNodes[0]->getExtType(0), 2149d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner *this); 21502cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 21512cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 2152fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 21532cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If there are multiple nodes with the same name, they must all have the 21542cacec55f947c716b058a39038889550d7e39b3cChris Lattner // same type. 21552cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (I->second.size() > 1) { 21562cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0, e = Nodes.size()-1; i != e; ++i) { 2157d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner TreePatternNode *N1 = Nodes[i], *N2 = Nodes[i+1]; 215832f6a8b8bb9de0180036eaf7f7ac6dc030d85655Daniel Dunbar assert(N1->getNumTypes() == 1 && N2->getNumTypes() == 1 && 2159d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner "FIXME: cannot name multiple result nodes yet"); 2160fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2161d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= N1->UpdateNodeType(0, N2->getExtType(0), *this); 2162d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner MadeChange |= N2->UpdateNodeType(0, N1->getExtType(0), *this); 21632cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 21642cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 21652cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 21666cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 2167fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 21686cefb77a7073057fecd721ae141140d75ce76512Chris Lattner bool HasUnresolvedTypes = false; 21696cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = Trees.size(); i != e; ++i) 21706cefb77a7073057fecd721ae141140d75ce76512Chris Lattner HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType(); 21716cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return !HasUnresolvedTypes; 21726cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 21736cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 21741a55180238dbcf11113f610aea010447e51f595bDaniel Dunbarvoid TreePattern::print(raw_ostream &OS) const { 21756cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << getRecord()->getName(); 21766cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!Args.empty()) { 21776cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << "(" << Args[0]; 21786cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 1, e = Args.size(); i != e; ++i) 21796cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << ", " << Args[i]; 21806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << ")"; 21816cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 21826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << ": "; 2183fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 21846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Trees.size() > 1) 21856cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << "[\n"; 21866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = Trees.size(); i != e; ++i) { 21876cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << "\t"; 21886cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Trees[i]->print(OS); 21896cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << "\n"; 21906cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 21916cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 21926cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Trees.size() > 1) 21936cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OS << "]\n"; 21946cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 21956cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 21961a55180238dbcf11113f610aea010447e51f595bDaniel Dunbarvoid TreePattern::dump() const { print(errs()); } 21976cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 21986cefb77a7073057fecd721ae141140d75ce76512Chris Lattner//===----------------------------------------------------------------------===// 2199fe71893183f504feff290e343bf740bd32432129Chris Lattner// CodeGenDAGPatterns implementation 22006cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// 22016cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 2202fbadcd0826c2e69ed21c2d535310ba958acb4359Jim GrosbachCodeGenDAGPatterns::CodeGenDAGPatterns(RecordKeeper &R) : 220367db883487fca3472fdde51e931657e22d4d0495Chris Lattner Records(R), Target(R) { 220467db883487fca3472fdde51e931657e22d4d0495Chris Lattner 220549de98214b82fefeb8f16efbf8cdd8813a85469bDale Johannesen Intrinsics = LoadIntrinsics(Records, false); 220649de98214b82fefeb8f16efbf8cdd8813a85469bDale Johannesen TgtIntrinsics = LoadIntrinsics(Records, true); 22076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ParseNodeInfo(); 2208443e3f9dd61b8d0974bb13d484195ce1a9b7536cChris Lattner ParseNodeTransforms(); 22096cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ParseComplexPatterns(); 2210dc32f9802adc139e3d7ee5e25fe656b1d3999bc2Chris Lattner ParsePatternFragments(); 22116cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ParseDefaultOperands(); 22126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ParseInstructions(); 221336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines ParsePatternFragments(/*OutFrags*/true); 22146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ParsePatterns(); 2215fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 22166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Generate variants. For example, commutative patterns can match 22176cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // multiple ways. Add them to PatternsToMatch as well. 22186cefb77a7073057fecd721ae141140d75ce76512Chris Lattner GenerateVariants(); 2219ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 2220ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman // Infer instruction flags. For example, we can detect loads, 2221ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman // stores, and side effects in many cases by examining an 2222ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman // instruction's pattern. 2223ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman InferInstructionFlags(); 2224325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen 2225325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen // Verify that instruction flags match the patterns. 2226325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen VerifyInstructionFlags(); 22276cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 22286cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 2229fe71893183f504feff290e343bf740bd32432129Chris LattnerCodeGenDAGPatterns::~CodeGenDAGPatterns() { 22305b9e7ef627aa1e2f49a6ee85e718199799841f7eBenjamin Kramer for (pf_iterator I = PatternFragments.begin(), 22316cefb77a7073057fecd721ae141140d75ce76512Chris Lattner E = PatternFragments.end(); I != E; ++I) 22326cefb77a7073057fecd721ae141140d75ce76512Chris Lattner delete I->second; 22336cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 22346cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 22356cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 2236fe71893183f504feff290e343bf740bd32432129Chris LattnerRecord *CodeGenDAGPatterns::getSDNodeNamed(const std::string &Name) const { 22376cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Record *N = Records.getDef(Name); 22386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!N || !N->isSubClassOf("SDNode")) { 22391a55180238dbcf11113f610aea010447e51f595bDaniel Dunbar errs() << "Error getting SDNode '" << Name << "'!\n"; 22406cefb77a7073057fecd721ae141140d75ce76512Chris Lattner exit(1); 22416cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 22426cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return N; 22436cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 22446cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 22456cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// Parse all of the SDNode definitions for the target, populating SDNodes. 2246fe71893183f504feff290e343bf740bd32432129Chris Lattnervoid CodeGenDAGPatterns::ParseNodeInfo() { 22476cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode"); 22486cefb77a7073057fecd721ae141140d75ce76512Chris Lattner while (!Nodes.empty()) { 22496cefb77a7073057fecd721ae141140d75ce76512Chris Lattner SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back())); 22506cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Nodes.pop_back(); 22516cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 22526cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 2253da4231f134989af7dc6bd3408821ba573def27b2Jim Grosbach // Get the builtin intrinsic nodes. 22546cefb77a7073057fecd721ae141140d75ce76512Chris Lattner intrinsic_void_sdnode = getSDNodeNamed("intrinsic_void"); 22556cefb77a7073057fecd721ae141140d75ce76512Chris Lattner intrinsic_w_chain_sdnode = getSDNodeNamed("intrinsic_w_chain"); 22566cefb77a7073057fecd721ae141140d75ce76512Chris Lattner intrinsic_wo_chain_sdnode = getSDNodeNamed("intrinsic_wo_chain"); 22576cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 22586cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 22596cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms 22606cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// map, and emit them to the file as functions. 2261fe71893183f504feff290e343bf740bd32432129Chris Lattnervoid CodeGenDAGPatterns::ParseNodeTransforms() { 22626cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm"); 22636cefb77a7073057fecd721ae141140d75ce76512Chris Lattner while (!Xforms.empty()) { 22646cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Record *XFormNode = Xforms.back(); 22656cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Record *SDNode = XFormNode->getValueAsDef("Opcode"); 22668dd6f0c8353f80de6526810899f271d539f6929cJakob Stoklund Olesen std::string Code = XFormNode->getValueAsString("XFormFunction"); 2267443e3f9dd61b8d0974bb13d484195ce1a9b7536cChris Lattner SDNodeXForms.insert(std::make_pair(XFormNode, NodeXForm(SDNode, Code))); 22686cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 22696cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Xforms.pop_back(); 22706cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 22716cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 22726cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 2273fe71893183f504feff290e343bf740bd32432129Chris Lattnervoid CodeGenDAGPatterns::ParseComplexPatterns() { 22746cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<Record*> AMs = Records.getAllDerivedDefinitions("ComplexPattern"); 22756cefb77a7073057fecd721ae141140d75ce76512Chris Lattner while (!AMs.empty()) { 22766cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back())); 22776cefb77a7073057fecd721ae141140d75ce76512Chris Lattner AMs.pop_back(); 22786cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 22796cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 22806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 22816cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 22826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// ParsePatternFragments - Parse all of the PatFrag definitions in the .td 22836cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// file, building up the PatternFragments map. After we've collected them all, 22846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// inline fragments together as necessary, so that there are no references left 22856cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// inside a pattern fragment to a pattern fragment. 22866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// 228736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hinesvoid CodeGenDAGPatterns::ParsePatternFragments(bool OutFrags) { 22886cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag"); 2289fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2290dc32f9802adc139e3d7ee5e25fe656b1d3999bc2Chris Lattner // First step, parse all of the fragments. 22916cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = Fragments.size(); i != e; ++i) { 229236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (OutFrags != Fragments[i]->isSubClassOf("OutPatFrag")) 229336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines continue; 229436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 229505bce0beee87512e52428d4b80f5a8e79a949576David Greene DagInit *Tree = Fragments[i]->getValueAsDag("Fragment"); 229636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TreePattern *P = 229736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines new TreePattern(Fragments[i], Tree, 229836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines !Fragments[i]->isSubClassOf("OutPatFrag"), *this); 22996cefb77a7073057fecd721ae141140d75ce76512Chris Lattner PatternFragments[Fragments[i]] = P; 2300fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2301dc32f9802adc139e3d7ee5e25fe656b1d3999bc2Chris Lattner // Validate the argument list, converting it to set, to discard duplicates. 23026cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<std::string> &Args = P->getArgList(); 2303dc32f9802adc139e3d7ee5e25fe656b1d3999bc2Chris Lattner std::set<std::string> OperandsSet(Args.begin(), Args.end()); 2304fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2305dc32f9802adc139e3d7ee5e25fe656b1d3999bc2Chris Lattner if (OperandsSet.count("")) 23066cefb77a7073057fecd721ae141140d75ce76512Chris Lattner P->error("Cannot have unnamed 'node' values in pattern fragment!"); 2307fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 23086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Parse the operands list. 230905bce0beee87512e52428d4b80f5a8e79a949576David Greene DagInit *OpsList = Fragments[i]->getValueAsDag("Operands"); 23106cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva DefInit *OpsOp = dyn_cast<DefInit>(OpsList->getOperator()); 23116cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Special cases: ops == outs == ins. Different names are used to 2312da4231f134989af7dc6bd3408821ba573def27b2Jim Grosbach // improve readability. 23136cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!OpsOp || 23146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner (OpsOp->getDef()->getName() != "ops" && 23156cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OpsOp->getDef()->getName() != "outs" && 23166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OpsOp->getDef()->getName() != "ins")) 23176cefb77a7073057fecd721ae141140d75ce76512Chris Lattner P->error("Operands list should start with '(ops ... '!"); 2318fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2319fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach // Copy over the arguments. 23206cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Args.clear(); 23216cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) { 23223f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva if (!isa<DefInit>(OpsList->getArg(j)) || 23233f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva cast<DefInit>(OpsList->getArg(j))->getDef()->getName() != "node") 23246cefb77a7073057fecd721ae141140d75ce76512Chris Lattner P->error("Operands list should all be 'node' values."); 23256cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (OpsList->getArgName(j).empty()) 23266cefb77a7073057fecd721ae141140d75ce76512Chris Lattner P->error("Operands list should have names for each operand!"); 2327dc32f9802adc139e3d7ee5e25fe656b1d3999bc2Chris Lattner if (!OperandsSet.count(OpsList->getArgName(j))) 23286cefb77a7073057fecd721ae141140d75ce76512Chris Lattner P->error("'" + OpsList->getArgName(j) + 23296cefb77a7073057fecd721ae141140d75ce76512Chris Lattner "' does not occur in pattern or was multiply specified!"); 2330dc32f9802adc139e3d7ee5e25fe656b1d3999bc2Chris Lattner OperandsSet.erase(OpsList->getArgName(j)); 23316cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Args.push_back(OpsList->getArgName(j)); 23326cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 2333fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2334dc32f9802adc139e3d7ee5e25fe656b1d3999bc2Chris Lattner if (!OperandsSet.empty()) 23356cefb77a7073057fecd721ae141140d75ce76512Chris Lattner P->error("Operands list does not contain an entry for operand '" + 2336dc32f9802adc139e3d7ee5e25fe656b1d3999bc2Chris Lattner *OperandsSet.begin() + "'!"); 23376cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 2338dc32f9802adc139e3d7ee5e25fe656b1d3999bc2Chris Lattner // If there is a code init for this fragment, keep track of the fact that 2339dc32f9802adc139e3d7ee5e25fe656b1d3999bc2Chris Lattner // this fragment uses it. 2340543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner TreePredicateFn PredFn(P); 2341543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner if (!PredFn.isAlwaysTrue()) 2342543790673c747ab2793fc657e239ce5f78419dc0Chris Lattner P->getOnlyTree()->addPredicateFn(PredFn); 2343fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 23446cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If there is a node transformation corresponding to this, keep track of 23456cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // it. 23466cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Record *Transform = Fragments[i]->getValueAsDef("OperandTransform"); 23476cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!getSDNodeTransform(Transform).second.empty()) // not noop xform? 23486cefb77a7073057fecd721ae141140d75ce76512Chris Lattner P->getOnlyTree()->setTransformFn(Transform); 23496cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 2350fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 23516cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Now that we've parsed all of the tree fragments, do a closure on them so 23526cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // that there are not references to PatFrags left inside of them. 23532ca698df93421327a459987b33b045756cb47d4dChris Lattner for (unsigned i = 0, e = Fragments.size(); i != e; ++i) { 235436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (OutFrags != Fragments[i]->isSubClassOf("OutPatFrag")) 235536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines continue; 235636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 23572ca698df93421327a459987b33b045756cb47d4dChris Lattner TreePattern *ThePat = PatternFragments[Fragments[i]]; 23586cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ThePat->InlinePatternFragments(); 2359fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 23606cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Infer as many types as possible. Don't worry about it if we don't infer 23616cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // all of them, some may depend on the inputs of the pattern. 236261131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger ThePat->InferAllTypes(); 236361131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger ThePat->resetError(); 2364fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 23656cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If debugging, print out the pattern fragment result. 23666cefb77a7073057fecd721ae141140d75ce76512Chris Lattner DEBUG(ThePat->dump()); 23676cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 23686cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 23696cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 2370fe71893183f504feff290e343bf740bd32432129Chris Lattnervoid CodeGenDAGPatterns::ParseDefaultOperands() { 23716d3d7656539188b496089a3313ed4d13759adba3Tom Stellard std::vector<Record*> DefaultOps; 23726d3d7656539188b496089a3313ed4d13759adba3Tom Stellard DefaultOps = Records.getAllDerivedDefinitions("OperandWithDefaultOps"); 23736cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 23746cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Find some SDNode. 23756cefb77a7073057fecd721ae141140d75ce76512Chris Lattner assert(!SDNodes.empty() && "No SDNodes parsed?"); 237605bce0beee87512e52428d4b80f5a8e79a949576David Greene Init *SomeSDNode = DefInit::get(SDNodes.begin()->first); 2377fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 23786d3d7656539188b496089a3313ed4d13759adba3Tom Stellard for (unsigned i = 0, e = DefaultOps.size(); i != e; ++i) { 23796d3d7656539188b496089a3313ed4d13759adba3Tom Stellard DagInit *DefaultInfo = DefaultOps[i]->getValueAsDag("DefaultOps"); 23806d3d7656539188b496089a3313ed4d13759adba3Tom Stellard 23816d3d7656539188b496089a3313ed4d13759adba3Tom Stellard // Clone the DefaultInfo dag node, changing the operator from 'ops' to 23826d3d7656539188b496089a3313ed4d13759adba3Tom Stellard // SomeSDnode so that we can parse this. 23836d3d7656539188b496089a3313ed4d13759adba3Tom Stellard std::vector<std::pair<Init*, std::string> > Ops; 23846d3d7656539188b496089a3313ed4d13759adba3Tom Stellard for (unsigned op = 0, e = DefaultInfo->getNumArgs(); op != e; ++op) 23856d3d7656539188b496089a3313ed4d13759adba3Tom Stellard Ops.push_back(std::make_pair(DefaultInfo->getArg(op), 23866d3d7656539188b496089a3313ed4d13759adba3Tom Stellard DefaultInfo->getArgName(op))); 23876d3d7656539188b496089a3313ed4d13759adba3Tom Stellard DagInit *DI = DagInit::get(SomeSDNode, "", Ops); 23886d3d7656539188b496089a3313ed4d13759adba3Tom Stellard 23896d3d7656539188b496089a3313ed4d13759adba3Tom Stellard // Create a TreePattern to parse this. 23906d3d7656539188b496089a3313ed4d13759adba3Tom Stellard TreePattern P(DefaultOps[i], DI, false, *this); 23916d3d7656539188b496089a3313ed4d13759adba3Tom Stellard assert(P.getNumTrees() == 1 && "This ctor can only produce one tree!"); 23926d3d7656539188b496089a3313ed4d13759adba3Tom Stellard 23936d3d7656539188b496089a3313ed4d13759adba3Tom Stellard // Copy the operands over into a DAGDefaultOperand. 23946d3d7656539188b496089a3313ed4d13759adba3Tom Stellard DAGDefaultOperand DefaultOpInfo; 23956d3d7656539188b496089a3313ed4d13759adba3Tom Stellard 23966d3d7656539188b496089a3313ed4d13759adba3Tom Stellard TreePatternNode *T = P.getTree(0); 23976d3d7656539188b496089a3313ed4d13759adba3Tom Stellard for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) { 23986d3d7656539188b496089a3313ed4d13759adba3Tom Stellard TreePatternNode *TPN = T->getChild(op); 23996d3d7656539188b496089a3313ed4d13759adba3Tom Stellard while (TPN->ApplyTypeConstraints(P, false)) 24006d3d7656539188b496089a3313ed4d13759adba3Tom Stellard /* Resolve all types */; 24016d3d7656539188b496089a3313ed4d13759adba3Tom Stellard 24026d3d7656539188b496089a3313ed4d13759adba3Tom Stellard if (TPN->ContainsUnresolvedType()) { 240336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines PrintFatalError("Value #" + Twine(i) + " of OperandWithDefaultOps '" + 240436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines DefaultOps[i]->getName() + 240536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines "' doesn't have a concrete type!"); 24066cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 24076d3d7656539188b496089a3313ed4d13759adba3Tom Stellard DefaultOpInfo.DefaultOps.push_back(TPN); 24086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 24096d3d7656539188b496089a3313ed4d13759adba3Tom Stellard 24106d3d7656539188b496089a3313ed4d13759adba3Tom Stellard // Insert it into the DefaultOperands map so we can find it later. 24116d3d7656539188b496089a3313ed4d13759adba3Tom Stellard DefaultOperands[DefaultOps[i]] = DefaultOpInfo; 24126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 24136cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 24146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 24156cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an 24166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// instruction input. Return true if this is a real use. 24176cefb77a7073057fecd721ae141140d75ce76512Chris Lattnerstatic bool HandleUse(TreePattern *I, TreePatternNode *Pat, 2418acfb70f75061975deda1deb167da8e83249f92edChris Lattner std::map<std::string, TreePatternNode*> &InstInputs) { 24196cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // No name -> not interesting. 24206cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Pat->getName().empty()) { 24216cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Pat->isLeaf()) { 24226cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva DefInit *DI = dyn_cast<DefInit>(Pat->getLeafValue()); 2423bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson if (DI && (DI->getDef()->isSubClassOf("RegisterClass") || 2424bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson DI->getDef()->isSubClassOf("RegisterOperand"))) 24256cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Input " + DI->getDef()->getName() + " must be named!"); 24266cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 24276cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return false; 24286cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 24296cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 24306cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Record *Rec; 24316cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Pat->isLeaf()) { 24326cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva DefInit *DI = dyn_cast<DefInit>(Pat->getLeafValue()); 24336cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!DI) I->error("Input $" + Pat->getName() + " must be an identifier!"); 24346cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Rec = DI->getDef(); 24356cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else { 24366cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Rec = Pat->getOperator(); 24376cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 24386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 24396cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // SRCVALUE nodes are ignored. 24406cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Rec->getName() == "srcvalue") 24416cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return false; 24426cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 24436cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *&Slot = InstInputs[Pat->getName()]; 24446cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!Slot) { 24456cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Slot = Pat; 244653d09bd0099e2ac400ad5ddcb928ad0d524fbe5cChris Lattner return true; 244753d09bd0099e2ac400ad5ddcb928ad0d524fbe5cChris Lattner } 244853d09bd0099e2ac400ad5ddcb928ad0d524fbe5cChris Lattner Record *SlotRec; 244953d09bd0099e2ac400ad5ddcb928ad0d524fbe5cChris Lattner if (Slot->isLeaf()) { 24503f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva SlotRec = cast<DefInit>(Slot->getLeafValue())->getDef(); 24516cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else { 245253d09bd0099e2ac400ad5ddcb928ad0d524fbe5cChris Lattner assert(Slot->getNumChildren() == 0 && "can't be a use with children!"); 245353d09bd0099e2ac400ad5ddcb928ad0d524fbe5cChris Lattner SlotRec = Slot->getOperator(); 24546cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 2455fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 245653d09bd0099e2ac400ad5ddcb928ad0d524fbe5cChris Lattner // Ensure that the inputs agree if we've already seen this input. 245753d09bd0099e2ac400ad5ddcb928ad0d524fbe5cChris Lattner if (Rec != SlotRec) 245853d09bd0099e2ac400ad5ddcb928ad0d524fbe5cChris Lattner I->error("All $" + Pat->getName() + " inputs must agree with each other"); 2459d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (Slot->getExtTypes() != Pat->getExtTypes()) 246053d09bd0099e2ac400ad5ddcb928ad0d524fbe5cChris Lattner I->error("All $" + Pat->getName() + " inputs must agree with each other"); 24616cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return true; 24626cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 24636cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 24646cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is 24656cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// part of "I", the instruction), computing the set of inputs and outputs of 24666cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// the pattern. Report errors if we see anything naughty. 2467fe71893183f504feff290e343bf740bd32432129Chris Lattnervoid CodeGenDAGPatterns:: 24686cefb77a7073057fecd721ae141140d75ce76512Chris LattnerFindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat, 24696cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::map<std::string, TreePatternNode*> &InstInputs, 24706cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::map<std::string, TreePatternNode*>&InstResults, 24716cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<Record*> &InstImpResults) { 24726cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Pat->isLeaf()) { 2473acfb70f75061975deda1deb167da8e83249f92edChris Lattner bool isUse = HandleUse(I, Pat, InstInputs); 24746cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!isUse && Pat->getTransformFn()) 24756cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Cannot specify a transform function for a non-input value!"); 24766cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return; 247784aa60b522e6ff02214912968eba1c037dd7bba1Chris Lattner } 2478fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 247984aa60b522e6ff02214912968eba1c037dd7bba1Chris Lattner if (Pat->getOperator()->getName() == "implicit") { 24806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) { 24816cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *Dest = Pat->getChild(i); 24826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!Dest->isLeaf()) 24836cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("implicitly defined value should be a register!"); 2484fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 24856cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva DefInit *Val = dyn_cast<DefInit>(Dest->getLeafValue()); 24866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!Val || !Val->getDef()->isSubClassOf("Register")) 24876cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("implicitly defined value should be a register!"); 24886cefb77a7073057fecd721ae141140d75ce76512Chris Lattner InstImpResults.push_back(Val->getDef()); 24896cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 24906cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return; 249184aa60b522e6ff02214912968eba1c037dd7bba1Chris Lattner } 2492fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 249384aa60b522e6ff02214912968eba1c037dd7bba1Chris Lattner if (Pat->getOperator()->getName() != "set") { 24946cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If this is not a set, verify that the children nodes are not void typed, 24956cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // and recurse. 24966cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) { 2497d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (Pat->getChild(i)->getNumTypes() == 0) 24986cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Cannot have void nodes inside of patterns!"); 24996cefb77a7073057fecd721ae141140d75ce76512Chris Lattner FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults, 2500acfb70f75061975deda1deb167da8e83249f92edChris Lattner InstImpResults); 25016cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 2502fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 25036cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If this is a non-leaf node with no children, treat it basically as if 25046cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // it were a leaf. This handles nodes like (imm). 2505acfb70f75061975deda1deb167da8e83249f92edChris Lattner bool isUse = HandleUse(I, Pat, InstInputs); 2506fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 25076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!isUse && Pat->getTransformFn()) 25086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Cannot specify a transform function for a non-input value!"); 25096cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return; 251084aa60b522e6ff02214912968eba1c037dd7bba1Chris Lattner } 2511fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 25126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Otherwise, this is a set, validate and collect instruction results. 25136cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Pat->getNumChildren() == 0) 25146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("set requires operands!"); 2515fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 25166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Pat->getTransformFn()) 25176cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Cannot specify a transform function on a set node!"); 2518fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 25196cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Check the set destinations. 25206cefb77a7073057fecd721ae141140d75ce76512Chris Lattner unsigned NumDests = Pat->getNumChildren()-1; 25216cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0; i != NumDests; ++i) { 25226cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *Dest = Pat->getChild(i); 25236cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!Dest->isLeaf()) 25246cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("set destination should be a register!"); 2525fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 25266cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva DefInit *Val = dyn_cast<DefInit>(Dest->getLeafValue()); 25276cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!Val) 25286cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("set destination should be a register!"); 25296cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 25306cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Val->getDef()->isSubClassOf("RegisterClass") || 253119209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen Val->getDef()->isSubClassOf("ValueType") || 2532bea6f615eefae279e53bbb63a31d2c3c67274c45Owen Anderson Val->getDef()->isSubClassOf("RegisterOperand") || 2533a938ac6223c5fd315ab745086d843df5e0604e09Chris Lattner Val->getDef()->isSubClassOf("PointerLikeRegClass")) { 25346cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Dest->getName().empty()) 25356cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("set destination must have a name!"); 25366cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (InstResults.count(Dest->getName())) 25376cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("cannot set '" + Dest->getName() +"' multiple times"); 25386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner InstResults[Dest->getName()] = Dest; 25396cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else if (Val->getDef()->isSubClassOf("Register")) { 25406cefb77a7073057fecd721ae141140d75ce76512Chris Lattner InstImpResults.push_back(Val->getDef()); 25416cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else { 25426cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("set destination should be a register!"); 25436cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 25446cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 2545fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 25466cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Verify and collect info from the computation. 25476cefb77a7073057fecd721ae141140d75ce76512Chris Lattner FindPatternInputsAndOutputs(I, Pat->getChild(NumDests), 2548acfb70f75061975deda1deb167da8e83249f92edChris Lattner InstInputs, InstResults, InstImpResults); 25496cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 25506cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 2551ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman//===----------------------------------------------------------------------===// 2552ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman// Instruction Analysis 2553ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman//===----------------------------------------------------------------------===// 2554ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 2555ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohmanclass InstAnalyzer { 2556ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman const CodeGenDAGPatterns &CDP; 2557ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohmanpublic: 2558912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen bool hasSideEffects; 2559912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen bool mayStore; 2560912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen bool mayLoad; 2561912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen bool isBitcast; 2562912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen bool isVariadic; 2563ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 2564912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen InstAnalyzer(const CodeGenDAGPatterns &cdp) 2565912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen : CDP(cdp), hasSideEffects(false), mayStore(false), mayLoad(false), 2566912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen isBitcast(false), isVariadic(false) {} 2567912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen 2568912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen void Analyze(const TreePattern *Pat) { 2569912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen // Assume only the first tree is the pattern. The others are clobber nodes. 2570912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen AnalyzeNode(Pat->getTree(0)); 2571ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman } 2572ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 25734ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen void Analyze(const PatternToMatch *Pat) { 25744ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen AnalyzeNode(Pat->getSrcPattern()); 25754ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen } 25764ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen 2577ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohmanprivate: 25780f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng bool IsNodeBitcast(const TreePatternNode *N) const { 2579912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (hasSideEffects || mayLoad || mayStore || isVariadic) 25800f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng return false; 25810f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng 25820f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng if (N->getNumChildren() != 2) 25830f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng return false; 25840f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng 25850f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng const TreePatternNode *N0 = N->getChild(0); 25863f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva if (!N0->isLeaf() || !isa<DefInit>(N0->getLeafValue())) 25870f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng return false; 25880f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng 25890f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng const TreePatternNode *N1 = N->getChild(1); 25900f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng if (N1->isLeaf()) 25910f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng return false; 25920f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng if (N1->getNumChildren() != 1 || !N1->getChild(0)->isLeaf()) 25930f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng return false; 25940f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng 25950f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng const SDNodeInfo &OpInfo = CDP.getSDNodeInfo(N1->getOperator()); 25960f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng if (OpInfo.getNumResults() != 1 || OpInfo.getNumOperands() != 1) 25970f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng return false; 25980f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng return OpInfo.getEnumName() == "ISD::BITCAST"; 25990f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng } 26000f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng 2601325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesenpublic: 2602ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman void AnalyzeNode(const TreePatternNode *N) { 2603ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman if (N->isLeaf()) { 26046cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva if (DefInit *DI = dyn_cast<DefInit>(N->getLeafValue())) { 2605ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman Record *LeafRec = DI->getDef(); 2606ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman // Handle ComplexPattern leaves. 2607ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman if (LeafRec->isSubClassOf("ComplexPattern")) { 2608ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman const ComplexPattern &CP = CDP.getComplexPattern(LeafRec); 2609ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman if (CP.hasProperty(SDNPMayStore)) mayStore = true; 2610ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman if (CP.hasProperty(SDNPMayLoad)) mayLoad = true; 2611912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (CP.hasProperty(SDNPSideEffect)) hasSideEffects = true; 2612ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman } 2613ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman } 2614ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman return; 2615ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman } 2616ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 2617ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman // Analyze children. 2618ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) 2619ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman AnalyzeNode(N->getChild(i)); 2620ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 2621ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman // Ignore set nodes, which are not SDNodes. 26220f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng if (N->getOperator()->getName() == "set") { 2623912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen isBitcast = IsNodeBitcast(N); 2624ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman return; 26250f040a258ff6a2372fc232212b5e4189e8e7185dEvan Cheng } 2626ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 2627ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman // Notice properties of the node. 2628dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (N->NodeHasProperty(SDNPMayStore, CDP)) mayStore = true; 2629dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (N->NodeHasProperty(SDNPMayLoad, CDP)) mayLoad = true; 2630dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (N->NodeHasProperty(SDNPSideEffect, CDP)) hasSideEffects = true; 2631dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (N->NodeHasProperty(SDNPVariadic, CDP)) isVariadic = true; 2632ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 2633ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman if (const CodeGenIntrinsic *IntInfo = N->getIntrinsicInfo(CDP)) { 2634ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman // If this is an intrinsic, analyze it. 2635ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman if (IntInfo->ModRef >= CodeGenIntrinsic::ReadArgMem) 2636ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman mayLoad = true;// These may load memory. 2637ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 26387365c091f92db5e68c98d7faedc6c34e1bbbc898Dan Gohman if (IntInfo->ModRef >= CodeGenIntrinsic::ReadWriteArgMem) 2639ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman mayStore = true;// Intrinsics that can write to memory are 'mayStore'. 2640ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 26417365c091f92db5e68c98d7faedc6c34e1bbbc898Dan Gohman if (IntInfo->ModRef >= CodeGenIntrinsic::ReadWriteMem) 2642ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman // WriteMem intrinsics can have other strange effects. 2643912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen hasSideEffects = true; 2644ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman } 2645ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman } 2646ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 2647ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman}; 2648ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 264991f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesenstatic bool InferFromPattern(CodeGenInstruction &InstInfo, 2650912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen const InstAnalyzer &PatInfo, 2651912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen Record *PatDef) { 265291f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen bool Error = false; 265391f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen 2654912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen // Remember where InstInfo got its flags. 2655912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (InstInfo.hasUndefFlags()) 2656912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen InstInfo.InferredFrom = PatDef; 2657ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 265891f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen // Check explicitly set flags for consistency. 265991f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen if (InstInfo.hasSideEffects != PatInfo.hasSideEffects && 266091f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen !InstInfo.hasSideEffects_Unset) { 266191f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen // Allow explicitly setting hasSideEffects = 1 on instructions, even when 266291f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen // the pattern has no side effects. That could be useful for div/rem 266391f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen // instructions that may trap. 266491f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen if (!InstInfo.hasSideEffects) { 266591f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen Error = true; 266691f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen PrintError(PatDef->getLoc(), "Pattern doesn't match hasSideEffects = " + 266791f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen Twine(InstInfo.hasSideEffects)); 266891f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen } 266991f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen } 267091f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen 267191f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen if (InstInfo.mayStore != PatInfo.mayStore && !InstInfo.mayStore_Unset) { 267291f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen Error = true; 267391f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen PrintError(PatDef->getLoc(), "Pattern doesn't match mayStore = " + 267491f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen Twine(InstInfo.mayStore)); 267591f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen } 267691f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen 267791f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen if (InstInfo.mayLoad != PatInfo.mayLoad && !InstInfo.mayLoad_Unset) { 267891f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen // Allow explicitly setting mayLoad = 1, even when the pattern has no loads. 267991f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen // Some targets translate imediates to loads. 268091f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen if (!InstInfo.mayLoad) { 268191f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen Error = true; 268291f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen PrintError(PatDef->getLoc(), "Pattern doesn't match mayLoad = " + 268391f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen Twine(InstInfo.mayLoad)); 268491f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen } 268591f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen } 268691f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen 2687912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen // Transfer inferred flags. 2688912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen InstInfo.hasSideEffects |= PatInfo.hasSideEffects; 2689912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen InstInfo.mayStore |= PatInfo.mayStore; 2690912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen InstInfo.mayLoad |= PatInfo.mayLoad; 2691ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 2692912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen // These flags are silently added without any verification. 2693912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen InstInfo.isBitcast |= PatInfo.isBitcast; 2694aaaecfce70c0aaed9225359fc56c67b59dca768eJakob Stoklund Olesen 2695aaaecfce70c0aaed9225359fc56c67b59dca768eJakob Stoklund Olesen // Don't infer isVariadic. This flag means something different on SDNodes and 2696aaaecfce70c0aaed9225359fc56c67b59dca768eJakob Stoklund Olesen // instructions. For example, a CALL SDNode is variadic because it has the 2697aaaecfce70c0aaed9225359fc56c67b59dca768eJakob Stoklund Olesen // call arguments as operands, but a CALL instruction is not variadic - it 2698aaaecfce70c0aaed9225359fc56c67b59dca768eJakob Stoklund Olesen // has argument registers as implicit, not explicit uses. 269991f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen 270091f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen return Error; 2701ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman} 2702ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 2703ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach/// hasNullFragReference - Return true if the DAG has any reference to the 2704ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach/// null_frag operator. 2705ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbachstatic bool hasNullFragReference(DagInit *DI) { 27066cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva DefInit *OpDef = dyn_cast<DefInit>(DI->getOperator()); 2707ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach if (!OpDef) return false; 2708ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach Record *Operator = OpDef->getDef(); 2709ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach 2710ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach // If this is the null fragment, return true. 2711ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach if (Operator->getName() == "null_frag") return true; 2712ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach // If any of the arguments reference the null fragment, return true. 2713ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach for (unsigned i = 0, e = DI->getNumArgs(); i != e; ++i) { 27146cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva DagInit *Arg = dyn_cast<DagInit>(DI->getArg(i)); 2715ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach if (Arg && hasNullFragReference(Arg)) 2716ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach return true; 2717ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach } 2718ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach 2719ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach return false; 2720ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach} 2721ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach 2722ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach/// hasNullFragReference - Return true if any DAG in the list references 2723ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach/// the null_frag operator. 2724ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbachstatic bool hasNullFragReference(ListInit *LI) { 2725ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach for (unsigned i = 0, e = LI->getSize(); i != e; ++i) { 27266cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva DagInit *DI = dyn_cast<DagInit>(LI->getElement(i)); 2727ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach assert(DI && "non-dag in an instruction Pattern list?!"); 2728ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach if (hasNullFragReference(DI)) 2729ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach return true; 2730ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach } 2731ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach return false; 2732ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach} 2733ac915b48d8ba73a5d734be5c4a0e1d25cea93252Jim Grosbach 27344ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen/// Get all the instructions in a tree. 27354ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesenstatic void 27364ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund OlesengetInstructionsInTree(TreePatternNode *Tree, SmallVectorImpl<Record*> &Instrs) { 27374ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen if (Tree->isLeaf()) 27384ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen return; 27394ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen if (Tree->getOperator()->isSubClassOf("Instruction")) 27404ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen Instrs.push_back(Tree->getOperator()); 27414ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen for (unsigned i = 0, e = Tree->getNumChildren(); i != e; ++i) 27424ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen getInstructionsInTree(Tree->getChild(i), Instrs); 27434ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen} 27444ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen 274519209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen/// Check the class of a pattern leaf node against the instruction operand it 274619209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen/// represents. 274719209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesenstatic bool checkOperandClass(CGIOperandList::OperandInfo &OI, 274819209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen Record *Leaf) { 274919209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen if (OI.Rec == Leaf) 275019209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen return true; 275119209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen 275219209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen // Allow direct value types to be used in instruction set patterns. 275319209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen // The type will be checked later. 275419209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen if (Leaf->isSubClassOf("ValueType")) 275519209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen return true; 275619209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen 275719209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen // Patterns can also be ComplexPattern instances. 275819209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen if (Leaf->isSubClassOf("ComplexPattern")) 275919209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen return true; 276019209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen 276119209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen return false; 276219209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen} 276319209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen 27642b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougachaconst DAGInstruction &CodeGenDAGPatterns::parseInstructionPattern( 27652b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha CodeGenInstruction &CGI, ListInit *Pat, DAGInstMap &DAGInsts) { 2766fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 27672b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha assert(!DAGInsts.count(CGI.TheDef) && "Instruction already parsed!"); 2768fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 27696cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Parse the instruction. 27702b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha TreePattern *I = new TreePattern(CGI.TheDef, Pat, true, *this); 27716cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Inline pattern fragments into it. 27726cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->InlinePatternFragments(); 2773fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 27746cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Infer as many types as possible. If we cannot infer all of them, we can 27756cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // never do anything with this instruction pattern: report it to the user. 27766cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!I->InferAllTypes()) 27776cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Could not infer all types in pattern!"); 2778fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 2779fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach // InstInputs - Keep track of all of the inputs of the instruction, along 27806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // with the record they are declared as. 27816cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::map<std::string, TreePatternNode*> InstInputs; 2782fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 27836cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // InstResults - Keep track of all the virtual registers that are 'set' 27846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // in the instruction, including what reg class they are. 27856cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::map<std::string, TreePatternNode*> InstResults; 27866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 27876cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<Record*> InstImpResults; 2788fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 27896cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Verify that the top-level forms in the instruction are of void type, and 27906cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // fill in the InstResults map. 27916cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) { 27926cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *Pat = I->getTree(j); 2793d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (Pat->getNumTypes() != 0) 27946cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Top-level forms in instruction pattern should have" 27956cefb77a7073057fecd721ae141140d75ce76512Chris Lattner " void types"); 27966cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 27976cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Find inputs and outputs, and verify the structure of the uses/defs. 27986cefb77a7073057fecd721ae141140d75ce76512Chris Lattner FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults, 2799acfb70f75061975deda1deb167da8e83249f92edChris Lattner InstImpResults); 28006cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 28016cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 28026cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Now that we have inputs and outputs of the pattern, inspect the operands 28036cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // list for the instruction. This determines the order that operands are 28046cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // added to the machine instruction the node corresponds to. 28056cefb77a7073057fecd721ae141140d75ce76512Chris Lattner unsigned NumResults = InstResults.size(); 28066cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 28076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Parse the operands list from the (ops) list, validating it. 28086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner assert(I->getArgList().empty() && "Args list should still be empty here!"); 28096cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 28106cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Check that all of the results occur first in the list. 28116cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<Record*> Results; 2812dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines TreePatternNode *Res0Node = nullptr; 28136cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0; i != NumResults; ++i) { 2814c240bb0ede0541426254d0e0dc81d891beda4b22Chris Lattner if (i == CGI.Operands.size()) 28156cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("'" + InstResults.begin()->first + 28166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner "' set but does not appear in operand list!"); 2817c240bb0ede0541426254d0e0dc81d891beda4b22Chris Lattner const std::string &OpName = CGI.Operands[i].Name; 2818fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 28196cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Check that it exists in InstResults. 28206cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *RNode = InstResults[OpName]; 2821dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (!RNode) 28226cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Operand $" + OpName + " does not exist in operand list!"); 2823fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 28246cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (i == 0) 28256cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Res0Node = RNode; 28263f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva Record *R = cast<DefInit>(RNode->getLeafValue())->getDef(); 2827dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (!R) 28286cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Operand $" + OpName + " should be a set destination: all " 28296cefb77a7073057fecd721ae141140d75ce76512Chris Lattner "outputs must occur before inputs in operand list!"); 2830fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 283119209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen if (!checkOperandClass(CGI.Operands[i], R)) 28326cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Operand $" + OpName + " class mismatch!"); 2833fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 28346cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Remember the return type. 2835c240bb0ede0541426254d0e0dc81d891beda4b22Chris Lattner Results.push_back(CGI.Operands[i].Rec); 2836fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 28376cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Okay, this one checks out. 28386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner InstResults.erase(OpName); 28396cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 28406cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 28416cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Loop over the inputs next. Make a copy of InstInputs so we can destroy 28426cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // the copy while we're checking the inputs. 28436cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::map<std::string, TreePatternNode*> InstInputsCheck(InstInputs); 28446cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 28456cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> ResultNodeOperands; 28466cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<Record*> Operands; 2847c240bb0ede0541426254d0e0dc81d891beda4b22Chris Lattner for (unsigned i = NumResults, e = CGI.Operands.size(); i != e; ++i) { 2848c240bb0ede0541426254d0e0dc81d891beda4b22Chris Lattner CGIOperandList::OperandInfo &Op = CGI.Operands[i]; 28496cefb77a7073057fecd721ae141140d75ce76512Chris Lattner const std::string &OpName = Op.Name; 28506cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (OpName.empty()) 28516cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Operand #" + utostr(i) + " in operands list has no name!"); 28526cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 28536cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!InstInputsCheck.count(OpName)) { 28546d3d7656539188b496089a3313ed4d13759adba3Tom Stellard // If this is an operand with a DefaultOps set filled in, we can ignore 28556d3d7656539188b496089a3313ed4d13759adba3Tom Stellard // this. When we codegen it, we will do so as always executed. 28566d3d7656539188b496089a3313ed4d13759adba3Tom Stellard if (Op.Rec->isSubClassOf("OperandWithDefaultOps")) { 28576cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Does it have a non-empty DefaultOps field? If so, ignore this 28586cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // operand. 28596cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!getDefaultOperand(Op.Rec).DefaultOps.empty()) 28606cefb77a7073057fecd721ae141140d75ce76512Chris Lattner continue; 28616cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 28626cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Operand $" + OpName + 28636cefb77a7073057fecd721ae141140d75ce76512Chris Lattner " does not appear in the instruction pattern"); 28646cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 28656cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *InVal = InstInputsCheck[OpName]; 28666cefb77a7073057fecd721ae141140d75ce76512Chris Lattner InstInputsCheck.erase(OpName); // It occurred, remove from map. 2867fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 28683f7b7f8ce0b050fc6a0100839d9c5a84198b2aedSean Silva if (InVal->isLeaf() && isa<DefInit>(InVal->getLeafValue())) { 286905bce0beee87512e52428d4b80f5a8e79a949576David Greene Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef(); 287019209960b68b194d944a28f4b0f5bb8fd6563145Jakob Stoklund Olesen if (!checkOperandClass(Op, InRec)) 28716cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Operand $" + OpName + "'s register class disagrees" 28726cefb77a7073057fecd721ae141140d75ce76512Chris Lattner " between the operand and pattern"); 28736cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 28746cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Operands.push_back(Op.Rec); 2875fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 28766cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Construct the result for the dest-pattern operand list. 28776cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *OpNode = InVal->clone(); 2878fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 28796cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // No predicate is useful on the result. 28800540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman OpNode->clearPredicateFns(); 2881fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 28826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Promote the xform function to be an explicit node if set. 28836cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Record *Xform = OpNode->getTransformFn()) { 2884dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines OpNode->setTransformFn(nullptr); 28856cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> Children; 28866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Children.push_back(OpNode); 2887d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner OpNode = new TreePatternNode(Xform, Children, OpNode->getNumTypes()); 28886cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 2889fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 28906cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ResultNodeOperands.push_back(OpNode); 28916cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 2892fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 28936cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!InstInputsCheck.empty()) 28946cefb77a7073057fecd721ae141140d75ce76512Chris Lattner I->error("Input operand $" + InstInputsCheck.begin()->first + 28956cefb77a7073057fecd721ae141140d75ce76512Chris Lattner " occurs in pattern but not in operands list!"); 28966cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 28976cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *ResultPattern = 2898d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner new TreePatternNode(I->getRecord(), ResultNodeOperands, 2899d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner GetNumNodeResults(I->getRecord(), *this)); 29006cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Copy fully inferred output node type to instruction result pattern. 2901d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner for (unsigned i = 0; i != NumResults; ++i) 2902d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner ResultPattern->setType(i, Res0Node->getExtType(i)); 29036cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 29046cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Create and insert the instruction. 2905acfb70f75061975deda1deb167da8e83249f92edChris Lattner // FIXME: InstImpResults should not be part of DAGInstruction. 290662bcec82b2762d5cdc84fe39c7d634c784ed6673Chris Lattner DAGInstruction TheInst(I, Results, Operands, InstImpResults); 29072b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha DAGInsts.insert(std::make_pair(I->getRecord(), TheInst)); 29086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 29096cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Use a temporary tree pattern to infer all types and make sure that the 29106cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // constructed result is correct. This depends on the instruction already 29112b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha // being inserted into the DAGInsts map. 29126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePattern Temp(I->getRecord(), ResultPattern, false, *this); 29132cacec55f947c716b058a39038889550d7e39b3cChris Lattner Temp.InferAllTypes(&I->getNamedNodesMap()); 29146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 29152b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha DAGInstruction &TheInsertedInst = DAGInsts.find(I->getRecord())->second; 29166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TheInsertedInst.setResultPattern(Temp.getOnlyTree()); 2917fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 29182b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha return TheInsertedInst; 29192b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha } 29202b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha 29212b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha/// ParseInstructions - Parse all of the instructions, inlining and resolving 29222b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha/// any fragments involved. This populates the Instructions list with fully 29232b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha/// resolved instructions. 29242b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougachavoid CodeGenDAGPatterns::ParseInstructions() { 29252b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction"); 29262b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha 29272b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha for (unsigned i = 0, e = Instrs.size(); i != e; ++i) { 2928dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines ListInit *LI = nullptr; 29292b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha 29302b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha if (isa<ListInit>(Instrs[i]->getValueInit("Pattern"))) 29312b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha LI = Instrs[i]->getValueAsListInit("Pattern"); 29322b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha 29332b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha // If there is no pattern, only collect minimal information about the 29342b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha // instruction for its operand list. We have to assume that there is one 29352b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha // result, as we have no detailed info. A pattern which references the 29362b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha // null_frag operator is as-if no pattern were specified. Normally this 29372b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha // is from a multiclass expansion w/ a SDPatternOperator passed in as 29382b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha // null_frag. 29392b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha if (!LI || LI->getSize() == 0 || hasNullFragReference(LI)) { 29402b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha std::vector<Record*> Results; 29412b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha std::vector<Record*> Operands; 29422b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha 29432b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha CodeGenInstruction &InstInfo = Target.getInstruction(Instrs[i]); 29442b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha 29452b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha if (InstInfo.Operands.size() != 0) { 29462b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha if (InstInfo.Operands.NumDefs == 0) { 29472b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha // These produce no results 29482b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha for (unsigned j = 0, e = InstInfo.Operands.size(); j < e; ++j) 29492b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha Operands.push_back(InstInfo.Operands[j].Rec); 29502b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha } else { 29512b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha // Assume the first operand is the result. 29522b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha Results.push_back(InstInfo.Operands[0].Rec); 29532b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha 29542b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha // The rest are inputs. 29552b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha for (unsigned j = 1, e = InstInfo.Operands.size(); j < e; ++j) 29562b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha Operands.push_back(InstInfo.Operands[j].Rec); 29572b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha } 29582b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha } 29592b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha 29602b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha // Create and insert the instruction. 29612b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha std::vector<Record*> ImpResults; 29622b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha Instructions.insert(std::make_pair(Instrs[i], 2963dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines DAGInstruction(nullptr, Results, Operands, ImpResults))); 29642b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha continue; // no pattern. 29652b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha } 29662b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha 29672b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha CodeGenInstruction &CGI = Target.getInstruction(Instrs[i]); 29682b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha const DAGInstruction &DI = parseInstructionPattern(CGI, LI, Instructions); 29692b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha 29701799684671805069cecdc2765b00b751fdbce19bAhmed Bougacha (void)DI; 29712b43ffff322899dec2f49cb3cc13037b60679f72Ahmed Bougacha DEBUG(DI.getPattern()->dump()); 29726cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 2973fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 29746cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If we can, convert the instructions to be patterns that are matched! 297590fee07298bec2e5160a599db850b9553d02377bSean Silva for (std::map<Record*, DAGInstruction, LessRecordByID>::iterator II = 29765b9e7ef627aa1e2f49a6ee85e718199799841f7eBenjamin Kramer Instructions.begin(), 29776cefb77a7073057fecd721ae141140d75ce76512Chris Lattner E = Instructions.end(); II != E; ++II) { 29786cefb77a7073057fecd721ae141140d75ce76512Chris Lattner DAGInstruction &TheInst = II->second; 297961131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger TreePattern *I = TheInst.getPattern(); 2980dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (!I) continue; // No pattern. 29816cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 29826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // FIXME: Assume only the first tree is the pattern. The others are clobber 29836cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // nodes. 29846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *Pattern = I->getTree(0); 29856cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *SrcPattern; 29866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Pattern->getOperator()->getName() == "set") { 29876cefb77a7073057fecd721ae141140d75ce76512Chris Lattner SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone(); 29886cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else{ 29896cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Not a set (store or something?) 29906cefb77a7073057fecd721ae141140d75ce76512Chris Lattner SrcPattern = Pattern; 29916cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 2992fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 29936cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Record *Instr = II->first; 299425b6f91c549225ae4fc9855b9c82a46d05dfd4d8Chris Lattner AddPatternToMatch(I, 2995997759ac22dc1de6f324b1c09c0a2a558236c489Jim Grosbach PatternToMatch(Instr, 2996997759ac22dc1de6f324b1c09c0a2a558236c489Jim Grosbach Instr->getValueAsListInit("Predicates"), 2997967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner SrcPattern, 2998967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner TheInst.getResultPattern(), 299925b6f91c549225ae4fc9855b9c82a46d05dfd4d8Chris Lattner TheInst.getImpResults(), 3000117ccb7e518f05e4bf3df058fc402262f897ff0bChris Lattner Instr->getValueAsInt("AddedComplexity"), 3001117ccb7e518f05e4bf3df058fc402262f897ff0bChris Lattner Instr->getID())); 30026cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 30036cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 30046cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 30054ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner 30064ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattnertypedef std::pair<const TreePatternNode*, unsigned> NameRecord; 30074ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner 3008fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbachstatic void FindNames(const TreePatternNode *P, 3009a27234e290a4809c5a60e28e99f2870142ff3a55Chris Lattner std::map<std::string, NameRecord> &Names, 301061131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger TreePattern *PatternTop) { 30114ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner if (!P->getName().empty()) { 30124ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner NameRecord &Rec = Names[P->getName()]; 30134ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner // If this is the first instance of the name, remember the node. 30144ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner if (Rec.second++ == 0) 30154ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner Rec.first = P; 3016d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner else if (Rec.first->getExtTypes() != P->getExtTypes()) 3017a27234e290a4809c5a60e28e99f2870142ff3a55Chris Lattner PatternTop->error("repetition of value: $" + P->getName() + 3018a27234e290a4809c5a60e28e99f2870142ff3a55Chris Lattner " where different uses have different types!"); 30194ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner } 3020fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3021967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner if (!P->isLeaf()) { 3022967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) 3023a27234e290a4809c5a60e28e99f2870142ff3a55Chris Lattner FindNames(P->getChild(i), Names, PatternTop); 3024967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner } 3025967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner} 3026967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner 302761131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenbergervoid CodeGenDAGPatterns::AddPatternToMatch(TreePattern *Pattern, 302825b6f91c549225ae4fc9855b9c82a46d05dfd4d8Chris Lattner const PatternToMatch &PTM) { 3029967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner // Do some sanity checking on the pattern we're about to match. 303025b6f91c549225ae4fc9855b9c82a46d05dfd4d8Chris Lattner std::string Reason; 3031eb79b545fc347142eba44a7ffd29d426da3281ecOwen Anderson if (!PTM.getSrcPattern()->canPatternMatch(Reason, *this)) { 3032eb79b545fc347142eba44a7ffd29d426da3281ecOwen Anderson PrintWarning(Pattern->getRecord()->getLoc(), 3033eb79b545fc347142eba44a7ffd29d426da3281ecOwen Anderson Twine("Pattern can never match: ") + Reason); 3034eb79b545fc347142eba44a7ffd29d426da3281ecOwen Anderson return; 3035eb79b545fc347142eba44a7ffd29d426da3281ecOwen Anderson } 3036fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3037405f1252b9f3937b9c30edf683375cf261967c79Chris Lattner // If the source pattern's root is a complex pattern, that complex pattern 3038405f1252b9f3937b9c30edf683375cf261967c79Chris Lattner // must specify the nodes it can potentially match. 3039405f1252b9f3937b9c30edf683375cf261967c79Chris Lattner if (const ComplexPattern *CP = 3040405f1252b9f3937b9c30edf683375cf261967c79Chris Lattner PTM.getSrcPattern()->getComplexPatternInfo(*this)) 3041405f1252b9f3937b9c30edf683375cf261967c79Chris Lattner if (CP->getRootNodes().empty()) 3042405f1252b9f3937b9c30edf683375cf261967c79Chris Lattner Pattern->error("ComplexPattern at root must specify list of opcodes it" 3043405f1252b9f3937b9c30edf683375cf261967c79Chris Lattner " could match"); 3044fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3045fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3046967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner // Find all of the named values in the input and output, ensure they have the 3047967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner // same type. 30484ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner std::map<std::string, NameRecord> SrcNames, DstNames; 3049a27234e290a4809c5a60e28e99f2870142ff3a55Chris Lattner FindNames(PTM.getSrcPattern(), SrcNames, Pattern); 3050a27234e290a4809c5a60e28e99f2870142ff3a55Chris Lattner FindNames(PTM.getDstPattern(), DstNames, Pattern); 3051967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner 3052967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner // Scan all of the named values in the destination pattern, rejecting them if 3053967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner // they don't exist in the input pattern. 30544ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner for (std::map<std::string, NameRecord>::iterator 3055ba1cff4450e22415bfcb960342e6d5a5918e530aChris Lattner I = DstNames.begin(), E = DstNames.end(); I != E; ++I) { 3056dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (SrcNames[I->first].first == nullptr) 3057967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner Pattern->error("Pattern has input without matching name in output: $" + 3058967d54ae04d562e0d375bb1dda4289cc58590cfaChris Lattner I->first); 3059ba1cff4450e22415bfcb960342e6d5a5918e530aChris Lattner } 3060fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 30614ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner // Scan all of the named values in the source pattern, rejecting them if the 30624ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner // name isn't used in the dest, and isn't used to tie two values together. 30634ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner for (std::map<std::string, NameRecord>::iterator 30644ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner I = SrcNames.begin(), E = SrcNames.end(); I != E; ++I) 3065dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (DstNames[I->first].first == nullptr && SrcNames[I->first].second == 1) 30664ac7a0ca8fa22ff641e8469d7feca2ac0aea3cefChris Lattner Pattern->error("Pattern has dead named input: $" + I->first); 3067fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 306825b6f91c549225ae4fc9855b9c82a46d05dfd4d8Chris Lattner PatternsToMatch.push_back(PTM); 306925b6f91c549225ae4fc9855b9c82a46d05dfd4d8Chris Lattner} 307025b6f91c549225ae4fc9855b9c82a46d05dfd4d8Chris Lattner 307125b6f91c549225ae4fc9855b9c82a46d05dfd4d8Chris Lattner 3072ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 3073ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohmanvoid CodeGenDAGPatterns::InferInstructionFlags() { 3074f65027842e82027dd6e8020586a299aaa548e355Chris Lattner const std::vector<const CodeGenInstruction*> &Instructions = 3075f65027842e82027dd6e8020586a299aaa548e355Chris Lattner Target.getInstructionsByEnumValue(); 3076912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen 3077912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen // First try to infer flags from the primary instruction pattern, if any. 3078912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen SmallVector<CodeGenInstruction*, 8> Revisit; 307991f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen unsigned Errors = 0; 3080b61e09de6d0cd7241ddc6dee3efef416552eec3bChris Lattner for (unsigned i = 0, e = Instructions.size(); i != e; ++i) { 3081b61e09de6d0cd7241ddc6dee3efef416552eec3bChris Lattner CodeGenInstruction &InstInfo = 3082b61e09de6d0cd7241ddc6dee3efef416552eec3bChris Lattner const_cast<CodeGenInstruction &>(*Instructions[i]); 3083912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen 3084912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen // Treat neverHasSideEffects = 1 as the equivalent of hasSideEffects = 0. 3085912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen // This flag is obsolete and will be removed. 3086912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (InstInfo.neverHasSideEffects) { 3087912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen assert(!InstInfo.hasSideEffects); 3088912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen InstInfo.hasSideEffects_Unset = false; 3089912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen } 3090912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen 3091912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen // Get the primary instruction pattern. 3092912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen const TreePattern *Pattern = getInstruction(InstInfo.TheDef).getPattern(); 3093912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (!Pattern) { 3094912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (InstInfo.hasUndefFlags()) 3095912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen Revisit.push_back(&InstInfo); 3096912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen continue; 3097912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen } 3098912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen InstAnalyzer PatInfo(*this); 3099912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen PatInfo.Analyze(Pattern); 310091f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen Errors += InferFromPattern(InstInfo, PatInfo, InstInfo.TheDef); 3101912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen } 3102912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen 31034ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen // Second, look for single-instruction patterns defined outside the 31044ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen // instruction. 31054ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen for (ptm_iterator I = ptm_begin(), E = ptm_end(); I != E; ++I) { 31064ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen const PatternToMatch &PTM = *I; 31074ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen 31084ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen // We can only infer from single-instruction patterns, otherwise we won't 31094ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen // know which instruction should get the flags. 31104ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen SmallVector<Record*, 8> PatInstrs; 31114ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen getInstructionsInTree(PTM.getDstPattern(), PatInstrs); 31124ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen if (PatInstrs.size() != 1) 31134ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen continue; 31144ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen 31154ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen // Get the single instruction. 31164ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen CodeGenInstruction &InstInfo = Target.getInstruction(PatInstrs.front()); 31174ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen 31184ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen // Only infer properties from the first pattern. We'll verify the others. 31194ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen if (InstInfo.InferredFrom) 31204ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen continue; 31214ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen 31224ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen InstAnalyzer PatInfo(*this); 31234ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen PatInfo.Analyze(&PTM); 31244ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen Errors += InferFromPattern(InstInfo, PatInfo, PTM.getSrcRecord()); 31254ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen } 31264ad27eda29413d45a98912877ab2706efbc1e86eJakob Stoklund Olesen 312791f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen if (Errors) 312861131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger PrintFatalError("pattern conflicts"); 312991f8dc9baeb35d5812a797d733e689120e041fefJakob Stoklund Olesen 3130912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen // Revisit instructions with undefined flags and no pattern. 3131912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (Target.guessInstructionProperties()) { 3132912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen for (unsigned i = 0, e = Revisit.size(); i != e; ++i) { 3133912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen CodeGenInstruction &InstInfo = *Revisit[i]; 3134912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (InstInfo.InferredFrom) 3135912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen continue; 3136912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen // The mayLoad and mayStore flags default to false. 3137912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen // Conservatively assume hasSideEffects if it wasn't explicit. 3138912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (InstInfo.hasSideEffects_Unset) 3139912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen InstInfo.hasSideEffects = true; 3140912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen } 3141912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen return; 3142912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen } 3143912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen 3144912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen // Complain about any flags that are still undefined. 3145912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen for (unsigned i = 0, e = Revisit.size(); i != e; ++i) { 3146912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen CodeGenInstruction &InstInfo = *Revisit[i]; 3147912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (InstInfo.InferredFrom) 3148912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen continue; 3149912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (InstInfo.hasSideEffects_Unset) 3150912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen PrintError(InstInfo.TheDef->getLoc(), 3151912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen "Can't infer hasSideEffects from patterns"); 3152912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (InstInfo.mayStore_Unset) 3153912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen PrintError(InstInfo.TheDef->getLoc(), 3154912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen "Can't infer mayStore from patterns"); 3155912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen if (InstInfo.mayLoad_Unset) 3156912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen PrintError(InstInfo.TheDef->getLoc(), 3157912519a72eb9ed2d8c957ae8b08d95d9e080dac8Jakob Stoklund Olesen "Can't infer mayLoad from patterns"); 3158ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman } 3159ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman} 3160ee4fa1977dd3a495a8857eef924ee5961db765c6Dan Gohman 3161325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen 3162325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen/// Verify instruction flags against pattern node properties. 3163325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesenvoid CodeGenDAGPatterns::VerifyInstructionFlags() { 3164325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen unsigned Errors = 0; 3165325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen for (ptm_iterator I = ptm_begin(), E = ptm_end(); I != E; ++I) { 3166325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen const PatternToMatch &PTM = *I; 3167325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen SmallVector<Record*, 8> Instrs; 3168325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen getInstructionsInTree(PTM.getDstPattern(), Instrs); 3169325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen if (Instrs.empty()) 3170325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen continue; 3171325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen 3172325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen // Count the number of instructions with each flag set. 3173325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen unsigned NumSideEffects = 0; 3174325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen unsigned NumStores = 0; 3175325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen unsigned NumLoads = 0; 3176325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen for (unsigned i = 0, e = Instrs.size(); i != e; ++i) { 3177325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen const CodeGenInstruction &InstInfo = Target.getInstruction(Instrs[i]); 3178325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen NumSideEffects += InstInfo.hasSideEffects; 3179325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen NumStores += InstInfo.mayStore; 3180325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen NumLoads += InstInfo.mayLoad; 3181325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen } 3182325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen 3183325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen // Analyze the source pattern. 3184325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen InstAnalyzer PatInfo(*this); 3185325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen PatInfo.Analyze(&PTM); 3186325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen 3187325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen // Collect error messages. 3188325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen SmallVector<std::string, 4> Msgs; 3189325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen 3190325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen // Check for missing flags in the output. 3191325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen // Permit extra flags for now at least. 3192325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen if (PatInfo.hasSideEffects && !NumSideEffects) 3193325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen Msgs.push_back("pattern has side effects, but hasSideEffects isn't set"); 3194325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen 3195325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen // Don't verify store flags on instructions with side effects. At least for 3196325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen // intrinsics, side effects implies mayStore. 3197325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen if (!PatInfo.hasSideEffects && PatInfo.mayStore && !NumStores) 3198325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen Msgs.push_back("pattern may store, but mayStore isn't set"); 3199325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen 3200325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen // Similarly, mayStore implies mayLoad on intrinsics. 3201325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen if (!PatInfo.mayStore && PatInfo.mayLoad && !NumLoads) 3202325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen Msgs.push_back("pattern may load, but mayLoad isn't set"); 3203325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen 3204325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen // Print error messages. 3205325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen if (Msgs.empty()) 3206325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen continue; 3207325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen ++Errors; 3208325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen 3209325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen for (unsigned i = 0, e = Msgs.size(); i != e; ++i) 3210325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen PrintError(PTM.getSrcRecord()->getLoc(), Twine(Msgs[i]) + " on the " + 3211325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen (Instrs.size() == 1 ? 3212325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen "instruction" : "output instructions")); 3213325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen // Provide the location of the relevant instruction definitions. 3214325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen for (unsigned i = 0, e = Instrs.size(); i != e; ++i) { 3215325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen if (Instrs[i] != PTM.getSrcRecord()) 3216325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen PrintError(Instrs[i]->getLoc(), "defined here"); 3217325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen const CodeGenInstruction &InstInfo = Target.getInstruction(Instrs[i]); 3218325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen if (InstInfo.InferredFrom && 3219325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen InstInfo.InferredFrom != InstInfo.TheDef && 3220325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen InstInfo.InferredFrom != PTM.getSrcRecord()) 3221325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen PrintError(InstInfo.InferredFrom->getLoc(), "inferred from patttern"); 3222325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen } 3223325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen } 3224325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen if (Errors) 322561131ab15fd593a2e295d79fe2714e7bc21f2ec8Joerg Sonnenberger PrintFatalError("Errors in DAG patterns"); 3226325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen} 3227325907d0860f8316edcc3bb00bf7b8b04497c177Jakob Stoklund Olesen 32282cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// Given a pattern result with an unresolved type, see if we can find one 32292cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// instruction with an unresolved result type. Force this result type to an 32302cacec55f947c716b058a39038889550d7e39b3cChris Lattner/// arbitrary element if it's possible types to converge results. 32312cacec55f947c716b058a39038889550d7e39b3cChris Lattnerstatic bool ForceArbitraryInstResultType(TreePatternNode *N, TreePattern &TP) { 32322cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (N->isLeaf()) 32332cacec55f947c716b058a39038889550d7e39b3cChris Lattner return false; 3234fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 32352cacec55f947c716b058a39038889550d7e39b3cChris Lattner // Analyze children. 32362cacec55f947c716b058a39038889550d7e39b3cChris Lattner for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) 32372cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (ForceArbitraryInstResultType(N->getChild(i), TP)) 32382cacec55f947c716b058a39038889550d7e39b3cChris Lattner return true; 32392cacec55f947c716b058a39038889550d7e39b3cChris Lattner 32402cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (!N->getOperator()->isSubClassOf("Instruction")) 32412cacec55f947c716b058a39038889550d7e39b3cChris Lattner return false; 32422cacec55f947c716b058a39038889550d7e39b3cChris Lattner 32432cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If this type is already concrete or completely unknown we can't do 32442cacec55f947c716b058a39038889550d7e39b3cChris Lattner // anything. 3245d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner for (unsigned i = 0, e = N->getNumTypes(); i != e; ++i) { 3246d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (N->getExtType(i).isCompletelyUnknown() || N->getExtType(i).isConcrete()) 3247d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner continue; 3248fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3249d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner // Otherwise, force its type to the first possibility (an arbitrary choice). 3250d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner if (N->getExtType(i).MergeInTypeInfo(N->getExtType(i).getTypeList()[0], TP)) 3251d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return true; 3252d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner } 3253fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3254d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner return false; 32552cacec55f947c716b058a39038889550d7e39b3cChris Lattner} 32562cacec55f947c716b058a39038889550d7e39b3cChris Lattner 3257fe71893183f504feff290e343bf740bd32432129Chris Lattnervoid CodeGenDAGPatterns::ParsePatterns() { 32586cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern"); 32596cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 32606cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = Patterns.size(); i != e; ++i) { 3261d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner Record *CurPattern = Patterns[i]; 326205bce0beee87512e52428d4b80f5a8e79a949576David Greene DagInit *Tree = CurPattern->getValueAsDag("PatternToMatch"); 3263d3e31218ef7ccf96b0bc7e06e2ebd279325c97feJim Grosbach 3264d3e31218ef7ccf96b0bc7e06e2ebd279325c97feJim Grosbach // If the pattern references the null_frag, there's nothing to do. 3265d3e31218ef7ccf96b0bc7e06e2ebd279325c97feJim Grosbach if (hasNullFragReference(Tree)) 3266d3e31218ef7ccf96b0bc7e06e2ebd279325c97feJim Grosbach continue; 3267d3e31218ef7ccf96b0bc7e06e2ebd279325c97feJim Grosbach 3268310adf1c6f58921b30fde145fd15cb1798050205Chris Lattner TreePattern *Pattern = new TreePattern(CurPattern, Tree, true, *this); 32696cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 32706cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Inline pattern fragments into it. 32716cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Pattern->InlinePatternFragments(); 3272fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 327305bce0beee87512e52428d4b80f5a8e79a949576David Greene ListInit *LI = CurPattern->getValueAsListInit("ResultInstrs"); 32746cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (LI->getSize() == 0) continue; // no pattern. 3275fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 32766cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Parse the instruction. 3277d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner TreePattern *Result = new TreePattern(CurPattern, LI, false, *this); 3278fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 32796cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Inline pattern fragments into it. 32806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Result->InlinePatternFragments(); 32816cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 32826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Result->getNumTrees() != 1) 32836cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Result->error("Cannot handle instructions producing instructions " 32846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner "with temporaries yet!"); 3285fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 32866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner bool IterateInference; 32876cefb77a7073057fecd721ae141140d75ce76512Chris Lattner bool InferredAllPatternTypes, InferredAllResultTypes; 32886cefb77a7073057fecd721ae141140d75ce76512Chris Lattner do { 32896cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Infer as many types as possible. If we cannot infer all of them, we 32906cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // can never do anything with this pattern: report it to the user. 32912cacec55f947c716b058a39038889550d7e39b3cChris Lattner InferredAllPatternTypes = 32922cacec55f947c716b058a39038889550d7e39b3cChris Lattner Pattern->InferAllTypes(&Pattern->getNamedNodesMap()); 3293fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 32946cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Infer as many types as possible. If we cannot infer all of them, we 32956cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // can never do anything with this pattern: report it to the user. 32962cacec55f947c716b058a39038889550d7e39b3cChris Lattner InferredAllResultTypes = 32972cacec55f947c716b058a39038889550d7e39b3cChris Lattner Result->InferAllTypes(&Pattern->getNamedNodesMap()); 32986cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 32996c6ba364931acb113973ad3e6d69736969c59299Chris Lattner IterateInference = false; 3300fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 33016cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Apply the type of the result to the source pattern. This helps us 33026cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // resolve cases where the input type is known to be a pointer type (which 33036cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // is considered resolved), but the result knows it needs to be 32- or 33046cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // 64-bits. Infer the other way for good measure. 3305d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner for (unsigned i = 0, e = std::min(Result->getTree(0)->getNumTypes(), 3306d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner Pattern->getTree(0)->getNumTypes()); 3307d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner i != e; ++i) { 33086c6ba364931acb113973ad3e6d69736969c59299Chris Lattner IterateInference = Pattern->getTree(0)-> 3309d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner UpdateNodeType(i, Result->getTree(0)->getExtType(i), *Result); 33106c6ba364931acb113973ad3e6d69736969c59299Chris Lattner IterateInference |= Result->getTree(0)-> 3311d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner UpdateNodeType(i, Pattern->getTree(0)->getExtType(i), *Result); 33126c6ba364931acb113973ad3e6d69736969c59299Chris Lattner } 3313fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 33142cacec55f947c716b058a39038889550d7e39b3cChris Lattner // If our iteration has converged and the input pattern's types are fully 33152cacec55f947c716b058a39038889550d7e39b3cChris Lattner // resolved but the result pattern is not fully resolved, we may have a 33162cacec55f947c716b058a39038889550d7e39b3cChris Lattner // situation where we have two instructions in the result pattern and 33172cacec55f947c716b058a39038889550d7e39b3cChris Lattner // the instructions require a common register class, but don't care about 33182cacec55f947c716b058a39038889550d7e39b3cChris Lattner // what actual MVT is used. This is actually a bug in our modelling: 33192cacec55f947c716b058a39038889550d7e39b3cChris Lattner // output patterns should have register classes, not MVTs. 33202cacec55f947c716b058a39038889550d7e39b3cChris Lattner // 33212cacec55f947c716b058a39038889550d7e39b3cChris Lattner // In any case, to handle this, we just go through and disambiguate some 33222cacec55f947c716b058a39038889550d7e39b3cChris Lattner // arbitrary types to the result pattern's nodes. 33232cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (!IterateInference && InferredAllPatternTypes && 33242cacec55f947c716b058a39038889550d7e39b3cChris Lattner !InferredAllResultTypes) 33252cacec55f947c716b058a39038889550d7e39b3cChris Lattner IterateInference = ForceArbitraryInstResultType(Result->getTree(0), 33262cacec55f947c716b058a39038889550d7e39b3cChris Lattner *Result); 33276cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } while (IterateInference); 3328fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 33296cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Verify that we inferred enough types that we can do something with the 33306cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // pattern and result. If these fire the user has to add type casts. 33316cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!InferredAllPatternTypes) 33326cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Pattern->error("Could not infer all types in pattern!"); 33332cacec55f947c716b058a39038889550d7e39b3cChris Lattner if (!InferredAllResultTypes) { 33342cacec55f947c716b058a39038889550d7e39b3cChris Lattner Pattern->dump(); 33356cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Result->error("Could not infer all types in pattern result!"); 33362cacec55f947c716b058a39038889550d7e39b3cChris Lattner } 3337fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 33386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Validate that the input pattern is correct. 33396cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::map<std::string, TreePatternNode*> InstInputs; 33406cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::map<std::string, TreePatternNode*> InstResults; 33416cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<Record*> InstImpResults; 33426cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned j = 0, ee = Pattern->getNumTrees(); j != ee; ++j) 33436cefb77a7073057fecd721ae141140d75ce76512Chris Lattner FindPatternInputsAndOutputs(Pattern, Pattern->getTree(j), 33446cefb77a7073057fecd721ae141140d75ce76512Chris Lattner InstInputs, InstResults, 3345acfb70f75061975deda1deb167da8e83249f92edChris Lattner InstImpResults); 33466cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 33476cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Promote the xform function to be an explicit node if set. 33486cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *DstPattern = Result->getOnlyTree(); 33496cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> ResultNodeOperands; 33506cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) { 33516cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *OpNode = DstPattern->getChild(ii); 33526cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Record *Xform = OpNode->getTransformFn()) { 3353dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines OpNode->setTransformFn(nullptr); 33546cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> Children; 33556cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Children.push_back(OpNode); 3356d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner OpNode = new TreePatternNode(Xform, Children, OpNode->getNumTypes()); 33576cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 33586cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ResultNodeOperands.push_back(OpNode); 33596cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 33606cefb77a7073057fecd721ae141140d75ce76512Chris Lattner DstPattern = Result->getOnlyTree(); 33616cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!DstPattern->isLeaf()) 33626cefb77a7073057fecd721ae141140d75ce76512Chris Lattner DstPattern = new TreePatternNode(DstPattern->getOperator(), 3363d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner ResultNodeOperands, 3364d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner DstPattern->getNumTypes()); 3365fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3366d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner for (unsigned i = 0, e = Result->getOnlyTree()->getNumTypes(); i != e; ++i) 3367d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner DstPattern->setType(i, Result->getOnlyTree()->getExtType(i)); 3368fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 33696cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePattern Temp(Result->getRecord(), DstPattern, false, *this); 33706cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Temp.InferAllTypes(); 33716cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 3372fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 337325b6f91c549225ae4fc9855b9c82a46d05dfd4d8Chris Lattner AddPatternToMatch(Pattern, 3374997759ac22dc1de6f324b1c09c0a2a558236c489Jim Grosbach PatternToMatch(CurPattern, 3375997759ac22dc1de6f324b1c09c0a2a558236c489Jim Grosbach CurPattern->getValueAsListInit("Predicates"), 3376d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner Pattern->getTree(0), 3377d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner Temp.getOnlyTree(), InstImpResults, 3378d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner CurPattern->getValueAsInt("AddedComplexity"), 3379d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner CurPattern->getID())); 33806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 33816cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 33826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 33836cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// CombineChildVariants - Given a bunch of permutations of each child of the 33846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// 'operator' node, put them together in all possible ways. 3385fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbachstatic void CombineChildVariants(TreePatternNode *Orig, 33866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner const std::vector<std::vector<TreePatternNode*> > &ChildVariants, 33876cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> &OutVariants, 3388327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CodeGenDAGPatterns &CDP, 3389327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel const MultipleUseVarSet &DepVars) { 33906cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Make sure that each operand has at least one variant to choose from. 33916cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i) 33926cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (ChildVariants[i].empty()) 33936cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return; 3394fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 33956cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // The end result is an all-pairs construction of the resultant pattern. 33966cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<unsigned> Idxs; 33976cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Idxs.resize(ChildVariants.size()); 3398327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel bool NotDone; 3399327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel do { 3400327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel#ifndef NDEBUG 3401aaf5486b82f512ada7ca11cec27f96fb06db36d8Chris Lattner DEBUG(if (!Idxs.empty()) { 3402aaf5486b82f512ada7ca11cec27f96fb06db36d8Chris Lattner errs() << Orig->getOperator()->getName() << ": Idxs = [ "; 3403aaf5486b82f512ada7ca11cec27f96fb06db36d8Chris Lattner for (unsigned i = 0; i < Idxs.size(); ++i) { 3404aaf5486b82f512ada7ca11cec27f96fb06db36d8Chris Lattner errs() << Idxs[i] << " "; 3405aaf5486b82f512ada7ca11cec27f96fb06db36d8Chris Lattner } 3406aaf5486b82f512ada7ca11cec27f96fb06db36d8Chris Lattner errs() << "]\n"; 3407aaf5486b82f512ada7ca11cec27f96fb06db36d8Chris Lattner }); 3408327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel#endif 34096cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Create the variant and add it to the output list. 34106cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> NewChildren; 34116cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i) 34126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner NewChildren.push_back(ChildVariants[i][Idxs[i]]); 3413d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner TreePatternNode *R = new TreePatternNode(Orig->getOperator(), NewChildren, 3414d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner Orig->getNumTypes()); 3415fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 34166cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Copy over properties. 34176cefb77a7073057fecd721ae141140d75ce76512Chris Lattner R->setName(Orig->getName()); 34180540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman R->setPredicateFns(Orig->getPredicateFns()); 34196cefb77a7073057fecd721ae141140d75ce76512Chris Lattner R->setTransformFn(Orig->getTransformFn()); 3420d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner for (unsigned i = 0, e = Orig->getNumTypes(); i != e; ++i) 3421d7349194650386d97a1d779369cb46f20ba9f252Chris Lattner R->setType(i, Orig->getExtType(i)); 3422fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3423327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel // If this pattern cannot match, do not include it as a variant. 34246cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::string ErrString; 34256cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (!R->canPatternMatch(ErrString, CDP)) { 34266cefb77a7073057fecd721ae141140d75ce76512Chris Lattner delete R; 34276cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } else { 34286cefb77a7073057fecd721ae141140d75ce76512Chris Lattner bool AlreadyExists = false; 3429fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 34306cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Scan to see if this pattern has already been emitted. We can get 34316cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // duplication due to things like commuting: 34326cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a) 34336cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // which are the same pattern. Ignore the dups. 34346cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = OutVariants.size(); i != e; ++i) 3435327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel if (R->isIsomorphicTo(OutVariants[i], DepVars)) { 34366cefb77a7073057fecd721ae141140d75ce76512Chris Lattner AlreadyExists = true; 34376cefb77a7073057fecd721ae141140d75ce76512Chris Lattner break; 34386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 3439fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 34406cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (AlreadyExists) 34416cefb77a7073057fecd721ae141140d75ce76512Chris Lattner delete R; 34426cefb77a7073057fecd721ae141140d75ce76512Chris Lattner else 34436cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OutVariants.push_back(R); 34446cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 3445fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 3446327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel // Increment indices to the next permutation by incrementing the 3447327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel // indicies from last index backward, e.g., generate the sequence 3448327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel // [0, 0], [0, 1], [1, 0], [1, 1]. 3449327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel int IdxsIdx; 3450327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel for (IdxsIdx = Idxs.size() - 1; IdxsIdx >= 0; --IdxsIdx) { 3451327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel if (++Idxs[IdxsIdx] == ChildVariants[IdxsIdx].size()) 3452327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel Idxs[IdxsIdx] = 0; 3453327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel else 34546cefb77a7073057fecd721ae141140d75ce76512Chris Lattner break; 34556cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 3456327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel NotDone = (IdxsIdx >= 0); 3457327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel } while (NotDone); 34586cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 34596cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 34606cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// CombineChildVariants - A helper function for binary operators. 34616cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// 3462fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbachstatic void CombineChildVariants(TreePatternNode *Orig, 34636cefb77a7073057fecd721ae141140d75ce76512Chris Lattner const std::vector<TreePatternNode*> &LHS, 34646cefb77a7073057fecd721ae141140d75ce76512Chris Lattner const std::vector<TreePatternNode*> &RHS, 34656cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> &OutVariants, 3466327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CodeGenDAGPatterns &CDP, 3467327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel const MultipleUseVarSet &DepVars) { 34686cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<std::vector<TreePatternNode*> > ChildVariants; 34696cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ChildVariants.push_back(LHS); 34706cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ChildVariants.push_back(RHS); 3471327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(Orig, ChildVariants, OutVariants, CDP, DepVars); 3472fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach} 34736cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 34746cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 34756cefb77a7073057fecd721ae141140d75ce76512Chris Lattnerstatic void GatherChildrenOfAssociativeOpcode(TreePatternNode *N, 34766cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode *> &Children) { 34776cefb77a7073057fecd721ae141140d75ce76512Chris Lattner assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!"); 34786cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Record *Operator = N->getOperator(); 3479fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 34806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Only permit raw nodes. 34810540e17788f0d09d784fb9bd9b354e02f1c5e4a4Dan Gohman if (!N->getName().empty() || !N->getPredicateFns().empty() || 34826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner N->getTransformFn()) { 34836cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Children.push_back(N); 34846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return; 34856cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 34866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 34876cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator) 34886cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Children.push_back(N->getChild(0)); 34896cefb77a7073057fecd721ae141140d75ce76512Chris Lattner else 34906cefb77a7073057fecd721ae141140d75ce76512Chris Lattner GatherChildrenOfAssociativeOpcode(N->getChild(0), Children); 34916cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 34926cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator) 34936cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Children.push_back(N->getChild(1)); 34946cefb77a7073057fecd721ae141140d75ce76512Chris Lattner else 34956cefb77a7073057fecd721ae141140d75ce76512Chris Lattner GatherChildrenOfAssociativeOpcode(N->getChild(1), Children); 34966cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 34976cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 34986cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// GenerateVariantsOf - Given a pattern N, generate all permutations we can of 34996cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// the (potentially recursive) pattern by using algebraic laws. 35006cefb77a7073057fecd721ae141140d75ce76512Chris Lattner/// 35016cefb77a7073057fecd721ae141140d75ce76512Chris Lattnerstatic void GenerateVariantsOf(TreePatternNode *N, 35026cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> &OutVariants, 3503327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CodeGenDAGPatterns &CDP, 3504327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel const MultipleUseVarSet &DepVars) { 3505dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // We cannot permute leaves or ComplexPattern uses. 3506dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (N->isLeaf() || N->getOperator()->isSubClassOf("ComplexPattern")) { 35076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner OutVariants.push_back(N); 35086cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return; 35096cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 35106cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 35116cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Look up interesting info about the node. 35126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(N->getOperator()); 35136cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 3514da4231f134989af7dc6bd3408821ba573def27b2Jim Grosbach // If this node is associative, re-associate. 35156cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (NodeInfo.hasProperty(SDNPAssociative)) { 3516fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach // Re-associate by pulling together all of the linked operators 35176cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> MaximalChildren; 35186cefb77a7073057fecd721ae141140d75ce76512Chris Lattner GatherChildrenOfAssociativeOpcode(N, MaximalChildren); 35196cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 35206cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Only handle child sizes of 3. Otherwise we'll end up trying too many 35216cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // permutations. 35226cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (MaximalChildren.size() == 3) { 35236cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Find the variants of all of our maximal children. 35246cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> AVariants, BVariants, CVariants; 3525327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel GenerateVariantsOf(MaximalChildren[0], AVariants, CDP, DepVars); 3526327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel GenerateVariantsOf(MaximalChildren[1], BVariants, CDP, DepVars); 3527327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel GenerateVariantsOf(MaximalChildren[2], CVariants, CDP, DepVars); 3528fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 35296cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // There are only two ways we can permute the tree: 35306cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // (A op B) op C and A op (B op C) 35316cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Within these forms, we can also permute A/B/C. 3532fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 35336cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Generate legal pair permutations of A/B/C. 35346cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> ABVariants; 35356cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> BAVariants; 35366cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> ACVariants; 35376cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> CAVariants; 35386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> BCVariants; 35396cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> CBVariants; 3540327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, AVariants, BVariants, ABVariants, CDP, DepVars); 3541327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, BVariants, AVariants, BAVariants, CDP, DepVars); 3542327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, AVariants, CVariants, ACVariants, CDP, DepVars); 3543327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, CVariants, AVariants, CAVariants, CDP, DepVars); 3544327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, BVariants, CVariants, BCVariants, CDP, DepVars); 3545327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, CVariants, BVariants, CBVariants, CDP, DepVars); 35466cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 35476cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Combine those into the result: (x op x) op x 3548327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, ABVariants, CVariants, OutVariants, CDP, DepVars); 3549327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, BAVariants, CVariants, OutVariants, CDP, DepVars); 3550327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, ACVariants, BVariants, OutVariants, CDP, DepVars); 3551327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, CAVariants, BVariants, OutVariants, CDP, DepVars); 3552327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, BCVariants, AVariants, OutVariants, CDP, DepVars); 3553327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, CBVariants, AVariants, OutVariants, CDP, DepVars); 35546cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 35556cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Combine those into the result: x op (x op x) 3556327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, CVariants, ABVariants, OutVariants, CDP, DepVars); 3557327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, CVariants, BAVariants, OutVariants, CDP, DepVars); 3558327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, BVariants, ACVariants, OutVariants, CDP, DepVars); 3559327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, BVariants, CAVariants, OutVariants, CDP, DepVars); 3560327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, AVariants, BCVariants, OutVariants, CDP, DepVars); 3561327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, AVariants, CBVariants, OutVariants, CDP, DepVars); 35626cefb77a7073057fecd721ae141140d75ce76512Chris Lattner return; 35636cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 35646cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 3565fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 35666cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Compute permutations of all children. 35676cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<std::vector<TreePatternNode*> > ChildVariants; 35686cefb77a7073057fecd721ae141140d75ce76512Chris Lattner ChildVariants.resize(N->getNumChildren()); 35696cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) 3570327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel GenerateVariantsOf(N->getChild(i), ChildVariants[i], CDP, DepVars); 35716cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 35726cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Build all permutations based on how the children were formed. 3573327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel CombineChildVariants(N, ChildVariants, OutVariants, CDP, DepVars); 35746cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 35756cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If this node is commutative, consider the commuted order. 35766bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng bool isCommIntrinsic = N->isCommutativeIntrinsic(CDP); 35776bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng if (NodeInfo.hasProperty(SDNPCommutative) || isCommIntrinsic) { 35786bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng assert((N->getNumChildren()==2 || isCommIntrinsic) && 35796bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng "Commutative but doesn't have 2 children!"); 35806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Don't count children which are actually register references. 35816cefb77a7073057fecd721ae141140d75ce76512Chris Lattner unsigned NC = 0; 35826cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) { 35836cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *Child = N->getChild(i); 35846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Child->isLeaf()) 35856cfc806a6b82b60a3e923b6b89f2b4da62cdb50bSean Silva if (DefInit *DI = dyn_cast<DefInit>(Child->getLeafValue())) { 35866cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Record *RR = DI->getDef(); 35876cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (RR->isSubClassOf("Register")) 35886cefb77a7073057fecd721ae141140d75ce76512Chris Lattner continue; 35896cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 35906cefb77a7073057fecd721ae141140d75ce76512Chris Lattner NC++; 35916cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 35926cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Consider the commuted order. 35936bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng if (isCommIntrinsic) { 35946bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng // Commutative intrinsic. First operand is the intrinsic id, 2nd and 3rd 35956bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng // operands are the commutative operands, and there might be more operands 35966bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng // after those. 35976bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng assert(NC >= 3 && 35986bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng "Commutative intrinsic should have at least 3 childrean!"); 35996bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng std::vector<std::vector<TreePatternNode*> > Variants; 36006bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng Variants.push_back(ChildVariants[0]); // Intrinsic id. 36016bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng Variants.push_back(ChildVariants[2]); 36026bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng Variants.push_back(ChildVariants[1]); 36036bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng for (unsigned i = 3; i != NC; ++i) 36046bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng Variants.push_back(ChildVariants[i]); 36056bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng CombineChildVariants(N, Variants, OutVariants, CDP, DepVars); 36066bd9567a6a1ba62118cdd258ddc52ea8f82ff511Evan Cheng } else if (NC == 2) 36076cefb77a7073057fecd721ae141140d75ce76512Chris Lattner CombineChildVariants(N, ChildVariants[1], ChildVariants[0], 3608327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel OutVariants, CDP, DepVars); 36096cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 36106cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 36116cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 36126cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 36136cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// GenerateVariants - Generate variants. For example, commutative patterns can 36146cefb77a7073057fecd721ae141140d75ce76512Chris Lattner// match multiple ways. Add them to PatternsToMatch as well. 3615fe71893183f504feff290e343bf740bd32432129Chris Lattnervoid CodeGenDAGPatterns::GenerateVariants() { 3616569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner DEBUG(errs() << "Generating instruction variants.\n"); 3617fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 36186cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Loop over all of the patterns we've collected, checking to see if we can 36196cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // generate variants of the instruction, through the exploitation of 3620da4231f134989af7dc6bd3408821ba573def27b2Jim Grosbach // identities. This permits the target to provide aggressive matching without 36216cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // the .td file having to contain tons of variants of instructions. 36226cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // 36236cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Note that this loop adds new patterns to the PatternsToMatch list, but we 36246cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // intentionally do not reconsider these. Any variants of added patterns have 36256cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // already been added. 36266cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // 36276cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) { 3628327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel MultipleUseVarSet DepVars; 36296cefb77a7073057fecd721ae141140d75ce76512Chris Lattner std::vector<TreePatternNode*> Variants; 3630327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel FindDepVars(PatternsToMatch[i].getSrcPattern(), DepVars); 3631569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner DEBUG(errs() << "Dependent/multiply used variables: "); 3632327d0651f8c3b1480d8fc1f4d96e07a1452eaa8cScott Michel DEBUG(DumpDepVars(DepVars)); 3633569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner DEBUG(errs() << "\n"); 3634bb16824dc3e2ba660e8b79f49046c418aa8e1be7Jim Grosbach GenerateVariantsOf(PatternsToMatch[i].getSrcPattern(), Variants, *this, 3635bb16824dc3e2ba660e8b79f49046c418aa8e1be7Jim Grosbach DepVars); 36366cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 36376cefb77a7073057fecd721ae141140d75ce76512Chris Lattner assert(!Variants.empty() && "Must create at least original variant!"); 36386cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Variants.erase(Variants.begin()); // Remove the original pattern. 36396cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 36406cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (Variants.empty()) // No variants for this pattern. 36416cefb77a7073057fecd721ae141140d75ce76512Chris Lattner continue; 36426cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 3643569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner DEBUG(errs() << "FOUND VARIANTS OF: "; 3644569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner PatternsToMatch[i].getSrcPattern()->dump(); 3645569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner errs() << "\n"); 36466cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 36476cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned v = 0, e = Variants.size(); v != e; ++v) { 36486cefb77a7073057fecd721ae141140d75ce76512Chris Lattner TreePatternNode *Variant = Variants[v]; 36496cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 3650569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner DEBUG(errs() << " VAR#" << v << ": "; 3651569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner Variant->dump(); 3652569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner errs() << "\n"); 3653fbadcd0826c2e69ed21c2d535310ba958acb4359Jim Grosbach 36546cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Scan to see if an instruction or explicit pattern already matches this. 36556cefb77a7073057fecd721ae141140d75ce76512Chris Lattner bool AlreadyExists = false; 36566cefb77a7073057fecd721ae141140d75ce76512Chris Lattner for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) { 3657c0ad80fd9edbbe41461a62d26585bd6263328b90Evan Cheng // Skip if the top level predicates do not match. 3658c0ad80fd9edbbe41461a62d26585bd6263328b90Evan Cheng if (PatternsToMatch[i].getPredicates() != 3659c0ad80fd9edbbe41461a62d26585bd6263328b90Evan Cheng PatternsToMatch[p].getPredicates()) 3660c0ad80fd9edbbe41461a62d26585bd6263328b90Evan Cheng continue; 36616cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Check to see if this variant already exists. 3662bb16824dc3e2ba660e8b79f49046c418aa8e1be7Jim Grosbach if (Variant->isIsomorphicTo(PatternsToMatch[p].getSrcPattern(), 3663bb16824dc3e2ba660e8b79f49046c418aa8e1be7Jim Grosbach DepVars)) { 3664569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner DEBUG(errs() << " *** ALREADY EXISTS, ignoring variant.\n"); 36656cefb77a7073057fecd721ae141140d75ce76512Chris Lattner AlreadyExists = true; 36666cefb77a7073057fecd721ae141140d75ce76512Chris Lattner break; 36676cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 36686cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 36696cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // If we already have it, ignore the variant. 36706cefb77a7073057fecd721ae141140d75ce76512Chris Lattner if (AlreadyExists) continue; 36716cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 36726cefb77a7073057fecd721ae141140d75ce76512Chris Lattner // Otherwise, add it to the list of patterns we have. 36736cefb77a7073057fecd721ae141140d75ce76512Chris Lattner PatternsToMatch. 3674997759ac22dc1de6f324b1c09c0a2a558236c489Jim Grosbach push_back(PatternToMatch(PatternsToMatch[i].getSrcRecord(), 3675997759ac22dc1de6f324b1c09c0a2a558236c489Jim Grosbach PatternsToMatch[i].getPredicates(), 36766cefb77a7073057fecd721ae141140d75ce76512Chris Lattner Variant, PatternsToMatch[i].getDstPattern(), 36776cefb77a7073057fecd721ae141140d75ce76512Chris Lattner PatternsToMatch[i].getDstRegs(), 3678117ccb7e518f05e4bf3df058fc402262f897ff0bChris Lattner PatternsToMatch[i].getAddedComplexity(), 3679117ccb7e518f05e4bf3df058fc402262f897ff0bChris Lattner Record::getNewUID())); 36806cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 36816cefb77a7073057fecd721ae141140d75ce76512Chris Lattner 3682569f121f4ecc53f8ab505c4ccb6e1e77c78e188dChris Lattner DEBUG(errs() << "\n"); 36836cefb77a7073057fecd721ae141140d75ce76512Chris Lattner } 36846cefb77a7073057fecd721ae141140d75ce76512Chris Lattner} 3685