2006-03-03 10:32:46 +08:00
|
|
|
//===- IntrinsicEmitter.cpp - Generate intrinsic information --------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-30 04:37:13 +08:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2006-03-03 10:32:46 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This tablegen backend emits information about intrinsic functions.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2012-06-11 23:37:55 +08:00
|
|
|
#include "CodeGenIntrinsics.h"
|
2007-08-04 09:51:18 +08:00
|
|
|
#include "CodeGenTarget.h"
|
2012-05-17 23:55:41 +08:00
|
|
|
#include "SequenceToOffsetTable.h"
|
2014-04-21 04:26:39 +08:00
|
|
|
#include "TableGenBackends.h"
|
2012-06-11 23:37:55 +08:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2012-10-26 04:33:17 +08:00
|
|
|
#include "llvm/TableGen/Error.h"
|
2011-10-02 00:41:13 +08:00
|
|
|
#include "llvm/TableGen/Record.h"
|
2012-05-03 01:32:48 +08:00
|
|
|
#include "llvm/TableGen/StringMatcher.h"
|
2012-06-11 23:37:55 +08:00
|
|
|
#include "llvm/TableGen/TableGenBackend.h"
|
2016-01-27 09:43:12 +08:00
|
|
|
#include "llvm/TableGen/StringToOffsetTable.h"
|
2006-03-15 10:51:05 +08:00
|
|
|
#include <algorithm>
|
2006-03-03 10:32:46 +08:00
|
|
|
using namespace llvm;
|
|
|
|
|
2012-06-11 23:37:55 +08:00
|
|
|
namespace {
|
|
|
|
class IntrinsicEmitter {
|
|
|
|
RecordKeeper &Records;
|
|
|
|
bool TargetOnly;
|
|
|
|
std::string TargetPrefix;
|
|
|
|
|
|
|
|
public:
|
|
|
|
IntrinsicEmitter(RecordKeeper &R, bool T)
|
|
|
|
: Records(R), TargetOnly(T) {}
|
|
|
|
|
|
|
|
void run(raw_ostream &OS);
|
|
|
|
|
|
|
|
void EmitPrefix(raw_ostream &OS);
|
|
|
|
|
|
|
|
void EmitEnumInfo(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
raw_ostream &OS);
|
|
|
|
|
|
|
|
void EmitIntrinsicToNameTable(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
raw_ostream &OS);
|
|
|
|
void EmitIntrinsicToOverloadTable(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
raw_ostream &OS);
|
|
|
|
void EmitGenerator(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
raw_ostream &OS);
|
|
|
|
void EmitAttributes(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
raw_ostream &OS);
|
2016-01-27 09:43:12 +08:00
|
|
|
void EmitIntrinsicToBuiltinMap(const std::vector<CodeGenIntrinsic> &Ints,
|
|
|
|
bool IsGCC, raw_ostream &OS);
|
2012-06-11 23:37:55 +08:00
|
|
|
void EmitSuffix(raw_ostream &OS);
|
|
|
|
};
|
|
|
|
} // End anonymous namespace
|
|
|
|
|
2006-03-03 10:32:46 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// IntrinsicEmitter Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-07-03 08:10:29 +08:00
|
|
|
void IntrinsicEmitter::run(raw_ostream &OS) {
|
2012-06-11 23:37:55 +08:00
|
|
|
emitSourceFileHeader("Intrinsic Function Source Fragment", OS);
|
|
|
|
|
2009-02-05 09:49:45 +08:00
|
|
|
std::vector<CodeGenIntrinsic> Ints = LoadIntrinsics(Records, TargetOnly);
|
2012-06-11 23:37:55 +08:00
|
|
|
|
2009-02-05 09:49:45 +08:00
|
|
|
if (TargetOnly && !Ints.empty())
|
|
|
|
TargetPrefix = Ints[0].TargetPrefix;
|
2006-03-03 10:32:46 +08:00
|
|
|
|
2010-05-11 14:17:44 +08:00
|
|
|
EmitPrefix(OS);
|
|
|
|
|
2006-03-03 10:32:46 +08:00
|
|
|
// Emit the enum information.
|
|
|
|
EmitEnumInfo(Ints, OS);
|
2006-03-15 09:55:21 +08:00
|
|
|
|
|
|
|
// Emit the intrinsic ID -> name table.
|
|
|
|
EmitIntrinsicToNameTable(Ints, OS);
|
2009-02-25 07:17:49 +08:00
|
|
|
|
|
|
|
// Emit the intrinsic ID -> overload table.
|
|
|
|
EmitIntrinsicToOverloadTable(Ints, OS);
|
|
|
|
|
2007-02-08 04:38:26 +08:00
|
|
|
// Emit the intrinsic declaration generator.
|
|
|
|
EmitGenerator(Ints, OS);
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2007-12-04 04:06:50 +08:00
|
|
|
// Emit the intrinsic parameter attributes.
|
|
|
|
EmitAttributes(Ints, OS);
|
2006-03-14 07:08:44 +08:00
|
|
|
|
2016-01-27 09:43:12 +08:00
|
|
|
// Individual targets don't need GCC builtin name mappings.
|
|
|
|
if (!TargetOnly) {
|
|
|
|
// Emit code to translate GCC builtins into LLVM intrinsics.
|
|
|
|
EmitIntrinsicToBuiltinMap(Ints, true, OS);
|
2010-05-11 14:17:44 +08:00
|
|
|
|
2016-01-27 09:43:12 +08:00
|
|
|
// Emit code to translate MS builtins into LLVM intrinsics.
|
|
|
|
EmitIntrinsicToBuiltinMap(Ints, false, OS);
|
|
|
|
}
|
2014-07-05 02:42:25 +08:00
|
|
|
|
2010-05-11 14:17:44 +08:00
|
|
|
EmitSuffix(OS);
|
|
|
|
}
|
|
|
|
|
|
|
|
void IntrinsicEmitter::EmitPrefix(raw_ostream &OS) {
|
|
|
|
OS << "// VisualStudio defines setjmp as _setjmp\n"
|
2010-09-25 03:48:47 +08:00
|
|
|
"#if defined(_MSC_VER) && defined(setjmp) && \\\n"
|
|
|
|
" !defined(setjmp_undefined_for_msvc)\n"
|
2010-09-14 12:27:38 +08:00
|
|
|
"# pragma push_macro(\"setjmp\")\n"
|
|
|
|
"# undef setjmp\n"
|
2010-09-25 03:48:47 +08:00
|
|
|
"# define setjmp_undefined_for_msvc\n"
|
2010-05-11 14:17:44 +08:00
|
|
|
"#endif\n\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
void IntrinsicEmitter::EmitSuffix(raw_ostream &OS) {
|
2010-09-25 03:48:47 +08:00
|
|
|
OS << "#if defined(_MSC_VER) && defined(setjmp_undefined_for_msvc)\n"
|
2010-05-11 14:17:44 +08:00
|
|
|
"// let's return it to _setjmp state\n"
|
2010-09-14 12:27:38 +08:00
|
|
|
"# pragma pop_macro(\"setjmp\")\n"
|
2010-09-25 03:48:47 +08:00
|
|
|
"# undef setjmp_undefined_for_msvc\n"
|
2010-05-11 14:17:44 +08:00
|
|
|
"#endif\n\n";
|
2006-03-03 10:32:46 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void IntrinsicEmitter::EmitEnumInfo(const std::vector<CodeGenIntrinsic> &Ints,
|
2009-07-03 08:10:29 +08:00
|
|
|
raw_ostream &OS) {
|
2006-03-10 04:34:19 +08:00
|
|
|
OS << "// Enum values for Intrinsics.h\n";
|
2006-03-03 10:32:46 +08: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) ? ", " : " ");
|
2014-07-17 19:23:29 +08:00
|
|
|
if (Ints[i].EnumName.size() < 40)
|
|
|
|
OS << std::string(40-Ints[i].EnumName.size(), ' ');
|
|
|
|
OS << " // " << Ints[i].Name << "\n";
|
2006-03-03 10:32:46 +08:00
|
|
|
}
|
|
|
|
OS << "#endif\n\n";
|
|
|
|
}
|
2006-03-10 04:34:19 +08:00
|
|
|
|
2006-03-15 09:55:21 +08:00
|
|
|
void IntrinsicEmitter::
|
2013-11-01 01:18:07 +08:00
|
|
|
EmitIntrinsicToNameTable(const std::vector<CodeGenIntrinsic> &Ints,
|
2009-07-03 08:10:29 +08:00
|
|
|
raw_ostream &OS) {
|
2006-03-15 09:55:21 +08:00
|
|
|
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-29 06:25:56 +08:00
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i)
|
|
|
|
OS << " \"" << Ints[i].Name << "\",\n";
|
2006-03-15 09:55:21 +08:00
|
|
|
OS << "#endif\n\n";
|
|
|
|
}
|
|
|
|
|
2009-02-25 07:17:49 +08:00
|
|
|
void IntrinsicEmitter::
|
2013-11-01 01:18:07 +08:00
|
|
|
EmitIntrinsicToOverloadTable(const std::vector<CodeGenIntrinsic> &Ints,
|
2009-07-03 08:10:29 +08:00
|
|
|
raw_ostream &OS) {
|
2012-03-01 10:16:57 +08:00
|
|
|
OS << "// Intrinsic ID to overload bitset\n";
|
2009-02-25 07:17:49 +08:00
|
|
|
OS << "#ifdef GET_INTRINSIC_OVERLOAD_TABLE\n";
|
2012-03-01 10:16:57 +08:00
|
|
|
OS << "static const uint8_t OTable[] = {\n";
|
|
|
|
OS << " 0";
|
2009-02-25 07:17:49 +08:00
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i) {
|
2012-03-01 10:16:57 +08:00
|
|
|
// Add one to the index so we emit a null bit for the invalid #0 intrinsic.
|
|
|
|
if ((i+1)%8 == 0)
|
|
|
|
OS << ",\n 0";
|
2009-02-25 07:17:49 +08:00
|
|
|
if (Ints[i].isOverloaded)
|
2012-03-01 10:16:57 +08:00
|
|
|
OS << " | (1<<" << (i+1)%8 << ')';
|
2009-02-25 07:17:49 +08:00
|
|
|
}
|
2012-03-01 10:16:57 +08:00
|
|
|
OS << "\n};\n\n";
|
|
|
|
// OTable contains a true bit at the position if the intrinsic is overloaded.
|
|
|
|
OS << "return (OTable[id/8] & (1 << (id%8))) != 0;\n";
|
2009-02-25 07:17:49 +08:00
|
|
|
OS << "#endif\n\n";
|
|
|
|
}
|
|
|
|
|
2012-05-16 14:34:44 +08:00
|
|
|
|
2012-05-28 02:28:35 +08:00
|
|
|
// NOTE: This must be kept in synch with the copy in lib/VMCore/Function.cpp!
|
2012-05-16 14:34:44 +08:00
|
|
|
enum IIT_Info {
|
2014-10-21 03:25:05 +08:00
|
|
|
// Common values should be encoded with 0-15.
|
2012-05-16 14:34:44 +08:00
|
|
|
IIT_Done = 0,
|
|
|
|
IIT_I1 = 1,
|
|
|
|
IIT_I8 = 2,
|
|
|
|
IIT_I16 = 3,
|
|
|
|
IIT_I32 = 4,
|
|
|
|
IIT_I64 = 5,
|
2013-01-11 09:45:05 +08:00
|
|
|
IIT_F16 = 6,
|
|
|
|
IIT_F32 = 7,
|
|
|
|
IIT_F64 = 8,
|
|
|
|
IIT_V2 = 9,
|
|
|
|
IIT_V4 = 10,
|
|
|
|
IIT_V8 = 11,
|
|
|
|
IIT_V16 = 12,
|
|
|
|
IIT_V32 = 13,
|
2014-10-21 03:25:05 +08:00
|
|
|
IIT_PTR = 14,
|
|
|
|
IIT_ARG = 15,
|
2014-09-30 19:32:22 +08:00
|
|
|
|
2014-10-21 03:25:05 +08:00
|
|
|
// Values from 16+ are only encodable with the inefficient encoding.
|
|
|
|
IIT_V64 = 16,
|
2014-09-30 19:32:22 +08:00
|
|
|
IIT_MMX = 17,
|
2015-09-02 21:36:25 +08:00
|
|
|
IIT_TOKEN = 18,
|
|
|
|
IIT_METADATA = 19,
|
|
|
|
IIT_EMPTYSTRUCT = 20,
|
|
|
|
IIT_STRUCT2 = 21,
|
|
|
|
IIT_STRUCT3 = 22,
|
|
|
|
IIT_STRUCT4 = 23,
|
|
|
|
IIT_STRUCT5 = 24,
|
|
|
|
IIT_EXTEND_ARG = 25,
|
|
|
|
IIT_TRUNC_ARG = 26,
|
|
|
|
IIT_ANYPTR = 27,
|
|
|
|
IIT_V1 = 28,
|
|
|
|
IIT_VARARG = 29,
|
|
|
|
IIT_HALF_VEC_ARG = 30,
|
|
|
|
IIT_SAME_VEC_WIDTH_ARG = 31,
|
|
|
|
IIT_PTR_TO_ARG = 32,
|
|
|
|
IIT_VEC_OF_PTRS_TO_ELT = 33,
|
2015-11-25 00:28:14 +08:00
|
|
|
IIT_I128 = 34,
|
|
|
|
IIT_V512 = 35,
|
|
|
|
IIT_V1024 = 36
|
2012-05-16 14:34:44 +08:00
|
|
|
};
|
|
|
|
|
2012-05-17 12:30:58 +08:00
|
|
|
|
2012-05-16 14:34:44 +08:00
|
|
|
static void EncodeFixedValueType(MVT::SimpleValueType VT,
|
2012-05-17 23:55:41 +08:00
|
|
|
std::vector<unsigned char> &Sig) {
|
2014-01-25 04:50:47 +08:00
|
|
|
if (MVT(VT).isInteger()) {
|
|
|
|
unsigned BitWidth = MVT(VT).getSizeInBits();
|
2012-05-16 14:34:44 +08:00
|
|
|
switch (BitWidth) {
|
2012-10-26 04:33:17 +08:00
|
|
|
default: PrintFatalError("unhandled integer type width in intrinsic!");
|
2012-05-16 14:34:44 +08:00
|
|
|
case 1: return Sig.push_back(IIT_I1);
|
|
|
|
case 8: return Sig.push_back(IIT_I8);
|
|
|
|
case 16: return Sig.push_back(IIT_I16);
|
|
|
|
case 32: return Sig.push_back(IIT_I32);
|
|
|
|
case 64: return Sig.push_back(IIT_I64);
|
2015-05-25 23:49:26 +08:00
|
|
|
case 128: return Sig.push_back(IIT_I128);
|
2012-05-16 14:34:44 +08:00
|
|
|
}
|
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-17 12:30:58 +08:00
|
|
|
switch (VT) {
|
2012-10-26 04:33:17 +08:00
|
|
|
default: PrintFatalError("unhandled MVT in intrinsic!");
|
2013-01-11 09:45:05 +08:00
|
|
|
case MVT::f16: return Sig.push_back(IIT_F16);
|
2012-05-17 12:30:58 +08:00
|
|
|
case MVT::f32: return Sig.push_back(IIT_F32);
|
|
|
|
case MVT::f64: return Sig.push_back(IIT_F64);
|
2015-09-02 21:36:25 +08:00
|
|
|
case MVT::token: return Sig.push_back(IIT_TOKEN);
|
2012-05-17 12:30:58 +08:00
|
|
|
case MVT::Metadata: return Sig.push_back(IIT_METADATA);
|
|
|
|
case MVT::x86mmx: return Sig.push_back(IIT_MMX);
|
|
|
|
// MVT::OtherVT is used to mean the empty struct type here.
|
|
|
|
case MVT::Other: return Sig.push_back(IIT_EMPTYSTRUCT);
|
2013-11-01 01:18:11 +08:00
|
|
|
// MVT::isVoid is used to represent varargs here.
|
|
|
|
case MVT::isVoid: return Sig.push_back(IIT_VARARG);
|
2012-05-17 12:30:58 +08:00
|
|
|
}
|
2012-05-16 14:34:44 +08:00
|
|
|
}
|
|
|
|
|
2015-02-27 05:34:11 +08:00
|
|
|
#if defined(_MSC_VER) && !defined(__clang__)
|
|
|
|
#pragma optimize("",off) // MSVC 2010 optimizer can't deal with this function.
|
|
|
|
#endif
|
|
|
|
|
2012-05-28 00:39:08 +08:00
|
|
|
static void EncodeFixedType(Record *R, std::vector<unsigned char> &ArgCodes,
|
2012-05-17 23:55:41 +08:00
|
|
|
std::vector<unsigned char> &Sig) {
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-16 14:34:44 +08:00
|
|
|
if (R->isSubClassOf("LLVMMatchType")) {
|
2012-05-17 12:30:58 +08:00
|
|
|
unsigned Number = R->getValueAsInt("Number");
|
2012-05-28 00:39:08 +08:00
|
|
|
assert(Number < ArgCodes.size() && "Invalid matching number!");
|
2014-03-28 20:31:39 +08:00
|
|
|
if (R->isSubClassOf("LLVMExtendedType"))
|
|
|
|
Sig.push_back(IIT_EXTEND_ARG);
|
|
|
|
else if (R->isSubClassOf("LLVMTruncatedType"))
|
|
|
|
Sig.push_back(IIT_TRUNC_ARG);
|
2014-03-29 15:04:54 +08:00
|
|
|
else if (R->isSubClassOf("LLVMHalfElementsVectorType"))
|
|
|
|
Sig.push_back(IIT_HALF_VEC_ARG);
|
2014-12-04 17:40:44 +08:00
|
|
|
else if (R->isSubClassOf("LLVMVectorSameWidth")) {
|
|
|
|
Sig.push_back(IIT_SAME_VEC_WIDTH_ARG);
|
2015-01-23 04:14:38 +08:00
|
|
|
Sig.push_back((Number << 3) | ArgCodes[Number]);
|
2014-12-04 17:40:44 +08:00
|
|
|
MVT::SimpleValueType VT = getValueType(R->getValueAsDef("ElTy"));
|
|
|
|
EncodeFixedValueType(VT, Sig);
|
|
|
|
return;
|
|
|
|
}
|
Masked Gather and Scatter Intrinsics.
Gather and Scatter are new introduced intrinsics, comming after recently implemented masked load and store.
This is the first patch for Gather and Scatter intrinsics. It includes only the syntax, parsing and verification.
Gather and Scatter intrinsics allow to perform multiple memory accesses (read/write) in one vector instruction.
The intrinsics are not target specific and will have the following syntax:
Gather:
declare <16 x i32> @llvm.masked.gather.v16i32(<16 x i32*> <vector of ptrs>, i32 <alignment>, <16 x i1> <mask>, <16 x i32> <passthru>)
declare <8 x float> @llvm.masked.gather.v8f32(<8 x float*><vector of ptrs>, i32 <alignment>, <8 x i1> <mask>, <8 x float><passthru>)
Scatter:
declare void @llvm.masked.scatter.v8i32(<8 x i32><vector value to be stored> , <8 x i32*><vector of ptrs> , i32 <alignment>, <8 x i1> <mask>)
declare void @llvm.masked.scatter.v16i32(<16 x i32> <vector value to be stored> , <16 x i32*> <vector of ptrs>, i32 <alignment>, <16 x i1><mask> )
Vector of ptrs - a set of source/destination addresses, to load/store the value.
Mask - switches on/off vector lanes to prevent memory access for switched-off lanes
vector of ptrs, value and mask should have the same vector width.
These are code examples where gather / scatter should be used and will allow function vectorization
;void foo1(int * restrict A, int * restrict B, int * restrict C) {
; for (int i=0; i<SIZE; i++) {
; A[i] = B[C[i]];
; }
;}
;void foo3(int * restrict A, int * restrict B) {
; for (int i=0; i<SIZE; i++) {
; A[B[i]] = i+5;
; }
;}
Tests will come in the following patches, with CodeGen and Vectorizer.
http://reviews.llvm.org/D7433
llvm-svn: 228521
2015-02-08 16:27:19 +08:00
|
|
|
else if (R->isSubClassOf("LLVMPointerTo"))
|
2014-12-25 15:49:20 +08:00
|
|
|
Sig.push_back(IIT_PTR_TO_ARG);
|
Masked Gather and Scatter Intrinsics.
Gather and Scatter are new introduced intrinsics, comming after recently implemented masked load and store.
This is the first patch for Gather and Scatter intrinsics. It includes only the syntax, parsing and verification.
Gather and Scatter intrinsics allow to perform multiple memory accesses (read/write) in one vector instruction.
The intrinsics are not target specific and will have the following syntax:
Gather:
declare <16 x i32> @llvm.masked.gather.v16i32(<16 x i32*> <vector of ptrs>, i32 <alignment>, <16 x i1> <mask>, <16 x i32> <passthru>)
declare <8 x float> @llvm.masked.gather.v8f32(<8 x float*><vector of ptrs>, i32 <alignment>, <8 x i1> <mask>, <8 x float><passthru>)
Scatter:
declare void @llvm.masked.scatter.v8i32(<8 x i32><vector value to be stored> , <8 x i32*><vector of ptrs> , i32 <alignment>, <8 x i1> <mask>)
declare void @llvm.masked.scatter.v16i32(<16 x i32> <vector value to be stored> , <16 x i32*> <vector of ptrs>, i32 <alignment>, <16 x i1><mask> )
Vector of ptrs - a set of source/destination addresses, to load/store the value.
Mask - switches on/off vector lanes to prevent memory access for switched-off lanes
vector of ptrs, value and mask should have the same vector width.
These are code examples where gather / scatter should be used and will allow function vectorization
;void foo1(int * restrict A, int * restrict B, int * restrict C) {
; for (int i=0; i<SIZE; i++) {
; A[i] = B[C[i]];
; }
;}
;void foo3(int * restrict A, int * restrict B) {
; for (int i=0; i<SIZE; i++) {
; A[B[i]] = i+5;
; }
;}
Tests will come in the following patches, with CodeGen and Vectorizer.
http://reviews.llvm.org/D7433
llvm-svn: 228521
2015-02-08 16:27:19 +08:00
|
|
|
else if (R->isSubClassOf("LLVMVectorOfPointersToElt"))
|
|
|
|
Sig.push_back(IIT_VEC_OF_PTRS_TO_ELT);
|
2012-05-17 13:03:24 +08:00
|
|
|
else
|
|
|
|
Sig.push_back(IIT_ARG);
|
2015-01-23 04:14:38 +08:00
|
|
|
return Sig.push_back((Number << 3) | ArgCodes[Number]);
|
2012-05-16 14:34:44 +08:00
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-16 14:34:44 +08:00
|
|
|
MVT::SimpleValueType VT = getValueType(R->getValueAsDef("VT"));
|
2012-05-17 12:30:58 +08:00
|
|
|
|
2012-05-28 00:39:08 +08:00
|
|
|
unsigned Tmp = 0;
|
2012-05-27 07:03:52 +08:00
|
|
|
switch (VT) {
|
|
|
|
default: break;
|
2012-05-28 00:39:08 +08:00
|
|
|
case MVT::iPTRAny: ++Tmp; // FALL THROUGH.
|
|
|
|
case MVT::vAny: ++Tmp; // FALL THROUGH.
|
|
|
|
case MVT::fAny: ++Tmp; // FALL THROUGH.
|
2015-01-23 04:14:38 +08:00
|
|
|
case MVT::iAny: ++Tmp; // FALL THROUGH.
|
|
|
|
case MVT::Any: {
|
2012-05-27 07:03:52 +08:00
|
|
|
// If this is an "any" valuetype, then the type is the type of the next
|
2013-11-01 01:18:07 +08:00
|
|
|
// type in the list specified to getIntrinsic().
|
2012-05-17 12:30:58 +08:00
|
|
|
Sig.push_back(IIT_ARG);
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-28 00:39:08 +08:00
|
|
|
// Figure out what arg # this is consuming, and remember what kind it was.
|
|
|
|
unsigned ArgNo = ArgCodes.size();
|
|
|
|
ArgCodes.push_back(Tmp);
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2015-01-23 04:14:38 +08:00
|
|
|
// Encode what sort of argument it must be in the low 3 bits of the ArgNo.
|
|
|
|
return Sig.push_back((ArgNo << 3) | Tmp);
|
2012-05-28 00:39:08 +08:00
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-27 07:03:52 +08:00
|
|
|
case MVT::iPTR: {
|
|
|
|
unsigned AddrSpace = 0;
|
|
|
|
if (R->isSubClassOf("LLVMQualPointerType")) {
|
|
|
|
AddrSpace = R->getValueAsInt("AddrSpace");
|
|
|
|
assert(AddrSpace < 256 && "Address space exceeds 255");
|
|
|
|
}
|
|
|
|
if (AddrSpace) {
|
|
|
|
Sig.push_back(IIT_ANYPTR);
|
|
|
|
Sig.push_back(AddrSpace);
|
|
|
|
} else {
|
|
|
|
Sig.push_back(IIT_PTR);
|
|
|
|
}
|
2012-05-28 00:39:08 +08:00
|
|
|
return EncodeFixedType(R->getValueAsDef("ElTy"), ArgCodes, Sig);
|
2012-05-27 07:03:52 +08:00
|
|
|
}
|
2012-05-16 14:34:44 +08:00
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2014-01-25 04:50:47 +08:00
|
|
|
if (MVT(VT).isVector()) {
|
|
|
|
MVT VVT = VT;
|
2012-05-16 14:34:44 +08:00
|
|
|
switch (VVT.getVectorNumElements()) {
|
2012-10-26 04:33:17 +08:00
|
|
|
default: PrintFatalError("unhandled vector type width in intrinsic!");
|
2013-09-24 10:47:27 +08:00
|
|
|
case 1: Sig.push_back(IIT_V1); break;
|
2012-05-16 14:34:44 +08:00
|
|
|
case 2: Sig.push_back(IIT_V2); break;
|
|
|
|
case 4: Sig.push_back(IIT_V4); break;
|
|
|
|
case 8: Sig.push_back(IIT_V8); break;
|
|
|
|
case 16: Sig.push_back(IIT_V16); break;
|
2012-05-17 12:30:58 +08:00
|
|
|
case 32: Sig.push_back(IIT_V32); break;
|
2014-09-30 19:32:22 +08:00
|
|
|
case 64: Sig.push_back(IIT_V64); break;
|
2015-11-25 00:28:14 +08:00
|
|
|
case 512: Sig.push_back(IIT_V512); break;
|
|
|
|
case 1024: Sig.push_back(IIT_V1024); break;
|
2012-05-16 14:34:44 +08:00
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2014-01-25 04:50:47 +08:00
|
|
|
return EncodeFixedValueType(VVT.getVectorElementType().SimpleTy, Sig);
|
2012-05-16 14:34:44 +08:00
|
|
|
}
|
2012-05-27 07:03:52 +08:00
|
|
|
|
2012-05-16 14:34:44 +08:00
|
|
|
EncodeFixedValueType(VT, Sig);
|
|
|
|
}
|
2012-05-17 12:00:03 +08:00
|
|
|
|
2015-02-27 05:34:11 +08:00
|
|
|
#if defined(_MSC_VER) && !defined(__clang__)
|
|
|
|
#pragma optimize("",on)
|
|
|
|
#endif
|
|
|
|
|
2012-05-16 14:34:44 +08:00
|
|
|
/// ComputeFixedEncoding - If we can encode the type signature for this
|
|
|
|
/// intrinsic into 32 bits, return it. If not, return ~0U.
|
2012-05-17 23:55:41 +08:00
|
|
|
static void ComputeFixedEncoding(const CodeGenIntrinsic &Int,
|
|
|
|
std::vector<unsigned char> &TypeSig) {
|
2012-05-28 00:39:08 +08:00
|
|
|
std::vector<unsigned char> ArgCodes;
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-16 14:34:44 +08:00
|
|
|
if (Int.IS.RetVTs.empty())
|
|
|
|
TypeSig.push_back(IIT_Done);
|
|
|
|
else if (Int.IS.RetVTs.size() == 1 &&
|
|
|
|
Int.IS.RetVTs[0] == MVT::isVoid)
|
|
|
|
TypeSig.push_back(IIT_Done);
|
2012-05-17 13:03:24 +08:00
|
|
|
else {
|
|
|
|
switch (Int.IS.RetVTs.size()) {
|
2012-05-17 23:55:41 +08:00
|
|
|
case 1: break;
|
|
|
|
case 2: TypeSig.push_back(IIT_STRUCT2); break;
|
|
|
|
case 3: TypeSig.push_back(IIT_STRUCT3); break;
|
|
|
|
case 4: TypeSig.push_back(IIT_STRUCT4); break;
|
|
|
|
case 5: TypeSig.push_back(IIT_STRUCT5); break;
|
2014-06-18 13:05:13 +08:00
|
|
|
default: llvm_unreachable("Unhandled case in struct");
|
2012-05-17 13:03:24 +08:00
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-17 13:03:24 +08:00
|
|
|
for (unsigned i = 0, e = Int.IS.RetVTs.size(); i != e; ++i)
|
2012-05-28 00:39:08 +08:00
|
|
|
EncodeFixedType(Int.IS.RetTypeDefs[i], ArgCodes, TypeSig);
|
2012-05-17 13:03:24 +08:00
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-16 14:34:44 +08:00
|
|
|
for (unsigned i = 0, e = Int.IS.ParamTypeDefs.size(); i != e; ++i)
|
2012-05-28 00:39:08 +08:00
|
|
|
EncodeFixedType(Int.IS.ParamTypeDefs[i], ArgCodes, TypeSig);
|
2012-05-17 23:55:41 +08:00
|
|
|
}
|
|
|
|
|
2012-06-11 23:37:55 +08:00
|
|
|
static void printIITEntry(raw_ostream &OS, unsigned char X) {
|
2012-05-17 23:55:41 +08:00
|
|
|
OS << (unsigned)X;
|
2012-05-16 14:34:44 +08:00
|
|
|
}
|
|
|
|
|
2013-11-01 01:18:07 +08:00
|
|
|
void IntrinsicEmitter::EmitGenerator(const std::vector<CodeGenIntrinsic> &Ints,
|
2009-07-03 08:10:29 +08:00
|
|
|
raw_ostream &OS) {
|
2012-05-16 14:34:44 +08:00
|
|
|
// If we can compute a 32-bit fixed encoding for this intrinsic, do so and
|
|
|
|
// capture it in this vector, otherwise store a ~0U.
|
|
|
|
std::vector<unsigned> FixedEncodings;
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
SequenceToOffsetTable<std::vector<unsigned char> > LongEncodingTable;
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
std::vector<unsigned char> TypeSig;
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2007-02-08 04:38:26 +08:00
|
|
|
// Compute the unique argument type info.
|
2012-05-16 14:34:44 +08:00
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i) {
|
2012-05-17 23:55:41 +08:00
|
|
|
// Get the signature for the intrinsic.
|
|
|
|
TypeSig.clear();
|
|
|
|
ComputeFixedEncoding(Ints[i], TypeSig);
|
|
|
|
|
|
|
|
// Check to see if we can encode it into a 32-bit word. We can only encode
|
|
|
|
// 8 nibbles into a 32-bit word.
|
|
|
|
if (TypeSig.size() <= 8) {
|
|
|
|
bool Failed = false;
|
|
|
|
unsigned Result = 0;
|
|
|
|
for (unsigned i = 0, e = TypeSig.size(); i != e; ++i) {
|
|
|
|
// If we had an unencodable argument, bail out.
|
|
|
|
if (TypeSig[i] > 15) {
|
|
|
|
Failed = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
Result = (Result << 4) | TypeSig[e-i-1];
|
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
// If this could be encoded into a 31-bit word, return it.
|
|
|
|
if (!Failed && (Result >> 31) == 0) {
|
|
|
|
FixedEncodings.push_back(Result);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise, we're going to unique the sequence into the
|
|
|
|
// LongEncodingTable, and use its offset in the 32-bit table instead.
|
|
|
|
LongEncodingTable.add(TypeSig);
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
// This is a placehold that we'll replace after the table is laid out.
|
|
|
|
FixedEncodings.push_back(~0U);
|
2012-05-16 14:34:44 +08:00
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
LongEncodingTable.layout();
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-28 02:28:35 +08:00
|
|
|
OS << "// Global intrinsic function declaration type table.\n";
|
|
|
|
OS << "#ifdef GET_INTRINSIC_GENERATOR_GLOBAL\n";
|
|
|
|
|
2012-05-16 14:34:44 +08:00
|
|
|
OS << "static const unsigned IIT_Table[] = {\n ";
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-16 14:34:44 +08:00
|
|
|
for (unsigned i = 0, e = FixedEncodings.size(); i != e; ++i) {
|
|
|
|
if ((i & 7) == 7)
|
|
|
|
OS << "\n ";
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
// If the entry fit in the table, just emit it.
|
|
|
|
if (FixedEncodings[i] != ~0U) {
|
2012-05-16 14:34:44 +08:00
|
|
|
OS << "0x" << utohexstr(FixedEncodings[i]) << ", ";
|
2012-05-17 23:55:41 +08:00
|
|
|
continue;
|
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
TypeSig.clear();
|
|
|
|
ComputeFixedEncoding(Ints[i], TypeSig);
|
2008-11-13 17:08:33 +08:00
|
|
|
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
// Otherwise, emit the offset into the long encoding table. We emit it this
|
|
|
|
// way so that it is easier to read the offset in the .def file.
|
|
|
|
OS << "(1U<<31) | " << LongEncodingTable.get(TypeSig) << ", ";
|
2007-02-08 04:38:26 +08:00
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
OS << "0\n};\n\n";
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
// Emit the shared table of register lists.
|
|
|
|
OS << "static const unsigned char IIT_LongEncodingTable[] = {\n";
|
|
|
|
if (!LongEncodingTable.empty())
|
|
|
|
LongEncodingTable.emit(OS, printIITEntry);
|
|
|
|
OS << " 255\n};\n\n";
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-05-23 20:34:56 +08:00
|
|
|
OS << "#endif\n\n"; // End of GET_INTRINSIC_GENERATOR_GLOBAL
|
2007-02-08 04:38:26 +08:00
|
|
|
}
|
|
|
|
|
2012-06-11 23:37:55 +08:00
|
|
|
namespace {
|
|
|
|
struct AttributeComparator {
|
|
|
|
bool operator()(const CodeGenIntrinsic *L, const CodeGenIntrinsic *R) const {
|
|
|
|
// Sort throwing intrinsics after non-throwing intrinsics.
|
|
|
|
if (L->canThrow != R->canThrow)
|
|
|
|
return R->canThrow;
|
|
|
|
|
2014-03-19 07:51:07 +08:00
|
|
|
if (L->isNoDuplicate != R->isNoDuplicate)
|
|
|
|
return R->isNoDuplicate;
|
|
|
|
|
2012-06-11 23:37:55 +08:00
|
|
|
if (L->isNoReturn != R->isNoReturn)
|
|
|
|
return R->isNoReturn;
|
|
|
|
|
2015-05-27 07:48:40 +08:00
|
|
|
if (L->isConvergent != R->isConvergent)
|
|
|
|
return R->isConvergent;
|
|
|
|
|
2012-06-11 23:37:55 +08:00
|
|
|
// Try to order by readonly/readnone attribute.
|
2016-04-20 05:58:33 +08:00
|
|
|
CodeGenIntrinsic::ModRefBehavior LK = L->ModRef;
|
|
|
|
CodeGenIntrinsic::ModRefBehavior RK = R->ModRef;
|
2012-06-11 23:37:55 +08:00
|
|
|
if (LK != RK) return (LK > RK);
|
|
|
|
|
|
|
|
// Order by argument attributes.
|
|
|
|
// This is reliable because each side is already sorted internally.
|
|
|
|
return (L->ArgumentAttributes < R->ArgumentAttributes);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
} // End anonymous namespace
|
|
|
|
|
2009-01-12 09:18:58 +08:00
|
|
|
/// EmitAttributes - This emits the Intrinsic::getAttributes method.
|
2006-03-24 09:13:55 +08:00
|
|
|
void IntrinsicEmitter::
|
2009-07-03 08:10:29 +08:00
|
|
|
EmitAttributes(const std::vector<CodeGenIntrinsic> &Ints, raw_ostream &OS) {
|
2007-12-04 04:06:50 +08:00
|
|
|
OS << "// Add parameter attributes that are not common to all intrinsics.\n";
|
|
|
|
OS << "#ifdef GET_INTRINSIC_ATTRIBUTES\n";
|
2009-02-05 09:49:45 +08:00
|
|
|
if (TargetOnly)
|
2012-12-08 07:16:57 +08:00
|
|
|
OS << "static AttributeSet getAttributes(LLVMContext &C, " << TargetPrefix
|
2011-05-28 14:31:34 +08:00
|
|
|
<< "Intrinsic::ID id) {\n";
|
2009-02-05 09:49:45 +08:00
|
|
|
else
|
2012-12-08 07:16:57 +08:00
|
|
|
OS << "AttributeSet Intrinsic::getAttributes(LLVMContext &C, ID id) {\n";
|
2011-05-28 14:31:34 +08:00
|
|
|
|
2012-02-28 14:32:00 +08:00
|
|
|
// Compute the maximum number of attribute arguments and the map
|
|
|
|
typedef std::map<const CodeGenIntrinsic*, unsigned,
|
|
|
|
AttributeComparator> UniqAttrMapTy;
|
|
|
|
UniqAttrMapTy UniqAttributes;
|
2011-05-28 14:31:34 +08:00
|
|
|
unsigned maxArgAttrs = 0;
|
2012-02-28 14:32:00 +08:00
|
|
|
unsigned AttrNum = 0;
|
2006-03-10 06:37:52 +08:00
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i) {
|
2011-05-28 14:31:34 +08:00
|
|
|
const CodeGenIntrinsic &intrinsic = Ints[i];
|
|
|
|
maxArgAttrs =
|
|
|
|
std::max(maxArgAttrs, unsigned(intrinsic.ArgumentAttributes.size()));
|
2012-02-28 14:32:00 +08:00
|
|
|
unsigned &N = UniqAttributes[&intrinsic];
|
|
|
|
if (N) continue;
|
|
|
|
assert(AttrNum < 256 && "Too many unique attributes for table!");
|
|
|
|
N = ++AttrNum;
|
2006-03-10 06:37:52 +08:00
|
|
|
}
|
2011-05-28 14:31:34 +08:00
|
|
|
|
2013-01-27 11:25:05 +08:00
|
|
|
// Emit an array of AttributeSet. Most intrinsics will have at least one
|
|
|
|
// entry, for the function itself (index ~1), which is usually nounwind.
|
2012-02-28 14:32:00 +08:00
|
|
|
OS << " static const uint8_t IntrinsicsToAttributesMap[] = {\n";
|
2011-05-28 14:31:34 +08:00
|
|
|
|
2012-02-28 14:32:00 +08:00
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i) {
|
|
|
|
const CodeGenIntrinsic &intrinsic = Ints[i];
|
2011-05-28 14:31:34 +08:00
|
|
|
|
2012-02-28 14:32:00 +08:00
|
|
|
OS << " " << UniqAttributes[&intrinsic] << ", // "
|
|
|
|
<< intrinsic.Name << "\n";
|
|
|
|
}
|
|
|
|
OS << " };\n\n";
|
2009-01-12 09:27:55 +08:00
|
|
|
|
2013-01-27 11:25:05 +08:00
|
|
|
OS << " AttributeSet AS[" << maxArgAttrs+1 << "];\n";
|
2012-02-28 14:32:00 +08:00
|
|
|
OS << " unsigned NumAttrs = 0;\n";
|
2012-04-13 14:14:57 +08:00
|
|
|
OS << " if (id != 0) {\n";
|
|
|
|
OS << " switch(IntrinsicsToAttributesMap[id - ";
|
|
|
|
if (TargetOnly)
|
|
|
|
OS << "Intrinsic::num_intrinsics";
|
|
|
|
else
|
|
|
|
OS << "1";
|
|
|
|
OS << "]) {\n";
|
|
|
|
OS << " default: llvm_unreachable(\"Invalid attribute number\");\n";
|
2012-02-28 14:32:00 +08:00
|
|
|
for (UniqAttrMapTy::const_iterator I = UniqAttributes.begin(),
|
|
|
|
E = UniqAttributes.end(); I != E; ++I) {
|
2013-11-16 08:20:01 +08:00
|
|
|
OS << " case " << I->second << ": {\n";
|
2009-01-12 09:27:55 +08:00
|
|
|
|
2012-02-28 14:32:00 +08:00
|
|
|
const CodeGenIntrinsic &intrinsic = *(I->first);
|
2011-05-28 14:31:34 +08:00
|
|
|
|
|
|
|
// Keep track of the number of attributes we're writing out.
|
|
|
|
unsigned numAttrs = 0;
|
2009-01-12 09:27:55 +08:00
|
|
|
|
2011-05-28 14:31:34 +08:00
|
|
|
// The argument attributes are alreadys sorted by argument index.
|
2012-10-10 14:13:42 +08:00
|
|
|
unsigned ai = 0, ae = intrinsic.ArgumentAttributes.size();
|
|
|
|
if (ae) {
|
|
|
|
while (ai != ae) {
|
|
|
|
unsigned argNo = intrinsic.ArgumentAttributes[ai].first;
|
2012-02-28 14:32:00 +08:00
|
|
|
|
2013-11-16 08:20:01 +08:00
|
|
|
OS << " const Attribute::AttrKind AttrParam" << argNo + 1 <<"[]= {";
|
|
|
|
bool addComma = false;
|
2011-05-28 14:31:34 +08:00
|
|
|
|
2012-10-10 14:13:42 +08:00
|
|
|
do {
|
|
|
|
switch (intrinsic.ArgumentAttributes[ai].second) {
|
|
|
|
case CodeGenIntrinsic::NoCapture:
|
2013-11-16 08:20:01 +08:00
|
|
|
if (addComma)
|
|
|
|
OS << ",";
|
|
|
|
OS << "Attribute::NoCapture";
|
|
|
|
addComma = true;
|
2012-10-10 14:13:42 +08:00
|
|
|
break;
|
2013-07-06 08:29:58 +08:00
|
|
|
case CodeGenIntrinsic::ReadOnly:
|
2013-11-16 08:20:01 +08:00
|
|
|
if (addComma)
|
|
|
|
OS << ",";
|
|
|
|
OS << "Attribute::ReadOnly";
|
|
|
|
addComma = true;
|
2013-07-06 08:29:58 +08:00
|
|
|
break;
|
|
|
|
case CodeGenIntrinsic::ReadNone:
|
2013-11-16 08:20:01 +08:00
|
|
|
if (addComma)
|
|
|
|
OS << ",";
|
2015-07-31 05:16:34 +08:00
|
|
|
OS << "Attribute::ReadNone";
|
2013-11-16 08:20:01 +08:00
|
|
|
addComma = true;
|
2013-07-06 08:29:58 +08:00
|
|
|
break;
|
2012-10-10 14:13:42 +08:00
|
|
|
}
|
2009-01-12 10:41:37 +08:00
|
|
|
|
2012-10-10 14:13:42 +08:00
|
|
|
++ai;
|
|
|
|
} while (ai != ae && intrinsic.ArgumentAttributes[ai].first == argNo);
|
2013-11-16 08:20:01 +08:00
|
|
|
OS << "};\n";
|
2013-01-27 11:25:05 +08:00
|
|
|
OS << " AS[" << numAttrs++ << "] = AttributeSet::get(C, "
|
2013-11-16 08:20:01 +08:00
|
|
|
<< argNo+1 << ", AttrParam" << argNo +1 << ");\n";
|
2012-10-10 14:13:42 +08:00
|
|
|
}
|
2011-05-28 14:31:34 +08:00
|
|
|
}
|
|
|
|
|
2015-08-14 01:40:04 +08:00
|
|
|
if (!intrinsic.canThrow ||
|
|
|
|
intrinsic.ModRef != CodeGenIntrinsic::ReadWriteMem ||
|
|
|
|
intrinsic.isNoReturn || intrinsic.isNoDuplicate ||
|
|
|
|
intrinsic.isConvergent) {
|
2013-11-16 08:20:01 +08:00
|
|
|
OS << " const Attribute::AttrKind Atts[] = {";
|
|
|
|
bool addComma = false;
|
|
|
|
if (!intrinsic.canThrow) {
|
|
|
|
OS << "Attribute::NoUnwind";
|
|
|
|
addComma = true;
|
|
|
|
}
|
|
|
|
if (intrinsic.isNoReturn) {
|
|
|
|
if (addComma)
|
|
|
|
OS << ",";
|
|
|
|
OS << "Attribute::NoReturn";
|
|
|
|
addComma = true;
|
|
|
|
}
|
2014-03-19 07:51:07 +08:00
|
|
|
if (intrinsic.isNoDuplicate) {
|
|
|
|
if (addComma)
|
|
|
|
OS << ",";
|
|
|
|
OS << "Attribute::NoDuplicate";
|
|
|
|
addComma = true;
|
|
|
|
}
|
2015-05-27 07:48:40 +08:00
|
|
|
if (intrinsic.isConvergent) {
|
|
|
|
if (addComma)
|
|
|
|
OS << ",";
|
|
|
|
OS << "Attribute::Convergent";
|
|
|
|
addComma = true;
|
|
|
|
}
|
2012-05-28 07:20:41 +08:00
|
|
|
|
2015-08-14 01:40:04 +08:00
|
|
|
switch (intrinsic.ModRef) {
|
|
|
|
case CodeGenIntrinsic::NoMem:
|
|
|
|
if (addComma)
|
|
|
|
OS << ",";
|
|
|
|
OS << "Attribute::ReadNone";
|
|
|
|
break;
|
|
|
|
case CodeGenIntrinsic::ReadArgMem:
|
|
|
|
if (addComma)
|
|
|
|
OS << ",";
|
|
|
|
OS << "Attribute::ReadOnly,";
|
|
|
|
OS << "Attribute::ArgMemOnly";
|
|
|
|
break;
|
|
|
|
case CodeGenIntrinsic::ReadMem:
|
2013-11-16 08:20:01 +08:00
|
|
|
if (addComma)
|
|
|
|
OS << ",";
|
|
|
|
OS << "Attribute::ReadOnly";
|
2012-05-28 07:20:41 +08:00
|
|
|
break;
|
2016-04-20 05:58:33 +08:00
|
|
|
case CodeGenIntrinsic::WriteArgMem:
|
2015-08-14 01:40:04 +08:00
|
|
|
case CodeGenIntrinsic::ReadWriteArgMem:
|
2013-11-16 08:20:01 +08:00
|
|
|
if (addComma)
|
|
|
|
OS << ",";
|
2015-08-14 01:40:04 +08:00
|
|
|
OS << "Attribute::ArgMemOnly";
|
|
|
|
break;
|
2016-04-20 05:58:33 +08:00
|
|
|
case CodeGenIntrinsic::WriteMem:
|
2015-08-14 01:40:04 +08:00
|
|
|
case CodeGenIntrinsic::ReadWriteMem:
|
2012-05-28 07:20:41 +08:00
|
|
|
break;
|
2009-01-12 10:41:37 +08:00
|
|
|
}
|
2013-11-16 08:20:01 +08:00
|
|
|
OS << "};\n";
|
2013-01-27 11:25:05 +08:00
|
|
|
OS << " AS[" << numAttrs++ << "] = AttributeSet::get(C, "
|
2013-11-16 08:20:01 +08:00
|
|
|
<< "AttributeSet::FunctionIndex, Atts);\n";
|
2009-01-12 10:41:37 +08:00
|
|
|
}
|
2011-05-28 14:31:34 +08:00
|
|
|
|
|
|
|
if (numAttrs) {
|
2012-04-13 14:14:57 +08:00
|
|
|
OS << " NumAttrs = " << numAttrs << ";\n";
|
|
|
|
OS << " break;\n";
|
2013-11-16 08:20:01 +08:00
|
|
|
OS << " }\n";
|
2011-05-28 14:31:34 +08:00
|
|
|
} else {
|
2012-12-08 07:16:57 +08:00
|
|
|
OS << " return AttributeSet();\n";
|
2014-02-21 07:57:31 +08:00
|
|
|
OS << " }\n";
|
2011-05-28 14:31:34 +08:00
|
|
|
}
|
2009-01-12 09:27:55 +08:00
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2012-04-13 14:14:57 +08:00
|
|
|
OS << " }\n";
|
2009-01-12 09:27:55 +08:00
|
|
|
OS << " }\n";
|
2014-08-27 13:25:25 +08:00
|
|
|
OS << " return AttributeSet::get(C, makeArrayRef(AS, NumAttrs));\n";
|
2009-01-12 09:18:58 +08:00
|
|
|
OS << "}\n";
|
2009-01-12 10:41:37 +08:00
|
|
|
OS << "#endif // GET_INTRINSIC_ATTRIBUTES\n\n";
|
2006-03-10 06:37:52 +08:00
|
|
|
}
|
2006-03-14 07:08:44 +08:00
|
|
|
|
2016-01-27 09:43:12 +08:00
|
|
|
void IntrinsicEmitter::EmitIntrinsicToBuiltinMap(
|
|
|
|
const std::vector<CodeGenIntrinsic> &Ints, bool IsGCC, raw_ostream &OS) {
|
|
|
|
StringRef CompilerName = (IsGCC ? "GCC" : "MS");
|
|
|
|
typedef std::map<std::string, std::map<std::string, std::string>> BIMTy;
|
2006-03-15 09:33:26 +08:00
|
|
|
BIMTy BuiltinMap;
|
2016-01-27 09:43:12 +08:00
|
|
|
StringToOffsetTable Table;
|
2006-03-15 09:33:26 +08:00
|
|
|
for (unsigned i = 0, e = Ints.size(); i != e; ++i) {
|
2016-01-27 09:43:12 +08:00
|
|
|
const std::string &BuiltinName =
|
|
|
|
IsGCC ? Ints[i].GCCBuiltinName : Ints[i].MSBuiltinName;
|
|
|
|
if (!BuiltinName.empty()) {
|
2008-01-03 05:24:22 +08:00
|
|
|
// Get the map for this target prefix.
|
2016-01-27 09:43:12 +08:00
|
|
|
std::map<std::string, std::string> &BIM =
|
|
|
|
BuiltinMap[Ints[i].TargetPrefix];
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2016-01-27 09:43:12 +08:00
|
|
|
if (!BIM.insert(std::make_pair(BuiltinName, Ints[i].EnumName)).second)
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError("Intrinsic '" + Ints[i].TheDef->getName() +
|
2016-01-27 09:43:12 +08:00
|
|
|
"': duplicate " + CompilerName + " builtin name!");
|
|
|
|
Table.GetOrAddStringOffset(BuiltinName);
|
2006-03-15 09:33:26 +08:00
|
|
|
}
|
|
|
|
}
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2016-01-27 09:43:12 +08:00
|
|
|
OS << "// Get the LLVM intrinsic that corresponds to a builtin.\n";
|
|
|
|
OS << "// This is used by the C front-end. The builtin name is passed\n";
|
2006-03-15 09:33:26 +08:00
|
|
|
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";
|
2016-01-27 09:43:12 +08:00
|
|
|
OS << "#ifdef GET_LLVM_INTRINSIC_FOR_" << CompilerName << "_BUILTIN\n";
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2009-02-05 09:49:45 +08:00
|
|
|
if (TargetOnly) {
|
|
|
|
OS << "static " << TargetPrefix << "Intrinsic::ID "
|
2016-01-27 09:43:12 +08:00
|
|
|
<< "getIntrinsicFor" << CompilerName << "Builtin(const char "
|
2010-09-06 11:14:45 +08:00
|
|
|
<< "*TargetPrefixStr, const char *BuiltinNameStr) {\n";
|
2009-02-05 09:49:45 +08:00
|
|
|
} else {
|
2016-01-27 09:43:12 +08:00
|
|
|
OS << "Intrinsic::ID Intrinsic::getIntrinsicFor" << CompilerName
|
|
|
|
<< "Builtin(const char "
|
2010-09-06 11:14:45 +08:00
|
|
|
<< "*TargetPrefixStr, const char *BuiltinNameStr) {\n";
|
2009-02-05 09:49:45 +08:00
|
|
|
}
|
2016-01-27 09:43:12 +08:00
|
|
|
OS << " static const char BuiltinNames[] = {\n";
|
|
|
|
Table.EmitCharArray(OS);
|
|
|
|
OS << " };\n\n";
|
|
|
|
|
|
|
|
OS << " struct BuiltinEntry {\n";
|
|
|
|
OS << " Intrinsic::ID IntrinID;\n";
|
|
|
|
OS << " unsigned StrTabOffset;\n";
|
|
|
|
OS << " const char *getName() const {\n";
|
|
|
|
OS << " return &BuiltinNames[StrTabOffset];\n";
|
|
|
|
OS << " }\n";
|
|
|
|
OS << " bool operator<(const char *RHS) const {\n";
|
|
|
|
OS << " return strcmp(getName(), RHS) < 0;\n";
|
|
|
|
OS << " }\n";
|
|
|
|
OS << " };\n";
|
|
|
|
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2010-09-06 11:14:45 +08:00
|
|
|
OS << " StringRef BuiltinName(BuiltinNameStr);\n";
|
|
|
|
OS << " StringRef TargetPrefix(TargetPrefixStr);\n\n";
|
2013-11-01 01:18:07 +08:00
|
|
|
|
2006-03-15 09:33:26 +08:00
|
|
|
// Note: this could emit significantly better code if we cared.
|
|
|
|
for (BIMTy::iterator I = BuiltinMap.begin(), E = BuiltinMap.end();I != E;++I){
|
2008-01-03 05:24:22 +08:00
|
|
|
OS << " ";
|
|
|
|
if (!I->first.empty())
|
2010-09-06 11:14:45 +08:00
|
|
|
OS << "if (TargetPrefix == \"" << I->first << "\") ";
|
2008-01-03 05:24:22 +08:00
|
|
|
else
|
|
|
|
OS << "/* Target Independent Builtins */ ";
|
|
|
|
OS << "{\n";
|
|
|
|
|
|
|
|
// Emit the comparisons for this target prefix.
|
2016-01-27 09:43:12 +08:00
|
|
|
OS << " static const BuiltinEntry " << I->first << "Names[] = {\n";
|
|
|
|
for (const auto &P : I->second) {
|
|
|
|
OS << " {Intrinsic::" << P.second << ", "
|
|
|
|
<< Table.GetOrAddStringOffset(P.first) << "}, // " << P.first << "\n";
|
|
|
|
}
|
|
|
|
OS << " };\n";
|
|
|
|
OS << " auto I = std::lower_bound(std::begin(" << I->first << "Names),\n";
|
|
|
|
OS << " std::end(" << I->first << "Names),\n";
|
|
|
|
OS << " BuiltinNameStr);\n";
|
|
|
|
OS << " if (I != std::end(" << I->first << "Names) &&\n";
|
|
|
|
OS << " strcmp(I->getName(), BuiltinNameStr) == 0)\n";
|
|
|
|
OS << " return I->IntrinID;\n";
|
2008-01-03 05:24:22 +08:00
|
|
|
OS << " }\n";
|
2006-03-15 09:33:26 +08:00
|
|
|
}
|
2010-09-06 11:14:45 +08:00
|
|
|
OS << " return ";
|
|
|
|
if (!TargetPrefix.empty())
|
|
|
|
OS << "(" << TargetPrefix << "Intrinsic::ID)";
|
|
|
|
OS << "Intrinsic::not_intrinsic;\n";
|
2009-02-05 09:49:45 +08:00
|
|
|
OS << "}\n";
|
2006-03-15 09:33:26 +08:00
|
|
|
OS << "#endif\n\n";
|
|
|
|
}
|
2012-06-11 23:37:55 +08:00
|
|
|
|
2014-04-21 04:26:39 +08:00
|
|
|
void llvm::EmitIntrinsics(RecordKeeper &RK, raw_ostream &OS, bool TargetOnly) {
|
2012-06-11 23:37:55 +08:00
|
|
|
IntrinsicEmitter(RK, TargetOnly).run(OS);
|
|
|
|
}
|