firm_types.h 15.5 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
45
/** @ingroup ir_ident
 * Identifier */
46
typedef struct ident                ident;
47
48
/** @ingroup ir_node
 * Procedure Graph Node */
49
typedef struct ir_node              ir_node;
50
51
/** @ingroup ir_op
 * Node Opcode */
52
typedef struct ir_op                ir_op;
53
54
/** @ingroup ir_mode
 * SSA Value mode */
55
typedef struct ir_mode              ir_mode;
56
57
/** @ingroup iredges
 * Dynamic Reverse Edge */
58
typedef struct ir_edge_t            ir_edge_t;
59
60
/** @ingroup ir_heights
 * Computed graph Heights */
61
typedef struct ir_heights_t         ir_heights_t;
62
63
/** @ingroup ir_tarval
 * Target Machine Value */
64
typedef struct ir_tarval            ir_tarval;
65
66
/** @ingroup enumeration_type
 * Enumeration constant */
67
typedef struct ir_enum_const        ir_enum_const;
68
69
/** @ingroup ir_type
 * Type */
70
typedef struct ir_type              ir_type;
71
72
/** @ingroup ir_graph
 * Procedure Grpah */
73
typedef struct ir_graph             ir_graph;
74
75
/** @ingroup ir_prog
 * Program */
76
typedef struct ir_prog              ir_prog;
77
78
/** @ingroup ir_loop
 * Loop */
79
typedef struct ir_loop              ir_loop;
80
81
/** @ingroup ir_entity
 * Entity */
82
typedef struct ir_entity            ir_entity;
83
84
/** @ingroup ir_cdep
 * Control Dependence Analysis Results */
85
typedef struct ir_cdep              ir_cdep;
86
/** A graph transformation pass */
87
typedef struct ir_graph_pass_t      ir_graph_pass_t;
88
/** A whole program transformation pass */
89
90
typedef struct ir_prog_pass_t       ir_prog_pass_t;

91
/** A graph pass manager */
92
typedef struct ir_graph_pass_manager_t      ir_graph_pass_manager_t;
93
/** A program pass manager */
94
typedef struct ir_prog_pass_manager_t       ir_prog_pass_manager_t;
95

96
97
/** @ingroup ir_initializer
 * Initializer (for entities) */
98
typedef union  ir_initializer_t     ir_initializer_t;
99

100
101
102
/**
 * @ingroup irgwalk
 * type for graph-walk callbacks */
103
104
typedef void irg_walk_func(ir_node *, void *);

Matthias Braun's avatar
Matthias Braun committed
105
/**
106
 * @ingroup Switch
Matthias Braun's avatar
Matthias Braun committed
107
108
109
110
111
112
 * 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;

113
/**
114
 * @ingroup ir_cons
115
116
117
118
119
120
121
122
123
124
 * 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
125
 *      If this function is not set, FIRM will create an Unknown node.
126
127
128
129
 *      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);
130

131
#ifdef __cplusplus
132
# define ENUM_BITSET(type) \
133
134
135
136
137
138
139
140
141
142
	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
143
144
145
146
/** 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. */
147
# define ENUM_BITSET(type)
148
149
150
#endif

#ifdef __cplusplus
151
# define ENUM_COUNTABLE(type) \
152
153
154
155
156
	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
157
158
159
160
/** 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. */
161
# define ENUM_COUNTABLE(type)
162
163
#endif

164
/**
165
 * @ingroup ir_node
166
167
168
169
170
171
172
173
174
175
176
177
178
 * 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 */
	ir_relation_less_greater       = ir_relation_less|ir_relation_greater,  /** less or greater ('not equal' for integer numbers) */
	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
179
	ir_relation_unordered_less     = ir_relation_unordered|ir_relation_less,  /**< unordered or less */
180
181
182
183
184
185
186
187
	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)

188
/**
189
 * @ingroup ir_node
190
191
192
 * constrained flags for memory operations.
 */
