1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe 3 2002/02/28 13:33:52
2 ** All rights reserved.
4 ** Authors: Martin Trapp, Christian Schaefer
6 ** declarations of an ir node
16 # include "firm_common.h"
24 /* The type definiton of ir_node is also in irgraph.h to resolve
25 recursion between irnode.h and irgraph.h */
28 * NAME ir_node - a datatype representing a Firm node
30 * NOTE Not properly documented ;-)
33 * The common fields are:
35 * firm_kind A firm_kind tag containing k_type. This is useful
36 * for dynamically checking whether a node is a ir_node.
37 * arity The number of predecessors in the Firm graph.
38 * in A list with the predecessors in the Firm graph. There are
39 * routines to access individual elements and to obtain the
40 * array. The method returning the array should not be used.
41 * mode The mode of the node. There are routines to get the mode but
42 * also to access the mode's fields directly.
43 * opcode The opcode of the node. There are routines to get the opcode but
44 * also to access the opcode's fields directly.
45 * node_nr A unique number for the node. Available only if debugging is
49 #ifndef _IR_NODE_TYPEDEF_
50 #define _IR_NODE_TYPEDEF_
51 typedef struct ir_node ir_node;
54 /** Manipulate the fields of ir_node. With these access routines
55 you can work on the graph without considering the different types
56 of nodes, it's just a big graph. **/
58 /* returns the number of predecessors without the block predecessor: */
59 int get_irn_arity (ir_node *node);
60 /* Replaces the old in array by a new one that will contain the ins given in
61 the parameters. Conserves the block predecessor. It copies the array passed.
62 This function is necessary to ajust in arrays of blocks, calls and phis.
63 Assumes that current_ir_graph is set to the graph containing "node".
64 "in" must contain all predecessors except the block that are required for
66 INLINE void set_irn_in (ir_node *node, int arity,
68 /* to iterate through the predecessors without touching the array. No
69 order of predecessors guaranteed.
70 To iterate over the operands iterate from 0 to i < get_irn_arity(),
71 to iterate including the Block predecessor iterate from i = -1 to
73 /* Access predecessor n */
74 /* get_irn_n removes Id predecessors. */
75 INLINE ir_node *get_irn_n (ir_node *node, int n);
76 INLINE void set_irn_n (ir_node *node, int n, ir_node *in);
77 /* Get the mode struct. */
78 INLINE ir_mode *get_irn_mode (ir_node *node);
79 /* Get the mode-enum modecode */
80 INLINE modecode get_irn_modecode (ir_node *node);
81 /* Get the ident for a string representation of the mode */
82 INLINE ident *get_irn_modeident (ir_node *node);
83 /* Access the opcode struct of the node */
84 INLINE ir_op *get_irn_op (ir_node *node);
85 INLINE void set_irn_op (ir_node *node, ir_op *op);
86 /* Get the opcode-enum of the node */
87 INLINE opcode get_irn_opcode (ir_node *node);
88 /* Get the ident for a string representation of the opcode */
89 INLINE ident *get_irn_opident (ir_node *node);
90 /* Get the string representation of the opcode */
91 INLINE const char *get_irn_opname (ir_node *node);
92 INLINE void set_irn_visited (ir_node *node, unsigned long visited);
93 INLINE unsigned long get_irn_visited (ir_node *node);
94 /* Sets visited to get_irg_visited(current_ir_graph) */
95 INLINE void mark_irn_visited (ir_node *node);
96 /* Returns 1 if visited < get_irg_visited(current_ir_graph). */
97 INLINE int irn_not_visited (ir_node *node);
98 /* Returns 1 if visited >= get_irg_visited(current_ir_graph). */
99 INLINE int irn_visited (ir_node *node);
100 INLINE void set_irn_link (ir_node *node, void *link);
101 INLINE void *get_irn_link (ir_node *node);
102 /* Outputs a unique number for this node if libfirm is compiled for
103 debugging, (configure with --enable-debug) else returns 0. */
104 INLINE long get_irn_node_nr(ir_node *node);
105 /* Returns the ir_graph this node belongs to. Only valid for
106 * CallBegin, EndReg and EndExcept */
107 INLINE ir_graph *get_irn_irg(ir_node *node);
110 /* irnode constructor */
111 /* Create a new irnode in irg, with an op, mode, arity and */
112 /* some incoming irnodes. */
113 /* If arity is negative, a node with a dynamic array is created. */
116 new_ir_node (dbg_info *db,
126 * NAME access functions for node fields.
128 * NOTE Not properly documented ;-)
133 /* this works for all except Block */
134 INLINE ir_node *get_nodes_Block (ir_node *node);
135 INLINE void set_nodes_Block (ir_node *node, ir_node *block);
137 /* Projection numbers for result of Start node: use for Proj nodes! */
139 pns_initial_exec, /* Projection on an executable, the initial control
141 pns_global_store, /* Projection on the global store */
142 pns_frame_base, /* Projection on the frame base */
143 pns_globals, /* Projection on the pointer to the data segment
144 containing _all_ global entities. */
145 pns_args /* Projection on all arguments */
148 /* @@@ no more supported */
149 INLINE ir_node **get_Block_cfgpred_arr (ir_node *node);
150 int get_Block_n_cfgpreds (ir_node *node);
151 INLINE ir_node *get_Block_cfgpred (ir_node *node, int pos);
152 INLINE void set_Block_cfgpred (ir_node *node, int pos, ir_node *pred);
153 INLINE bool get_Block_matured (ir_node *node);
154 INLINE void set_Block_matured (ir_node *node, bool matured);
155 INLINE unsigned long get_Block_block_visited (ir_node *node);
156 INLINE void set_Block_block_visited (ir_node *node, unsigned long visit);
157 /* For this current_ir_graph must be set. */
158 INLINE void mark_Block_block_visited(ir_node *node);
159 INLINE int Block_not_block_visited(ir_node *node);
161 /* Set and remove interprocedural predecessors. If the interprocedural
162 * predecessors are removed, the node has the same predecessors in
164 * @@@ Maybe better: arity is zero if no cg preds. */
165 void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in);
166 void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred);
167 /* @@@ not supported */
168 ir_node ** get_Block_cg_cfgpred_arr(ir_node * node);
169 /* Returns the number of interproc predecessors. 0 if none. */
170 int get_Block_cg_n_cfgpreds(ir_node * node);
171 ir_node * get_Block_cg_cfgpred(ir_node * node, int pos);
172 /* frees the memory. */
173 void remove_Block_cg_cfgpred_arr(ir_node * node);
175 INLINE int get_End_n_keepalives(ir_node *end);
176 INLINE ir_node *get_End_keepalive(ir_node *end, int pos);
177 INLINE void add_End_keepalive (ir_node *end, ir_node *ka);
178 INLINE void set_End_keepalive(ir_node *end, int pos, ir_node *ka);
179 /* Some parts of the End node are allocated seperately -- their memory
180 is not recovered by dead_node_elimination if a End node is dead.
181 free_End frees these data structures. */
182 INLINE void free_End (ir_node *end);
184 ir_graph *get_EndReg_irg (ir_node *end);
185 ir_graph *get_EndExcept_irg (ir_node *end);
187 /* We distinguish three kinds of Cond nodes. These can be distinguished
188 by the mode of the selector operand and an internal flag of type cond_kind.
189 First we distinguish binary Conds and switch Conds.
190 A binary Cond has as selector a boolean value. Proj(0) projects the control
191 flow for case "False", Proj(1) the control flow for "True". A binary Cond
192 is recognized by the boolean selector.
193 The switch Cond has as selector an unsigned integer. It produces as result
194 an n+1 Tuple (cf0, ... , cfn) of control flows.
195 We differ two flavours of this Cond. The first, the dense Cond, passes
196 control along output i if the selector value is i, 0 <= i <= n. If the
197 selector value is >n it passes control along output n.
198 The second Cond flavor differes in the treatment of cases not specified in
199 the source program. It magically knows about the existence of Proj nodes.
200 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
201 exists. Else it passes control along output n (even if this Proj does not
202 exist.) This Cond we call "fragmentary". There is a special constructor
203 new_defaultProj that automatically sets the flavor.
204 The two switch flavors are distinguished by a flag of type cond_kind.
205 Default flavor is "dense"
208 dense, /* Default. Missing Proj nodes are dead control flow. */
209 fragmentary /* Special. No control flow optimizations allowed. Missing
210 Proj nodes mean default control flow, i.e., Proj(n). */
213 INLINE ir_node *get_Cond_selector (ir_node *node);
214 INLINE void set_Cond_selector (ir_node *node, ir_node *selector);
215 INLINE cond_kind get_Cond_kind (ir_node *node);
216 INLINE void set_Cond_kind (ir_node *node, cond_kind kind);
218 INLINE ir_node *get_Return_mem (ir_node *node);
219 INLINE void set_Return_mem (ir_node *node, ir_node *mem);
220 INLINE ir_node **get_Return_res_arr (ir_node *node);
221 INLINE int get_Return_n_ress (ir_node *node);
222 INLINE ir_node *get_Return_res (ir_node *node, int pos);
223 INLINE void set_Return_res (ir_node *node, int pos, ir_node *res);
225 INLINE ir_node *get_Raise_mem (ir_node *node);
226 INLINE void set_Raise_mem (ir_node *node, ir_node *mem);
227 INLINE ir_node *get_Raise_exo_ptr (ir_node *node); /* PoinTeR to EXception Object */
228 INLINE void set_Raise_exo_ptr (ir_node *node, ir_node *exoptr);
230 INLINE tarval *get_Const_tarval (ir_node *node);
231 INLINE void set_Const_tarval (ir_node *node, tarval *con);
233 /* This enum names the three different kinds of symbolic Constants
234 represented by SymConst. The content of the attribute type_or_id
235 depends on this tag. Use the proper access routine after testing
238 type_tag, /* The SymConst is a type tag for the given type.
239 Type_or_id_p is type *. */
240 size, /* The SymConst is the size of the given type.
241 Type_or_id_p is type *. */
242 linkage_ptr_info /* The SymConst is a symbolic pointer to be filled in
243 by the linker. Type_or_id_p is ident *. */
245 typedef union type_or_id * type_or_id_p;
246 INLINE symconst_kind get_SymConst_kind (ir_node *node);
247 INLINE void set_SymConst_kind (ir_node *node, symconst_kind num);
248 /* Only to access SymConst of kind type_tag or size. Else assertion: */
249 INLINE type *get_SymConst_type (ir_node *node);
250 INLINE void set_SymConst_type (ir_node *node, type *tp);
251 /* Only to access SymConst of kind linkage_ptr_info. Else assertion: */
252 INLINE ident *get_SymConst_ptrinfo (ir_node *node);
253 INLINE void set_SymConst_ptrinfo (ir_node *node, ident *ptrinfo);
254 /* Sets both: type and ptrinfo. Needed to treat the node independent of
255 its semantics. Does a memcpy for the memory tori points to. */
256 INLINE type_or_id_p get_SymConst_type_or_id (ir_node *node);
257 INLINE void set_SymConst_type_or_id (ir_node *node, type_or_id_p tori);
259 INLINE ir_node *get_Sel_mem (ir_node *node);
260 INLINE void set_Sel_mem (ir_node *node, ir_node *mem);
261 INLINE ir_node *get_Sel_ptr (ir_node *node); /* ptr to the object to select from */
262 INLINE void set_Sel_ptr (ir_node *node, ir_node *ptr);
263 INLINE ir_node **get_Sel_index_arr (ir_node *node);
264 INLINE int get_Sel_n_indexs (ir_node *node);
265 INLINE ir_node *get_Sel_index (ir_node *node, int pos);
266 INLINE void set_Sel_index (ir_node *node, int pos, ir_node *index);
267 INLINE entity *get_Sel_entity (ir_node *node); /* entity to select */
268 INLINE void set_Sel_entity (ir_node *node, entity *ent);
270 /* @@@ ajacs specific node -- not supported */
271 type *get_InstOf_ent (ir_node *node);
272 void set_InstOf_ent (ir_node *node, type *ent);
273 ir_node *get_InstOf_obj (ir_node *node);
274 void set_InstOf_obj (ir_node *node, ir_node *obj);
275 ir_node *get_InstOf_store (ir_node *node);
276 void set_InstOf_store (ir_node *node, ir_node *obj);
278 INLINE ir_node *get_Call_mem (ir_node *node);
279 INLINE void set_Call_mem (ir_node *node, ir_node *mem);
280 INLINE ir_node *get_Call_ptr (ir_node *node);
281 INLINE void set_Call_ptr (ir_node *node, ir_node *ptr);
282 INLINE ir_node **get_Call_param_arr (ir_node *node);
283 INLINE int get_Call_n_params (ir_node *node);
284 INLINE ir_node *get_Call_param (ir_node *node, int pos);
285 INLINE void set_Call_param (ir_node *node, int pos, ir_node *param);
286 INLINE type *get_Call_type (ir_node *node);
287 INLINE void set_Call_type (ir_node *node, type *tp);
288 INLINE int get_Call_arity (ir_node *node);
290 /* Set, get and remove the callee-analysis. */
291 int get_Call_n_callees(ir_node * node);
292 entity * get_Call_callee(ir_node * node, int pos);
293 void set_Call_callee_arr(ir_node * node, int n, entity ** arr);
294 void remove_Call_callee_arr(ir_node * node);
296 ir_node * get_CallBegin_ptr (ir_node *node);
297 void set_CallBegin_ptr (ir_node *node, ir_node *ptr);
298 ir_graph *get_CallBegin_irg (ir_node *node);
299 ir_node *get_CallBegin_call (ir_node *node);
300 void set_CallBegin_call (ir_node *node, ir_node *call);
302 /* For unary and binary arithmetic operations the access to the
303 operands can be factored out. Left is the first, right the
304 second arithmetic value as listed in tech report 1999-44.
305 unops are: Minus, Abs, Not, Conv
306 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
307 Shr, Shrs, Rot, Cmp */
308 INLINE int is_unop (ir_node *node);
309 INLINE ir_node *get_unop_op (ir_node *node);
310 INLINE void set_unop_op (ir_node *node, ir_node *op);
311 INLINE int is_binop (ir_node *node);
312 INLINE ir_node *get_binop_left (ir_node *node);
313 INLINE void set_binop_left (ir_node *node, ir_node *left);
314 INLINE ir_node *get_binop_right (ir_node *node);
315 INLINE void set_binop_right (ir_node *node, ir_node *right);
317 INLINE ir_node *get_Add_left (ir_node *node);
318 INLINE void set_Add_left (ir_node *node, ir_node *left);
319 INLINE ir_node *get_Add_right (ir_node *node);
320 INLINE void set_Add_right (ir_node *node, ir_node *right);
322 INLINE ir_node *get_Sub_left (ir_node *node);
323 INLINE void set_Sub_left (ir_node *node, ir_node *left);
324 INLINE ir_node *get_Sub_right (ir_node *node);
325 INLINE void set_Sub_right (ir_node *node, ir_node *right);
327 INLINE ir_node *get_Minus_op (ir_node *node);
328 INLINE void set_Minus_op (ir_node *node, ir_node *op);
330 INLINE ir_node *get_Mul_left (ir_node *node);
331 INLINE void set_Mul_left (ir_node *node, ir_node *left);
332 INLINE ir_node *get_Mul_right (ir_node *node);
333 INLINE void set_Mul_right (ir_node *node, ir_node *right);
335 INLINE ir_node *get_Quot_left (ir_node *node);
336 INLINE void set_Quot_left (ir_node *node, ir_node *left);
337 INLINE ir_node *get_Quot_right (ir_node *node);
338 INLINE void set_Quot_right (ir_node *node, ir_node *right);
339 INLINE ir_node *get_Quot_mem (ir_node *node);
340 INLINE void set_Quot_mem (ir_node *node, ir_node *mem);
342 INLINE ir_node *get_DivMod_left (ir_node *node);
343 INLINE void set_DivMod_left (ir_node *node, ir_node *left);
344 INLINE ir_node *get_DivMod_right (ir_node *node);
345 INLINE void set_DivMod_right (ir_node *node, ir_node *right);
346 INLINE ir_node *get_DivMod_mem (ir_node *node);
347 INLINE void set_DivMod_mem (ir_node *node, ir_node *mem);
349 INLINE ir_node *get_Div_left (ir_node *node);
350 INLINE void set_Div_left (ir_node *node, ir_node *left);
351 INLINE ir_node *get_Div_right (ir_node *node);
352 INLINE void set_Div_right (ir_node *node, ir_node *right);
353 INLINE ir_node *get_Div_mem (ir_node *node);
354 INLINE void set_Div_mem (ir_node *node, ir_node *mem);
356 INLINE ir_node *get_Mod_left (ir_node *node);
357 INLINE void set_Mod_left (ir_node *node, ir_node *left);
358 INLINE ir_node *get_Mod_right (ir_node *node);
359 INLINE void set_Mod_right (ir_node *node, ir_node *right);
360 INLINE ir_node *get_Mod_mem (ir_node *node);
361 INLINE void set_Mod_mem (ir_node *node, ir_node *mem);
363 INLINE ir_node *get_Abs_op (ir_node *node);
364 INLINE void set_Abs_op (ir_node *node, ir_node *op);
366 INLINE ir_node *get_And_left (ir_node *node);
367 INLINE void set_And_left (ir_node *node, ir_node *left);
368 INLINE ir_node *get_And_right (ir_node *node);
369 INLINE void set_And_right (ir_node *node, ir_node *right);
371 INLINE ir_node *get_Or_left (ir_node *node);
372 INLINE void set_Or_left (ir_node *node, ir_node *left);
373 INLINE ir_node *get_Or_right (ir_node *node);
374 INLINE void set_Or_right (ir_node *node, ir_node *right);
376 INLINE ir_node *get_Eor_left (ir_node *node);
377 INLINE void set_Eor_left (ir_node *node, ir_node *left);
378 INLINE ir_node *get_Eor_right (ir_node *node);
379 INLINE void set_Eor_right (ir_node *node, ir_node *right);
381 INLINE ir_node *get_Not_op (ir_node *node);
382 INLINE void set_Not_op (ir_node *node, ir_node *op);
384 /* Projection numbers of compare: use for Proj nodes! */
389 Le, /* less or equal */
391 Ge, /* greater or equal */
392 Lg, /* less or greater */
393 Leg, /* less, equal or greater = ordered */
395 Ue, /* unordered or equal */
396 Ul, /* unordered or less */
397 Ule, /* unordered, less or equal */
398 Ug, /* unordered or greater */
399 Uge, /* unordered, greater or equal */
400 Ne, /* unordered, less or greater = not equal */
402 /* not_mask = Leg /* bits to flip to negate comparison * @@ hack for jni interface */
405 INLINE char *get_pnc_string(int pnc);
406 INLINE int get_negated_pnc(int pnc);
407 INLINE ir_node *get_Cmp_left (ir_node *node);
408 INLINE void set_Cmp_left (ir_node *node, ir_node *left);
409 INLINE ir_node *get_Cmp_right (ir_node *node);
410 INLINE void set_Cmp_right (ir_node *node, ir_node *right);
412 INLINE ir_node *get_Shl_left (ir_node *node);
413 INLINE void set_Shl_left (ir_node *node, ir_node *left);
414 INLINE ir_node *get_Shl_right (ir_node *node);
415 INLINE void set_Shl_right (ir_node *node, ir_node *right);
417 INLINE ir_node *get_Shr_left (ir_node *node);
418 INLINE void set_Shr_left (ir_node *node, ir_node *left);
419 INLINE ir_node *get_Shr_right (ir_node *node);
420 INLINE void set_Shr_right (ir_node *node, ir_node *right);
422 INLINE ir_node *get_Shrs_left (ir_node *node);
423 INLINE void set_Shrs_left (ir_node *node, ir_node *left);
424 INLINE ir_node *get_Shrs_right (ir_node *node);
425 INLINE void set_Shrs_right (ir_node *node, ir_node *right);
427 INLINE ir_node *get_Rot_left (ir_node *node);
428 INLINE void set_Rot_left (ir_node *node, ir_node *left);
429 INLINE ir_node *get_Rot_right (ir_node *node);
430 INLINE void set_Rot_right (ir_node *node, ir_node *right);
432 INLINE ir_node *get_Conv_op (ir_node *node);
433 INLINE void set_Conv_op (ir_node *node, ir_node *op);
435 INLINE ir_node **get_Phi_preds_arr (ir_node *node);
436 INLINE int get_Phi_n_preds (ir_node *node);
437 INLINE ir_node *get_Phi_pred (ir_node *node, int pos);
438 INLINE void set_Phi_pred (ir_node *node, int pos, ir_node *pred);
440 INLINE ir_node *get_Filter_pred(ir_node *node);
441 INLINE void set_Filter_pred(ir_node *node, ir_node *pred);
442 INLINE long get_Filter_proj(ir_node *node);
443 INLINE void set_Filter_proj(ir_node *node, long proj);
444 /* set the interprocedural predecessors, ...d_arr uses current_ir_graph.
445 * @@@ Maybe better: arity is zero if no cg preds. */
446 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in);
447 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred);
448 int get_Filter_n_cg_preds(ir_node *node);
449 ir_node * get_Filter_cg_pred(ir_node *node, int pos);
451 INLINE ir_node *get_Load_mem (ir_node *node);
452 INLINE void set_Load_mem (ir_node *node, ir_node *mem);
453 INLINE ir_node *get_Load_ptr (ir_node *node);
454 INLINE void set_Load_ptr (ir_node *node, ir_node *ptr);
456 INLINE ir_node *get_Store_mem (ir_node *node);
457 INLINE void set_Store_mem (ir_node *node, ir_node *mem);
458 INLINE ir_node *get_Store_ptr (ir_node *node);
459 INLINE void set_Store_ptr (ir_node *node, ir_node *ptr);
460 INLINE ir_node *get_Store_value (ir_node *node);
461 INLINE void set_Store_value (ir_node *node, ir_node *value);
463 INLINE ir_node *get_Alloc_mem (ir_node *node);
464 INLINE void set_Alloc_mem (ir_node *node, ir_node *mem);
465 INLINE ir_node *get_Alloc_size (ir_node *node);
466 INLINE void set_Alloc_size (ir_node *node, ir_node *size);
467 INLINE type *get_Alloc_type (ir_node *node);
468 INLINE void set_Alloc_type (ir_node *node, type *tp);
470 stack_alloc, /* Alloc allocates the object on the stack. */
471 heap_alloc /* Alloc allocates the object on the heap. */
473 INLINE where_alloc get_Alloc_where (ir_node *node);
474 INLINE void set_Alloc_where (ir_node *node, where_alloc where);
476 INLINE ir_node *get_Free_mem (ir_node *node);
477 INLINE void set_Free_mem (ir_node *node, ir_node *mem);
478 INLINE ir_node *get_Free_ptr (ir_node *node);
479 INLINE void set_Free_ptr (ir_node *node, ir_node *ptr);
480 INLINE ir_node *get_Free_size (ir_node *node);
481 INLINE void set_Free_size (ir_node *node, ir_node *size);
482 INLINE type *get_Free_type (ir_node *node);
483 INLINE void set_Free_type (ir_node *node, type *tp);
485 INLINE ir_node **get_Sync_preds_arr (ir_node *node);
486 INLINE int get_Sync_n_preds (ir_node *node);
487 INLINE ir_node *get_Sync_pred (ir_node *node, int pos);
488 INLINE void set_Sync_pred (ir_node *node, int pos, ir_node *pred);
490 INLINE ir_node *get_Proj_pred (ir_node *node);
491 INLINE void set_Proj_pred (ir_node *node, ir_node *pred);
492 INLINE long get_Proj_proj (ir_node *node);
493 INLINE void set_Proj_proj (ir_node *node, long proj);
495 INLINE ir_node **get_Tuple_preds_arr (ir_node *node);
496 INLINE int get_Tuple_n_preds (ir_node *node);
497 INLINE ir_node *get_Tuple_pred (ir_node *node, int pos);
498 INLINE void set_Tuple_pred (ir_node *node, int pos, ir_node *pred);
500 INLINE ir_node *get_Id_pred (ir_node *node);
501 INLINE void set_Id_pred (ir_node *node, ir_node *pred);
505 /****s* irnode/other2
507 * NAME Auxiliary routines
509 * NOTE Not properly documented ;-)
514 /* returns operand of node if node is a Proj. */
515 INLINE ir_node *skip_Proj (ir_node *node);
516 /* returns operand of node if node is a Id */
517 INLINE ir_node *skip_nop (ir_node *node);
518 INLINE ir_node *skip_Id (ir_node *node); /* Same as skip_nop. */
519 /* returns corresponding operand of Tuple if node is a Proj from
521 INLINE ir_node *skip_Tuple (ir_node *node);
522 /* returns true if node is a Bad node. */
523 INLINE int is_Bad (ir_node *node);
524 /* returns true if the node is not a Block */
525 INLINE int is_no_Block (ir_node *node);
526 /* returns true if the node is a Block */
527 INLINE int is_Block (ir_node *node);
528 /* returns true if node is a Proj node or a Filter node in
529 * intraprocedural view */
530 INLINE int is_Proj (ir_node *node);
531 /* Returns true if the operation manipulates control flow:
532 Start, End, Jmp, Cond, Return, Raise, Bad, CallBegin, EndReg, EndExcept */
533 int is_cfop(ir_node *node);
535 /* Returns true if the operation manipulates interprocedural control flow:
536 CallBegin, EndReg, EndExcept */
537 int is_ip_cfop(ir_node *node);
538 /* Returns true if the operation can change the control flow because
539 of an exception: Call, Quot, DivMod, Div, Mod, Load, Store, Alloc,
541 ir_graph *get_ip_cfop_irg(ir_node *n);
543 int is_fragile_op(ir_node *node);
544 /* Returns the memory operand of fragile operations. */
545 ir_node *get_fragile_op_mem(ir_node *node);
549 /* Makros for debugging the libfirm */
552 #define DDMSG printf("%s(l.%i)\n", __FUNCTION__, __LINE__)
553 #define DDMSG1(X) printf("%s(l.%i) %s\n", __FUNCTION__, __LINE__, id_to_str(get_irn_opident(X)))
554 #define DDMSG2(X) printf("%s(l.%i) %s%s: %ld\n", __FUNCTION__, __LINE__, id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), get_irn_node_nr(X))
555 #define DDMSG3(X) printf("%s(l.%i) %s: %p\n", __FUNCTION__, __LINE__, print_firm_kind(X), (X))
556 #define DDMSG4(X) xprintf("%s(l.%i) %I %I: %p\n", __FUNCTION__, __LINE__, get_type_tpop_nameid(X), get_type_ident(X), (X))
557 #define DDMSG5(X) printf("%s%s: %ld", id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), get_irn_node_nr(X))
560 #define DDMN(X) xprintf("%s(l.%i) %I%I: %ld (%p)\n", __FUNCTION__, __LINE__, get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), (X))
561 #define DDMNB(X) xprintf("%I%I: %ld (in block %ld)\n", get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), get_irn_node_nr(get_nodes_Block(X)))
562 #define DDMT(X) xprintf("%s(l.%i) %I %I: %p\n", __FUNCTION__, __LINE__, get_type_tpop_nameid(X), get_type_ident(X), (X))
563 #define DDME(X) xprintf("%s(l.%i) %I: %p\n", __FUNCTION__, __LINE__, get_entity_ident(X), (X))
564 #define DDMG(X) xprintf("%s(l.%i) %I: %p\n", __FUNCTION__, __LINE__, get_irg_ent(get_entity_ident(X)), (X))
567 # endif /* _IRNODE_H_ */