firm_types.h 12.9 KB
Newer Older
1
2
/*
 * This file is part of libFirm.
3
 * Copyright (C) 2012 University of Karlsruhe.
4
5
6
7
8
9
10
11
12
13
 */

/**
 * @file
 * @brief      Definition of opaque firm types
 * @author     Michael Beck
 */
#ifndef FIRM_COMMON_FIRM_TYPES_H
#define FIRM_COMMON_FIRM_TYPES_H

14
15
#include "begin.h"

16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/**
 * @page visited_counters Visited Counters
 * A visited counter is an alternative to a visited flag for elements of a
 * graph datastructure.
 * A visited counter is an integer number added to the elements of a graph.
 * There is also a global reference number for the whole datastructure. It is
 * now possible to mark nodes by setting their visited counter to the global
 * reference counter. Testing is done by comparing with the global reference
 * counter.
 * The advantage to simple boolean flag variables is that you can clear all
 * element marks by increasing the global reference counter and don't need to
 * visit the whole structure.
 * This makes it more efficient when you only visit/mark a small amount of
 * nodes in the graph.
 */

/** Type for visited counters
 * @see visited_counters */
Michael Beck's avatar
Michael Beck committed
34
typedef unsigned long ir_visited_t;
35
/** A label in the code (usually attached to a @ref Block) */
Michael Beck's avatar
Michael Beck committed
36
typedef unsigned long ir_label_t;
37

38
39
/** @ingroup dbg_info
 * Source Reference */
40
typedef struct dbg_info             dbg_info;
41
42
/** @ingroup dbg_info
 * Source Type Reference */
43
typedef struct type_dbg_info        type_dbg_info;
44
/** @ingroup ir_ident
Matthias Braun's avatar
Matthias Braun committed
45
46
47
48
49
50
 * Identifier
 *
 * @note This is currently defined as a normal C string, but you should not
 *  rely on that and always use get_id_str() before using it as a C string.
 */
typedef const char                  ident;
51
52
/** @ingroup ir_node
 * Procedure Graph Node */
53
typedef struct ir_node              ir_node;
54
55
/** @ingroup ir_op
 * Node Opcode */
56
typedef struct ir_op                ir_op;
57
58
/** @ingroup ir_mode
 * SSA Value mode */
59
typedef struct ir_mode              ir_mode;
60
61
/** @ingroup iredges
 * Dynamic Reverse Edge */
62
typedef struct ir_edge_t            ir_edge_t;
63
64
/** @ingroup ir_heights
 * Computed graph Heights */
65
typedef struct ir_heights_t         ir_heights_t;
66
67
/** @ingroup ir_tarval
 * Target Machine Value */
68
typedef struct ir_tarval            ir_tarval;
69
70
/** @ingroup ir_type
 * Type */
71
typedef struct ir_type              ir_type;
72
/** @ingroup ir_graph
Victor Pfautz's avatar
Victor Pfautz committed
73
 * Procedure Graph */
74
typedef struct ir_graph             ir_graph;
75
76
/** @ingroup ir_prog
 * Program */
77
typedef struct ir_prog              ir_prog;
78
79
/** @ingroup ir_loop
 * Loop */
80
typedef struct ir_loop              ir_loop;
81
82
/** @ingroup ir_entity
 * Entity */
83
typedef struct ir_entity            ir_entity;
84
85
/** @ingroup ir_cdep
 * Control Dependence Analysis Results */
86
typedef struct ir_cdep              ir_cdep;
87
88
/** @ingroup ir_initializer
 * Initializer (for entities) */
89
typedef union  ir_initializer_t     ir_initializer_t;
90

91
92
93
/**
 * @ingroup irgwalk
 * type for graph-walk callbacks */
94
95
typedef void irg_walk_func(ir_node *, void *);

Matthias Braun's avatar
Matthias Braun committed
96
/**
97
 * @ingroup Switch
Matthias Braun's avatar
Matthias Braun committed
98
99
100
101
102
103
 * A switch table mapping integer numbers to proj-numbers of a Switch-node.
 * Entries map a continuous range of integer numbers to a proj-number.
 * There must never be two different entries matching the same integer number.
 */
