2007-04-23 01:01:15 +00:00
|
|
|
//===- LLVMBitCodes.h - Enum values for the LLVM bitcode format -*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 19:59:42 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2007-04-23 01:01:15 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This header defines Bitcode enum values for LLVM IR bitcode files.
|
|
|
|
//
|
|
|
|
// The enum values defined in this file should be considered permanent. If
|
|
|
|
// new features are added, they should have values added at the end of the
|
|
|
|
// respective lists.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_BITCODE_LLVMBITCODES_H
|
|
|
|
#define LLVM_BITCODE_LLVMBITCODES_H
|
|
|
|
|
|
|
|
#include "llvm/Bitcode/BitCodes.h"
|
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
namespace bitc {
|
|
|
|
// The only top-level block type defined is for a module.
|
|
|
|
enum BlockIDs {
|
|
|
|
// Blocks
|
2007-05-04 18:25:49 +00:00
|
|
|
MODULE_BLOCK_ID = FIRST_APPLICATION_BLOCKID,
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2007-05-04 18:25:49 +00:00
|
|
|
// Module sub-block id's.
|
|
|
|
PARAMATTR_BLOCK_ID,
|
2011-11-27 05:48:27 +00:00
|
|
|
|
|
|
|
UNUSED_ID1,
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
|
2007-05-04 18:25:49 +00:00
|
|
|
CONSTANTS_BLOCK_ID,
|
|
|
|
FUNCTION_BLOCK_ID,
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
|
2011-11-27 05:48:27 +00:00
|
|
|
UNUSED_ID2,
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
|
2009-07-22 17:43:22 +00:00
|
|
|
VALUE_SYMTAB_BLOCK_ID,
|
2009-09-18 19:26:43 +00:00
|
|
|
METADATA_BLOCK_ID,
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
METADATA_ATTACHMENT_ID,
|
|
|
|
|
2011-12-07 21:44:12 +00:00
|
|
|
TYPE_BLOCK_ID_NEW,
|
|
|
|
|
|
|
|
USELIST_BLOCK_ID
|
2007-04-23 01:01:15 +00:00
|
|
|
};
|
2009-02-20 23:04:06 +00:00
|
|
|
|
|
|
|
|
2007-04-23 01:01:15 +00:00
|
|
|
/// MODULE blocks have a number of optional fields and subblocks.
|
|
|
|
enum ModuleCodes {
|
|
|
|
MODULE_CODE_VERSION = 1, // VERSION: [version#]
|
2007-05-04 19:10:48 +00:00
|
|
|
MODULE_CODE_TRIPLE = 2, // TRIPLE: [strchr x N]
|
|
|
|
MODULE_CODE_DATALAYOUT = 3, // DATALAYOUT: [strchr x N]
|
|
|
|
MODULE_CODE_ASM = 4, // ASM: [strchr x N]
|
|
|
|
MODULE_CODE_SECTIONNAME = 5, // SECTIONNAME: [strchr x N]
|
|
|
|
MODULE_CODE_DEPLIB = 6, // DEPLIB: [strchr x N]
|
2007-04-23 01:01:15 +00:00
|
|
|
|
2009-02-20 23:04:06 +00:00
|
|
|
// GLOBALVAR: [pointer type, isconst, initid,
|
2007-04-23 01:01:15 +00:00
|
|
|
// linkage, alignment, section, visibility, threadlocal]
|
|
|
|
MODULE_CODE_GLOBALVAR = 7,
|
|
|
|
|
2007-05-08 05:38:32 +00:00
|
|
|
// FUNCTION: [type, callingconv, isproto, linkage, paramattrs, alignment,
|
2011-12-07 23:57:55 +00:00
|
|
|
// section, visibility, gc, unnamed_addr]
|
2007-04-26 02:46:23 +00:00
|
|
|
MODULE_CODE_FUNCTION = 8,
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2011-12-08 00:11:31 +00:00
|
|
|
// ALIAS: [alias type, aliasee val#, linkage, visibility]
|
2007-04-26 03:26:26 +00:00
|
|
|
MODULE_CODE_ALIAS = 9,
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2007-04-26 03:26:26 +00:00
|
|
|
/// MODULE_CODE_PURGEVALS: [numvals]
|
2007-12-10 03:18:06 +00:00
|
|
|
MODULE_CODE_PURGEVALS = 10,
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2008-08-17 18:44:35 +00:00
|
|
|
MODULE_CODE_GCNAME = 11 // GCNAME: [strchr x N]
|
2007-04-23 01:01:15 +00:00
|
|
|
};
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2007-05-04 03:00:00 +00:00
|
|
|
/// PARAMATTR blocks have code for defining a parameter attribute set.
|
2008-09-25 21:00:45 +00:00
|
|
|
enum AttributeCodes {
|
2007-05-04 03:00:00 +00:00
|
|
|
PARAMATTR_CODE_ENTRY = 1 // ENTRY: [paramidx0, attr0, paramidx1, attr1...]
|
|
|
|
};
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2007-04-23 01:01:15 +00:00
|
|
|
/// TYPE blocks have codes for each type primitive they use.
|
|
|
|
enum TypeCodes {
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
TYPE_CODE_NUMENTRY = 1, // NUMENTRY: [numentries]
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2007-04-23 01:01:15 +00:00
|
|
|
// Type Codes
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
TYPE_CODE_VOID = 2, // VOID
|
|
|
|
TYPE_CODE_FLOAT = 3, // FLOAT
|
|
|
|
TYPE_CODE_DOUBLE = 4, // DOUBLE
|
|
|
|
TYPE_CODE_LABEL = 5, // LABEL
|
|
|
|
TYPE_CODE_OPAQUE = 6, // OPAQUE
|
|
|
|
TYPE_CODE_INTEGER = 7, // INTEGER: [width]
|
|
|
|
TYPE_CODE_POINTER = 8, // POINTER: [pointee type]
|
2012-05-23 15:19:39 +00:00
|
|
|
|
|
|
|
TYPE_CODE_FUNCTION_OLD = 9, // FUNCTION: [vararg, attrid, retty,
|
|
|
|
// paramty x N]
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
|
2011-12-17 00:04:22 +00:00
|
|
|
TYPE_CODE_HALF = 10, // HALF
|
2011-11-27 05:48:27 +00:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
TYPE_CODE_ARRAY = 11, // ARRAY: [numelts, eltty]
|
|
|
|
TYPE_CODE_VECTOR = 12, // VECTOR: [numelts, eltty]
|
2007-08-03 01:03:46 +00:00
|
|
|
|
|
|
|
// These are not with the other floating point types because they're
|
|
|
|
// a late addition, and putting them in the right place breaks
|
|
|
|
// binary compatibility.
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
TYPE_CODE_X86_FP80 = 13, // X86 LONG DOUBLE
|
|
|
|
TYPE_CODE_FP128 = 14, // LONG DOUBLE (112 bit mantissa)
|
|
|
|
TYPE_CODE_PPC_FP128= 15, // PPC LONG DOUBLE (2 doubles)
|
2009-05-30 05:06:04 +00:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
TYPE_CODE_METADATA = 16, // METADATA
|
2010-09-10 20:55:01 +00:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
TYPE_CODE_X86_MMX = 17, // X86 MMX
|
|
|
|
|
|
|
|
TYPE_CODE_STRUCT_ANON = 18, // STRUCT_ANON: [ispacked, eltty x N]
|
|
|
|
TYPE_CODE_STRUCT_NAME = 19, // STRUCT_NAME: [strchr x N]
|
2011-11-03 00:14:01 +00:00
|
|
|
TYPE_CODE_STRUCT_NAMED = 20,// STRUCT_NAMED: [ispacked, eltty x N]
|
|
|
|
|
|
|
|
TYPE_CODE_FUNCTION = 21 // FUNCTION: [vararg, retty, paramty x N]
|
2007-04-23 01:01:15 +00:00
|
|
|
};
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2007-04-23 01:01:15 +00:00
|
|
|
// The type symbol table only has one code (TST_ENTRY_CODE).
|
|
|
|
enum TypeSymtabCodes {
|
2007-05-04 19:10:48 +00:00
|
|
|
TST_CODE_ENTRY = 1 // TST_ENTRY: [typeid, namechar x N]
|
2007-04-23 01:01:15 +00:00
|
|
|
};
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2007-04-23 20:34:46 +00:00
|
|
|
// The value symbol table only has one code (VST_ENTRY_CODE).
|
|
|
|
enum ValueSymtabCodes {
|
2011-04-10 23:18:04 +00:00
|
|
|
VST_CODE_ENTRY = 1, // VST_ENTRY: [valid, namechar x N]
|
|
|
|
VST_CODE_BBENTRY = 2 // VST_BBENTRY: [bbid, namechar x N]
|
2007-04-23 23:29:59 +00:00
|
|
|
};
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2009-07-22 17:43:22 +00:00
|
|
|
enum MetadataCodes {
|
2009-07-29 22:34:41 +00:00
|
|
|
METADATA_STRING = 1, // MDSTRING: [values]
|
2011-06-17 17:48:53 +00:00
|
|
|
// 2 is unused.
|
|
|
|
// 3 is unused.
|
2010-01-10 07:14:18 +00:00
|
|
|
METADATA_NAME = 4, // STRING: [values]
|
2011-06-17 17:48:53 +00:00
|
|
|
// 5 is unused.
|
2010-01-10 07:14:18 +00:00
|
|
|
METADATA_KIND = 6, // [n x [id, name]]
|
2011-06-17 17:48:53 +00:00
|
|
|
// 7 is unused.
|
2011-06-17 17:50:30 +00:00
|
|
|
METADATA_NODE = 8, // NODE: [n x (type num, value num)]
|
|
|
|
METADATA_FN_NODE = 9, // FN_NODE: [n x (type num, value num)]
|
|
|
|
METADATA_NAMED_NODE = 10, // NAMED_NODE: [n x mdnodes]
|
|
|
|
METADATA_ATTACHMENT = 11 // [m x [value, [n x [id, mdnode]]]
|
2009-07-22 17:43:22 +00:00
|
|
|
};
|
2007-04-23 23:29:59 +00:00
|
|
|
// The constants block (CONSTANTS_BLOCK_ID) describes emission for each
|
|
|
|
// constant and maintains an implicit current type value.
|
2007-04-29 21:49:05 +00:00
|
|
|
enum ConstantsCodes {
|
2007-04-24 07:03:08 +00:00
|
|
|
CST_CODE_SETTYPE = 1, // SETTYPE: [typeid]
|
|
|
|
CST_CODE_NULL = 2, // NULL
|
|
|
|
CST_CODE_UNDEF = 3, // UNDEF
|
|
|
|
CST_CODE_INTEGER = 4, // INTEGER: [intval]
|
2007-05-04 19:10:48 +00:00
|
|
|
CST_CODE_WIDE_INTEGER = 5, // WIDE_INTEGER: [n x intval]
|
2007-04-24 07:03:08 +00:00
|
|
|
CST_CODE_FLOAT = 6, // FLOAT: [fpval]
|
2007-05-04 19:10:48 +00:00
|
|
|
CST_CODE_AGGREGATE = 7, // AGGREGATE: [n x value number]
|
2007-05-06 00:35:24 +00:00
|
|
|
CST_CODE_STRING = 8, // STRING: [values]
|
2007-05-06 00:53:07 +00:00
|
|
|
CST_CODE_CSTRING = 9, // CSTRING: [values]
|
|
|
|
CST_CODE_CE_BINOP = 10, // CE_BINOP: [opcode, opval, opval]
|
|
|
|
CST_CODE_CE_CAST = 11, // CE_CAST: [opcode, opty, opval]
|
|
|
|
CST_CODE_CE_GEP = 12, // CE_GEP: [n x operands]
|
|
|
|
CST_CODE_CE_SELECT = 13, // CE_SELECT: [opval, opval, opval]
|
|
|
|
CST_CODE_CE_EXTRACTELT = 14, // CE_EXTRACTELT: [opty, opval, opval]
|
|
|
|
CST_CODE_CE_INSERTELT = 15, // CE_INSERTELT: [opval, opval, opval]
|
|
|
|
CST_CODE_CE_SHUFFLEVEC = 16, // CE_SHUFFLEVEC: [opval, opval, opval]
|
2007-05-06 01:50:11 +00:00
|
|
|
CST_CODE_CE_CMP = 17, // CE_CMP: [opty, opval, opval, pred]
|
2009-02-12 21:28:33 +00:00
|
|
|
CST_CODE_INLINEASM = 18, // INLINEASM: [sideeffect,asmstr,conststr]
|
2009-07-27 21:53:46 +00:00
|
|
|
CST_CODE_CE_SHUFVEC_EX = 19, // SHUFVEC_EX: [opty, opval, opval, opval]
|
2009-10-28 05:24:40 +00:00
|
|
|
CST_CODE_CE_INBOUNDS_GEP = 20,// INBOUNDS_GEP: [n x operands]
|
2012-01-30 00:51:16 +00:00
|
|
|
CST_CODE_BLOCKADDRESS = 21, // CST_CODE_BLOCKADDRESS [fnty, fnval, bb#]
|
|
|
|
CST_CODE_DATA = 22 // DATA: [n x elements]
|
2007-04-24 07:03:08 +00:00
|
|
|
};
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2007-04-24 15:54:42 +00:00
|
|
|
/// CastOpcodes - These are values used in the bitcode files to encode which
|
|
|
|
/// cast a CST_CODE_CE_CAST or a XXX refers to. The values of these enums
|
|
|
|
/// have no fixed relation to the LLVM IR enum values. Changing these will
|
|
|
|
/// break compatibility with old files.
|
2007-04-24 07:03:08 +00:00
|
|
|
enum CastOpcodes {
|
|
|
|
CAST_TRUNC = 0,
|
|
|
|
CAST_ZEXT = 1,
|
|
|
|
CAST_SEXT = 2,
|
|
|
|
CAST_FPTOUI = 3,
|
|
|
|
CAST_FPTOSI = 4,
|
|
|
|
CAST_UITOFP = 5,
|
|
|
|
CAST_SITOFP = 6,
|
|
|
|
CAST_FPTRUNC = 7,
|
|
|
|
CAST_FPEXT = 8,
|
|
|
|
CAST_PTRTOINT = 9,
|
|
|
|
CAST_INTTOPTR = 10,
|
|
|
|
CAST_BITCAST = 11
|
|
|
|
};
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2007-04-24 15:54:42 +00:00
|
|
|
/// BinaryOpcodes - These are values used in the bitcode files to encode which
|
|
|
|
/// binop a CST_CODE_CE_BINOP or a XXX refers to. The values of these enums
|
|
|
|
/// have no fixed relation to the LLVM IR enum values. Changing these will
|
|
|
|
/// break compatibility with old files.
|
2007-04-24 07:03:08 +00:00
|
|
|
enum BinaryOpcodes {
|
|
|
|
BINOP_ADD = 0,
|
|
|
|
BINOP_SUB = 1,
|
|
|
|
BINOP_MUL = 2,
|
|
|
|
BINOP_UDIV = 3,
|
|
|
|
BINOP_SDIV = 4, // overloaded for FP
|
|
|
|
BINOP_UREM = 5,
|
|
|
|
BINOP_SREM = 6, // overloaded for FP
|
|
|
|
BINOP_SHL = 7,
|
|
|
|
BINOP_LSHR = 8,
|
|
|
|
BINOP_ASHR = 9,
|
|
|
|
BINOP_AND = 10,
|
|
|
|
BINOP_OR = 11,
|
|
|
|
BINOP_XOR = 12
|
2007-04-23 20:34:46 +00:00
|
|
|
};
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2011-07-28 21:48:00 +00:00
|
|
|
/// These are values used in the bitcode files to encode AtomicRMW operations.
|
|
|
|
/// The values of these enums have no fixed relation to the LLVM IR enum
|
|
|
|
/// values. Changing these will break compatibility with old files.
|
|
|
|
enum RMWOperations {
|
|
|
|
RMW_XCHG = 0,
|
|
|
|
RMW_ADD = 1,
|
|
|
|
RMW_SUB = 2,
|
|
|
|
RMW_AND = 3,
|
|
|
|
RMW_NAND = 4,
|
|
|
|
RMW_OR = 5,
|
|
|
|
RMW_XOR = 6,
|
|
|
|
RMW_MAX = 7,
|
|
|
|
RMW_MIN = 8,
|
|
|
|
RMW_UMAX = 9,
|
|
|
|
RMW_UMIN = 10
|
|
|
|
};
|
|
|
|
|
2009-07-20 21:19:07 +00:00
|
|
|
/// OverflowingBinaryOperatorOptionalFlags - Flags for serializing
|
|
|
|
/// OverflowingBinaryOperator's SubclassOptionalData contents.
|
|
|
|
enum OverflowingBinaryOperatorOptionalFlags {
|
2009-08-20 17:11:38 +00:00
|
|
|
OBO_NO_UNSIGNED_WRAP = 0,
|
|
|
|
OBO_NO_SIGNED_WRAP = 1
|
2009-07-20 21:19:07 +00:00
|
|
|
};
|
|
|
|
|
2011-02-06 21:44:57 +00:00
|
|
|
/// PossiblyExactOperatorOptionalFlags - Flags for serializing
|
|
|
|
/// PossiblyExactOperator's SubclassOptionalData contents.
|
|
|
|
enum PossiblyExactOperatorOptionalFlags {
|
|
|
|
PEO_EXACT = 0
|
2009-07-20 21:19:07 +00:00
|
|
|
};
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2011-07-25 23:16:38 +00:00
|
|
|
/// Encoded AtomicOrdering values.
|
|
|
|
enum AtomicOrderingCodes {
|
|
|
|
ORDERING_NOTATOMIC = 0,
|
|
|
|
ORDERING_UNORDERED = 1,
|
|
|
|
ORDERING_MONOTONIC = 2,
|
|
|
|
ORDERING_ACQUIRE = 3,
|
|
|
|
ORDERING_RELEASE = 4,
|
|
|
|
ORDERING_ACQREL = 5,
|
|
|
|
ORDERING_SEQCST = 6
|
|
|
|
};
|
|
|
|
|
|
|
|
/// Encoded SynchronizationScope values.
|
|
|
|
enum AtomicSynchScopeCodes {
|
|
|
|
SYNCHSCOPE_SINGLETHREAD = 0,
|
|
|
|
SYNCHSCOPE_CROSSTHREAD = 1
|
|
|
|
};
|
|
|
|
|
2007-04-26 05:53:04 +00:00
|
|
|
// The function body block (FUNCTION_BLOCK_ID) describes function bodies. It
|
|
|
|
// can contain a constant block (CONSTANTS_BLOCK_ID).
|
|
|
|
enum FunctionCodes {
|
|
|
|
FUNC_CODE_DECLAREBLOCKS = 1, // DECLAREBLOCKS: [n]
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2007-04-26 05:53:04 +00:00
|
|
|
FUNC_CODE_INST_BINOP = 2, // BINOP: [opcode, ty, opval, opval]
|
|
|
|
FUNC_CODE_INST_CAST = 3, // CAST: [opcode, ty, opty, opval]
|
2007-05-04 19:10:48 +00:00
|
|
|
FUNC_CODE_INST_GEP = 4, // GEP: [n x operands]
|
2007-04-26 05:53:04 +00:00
|
|
|
FUNC_CODE_INST_SELECT = 5, // SELECT: [ty, opval, opval, opval]
|
|
|
|
FUNC_CODE_INST_EXTRACTELT = 6, // EXTRACTELT: [opty, opval, opval]
|
|
|
|
FUNC_CODE_INST_INSERTELT = 7, // INSERTELT: [ty, opval, opval, opval]
|
|
|
|
FUNC_CODE_INST_SHUFFLEVEC = 8, // SHUFFLEVEC: [ty, opval, opval, opval]
|
|
|
|
FUNC_CODE_INST_CMP = 9, // CMP: [opty, opval, opval, pred]
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2007-05-04 19:10:48 +00:00
|
|
|
FUNC_CODE_INST_RET = 10, // RET: [opty,opval<both optional>]
|
2007-05-02 05:47:22 +00:00
|
|
|
FUNC_CODE_INST_BR = 11, // BR: [bb#, bb#, cond] or [bb#]
|
2009-10-27 21:27:42 +00:00
|
|
|
FUNC_CODE_INST_SWITCH = 12, // SWITCH: [opty, op0, op1, ...]
|
2007-05-08 05:38:32 +00:00
|
|
|
FUNC_CODE_INST_INVOKE = 13, // INVOKE: [attr, fnty, op0,op1, ...]
|
2012-02-06 21:55:35 +00:00
|
|
|
// 14 is unused.
|
2007-04-26 05:53:04 +00:00
|
|
|
FUNC_CODE_INST_UNREACHABLE = 15, // UNREACHABLE
|
2009-02-20 23:04:06 +00:00
|
|
|
|
2007-05-04 19:10:48 +00:00
|
|
|
FUNC_CODE_INST_PHI = 16, // PHI: [ty, val0,bb0, ...]
|
Revert r136253, r136263, r136269, r136313, r136325, r136326, r136329, r136338,
r136339, r136341, r136369, r136387, r136392, r136396, r136429, r136430, r136444,
r136445, r136446, r136253 pending review.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136556 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-30 05:42:50 +00:00
|
|
|
// 17 is unused.
|
2011-06-17 18:09:11 +00:00
|
|
|
// 18 is unused.
|
2007-05-01 02:12:05 +00:00
|
|
|
FUNC_CODE_INST_ALLOCA = 19, // ALLOCA: [instty, op, align]
|
|
|
|
FUNC_CODE_INST_LOAD = 20, // LOAD: [opty, op, align, vol]
|
2011-06-17 18:09:11 +00:00
|
|
|
// 21 is unused.
|
|
|
|
// 22 is unused.
|
2007-12-11 08:59:05 +00:00
|
|
|
FUNC_CODE_INST_VAARG = 23, // VAARG: [valistty, valist, instty]
|
|
|
|
// This store code encodes the pointer type, rather than the value type
|
|
|
|
// this is so information only available in the pointer type (e.g. address
|
|
|
|
// spaces) is retained.
|
2011-06-17 18:17:37 +00:00
|
|
|
FUNC_CODE_INST_STORE = 24, // STORE: [ptrty,ptr,val, align, vol]
|
2011-06-17 18:09:11 +00:00
|
|
|
// 25 is unused.
|
2008-05-23 01:55:30 +00:00
|
|
|
FUNC_CODE_INST_EXTRACTVAL = 26, // EXTRACTVAL: [n x operands]
|
2008-09-09 01:02:47 +00:00
|
|
|
FUNC_CODE_INST_INSERTVAL = 27, // INSERTVAL: [n x operands]
|
2009-07-08 03:04:38 +00:00
|
|
|
// fcmp/icmp returning Int1TY or vector of Int1Ty. Same as CMP, exists to
|
|
|
|
// support legacy vicmp/vfcmp instructions.
|
2008-09-23 18:27:53 +00:00
|
|
|
FUNC_CODE_INST_CMP2 = 28, // CMP2: [opty, opval, opval, pred]
|
2008-09-16 01:01:33 +00:00
|
|
|
// new select on i1 or [N x i1]
|
2009-07-27 21:53:46 +00:00
|
|
|
FUNC_CODE_INST_VSELECT = 29, // VSELECT: [ty,opval,opval,predty,pred]
|
2009-10-27 19:13:16 +00:00
|
|
|
FUNC_CODE_INST_INBOUNDS_GEP= 30, // INBOUNDS_GEP: [n x operands]
|
2010-04-03 02:17:50 +00:00
|
|
|
FUNC_CODE_INST_INDIRECTBR = 31, // INDIRECTBR: [opty, op0, op1, ...]
|
2011-06-17 18:09:11 +00:00
|
|
|
// 32 is unused.
|
2010-09-09 23:12:39 +00:00
|
|
|
FUNC_CODE_DEBUG_LOC_AGAIN = 33, // DEBUG_LOC_AGAIN
|
|
|
|
|
2011-06-17 18:17:37 +00:00
|
|
|
FUNC_CODE_INST_CALL = 34, // CALL: [attr, fnty, fnid, args...]
|
2010-09-09 23:12:39 +00:00
|
|
|
|
2011-07-25 23:16:38 +00:00
|
|
|
FUNC_CODE_DEBUG_LOC = 35, // DEBUG_LOC: [Line,Col,ScopeVal, IAVal]
|
2011-07-27 20:18:04 +00:00
|
|
|
FUNC_CODE_INST_FENCE = 36, // FENCE: [ordering, synchscope]
|
Revert r136253, r136263, r136269, r136313, r136325, r136326, r136329, r136338,
r136339, r136341, r136369, r136387, r136392, r136396, r136429, r136430, r136444,
r136445, r136446, r136253 pending review.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136556 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-30 05:42:50 +00:00
|
|
|
FUNC_CODE_INST_CMPXCHG = 37, // CMPXCHG: [ptrty,ptr,cmp,new, align, vol,
|
2011-07-28 21:48:00 +00:00
|
|
|
// ordering, synchscope]
|
2011-07-31 06:30:59 +00:00
|
|
|
FUNC_CODE_INST_ATOMICRMW = 38, // ATOMICRMW: [ptrty,ptr,val, operation,
|
2011-07-28 21:48:00 +00:00
|
|
|
// align, vol,
|
|
|
|
// ordering, synchscope]
|
2011-08-09 23:02:53 +00:00
|
|
|
FUNC_CODE_INST_RESUME = 39, // RESUME: [opval]
|
2011-08-12 20:24:12 +00:00
|
|
|
FUNC_CODE_INST_LANDINGPAD = 40, // LANDINGPAD: [ty,val,val,num,id0,val0...]
|
|
|
|
FUNC_CODE_INST_LOADATOMIC = 41, // LOAD: [opty, op, align, vol,
|
2011-08-09 23:02:53 +00:00
|
|
|
// ordering, synchscope]
|
2011-08-12 20:24:12 +00:00
|
|
|
FUNC_CODE_INST_STOREATOMIC = 42 // STORE: [ptrty,ptr,val, align, vol
|
2011-08-09 23:02:53 +00:00
|
|
|
// ordering, synchscope]
|
2007-04-26 05:53:04 +00:00
|
|
|
};
|
2011-12-07 21:44:12 +00:00
|
|
|
|
|
|
|
enum UseListCodes {
|
|
|
|
USELIST_CODE_ENTRY = 1 // USELIST_CODE_ENTRY: TBD.
|
|
|
|
};
|
2007-04-23 01:01:15 +00:00
|
|
|
} // End bitc namespace
|
|
|
|
} // End llvm namespace
|
|
|
|
|
|
|
|
#endif
|