2006-03-03 02:32:46 +00:00
|
|
|
//===- IntrinsicEmitter.cpp - Generate intrinsic information --------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by Chris Lattner and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This tablegen backend emits information about intrinsic functions.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "IntrinsicEmitter.h"
|
|
|
|
#include "Record.h"
|
2006-03-13 22:38:57 +00:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2006-03-15 02:51:05 +00:00
|
|
|
#include <algorithm>
|
2006-03-03 02:32:46 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// IntrinsicEmitter Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
void IntrinsicEmitter::run(std::ostream &OS) {
|
|
|
|
EmitSourceFileHeader("Intrinsic Function Source Fragment", OS);
|
|
|
|
|
|
|
|
std::vector<CodeGenIntrinsic> Ints = LoadIntrinsics(Records);
|
|
|
|
|
|
|
|
// Emit the enum information.
|
|
|
|
EmitEnumInfo(Ints, OS);
|
2006-03-15 01:55:21 +00:00
|
|
|
|
|
|
|
// Emit the intrinsic ID -> name table.
|
|
|
|
EmitIntrinsicToNameTable(Ints, OS);
|
2006-03-09 20:34:19 +00:00
|
|
|
|
|
|
|
// Emit the function name recognizer.
|
|
|
|
EmitFnNameRecognizer(Ints, OS);
|
2006-03-15 01:55:21 +00:00
|
|
|
|
2006-03-09 22:05:04 +00:00
|
|
|
// Emit the intrinsic verifier.
|
|
|
|
EmitVerifier(Ints, OS);
|
2006-03-09 22:30:49 +00:00
|
|
|
|
2007-02-07 20:38:26 +00:00
|
|
|
// Emit the intrinsic declaration generator.
|
|
|
|
EmitGenerator(Ints, OS);
|
|
|
|
|
2006-03-09 22:30:49 +00:00
|
|
|
// Emit mod/ref info for each function.
|
|
|
|
EmitModRefInfo(Ints, OS);
|
2006-03-09 22:37:52 +00:00
|
|
|
|
2006-03-24 01:13:55 +00:00
|
|
|
// Emit table of non-memory accessing intrinsics.
|
|
|
|
EmitNoMemoryInfo(Ints, OS);
|
|
|
|
|
|
|
|
// Emit side effect info for each intrinsic.
|
2006-03-09 22:37:52 +00:00
|
|
|
EmitSideEffectInfo(Ints, OS);
|
2006-03-13 23:08:44 +00:00
|
|
|
|
|
|
|
// Emit a list of intrinsics with corresponding GCC builtins.
|
|
|
|
EmitGCCBuiltinList(Ints, OS);
|
2006-03-15 01:33:26 +00:00
|
|
|
|
|
|
|
// Emit code to translate GCC builtins into LLVM intrinsics.
|
|
|
|
EmitIntrinsicToGCCBuiltinMap(Ints, OS);
|
2006-03-03 02:32:46 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void IntrinsicEmitter::EmitEnumInfo(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
std::ostream &OS) {
|
2006-03-09 20:34:19 +00:00
|
|
|
OS << "// Enum values for Intrinsics.h\n";
|
2006-03-03 02:32:46 +00:00
|
|
|
OS << "#ifdef GET_INTRINSIC_ENUM_VALUES\n";
|
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i) {
|
|
|
|
OS << " " << Ints[i].EnumName;
|
|
|
|
OS << ((i != e-1) ? ", " : " ");
|
|
|
|
OS << std::string(40-Ints[i].EnumName.size(), ' ')
|
|
|
|
<< "// " << Ints[i].Name << "\n";
|
|
|
|
}
|
|
|
|
OS << "#endif\n\n";
|
|
|
|
}
|
2006-03-09 20:34:19 +00:00
|
|
|
|
|
|
|
void IntrinsicEmitter::
|
|
|
|
EmitFnNameRecognizer(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
std::ostream &OS) {
|
|
|
|
// Build a function name -> intrinsic name mapping.
|
|
|
|
std::map<std::string, std::string> IntMapping;
|
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i)
|
|
|
|
IntMapping[Ints[i].Name] = Ints[i].EnumName;
|
|
|
|
|
|
|
|
OS << "// Function name -> enum value recognizer code.\n";
|
|
|
|
OS << "#ifdef GET_FUNCTION_RECOGNIZER\n";
|
|
|
|
OS << " switch (Name[5]) {\n";
|
2007-02-15 19:17:16 +00:00
|
|
|
OS << " default:\n";
|
2006-03-09 20:34:19 +00:00
|
|
|
// Emit the intrinsics in sorted order.
|
|
|
|
char LastChar = 0;
|
|
|
|
for (std::map<std::string, std::string>::iterator I = IntMapping.begin(),
|
|
|
|
E = IntMapping.end(); I != E; ++I) {
|
|
|
|
if (I->first[5] != LastChar) {
|
|
|
|
LastChar = I->first[5];
|
2007-02-15 19:17:16 +00:00
|
|
|
OS << " break;\n";
|
2006-03-09 20:34:19 +00:00
|
|
|
OS << " case '" << LastChar << "':\n";
|
|
|
|
}
|
|
|
|
|
2007-02-15 19:17:16 +00:00
|
|
|
OS << " if (Len == " << I->first.size()
|
|
|
|
<< " && !strcmp(Name, \"" << I->first << "\")) return Intrinsic::"
|
2006-03-09 20:34:19 +00:00
|
|
|
<< I->second << ";\n";
|
|
|
|
}
|
|
|
|
OS << " }\n";
|
2006-03-09 22:05:04 +00:00
|
|
|
OS << " // The 'llvm.' namespace is reserved!\n";
|
|
|
|
OS << " assert(0 && \"Unknown LLVM intrinsic function!\");\n";
|
|
|
|
OS << "#endif\n\n";
|
|
|
|
}
|
|
|
|
|
2006-03-15 01:55:21 +00:00
|
|
|
void IntrinsicEmitter::
|
|
|
|
EmitIntrinsicToNameTable(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
std::ostream &OS) {
|
|
|
|
OS << "// Intrinsic ID to name table\n";
|
|
|
|
OS << "#ifdef GET_INTRINSIC_NAME_TABLE\n";
|
|
|
|
OS << " // Note that entry #0 is the invalid intrinsic!\n";
|
2006-03-28 22:25:56 +00:00
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i)
|
|
|
|
OS << " \"" << Ints[i].Name << "\",\n";
|
2006-03-15 01:55:21 +00:00
|
|
|
OS << "#endif\n\n";
|
|
|
|
}
|
|
|
|
|
2007-02-06 18:30:58 +00:00
|
|
|
static bool EmitTypeVerify(std::ostream &OS, Record *ArgType) {
|
|
|
|
if (ArgType->getValueAsString("TypeVal") == "...") return true;
|
2007-02-06 18:02:54 +00:00
|
|
|
|
2006-03-31 04:48:26 +00:00
|
|
|
OS << "(int)" << ArgType->getValueAsString("TypeVal") << ", ";
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
llvm-svn: 33113
2007-01-12 07:05:14 +00:00
|
|
|
// If this is an integer type, check the width is correct.
|
|
|
|
if (ArgType->isSubClassOf("LLVMIntegerType"))
|
|
|
|
OS << ArgType->getValueAsInt("Width") << ", ";
|
2006-03-13 22:38:57 +00:00
|
|
|
|
2007-02-15 03:39:18 +00:00
|
|
|
// If this is a vector type, check that the subtype and size are correct.
|
2007-02-15 02:26:10 +00:00
|
|
|
else if (ArgType->isSubClassOf("LLVMVectorType")) {
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
llvm-svn: 33113
2007-01-12 07:05:14 +00:00
|
|
|
EmitTypeVerify(OS, ArgType->getValueAsDef("ElTy"));
|
|
|
|
OS << ArgType->getValueAsInt("NumElts") << ", ";
|
2006-03-13 22:38:57 +00:00
|
|
|
}
|
2007-02-06 18:30:58 +00:00
|
|
|
|
|
|
|
return false;
|
2006-03-13 22:38:57 +00:00
|
|
|
}
|
|
|
|
|
2007-02-07 20:38:26 +00:00
|
|
|
static void EmitTypeGenerate(std::ostream &OS, Record *ArgType) {
|
|
|
|
if (ArgType->isSubClassOf("LLVMIntegerType")) {
|
|
|
|
OS << "IntegerType::get(" << ArgType->getValueAsInt("Width") << ")";
|
2007-02-15 02:26:10 +00:00
|
|
|
} else if (ArgType->isSubClassOf("LLVMVectorType")) {
|
|
|
|
OS << "VectorType::get(";
|
2007-02-07 20:38:26 +00:00
|
|
|
EmitTypeGenerate(OS, ArgType->getValueAsDef("ElTy"));
|
|
|
|
OS << ", " << ArgType->getValueAsInt("NumElts") << ")";
|
|
|
|
} else if (ArgType->isSubClassOf("LLVMPointerType")) {
|
|
|
|
OS << "PointerType::get(";
|
|
|
|
EmitTypeGenerate(OS, ArgType->getValueAsDef("ElTy"));
|
|
|
|
OS << ")";
|
|
|
|
} else if (ArgType->isSubClassOf("LLVMEmptyStructType")) {
|
|
|
|
OS << "StructType::get(std::vector<const Type *>())";
|
|
|
|
} else {
|
|
|
|
OS << "Type::getPrimitiveType(";
|
|
|
|
OS << ArgType->getValueAsString("TypeVal") << ")";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-03-31 04:24:58 +00:00
|
|
|
/// RecordListComparator - Provide a determinstic comparator for lists of
|
|
|
|
/// records.
|
|
|
|
namespace {
|
|
|
|
struct RecordListComparator {
|
|
|
|
bool operator()(const std::vector<Record*> &LHS,
|
|
|
|
const std::vector<Record*> &RHS) const {
|
|
|
|
unsigned i = 0;
|
|
|
|
do {
|
|
|
|
if (i == RHS.size()) return false; // RHS is shorter than LHS.
|
|
|
|
if (LHS[i] != RHS[i])
|
|
|
|
return LHS[i]->getName() < RHS[i]->getName();
|
|
|
|
} while (++i != LHS.size());
|
|
|
|
|
|
|
|
return i != RHS.size();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2006-03-09 22:05:04 +00:00
|
|
|
void IntrinsicEmitter::EmitVerifier(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
std::ostream &OS) {
|
|
|
|
OS << "// Verifier::visitIntrinsicFunctionCall code.\n";
|
|
|
|
OS << "#ifdef GET_INTRINSIC_VERIFIER\n";
|
|
|
|
OS << " switch (ID) {\n";
|
|
|
|
OS << " default: assert(0 && \"Invalid intrinsic!\");\n";
|
2006-03-31 04:24:58 +00:00
|
|
|
|
|
|
|
// This checking can emit a lot of very common code. To reduce the amount of
|
|
|
|
// code that we emit, batch up cases that have identical types. This avoids
|
|
|
|
// problems where GCC can run out of memory compiling Verifier.cpp.
|
|
|
|
typedef std::map<std::vector<Record*>, std::vector<unsigned>,
|
|
|
|
RecordListComparator> MapTy;
|
|
|
|
MapTy UniqueArgInfos;
|
|
|
|
|
|
|
|
// Compute the unique argument type info.
|
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i)
|
|
|
|
UniqueArgInfos[Ints[i].ArgTypeDefs].push_back(i);
|
|
|
|
|
|
|
|
// Loop through the array, emitting one comparison for each batch.
|
|
|
|
for (MapTy::iterator I = UniqueArgInfos.begin(),
|
|
|
|
E = UniqueArgInfos.end(); I != E; ++I) {
|
|
|
|
for (unsigned i = 0, e = I->second.size(); i != e; ++i) {
|
|
|
|
OS << " case Intrinsic::" << Ints[I->second[i]].EnumName << ":\t\t// "
|
|
|
|
<< Ints[I->second[i]].Name << "\n";
|
|
|
|
}
|
2006-03-31 04:48:26 +00:00
|
|
|
|
2006-03-31 04:24:58 +00:00
|
|
|
const std::vector<Record*> &ArgTypes = I->first;
|
2006-03-31 04:48:26 +00:00
|
|
|
OS << " VerifyIntrinsicPrototype(IF, ";
|
2007-02-06 18:30:58 +00:00
|
|
|
bool VarArg = false;
|
|
|
|
for (unsigned j = 0; j != ArgTypes.size(); ++j) {
|
|
|
|
VarArg = EmitTypeVerify(OS, ArgTypes[j]);
|
|
|
|
if (VarArg) {
|
|
|
|
if ((j+1) != ArgTypes.size())
|
|
|
|
throw "Var arg type not last argument";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
OS << (VarArg ? "-2);\n" : "-1);\n");
|
2006-03-09 22:05:04 +00:00
|
|
|
OS << " break;\n";
|
|
|
|
}
|
|
|
|
OS << " }\n";
|
|
|
|
OS << "#endif\n\n";
|
2006-03-09 20:34:19 +00:00
|
|
|
}
|
|
|
|
|
2007-02-07 20:38:26 +00:00
|
|
|
void IntrinsicEmitter::EmitGenerator(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
std::ostream &OS) {
|
|
|
|
OS << "// Code for generating Intrinsic function declarations.\n";
|
|
|
|
OS << "#ifdef GET_INTRINSIC_GENERATOR\n";
|
|
|
|
OS << " switch (id) {\n";
|
|
|
|
OS << " default: assert(0 && \"Invalid intrinsic!\");\n";
|
|
|
|
|
|
|
|
// Similar to GET_INTRINSIC_VERIFIER, batch up cases that have identical
|
|
|
|
// types.
|
|
|
|
typedef std::map<std::vector<Record*>, std::vector<unsigned>,
|
|
|
|
RecordListComparator> MapTy;
|
|
|
|
MapTy UniqueArgInfos;
|
|
|
|
|
|
|
|
// Compute the unique argument type info.
|
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i)
|
|
|
|
UniqueArgInfos[Ints[i].ArgTypeDefs].push_back(i);
|
|
|
|
|
|
|
|
// Loop through the array, emitting one generator for each batch.
|
|
|
|
for (MapTy::iterator I = UniqueArgInfos.begin(),
|
|
|
|
E = UniqueArgInfos.end(); I != E; ++I) {
|
|
|
|
for (unsigned i = 0, e = I->second.size(); i != e; ++i) {
|
|
|
|
OS << " case Intrinsic::" << Ints[I->second[i]].EnumName << ":\t\t// "
|
|
|
|
<< Ints[I->second[i]].Name << "\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
const std::vector<Record*> &ArgTypes = I->first;
|
|
|
|
unsigned N = ArgTypes.size();
|
|
|
|
|
|
|
|
if (ArgTypes[N-1]->getValueAsString("TypeVal") == "...") {
|
|
|
|
OS << " IsVarArg = true;\n";
|
|
|
|
--N;
|
|
|
|
}
|
|
|
|
|
|
|
|
OS << " ResultTy = ";
|
|
|
|
EmitTypeGenerate(OS, ArgTypes[0]);
|
|
|
|
OS << ";\n";
|
|
|
|
|
|
|
|
for (unsigned j = 1; j != N; ++j) {
|
|
|
|
OS << " ArgTys.push_back(";
|
|
|
|
EmitTypeGenerate(OS, ArgTypes[j]);
|
|
|
|
OS << ");\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
OS << " break;\n";
|
|
|
|
}
|
|
|
|
OS << " }\n";
|
|
|
|
OS << "#endif\n\n";
|
|
|
|
}
|
|
|
|
|
2006-03-09 22:30:49 +00:00
|
|
|
void IntrinsicEmitter::EmitModRefInfo(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
std::ostream &OS) {
|
|
|
|
OS << "// BasicAliasAnalysis code.\n";
|
|
|
|
OS << "#ifdef GET_MODREF_BEHAVIOR\n";
|
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i) {
|
|
|
|
switch (Ints[i].ModRef) {
|
|
|
|
default: break;
|
|
|
|
case CodeGenIntrinsic::NoMem:
|
2006-10-04 21:52:35 +00:00
|
|
|
OS << " NoMemoryTable->push_back(\"" << Ints[i].Name << "\");\n";
|
2006-03-09 22:30:49 +00:00
|
|
|
break;
|
|
|
|
case CodeGenIntrinsic::ReadArgMem:
|
|
|
|
case CodeGenIntrinsic::ReadMem:
|
2006-10-04 21:52:35 +00:00
|
|
|
OS << " OnlyReadsMemoryTable->push_back(\"" << Ints[i].Name << "\");\n";
|
2006-03-09 22:30:49 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
OS << "#endif\n\n";
|
|
|
|
}
|
2006-03-09 22:37:52 +00:00
|
|
|
|
2006-03-24 01:13:55 +00:00
|
|
|
void IntrinsicEmitter::
|
|
|
|
EmitNoMemoryInfo(const std::vector<CodeGenIntrinsic> &Ints, std::ostream &OS) {
|
|
|
|
OS << "// SelectionDAGIsel code.\n";
|
|
|
|
OS << "#ifdef GET_NO_MEMORY_INTRINSICS\n";
|
|
|
|
OS << " switch (IntrinsicID) {\n";
|
|
|
|
OS << " default: break;\n";
|
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i) {
|
|
|
|
switch (Ints[i].ModRef) {
|
|
|
|
default: break;
|
|
|
|
case CodeGenIntrinsic::NoMem:
|
|
|
|
OS << " case Intrinsic::" << Ints[i].EnumName << ":\n";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
OS << " return true; // These intrinsics have no side effects.\n";
|
|
|
|
OS << " }\n";
|
|
|
|
OS << "#endif\n\n";
|
|
|
|
}
|
|
|
|
|
2006-03-09 22:37:52 +00:00
|
|
|
void IntrinsicEmitter::
|
|
|
|
EmitSideEffectInfo(const std::vector<CodeGenIntrinsic> &Ints, std::ostream &OS){
|
2006-04-02 03:35:30 +00:00
|
|
|
OS << "// Return true if doesn't access or only reads memory.\n";
|
2006-03-09 22:37:52 +00:00
|
|
|
OS << "#ifdef GET_SIDE_EFFECT_INFO\n";
|
2006-04-02 03:35:30 +00:00
|
|
|
OS << " switch (IntrinsicID) {\n";
|
2006-03-09 22:37:52 +00:00
|
|
|
OS << " default: break;\n";
|
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i) {
|
|
|
|
switch (Ints[i].ModRef) {
|
2006-03-13 23:08:44 +00:00
|
|
|
default: break;
|
|
|
|
case CodeGenIntrinsic::NoMem:
|
|
|
|
case CodeGenIntrinsic::ReadArgMem:
|
|
|
|
case CodeGenIntrinsic::ReadMem:
|
|
|
|
OS << " case Intrinsic::" << Ints[i].EnumName << ":\n";
|
|
|
|
break;
|
2006-03-09 22:37:52 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
OS << " return true; // These intrinsics have no side effects.\n";
|
|
|
|
OS << " }\n";
|
|
|
|
OS << "#endif\n\n";
|
|
|
|
}
|
2006-03-13 23:08:44 +00:00
|
|
|
|
|
|
|
void IntrinsicEmitter::
|
|
|
|
EmitGCCBuiltinList(const std::vector<CodeGenIntrinsic> &Ints, std::ostream &OS){
|
|
|
|
OS << "// Get the GCC builtin that corresponds to an LLVM intrinsic.\n";
|
|
|
|
OS << "#ifdef GET_GCC_BUILTIN_NAME\n";
|
|
|
|
OS << " switch (F->getIntrinsicID()) {\n";
|
|
|
|
OS << " default: BuiltinName = \"\"; break;\n";
|
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i) {
|
|
|
|
if (!Ints[i].GCCBuiltinName.empty()) {
|
|
|
|
OS << " case Intrinsic::" << Ints[i].EnumName << ": BuiltinName = \""
|
|
|
|
<< Ints[i].GCCBuiltinName << "\"; break;\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
OS << " }\n";
|
|
|
|
OS << "#endif\n\n";
|
2006-03-14 05:59:52 +00:00
|
|
|
}
|
2006-03-15 01:33:26 +00:00
|
|
|
|
|
|
|
void IntrinsicEmitter::
|
|
|
|
EmitIntrinsicToGCCBuiltinMap(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
std::ostream &OS) {
|
|
|
|
typedef std::map<std::pair<std::string, std::string>, std::string> BIMTy;
|
|
|
|
BIMTy BuiltinMap;
|
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i) {
|
|
|
|
if (!Ints[i].GCCBuiltinName.empty()) {
|
|
|
|
std::pair<std::string, std::string> Key(Ints[i].GCCBuiltinName,
|
|
|
|
Ints[i].TargetPrefix);
|
|
|
|
if (!BuiltinMap.insert(std::make_pair(Key, Ints[i].EnumName)).second)
|
|
|
|
throw "Intrinsic '" + Ints[i].TheDef->getName() +
|
|
|
|
"': duplicate GCC builtin name!";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
OS << "// Get the LLVM intrinsic that corresponds to a GCC builtin.\n";
|
|
|
|
OS << "// This is used by the C front-end. The GCC builtin name is passed\n";
|
|
|
|
OS << "// in as BuiltinName, and a target prefix (e.g. 'ppc') is passed\n";
|
|
|
|
OS << "// in as TargetPrefix. The result is assigned to 'IntrinsicID'.\n";
|
|
|
|
OS << "#ifdef GET_LLVM_INTRINSIC_FOR_GCC_BUILTIN\n";
|
|
|
|
OS << " if (0);\n";
|
|
|
|
// Note: this could emit significantly better code if we cared.
|
|
|
|
for (BIMTy::iterator I = BuiltinMap.begin(), E = BuiltinMap.end();I != E;++I){
|
|
|
|
OS << " else if (";
|
|
|
|
if (!I->first.second.empty()) {
|
|
|
|
// Emit this as a strcmp, so it can be constant folded by the FE.
|
|
|
|
OS << "!strcmp(TargetPrefix, \"" << I->first.second << "\") &&\n"
|
|
|
|
<< " ";
|
|
|
|
}
|
|
|
|
OS << "!strcmp(BuiltinName, \"" << I->first.first << "\"))\n";
|
2006-03-15 02:05:38 +00:00
|
|
|
OS << " IntrinsicID = Intrinsic::" << I->second << ";\n";
|
2006-03-15 01:33:26 +00:00
|
|
|
}
|
|
|
|
OS << " else\n";
|
|
|
|
OS << " IntrinsicID = Intrinsic::not_intrinsic;\n";
|
|
|
|
OS << "#endif\n\n";
|
|
|
|
}
|