irnode.h 57.3 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
/*
 * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
 *
 * 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.
 */

Matthias Braun's avatar
Matthias Braun committed
20
21
22
23
24
/**
 * @file
 * @brief   Representation of an intermediate operation.
 * @author  Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
 * @version $Id$
Michael Beck's avatar
Michael Beck committed
25
 */
Matthias Braun's avatar
Matthias Braun committed
26
27
#ifndef FIRM_IR_IRNODE_H
#define FIRM_IR_IRNODE_H
Christian Schäfer's avatar
Christian Schäfer committed
28

29
30
#include <stddef.h>

Michael Beck's avatar
Michael Beck committed
31
#include "firm_common.h"
32
#include "typerep.h"
Michael Beck's avatar
Michael Beck committed
33
34
#include "irop.h"
#include "irmode.h"
Christian Schäfer's avatar
Christian Schäfer committed
35

Michael Beck's avatar
Michael Beck committed
36
37
/**
 * @file irnode.h
Götz Lindenmaier's avatar
Götz Lindenmaier committed
38
 *
Michael Beck's avatar
Michael Beck committed
39
 * @author Martin Trapp, Christian Schaefer
Götz Lindenmaier's avatar
Götz Lindenmaier committed
40
 *
Michael Beck's avatar
Michael Beck committed
41
42
43
44
45
46
 * Declarations of an ir node.
 */

/**
 * @defgroup ir_node Declarations of an ir node.
 *
47
 * The type definition of ir_node is also in irgraph.h to resolve
Michael Beck's avatar
Michael Beck committed
48
 *  recursion between irnode.h and irgraph.h
Götz Lindenmaier's avatar
Götz Lindenmaier committed
49
 *
Michael Beck's avatar
Michael Beck committed
50
 * ir_node - a datatype representing a Firm node
Götz Lindenmaier's avatar
Götz Lindenmaier committed
51
 *
Michael Beck's avatar
Michael Beck committed
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
 *  The common fields are:
 *
 *  - firm_kind - A firm_kind tag containing k_type.  This is useful
 *                for dynamically checking whether a node is a ir_node.
 *  - arity     - The number of predecessors in the Firm graph.
 *  - in        - A list with the predecessors in the Firm graph.  There are
 *                routines to access individual elements and to obtain the
 *                array.  The method returning the array should not be used.
 *  - mode      - The mode of the node.  There are routines to get the mode
 *                but also to access the mode's fields directly.
 *  - opcode    - The opcode of the node. There are routines to get the opcode
 *                but also to access the opcode's fields directly.
 *  - node_nr   - A unique number for the node.  Available only if debugging
 *                is turned on.
 * @{
Götz Lindenmaier's avatar
Götz Lindenmaier committed
67
 */
Michael Beck's avatar
Michael Beck committed
68

Sebastian Felis's avatar
Sebastian Felis committed
69
/**
Michael Beck's avatar
Michael Beck committed
70
71
72
 *   you can work on the graph without considering the different types
 *   of nodes, it's just a big graph.
 */
Christian Schäfer's avatar
Christian Schäfer committed
73

Sebastian Felis's avatar
Sebastian Felis committed
74
75
76
/**
 *   Checks whether a pointer points to a ir node.
 *
77
78
 *   @param thing   an arbitrary pointer
 *   @return        non-zero if the thing is a ir mode, else zero
Sebastian Felis's avatar
Sebastian Felis committed
79
 */
80
int is_ir_node (const void *thing);
Sebastian Felis's avatar
Sebastian Felis committed
81

82
83
84
85
86
/**
 * Returns the number of predecessors without the block predecessor.
 *
 * @param node   the IR-node
 */
87
88
89
int get_irn_arity      (const ir_node *node);
int get_irn_intra_arity(const ir_node *node);
int get_irn_inter_arity(const ir_node *node);
Michael Beck's avatar
Michael Beck committed
90
91

/** Replaces the old in array by a new one that will contain the ins given in
92
   the parameters.  Conserves the block predecessor.  It copies the array passed.
93
   This function is necessary to adjust in arrays of blocks, calls and phis.
94
   Assumes that current_ir_graph is set to the graph containing "node".
95
96
   "in" must contain all predecessors except the block that are required for
   the nodes opcode. */
97
void set_irn_in(ir_node *node, int arity, ir_node *in[]);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
98

Christian Schäfer's avatar
Christian Schäfer committed
99
100
101
/* to iterate through the predecessors without touching the array. No
   order of predecessors guaranteed.
   To iterate over the operands iterate from 0 to i < get_irn_arity(),
Götz Lindenmaier's avatar
Götz Lindenmaier committed
102
   to iterate including the Block predecessor iterate from i = -1 to
Christian Schäfer's avatar
Christian Schäfer committed
103
   i < get_irn_arity. */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
104
/* Access predecessor n */
105
106
107
108

/**
 * Get the n-th predecessor of a node.
 * This function removes Id predecessors.
Michael Beck's avatar
Michael Beck committed
109
 * This function automatically handles intra- and interprocedural views.
110
 */
111
ir_node *get_irn_n(const ir_node *node, int n);
Michael Beck's avatar
Michael Beck committed
112

Sebastian Hack's avatar
Sebastian Hack committed
113
114
115
116
117
118
119
120
121
122
123
/**
* Add a artificial dependency to the node.
* The dependency is only inserted if it is not there already.
* @param node The node.
* @param dep  The dependency target.
* @return The index in the array (get_irn_dep() with that index returns @p dep).
*/
int add_irn_dep(ir_node *node, ir_node *dep);

/**
 * Copy all dependencies from a node to another.
124
 * @param tgt The node which should be enriched.
Sebastian Hack's avatar
Sebastian Hack committed
125
126
127
128
129
 * @param src The node whose dependencies shall be copied.
 */
void add_irn_deps(ir_node *tgt, ir_node *src);

/**
Michael Beck's avatar
Michael Beck committed
130
131
132
133
 * Get the length of the dependency array.
 * @param node The node.
 * @return The length of the dependency array or 0 if it has not yet been allocated.
 */
Sebastian Hack's avatar
Sebastian Hack committed
134
135
136
int get_irn_deps(const ir_node *node);

