irtypes.h 27.7 KB
Newer Older
1
/*
2
 * Copyright (C) 1995-2011 University of Karlsruhe.  All right reserved.
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
 *
 * This file is part of libFirm.
 *
 * This file may be distributed and/or modified under the terms of the
 * GNU General Public License version 2 as published by the Free Software
 * Foundation and appearing in the file LICENSE.GPL included in the
 * packaging of this file.
 *
 * Licensees holding valid libFirm Professional Edition licenses may use
 * this file in accordance with the libFirm Commercial License.
 * Agreement provided with the Software.
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE.
 */

/**
 * @file
 * @brief   Definition of the Firm IR base types, concentrated here
 * @author  Michael Beck
 * @version $Id$
 */
#ifndef FIRM_IR_IRDEFS_H
#define FIRM_IR_IRDEFS_H

#include "firm_types.h"
#include "irdom_t.h"
#include "irmode.h"
#include "irnode.h"
#include "irgraph.h"
#include "iredgekinds.h"
#include "irtypeinfo.h"
36
#include "irextbb.h"
37
38
39
#include "execution_frequency.h"
#include "irmemory.h"
#include "callgraph.h"
40
#include "irprog.h"
41
#include "field_temperature.h"
42
#include "irphase.h"
43
#include "bitset.h"
44
45
46
47

#include "pset.h"
#include "set.h"
#include "list.h"
48
#include "obst.h"
49
#include "vrp.h"
50

51
52
53
54
55
/**
 * List of phases. (We will add a register/unregister interface if managing
 * this gets too tedious)
 */
typedef enum ir_phase_id {
56
57
	PHASE_FIRST,
	PHASE_VRP = PHASE_FIRST,
58
59
	PHASE_LAST = PHASE_VRP
} ir_phase_id;
60
ENUM_COUNTABLE(ir_phase_id)
61

62
63
64
65
66
/** The type of an ir_op. */
struct ir_op {
	unsigned code;          /**< The unique opcode of the op. */
	ident *name;            /**< The name of the op. */
	size_t attr_size;       /**< Space needed in memory for private attributes. */
67
	op_pin_state pin_state; /**< How to deal with the node in CSE, PRE. */
68
69
70
	op_arity opar;          /**< The arity of operator. */
	int op_index;           /**< The index of the first data operand, 0 for most cases, 1 for Div etc. */
	unsigned flags;         /**< Flags describing the behavior of the ir_op, a bitmasks of irop_flags. */
71
	unsigned tag;           /**< Some custom TAG value the op's creator set to. */
72
	void *attr;             /**< custom pointer where op's creator can attach attribute stuff to. */
73
74
75
76
77
78
79
80
81
82
83
84
85

	ir_op_ops ops;          /**< The operations of the this op. */
};

/**
 * Contains relevant information about a mode.
 *
 * Necessary information about a mode is stored in this struct
 * which is used by the tarval module to perform calculations
 * and comparisons of values of a such described mode.
 *
 * ATTRIBUTES:
 *  -  ident *name:             Name of this mode. Two modes are different if the name is different.
86
 *  -  ir_mode_sort sort:       sort of mode specifying possible usage categories
87
88
89
90
91
92
93
94
95
96
97
98
99
 *  -  int    size:             size of the mode in Bits.
 *  -  unsigned sign:1:         signedness of this mode
 *  -  ... more to come
 *  -  modulo_shift             specifies for modes of kind irms_int_number
 *                              whether shift applies modulo to value of bits to shift
 *
 * SEE ALSO:
 *    The tech report 1999-44 describing FIRM and predefined modes
 *    tarval.h
 */
struct ir_mode {
	firm_kind         kind;       /**< distinguishes this node from others */
	ident             *name;      /**< Name ident of this mode */
100
	ir_type           *type;      /**< corresponding primitive type */
101
102
103

	/* ----------------------------------------------------------------------- */
	/* On changing this struct you have to evaluate the mode_are_equal function!*/
104
	ir_mode_sort      sort;          /**< coarse classification of this mode:
105
106
                                          int, float, reference ...
                                          (see irmode.h) */
107
108
	ir_mode_arithmetic
	                  arithmetic;    /**< different arithmetic operations possible with a mode */
109
	unsigned          size;          /**< size of the mode in Bits. */
110
111
112
113
114
115
116
	unsigned          sign:1;        /**< signedness of this mode */
	unsigned int      modulo_shift;  /**< number of bits a values of this mode will be shifted */
	unsigned          vector_elem;   /**< if this is not equal 1, this is a vector mode with
                                          vector_elem number of elements, size contains the size
                                          of all bits and must be dividable by vector_elem */