typedef enum ir_cons_flags {
193
194
195
196
197
198
199
	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) */
200
201
} ir_cons_flags;
ENUM_BITSET(ir_cons_flags)
202

203
204
205
206
/**
 * @ingroup ir_node
 * pinned states.
 */
207
typedef enum op_pin_state {
208
209
210
211
212
213
214
215
	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. */
	op_pin_state_exc_pinned,    /**< Node must be remain in this basic block if it can throw an
	                                 exception, else can float. Used internally. */
	op_pin_state_mem_pinned     /**< Node must be remain in this basic block if it can throw an
	                                 exception or uses memory, else can float. Used internally. */
} op_pin_state;

216
/**
217
 * @ingroup Cond
218
219
 * A type to express conditional jump predictions.
 */
220
typedef enum cond_jmp_predicate {
221
222
223
224
225
	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;

226
/**
227
 * @ingroup method_type
228
229
230
231
 * Additional method type properties:
 * Tell about special properties of a method type. Some
 * of these may be discovered by analyses.
 */
232
typedef enum mtp_additional_properties {
Matthias Braun's avatar
Matthias Braun committed
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
	/** no additional properties */
	mtp_no_property                 = 0,
	/** This method did not access memory and calculates its return values
	 * solely from its parameters. The only observable effect of a const
	 * function must be its return value. So they must not exhibit infinite
	 * loops or wait for user input. The return value must not depend on any
	 * global variables/state.
	 * GCC: __attribute__((const)). */
	mtp_property_const              = 1u << 0,
	/** This method did NOT write to memory and calculates its return values
	 * solely from its parameters and the memory they points to (or global
	 * vars). The only observable effect of a const function must be its return
	 * value. So they must not exhibit infinite loops or wait for user input.
	 * GCC: __attribute__((pure)). */
	mtp_property_pure               = 1u << 1,
	/** This method did not return due to an aborting system call.
	 * GCC: __attribute__((noreturn)). */
	mtp_property_noreturn           = 1u << 2,
	/** This method cannot throw an exception. GCC: __attribute__((nothrow)). */
	mtp_property_nothrow            = 1u << 3,
	/** This method is naked. GCC: __attribute__((naked)). */
	mtp_property_naked              = 1u << 4,
	/** This method returns newly allocate memory.
	 * GCC: __attribute__((malloc)). */
	mtp_property_malloc             = 1u << 5,
	/** This method can return more than one (typically setjmp).
	 * GCC: __attribute__((returns_twice)). */
	mtp_property_returns_twice      = 1u << 6,
	/** This method is intrinsic. It is expected that a lowering phase will
	 * remove all calls to it. */
	mtp_property_intrinsic          = 1u << 7,
	/** This method represents a runtime routine. */
	mtp_property_runtime            = 1u << 8,
	/** All method invocations are known, the backend is free to optimize the
	 * call in any possible way. */
	mtp_property_private            = 1u << 9,
	/** Set, if this method contains one possibly endless loop. */
	mtp_property_has_loop           = 1u << 10,
	/** try to always inline this function, even if it seems nonprofitable */
	mtp_property_always_inline      = 1u << 11,
	/** the function should not be inlined */
	mtp_property_noinline           = 1u << 12,
	/** the programmer recommends to inline the function */
	mtp_property_inline_recommended = 1u << 13,
	/** stupid hack used by opt_funccall... */
Matthias Braun's avatar
Matthias Braun committed
278
	mtp_temporary                   = 1u << 14,
279
280
} mtp_additional_properties;
ENUM_BITSET(mtp_additional_properties)
281

282
283
284
/**
 * @ingroup SymConst
 * This enum names the different kinds of symbolic Constants represented by
285
 * SymConst.  The content of the attribute symconst_symbol depends on this tag.
286
287
 * Use the proper access routine after testing this flag.
 */
288
typedef enum symconst_kind {
Matthias Braun's avatar
Matthias Braun committed
289
290
291
292
293
294
295
296
297
	symconst_type_size,   /**< The SymConst is the size of the given type.
	                           symconst_symbol is type *. */
	symconst_type_align,  /**< The SymConst is the alignment of the given type.
	                           symconst_symbol is type *. */
	symconst_addr_ent,    /**< The SymConst is a symbolic pointer to be filled in
	                           by the linker.  The pointer is represented by an entity.
	                           symconst_symbol is entity *. */
	symconst_ofs_ent,     /**< The SymConst is the offset of its entity in the entities
	                           owner type. */
298
	symconst_enum_const   /**< The SymConst is a enumeration constant of an
Matthias Braun's avatar
Matthias Braun committed
299
300
301
	                           enumeration type. */
} symconst_kind;

302
303
304
/**
 * @ingroup SymConst
 * SymConst attribute.
Matthias Braun's avatar
Matthias Braun committed
305
306
 *
 *  This union contains the symbolic information represented by the node.
Matthias Braun's avatar
Matthias Braun committed
307
 *  @ingroup SymConst
Matthias Braun's avatar
Matthias Braun committed
308
309
310
311
312
313
314
 */
typedef union symconst_symbol {
	ir_type       *type_p;    /**< The type of a SymConst. */
	ir_entity     *entity_p;  /**< The entity of a SymConst. */
	ir_enum_const *enum_p;    /**< The enumeration constant of a SymConst. */
} symconst_symbol;

315
/**
Matthias Braun's avatar
Matthias Braun committed
316
 * @ingroup Alloc
317
 * The allocation place.
Matthias Braun's avatar
Matthias Braun committed
318
 */
319
typedef enum ir_where_alloc {
Matthias Braun's avatar
Matthias Braun committed
320
321
322
323
	stack_alloc,          /**< Alloc allocates the object on the stack. */
	heap_alloc            /**< Alloc allocates the object on the heap. */
} ir_where_alloc;

Matthias Braun's avatar
Matthias Braun committed
324
325
326
/** A input/output constraint attribute.
 * @ingroup ASM
 */
327
typedef struct ir_asm_constraint {
Matthias Braun's avatar
Matthias Braun committed
328
329
330
331
332
	unsigned       pos;           /**< The inputs/output position for this constraint. */
	ident          *constraint;   /**< The constraint for this input/output. */
	ir_mode        *mode;         /**< The mode of the constraint. */
} ir_asm_constraint;

Matthias Braun's avatar
Matthias Braun committed
333
334
335
/** Supported libFirm builtins.
 * @ingroup Builtin
 */
336
typedef enum ir_builtin_kind {
337
338
	ir_bk_trap,                   /**< GCC __builtin_trap(): insert trap */
	ir_bk_debugbreak,             /**< MS __debugbreak(): insert debug break */
339
	ir_bk_return_address,         /**< GCC __builtin_return_address() */
340
	ir_bk_frame_address,          /**< GCC __builtin_frame_address() */
341
	ir_bk_prefetch,               /**< GCC __builtin_prefetch() */
342
343
344
345
346
	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 */
Michael Beck's avatar
Michael Beck committed
347
	ir_bk_bswap,                  /**< byte swap */
348
349
	ir_bk_inport,                 /**< in port */
	ir_bk_outport,                /**< out port */
350
	ir_bk_inner_trampoline,       /**< address of a trampoline for GCC inner functions */
351
	ir_bk_last = ir_bk_inner_trampoline,
352
353
} ir_builtin_kind;

354
355
356
/**
 * Possible return values of value_classify().
 */
357
typedef enum ir_value_classify_sign {
358
359
360
361
362
363
	value_classified_unknown  = 0,   /**< could not classify */
	value_classified_positive = 1,   /**< value is positive, i.e. >= 0 */
	value_classified_negative = -1   /**< value is negative, i.e. <= 0 if
	                                      no signed zero exists or < 0 else */
} ir_value_classify_sign;

364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
/**
 * 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;

380
381
#include "end.h"

382
#endif