/**
Michael Beck's avatar
Michael Beck committed
137
138
139
140
141
 * Get an entry of the dependency array.
 * @param node The node.
 * @param pos  The position.
 * @return The node at that position.
 */
Sebastian Hack's avatar
Sebastian Hack committed
142
143
144
ir_node *get_irn_dep(const ir_node *node, int pos);

/**
Michael Beck's avatar
Michael Beck committed
145
146
147
148
149
 * Set an entry of the dependency array.
 * @param node The node.
 * @param pos  The position.
 * @param dep  The dependency target.
 */
Sebastian Hack's avatar
Sebastian Hack committed
150
151
152
void set_irn_dep(ir_node *node, int pos, ir_node *dep);


Michael Beck's avatar
Michael Beck committed
153
154
155
156
/**
 * Get the n-th predecessor of a node in intraprocedural view.
 * Can be used always if it's know that node is not a split one.
 */
157
ir_node *get_irn_intra_n(const ir_node *node, int n);
Michael Beck's avatar
Michael Beck committed
158
159
160
161

/**
 * Get the n-th predecessor of a node in interprocedural view.
 */
162
ir_node *get_irn_inter_n(const ir_node *node, int n);
163
164

/** Replace the n-th predecessor of a node with a new one. */
165
void set_irn_n(ir_node *node, int n, ir_node *in);
166
167
168
169
170
171
/**
 * Appends a new predecessor to a node. This only works for nodes with
 * variable arity!
 * @returns   the number of the new input
 */
int add_irn_n(ir_node *node, ir_node *in);
172
/* Sets the mode struct of node.  */
173
void set_irn_mode(ir_node *node, ir_mode *mode);
174
/** Gets the mode struct of a node.  */
175
ir_mode *get_irn_mode(const ir_node *node);
Michael Beck's avatar
Michael Beck committed
176
/** Gets the mode-enum modecode. */
177
modecode get_irn_modecode(const ir_node *node);
Michael Beck's avatar
Michael Beck committed
178
/** Gets the ident for a string representation of the mode .*/
179
ident *get_irn_modeident(const ir_node *node);
180
/** Gets the string representation of the mode .*/
181
const char *get_irn_modename(const ir_node *node);
182
/** Gets the opcode struct of the node. */
183
ir_op *get_irn_op(const ir_node *node);
Michael Beck's avatar
Michael Beck committed
184
/** Sets the opcode struct of the node. */
185
void set_irn_op(ir_node *node, ir_op *op);
Michael Beck's avatar
Michael Beck committed
186
/** Gets the opcode-enum of the node. */
Matthias Braun's avatar
Matthias Braun committed
187
unsigned get_irn_opcode(const ir_node *node);
Michael Beck's avatar
Michael Beck committed
188
/** Get the string representation of the opcode. */
189
const char *get_irn_opname(const ir_node *node);
Michael Beck's avatar
Michael Beck committed
190
/** Get the ident for a string representation of the opcode. */
191
ident *get_irn_opident(const ir_node *node);
192
/** If arg is an argument of the node, returns it's position, -1 otherwise */
193
int get_irn_pred_pos(ir_node *node, ir_node *arg);
194
/** Gets the visited counter of a node. */
195
unsigned long get_irn_visited(const ir_node *node);
196
/** Sets the visited counter of a node. */
197
void set_irn_visited(ir_node *node, unsigned long visited);
Michael Beck's avatar
Michael Beck committed
198
/** Sets visited to get_irg_visited(current_ir_graph). */
199
void mark_irn_visited(ir_node *node);
200
/** Returns 1 if visited < get_irg_visited(current_ir_graph). */
201
int irn_not_visited(const ir_node *node);
202
/** Returns 1 if visited >= get_irg_visited(current_ir_graph). */
203
int irn_visited(const ir_node *node);
204
205
206
207
208

/**
 * Sets the link of a node.
 * Only allowed if the graph is NOT in phase_building.
 */
209
void set_irn_link(ir_node *node, void *link);
210
211

/** Returns the link of a node.  */
212
void *get_irn_link(const ir_node *node);
213

214
/** Returns the ir_graph this node belongs to. */
215
ir_graph *get_irn_irg(const ir_node *node);
Michael Beck's avatar
Michael Beck committed
216

217
/** Outputs a unique number for this node if libFIRM is compiled for
218
219
   debugging, (configure with --enable-debug) else returns address
   of node cast to long. */
220
long get_irn_node_nr(const ir_node *node);
Michael Beck's avatar
Michael Beck committed
221

222
223
224
225
226
227
228
/** Returns the pinned state of a node.
 *
 *  Returns whether the node _always_ must be pinned.
 *  I.e., the node is not floating after global cse.
 *
 * @returns Either state op_pin_state_pinned or op_pin_state_floats.
 */
229
op_pin_state get_irn_pinned(const ir_node *node);
Michael Beck's avatar
Michael Beck committed
230
231
232

/** Set pin state for nodes with op pin state op_pin_state_exc_pinned */
void set_irn_pinned(ir_node *node, op_pin_state state);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
233

234
235
236
237
238
239
/** Returns whether the node is currently pinned.
 *
 * If get_irn_pinned returns op_pin_state_floats and the graph the
 * node belongs to is in state op_poin_state_floats then this function
 * returns 'floats', else 'pinned'.
 */
240
op_pin_state is_irn_pinned_in_irg(const ir_node *node);
241

Michael Beck's avatar
Michael Beck committed
242
/**
243
244
245
246
 * IR node constructor.
 * Create a new IR node in irg, with an op, mode, arity and
 * some incoming IR nodes.
 * This constructor is used in every specific IR node constructor.
247
248
249
 *
 * @param db    Debug info.
 * @param irg   IR-graph on with this new node should be constructed.
Michael Beck's avatar
Michael Beck committed
250
 * @param block The block the new node belongs to
251
252
 * @param op    The opcode of the new node.
 * @param mode  The mode of the new node.
253
 * @param arity The arity of the new node, <0 if can be changed dynamically.
254
 * @param in    An array of arity predecessor nodes.
Michael Beck's avatar
Michael Beck committed
255
 */
256
ir_node *
257
new_ir_node(dbg_info *db,
Florian Liekweg's avatar
Florian Liekweg committed
258
259
260
261
262
263
         ir_graph *irg,
         ir_node *block,
         ir_op *op,
         ir_mode *mode,
         int arity,
         ir_node *in[]);