	/* ----------------------------------------------------------------------- */
Matthias Braun's avatar
Matthias Braun committed
117
118
119
120
121
122
	ir_tarval         *min;         /**< the minimum value that can be expressed */
	ir_tarval         *max;         /**< the maximum value that can be expressed */
	ir_tarval         *null;        /**< the value 0 */
	ir_tarval         *one;         /**< the value 1 */
	ir_tarval         *minus_one;   /**< the value -1 */
	ir_tarval         *all_one;     /**< the value ~0 */
123
124
125
126
127
128
	ir_mode           *eq_signed;   /**< For pointer modes, the equivalent signed integer one. */
	ir_mode           *eq_unsigned; /**< For pointer modes, the equivalent unsigned integer one. */
	void              *link;        /**< To store some intermediate information */
	const void        *tv_priv;     /**< tarval module will save private data here */
};

129
130
/* ir node attributes */

131
/** first attribute of Bad, Block, Anchor nodes */
132
typedef struct irg_attr {
133
134
	ir_graph *irg;              /**< The graph this block like node belongs to. */
} irg_attr;
135

136
typedef struct bad_attr {
137
138
139
	irg_attr    irg;
} bad_attr;

140
141
142
143
typedef struct anchor_attr {
	irg_attr  irg;
} anchor_attr;

144
/** Block attributes */
145
typedef struct block_attr {
146
	/* General attributes */
147
	irg_attr     irg;           /**< The graph this block belongs to. */
148
	ir_visited_t block_visited; /**< For the walker that walks over all blocks. */
149
150
151
	/* Attributes private to construction: */
	unsigned is_matured:1;      /**< If set, all in-nodes of the block are fixed. */
	unsigned is_dead:1;         /**< If set, the block is dead (and could be replace by a Bad. */
152
	unsigned marked:1;          /**< Can be set/unset to temporary mark a block. */
153
154
155
156
157
158
159
160
161
162
163
	ir_node **graph_arr;        /**< An array to store all parameters. */
	/* Attributes holding analyses information */
	ir_dom_info dom;            /**< Datastructure that holds information about dominators.
	                                 @@@ @todo
	                                 Eventually overlay with graph_arr as only valid
	                                 in different phases.  Eventually inline the whole
	                                 datastructure. */
	ir_dom_info pdom;           /**< Datastructure that holds information about post-dominators. */
	ir_node ** in_cg;           /**< array with predecessors in
	                             * interprocedural_view, if they differ
	                             * from intraprocedural predecessors */
164
165
	bitset_t *backedge;         /**< Bitfield n set to true if pred n is backedge.*/
	bitset_t *cg_backedge;      /**< Bitfield n set to true if pred n is interprocedural backedge. */
166
167
	ir_extblk *extblk;          /**< The extended basic block this block belongs to. */
	ir_region *region;          /**< The immediate structural region this block belongs to. */
168
	ir_entity *entity;          /**< entitiy representing this block */
169
	ir_node  *phis;             /**< The list of Phi nodes in this block. */
170
171
172
173
174

	struct list_head succ_head; /**< A list head for all successor edges of a block. */
} block_attr;

/** Cond attributes. */
175
typedef struct cond_attr {
176
177
	long default_proj;           /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */
	cond_jmp_predicate jmp_pred; /**< only for binary Conds: The jump predication. */
178
179
180
} cond_attr;

/** Const attributes. */
Matthias Braun's avatar
Matthias Braun committed
181
182
typedef struct const_attr {
	ir_tarval *tarval;  /**< the target value */
183
184
185
} const_attr;

/** SymConst attributes. */
186
typedef struct symconst_attr {
187
	symconst_symbol sym;  // old tori
188
	symconst_kind   kind;
189
190
191
} symconst_attr;

/** Sel attributes. */
192
typedef struct sel_attr {
193
	ir_entity *entity;    /**< entity to select */
194
195
196
} sel_attr;

