1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe 3 2002/02/28 13:33:52
10 /** Projection numbers of compare: use for Proj nodes! */
12 False = 0, /**< false */
15 Le, /**< less or equal */
17 Ge, /**< greater or equal */
18 Lg, /**< less or greater */
19 Leg = 7, /**< less, equal or greater = ordered */
21 Ue, /**< unordered or equal */
22 Ul, /**< unordered or less */
23 Ule, /**< unordered, less or equal */
24 Ug, /**< unordered or greater */
25 Uge, /**< unordered, greater or equal */
26 Ne, /**< unordered, less or greater = not equal */
27 True = 15 /**< true */
28 /* not_mask = Leg*/ /* bits to flip to negate comparison * @@ hack for jni interface */
35 # include "firm_common.h"
45 * @author Martin Trapp, Christian Schaefer
47 * Declarations of an ir node.
51 * @defgroup ir_node Declarations of an ir node.
53 * The type definiton of ir_node is also in irgraph.h to resolve
54 * recursion between irnode.h and irgraph.h
56 * ir_node - a datatype representing a Firm node
58 * The common fields are:
60 * - firm_kind - A firm_kind tag containing k_type. This is useful
61 * for dynamically checking whether a node is a ir_node.
62 * - arity - The number of predecessors in the Firm graph.
63 * - in - A list with the predecessors in the Firm graph. There are
64 * routines to access individual elements and to obtain the
65 * array. The method returning the array should not be used.
66 * - mode - The mode of the node. There are routines to get the mode
67 * but also to access the mode's fields directly.
68 * - opcode - The opcode of the node. There are routines to get the opcode
69 * but also to access the opcode's fields directly.
70 * - node_nr - A unique number for the node. Available only if debugging
75 #ifndef _IR_NODE_TYPEDEF_
76 #define _IR_NODE_TYPEDEF_
77 typedef struct ir_node ir_node;
81 * you can work on the graph without considering the different types
82 * of nodes, it's just a big graph.
86 * Checks whether a pointer points to a ir node.
88 * @param thing an arbitrary pointer
91 * true if the thing is a ir mode, else false
94 is_ir_node (void *thing);
96 /** returns the number of predecessors without the block predecessor: */
97 int get_irn_arity (const ir_node *node);
99 /** Replaces the old in array by a new one that will contain the ins given in
100 the parameters. Conserves the block predecessor. It copies the array passed.
101 This function is necessary to ajust in arrays of blocks, calls and phis.
102 Assumes that current_ir_graph is set to the graph containing "node".
103 "in" must contain all predecessors except the block that are required for
105 INLINE void set_irn_in (ir_node *node, int arity,
107 /* to iterate through the predecessors without touching the array. No
108 order of predecessors guaranteed.
109 To iterate over the operands iterate from 0 to i < get_irn_arity(),
110 to iterate including the Block predecessor iterate from i = -1 to
111 i < get_irn_arity. */
112 /* Access predecessor n */
113 /* get_irn_n removes Id predecessors. */
114 INLINE ir_node *get_irn_n (ir_node *node, int n);
115 INLINE void set_irn_n (ir_node *node, int n, ir_node *in);
116 /** Sets the mode struct of node */
117 INLINE void set_irn_mode (ir_node *node, ir_mode *mode);
118 /** Gets the mode struct. */
119 INLINE ir_mode *get_irn_mode (const ir_node *node);
120 /** Gets the mode-enum modecode. */
121 INLINE modecode get_irn_modecode (const ir_node *node);
122 /** Gets the ident for a string representation of the mode .*/
123 INLINE ident *get_irn_modeident (const ir_node *node);
124 /** Gets the opcode struct of the node */
125 INLINE ir_op *get_irn_op (const ir_node *node);
126 /** Sets the opcode struct of the node. */
127 INLINE void set_irn_op (ir_node *node, ir_op *op);
128 /** Gets the opcode-enum of the node. */
129 INLINE opcode get_irn_opcode (const ir_node *node);
130 /** Get the string representation of the opcode. */
131 INLINE const char *get_irn_opname (const ir_node *node);
132 /** Get the ident for a string representation of the opcode. */
133 INLINE ident *get_irn_opident (const ir_node *node);
134 INLINE unsigned long get_irn_visited (const ir_node *node);
135 INLINE void set_irn_visited (ir_node *node, unsigned long visited);
136 /** Sets visited to get_irg_visited(current_ir_graph). */
137 INLINE void mark_irn_visited (ir_node *node);
138 /** Returns 1 if visited < get_irg_visited(current_ir_graph). */
139 INLINE int irn_not_visited (const ir_node *node);
140 /** Returns 1 if visited >= get_irg_visited(current_ir_graph). */
141 INLINE int irn_visited (const ir_node *node);
142 INLINE void set_irn_link (ir_node *node, void *link);
143 INLINE void *get_irn_link (const ir_node *node);
145 /** Outputs a unique number for this node if libfirm is compiled for
146 debugging, (configure with --enable-debug) else returns 0. */
147 INLINE long get_irn_node_nr(const ir_node *node);
149 /** Returns the ir_graph this node belongs to. Only valid for
150 * CallBegin, EndReg, EndExcept and Start */
151 INLINE ir_graph *get_irn_irg(ir_node *node);
154 * irnode constructor.
155 * Create a new irnode in irg, with an op, mode, arity and
156 * some incoming irnodes.
157 * If arity is negative, a node with a dynamic array is created.
160 new_ir_node (dbg_info *db,
170 * NAME access functions for node fields.
172 * Not properly documented ;-)
176 /* this works for all except Block */
177 INLINE ir_node *get_nodes_Block (ir_node *node);
178 INLINE void set_nodes_Block (ir_node *node, ir_node *block);
180 /** Projection numbers for result of Start node: use for Proj nodes! */
182 pns_initial_exec, /**< Projection on an executable, the initial control
184 pns_global_store, /**< Projection on the global store */
185 pns_frame_base, /**< Projection on the frame base */
186 pns_globals, /**< Projection on the pointer to the data segment
187 containing _all_ global entities. */
188 pns_args, /**< Projection on all arguments */
189 pns_value_arg_base /**< Pointer to region of compound value arguments as defined by
190 type of this method. */
193 /* @@@ no more supported */
194 INLINE ir_node **get_Block_cfgpred_arr (ir_node *node);
195 int get_Block_n_cfgpreds (ir_node *node);
196 INLINE ir_node *get_Block_cfgpred (ir_node *node, int pos);
197 INLINE void set_Block_cfgpred (ir_node *node, int pos, ir_node *pred);
198 INLINE bool get_Block_matured (ir_node *node);
199 INLINE void set_Block_matured (ir_node *node, bool matured);
200 INLINE unsigned long get_Block_block_visited (ir_node *node);
201 INLINE void set_Block_block_visited (ir_node *node, unsigned long visit);
202 /* For this current_ir_graph must be set. */
203 INLINE void mark_Block_block_visited(ir_node *node);
204 INLINE int Block_not_block_visited(ir_node *node);
206 /* Set and remove interprocedural predecessors. If the interprocedural
207 * predecessors are removed, the node has the same predecessors in
209 * @@@ Maybe better: arity is zero if no cg preds. */
210 void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in);
211 void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred);
212 /* @@@ not supported */
213 ir_node **get_Block_cg_cfgpred_arr(ir_node * node);
214 /* Returns the number of interproc predecessors. 0 if none. */
215 int get_Block_cg_n_cfgpreds(ir_node * node);
216 ir_node *get_Block_cg_cfgpred(ir_node * node, int pos);
217 /* frees the memory. */
218 void remove_Block_cg_cfgpred_arr(ir_node * node);
220 /* Start references the irg it is in. */
221 ir_graph *get_Start_irg(ir_node *node);
222 void set_Start_irg(ir_node *node, ir_graph *irg);
224 INLINE int get_End_n_keepalives(ir_node *end);
225 INLINE ir_node *get_End_keepalive(ir_node *end, int pos);
226 INLINE void add_End_keepalive (ir_node *end, ir_node *ka);
227 INLINE void set_End_keepalive(ir_node *end, int pos, ir_node *ka);
228 /* Some parts of the End node are allocated seperately -- their memory
229 is not recovered by dead_node_elimination if a End node is dead.
230 free_End frees these data structures. */
231 INLINE void free_End (ir_node *end);
233 ir_graph *get_EndReg_irg (const ir_node *end);
234 ir_graph *get_EndExcept_irg (const ir_node *end);
236 /* We distinguish three kinds of Cond nodes. These can be distinguished
237 by the mode of the selector operand and an internal flag of type cond_kind.
238 First we distinguish binary Conds and switch Conds.
239 A binary Cond has as selector a boolean value. Proj(0) projects the control
240 flow for case "False", Proj(1) the control flow for "True". A binary Cond
241 is recognized by the boolean selector.
242 The switch Cond has as selector an unsigned integer. It produces as result
243 an n+1 Tuple (cf0, ... , cfn) of control flows.
244 We differ two flavours of this Cond. The first, the dense Cond, passes
245 control along output i if the selector value is i, 0 <= i <= n. If the
246 selector value is >n it passes control along output n.
247 The second Cond flavor differes in the treatment of cases not specified in
248 the source program. It magically knows about the existence of Proj nodes.
249 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
250 exists. Else it passes control along output n (even if this Proj does not
251 exist.) This Cond we call "fragmentary". There is a special constructor
252 new_defaultProj that automatically sets the flavor.
253 The two switch flavors are distinguished by a flag of type cond_kind.
254 Default flavor is "dense"
257 dense, /**< Default. Missing Proj nodes are dead control flow. */
258 fragmentary /**< Special. No control flow optimizations allowed. Missing
259 Proj nodes mean default control flow, i.e., Proj(n). */
262 INLINE ir_node *get_Cond_selector (ir_node *node);
263 INLINE void set_Cond_selector (ir_node *node, ir_node *selector);
264 INLINE cond_kind get_Cond_kind (ir_node *node);
265 INLINE void set_Cond_kind (ir_node *node, cond_kind kind);
267 INLINE ir_node *get_Return_mem (ir_node *node);
268 INLINE void set_Return_mem (ir_node *node, ir_node *mem);
269 INLINE ir_node **get_Return_res_arr (ir_node *node);
270 INLINE int get_Return_n_ress (ir_node *node);
271 INLINE ir_node *get_Return_res (ir_node *node, int pos);
272 INLINE void set_Return_res (ir_node *node, int pos, ir_node *res);
274 INLINE ir_node *get_Raise_mem (ir_node *node);
275 INLINE void set_Raise_mem (ir_node *node, ir_node *mem);
276 INLINE ir_node *get_Raise_exo_ptr (ir_node *node); /* PoinTeR to EXception Object */
277 INLINE void set_Raise_exo_ptr (ir_node *node, ir_node *exoptr);
279 INLINE tarval *get_Const_tarval (ir_node *node);
280 INLINE void set_Const_tarval (ir_node *node, tarval *con);
282 /** This enum names the three different kinds of symbolic Constants
283 represented by SymConst. The content of the attribute type_or_id
284 depends on this tag. Use the proper access routine after testing
287 type_tag, /**< The SymConst is a type tag for the given type.
288 Type_or_id_p is type *. */
289 size, /**< The SymConst is the size of the given type.
290 Type_or_id_p is type *. */
291 linkage_ptr_info /**< The SymConst is a symbolic pointer to be filled in
292 by the linker. Type_or_id_p is ident *. */
294 typedef union type_or_id * type_or_id_p;
295 INLINE symconst_kind get_SymConst_kind (const ir_node *node);
296 INLINE void set_SymConst_kind (ir_node *node, symconst_kind num);
297 /* Only to access SymConst of kind type_tag or size. Else assertion: */
298 INLINE type *get_SymConst_type (ir_node *node);
299 INLINE void set_SymConst_type (ir_node *node, type *tp);
300 /* Only to access SymConst of kind linkage_ptr_info. Else assertion: */
301 INLINE ident *get_SymConst_ptrinfo (ir_node *node);
302 INLINE void set_SymConst_ptrinfo (ir_node *node, ident *ptrinfo);
303 /* Sets both: type and ptrinfo. Needed to treat the node independent of
304 its semantics. Does a memcpy for the memory tori points to. */
305 INLINE type_or_id_p get_SymConst_type_or_id (ir_node *node);
306 INLINE void set_SymConst_type_or_id (ir_node *node, type_or_id_p tori);
308 INLINE ir_node *get_Sel_mem (ir_node *node);
309 INLINE void set_Sel_mem (ir_node *node, ir_node *mem);
310 INLINE ir_node *get_Sel_ptr (ir_node *node); /* ptr to the object to select from */
311 INLINE void set_Sel_ptr (ir_node *node, ir_node *ptr);
312 INLINE ir_node **get_Sel_index_arr (ir_node *node);
313 INLINE int get_Sel_n_indexs (ir_node *node);
314 INLINE ir_node *get_Sel_index (ir_node *node, int pos);
315 INLINE void set_Sel_index (ir_node *node, int pos, ir_node *index);
316 INLINE entity *get_Sel_entity (ir_node *node); /* entity to select */
317 INLINE void set_Sel_entity (ir_node *node, entity *ent);
319 /* @@@ ajacs specific node -- not supported */
320 type *get_InstOf_ent (ir_node *node);
321 void set_InstOf_ent (ir_node *node, type *ent);
322 ir_node *get_InstOf_obj (ir_node *node);
323 void set_InstOf_obj (ir_node *node, ir_node *obj);
324 ir_node *get_InstOf_store (ir_node *node);
325 void set_InstOf_store (ir_node *node, ir_node *obj);
327 INLINE ir_node *get_Call_mem (ir_node *node);
328 INLINE void set_Call_mem (ir_node *node, ir_node *mem);
329 INLINE ir_node *get_Call_ptr (ir_node *node);
330 INLINE void set_Call_ptr (ir_node *node, ir_node *ptr);
331 INLINE ir_node **get_Call_param_arr (ir_node *node);
332 /** Gets the number of parameters of a call. */
333 INLINE int get_Call_n_params (ir_node *node);
334 /** Gets the call parameter at position pos. */
335 INLINE ir_node *get_Call_param (ir_node *node, int pos);
336 /** Sets the call parameter at position pos. */
337 INLINE void set_Call_param (ir_node *node, int pos, ir_node *param);
338 /** Gets the type of a call. */
339 INLINE type *get_Call_type (ir_node *node);
340 /** Sets the type of a call. */
341 INLINE void set_Call_type (ir_node *node, type *tp);
342 /** Gets the arity of a call. Identical to get_Call_n_params(). */
343 INLINE int get_Call_arity (ir_node *node);
345 /* Set, get and remove the callee-analysis. */
346 int get_Call_n_callees(ir_node * node);
347 entity * get_Call_callee(ir_node * node, int pos);
348 void set_Call_callee_arr(ir_node * node, int n, entity ** arr);
349 void remove_Call_callee_arr(ir_node * node);
351 ir_node * get_CallBegin_ptr (ir_node *node);
352 void set_CallBegin_ptr (ir_node *node, ir_node *ptr);
353 ir_graph *get_CallBegin_irg (ir_node *node);
354 ir_node *get_CallBegin_call (ir_node *node);
355 void set_CallBegin_call (ir_node *node, ir_node *call);
357 /* For unary and binary arithmetic operations the access to the
358 operands can be factored out. Left is the first, right the
359 second arithmetic value as listed in tech report 1999-44.
360 unops are: Minus, Abs, Not, Conv, Cast
361 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
362 Shr, Shrs, Rot, Cmp */
363 INLINE int is_unop (ir_node *node);
364 INLINE ir_node *get_unop_op (ir_node *node);
365 INLINE void set_unop_op (ir_node *node, ir_node *op);
366 INLINE int is_binop (ir_node *node);
367 INLINE ir_node *get_binop_left (ir_node *node);
368 INLINE void set_binop_left (ir_node *node, ir_node *left);
369 INLINE ir_node *get_binop_right (ir_node *node);
370 INLINE void set_binop_right (ir_node *node, ir_node *right);
372 INLINE ir_node *get_Add_left (ir_node *node);
373 INLINE void set_Add_left (ir_node *node, ir_node *left);
374 INLINE ir_node *get_Add_right (ir_node *node);
375 INLINE void set_Add_right (ir_node *node, ir_node *right);
377 INLINE ir_node *get_Sub_left (ir_node *node);
378 INLINE void set_Sub_left (ir_node *node, ir_node *left);
379 INLINE ir_node *get_Sub_right (ir_node *node);
380 INLINE void set_Sub_right (ir_node *node, ir_node *right);
382 INLINE ir_node *get_Minus_op (ir_node *node);
383 INLINE void set_Minus_op (ir_node *node, ir_node *op);
385 INLINE ir_node *get_Mul_left (ir_node *node);
386 INLINE void set_Mul_left (ir_node *node, ir_node *left);
387 INLINE ir_node *get_Mul_right (ir_node *node);
388 INLINE void set_Mul_right (ir_node *node, ir_node *right);
390 INLINE ir_node *get_Quot_left (ir_node *node);
391 INLINE void set_Quot_left (ir_node *node, ir_node *left);
392 INLINE ir_node *get_Quot_right (ir_node *node);
393 INLINE void set_Quot_right (ir_node *node, ir_node *right);
394 INLINE ir_node *get_Quot_mem (ir_node *node);
395 INLINE void set_Quot_mem (ir_node *node, ir_node *mem);
397 INLINE ir_node *get_DivMod_left (ir_node *node);
398 INLINE void set_DivMod_left (ir_node *node, ir_node *left);
399 INLINE ir_node *get_DivMod_right (ir_node *node);
400 INLINE void set_DivMod_right (ir_node *node, ir_node *right);
401 INLINE ir_node *get_DivMod_mem (ir_node *node);
402 INLINE void set_DivMod_mem (ir_node *node, ir_node *mem);
404 INLINE ir_node *get_Div_left (ir_node *node);
405 INLINE void set_Div_left (ir_node *node, ir_node *left);
406 INLINE ir_node *get_Div_right (ir_node *node);
407 INLINE void set_Div_right (ir_node *node, ir_node *right);
408 INLINE ir_node *get_Div_mem (ir_node *node);
409 INLINE void set_Div_mem (ir_node *node, ir_node *mem);
411 INLINE ir_node *get_Mod_left (ir_node *node);
412 INLINE void set_Mod_left (ir_node *node, ir_node *left);
413 INLINE ir_node *get_Mod_right (ir_node *node);
414 INLINE void set_Mod_right (ir_node *node, ir_node *right);
415 INLINE ir_node *get_Mod_mem (ir_node *node);
416 INLINE void set_Mod_mem (ir_node *node, ir_node *mem);
418 INLINE ir_node *get_Abs_op (ir_node *node);
419 INLINE void set_Abs_op (ir_node *node, ir_node *op);
421 INLINE ir_node *get_And_left (ir_node *node);
422 INLINE void set_And_left (ir_node *node, ir_node *left);
423 INLINE ir_node *get_And_right (ir_node *node);
424 INLINE void set_And_right (ir_node *node, ir_node *right);
426 INLINE ir_node *get_Or_left (ir_node *node);
427 INLINE void set_Or_left (ir_node *node, ir_node *left);
428 INLINE ir_node *get_Or_right (ir_node *node);
429 INLINE void set_Or_right (ir_node *node, ir_node *right);
431 INLINE ir_node *get_Eor_left (ir_node *node);
432 INLINE void set_Eor_left (ir_node *node, ir_node *left);
433 INLINE ir_node *get_Eor_right (ir_node *node);
434 INLINE void set_Eor_right (ir_node *node, ir_node *right);
436 INLINE ir_node *get_Not_op (ir_node *node);
437 INLINE void set_Not_op (ir_node *node, ir_node *op);
439 INLINE const char *get_pnc_string(int pnc);
441 INLINE int get_negated_pnc(int pnc);
442 INLINE ir_node *get_Cmp_left (ir_node *node);
443 INLINE void set_Cmp_left (ir_node *node, ir_node *left);
444 INLINE ir_node *get_Cmp_right (ir_node *node);
445 INLINE void set_Cmp_right (ir_node *node, ir_node *right);
447 INLINE ir_node *get_Shl_left (ir_node *node);
448 INLINE void set_Shl_left (ir_node *node, ir_node *left);
449 INLINE ir_node *get_Shl_right (ir_node *node);
450 INLINE void set_Shl_right (ir_node *node, ir_node *right);
452 INLINE ir_node *get_Shr_left (ir_node *node);
453 INLINE void set_Shr_left (ir_node *node, ir_node *left);
454 INLINE ir_node *get_Shr_right (ir_node *node);
455 INLINE void set_Shr_right (ir_node *node, ir_node *right);
457 INLINE ir_node *get_Shrs_left (ir_node *node);
458 INLINE void set_Shrs_left (ir_node *node, ir_node *left);
459 INLINE ir_node *get_Shrs_right (ir_node *node);
460 INLINE void set_Shrs_right (ir_node *node, ir_node *right);
462 INLINE ir_node *get_Rot_left (ir_node *node);
463 INLINE void set_Rot_left (ir_node *node, ir_node *left);
464 INLINE ir_node *get_Rot_right (ir_node *node);
465 INLINE void set_Rot_right (ir_node *node, ir_node *right);
467 INLINE ir_node *get_Conv_op (ir_node *node);
468 INLINE void set_Conv_op (ir_node *node, ir_node *op);
470 INLINE ir_node *get_Cast_op (ir_node *node);
471 INLINE void set_Cast_op (ir_node *node, ir_node *op);
472 INLINE type *get_Cast_type (ir_node *node);
473 INLINE void set_Cast_type (ir_node *node, type *to_tp);
475 INLINE ir_node **get_Phi_preds_arr (ir_node *node);
476 INLINE int get_Phi_n_preds (ir_node *node);
477 INLINE ir_node *get_Phi_pred (ir_node *node, int pos);
478 INLINE void set_Phi_pred (ir_node *node, int pos, ir_node *pred);
480 INLINE ir_node *get_Filter_pred(ir_node *node);
481 INLINE void set_Filter_pred(ir_node *node, ir_node *pred);
482 INLINE long get_Filter_proj(ir_node *node);
483 INLINE void set_Filter_proj(ir_node *node, long proj);
484 /* set the interprocedural predecessors, ...d_arr uses current_ir_graph.
485 * @@@ Maybe better: arity is zero if no cg preds. */
486 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in);
487 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred);
488 int get_Filter_n_cg_preds(ir_node *node);
489 ir_node * get_Filter_cg_pred(ir_node *node, int pos);
491 INLINE ir_node *get_Load_mem (ir_node *node);
492 INLINE void set_Load_mem (ir_node *node, ir_node *mem);
493 INLINE ir_node *get_Load_ptr (ir_node *node);
494 INLINE void set_Load_ptr (ir_node *node, ir_node *ptr);
496 INLINE ir_node *get_Store_mem (ir_node *node);
497 INLINE void set_Store_mem (ir_node *node, ir_node *mem);
498 INLINE ir_node *get_Store_ptr (ir_node *node);
499 INLINE void set_Store_ptr (ir_node *node, ir_node *ptr);
500 INLINE ir_node *get_Store_value (ir_node *node);
501 INLINE void set_Store_value (ir_node *node, ir_node *value);
503 INLINE ir_node *get_Alloc_mem (ir_node *node);
504 INLINE void set_Alloc_mem (ir_node *node, ir_node *mem);
505 INLINE ir_node *get_Alloc_size (ir_node *node);
506 INLINE void set_Alloc_size (ir_node *node, ir_node *size);
507 INLINE type *get_Alloc_type (ir_node *node);
508 INLINE void set_Alloc_type (ir_node *node, type *tp);
510 /** allocation place. */
512 stack_alloc, /**< Alloc allocates the object on the stack. */
513 heap_alloc /**< Alloc allocates the object on the heap. */
516 INLINE where_alloc get_Alloc_where (ir_node *node);
517 INLINE void set_Alloc_where (ir_node *node, where_alloc where);
519 INLINE ir_node *get_Free_mem (ir_node *node);
520 INLINE void set_Free_mem (ir_node *node, ir_node *mem);
521 INLINE ir_node *get_Free_ptr (ir_node *node);
522 INLINE void set_Free_ptr (ir_node *node, ir_node *ptr);
523 INLINE ir_node *get_Free_size (ir_node *node);
524 INLINE void set_Free_size (ir_node *node, ir_node *size);
525 INLINE type *get_Free_type (ir_node *node);
526 INLINE void set_Free_type (ir_node *node, type *tp);
528 INLINE ir_node **get_Sync_preds_arr (ir_node *node);
529 INLINE int get_Sync_n_preds (ir_node *node);
530 INLINE ir_node *get_Sync_pred (ir_node *node, int pos);
531 INLINE void set_Sync_pred (ir_node *node, int pos, ir_node *pred);
533 INLINE ir_node *get_Proj_pred (ir_node *node);
534 INLINE void set_Proj_pred (ir_node *node, ir_node *pred);
535 INLINE long get_Proj_proj (ir_node *node);
536 INLINE void set_Proj_proj (ir_node *node, long proj);
538 INLINE ir_node **get_Tuple_preds_arr (ir_node *node);
539 INLINE int get_Tuple_n_preds (ir_node *node);
540 INLINE ir_node *get_Tuple_pred (ir_node *node, int pos);
541 INLINE void set_Tuple_pred (ir_node *node, int pos, ir_node *pred);
543 INLINE ir_node *get_Id_pred (ir_node *node);
544 INLINE void set_Id_pred (ir_node *node, ir_node *pred);
549 * NAME Auxiliary routines
551 * Not properly documented ;-)
555 /** returns operand of node if node is a Proj. */
556 INLINE ir_node *skip_Proj (ir_node *node);
557 /** returns operand of node if node is a Id */
558 INLINE ir_node *skip_nop (ir_node *node);
559 INLINE ir_node *skip_Id (ir_node *node); /* Same as skip_nop. */
560 /* returns corresponding operand of Tuple if node is a Proj from
562 INLINE ir_node *skip_Tuple (ir_node *node);
563 /** returns true if node is a Bad node. */
564 INLINE int is_Bad (ir_node *node);
565 /** returns true if the node is not a Block */
566 INLINE int is_no_Block (ir_node *node);
567 /** returns true if the node is a Block */
568 INLINE int is_Block (ir_node *node);
569 /** returns true if node is a Proj node or a Filter node in
570 * intraprocedural view */
571 INLINE int is_Proj (const ir_node *node);
572 /** Returns true if the operation manipulates control flow:
573 Start, End, Jmp, Cond, Return, Raise, Bad, CallBegin, EndReg, EndExcept */
574 int is_cfop(ir_node *node);
576 /** Returns true if the operation manipulates interprocedural control flow:
577 CallBegin, EndReg, EndExcept */
578 int is_ip_cfop(ir_node *node);
579 /** Returns true if the operation can change the control flow because
580 of an exception: Call, Quot, DivMod, Div, Mod, Load, Store, Alloc,
582 ir_graph *get_ip_cfop_irg(ir_node *n);
584 int is_fragile_op(ir_node *node);
585 /** Returns the memory operand of fragile operations. */
586 ir_node *get_fragile_op_mem(ir_node *node);
591 /* GNU C has the __FUNCTION__ extension */
592 #define __MYFUNC__ __FUNCTION__
594 /* use Filename instead */
595 #define __MYFUNC__ __FILE__
599 Don't format with "\", firmjni gets problems */
600 /** Output location */
601 #define DDM printf("%s(l.%i).\n", __MYFUNC__, __LINE__);
602 /** Output the firm kind of the node */
603 #define DDMK(X) printf("%s(l.%i) %s: %p\n", __MYFUNC__, __LINE__, print_firm_kind(X), (X));
604 /** Output information about a node */
605 #define DDMN(X) printf("%s(l.%i) %s%s: %ld (%p)\n", __MYFUNC__, __LINE__, get_irn_opname(X), get_mode_name(get_irn_mode(X)), get_irn_node_nr(X), (X))
606 /** Output information about a node and its block */
607 #define DDMNB(X) printf("%s%s: %ld (in block %ld)\n", get_irn_opname(X), get_mode_name(get_irn_mode(X)), get_irn_node_nr(X), get_irn_node_nr(get_nodes_Block(X)))
608 /** Output information about a type */
609 #define DDMT(X) printf("%s(l.%i) %s %s: %ld (%p)\n", __MYFUNC__, __LINE__, get_type_tpop_name(X), get_type_name(X), get_type_nr(X), (X))
610 /** Output information about an entity */
611 #define DDME(X) printf("%s(l.%i) %s: %ld (%p)\n", __MYFUNC__, __LINE__, get_entity_name(X), get_entity_nr(X), (X))
612 /** Output information about an entity and its owner */
613 #define DDMEO(X) printf("%s(l.%i) %s (own: %s): %ld (%p)\n", __MYFUNC__, __LINE__, get_entity_name(X), get_type_name(get_entity_owner(X)), get_entity_nr(X), (X))
614 /** Output information about a graph */
615 #define DDMG(X) printf("%s(l.%i) %s: %ld (%p)\n", __MYFUNC__, __LINE__, get_entity_name(get_irg_ent(X)), get_irg_graph_nr(X), (X))
616 /** Output information about an ident */
617 #define DDMI(X) printf("%s(l.%i) %s: %p\n", __MYFUNC__, __LINE__, get_id_str(X), (X))
618 /** Output information about a mode */
619 #define DDMM(X) printf("%s(l.%i) %s: %p\n", __MYFUNC__, __LINE__, get_mode_name(X), (X))
620 /** Output information about a loop */
621 #define DDML(X) printf("%s(l.%i) loop with depth %d: %p\n", __MYFUNC__, __LINE__, get_loop_depth(X), (X))
622 /** Output information about a tarVal */
623 #define DDMV(X) printf("%s(l.%i) tarval: ",__MYFUNC__, __LINE__); tarval_printf(X); printf(" (%p)\n", (X));
625 /*@}*/ /* end of ir_node group definition */
628 # endif /* _IRNODE_H_ */