Christian Schäfer's avatar
Christian Schäfer committed
264

265
266
267
268
269
/**
 * Return the block the node belongs to.  This is only
 * possible for pinned nodes or if the graph is in pinned state.
 * Otherwise the block may be incorrect.  This condition is
 * now checked by an assertion.
Götz Lindenmaier's avatar
Götz Lindenmaier committed
270
271
272
273
274
 *
 * This works for all except Block.  It can return Blocks or the Bad node.
 *
 * To express the difference to access routines that work for all
 * nodes we use infix "nodes" and do not name this function
275
 * get_irn_block(). */
Sebastian Hack's avatar
Sebastian Hack committed
276
ir_node  *get_nodes_block (const ir_node *node);
Michael Beck's avatar
Michael Beck committed
277
278

/** Sets the Block of a node. */
279
void      set_nodes_block (ir_node *node, ir_node *block);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
280

Götz Lindenmaier's avatar
Götz Lindenmaier committed
281
/**
Michael Beck's avatar
Michael Beck committed
282
 * @function get_irn_block()
283
 * @see get_nodes_block()
Götz Lindenmaier's avatar
Götz Lindenmaier committed
284
 */
285

286
287
288
289
/**
 * Projection numbers for result of Start node: use for Proj nodes!
 */
typedef enum {
Michael Beck's avatar
Michael Beck committed
290
291
292
293
294
295
296
297
298
299
300
301
	pn_Start_X_initial_exec,   /**< Projection on the initial control flow. */
	pn_Start_M,                /**< Projection on the initial memory. */
	pn_Start_P_frame_base,     /**< Projection on the frame base pointer. */
	pn_Start_P_globals,        /**< Projection on the pointer to the data segment
	                                containing _all_ global entities.  Use for
	                                position independent data/code access. */
	pn_Start_P_tls,            /**< Projection on the pointer to the thread local store
	                                segment containing _all_thread local variables. */
	pn_Start_T_args,           /**< Projection on all arguments. */
	pn_Start_P_value_arg_base, /**< Pointer to region of compound value arguments as defined by
	                                type of this method. */
	pn_Start_max               /**< number of projections from a Start */
302
303
} pn_Start; /* Projection numbers for Start. */

304
305
306
307
/** Test whether arbitrary node is frame pointer.
 *
 * Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
 * from Start.  If so returns frame type, else Null. */
Michael Beck's avatar
Michael Beck committed
308
ir_type *is_frame_pointer(ir_node *n);
309
310
311
312
313

/** Test whether arbitrary node is globals pointer.
 *
 * Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals)
 * from Start.  If so returns global type, else Null. */
Michael Beck's avatar
Michael Beck committed
314
ir_type *is_globals_pointer(ir_node *n);
315

316
317
318
319
320
321
/** Test whether arbitrary node is tls pointer.
 *
 * Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
 * from Start.  If so returns tls type, else Null. */
ir_type *is_tls_pointer(ir_node *n);

322
323
324
325
326
327
/** Test whether arbitrary node is value arg base.
 *
 * Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
 * from Start.   If so returns 1, else 0. */
int   is_value_arg_pointer(ir_node *n);

Götz Lindenmaier's avatar
Götz Lindenmaier committed
328

329
/* @@@ no more supported  */
330
331
332
333
ir_node **get_Block_cfgpred_arr(ir_node *node);
int       get_Block_n_cfgpreds(const ir_node *node);
ir_node  *get_Block_cfgpred(ir_node *node, int pos);
void      set_Block_cfgpred(ir_node *node, int pos, ir_node *pred);
334
335
/** Get the predecessor block.
 *
336
 *  Returns the block corresponding to the predecessor pos of block.
337
338
339
340
341
342
343
344
345
 *
 *  There are several ambiguities we resolve with this function:
 *  - The direct predecessor can be a Proj, which is not pinned.
 *    We walk from the predecessor to the next pinned node
 *    (skip_Proj) and return the block that node is in.
 *  - If we encounter the Bad node, this function does not return
 *    Start, but the Bad node.
 */
ir_node  *get_Block_cfgpred_block(ir_node *node, int pos);
346
347
int       get_Block_matured(ir_node *node);
void      set_Block_matured(ir_node *node, int matured);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
348
349
350

/** A visited flag only for block nodes.
 *  @see also: get_irn_visited() inc_irg_visited() inc_irg_block_visited()*/
Matthias Braun's avatar
Matthias Braun committed
351
unsigned long get_Block_block_visited(const ir_node *node);
352
void      set_Block_block_visited(ir_node *node, unsigned long visit);
353
354
355
356
357

/**
 * Marks a block as dead but do not replace it with a Bad node.
 * Dead blocks are removed in the con
 */
358
359
360
ir_node  *set_Block_dead(ir_node *block);
int       is_Block_dead(const ir_node *block);

Götz Lindenmaier's avatar
Götz Lindenmaier committed
361
/* For this current_ir_graph must be set. */
362
void      mark_Block_block_visited(ir_node *node);
Matthias Braun's avatar
Matthias Braun committed
363
364
int       Block_not_block_visited(const ir_node *node);
int       Block_block_visited(const ir_node *node);
Christian Schäfer's avatar
Christian Schäfer committed
365

366
367
/* Set and remove interprocedural predecessors. If the interprocedural
 * predecessors are removed, the node has the same predecessors in
368
369
 * both views.
 * @@@ Maybe better:  arity is zero if no cg preds. */