typedef struct ir_switch_table  ir_switch_table;

104
/**
105
 * @ingroup ir_cons
106
107
108
109
110
111
112
113
114
115
 * This function is called, whenever a local variable is used before definition
 *
 * @param irg       the IR graph on which this happens
 * @param mode      the mode of the local var
 * @param pos       position chosen be the frontend for this variable (n_loc)
 *
 * @return a firm node of mode @p mode that initializes the var at position pos
 *
 * @note
 *      Do not return NULL!
Christoph Mallon's avatar
Christoph Mallon committed
116
 *      If this function is not set, FIRM will create an Unknown node.
117
118
119
120
 *      Use set_irg_loc_description()/get_irg_loc_description() to assign additional
 *      informations to local variables.
 */
typedef ir_node *uninitialized_local_variable_func_t(ir_graph *irg, ir_mode *mode, int pos);
121

122
#ifdef __cplusplus
123
# define ENUM_BITSET(type) \
124
125
126
127
128
129
130
131
132
133
	extern "C++" { \
		static inline type operator ~  (type  a)         { return     (type)~(int)a;           } \
		static inline type operator &  (type  a, type b) { return     (type)((int)a & (int)b); } \
		static inline type operator &= (type& a, type b) { return a = (type)((int)a & (int)b); } \
		static inline type operator ^  (type  a, type b) { return     (type)((int)a ^ (int)b); } \
		static inline type operator ^= (type& a, type b) { return a = (type)((int)a ^ (int)b); } \
		static inline type operator |  (type  a, type b) { return     (type)((int)a | (int)b); } \
		static inline type operator |= (type& a, type b) { return a = (type)((int)a | (int)b); } \
	}
#else
134
135
136
137
/** Marks an enum type as bitset enum. That is the enumeration values will
 * probably be combined to form a (bit)set of flags.
 * When compiling for C++ this macro will define the ~, &, &=, ^, ^=, | and |=
 * operators for the enum values. */
138
# define ENUM_BITSET(type)
139
140
141
#endif

#ifdef __cplusplus
142
# define ENUM_COUNTABLE(type) \
143
144
145
146
147
	extern "C++" { \
		static inline type operator ++(type& a) { return a = (type)((int)a + 1); } \
		static inline type operator --(type& a) { return a = (type)((int)a - 1); } \
	}
#else
148
149
150
151
/** Marks an enum type as countable enum. The enumeration values will be a
 * linear sequence of numbers which can be iterated through by incrementing
 * by 1.
 * When compiling for C++ this macro will define the ++ and -- operators. */
152
# define ENUM_COUNTABLE(type)
153
154
#endif

155
/**
156
 * @ingroup ir_node
157
158
159
160
161
162
163
164
165
166
 * Relations for comparing numbers
 */
typedef enum ir_relation {
	ir_relation_false              = 0,       /**< always false */
	ir_relation_equal              = 1u << 0, /**< equal */
	ir_relation_less               = 1u << 1, /**< less */
	ir_relation_greater            = 1u << 2, /**< greater */
	ir_relation_unordered          = 1u << 3, /**< unordered */
	ir_relation_less_equal         = ir_relation_equal|ir_relation_less,    /**< less or equal */
	ir_relation_greater_equal      = ir_relation_equal|ir_relation_greater, /**< greater or equal */
Manuel Mohr's avatar
Manuel Mohr committed
167
	ir_relation_less_greater       = ir_relation_less|ir_relation_greater,  /**< less or greater ('not equal' for integer numbers) */
168
169
	ir_relation_less_equal_greater = ir_relation_equal|ir_relation_less|ir_relation_greater, /**< less equal or greater ('not unordered') */
	ir_relation_unordered_equal    = ir_relation_unordered|ir_relation_equal, /**< unordered or equal */
yb9976's avatar
yb9976 committed
170
	ir_relation_unordered_less     = ir_relation_unordered|ir_relation_less,  /**< unordered or less */
171
172
173
174
175
176
177
178
	ir_relation_unordered_less_equal = ir_relation_unordered|ir_relation_less|ir_relation_equal, /**< unordered, less or equal */
	ir_relation_unordered_greater    = ir_relation_unordered|ir_relation_greater, /**< unordered or greater */
	ir_relation_unordered_greater_equal = ir_relation_unordered|ir_relation_greater|ir_relation_equal, /**< unordered, greater or equal */
	ir_relation_unordered_less_greater  = ir_relation_unordered|ir_relation_less|ir_relation_greater, /**< unordered, less or greater ('not equal' for floatingpoint numbers) */
	ir_relation_true                    = ir_relation_equal|ir_relation_less|ir_relation_greater|ir_relation_unordered, /**< always true */
} ir_relation;
ENUM_BITSET(ir_relation)