/** Exception attributes. */
197
typedef struct except_attr {
198
199
200
201
202
203
	op_pin_state   pin_state;     /**< the pin state for operations that might generate a exception:
									 If it's know that no exception will be generated, could be set to
									 op_pin_state_floats. */
} except_attr;

/** Call attributes. */
204
typedef struct call_attr {
205
206
207
208
	except_attr exc;               /**< the exception attribute. MUST be the first one. */
	ir_type     *type;             /**< type of called procedure */
	ir_entity   **callee_arr;      /**< result of callee analysis */
	unsigned    tail_call:1;       /**< if set, can be a tail call */
209
210
} call_attr;

211
/** Builtin attributes. */
212
typedef struct builtin_attr {
213
214
	except_attr     exc;           /**< the exception attribute. MUST be the first one. */
	ir_builtin_kind kind;          /**< kind of the called builtin procedure */
215
	ir_type         *type;         /**< type of called builtin procedure */
216
217
} builtin_attr;

218
/** Alloc attributes. */
219
typedef struct alloc_attr {
220
	except_attr    exc;           /**< the exception attribute. MUST be the first one. */
221
222
    ir_where_alloc where;         /**< stack, heap or other managed part of memory */
	ir_type        *type;         /**< Type of the allocated object.  */
223
224
225
} alloc_attr;

/** Free attributes. */
226
typedef struct free_attr {
227
	ir_type *type;                /**< Type of the allocated object.  */
228
	ir_where_alloc where;         /**< stack, heap or other managed part of memory */
229
230
231
} free_attr;

/** InstOf attributes. */
232
typedef struct io_attr {
233
234
235
236
237
	except_attr    exc;           /**< the exception attribute. MUST be the first one. */
	ir_type *type;                /**< the type of which the object pointer must be */
} io_attr;

/** Cast attributes. */
238
typedef struct cast_attr {
239
	ir_type *type;                /**< Type of the casted node. */
240
241
242
} cast_attr;

/** Load attributes. */
243
typedef struct load_attr {
244
	except_attr   exc;            /**< The exception attribute. MUST be the first one. */
245
246
    unsigned      volatility:1;   /**< The volatility of this Load operation. */
    unsigned      aligned:1;      /**< The align attribute of this Load operation. */
247
	ir_mode       *mode;          /**< The mode of this Load operation. */
248
249
250
} load_attr;

/** Store attributes. */
251
typedef struct store_attr {
252
	except_attr   exc;            /**< the exception attribute. MUST be the first one. */
Michael Beck's avatar
Michael Beck committed
253
254
	unsigned      volatility:1;   /**< The volatility of this Store operation. */
	unsigned      aligned:1;      /**< The align attribute of this Store operation. */
255
256
} store_attr;

257
typedef struct phi_attr {
258
259
	ir_node        *next;         /**< Points to the next Phi in the Phi list of a block. */
	union {
260
		bitset_t      *backedge;     /**< Raw Bitfield: bit n is set to true if pred n is backedge. */
261
262
263
264
265
266
267
268
269
		int            pos;           /**< For Phi0. Used to remember the value defined by
		                               this Phi node.  Needed when the Phi is completed
		                               to call get_r_internal_value() to find the
		                               predecessors. If this attribute is set, the Phi
		                               node takes the role of the obsolete Phi0 node,
		                               therefore the name. */
	} u;
} phi_attr;

270
271
272
273
/**< Cmp attribute. */
typedef struct cmp_attr {
	ir_relation relation;         /**< comparison condition. */
} cmp_attr;
274
275

/**< Confirm attribute. */
276
typedef struct confirm_attr {
277
	ir_relation relation;         /**< relation between value and bound */
278
279
280
} confirm_attr;

/** CopyB attribute. */
281
typedef struct copyb_attr {
282
	except_attr    exc;           /**< The exception attribute. MUST be the first one. */
283
	ir_type        *type;         /**< Type of the copied entity. */
284
285
286
} copyb_attr;

/** Bound attribute. */
287
typedef struct bound_attr {
288
289
290
291
	except_attr exc;              /**< The exception attribute. MUST be the first one. */
} bound_attr;