Michael Beck's avatar
Michael Beck committed
370
void      set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]);
371
void      set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred);
372
/* @@@ not supported */
373
ir_node **get_Block_cg_cfgpred_arr(ir_node *node);
Michael Beck's avatar
Michael Beck committed
374
/** Returns the number of interprocedural predecessors.  0 if none. */
375
int       get_Block_cg_n_cfgpreds(ir_node *node);
Michael Beck's avatar
Michael Beck committed
376
/** Return the interprocedural predecessor at position pos. */
377
378
379
380
ir_node  *get_Block_cg_cfgpred(ir_node *node, int pos);
/** Frees the memory allocated for interprocedural predecessors. */
void      remove_Block_cg_cfgpred_arr(ir_node *node);
/** Returns the extended basic block a block belongs to. */
381
ir_extblk *get_Block_extbb(const ir_node *block);
382
/** Sets the extended basic block a block belongs to. */
383
void set_Block_extbb(ir_node *block, ir_extblk *extblk);
Michael Beck's avatar
Michael Beck committed
384
385
/** Get the Macro Block header of a (sub-) block. */
ir_node *get_Block_MacroBlock(const ir_node *block);
386
387
/** Returns the ir_graph this Block belongs to. */
ir_graph *get_Block_irg(const ir_node *block);
Michael Beck's avatar
Michael Beck committed
388
389
390
391
392
393
/** Returns non-zero if the block has an assigned label. */
int has_Block_label(const ir_node *block);
/** Returns the label of a Block. */
ir_label_t get_Block_label(const ir_node *block);
/** Sets a label to a block. */
void set_Block_label(ir_node *block, ir_label_t label);
Michael Beck's avatar
Michael Beck committed
394

Michael Beck's avatar
Michael Beck committed
395
/** Return the number of Keep alive node. */
396
int  get_End_n_keepalives(ir_node *end);
Michael Beck's avatar
Michael Beck committed
397
/** Return the Keep alive node a position pos. */
398
ir_node *get_End_keepalive(ir_node *end, int pos);
Michael Beck's avatar
Michael Beck committed
399
/** Keep alive dedicated nodes.  These must be either PhiM or Block nodes. */
400
void add_End_keepalive(ir_node *end, ir_node *ka);
Michael Beck's avatar
Michael Beck committed
401
/** Set the Keep alive node at position pos. */
402
void set_End_keepalive(ir_node *end, int pos, ir_node *ka);
403
/** Set new keep-alives. */
404
void set_End_keepalives(ir_node *end, int n, ir_node *in[]);
405
/** Set new keep-alives from old keep-alives, skipping irn. */
406
407
void remove_End_keepalive(ir_node *end, ir_node *irn);

Michael Beck's avatar
Michael Beck committed
408
/** Some parts of the End node are allocated separately -- their memory
409
   is not recovered by dead_node_elimination if a End node is dead.
Michael Beck's avatar
Michael Beck committed
410
   free_End() frees these data structures. */
411
void free_End(ir_node *end);
412

413
414
415
416
/** Return the target address of an IJmp */
ir_node *get_IJmp_target(ir_node *ijmp);
/** Sets the target address of an IJmp */
void set_IJmp_target(ir_node *ijmp, ir_node *tgt);
417

418
419
420
421
422
423
424
425
/* We distinguish three kinds of Cond nodes.  These can be distinguished
   by the mode of the selector operand and an internal flag of type cond_kind.
   First we distinguish binary Conds and switch Conds.
   A binary Cond has as selector a boolean value.  Proj(0) projects the control
   flow for case "False", Proj(1) the control flow for "True".  A binary Cond
   is recognized by the boolean selector.
   The switch Cond has as selector an unsigned integer.  It produces as result
   an n+1 Tuple (cf0, ... , cfn) of control flows.
426
   We differ two flavors of this Cond.  The first, the dense Cond, passes
427
428
   control along output i if the selector value is i, 0 <= i <= n.  If the
   selector value is >n it passes control along output n.
429
   The second Cond flavor differences in the treatment of cases not specified in
430
431
432
433
434
   the source program.  It magically knows about the existence of Proj nodes.
   It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
   exists.  Else it passes control along output n (even if this Proj does not
   exist.)  This Cond we call "fragmentary".  There is a special constructor
   new_defaultProj that automatically sets the flavor.
435
436
   The two switch flavors are distinguished by a flag of type cond_kind.
   Default flavor is "dense"
437
438
*/
typedef enum {
Michael Beck's avatar
Michael Beck committed
439
440
441
	dense,        /**< Default. Missing Proj nodes are dead control flow. */
	fragmentary   /**< Special. No control flow optimizations allowed.  Missing
	                   Proj nodes mean default control flow, i.e., Proj(n). */
442
443
} cond_kind;

444
445
446
447
448
ir_node  *get_Cond_selector(ir_node *node);
void      set_Cond_selector(ir_node *node, ir_node *selector);
cond_kind get_Cond_kind(ir_node *node);
void      set_Cond_kind(ir_node *node, cond_kind kind);
long      get_Cond_defaultProj(ir_node *node);
Christian Schäfer's avatar
Christian Schäfer committed
449

450
451
452
/**
 * Projection numbers for conditions.
 */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
453
typedef enum {
Michael Beck's avatar
Michael Beck committed
454
455
456
	pn_Cond_false,    /**< Control flow if operand is "false". */
	pn_Cond_true,     /**< Control flow if operand is "true".  */
	pn_Cond_max       /**< number of projections from a Cond */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
457
458
} pn_Cond;  /* Projection numbers for Cond. */

459
460
461
462
463
464
ir_node  *get_Return_mem(ir_node *node);
void      set_Return_mem(ir_node *node, ir_node *mem);
ir_node **get_Return_res_arr(ir_node *node);
int       get_Return_n_ress(ir_node *node);
ir_node  *get_Return_res(ir_node *node, int pos);
void      set_Return_res(ir_node *node, int pos, ir_node *res);
Christian Schäfer's avatar
Christian Schäfer committed
465

466
467
468
/**
 * Possible classes for constant classification.
 */
Sebastian Hack's avatar
Sebastian Hack committed
469
typedef enum {
Michael Beck's avatar
Michael Beck committed
470
471
472
473
474
475
	CNST_NULL     =  0, /**< The node is a const(0). */
	CNST_ONE      = +1, /**< The node is a const(1). */
	CNST_ALL_ONE  = -1, /**< The node is a const(11111...). */
	CNST_OTHER    =  2, /**< The tarval of the const has another value. */
	CNST_SYMCONST =  3, /**< The node is symconst. */
	CNST_NO_CONST =  4  /**< The node is no const at all. */
Sebastian Hack's avatar
Sebastian Hack committed
476
477
} cnst_classify_t;

Christoph Mallon's avatar
Christoph Mallon committed
478
tarval  *get_Const_tarval(const ir_node *node);
479
void     set_Const_tarval(ir_node *node, tarval *con);
Michael Beck's avatar
Michael Beck committed
480