179
/**
180
 * @ingroup ir_node
181
182
183
 * constrained flags for memory operations.
 */
typedef enum ir_cons_flags {
184
185
186
187
188
189
190
	cons_none             = 0,        /**< No constrains. */
	cons_volatile         = 1U << 0,  /**< Memory operation is volatile. */
	cons_unaligned        = 1U << 1,  /**< Memory operation is unaligned. */
	cons_floats           = 1U << 2,  /**< Memory operation can float. */
	cons_throws_exception = 1U << 3,  /**< fragile op throws exception (and
	                                       produces X_regular and X_except
	                                       values) */
191
192
} ir_cons_flags;
ENUM_BITSET(ir_cons_flags)
193

194
195
196
197
/**
 * @ingroup ir_node
 * pinned states.
 */
198
typedef enum op_pin_state {
199
200
	op_pin_state_floats = 0,    /**< Nodes of this opcode can be placed in any basic block. */
	op_pin_state_pinned = 1,    /**< Nodes must remain in this basic block. */
201
202
	op_pin_state_exc_pinned,    /**< Node must remain in this basic block if it
	                                 can throw an exception, else can float. */
203
204
} op_pin_state;

205
/**
206
 * @ingroup Cond
207
208
 * A type to express conditional jump predictions.
 */
209
typedef enum cond_jmp_predicate {
210
211
212
213
214
	COND_JMP_PRED_NONE,        /**< No jump prediction. Default. */
	COND_JMP_PRED_TRUE,        /**< The True case is predicted. */
	COND_JMP_PRED_FALSE        /**< The False case is predicted. */
} cond_jmp_predicate;

215
/**
216
 * @ingroup method_type
217
218
219
220
 * Additional method type properties:
 * Tell about special properties of a method type. Some
 * of these may be discovered by analyses.
 */
221
typedef enum mtp_additional_properties {
222
	/** No additional properties */
Matthias Braun's avatar
Matthias Braun committed
223
	mtp_no_property                 = 0,
224
225
226
227
228
229
230
231
	/** This method does not change any memory known to the rest of the
	 * program. */
	mtp_property_no_write           = 1u << 0,
	/** The behaviour of the method does not depend on any global/external
	 * state. This mostly means that no waiting/reading of user input
	 * is performed, no global variables read, or pointers to memory visible
	 * outside of the function dereferenced. The result of the function
	 * solely depends on its arguments. */
Matthias Braun's avatar
Matthias Braun committed
232
	mtp_property_pure               = 1u << 1,
233
234
	/** This method never returns. The method may for example abort or exit the
	 * program or contain an infinite loop).
Matthias Braun's avatar
Matthias Braun committed
235
236
	 * GCC: __attribute__((noreturn)). */
	mtp_property_noreturn           = 1u << 2,
237
238
239
	/** The function is guaranteed not to end in an endless and to not abort
	 * the program. */
	mtp_property_terminates         = 1u << 3,
Matthias Braun's avatar
Matthias Braun committed
240
	/** This method cannot throw an exception. GCC: __attribute__((nothrow)). */
241
	mtp_property_nothrow            = 1u << 4,
Matthias Braun's avatar
Matthias Braun committed
242
	/** This method is naked. GCC: __attribute__((naked)). */
243
	mtp_property_naked              = 1u << 5,
Matthias Braun's avatar
Matthias Braun committed
244
245
	/** This method returns newly allocate memory.
	 * GCC: __attribute__((malloc)). */
246
	mtp_property_malloc             = 1u << 6,
247
	/** This method can return more than once (typically setjmp).
Matthias Braun's avatar
Matthias Braun committed
248
	 * GCC: __attribute__((returns_twice)). */
249
	mtp_property_returns_twice      = 1u << 7,
250
251
	/** All method invocations are known and inside the current compilation
	 * unit, the backend can freely choose the calling convention. */
252
	mtp_property_private            = 1u << 8,
253
	/** Try to always inline this function, even if it seems nonprofitable */
254
	mtp_property_always_inline      = 1u << 9,
255
	/** The function should not be inlined */
256
	mtp_property_noinline           = 1u << 10,
257
	/** The programmer recommends to inline the function */
258
	mtp_property_inline_recommended = 1u << 11,
259
	/** Marker used by opt_funccall (really a hack)... */
260
	mtp_temporary                   = 1u << 12,
261
262
} mtp_additional_properties;
ENUM_BITSET(mtp_additional_properties)
263

