IntrinsicEmitter.cpp revision 263508
1//===- IntrinsicEmitter.cpp - Generate intrinsic information --------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9// 10// This tablegen backend emits information about intrinsic functions. 11// 12//===----------------------------------------------------------------------===// 13 14#include "CodeGenIntrinsics.h" 15#include "CodeGenTarget.h" 16#include "SequenceToOffsetTable.h" 17#include "llvm/ADT/StringExtras.h" 18#include "llvm/TableGen/Error.h" 19#include "llvm/TableGen/Record.h" 20#include "llvm/TableGen/StringMatcher.h" 21#include "llvm/TableGen/TableGenBackend.h" 22#include <algorithm> 23using namespace llvm; 24 25namespace { 26class IntrinsicEmitter { 27 RecordKeeper &Records; 28 bool TargetOnly; 29 std::string TargetPrefix; 30 31public: 32 IntrinsicEmitter(RecordKeeper &R, bool T) 33 : Records(R), TargetOnly(T) {} 34 35 void run(raw_ostream &OS); 36 37 void EmitPrefix(raw_ostream &OS); 38 39 void EmitEnumInfo(const std::vector<CodeGenIntrinsic> &Ints, 40 raw_ostream &OS); 41 42 void EmitFnNameRecognizer(const std::vector<CodeGenIntrinsic> &Ints, 43 raw_ostream &OS); 44 void EmitIntrinsicToNameTable(const std::vector<CodeGenIntrinsic> &Ints, 45 raw_ostream &OS); 46 void EmitIntrinsicToOverloadTable(const std::vector<CodeGenIntrinsic> &Ints, 47 raw_ostream &OS); 48 void EmitVerifier(const std::vector<CodeGenIntrinsic> &Ints, 49 raw_ostream &OS); 50 void EmitGenerator(const std::vector<CodeGenIntrinsic> &Ints, 51 raw_ostream &OS); 52 void EmitAttributes(const std::vector<CodeGenIntrinsic> &Ints, 53 raw_ostream &OS); 54 void EmitModRefBehavior(const std::vector<CodeGenIntrinsic> &Ints, 55 raw_ostream &OS); 56 void EmitIntrinsicToGCCBuiltinMap(const std::vector<CodeGenIntrinsic> &Ints, 57 raw_ostream &OS); 58 void EmitSuffix(raw_ostream &OS); 59}; 60} // End anonymous namespace 61 62//===----------------------------------------------------------------------===// 63// IntrinsicEmitter Implementation 64//===----------------------------------------------------------------------===// 65 66void IntrinsicEmitter::run(raw_ostream &OS) { 67 emitSourceFileHeader("Intrinsic Function Source Fragment", OS); 68 69 std::vector<CodeGenIntrinsic> Ints = LoadIntrinsics(Records, TargetOnly); 70 71 if (TargetOnly && !Ints.empty()) 72 TargetPrefix = Ints[0].TargetPrefix; 73 74 EmitPrefix(OS); 75 76 // Emit the enum information. 77 EmitEnumInfo(Ints, OS); 78 79 // Emit the intrinsic ID -> name table. 80 EmitIntrinsicToNameTable(Ints, OS); 81 82 // Emit the intrinsic ID -> overload table. 83 EmitIntrinsicToOverloadTable(Ints, OS); 84 85 // Emit the function name recognizer. 86 EmitFnNameRecognizer(Ints, OS); 87 88 // Emit the intrinsic declaration generator. 89 EmitGenerator(Ints, OS); 90 91 // Emit the intrinsic parameter attributes. 92 EmitAttributes(Ints, OS); 93 94 // Emit intrinsic alias analysis mod/ref behavior. 95 EmitModRefBehavior(Ints, OS); 96 97 // Emit code to translate GCC builtins into LLVM intrinsics. 98 EmitIntrinsicToGCCBuiltinMap(Ints, OS); 99 100 EmitSuffix(OS); 101} 102 103void IntrinsicEmitter::EmitPrefix(raw_ostream &OS) { 104 OS << "// VisualStudio defines setjmp as _setjmp\n" 105 "#if defined(_MSC_VER) && defined(setjmp) && \\\n" 106 " !defined(setjmp_undefined_for_msvc)\n" 107 "# pragma push_macro(\"setjmp\")\n" 108 "# undef setjmp\n" 109 "# define setjmp_undefined_for_msvc\n" 110 "#endif\n\n"; 111} 112 113void IntrinsicEmitter::EmitSuffix(raw_ostream &OS) { 114 OS << "#if defined(_MSC_VER) && defined(setjmp_undefined_for_msvc)\n" 115 "// let's return it to _setjmp state\n" 116 "# pragma pop_macro(\"setjmp\")\n" 117 "# undef setjmp_undefined_for_msvc\n" 118 "#endif\n\n"; 119} 120 121void IntrinsicEmitter::EmitEnumInfo(const std::vector<CodeGenIntrinsic> &Ints, 122 raw_ostream &OS) { 123 OS << "// Enum values for Intrinsics.h\n"; 124 OS << "#ifdef GET_INTRINSIC_ENUM_VALUES\n"; 125 for (unsigned i = 0, e = Ints.size(); i != e; ++i) { 126 OS << " " << Ints[i].EnumName; 127 OS << ((i != e-1) ? ", " : " "); 128 OS << std::string(40-Ints[i].EnumName.size(), ' ') 129 << "// " << Ints[i].Name << "\n"; 130 } 131 OS << "#endif\n\n"; 132} 133 134struct IntrinsicNameSorter { 135 IntrinsicNameSorter(const std::vector<CodeGenIntrinsic> &I) 136 : Ints(I) {} 137 138 // Sort in reverse order of intrinsic name so "abc.def" appears after 139 // "abd.def.ghi" in the overridden name matcher 140 bool operator()(unsigned i, unsigned j) { 141 return Ints[i].Name > Ints[j].Name; 142 } 143 144private: 145 const std::vector<CodeGenIntrinsic> &Ints; 146}; 147 148void IntrinsicEmitter:: 149EmitFnNameRecognizer(const std::vector<CodeGenIntrinsic> &Ints, 150 raw_ostream &OS) { 151 // Build a 'first character of function name' -> intrinsic # mapping. 152 std::map<char, std::vector<unsigned> > IntMapping; 153 for (unsigned i = 0, e = Ints.size(); i != e; ++i) 154 IntMapping[Ints[i].Name[5]].push_back(i); 155 156 OS << "// Function name -> enum value recognizer code.\n"; 157 OS << "#ifdef GET_FUNCTION_RECOGNIZER\n"; 158 OS << " StringRef NameR(Name+6, Len-6); // Skip over 'llvm.'\n"; 159 OS << " switch (Name[5]) { // Dispatch on first letter.\n"; 160 OS << " default: break;\n"; 161 IntrinsicNameSorter Sorter(Ints); 162 // Emit the intrinsic matching stuff by first letter. 163 for (std::map<char, std::vector<unsigned> >::iterator I = IntMapping.begin(), 164 E = IntMapping.end(); I != E; ++I) { 165 OS << " case '" << I->first << "':\n"; 166 std::vector<unsigned> &IntList = I->second; 167 168 // Sort intrinsics in reverse order of their names 169 std::sort(IntList.begin(), IntList.end(), Sorter); 170 171 // Emit all the overloaded intrinsics first, build a table of the 172 // non-overloaded ones. 173 std::vector<StringMatcher::StringPair> MatchTable; 174 175 for (unsigned i = 0, e = IntList.size(); i != e; ++i) { 176 unsigned IntNo = IntList[i]; 177 std::string Result = "return " + TargetPrefix + "Intrinsic::" + 178 Ints[IntNo].EnumName + ";"; 179 180 if (!Ints[IntNo].isOverloaded) { 181 MatchTable.push_back(std::make_pair(Ints[IntNo].Name.substr(6),Result)); 182 continue; 183 } 184 185 // For overloaded intrinsics, only the prefix needs to match 186 std::string TheStr = Ints[IntNo].Name.substr(6); 187 TheStr += '.'; // Require "bswap." instead of bswap. 188 OS << " if (NameR.startswith(\"" << TheStr << "\")) " 189 << Result << '\n'; 190 } 191 192 // Emit the matcher logic for the fixed length strings. 193 StringMatcher("NameR", MatchTable, OS).Emit(1); 194 OS << " break; // end of '" << I->first << "' case.\n"; 195 } 196 197 OS << " }\n"; 198 OS << "#endif\n\n"; 199} 200 201void IntrinsicEmitter:: 202EmitIntrinsicToNameTable(const std::vector<CodeGenIntrinsic> &Ints, 203 raw_ostream &OS) { 204 OS << "// Intrinsic ID to name table\n"; 205 OS << "#ifdef GET_INTRINSIC_NAME_TABLE\n"; 206 OS << " // Note that entry #0 is the invalid intrinsic!\n"; 207 for (unsigned i = 0, e = Ints.size(); i != e; ++i) 208 OS << " \"" << Ints[i].Name << "\",\n"; 209 OS << "#endif\n\n"; 210} 211 212void IntrinsicEmitter:: 213EmitIntrinsicToOverloadTable(const std::vector<CodeGenIntrinsic> &Ints, 214 raw_ostream &OS) { 215 OS << "// Intrinsic ID to overload bitset\n"; 216 OS << "#ifdef GET_INTRINSIC_OVERLOAD_TABLE\n"; 217 OS << "static const uint8_t OTable[] = {\n"; 218 OS << " 0"; 219 for (unsigned i = 0, e = Ints.size(); i != e; ++i) { 220 // Add one to the index so we emit a null bit for the invalid #0 intrinsic. 221 if ((i+1)%8 == 0) 222 OS << ",\n 0"; 223 if (Ints[i].isOverloaded) 224 OS << " | (1<<" << (i+1)%8 << ')'; 225 } 226 OS << "\n};\n\n"; 227 // OTable contains a true bit at the position if the intrinsic is overloaded. 228 OS << "return (OTable[id/8] & (1 << (id%8))) != 0;\n"; 229 OS << "#endif\n\n"; 230} 231 232 233// NOTE: This must be kept in synch with the copy in lib/VMCore/Function.cpp! 234enum IIT_Info { 235 // Common values should be encoded with 0-15. 236 IIT_Done = 0, 237 IIT_I1 = 1, 238 IIT_I8 = 2, 239 IIT_I16 = 3, 240 IIT_I32 = 4, 241 IIT_I64 = 5, 242 IIT_F16 = 6, 243 IIT_F32 = 7, 244 IIT_F64 = 8, 245 IIT_V2 = 9, 246 IIT_V4 = 10, 247 IIT_V8 = 11, 248 IIT_V16 = 12, 249 IIT_V32 = 13, 250 IIT_PTR = 14, 251 IIT_ARG = 15, 252 253 // Values from 16+ are only encodable with the inefficient encoding. 254 IIT_MMX = 16, 255 IIT_METADATA = 17, 256 IIT_EMPTYSTRUCT = 18, 257 IIT_STRUCT2 = 19, 258 IIT_STRUCT3 = 20, 259 IIT_STRUCT4 = 21, 260 IIT_STRUCT5 = 22, 261 IIT_EXTEND_VEC_ARG = 23, 262 IIT_TRUNC_VEC_ARG = 24, 263 IIT_ANYPTR = 25, 264 IIT_V1 = 26, 265 IIT_VARARG = 27 266}; 267 268 269static void EncodeFixedValueType(MVT::SimpleValueType VT, 270 std::vector<unsigned char> &Sig) { 271 if (EVT(VT).isInteger()) { 272 unsigned BitWidth = EVT(VT).getSizeInBits(); 273 switch (BitWidth) { 274 default: PrintFatalError("unhandled integer type width in intrinsic!"); 275 case 1: return Sig.push_back(IIT_I1); 276 case 8: return Sig.push_back(IIT_I8); 277 case 16: return Sig.push_back(IIT_I16); 278 case 32: return Sig.push_back(IIT_I32); 279 case 64: return Sig.push_back(IIT_I64); 280 } 281 } 282 283 switch (VT) { 284 default: PrintFatalError("unhandled MVT in intrinsic!"); 285 case MVT::f16: return Sig.push_back(IIT_F16); 286 case MVT::f32: return Sig.push_back(IIT_F32); 287 case MVT::f64: return Sig.push_back(IIT_F64); 288 case MVT::Metadata: return Sig.push_back(IIT_METADATA); 289 case MVT::x86mmx: return Sig.push_back(IIT_MMX); 290 // MVT::OtherVT is used to mean the empty struct type here. 291 case MVT::Other: return Sig.push_back(IIT_EMPTYSTRUCT); 292 // MVT::isVoid is used to represent varargs here. 293 case MVT::isVoid: return Sig.push_back(IIT_VARARG); 294 } 295} 296 297#ifdef _MSC_VER 298#pragma optimize("",off) // MSVC 2010 optimizer can't deal with this function. 299#endif 300 301static void EncodeFixedType(Record *R, std::vector<unsigned char> &ArgCodes, 302 std::vector<unsigned char> &Sig) { 303 304 if (R->isSubClassOf("LLVMMatchType")) { 305 unsigned Number = R->getValueAsInt("Number"); 306 assert(Number < ArgCodes.size() && "Invalid matching number!"); 307 if (R->isSubClassOf("LLVMExtendedElementVectorType")) 308 Sig.push_back(IIT_EXTEND_VEC_ARG); 309 else if (R->isSubClassOf("LLVMTruncatedElementVectorType")) 310 Sig.push_back(IIT_TRUNC_VEC_ARG); 311 else 312 Sig.push_back(IIT_ARG); 313 return Sig.push_back((Number << 2) | ArgCodes[Number]); 314 } 315 316 MVT::SimpleValueType VT = getValueType(R->getValueAsDef("VT")); 317 318 unsigned Tmp = 0; 319 switch (VT) { 320 default: break; 321 case MVT::iPTRAny: ++Tmp; // FALL THROUGH. 322 case MVT::vAny: ++Tmp; // FALL THROUGH. 323 case MVT::fAny: ++Tmp; // FALL THROUGH. 324 case MVT::iAny: { 325 // If this is an "any" valuetype, then the type is the type of the next 326 // type in the list specified to getIntrinsic(). 327 Sig.push_back(IIT_ARG); 328 329 // Figure out what arg # this is consuming, and remember what kind it was. 330 unsigned ArgNo = ArgCodes.size(); 331 ArgCodes.push_back(Tmp); 332 333 // Encode what sort of argument it must be in the low 2 bits of the ArgNo. 334 return Sig.push_back((ArgNo << 2) | Tmp); 335 } 336 337 case MVT::iPTR: { 338 unsigned AddrSpace = 0; 339 if (R->isSubClassOf("LLVMQualPointerType")) { 340 AddrSpace = R->getValueAsInt("AddrSpace"); 341 assert(AddrSpace < 256 && "Address space exceeds 255"); 342 } 343 if (AddrSpace) { 344 Sig.push_back(IIT_ANYPTR); 345 Sig.push_back(AddrSpace); 346 } else { 347 Sig.push_back(IIT_PTR); 348 } 349 return EncodeFixedType(R->getValueAsDef("ElTy"), ArgCodes, Sig); 350 } 351 } 352 353 if (EVT(VT).isVector()) { 354 EVT VVT = VT; 355 switch (VVT.getVectorNumElements()) { 356 default: PrintFatalError("unhandled vector type width in intrinsic!"); 357 case 1: Sig.push_back(IIT_V1); break; 358 case 2: Sig.push_back(IIT_V2); break; 359 case 4: Sig.push_back(IIT_V4); break; 360 case 8: Sig.push_back(IIT_V8); break; 361 case 16: Sig.push_back(IIT_V16); break; 362 case 32: Sig.push_back(IIT_V32); break; 363 } 364 365 return EncodeFixedValueType(VVT.getVectorElementType(). 366 getSimpleVT().SimpleTy, Sig); 367 } 368 369 EncodeFixedValueType(VT, Sig); 370} 371 372#ifdef _MSC_VER 373#pragma optimize("",on) 374#endif 375 376/// ComputeFixedEncoding - If we can encode the type signature for this 377/// intrinsic into 32 bits, return it. If not, return ~0U. 378static void ComputeFixedEncoding(const CodeGenIntrinsic &Int, 379 std::vector<unsigned char> &TypeSig) { 380 std::vector<unsigned char> ArgCodes; 381 382 if (Int.IS.RetVTs.empty()) 383 TypeSig.push_back(IIT_Done); 384 else if (Int.IS.RetVTs.size() == 1 && 385 Int.IS.RetVTs[0] == MVT::isVoid) 386 TypeSig.push_back(IIT_Done); 387 else { 388 switch (Int.IS.RetVTs.size()) { 389 case 1: break; 390 case 2: TypeSig.push_back(IIT_STRUCT2); break; 391 case 3: TypeSig.push_back(IIT_STRUCT3); break; 392 case 4: TypeSig.push_back(IIT_STRUCT4); break; 393 case 5: TypeSig.push_back(IIT_STRUCT5); break; 394 default: assert(0 && "Unhandled case in struct"); 395 } 396 397 for (unsigned i = 0, e = Int.IS.RetVTs.size(); i != e; ++i) 398 EncodeFixedType(Int.IS.RetTypeDefs[i], ArgCodes, TypeSig); 399 } 400 401 for (unsigned i = 0, e = Int.IS.ParamTypeDefs.size(); i != e; ++i) 402 EncodeFixedType(Int.IS.ParamTypeDefs[i], ArgCodes, TypeSig); 403} 404 405static void printIITEntry(raw_ostream &OS, unsigned char X) { 406 OS << (unsigned)X; 407} 408 409void IntrinsicEmitter::EmitGenerator(const std::vector<CodeGenIntrinsic> &Ints, 410 raw_ostream &OS) { 411 // If we can compute a 32-bit fixed encoding for this intrinsic, do so and 412 // capture it in this vector, otherwise store a ~0U. 413 std::vector<unsigned> FixedEncodings; 414 415 SequenceToOffsetTable<std::vector<unsigned char> > LongEncodingTable; 416 417 std::vector<unsigned char> TypeSig; 418 419 // Compute the unique argument type info. 420 for (unsigned i = 0, e = Ints.size(); i != e; ++i) { 421 // Get the signature for the intrinsic. 422 TypeSig.clear(); 423 ComputeFixedEncoding(Ints[i], TypeSig); 424 425 // Check to see if we can encode it into a 32-bit word. We can only encode 426 // 8 nibbles into a 32-bit word. 427 if (TypeSig.size() <= 8) { 428 bool Failed = false; 429 unsigned Result = 0; 430 for (unsigned i = 0, e = TypeSig.size(); i != e; ++i) { 431 // If we had an unencodable argument, bail out. 432 if (TypeSig[i] > 15) { 433 Failed = true; 434 break; 435 } 436 Result = (Result << 4) | TypeSig[e-i-1]; 437 } 438 439 // If this could be encoded into a 31-bit word, return it. 440 if (!Failed && (Result >> 31) == 0) { 441 FixedEncodings.push_back(Result); 442 continue; 443 } 444 } 445 446 // Otherwise, we're going to unique the sequence into the 447 // LongEncodingTable, and use its offset in the 32-bit table instead. 448 LongEncodingTable.add(TypeSig); 449 450 // This is a placehold that we'll replace after the table is laid out. 451 FixedEncodings.push_back(~0U); 452 } 453 454 LongEncodingTable.layout(); 455 456 OS << "// Global intrinsic function declaration type table.\n"; 457 OS << "#ifdef GET_INTRINSIC_GENERATOR_GLOBAL\n"; 458 459 OS << "static const unsigned IIT_Table[] = {\n "; 460 461 for (unsigned i = 0, e = FixedEncodings.size(); i != e; ++i) { 462 if ((i & 7) == 7) 463 OS << "\n "; 464 465 // If the entry fit in the table, just emit it. 466 if (FixedEncodings[i] != ~0U) { 467 OS << "0x" << utohexstr(FixedEncodings[i]) << ", "; 468 continue; 469 } 470 471 TypeSig.clear(); 472 ComputeFixedEncoding(Ints[i], TypeSig); 473 474 475 // Otherwise, emit the offset into the long encoding table. We emit it this 476 // way so that it is easier to read the offset in the .def file. 477 OS << "(1U<<31) | " << LongEncodingTable.get(TypeSig) << ", "; 478 } 479 480 OS << "0\n};\n\n"; 481 482 // Emit the shared table of register lists. 483 OS << "static const unsigned char IIT_LongEncodingTable[] = {\n"; 484 if (!LongEncodingTable.empty()) 485 LongEncodingTable.emit(OS, printIITEntry); 486 OS << " 255\n};\n\n"; 487 488 OS << "#endif\n\n"; // End of GET_INTRINSIC_GENERATOR_GLOBAL 489} 490 491enum ModRefKind { 492 MRK_none, 493 MRK_readonly, 494 MRK_readnone 495}; 496 497static ModRefKind getModRefKind(const CodeGenIntrinsic &intrinsic) { 498 switch (intrinsic.ModRef) { 499 case CodeGenIntrinsic::NoMem: 500 return MRK_readnone; 501 case CodeGenIntrinsic::ReadArgMem: 502 case CodeGenIntrinsic::ReadMem: 503 return MRK_readonly; 504 case CodeGenIntrinsic::ReadWriteArgMem: 505 case CodeGenIntrinsic::ReadWriteMem: 506 return MRK_none; 507 } 508 llvm_unreachable("bad mod-ref kind"); 509} 510 511namespace { 512struct AttributeComparator { 513 bool operator()(const CodeGenIntrinsic *L, const CodeGenIntrinsic *R) const { 514 // Sort throwing intrinsics after non-throwing intrinsics. 515 if (L->canThrow != R->canThrow) 516 return R->canThrow; 517 518 if (L->isNoReturn != R->isNoReturn) 519 return R->isNoReturn; 520 521 // Try to order by readonly/readnone attribute. 522 ModRefKind LK = getModRefKind(*L); 523 ModRefKind RK = getModRefKind(*R); 524 if (LK != RK) return (LK > RK); 525 526 // Order by argument attributes. 527 // This is reliable because each side is already sorted internally. 528 return (L->ArgumentAttributes < R->ArgumentAttributes); 529 } 530}; 531} // End anonymous namespace 532 533/// EmitAttributes - This emits the Intrinsic::getAttributes method. 534void IntrinsicEmitter:: 535EmitAttributes(const std::vector<CodeGenIntrinsic> &Ints, raw_ostream &OS) { 536 OS << "// Add parameter attributes that are not common to all intrinsics.\n"; 537 OS << "#ifdef GET_INTRINSIC_ATTRIBUTES\n"; 538 if (TargetOnly) 539 OS << "static AttributeSet getAttributes(LLVMContext &C, " << TargetPrefix 540 << "Intrinsic::ID id) {\n"; 541 else 542 OS << "AttributeSet Intrinsic::getAttributes(LLVMContext &C, ID id) {\n"; 543 544 // Compute the maximum number of attribute arguments and the map 545 typedef std::map<const CodeGenIntrinsic*, unsigned, 546 AttributeComparator> UniqAttrMapTy; 547 UniqAttrMapTy UniqAttributes; 548 unsigned maxArgAttrs = 0; 549 unsigned AttrNum = 0; 550 for (unsigned i = 0, e = Ints.size(); i != e; ++i) { 551 const CodeGenIntrinsic &intrinsic = Ints[i]; 552 maxArgAttrs = 553 std::max(maxArgAttrs, unsigned(intrinsic.ArgumentAttributes.size())); 554 unsigned &N = UniqAttributes[&intrinsic]; 555 if (N) continue; 556 assert(AttrNum < 256 && "Too many unique attributes for table!"); 557 N = ++AttrNum; 558 } 559 560 // Emit an array of AttributeSet. Most intrinsics will have at least one 561 // entry, for the function itself (index ~1), which is usually nounwind. 562 OS << " static const uint8_t IntrinsicsToAttributesMap[] = {\n"; 563 564 for (unsigned i = 0, e = Ints.size(); i != e; ++i) { 565 const CodeGenIntrinsic &intrinsic = Ints[i]; 566 567 OS << " " << UniqAttributes[&intrinsic] << ", // " 568 << intrinsic.Name << "\n"; 569 } 570 OS << " };\n\n"; 571 572 OS << " AttributeSet AS[" << maxArgAttrs+1 << "];\n"; 573 OS << " unsigned NumAttrs = 0;\n"; 574 OS << " if (id != 0) {\n"; 575 OS << " switch(IntrinsicsToAttributesMap[id - "; 576 if (TargetOnly) 577 OS << "Intrinsic::num_intrinsics"; 578 else 579 OS << "1"; 580 OS << "]) {\n"; 581 OS << " default: llvm_unreachable(\"Invalid attribute number\");\n"; 582 for (UniqAttrMapTy::const_iterator I = UniqAttributes.begin(), 583 E = UniqAttributes.end(); I != E; ++I) { 584 OS << " case " << I->second << ": {\n"; 585 586 const CodeGenIntrinsic &intrinsic = *(I->first); 587 588 // Keep track of the number of attributes we're writing out. 589 unsigned numAttrs = 0; 590 591 // The argument attributes are alreadys sorted by argument index. 592 unsigned ai = 0, ae = intrinsic.ArgumentAttributes.size(); 593 if (ae) { 594 while (ai != ae) { 595 unsigned argNo = intrinsic.ArgumentAttributes[ai].first; 596 597 OS << " const Attribute::AttrKind AttrParam" << argNo + 1 <<"[]= {"; 598 bool addComma = false; 599 600 do { 601 switch (intrinsic.ArgumentAttributes[ai].second) { 602 case CodeGenIntrinsic::NoCapture: 603 if (addComma) 604 OS << ","; 605 OS << "Attribute::NoCapture"; 606 addComma = true; 607 break; 608 case CodeGenIntrinsic::ReadOnly: 609 if (addComma) 610 OS << ","; 611 OS << "Attribute::ReadOnly"; 612 addComma = true; 613 break; 614 case CodeGenIntrinsic::ReadNone: 615 if (addComma) 616 OS << ","; 617 OS << "Attributes::ReadNone"; 618 addComma = true; 619 break; 620 } 621 622 ++ai; 623 } while (ai != ae && intrinsic.ArgumentAttributes[ai].first == argNo); 624 OS << "};\n"; 625 OS << " AS[" << numAttrs++ << "] = AttributeSet::get(C, " 626 << argNo+1 << ", AttrParam" << argNo +1 << ");\n"; 627 } 628 } 629 630 ModRefKind modRef = getModRefKind(intrinsic); 631 632 if (!intrinsic.canThrow || modRef || intrinsic.isNoReturn) { 633 OS << " const Attribute::AttrKind Atts[] = {"; 634 bool addComma = false; 635 if (!intrinsic.canThrow) { 636 OS << "Attribute::NoUnwind"; 637 addComma = true; 638 } 639 if (intrinsic.isNoReturn) { 640 if (addComma) 641 OS << ","; 642 OS << "Attribute::NoReturn"; 643 addComma = true; 644 } 645 646 switch (modRef) { 647 case MRK_none: break; 648 case MRK_readonly: 649 if (addComma) 650 OS << ","; 651 OS << "Attribute::ReadOnly"; 652 break; 653 case MRK_readnone: 654 if (addComma) 655 OS << ","; 656 OS << "Attribute::ReadNone"; 657 break; 658 } 659 OS << "};\n"; 660 OS << " AS[" << numAttrs++ << "] = AttributeSet::get(C, " 661 << "AttributeSet::FunctionIndex, Atts);\n"; 662 } 663 664 if (numAttrs) { 665 OS << " NumAttrs = " << numAttrs << ";\n"; 666 OS << " break;\n"; 667 OS << " }\n"; 668 } else { 669 OS << " return AttributeSet();\n"; 670 } 671 } 672 673 OS << " }\n"; 674 OS << " }\n"; 675 OS << " return AttributeSet::get(C, ArrayRef<AttributeSet>(AS, " 676 "NumAttrs));\n"; 677 OS << "}\n"; 678 OS << "#endif // GET_INTRINSIC_ATTRIBUTES\n\n"; 679} 680 681/// EmitModRefBehavior - Determine intrinsic alias analysis mod/ref behavior. 682void IntrinsicEmitter:: 683EmitModRefBehavior(const std::vector<CodeGenIntrinsic> &Ints, raw_ostream &OS){ 684 OS << "// Determine intrinsic alias analysis mod/ref behavior.\n" 685 << "#ifdef GET_INTRINSIC_MODREF_BEHAVIOR\n" 686 << "assert(iid <= Intrinsic::" << Ints.back().EnumName << " && " 687 << "\"Unknown intrinsic.\");\n\n"; 688 689 OS << "static const uint8_t IntrinsicModRefBehavior[] = {\n" 690 << " /* invalid */ UnknownModRefBehavior,\n"; 691 for (unsigned i = 0, e = Ints.size(); i != e; ++i) { 692 OS << " /* " << TargetPrefix << Ints[i].EnumName << " */ "; 693 switch (Ints[i].ModRef) { 694 case CodeGenIntrinsic::NoMem: 695 OS << "DoesNotAccessMemory,\n"; 696 break; 697 case CodeGenIntrinsic::ReadArgMem: 698 OS << "OnlyReadsArgumentPointees,\n"; 699 break; 700 case CodeGenIntrinsic::ReadMem: 701 OS << "OnlyReadsMemory,\n"; 702 break; 703 case CodeGenIntrinsic::ReadWriteArgMem: 704 OS << "OnlyAccessesArgumentPointees,\n"; 705 break; 706 case CodeGenIntrinsic::ReadWriteMem: 707 OS << "UnknownModRefBehavior,\n"; 708 break; 709 } 710 } 711 OS << "};\n\n" 712 << "return static_cast<ModRefBehavior>(IntrinsicModRefBehavior[iid]);\n" 713 << "#endif // GET_INTRINSIC_MODREF_BEHAVIOR\n\n"; 714} 715 716/// EmitTargetBuiltins - All of the builtins in the specified map are for the 717/// same target, and we already checked it. 718static void EmitTargetBuiltins(const std::map<std::string, std::string> &BIM, 719 const std::string &TargetPrefix, 720 raw_ostream &OS) { 721 722 std::vector<StringMatcher::StringPair> Results; 723 724 for (std::map<std::string, std::string>::const_iterator I = BIM.begin(), 725 E = BIM.end(); I != E; ++I) { 726 std::string ResultCode = 727 "return " + TargetPrefix + "Intrinsic::" + I->second + ";"; 728 Results.push_back(StringMatcher::StringPair(I->first, ResultCode)); 729 } 730 731 StringMatcher("BuiltinName", Results, OS).Emit(); 732} 733 734 735void IntrinsicEmitter:: 736EmitIntrinsicToGCCBuiltinMap(const std::vector<CodeGenIntrinsic> &Ints, 737 raw_ostream &OS) { 738 typedef std::map<std::string, std::map<std::string, std::string> > BIMTy; 739 BIMTy BuiltinMap; 740 for (unsigned i = 0, e = Ints.size(); i != e; ++i) { 741 if (!Ints[i].GCCBuiltinName.empty()) { 742 // Get the map for this target prefix. 743 std::map<std::string, std::string> &BIM =BuiltinMap[Ints[i].TargetPrefix]; 744 745 if (!BIM.insert(std::make_pair(Ints[i].GCCBuiltinName, 746 Ints[i].EnumName)).second) 747 PrintFatalError("Intrinsic '" + Ints[i].TheDef->getName() + 748 "': duplicate GCC builtin name!"); 749 } 750 } 751 752 OS << "// Get the LLVM intrinsic that corresponds to a GCC builtin.\n"; 753 OS << "// This is used by the C front-end. The GCC builtin name is passed\n"; 754 OS << "// in as BuiltinName, and a target prefix (e.g. 'ppc') is passed\n"; 755 OS << "// in as TargetPrefix. The result is assigned to 'IntrinsicID'.\n"; 756 OS << "#ifdef GET_LLVM_INTRINSIC_FOR_GCC_BUILTIN\n"; 757 758 if (TargetOnly) { 759 OS << "static " << TargetPrefix << "Intrinsic::ID " 760 << "getIntrinsicForGCCBuiltin(const char " 761 << "*TargetPrefixStr, const char *BuiltinNameStr) {\n"; 762 } else { 763 OS << "Intrinsic::ID Intrinsic::getIntrinsicForGCCBuiltin(const char " 764 << "*TargetPrefixStr, const char *BuiltinNameStr) {\n"; 765 } 766 767 OS << " StringRef BuiltinName(BuiltinNameStr);\n"; 768 OS << " StringRef TargetPrefix(TargetPrefixStr);\n\n"; 769 770 // Note: this could emit significantly better code if we cared. 771 for (BIMTy::iterator I = BuiltinMap.begin(), E = BuiltinMap.end();I != E;++I){ 772 OS << " "; 773 if (!I->first.empty()) 774 OS << "if (TargetPrefix == \"" << I->first << "\") "; 775 else 776 OS << "/* Target Independent Builtins */ "; 777 OS << "{\n"; 778 779 // Emit the comparisons for this target prefix. 780 EmitTargetBuiltins(I->second, TargetPrefix, OS); 781 OS << " }\n"; 782 } 783 OS << " return "; 784 if (!TargetPrefix.empty()) 785 OS << "(" << TargetPrefix << "Intrinsic::ID)"; 786 OS << "Intrinsic::not_intrinsic;\n"; 787 OS << "}\n"; 788 OS << "#endif\n\n"; 789} 790 791namespace llvm { 792 793void EmitIntrinsics(RecordKeeper &RK, raw_ostream &OS, bool TargetOnly = false) { 794 IntrinsicEmitter(RK, TargetOnly).run(OS); 795} 796 797} // End llvm namespace 798