Sebastian Hack's avatar
Sebastian Hack committed
481
482
483
484
485
486
487
/**
 * Classify a node concerning constant properties.
 * @param irn A node to check for.
 * @return Constant properties of that node.
 */
cnst_classify_t classify_Const(ir_node *irn);

Michael Beck's avatar
Michael Beck committed
488
489
490
/** Returns the source language type of a Const node.
 * Must be an atomic type.  Mode of type must be mode of node.
 */
491
ir_type  *get_Const_type(ir_node *node);
Michael Beck's avatar
Michael Beck committed
492
493

/** Sets the source language type of a Const node. */
494
void     set_Const_type(ir_node *node, ir_type *tp);
Christian Schäfer's avatar
Christian Schäfer committed
495

Michael Beck's avatar
Michael Beck committed
496
/**  This enum names the three different kinds of symbolic Constants
Götz Lindenmaier's avatar
Götz Lindenmaier committed
497
498
499
500
     represented by SymConst.  The content of the attribute type_or_id
     depends on this tag.  Use the proper access routine after testing
     this flag. */
typedef enum {
Michael Beck's avatar
Michael Beck committed
501
502
503
504
505
506
507
508
509
510
511
512
513
514
	symconst_type_tag,    /**< The SymConst is a type tag for the given type.
	                           symconst_symbol is type *. */
	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_name,   /**< The SymConst is a symbolic pointer to be filled in
	                           by the linker.  The pointer is represented by a string.
	                           symconst_symbol is ident *. */
	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. */
Michael Beck's avatar
Michael Beck committed
515
	symconst_enum_const,  /**< The SymConst is a enumeration constant of an
Michael Beck's avatar
Michael Beck committed
516
	                           enumeration type. */
Michael Beck's avatar
Michael Beck committed
517
	symconst_label        /**< The SymConst is a label address. */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
518
} symconst_kind;
519

520
521
522
523
524
525
526
/** Returns non-zero if s symconst kind has a type attribute */
#define SYMCONST_HAS_TYPE(kind) ((kind) <= symconst_type_align)

/** Returns non-zero if s symconst kind has an ident attribute */
#define SYMCONST_HAS_ID(kind) ((kind) == symconst_addr_name)

/** Returns non-zero if s symconst kind has an entity attribute */
527
#define SYMCONST_HAS_ENT(kind) ((kind) == symconst_addr_ent || (kind) == symconst_ofs_ent)
528

529
530
531
/** Returns non-zero if s symconst kind has an enum_const attribute */
#define SYMCONST_HAS_ENUM(kind) ((kind) == symconst_enum_const)

Michael Beck's avatar
Michael Beck committed
532
533
534
/** Returns non-zero if s symconst kind has a label attribute */
#define SYMCONST_HAS_LABEL(kind) ((kind) == symconst_label)

Götz Lindenmaier's avatar
Götz Lindenmaier committed
535
536
/** SymConst attribute.
 *
537
538
 *  This union contains the symbolic information represented by the node.
 */
539
typedef union symconst_symbol {
Michael Beck's avatar
Michael Beck committed
540
541
542
543
544
	ir_type       *type_p;    /**< The type of a SymConst. */
	ident         *ident_p;   /**< The ident of a SymConst. */
	ir_entity     *entity_p;  /**< The entity of a SymConst. */
	ir_enum_const *enum_p;    /**< The enumeration constant of a SymConst. */
	ir_label_t    label;      /**< The label of a SymConst. */
545
} symconst_symbol;
546

Michael Beck's avatar
Michael Beck committed
547
/** Get the kind of the SymConst. */
548
symconst_kind get_SymConst_kind(const ir_node *node);
Michael Beck's avatar
Michael Beck committed
549
/** Set the kind of the SymConst. */
550
void          set_SymConst_kind(ir_node *node, symconst_kind num);
Beyhan's avatar
Beyhan committed
551
552

/** Only to access SymConst of kind type_tag or size.  Else assertion: */
553
554
ir_type  *get_SymConst_type(ir_node *node);
void     set_SymConst_type(ir_node *node, ir_type *tp);
Beyhan's avatar
Beyhan committed
555
556

/** Only to access SymConst of kind addr_name.  Else assertion: */
Michael Beck's avatar
Michael Beck committed
557
ident   *get_SymConst_name(const ir_node *node);
558
void     set_SymConst_name(ir_node *node, ident *name);
Beyhan's avatar
Beyhan committed
559
560

/** Only to access SymConst of kind addr_ent.  Else assertion: */
Michael Beck's avatar
Michael Beck committed
561
ir_entity *get_SymConst_entity(const ir_node *node);
562
void       set_SymConst_entity(ir_node *node, ir_entity *ent);
Beyhan's avatar
Beyhan committed
563

564
/** Only to access SymConst of kind symconst_enum_const.  Else assertion: */
Michael Beck's avatar
Michael Beck committed
565
ir_enum_const *get_SymConst_enum(const ir_node *node);
566
void           set_SymConst_enum(ir_node *node, ir_enum_const *ec);
567

Beyhan's avatar
Beyhan committed
568
569
/** Sets both: type and ptrinfo.  Needed to treat the node independent of
   its semantics.  Does a memcpy for the memory sym points to. */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
570
/* write 'union': firmjni then does not create a method... */
Michael Beck's avatar
Michael Beck committed
571
union symconst_symbol get_SymConst_symbol(const ir_node *node);
572
573
void                  set_SymConst_symbol(ir_node *node,
                                          union symconst_symbol sym);
574

Michael Beck's avatar
Michael Beck committed
575
576
577
578
579
/** Only to access SymConst of kind symconst_label.  Else assertion: */
ir_label_t get_SymConst_label(const ir_node *node);
void       set_SymConst_label(ir_node *node, ir_label_t label);


Götz Lindenmaier's avatar
Götz Lindenmaier committed
580
581
582
/** Access the type of the value represented by the SymConst.
 *
 *  Example: primitive type int for SymConst size. */
583
584
585
ir_type *get_SymConst_value_type(ir_node *node);
void    set_SymConst_value_type(ir_node *node, ir_type *tp);