/** Conv attribute. */
292
typedef struct conv_attr {
293
294
295
	char           strict;        /**< If set, this is a strict Conv that cannot be removed. */
} conv_attr;

296
297
/** Div attribute. */
typedef struct div_attr {
298
	except_attr    exc;           /**< The exception attribute. MUST be the first one. */
299
	ir_mode        *resmode;      /**< Result mode for the division. */
300
	char           no_remainder;  /**< Set, if known that a division can be done without a remainder. */
301
302
303
304
305
306
307
} div_attr;

/** Mod attribute. */
typedef struct mod_attr {
	except_attr    exc;           /**< The exception attribute. MUST be the first one. */
	ir_mode        *resmode;      /**< Result mode for the division. */
} mod_attr;
308
309

/** Inline Assembler support attribute. */
310
typedef struct asm_attr {
311
	/* BEWARE: pin state MUST be the first attribute */
312
313
314
315
316
	op_pin_state      pin_state;            /**< the pin state for operations that might generate a exception */
	ident             *text;                /**< The inline assembler text. */
	ir_asm_constraint *input_constraints;   /**< Input constraints. */
	ir_asm_constraint *output_constraints;  /**< Output constraints. */
	ident             **clobbers;           /**< List of clobbered registers. */
317
318
} asm_attr;

319
320
321
322
typedef struct proj_attr {
	long  proj;           /**< position of tuple sub-value which is projected */
} proj_attr;

323
324
/** Some IR-nodes just have one attribute, these are stored here,
   some have more. Their name is 'irnodename_attr' */
325
typedef union ir_attr {
326
	irg_attr       irg;           /**< For Blocks and Bad: its belonging irg */
327
	bad_attr       bad;           /**< for Bads: irg reference */
328
	anchor_attr    anchor;        /**< for Anchor: irg reference */
329
	block_attr     block;         /**< For Block: Fields needed to construct it */
330
	cmp_attr       cmp;           /**< For Cmp. */
331
332
333
334
	cond_attr      cond;          /**< For Cond. */
	const_attr     con;           /**< For Const: contains the value of the constant and a type */
	symconst_attr  symc;          /**< For SymConst. */
	sel_attr       sel;           /**< For Sel. */
335
336
	call_attr      call;          /**< For Call. */
	builtin_attr   builtin;       /**< For Builtin. */
337
338
339
340
341
342
	alloc_attr     alloc;         /**< For Alloc. */
	free_attr      free;          /**< For Free. */
	io_attr        instof;        /**< For InstOf */
	cast_attr      cast;          /**< For Cast. */
	load_attr      load;          /**< For Load. */
	store_attr     store;         /**< For Store. */
343
	phi_attr       phi;           /**< For Phi. */
344
	proj_attr      proj;          /**< For Proj. */
345
346
347
348
349
	confirm_attr   confirm;       /**< For Confirm: compare operation and region. */
	except_attr    except;        /**< For Phi node construction in case of exceptions */
	copyb_attr     copyb;         /**< For CopyB operation */
	bound_attr     bound;         /**< For Bound operation */
	conv_attr      conv;          /**< For Conv operation */
350
351
	div_attr       div;           /**< For Div operation */
	mod_attr       mod;           /**< For Mod operation */
352
	asm_attr       assem;         /**< For ASM operation. */
353
} ir_attr;
354
355
356
357

/**
 * Edge info to put into an irn.
 */
358
typedef struct irn_edge_kind_info_t {
359
	struct list_head outs_head;  /**< The list of all outs. */
Michael Beck's avatar
Michael Beck committed
360
361
	unsigned edges_built : 1;    /**< Set edges where built for this node. */
	unsigned out_count : 31;     /**< Number of outs in the list. */
362
363
364
365
} irn_edge_info_t;

typedef irn_edge_info_t irn_edges_info_t[EDGE_KIND_LAST];

366
367
368
/**
 * A Def-Use edge.
 */
369
typedef struct ir_def_use_edge {
370
371
372
373
	ir_node *use;            /** The use node of that edge. */
	int     pos;             /** The position of this edge in use's input array. */
} ir_def_use_edge;

374
375
376
377
378
379
380
/**
 * The common structure of an irnode.
 * If the node has some attributes, they are stored in the attr field.
 */
