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
24 /* The typedefiniton of ir_node is also in irgraph.h to resolve
25 recursion between irnode.h and irgraph.h */
26 #ifndef _IR_NODE_TYPEDEF_
27 #define _IR_NODE_TYPEDEF_
30 * NAME ir_node - a datatype representing a Firm node
32 * NOTE Not properly documented ;-)
35 * The common fields are:
37 * firm_kind A firm_kind tag containing k_type. This is useful
38 * for dynamically checking whether a node is a ir_node.
39 * arity The number of predecessors in the Firm graph.
40 * in A list with the predecessors in the Firm graph. There are
41 * routines to access individual elements and to obtain the
42 * array. The method returning the array should not be used.
43 * mode The mode of the node. There are routines to get the mode but
44 * also to access the mode's fields directly.
45 * opcode The opcode of the node. There are routines to get the opcode but
46 * also to access the opcode's fields directly.
47 * node_nr A unique number for the node. Available only if debugging is
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 INLINE void set_irn_link (ir_node *node, void *link);
99 INLINE void *get_irn_link (ir_node *node);
100 /* Outputs a unique number for this node if libfirm is compiled for
101 debugging, (configure with --enable-debug) else returns 0. */
102 INLINE long get_irn_node_nr(ir_node *node);
103 /* Returns the ir_graph this node belongs to. Only valid for
104 * CallBegin, EndReg and EndExcept */
105 INLINE ir_graph *get_irn_irg(ir_node *node);
108 /* irnode constructor */
109 /* Create a new irnode in irg, with an op, mode, arity and */
110 /* some incoming irnodes. */
111 /* If arity is negative, a node with a dynamic array is created. */
114 new_ir_node (dbg_info *db,
124 * NAME access functions for node fields.
126 * NOTE Not properly documented ;-)
131 /* this works for all except Block */
132 INLINE ir_node *get_nodes_Block (ir_node *node);
133 INLINE void set_nodes_Block (ir_node *node, ir_node *block);
135 /* Projection numbers for result of Start node: use for Proj nodes! */
137 pns_initial_exec, /* Projection on an executable, the initial control
139 pns_global_store, /* Projection on the global store */
140 pns_frame_base, /* Projection on the frame base */
141 pns_globals, /* Projection on the pointer to the data segment
142 containing _all_ global entities. */
143 pns_args /* Projection on all arguments */
146 /* @@@ no more supported */
147 INLINE ir_node **get_Block_cfgpred_arr (ir_node *node);
148 int get_Block_n_cfgpreds (ir_node *node);
149 INLINE ir_node *get_Block_cfgpred (ir_node *node, int pos);
150 INLINE void set_Block_cfgpred (ir_node *node, int pos, ir_node *pred);
151 INLINE bool get_Block_matured (ir_node *node);
152 INLINE void set_Block_matured (ir_node *node, bool matured);
153 INLINE unsigned long get_Block_block_visited (ir_node *node);
154 INLINE void set_Block_block_visited (ir_node *node, unsigned long visit);
155 /* For this current_ir_graph must be set. */
156 INLINE void mark_Block_block_visited(ir_node *node);
157 INLINE int Block_not_block_visited(ir_node *node);
159 /* exc handling @@@ ajacs specific -- not supported */
160 void set_Block_exc (ir_node*, exc_t);
161 exc_t get_Block_exc (ir_node*);
163 void set_Node_exc (ir_node*, exc_t);
164 exc_t get_Node_exc (ir_node*);
166 /* handler handling @@@ ajacs specific -- not supported */
167 void set_Block_handler (ir_node*, ir_node*);
168 ir_node* get_Block_handler (ir_node*);
170 void set_Node_handler (ir_node*, ir_node*);
171 ir_node* get_Node_handler (ir_node*);
172 /* Set and remove interprocedural predecessors. If the interprocedural
173 * predecessors are removed, the node has the same predecessors in
175 void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in);
176 void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred);
177 /* @@@ not supported */
178 ir_node ** get_Block_cg_cfgpred_arr(ir_node * node);
179 int get_Block_cg_n_cfgpreds(ir_node * node);
180 void remove_Block_cg_cfgpred_arr(ir_node * node);
182 INLINE int get_End_n_keepalives(ir_node *end);
183 INLINE ir_node *get_End_keepalive(ir_node *end, int pos);
184 INLINE void add_End_keepalive (ir_node *end, ir_node *ka);
185 INLINE void set_End_keepalive(ir_node *end, int pos, ir_node *ka);
186 /* Some parts of the End node are allocated seperately -- their memory
187 is not recovered by dead_node_elimination if a End node is dead.
188 free_End frees these data structures. */
189 INLINE void free_End (ir_node *end);
191 ir_graph *get_EndReg_irg (ir_node *end);
193 ir_graph *get_EndExcept_irg (ir_node *end);
195 /* We distinguish three kinds of Cond nodes. These can be distinguished
196 by the mode of the selector operand and an internal flag of type cond_kind.
197 First we distinguish binary Conds and switch Conds.
198 A binary Cond has as selector a boolean value. Proj(0) projects the control
199 flow for case "False", Proj(1) the control flow for "True". A binary Cond
200 is recognized by the boolean selector.
201 The switch Cond has as selector an unsigned integer. It produces as result
202 an n+1 Tuple (cf0, ... , cfn) of control flows.
203 We differ two flavours of this Cond. The first, the dense Cond, passes
204 control along output i if the selector value is i, 0 <= i <= n. If the
205 selector value is >n it passes control along output n.
206 The second Cond flavor differes in the treatment of cases not specified in
207 the source program. It magically knows about the existence of Proj nodes.
208 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
209 exists. Else it passes control along output n (even if this Proj does not
210 exist.) This Cond we call "fragmentary". There is a special constructor
211 new_defaultProj that automatically sets the flavor.
212 The two switch flavors are distinguished by a flag of type cond_kind.
213 Default flavor is "dense"
216 dense, /* Default. Missing Proj nodes are dead control flow. */
217 fragmentary /* Special. No control flow optimizations allowed. Missing
218 Proj nodes mean default control flow, i.e., Proj(n). */
221 INLINE ir_node *get_Cond_selector (ir_node *node);
222 INLINE void set_Cond_selector (ir_node *node, ir_node *selector);
223 INLINE cond_kind get_Cond_kind (ir_node *node);
224 INLINE void set_Cond_kind (ir_node *node, cond_kind kind);
226 INLINE ir_node *get_Return_mem (ir_node *node);
227 INLINE void set_Return_mem (ir_node *node, ir_node *mem);
228 INLINE ir_node **get_Return_res_arr (ir_node *node);
229 INLINE int get_Return_n_ress (ir_node *node);
230 INLINE ir_node *get_Return_res (ir_node *node, int pos);
231 INLINE void set_Return_res (ir_node *node, int pos, ir_node *res);
233 INLINE ir_node *get_Raise_mem (ir_node *node);
234 INLINE void set_Raise_mem (ir_node *node, ir_node *mem);
235 INLINE ir_node *get_Raise_exo_ptr (ir_node *node); /* PoinTeR to EXception Object */
236 INLINE void set_Raise_exo_ptr (ir_node *node, ir_node *exoptr);
238 INLINE tarval *get_Const_tarval (ir_node *node);
239 INLINE void set_Const_tarval (ir_node *node, tarval *con);
241 /* This enum names the three different kinds of symbolic Constants
242 represented by SymConst. The content of the attribute type_or_id
243 depends on this tag. Use the proper access routine after testing
246 type_tag, /* The SymConst is a type tag for the given type.
247 Type_or_id_p is type *. */
248 size, /* The SymConst is the size of the given type.
249 Type_or_id_p is type *. */
250 linkage_ptr_info /* The SymConst is a symbolic pointer to be filled in
251 by the linker. Type_or_id_p is ident *. */
253 typedef union type_or_id * type_or_id_p;
254 INLINE symconst_kind get_SymConst_kind (ir_node *node);
255 INLINE void set_SymConst_kind (ir_node *node, symconst_kind num);
256 /* Only to access SymConst of kind type_tag or size. Else assertion: */
257 INLINE type *get_SymConst_type (ir_node *node);
258 INLINE void set_SymConst_type (ir_node *node, type *type);
259 /* Only to access SymConst of kind linkage_ptr_info. Else assertion: */
260 INLINE ident *get_SymConst_ptrinfo (ir_node *node);
261 INLINE void set_SymConst_ptrinfo (ir_node *node, ident *ptrinfo);
262 /* Sets both: type and ptrinfo. Needed to treat the node independent of
263 its semantics. Does a memcpy for the memory tori points to. */
264 INLINE type_or_id_p get_SymConst_type_or_id (ir_node *node);
265 INLINE void set_SymConst_type_or_id (ir_node *node, type_or_id_p tori);
267 INLINE ir_node *get_Sel_mem (ir_node *node);
268 INLINE void set_Sel_mem (ir_node *node, ir_node *mem);
269 INLINE ir_node *get_Sel_ptr (ir_node *node); /* ptr to the object to select from */
270 INLINE void set_Sel_ptr (ir_node *node, ir_node *ptr);
271 INLINE ir_node **get_Sel_index_arr (ir_node *node);
272 INLINE int get_Sel_n_indexs (ir_node *node);
273 INLINE ir_node *get_Sel_index (ir_node *node, int pos);
274 INLINE void set_Sel_index (ir_node *node, int pos, ir_node *index);
275 INLINE entity *get_Sel_entity (ir_node *node); /* entity to select */
276 INLINE void set_Sel_entity (ir_node *node, entity *ent);
278 /* @@@ ajacs specific node -- not supported */
279 type *get_InstOf_ent (ir_node*);
280 void set_InstOf_ent (ir_node*, type*);
281 ir_node *get_InstOf_obj (ir_node*);
282 void set_InstOf_obj (ir_node*, ir_node*);
283 ir_node *get_InstOf_store (ir_node*);
284 void set_InstOf_store (ir_node*, ir_node*);
286 INLINE ir_node *get_Call_mem (ir_node *node);
287 INLINE void set_Call_mem (ir_node *node, ir_node *mem);
288 INLINE ir_node *get_Call_ptr (ir_node *node);
289 INLINE void set_Call_ptr (ir_node *node, ir_node *ptr);
290 INLINE ir_node **get_Call_param_arr (ir_node *node);
291 INLINE int get_Call_n_params (ir_node *node);
292 INLINE ir_node *get_Call_param (ir_node *node, int pos);
293 INLINE void set_Call_param (ir_node *node, int pos, ir_node *param);
294 INLINE type *get_Call_type (ir_node *node);
295 INLINE void set_Call_type (ir_node *node, type *type);
296 /* Set, get and remove the callee-analysis. */
297 int get_Call_n_callees(ir_node * node);
298 entity * get_Call_callee(ir_node * node, int pos);
299 void set_Call_callee_arr(ir_node * node, int n, entity ** arr);
300 void remove_Call_callee_arr(ir_node * node);
302 ir_node * get_CallBegin_ptr (ir_node *node);
303 void set_CallBegin_ptr (ir_node *node, ir_node *ptr);
304 ir_graph *get_CallBegin_irg (ir_node *node);
305 ir_node *get_CallBegin_call (ir_node *node);
306 void set_CallBegin_call (ir_node *node, ir_node *call);
308 /* For unary and binary arithmetic operations the access to the
309 operands can be factored out. Left is the first, right the
310 second arithmetic value as listed in tech report 1999-44.
311 unops are: Minus, Abs, Not, Conv
312 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
313 Shr, Shrs, Rot, Cmp */
314 INLINE int is_unop (ir_node *node);
315 INLINE ir_node *get_unop_op (ir_node *node);
316 INLINE void set_unop_op (ir_node *node, ir_node *op);
317 INLINE int is_binop (ir_node *node);
318 INLINE ir_node *get_binop_left (ir_node *node);
319 INLINE void set_binop_left (ir_node *node, ir_node *left);
320 INLINE ir_node *get_binop_right (ir_node *node);
321 INLINE void set_binop_right (ir_node *node, ir_node *right);
323 INLINE ir_node *get_Add_left (ir_node *node);
324 INLINE void set_Add_left (ir_node *node, ir_node *left);
325 INLINE ir_node *get_Add_right (ir_node *node);
326 INLINE void set_Add_right (ir_node *node, ir_node *right);
328 INLINE ir_node *get_Sub_left (ir_node *node);
329 INLINE void set_Sub_left (ir_node *node, ir_node *left);
330 INLINE ir_node *get_Sub_right (ir_node *node);
331 INLINE void set_Sub_right (ir_node *node, ir_node *right);
333 INLINE ir_node *get_Minus_op (ir_node *node);
334 INLINE void set_Minus_op (ir_node *node, ir_node *op);
336 INLINE ir_node *get_Mul_left (ir_node *node);
337 INLINE void set_Mul_left (ir_node *node, ir_node *left);
338 INLINE ir_node *get_Mul_right (ir_node *node);
339 INLINE void set_Mul_right (ir_node *node, ir_node *right);
341 INLINE ir_node *get_Quot_left (ir_node *node);
342 INLINE void set_Quot_left (ir_node *node, ir_node *left);
343 INLINE ir_node *get_Quot_right (ir_node *node);
344 INLINE void set_Quot_right (ir_node *node, ir_node *right);
345 INLINE ir_node *get_Quot_mem (ir_node *node);
346 INLINE void set_Quot_mem (ir_node *node, ir_node *mem);
348 INLINE ir_node *get_DivMod_left (ir_node *node);
349 INLINE void set_DivMod_left (ir_node *node, ir_node *left);
350 INLINE ir_node *get_DivMod_right (ir_node *node);
351 INLINE void set_DivMod_right (ir_node *node, ir_node *right);
352 INLINE ir_node *get_DivMod_mem (ir_node *node);
353 INLINE void set_DivMod_mem (ir_node *node, ir_node *mem);
355 INLINE ir_node *get_Div_left (ir_node *node);
356 INLINE void set_Div_left (ir_node *node, ir_node *left);
357 INLINE ir_node *get_Div_right (ir_node *node);
358 INLINE void set_Div_right (ir_node *node, ir_node *right);
359 INLINE ir_node *get_Div_mem (ir_node *node);
360 INLINE void set_Div_mem (ir_node *node, ir_node *mem);
362 INLINE ir_node *get_Mod_left (ir_node *node);
363 INLINE void set_Mod_left (ir_node *node, ir_node *left);
364 INLINE ir_node *get_Mod_right (ir_node *node);
365 INLINE void set_Mod_right (ir_node *node, ir_node *right);
366 INLINE ir_node *get_Mod_mem (ir_node *node);
367 INLINE void set_Mod_mem (ir_node *node, ir_node *mem);
369 INLINE ir_node *get_Abs_op (ir_node *node);
370 INLINE void set_Abs_op (ir_node *node, ir_node *op);
372 INLINE ir_node *get_And_left (ir_node *node);
373 INLINE void set_And_left (ir_node *node, ir_node *left);
374 INLINE ir_node *get_And_right (ir_node *node);
375 INLINE void set_And_right (ir_node *node, ir_node *right);
377 INLINE ir_node *get_Or_left (ir_node *node);
378 INLINE void set_Or_left (ir_node *node, ir_node *left);
379 INLINE ir_node *get_Or_right (ir_node *node);
380 INLINE void set_Or_right (ir_node *node, ir_node *right);
382 INLINE ir_node *get_Eor_left (ir_node *node);
383 INLINE void set_Eor_left (ir_node *node, ir_node *left);
384 INLINE ir_node *get_Eor_right (ir_node *node);
385 INLINE void set_Eor_right (ir_node *node, ir_node *right);
387 INLINE ir_node *get_Not_op (ir_node *node);
388 INLINE void set_Not_op (ir_node *node, ir_node *op);
390 /* Projection numbers of compare: use for Proj nodes! */
395 Le, /* less or equal */
397 Ge, /* greater or equal */
398 Lg, /* less or greater */
399 Leg, /* less, equal or greater = ordered */
401 Ue, /* unordered or equal */
402 Ul, /* unordered or less */
403 Ule, /* unordered, less or equal */
404 Ug, /* unordered or greater */
405 Uge, /* unordered, greater or equal */
406 Ne, /* unordered, less or greater = not equal */
408 not_mask = Leg /* bits to flip to negate comparison */
410 INLINE char *get_pnc_string(int pnc);
411 INLINE int get_negated_pnc(int pnc);
412 INLINE ir_node *get_Cmp_left (ir_node *node);
413 INLINE void set_Cmp_left (ir_node *node, ir_node *left);
414 INLINE ir_node *get_Cmp_right (ir_node *node);
415 INLINE void set_Cmp_right (ir_node *node, ir_node *right);
417 INLINE ir_node *get_Shl_left (ir_node *node);
418 INLINE void set_Shl_left (ir_node *node, ir_node *left);
419 INLINE ir_node *get_Shl_right (ir_node *node);
420 INLINE void set_Shl_right (ir_node *node, ir_node *right);
422 INLINE ir_node *get_Shr_left (ir_node *node);
423 INLINE void set_Shr_left (ir_node *node, ir_node *left);
424 INLINE ir_node *get_Shr_right (ir_node *node);
425 INLINE void set_Shr_right (ir_node *node, ir_node *right);
427 INLINE ir_node *get_Shrs_left (ir_node *node);
428 INLINE void set_Shrs_left (ir_node *node, ir_node *left);
429 INLINE ir_node *get_Shrs_right (ir_node *node);
430 INLINE void set_Shrs_right (ir_node *node, ir_node *right);
432 INLINE ir_node *get_Rot_left (ir_node *node);
433 INLINE void set_Rot_left (ir_node *node, ir_node *left);
434 INLINE ir_node *get_Rot_right (ir_node *node);
435 INLINE void set_Rot_right (ir_node *node, ir_node *right);
437 INLINE ir_node *get_Conv_op (ir_node *node);
438 INLINE void set_Conv_op (ir_node *node, ir_node *op);
440 INLINE ir_node **get_Phi_preds_arr (ir_node *node);
441 INLINE int get_Phi_n_preds (ir_node *node);
442 INLINE ir_node *get_Phi_pred (ir_node *node, int pos);
443 INLINE void set_Phi_pred (ir_node *node, int pos, ir_node *pred);
445 INLINE ir_node *get_Filter_pred(ir_node *node);
446 INLINE void set_Filter_pred(ir_node *node, ir_node *pred);
447 INLINE long get_Filter_proj(ir_node *node);
448 INLINE void set_Filter_proj(ir_node *node, long proj);
449 /* set the interprocedural predecessors */
450 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in);
451 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred);
453 INLINE ir_node *get_Load_mem (ir_node *node);
454 INLINE void set_Load_mem (ir_node *node, ir_node *mem);
455 INLINE ir_node *get_Load_ptr (ir_node *node);
456 INLINE void set_Load_ptr (ir_node *node, ir_node *ptr);
458 INLINE ir_node *get_Store_mem (ir_node *node);
459 INLINE void set_Store_mem (ir_node *node, ir_node *mem);
460 INLINE ir_node *get_Store_ptr (ir_node *node);
461 INLINE void set_Store_ptr (ir_node *node, ir_node *ptr);
462 INLINE ir_node *get_Store_value (ir_node *node);
463 INLINE void set_Store_value (ir_node *node, ir_node *value);
465 INLINE ir_node *get_Alloc_mem (ir_node *node);
466 INLINE void set_Alloc_mem (ir_node *node, ir_node *mem);
467 INLINE ir_node *get_Alloc_size (ir_node *node);
468 INLINE void set_Alloc_size (ir_node *node, ir_node *size);
469 INLINE type *get_Alloc_type (ir_node *node);
470 INLINE void set_Alloc_type (ir_node *node, type *type);
472 stack_alloc, /* Alloc allocates the object on the stack. */
473 heap_alloc /* Alloc allocates the object on the heap. */
475 INLINE where_alloc get_Alloc_where (ir_node *node);
476 INLINE void set_Alloc_where (ir_node *node, where_alloc where);
478 INLINE ir_node *get_Free_mem (ir_node *node);
479 INLINE void set_Free_mem (ir_node *node, ir_node *mem);
480 INLINE ir_node *get_Free_ptr (ir_node *node);
481 INLINE void set_Free_ptr (ir_node *node, ir_node *ptr);
482 INLINE ir_node *get_Free_size (ir_node *node);
483 INLINE void set_Free_size (ir_node *node, ir_node *size);
484 INLINE type *get_Free_type (ir_node *node);
485 INLINE void set_Free_type (ir_node *node, type *type);
487 INLINE ir_node **get_Sync_preds_arr (ir_node *node);
488 INLINE int get_Sync_n_preds (ir_node *node);
489 INLINE ir_node *get_Sync_pred (ir_node *node, int pos);
490 INLINE void set_Sync_pred (ir_node *node, int pos, ir_node *pred);
492 INLINE ir_node *get_Proj_pred (ir_node *node);
493 INLINE void set_Proj_pred (ir_node *node, ir_node *pred);
494 INLINE long get_Proj_proj (ir_node *node);
495 INLINE void set_Proj_proj (ir_node *node, long proj);
497 INLINE ir_node **get_Tuple_preds_arr (ir_node *node);
498 INLINE int get_Tuple_n_preds (ir_node *node);
499 INLINE ir_node *get_Tuple_pred (ir_node *node, int pos);
500 INLINE void set_Tuple_pred (ir_node *node, int pos, ir_node *pred);
502 INLINE ir_node *get_Id_pred (ir_node *node);
503 INLINE void set_Id_pred (ir_node *node, ir_node *pred);
507 /****s* irnode/other2
509 * NAME Auxiliary routines
511 * NOTE Not properly documented ;-)
516 /* returns operand of node if node is a Proj. */
517 INLINE ir_node *skip_Proj (ir_node *node);
518 /* returns operand of node if node is a Id */
519 INLINE ir_node *skip_nop (ir_node *node);
520 INLINE ir_node *skip_Id (ir_node *node); /* Same as skip_nop. */
521 /* returns corresponding operand of Tuple if node is a Proj from
523 INLINE ir_node *skip_Tuple (ir_node *node);
524 /* returns true if node is a Bad node. */
525 INLINE int is_Bad (ir_node *node);
526 /* returns true if the node is not a Block */
527 INLINE int is_no_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 */
533 int is_cfop(ir_node *node);
534 /* Returns true if the operation can change the control flow because
535 of an exception: Call, Quot, DivMod, Div, Mod, Load, Store, Alloc,
537 int is_fragile_op(ir_node *node);
538 /* Returns the memory operand of fragile operations. */
539 ir_node *get_fragile_op_mem(ir_node *node);
543 /* Makros for debugging the libfirm */
546 #define DDMSG printf("%s(l.%i)\n", __FUNCTION__, __LINE__)
547 #define DDMSG1(X) printf("%s(l.%i) %s\n", __FUNCTION__, __LINE__, \
548 id_to_str(get_irn_opident(X)))
549 #define DDMSG2(X) printf("%s(l.%i) %s%s: %ld\n", __FUNCTION__, __LINE__, \
550 id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), \
552 #define DDMSG3(X) printf("%s(l.%i) %s: %p\n", __FUNCTION__, __LINE__, \
553 print_firm_kind(X), (X))
554 #define DDMSG4(X) xprintf("%s(l.%i) %I %I: %p\n", __FUNCTION__, __LINE__, \
555 get_type_tpop_nameid(X), get_type_ident(X), (X))
556 #define DDMSG5(X) printf("%s%s: %ld", \
557 id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), \
561 #define DDMN(X) xprintf("%s(l.%i) %I%I: %ld (%p)\n", __FUNCTION__, __LINE__, \
562 get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), (X))
563 #define DDMNB(X) xprintf("%I%I: %ld (in block %ld)\n", \
564 get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), \
565 get_irn_node_nr(get_nodes_Block(X)))
566 #define DDMT(X) xprintf("%s(l.%i) %I %I: %p\n", __FUNCTION__, __LINE__, \
567 get_type_tpop_nameid(X), get_type_ident(X), (X))
568 #define DDME(X) xprintf("%s(l.%i) %I: %p\n", __FUNCTION__, __LINE__, \
569 get_entity_ident(X), (X))
572 # endif /* _IRNODE_H_ */