586
587
588
589
590
591
592
593
594
595
ir_node   *get_Sel_mem(ir_node *node);
void       set_Sel_mem(ir_node *node, ir_node *mem);
ir_node   *get_Sel_ptr(ir_node *node);  /* ptr to the object to select from */
void       set_Sel_ptr(ir_node *node, ir_node *ptr);
ir_node   **get_Sel_index_arr(ir_node *node);
int        get_Sel_n_indexs(ir_node *node);
ir_node   *get_Sel_index(ir_node *node, int pos);
void       set_Sel_index(ir_node *node, int pos, ir_node *index);
ir_entity *get_Sel_entity(ir_node *node); /* entity to select */
void       set_Sel_entity (ir_node *node, ir_entity *ent);
Christian Schäfer's avatar
Christian Schäfer committed
596

597
598
599
/**
 * Projection numbers for result of Call node: use for Proj nodes!
 */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
600
typedef enum {
Michael Beck's avatar
Michael Beck committed
601
602
603
604
605
606
607
608
609
	pn_Call_M_regular = 0,       /**< The memory result. */
	pn_Call_X_regular = 1,       /**< The control flow result when no exception occurs. */
	pn_Call_X_except  = 2,       /**< The control flow result branching to the exception handler. */
	pn_Call_T_result  = 3,       /**< The tuple containing all (0, 1, 2, ...) results. */
	pn_Call_M_except  = 4,       /**< The memory result in case the called method terminated with
	                                  an exception. */
	pn_Call_P_value_res_base = 5,/**< A pointer to the memory region containing copied results
	                                  passed by value (for compound result types). */
	pn_Call_max       = 6        /**< number of projections from a Call */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
610
} pn_Call;   /* Projection numbers for Call. */
611
#define pn_Call_M pn_Call_M_regular
Götz Lindenmaier's avatar
Götz Lindenmaier committed
612

613
614
615
616
617
ir_node *get_Call_mem(ir_node *node);
void     set_Call_mem(ir_node *node, ir_node *mem);
ir_node *get_Call_ptr(ir_node *node);
void     set_Call_ptr(ir_node *node, ir_node *ptr);
ir_node **get_Call_param_arr(ir_node *node);
Michael Beck's avatar
Michael Beck committed
618
/** Gets the number of parameters of a call. */
619
int      get_Call_n_params(ir_node *node);
Michael Beck's avatar
Michael Beck committed
620
/** Gets the call parameter at position pos. */
621
ir_node *get_Call_param(ir_node *node, int pos);
Michael Beck's avatar
Michael Beck committed
622
/** Sets the call parameter at position pos. */
623
void     set_Call_param(ir_node *node, int pos, ir_node *param);
Michael Beck's avatar
Michael Beck committed
624
/** Gets the type of a call. */
625
ir_type *get_Call_type(ir_node *node);
Michael Beck's avatar
Michael Beck committed
626
/** Sets the type of a call. */
627
void     set_Call_type(ir_node *node, ir_type *tp);
Michael Beck's avatar
Michael Beck committed
628
/** Gets the arity of a call. Identical to get_Call_n_params(). */
629
int      get_Call_arity(ir_node *node);
630

631
632
633
634
/** Set, get and remove the callee information for a Call node.
 *
 *  The callee information lists all method entities that can be called
 *  from this node.  If the address expression can not be analyzed fully,
Götz Lindenmaier's avatar
Götz Lindenmaier committed
635
636
637
638
 *  e.g., as entities can be called that are not in the compilation unit,
 *  the array contains the unknown_entity.  The array contains only entities
 *  with peculiarity_existent, but with all kinds of visibility.  The entities
 *  not necessarily contain an irg.
639
640
641
642
643
644
645
646
647
 *
 *  The array is only accessible if callee information is valid.  See flag
 *  in graph.
 *
 *  The memory allocated for the array is managed automatically, i.e., it must
 *  not be freed if the Call node is removed from the graph.
 *
 *  @param node A Call node.
 */
648
649
650
int        Call_has_callees(ir_node *node);
int        get_Call_n_callees(ir_node *node);
ir_entity *get_Call_callee(ir_node *node, int pos);
Michael Beck's avatar
Michael Beck committed
651

652
653
654
/** Set the full callee array.
 *
 *  The passed array is copied. Assumes current_ir_graph set properly! */
655
void    set_Call_callee_arr(ir_node *node, const int n, ir_entity **arr);
656
void    remove_Call_callee_arr(ir_node *node);
657

658
659
660
661
ir_node  *get_CallBegin_ptr(ir_node *node);
void      set_CallBegin_ptr(ir_node *node, ir_node *ptr);
ir_node  *get_CallBegin_call(ir_node *node);
void      set_CallBegin_call(ir_node *node, ir_node *call);
662

Christian Schäfer's avatar
Christian Schäfer committed
663
664
665
/* For unary and binary arithmetic operations the access to the
   operands can be factored out.  Left is the first, right the
   second arithmetic value  as listed in tech report 1999-44.
Götz Lindenmaier's avatar
Götz Lindenmaier committed
666
   unops are: Minus, Abs, Not, Conv, Cast
Christian Schäfer's avatar
Christian Schäfer committed
667
668
   binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
   Shr, Shrs, Rot, Cmp */
669
int      is_unop(const ir_node *node);
670
ir_node *get_unop_op(const ir_node *node);
671
672
void     set_unop_op(ir_node *node, ir_node *op);
int      is_binop(const ir_node *node);
673
ir_node *get_binop_left(const ir_node *node);
674
void     set_binop_left(ir_node *node, ir_node *left);
675
ir_node *get_binop_right(const ir_node *node);
676
677
void     set_binop_right(ir_node *node, ir_node *right);

678
ir_node *get_Add_left(const ir_node *node);
679
void     set_Add_left(ir_node *node, ir_node *left);
680
ir_node *get_Add_right(const ir_node *node);
681
682
void     set_Add_right(ir_node *node, ir_node *right);

683
ir_node *get_Sub_left(const ir_node *node);
684
void     set_Sub_left(ir_node *node, ir_node *left);
685
ir_node *get_Sub_right(const ir_node *node);
686
687
void     set_Sub_right(ir_node *node, ir_node *right);

688
ir_node *get_Minus_op(const ir_node *node);
689
690
void     set_Minus_op(ir_node *node, ir_node *op);

691
ir_node *get_Mul_left(const ir_node *node);
692
void     set_Mul_left(ir_node *node, ir_node *left);
693
ir_node *get_Mul_right(const ir_node *node);
694
695
void     set_Mul_right(ir_node *node, ir_node *right);