struct ir_node {
	/* ------- Basics of the representation  ------- */
	firm_kind kind;          /**< Distinguishes this node from others. */
Michael Beck's avatar
Michael Beck committed
381
	unsigned node_idx;       /**< The node index of this node in its graph. */
382
383
384
	ir_op *op;               /**< The Opcode of this node. */
	ir_mode *mode;           /**< The Mode of this node. */
	struct ir_node **in;     /**< The array of predecessors / operands. */
385
	ir_visited_t visited;    /**< The visited counter for walks of the graph. */
386
	void *link;              /**< To attach additional information to the node, e.g.
Michael Beck's avatar
Michael Beck committed
387
	                              used during optimization to link to nodes that
388
	                              shall replace a node. */
389
	long node_nr;            /**< A globally unique node number for each node. */
390
	/* ------- Fields for optimizations / analysis information ------- */
391
	ir_def_use_edge *out;    /**< array of def-use edges. */
392
393
394
	struct dbg_info *dbi;    /**< A pointer to information for debug support. */
	/* ------- For debugging ------- */
#ifdef DEBUG_libfirm
395
396
	unsigned out_valid : 1;
	unsigned flags     : 31;
397
398
399
400
#endif
	/* ------- For analyses -------- */
	ir_loop *loop;           /**< the loop the node is in. Access routines in irloop.h */
	struct ir_node **deps;   /**< Additional dependencies induced by state. */
401
	void            *backend_info;
402
	irn_edges_info_t edge_info;  /**< Everlasting out edges. */
403

404
	/* ------- Opcode depending fields -------- */
405
	ir_attr attr;            /**< The set of attributes of this node. Depends on opcode.
406
407
408
	                              Must be last field of struct ir_node. */
};

409
410
#include "iredgeset.h"

411
412
413
/**
 * Edge info to put into an irg.
 */
414
typedef struct irg_edge_info_t {
415
416
417
418
419
	ir_edgeset_t     edges;          /**< A set containing all edges of the current graph. */
	struct list_head free_edges;     /**< list of all free edges. */
	struct obstack   edges_obst;     /**< Obstack, where edges are allocated on. */
	unsigned         allocated : 1;  /**< Set if edges are allocated on the obstack. */
	unsigned         activated : 1;  /**< Set if edges are activated for the graph. */
420
421
422
423
424
} irg_edge_info_t;

typedef irg_edge_info_t irg_edges_info_t[EDGE_KIND_LAST];

/**
425
 * Index constants for nodes that can be accessed through the graph anchor node.
426
427
 */
enum irg_anchors {
428
429
	anchor_end_block = 0,    /**< block the end node will belong to, same as Anchors block */
	anchor_start_block,      /**< block the start node will belong to */
430
	anchor_end,              /**< end node of this ir_graph */
431
	anchor_start,            /**< start node of this ir_graph */
432
433
	anchor_initial_exec,     /**< methods initial control flow */
	anchor_frame,            /**< methods frame */
434
435
436
437
438
439
440
	anchor_tls,              /**< pointer to the thread local storage containing all
	                              thread local data. */
	anchor_initial_mem,      /**< initial memory of this graph */
	anchor_args,             /**< methods arguments */
	anchor_bad,              /**< bad node of this ir_graph, the one and
	                              only in this graph */
	anchor_no_mem,           /**< NoMem node of this ir_graph, the one and only in this graph */
441
	anchor_last
442
443
444
445
446
447
};

/** A callgraph entry for callees. */
typedef struct cg_callee_entry {
	ir_graph  *irg;        /**< The called irg. */
	ir_node  **call_list;  /**< The list of all calls to the irg. */
448
	size_t     max_depth;  /**< Maximum depth of all Call nodes to irg. */
449
450
451
452
453
454
455
456
} cg_callee_entry;

/**
 * An ir_graph holds all information for a procedure.
 */
struct ir_graph {
	firm_kind         kind;        /**< Always set to k_ir_graph. */
	/* --  Basics of the representation -- */
457
    unsigned last_node_idx;        /**< The last IR node index for this graph. */
458
459
460
461
462
	ir_entity  *ent;               /**< The entity of this procedure, i.e.,
	                                    the type of the procedure and the
	                                    class it belongs to. */
	ir_type *frame_type;           /**< A class type representing the stack frame.
	                                    Can include "inner" methods. */
463
	ir_node *anchor;               /**< Pointer to the anchor node of this graph. */
464
465
466
467
468
	struct obstack *obst;          /**< The obstack where all of the ir_nodes live. */
	ir_node *current_block;        /**< Current block for newly gen_*()-erated ir_nodes. */
	struct obstack *extbb_obst;    /**< The obstack for extended basic block info. */