Matthias Braun's avatar
Matthias Braun committed
264
265
266
/** A input/output constraint attribute.
 * @ingroup ASM
 */
267
typedef struct ir_asm_constraint {
268
269
270
	unsigned pos;         /**< The input/output position for this constraint. */
	ident    *constraint; /**< The constraint for this input/output. */
	ir_mode  *mode;       /**< The mode of the constraint. */
Matthias Braun's avatar
Matthias Braun committed
271
272
} ir_asm_constraint;

Matthias Braun's avatar
Matthias Braun committed
273
274
275
/** Supported libFirm builtins.
 * @ingroup Builtin
 */
276
typedef enum ir_builtin_kind {
Matthias Braun's avatar
Matthias Braun committed
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
	ir_bk_trap,                 /**< GCC __builtin_trap(): insert trap */
	ir_bk_debugbreak,           /**< MS __debugbreak(): insert debug break */
	ir_bk_return_address,       /**< GCC __builtin_return_address() */
	ir_bk_frame_address,        /**< GCC __builtin_frame_address() */
	ir_bk_prefetch,             /**< GCC __builtin_prefetch() */
	ir_bk_ffs,                  /**< GCC __builtin_ffs(): find first (least)
	                                 significant 1 bit */
	ir_bk_clz,                  /**< GCC __builtin_clz(): count leading zero */
	ir_bk_ctz,                  /**< GCC __builtin_ctz(): count trailing zero */
	ir_bk_popcount,             /**< GCC __builtin_popcount(): population
	                                 count */
	ir_bk_parity,               /**< GCC __builtin_parity(): parity */
	ir_bk_bswap,                /**< byte swap */
	ir_bk_inport,               /**< in port */
	ir_bk_outport,              /**< out port */
	ir_bk_saturating_increment, /**< saturating increment */
	ir_bk_compare_swap,         /**< compare exchange (aka. compare and swap) */
	ir_bk_may_alias,            /**< replaced by 0 if args cannot alias,
	                                 1 otherwise */
296
297
298
	ir_bk_va_start,             /**< va_start from <stdarg.h> */
	ir_bk_va_arg,               /**< va_arg from <stdarg.h> */
	ir_bk_last = ir_bk_va_arg,
299
300
} ir_builtin_kind;

301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
/**
 * This enumeration flags the volatility of entities and Loads/Stores.
 */
typedef enum {
	volatility_non_volatile,    /**< The entity is not volatile. Default. */
	volatility_is_volatile      /**< The entity is volatile. */
} ir_volatility;

/**
 * This enumeration flags the align of Loads/Stores.
 */
typedef enum {
	align_is_aligned = 0, /**< The entity is aligned. Default */
	align_non_aligned,    /**< The entity is not aligned. */
} ir_align;

317
318
typedef struct hook_entry hook_entry_t;

319
320
#include "end.h"

321
#endif