Michael Beck's avatar
Michael Beck committed
696
697
698
699
700
ir_node *get_Mulh_left(const ir_node *node);
void     set_Mulh_left(ir_node *node, ir_node *left);
ir_node *get_Mulh_right(const ir_node *node);
void     set_Mulh_right(ir_node *node, ir_node *right);

701
ir_node *get_Quot_left(const ir_node *node);
702
void     set_Quot_left(ir_node *node, ir_node *left);
703
ir_node *get_Quot_right(const ir_node *node);
704
705
706
void     set_Quot_right(ir_node *node, ir_node *right);
ir_node *get_Quot_mem(ir_node *node);
void     set_Quot_mem(ir_node *node, ir_node *mem);
707
708
ir_mode *get_Quot_resmode(const ir_node *node);
void     set_Quot_resmode(ir_node *node, ir_mode *mode);
709

710
711
712
/**
 * Projection numbers for Quot: use for Proj nodes!
 */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
713
typedef enum {
Michael Beck's avatar
Michael Beck committed
714
715
716
717
718
	pn_Quot_M,           /**< Memory result. */
	pn_Quot_X_regular,   /**< Execution result if no exception occurred. */
	pn_Quot_X_except,    /**< Execution result if exception occurred. */
	pn_Quot_res,         /**< Result of computation. */
	pn_Quot_max          /**< number of projections from a Quot */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
719
720
} pn_Quot;  /* Projection numbers for Quot. */

721
ir_node *get_DivMod_left(const ir_node *node);
722
void     set_DivMod_left(ir_node *node, ir_node *left);
723
ir_node *get_DivMod_right(const ir_node *node);
724
725
726
void     set_DivMod_right(ir_node *node, ir_node *right);
ir_node *get_DivMod_mem(ir_node *node);
void     set_DivMod_mem(ir_node *node, ir_node *mem);
727
728
ir_mode *get_DivMod_resmode(const ir_node *node);
void     set_DivMod_resmode(ir_node *node, ir_mode *mode);
729

730
731
732
/**
 * Projection numbers for DivMod: use for Proj nodes!
 */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
733
typedef enum {
Michael Beck's avatar
Michael Beck committed
734
735
736
737
738
739
	pn_DivMod_M,           /**< Memory result. */
	pn_DivMod_X_regular,   /**< Execution result if no exception occurred. */
	pn_DivMod_X_except,    /**< Execution result if exception occurred. */
	pn_DivMod_res_div,     /**< Result of computation a / b. */
	pn_DivMod_res_mod,     /**< Result of computation a % b. */
	pn_DivMod_max          /**< number of projections from a DivMod */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
740
741
} pn_DivMod;  /* Projection numbers for DivMod. */

742
ir_node *get_Div_left(const ir_node *node);
743
void     set_Div_left(ir_node *node, ir_node *left);
744
ir_node *get_Div_right(const ir_node *node);
745
746
747
void     set_Div_right(ir_node *node, ir_node *right);
ir_node *get_Div_mem(ir_node *node);
void     set_Div_mem(ir_node *node, ir_node *mem);
748
749
ir_mode *get_Div_resmode(const ir_node *node);
void     set_Div_resmode(ir_node *node, ir_mode *mode);
750

751
752
753
/**
 * Projection numbers for Div: use for Proj nodes!
 */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
754
typedef enum {
Michael Beck's avatar
Michael Beck committed
755
756
757
758
759
	pn_Div_M,           /**< Memory result. */
	pn_Div_X_regular,   /**< Execution result if no exception occurred. */
	pn_Div_X_except,    /**< Execution result if exception occurred. */
	pn_Div_res,         /**< Result of computation. */
	pn_Div_max          /**< number of projections from a Div */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
760
761
} pn_Div;  /* Projection numbers for Div. */

762
ir_node *get_Mod_left(const ir_node *node);
763
void     set_Mod_left(ir_node *node, ir_node *left);
764
ir_node *get_Mod_right(const ir_node *node);
765
766
767
void     set_Mod_right(ir_node *node, ir_node *right);
ir_node *get_Mod_mem(ir_node *node);
void     set_Mod_mem(ir_node *node, ir_node *mem);
768
769
ir_mode *get_Mod_resmode(const ir_node *node);
void     set_Mod_resmode(ir_node *node, ir_mode *mode);
770

771
772
773
/**
 * Projection numbers for Mod: use for Proj nodes!
 */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
774
typedef enum {
Michael Beck's avatar
Michael Beck committed
775
776
777
778
779
	pn_Mod_M,           /**< Memory result.    */
	pn_Mod_X_regular,   /**< Execution result if no exception occurred. */
	pn_Mod_X_except,    /**< Execution result if exception occurred. */
	pn_Mod_res,         /**< Result of computation. */
	pn_Mod_max          /**< number of projections from a Mod */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
780
781
} pn_Mod;  /* Projection numbers for Mod. */

782
ir_node *get_Abs_op(const ir_node *node);
783
void     set_Abs_op(ir_node *node, ir_node *op);
784

785
ir_node *get_And_left(const ir_node *node);
786
void     set_And_left(ir_node *node, ir_node *left);
787
ir_node *get_And_right(const ir_node *node);
788
void     set_And_right(ir_node *node, ir_node *right);
789

790
ir_node *get_Or_left(const ir_node *node);
791
void     set_Or_left(ir_node *node, ir_node *left);
792
ir_node *get_Or_right(const ir_node *node);
793
void     set_Or_right(ir_node *node, ir_node *right);
794

795
ir_node *get_Eor_left(const ir_node *node);
796
void     set_Eor_left(ir_node *node, ir_node *left);
797
ir_node *get_Eor_right(const ir_node *node);
798
void     set_Eor_right(ir_node *node, ir_node *right);
799

800
ir_node *get_Not_op(const ir_node *node);
801
void     set_Not_op(ir_node *node, ir_node *op);
Christian Schäfer's avatar
Christian Schäfer committed
802

803
804
/**
 * Projection numbers for Cmp are defined several times.
805
 * The bit patterns are used for various tests, so don't change.
806
807
 * The "unordered" values are possible results of comparing
 * floating point numbers.
Michael Beck's avatar
Michael Beck committed
808
 * Note that the encoding is imported, so do NOT change the order.
809
 */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