	/* -- Fields for graph properties -- */
469
470
	irg_inline_property        inline_property;       /**< How to handle inlineing. */
	mtp_additional_properties  additional_properties; /**< Additional graph properties. */
471
472

	/* -- Fields indicating different states of irgraph -- */
473
474
475
476
477
478
479
	ir_graph_state_t      state;
	irg_phase_state       phase_state;       /**< Compiler phase. */
	op_pin_state          irg_pinned_state;  /**< Flag for status of nodes. */
	irg_outs_state        outs_state;        /**< Out edges. */
	irg_dom_state         dom_state;         /**< Dominator state information. */
	irg_dom_state         pdom_state;        /**< Post Dominator state information. */
	ir_typeinfo_state     typeinfo_state;    /**< Validity of type information. */
480
	irg_callee_info_state callee_info_state; /**< Validity of callee information. */
481
482
	irg_loopinfo_state    loopinfo_state;    /**< State of loop information. */
	ir_class_cast_state   class_cast_state;  /**< Kind of cast operations in code. */
483
	irg_extblk_info_state extblk_state;      /**< State of extended basic block info. */
484
	exec_freq_state       execfreq_state;    /**< Execution frequency state. */
485
	ir_entity_usage_computed_state entity_usage_state;
486
487
488
489
490
491
492
493
494
495
496
	unsigned mem_disambig_opt;               /**< Options for the memory disambiguator. */
	unsigned fp_model;                       /**< floating point model of the graph. */

	/* -- Fields for construction -- */
	int n_loc;                         /**< Number of local variables in this
	                                        procedure including procedure parameters. */
	void **loc_descriptions;           /**< Storage for local variable descriptions. */

	/* -- Fields for optimizations / analysis information -- */
	pset *value_table;                 /**< Hash table for global value numbering (cse)
	                                        for optimizing use in iropt.c */
497
	ir_def_use_edge *outs;             /**< Space for the Def-Use arrays. */
498
499
500
501
502
503

	ir_loop *loop;                     /**< The outermost loop for this graph. */
	void *link;                        /**< A void* field to link any information to
	                                        the node. */

	ir_graph **callers;                /**< For callgraph analysis: list of caller graphs. */
Michael Beck's avatar
Michael Beck committed
504
	unsigned *caller_isbe;             /**< For callgraph analysis: raw bitset if backedge info calculated. */
505
	cg_callee_entry **callees;         /**< For callgraph analysis: list of callee calls */
Michael Beck's avatar
Michael Beck committed
506
	unsigned *callee_isbe;             /**< For callgraph analysis: raw bitset if backedge info calculated. */
507
	ir_loop   *l;                            /**< For callgraph analysis. */
508
509
	size_t     callgraph_loop_depth;         /**< For callgraph analysis */
	size_t     callgraph_recursion_depth;    /**< For callgraph analysis */
510
511
512
513
	double     method_execution_frequency;   /**< For callgraph analysis */


	/* -- Fields for Walking the graph -- */
514
	ir_visited_t visited;             /**< this flag is an identifier for
515
516
517
	                  ir walk. it will be incremented
	                  every time someone walks through
	                  the graph */
518
	ir_visited_t block_visited;        /**< same as visited, for a complete block */
519

520
	ir_visited_t self_visited;         /**< visited flag of the irg */
521

522
523
524
525
526
	unsigned estimated_node_count;     /**< estimated number of nodes in this graph,
	                                        updated after every walk */
	irg_edges_info_t edge_info;        /**< edge info for automatic outs */
	ir_node **idx_irn_map;             /**< Array mapping node indexes to nodes. */

Matthias Braun's avatar
Matthias Braun committed
527
	int index;                         /**< a unique number for each graph */
528
	ir_phase *phases[PHASE_LAST+1];    /**< Phase information. */
529
	void     *be_data;                 /**< backend can put in private data here */
530
531