810
typedef enum {
Michael Beck's avatar
Michael Beck committed
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
	pn_Cmp_False = 0,                             /**< false */
	pn_Cmp_Eq    = 1,                             /**< equal */
	pn_Cmp_Lt    = 2,                             /**< less */
	pn_Cmp_Le    = pn_Cmp_Eq|pn_Cmp_Lt,           /**< less or equal */
	pn_Cmp_Gt    = 4,                             /**< greater */
	pn_Cmp_Ge    = pn_Cmp_Eq|pn_Cmp_Gt,           /**< greater or equal */
	pn_Cmp_Lg    = pn_Cmp_Lt|pn_Cmp_Gt,           /**< less or greater */
	pn_Cmp_Leg   = pn_Cmp_Lt|pn_Cmp_Eq|pn_Cmp_Gt, /**< less, equal or greater = ordered */
	pn_Cmp_Uo    = 8,                             /**< unordered */
	pn_Cmp_Ue    = pn_Cmp_Uo|pn_Cmp_Eq,           /**< unordered or equal */
	pn_Cmp_Ul    = pn_Cmp_Uo|pn_Cmp_Lt,           /**< unordered or less */
	pn_Cmp_Ule   = pn_Cmp_Uo|pn_Cmp_Eq|pn_Cmp_Lt, /**< unordered, less or equal */
	pn_Cmp_Ug    = pn_Cmp_Uo|pn_Cmp_Gt,           /**< unordered or greater */
	pn_Cmp_Uge   = pn_Cmp_Uo|pn_Cmp_Eq|pn_Cmp_Gt, /**< unordered, greater or equal */
	pn_Cmp_Ne    = pn_Cmp_Uo|pn_Cmp_Lt|pn_Cmp_Gt, /**< unordered, less or greater = not equal */
	pn_Cmp_True  = 15                             /**< true */
	/* not_mask = Leg*/   /* bits to flip to negate comparison * @@ hack for JNI interface */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
828
} pn_Cmp;   /* Projection numbers for Cmp */
829
/* #define not_mask pn_Cmp_Leg */
830

Michael Beck's avatar
Michael Beck committed
831
/** returns the pnc name from an pnc constant */
832
const char *get_pnc_string(int pnc);
Michael Beck's avatar
Michael Beck committed
833

834
/** Calculates the negated (Complement(R)) pnc condition. */
835
int         get_negated_pnc(int pnc, ir_mode *mode);
Michael Beck's avatar
Michael Beck committed
836

837
838
/** Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
int         get_inversed_pnc(int pnc);
Michael Beck's avatar
Michael Beck committed
839

840
841
842
/** An alternative name for get_inversed_pnc() that can be better memorized. */
#define get_mirrored_pnc(pnc)  get_inversed_pnc(pnc)

843
ir_node *get_Cmp_left(const ir_node *node);
844
void     set_Cmp_left(ir_node *node, ir_node *left);
845
ir_node *get_Cmp_right(const ir_node *node);
846
void     set_Cmp_right(ir_node *node, ir_node *right);
847

848
ir_node *get_Shl_left(const ir_node *node);
849
void     set_Shl_left(ir_node *node, ir_node *left);
850
ir_node *get_Shl_right(const ir_node *node);
851
void     set_Shl_right(ir_node *node, ir_node *right);
852

853
ir_node *get_Shr_left(const ir_node *node);
854
void     set_Shr_left(ir_node *node, ir_node *left);
855
ir_node *get_Shr_right(const ir_node *node);
856
void     set_Shr_right(ir_node *node, ir_node *right);
857

858
ir_node *get_Shrs_left(const ir_node *node);
859
void     set_Shrs_left(ir_node *node, ir_node *left);
860
ir_node *get_Shrs_right(const ir_node *node);
861
void     set_Shrs_right(ir_node *node, ir_node *right);
862

863
ir_node *get_Rot_left(const ir_node *node);
864
void     set_Rot_left(ir_node *node, ir_node *left);
865
ir_node *get_Rot_right(const ir_node *node);
866
void     set_Rot_right(ir_node *node, ir_node *right);
867

868
ir_node *get_Conv_op(const ir_node *node);
869
870
871
void     set_Conv_op(ir_node *node, ir_node *op);
int      get_Conv_strict(ir_node *node);
void     set_Conv_strict(ir_node *node, int flag);
872

Götz Lindenmaier's avatar
comment    
Götz Lindenmaier committed
873
874
/* Does Cast need a mem operator?
 * Cast should only depend on the type, not on the state of an
Michael Beck's avatar
Michael Beck committed
875
 * entity.  But:  we initialize various fields after Alloc, that
Götz Lindenmaier's avatar
comment    
Götz Lindenmaier committed
876
877
878
 * are accessed in the cast.  This required some precaution, to
 * get the right memory into the Loads generated from the cast.
 */
879
ir_node *get_Cast_op(const ir_node *node);
880
881
882
void     set_Cast_op(ir_node *node, ir_node *op);
ir_type *get_Cast_type(ir_node *node);
void     set_Cast_type(ir_node *node, ir_type *to_tp);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
883

Götz Lindenmaier's avatar
Götz Lindenmaier committed
884
885
886
887
/** Checks for upcast.
 *
 * Returns true if the Cast node casts a class type to a super type.
 * Works also for pointers to classes (recursively).
888
889
 *
 * Needs typeinfo calculated.
Götz Lindenmaier's avatar
Götz Lindenmaier committed
890
891
892
893
894
895
896
 */
int is_Cast_upcast(ir_node *node);

/** Checks for downcast.
 *
 * Returns true if the Cast node casts a class type to a sub type.
 * Works also for pointers to classes (recursively).
897
898
 *
 * Needs typeinfo calculated.
Götz Lindenmaier's avatar
Götz Lindenmaier committed
899
900
901
902
 */
int is_Cast_downcast(ir_node *node);


Götz Lindenmaier's avatar
Götz Lindenmaier committed
903
904
905
/** Returns true if n is Phi or Filter in interprocedural_view.
   Returns false if irg in phase building and the Phi has zero
   predecessors: it's a Phi0. */
906
int       is_Phi(const ir_node *n);