	unsigned  dump_nr;                 /**< number of graph dumps */
532
#ifdef DEBUG_libfirm
Matthias Braun's avatar
Matthias Braun committed
533
534
535
	int   n_outs;                      /**< Size wasted for outs */
	long graph_nr;                     /**< a unique graph number for each
	                                        graph to make output readable. */
536
537
538
#endif

#ifndef NDEBUG
539
	ir_resources_t reserved_resources; /**< Bitset for tracking used local resources. */
540
541
542
#endif
};

543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
/**
 * Data structure that holds central information about a program
 * or a module.
 * One irp is created by libFirm on construction, so irp should never be NULL.
 *
 * - main_irg:  The ir graph that is the entry point to the program.
 *              (Anything not reachable from here may be optimized away
 *              if this irp represents a whole program.
 * - irg:       List of all ir graphs in the program or module.
 * - type:      A list containing all types known to the translated program.
 *              Some types can have several entries in this list (as a result of
 *              using exchange_types()).
 * - glob_type: The unique global type that is owner of all global entities
 *              of this module.
 */
558
559
560
561
562
563
564
565
566
567
struct ir_prog {
	firm_kind kind;                 /**< must be k_ir_prog */
	ident     *name;                /**< A file name or the like. */
	ir_graph  *main_irg;            /**< The entry point to the compiled program
	                                     or NULL if no point exists. */
	ir_graph **graphs;              /**< A list of all graphs in the ir. */
	ir_graph  *const_code_irg;      /**< This ir graph gives the proper environment
	                                     to allocate nodes the represent values
	                                     of constant entities. It is not meant as
	                                     a procedure.  */
568
	ir_type   *segment_types[IR_SEGMENT_LAST+1];
569
570
571
	ir_type  **types;               /**< A list of all types in the ir. */
	ir_mode  **modes;               /**< A list of all modes in the ir. */
	ir_op    **opcodes;             /**< A list of all opcodes in the ir. */
572
	ident    **global_asms;         /**< An array of global ASM insertions. */
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590

	/* -- states of and access to generated information -- */
	irg_phase_state phase_state;    /**< The state of construction. */

	irg_outs_state outs_state;      /**< The state of out edges of ir nodes. */
	ir_node **ip_outedges;          /**< A huge Array that contains all out edges
	                                     in interprocedural view. */
	irg_outs_state trouts_state;    /**< The state of out edges of type information. */

	irg_callee_info_state callee_info_state; /**< Validity of callee information.
	                                              Contains the lowest value or all irgs.  */
	ir_typeinfo_state typeinfo_state;    /**< Validity of type information. */
	inh_transitive_closure_state inh_trans_closure_state;  /**< State of transitive closure
	                                                            of inheritance relations. */

	irp_callgraph_state callgraph_state; /**< The state of the callgraph. */
	ir_loop *outermost_cg_loop;          /**< For callgraph analysis: entry point
	                                              to looptree over callgraph. */
591
592
	size_t max_callgraph_loop_depth;        /**< needed in callgraph. */
	size_t max_callgraph_recursion_depth;   /**< needed in callgraph. */
593
594
595
596
597
	double max_method_execution_frequency;  /**< needed in callgraph. */
	irp_temperature_state temperature_state; /**< accumulated temperatures computed? */
	exec_freq_state execfreq_state;      /**< The state of execution frequency information */
	loop_nesting_depth_state lnd_state;  /**< The state of loop nesting depth information. */
	ir_class_cast_state class_cast_state;    /**< The state of cast operations in code. */
598
	ir_entity_usage_computed_state globals_entity_usage_state;
599
600

	ir_exc_region_t last_region_nr;      /**< The last exception region number that was assigned. */
601
	ir_label_t last_label_nr;            /**< The highest label number for generating unique labels. */
Matthias Braun's avatar
Matthias Braun committed
602
	int  max_irg_idx;                    /**< highest unused irg index */
603
	long max_node_nr;                    /**< to generate unique numbers for nodes. */
604
	unsigned dump_nr;                    /**< number of program info dumps */
605
606
607
#ifndef NDEBUG
	ir_resources_t reserved_resources;   /**< Bitset for tracking used global resources. */
#endif
608
609
610
};

#endif