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 /* returns the array with the ins: */
61 INLINE ir_node **get_irn_in (ir_node *node);
62 /* Replaces the old in array by a new one that will contain the ins given in
63 the parameters. Conserves the block predecessor. It copies the array passed.
64 This function is necessary to ajust in arrays of blocks, calls and phis.
65 Assumes that current_ir_graph is set to the graph containing "node".
66 "in" must contain all predecessors except the block that are required for
68 INLINE void set_irn_in (ir_node *node, int arity,
70 /* to iterate through the predecessors without touching the array. No
71 order of predecessors guaranteed.
72 To iterate over the operands iterate from 0 to i < get_irn_arity(),
73 to iterate including the Block predecessor iterate from i = -1 to
75 /* Access predecessor n */
76 /* get_irn_n removes Id predecessors. */
77 INLINE ir_node *get_irn_n (ir_node *node, int n);
78 INLINE void set_irn_n (ir_node *node, int n, ir_node *in);
79 /* Get the mode struct. */
80 INLINE ir_mode *get_irn_mode (ir_node *node);
81 /* Get the mode-enum modecode */
82 INLINE modecode get_irn_modecode (ir_node *node);
83 /* Get the ident for a string representation of the mode */
84 INLINE ident *get_irn_modeident (ir_node *node);
85 /* Access the opcode struct of the node */
86 INLINE ir_op *get_irn_op (ir_node *node);
87 INLINE void set_irn_op (ir_node *node, ir_op *op);
88 /* Get the opcode-enum of the node */
89 INLINE opcode get_irn_opcode (ir_node *node);
90 /* Get the ident for a string representation of the opcode */
91 INLINE ident *get_irn_opident (ir_node *node);
92 /* Get the string representation of the opcode */
93 INLINE const char *get_irn_opname (ir_node *node);
94 INLINE void set_irn_visited (ir_node *node, unsigned long visited);
95 INLINE unsigned long get_irn_visited (ir_node *node);
96 /* Sets visited to get_irg_visited(current_ir_graph) */
97 INLINE void mark_irn_visited (ir_node *node);
98 /* Returns 1 of visited < get_irg_visited(current_ir_graph). */
99 INLINE int irn_not_visited (ir_node *node);
100 INLINE void set_irn_link (ir_node *node, ir_node *link);
101 INLINE ir_node *get_irn_link (ir_node *node);
102 /* Outputs a unique number for this node if libfirm is compiled for
103 debugging, else returns 0. */
104 INLINE long get_irn_node_nr(ir_node *node);
107 /* irnode constructor */
108 /* Create a new irnode in irg, with an op, mode, arity and */
109 /* some incoming irnodes. */
110 /* If arity is negative, a node with a dynamic array is created. */
113 new_ir_node (dbg_info *db,
123 * NAME access functions for node fields.
125 * NOTE Not properly documented ;-)
130 /* this works for all except Block */
131 INLINE ir_node *get_nodes_Block (ir_node *node);
132 INLINE void set_nodes_Block (ir_node *node, ir_node *block);
134 /* Projection numbers for result of Start node: use for Proj nodes! */
136 pns_initial_exec, /* Projection on an executable, the initial control
138 pns_global_store, /* Projection on the global store */
139 pns_frame_base, /* Projection on the frame base */
140 pns_globals, /* Projection on the pointer to the data segment
141 containing _all_ global entities. */
142 pns_args /* Projection on all arguments */
145 INLINE ir_node **get_Block_cfgpred_arr (ir_node *node);
146 int get_Block_n_cfgpreds (ir_node *node);
147 /* INLINE void set_Block_n_cfgpreds (ir_node *node, int n_preds); */
148 INLINE ir_node *get_Block_cfgpred (ir_node *node, int pos);
149 INLINE void set_Block_cfgpred (ir_node *node, int pos, ir_node *pred);
150 INLINE bool get_Block_matured (ir_node *node);
151 INLINE void set_Block_matured (ir_node *node, bool matured);
152 INLINE unsigned long get_Block_block_visited (ir_node *node);
153 INLINE void set_Block_block_visited (ir_node *node, unsigned long visit);
154 /* For this current_ir_graph must be set. */
155 INLINE void mark_Block_block_visited(ir_node *node);
156 INLINE int Block_not_block_visited(ir_node *node);
157 INLINE ir_node *get_Block_graph_arr (ir_node *node, int pos);
158 INLINE void set_Block_graph_arr (ir_node *node, int pos, ir_node *value);
161 void set_Block_exc (ir_node*, exc_t);
162 exc_t get_Block_exc (ir_node*);
164 void set_Node_exc (ir_node*, exc_t);
165 exc_t get_Node_exc (ir_node*);
167 /* handler handling */
168 void set_Block_handler (ir_node*, ir_node*);
169 ir_node* get_Block_handler (ir_node*);
171 void set_Node_handler (ir_node*, ir_node*);
172 ir_node* get_Node_handler (ir_node*);
173 /* Set and remove interprocedural predecessors. If the interprocedural
174 * predecessors are removed, the node has the same predecessors in
176 void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in);
177 void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred);
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 /* We distinguish three kinds of Cond nodes. These can be distinguished
192 by the mode of the selector operand and an internal flag of type cond_kind.
193 First we distinguish binary Conds and switch Conds.
194 A binary Cond has as selector a boolean value. Proj(0) projects the control
195 flow for case "False", Proj(1) the control flow for "True". A binary Cond
196 is recognized by the boolean selector.
197 The switch Cond has as selector an unsigned integer. It produces as result
198 an n+1 Tuple (cf0, ... , cfn) of control flows.
199 We differ two flavours of this Cond. The first, the dense Cond, passes
200 control along output i if the selector value is i, 0 <= i <= n. If the
201 selector value is >n it passes control along output n.
202 The second Cond flavor differes in the treatment of cases not specified in
203 the source program. It magically knows about the existence of Proj nodes.
204 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
205 exists. Else it passes control along output n (even if this Proj does not
206 exist.) This Cond we call "fragmentary". There is a special constructor
207 new_defaultProj that automatically sets the flavor.
208 The two switch flavors are distinguished by a flag of type cond_kind.
209 Default flavor is "dense"
212 dense, /* Default. Missing Proj nodes are dead control flow. */
213 fragmentary /* Special. No control flow optimizations allowed. Missing
214 Proj nodes mean default control flow, i.e., Proj(n). */
217 INLINE ir_node *get_Cond_selector (ir_node *node);
218 INLINE void set_Cond_selector (ir_node *node, ir_node *selector);
219 INLINE cond_kind get_Cond_kind (ir_node *node);
220 INLINE void set_Cond_kind (ir_node *node, cond_kind kind);
222 INLINE ir_node *get_Return_mem (ir_node *node);
223 INLINE void set_Return_mem (ir_node *node, ir_node *mem);
224 INLINE ir_node **get_Return_res_arr (ir_node *node);
225 INLINE int get_Return_n_res (ir_node *node);
226 /*INLINE void set_Return_n_res (ir_node *node, int results); */
227 INLINE ir_node *get_Return_res (ir_node *node, int pos);
228 INLINE void set_Return_res (ir_node *node, int pos, ir_node *res);
230 INLINE ir_node *get_Raise_mem (ir_node *node);
231 INLINE void set_Raise_mem (ir_node *node, ir_node *mem);
232 INLINE ir_node *get_Raise_exo_ptr (ir_node *node); /* PoinTeR to EXception Object */
233 INLINE void set_Raise_exo_ptr (ir_node *node, ir_node *exoptr);
235 INLINE tarval *get_Const_tarval (ir_node *node);
236 INLINE void set_Const_tarval (ir_node *node, tarval *con);
238 /* This enum names the three different kinds of symbolic Constants
239 represented by SymConst. The content of the attribute type_or_id
240 depends on this tag. Use the proper access routine after testing
243 type_tag, /* The SymConst is a type tag for the given type.
244 Type_or_id_p is type *. */
245 size, /* The SymConst is the size of the given type.
246 Type_or_id_p is type *. */
247 linkage_ptr_info /* The SymConst is a symbolic pointer to be filled in
248 by the linker. Type_or_id_p is ident *. */
250 typedef union type_or_id * type_or_id_p;
251 INLINE symconst_kind get_SymConst_kind (ir_node *node);
252 INLINE void set_SymConst_kind (ir_node *node, symconst_kind num);
253 /* Only to access SymConst of kind type_tag or size. Else assertion: */
254 INLINE type *get_SymConst_type (ir_node *node);
255 INLINE void set_SymConst_type (ir_node *node, type *type);
256 /* Only to access SymConst of kind linkage_ptr_info. Else assertion: */
257 INLINE ident *get_SymConst_ptrinfo (ir_node *node);
258 INLINE void set_SymConst_ptrinfo (ir_node *node, ident *ptrinfo);
259 /* Sets both: type and ptrinfo. Needed to treat the node independent of
260 its semantics. Does a memcpy for the memory tori points to. */
261 INLINE type_or_id_p get_SymConst_type_or_id (ir_node *node);
262 INLINE void set_SymConst_type_or_id (ir_node *node, type_or_id_p tori);
264 INLINE ir_node *get_Sel_mem (ir_node *node);
265 INLINE void set_Sel_mem (ir_node *node, ir_node *mem);
266 INLINE ir_node *get_Sel_ptr (ir_node *node); /* ptr to the object to select from */
267 INLINE void set_Sel_ptr (ir_node *node, ir_node *ptr);
268 INLINE ir_node **get_Sel_index_arr (ir_node *node);
269 INLINE int get_Sel_n_index (ir_node *node);
270 /*INLINE void set_Sel_n_index (ir_node *node, int n_index); */
271 INLINE ir_node *get_Sel_index (ir_node *node, int pos);
272 INLINE void set_Sel_index (ir_node *node, int pos, ir_node *index);
273 INLINE entity *get_Sel_entity (ir_node *node); /* entity to select */
274 INLINE void set_Sel_entity (ir_node *node, entity *ent);
276 static_linkage, /* entity is used internal and not visible out of this
278 external_linkage, /* */
281 INLINE linkage_type get_Sel_linkage_type (ir_node *node);
282 INLINE void set_Sel_linkage_type (ir_node *node, linkage_type lt);
284 type *get_InstOf_ent (ir_node*);
285 void set_InstOf_ent (ir_node*, type*);
286 ir_node *get_InstOf_obj (ir_node*);
287 void set_InstOf_obj (ir_node*, ir_node*);
288 ir_node *get_InstOf_store (ir_node*);
289 void set_InstOf_store (ir_node*, ir_node*);
291 INLINE ir_node *get_Call_mem (ir_node *node);
292 INLINE void set_Call_mem (ir_node *node, ir_node *mem);
293 INLINE ir_node *get_Call_ptr (ir_node *node);
294 INLINE void set_Call_ptr (ir_node *node, ir_node *ptr);
295 INLINE ir_node **get_Call_param_arr (ir_node *node);
296 INLINE int get_Call_n_params (ir_node *node);
297 INLINE int get_Call_arity (ir_node *node);
298 /* INLINE void set_Call_arity (ir_node *node, ir_node *arity); */
299 INLINE ir_node *get_Call_param (ir_node *node, int pos);
300 INLINE void set_Call_param (ir_node *node, int pos, ir_node *param);
301 INLINE type *get_Call_type (ir_node *node);
302 INLINE void set_Call_type (ir_node *node, type *type);
304 /* Set, get and remove the callee-analysis. */
305 int get_Call_n_callees(ir_node * node);
306 entity * get_Call_callee(ir_node * node, int pos);
307 void set_Call_callee_arr(ir_node * node, int n, entity ** arr);
308 void remove_Call_callee_arr(ir_node * node);
310 /* For unary and binary arithmetic operations the access to the
311 operands can be factored out. Left is the first, right the
312 second arithmetic value as listed in tech report 1999-44.
313 unops are: Minus, Abs, Not, Conv
314 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
315 Shr, Shrs, Rot, Cmp */
316 INLINE int is_unop (ir_node *node);
317 INLINE ir_node *get_unop_op (ir_node *node);
318 INLINE void set_unop_op (ir_node *node, ir_node *op);
319 INLINE int is_binop (ir_node *node);
320 INLINE ir_node *get_binop_left (ir_node *node);
321 INLINE void set_binop_left (ir_node *node, ir_node *left);
322 INLINE ir_node *get_binop_right (ir_node *node);
323 INLINE void set_binop_right (ir_node *node, ir_node *right);
325 INLINE ir_node *get_Add_left (ir_node *node);
326 INLINE void set_Add_left (ir_node *node, ir_node *left);
327 INLINE ir_node *get_Add_right (ir_node *node);
328 INLINE void set_Add_right (ir_node *node, ir_node *right);
330 INLINE ir_node *get_Sub_left (ir_node *node);
331 INLINE void set_Sub_left (ir_node *node, ir_node *left);
332 INLINE ir_node *get_Sub_right (ir_node *node);
333 INLINE void set_Sub_right (ir_node *node, ir_node *right);
335 INLINE ir_node *get_Minus_op (ir_node *node);
336 INLINE void set_Minus_op (ir_node *node, ir_node *op);
338 INLINE ir_node *get_Mul_left (ir_node *node);
339 INLINE void set_Mul_left (ir_node *node, ir_node *left);
340 INLINE ir_node *get_Mul_right (ir_node *node);
341 INLINE void set_Mul_right (ir_node *node, ir_node *right);
343 INLINE ir_node *get_Quot_left (ir_node *node);
344 INLINE void set_Quot_left (ir_node *node, ir_node *left);
345 INLINE ir_node *get_Quot_right (ir_node *node);
346 INLINE void set_Quot_right (ir_node *node, ir_node *right);
347 INLINE ir_node *get_Quot_mem (ir_node *node);
348 INLINE void set_Quot_mem (ir_node *node, ir_node *mem);
350 INLINE ir_node *get_DivMod_left (ir_node *node);
351 INLINE void set_DivMod_left (ir_node *node, ir_node *left);
352 INLINE ir_node *get_DivMod_right (ir_node *node);
353 INLINE void set_DivMod_right (ir_node *node, ir_node *right);
354 INLINE ir_node *get_DivMod_mem (ir_node *node);
355 INLINE void set_DivMod_mem (ir_node *node, ir_node *mem);
357 INLINE ir_node *get_Div_left (ir_node *node);
358 INLINE void set_Div_left (ir_node *node, ir_node *left);
359 INLINE ir_node *get_Div_right (ir_node *node);
360 INLINE void set_Div_right (ir_node *node, ir_node *right);
361 INLINE ir_node *get_Div_mem (ir_node *node);
362 INLINE void set_Div_mem (ir_node *node, ir_node *mem);
364 INLINE ir_node *get_Mod_left (ir_node *node);
365 INLINE void set_Mod_left (ir_node *node, ir_node *left);
366 INLINE ir_node *get_Mod_right (ir_node *node);
367 INLINE void set_Mod_right (ir_node *node, ir_node *right);
368 INLINE ir_node *get_Mod_mem (ir_node *node);
369 INLINE void set_Mod_mem (ir_node *node, ir_node *mem);
371 INLINE ir_node *get_Abs_op (ir_node *node);
372 INLINE void set_Abs_op (ir_node *node, ir_node *op);
374 INLINE ir_node *get_And_left (ir_node *node);
375 INLINE void set_And_left (ir_node *node, ir_node *left);
376 INLINE ir_node *get_And_right (ir_node *node);
377 INLINE void set_And_right (ir_node *node, ir_node *right);
379 INLINE ir_node *get_Or_left (ir_node *node);
380 INLINE void set_Or_left (ir_node *node, ir_node *left);
381 INLINE ir_node *get_Or_right (ir_node *node);
382 INLINE void set_Or_right (ir_node *node, ir_node *right);
384 INLINE ir_node *get_Eor_left (ir_node *node);
385 INLINE void set_Eor_left (ir_node *node, ir_node *left);
386 INLINE ir_node *get_Eor_right (ir_node *node);
387 INLINE void set_Eor_right (ir_node *node, ir_node *right);
389 INLINE ir_node *get_Not_op (ir_node *node);
390 INLINE void set_Not_op (ir_node *node, ir_node *op);
392 /* Projection numbers of compare: use for Proj nodes! */
397 Le, /* less or equal */
399 Ge, /* greater or equal */
400 Lg, /* less or greater */
401 Leg, /* less, equal or greater = ordered */
403 Ue, /* unordered or equal */
404 Ul, /* unordered or less */
405 Ule, /* unordered, less or equal */
406 Ug, /* unordered or greater */
407 Uge, /* unordered, greater or equal */
408 Ne, /* unordered, less or greater = not equal */
410 not_mask = Leg /* bits to flip to negate comparison */
412 INLINE char *get_pnc_string(int pnc);
413 INLINE int get_negated_pnc(int pnc);
414 INLINE ir_node *get_Cmp_left (ir_node *node);
415 INLINE void set_Cmp_left (ir_node *node, ir_node *left);
416 INLINE ir_node *get_Cmp_right (ir_node *node);
417 INLINE void set_Cmp_right (ir_node *node, ir_node *right);
419 INLINE ir_node *get_Shl_left (ir_node *node);
420 INLINE void set_Shl_left (ir_node *node, ir_node *left);
421 INLINE ir_node *get_Shl_right (ir_node *node);
422 INLINE void set_Shl_right (ir_node *node, ir_node *right);
424 INLINE ir_node *get_Shr_left (ir_node *node);
425 INLINE void set_Shr_left (ir_node *node, ir_node *left);
426 INLINE ir_node *get_Shr_right (ir_node *node);
427 INLINE void set_Shr_right (ir_node *node, ir_node *right);
429 INLINE ir_node *get_Shrs_left (ir_node *node);
430 INLINE void set_Shrs_left (ir_node *node, ir_node *left);
431 INLINE ir_node *get_Shrs_right (ir_node *node);
432 INLINE void set_Shrs_right (ir_node *node, ir_node *right);
434 INLINE ir_node *get_Rot_left (ir_node *node);
435 INLINE void set_Rot_left (ir_node *node, ir_node *left);
436 INLINE ir_node *get_Rot_right (ir_node *node);
437 INLINE void set_Rot_right (ir_node *node, ir_node *right);
439 INLINE ir_node *get_Conv_op (ir_node *node);
440 INLINE void set_Conv_op (ir_node *node, ir_node *op);
442 INLINE ir_node **get_Phi_preds_arr (ir_node *node);
443 INLINE int get_Phi_n_preds (ir_node *node);
444 /* INLINE void set_Phi_n_preds (ir_node *node, int n_preds); */
445 INLINE ir_node *get_Phi_pred (ir_node *node, int pos);
446 INLINE void set_Phi_pred (ir_node *node, int pos, ir_node *pred);
448 INLINE ir_node *get_Load_mem (ir_node *node);
449 INLINE void set_Load_mem (ir_node *node, ir_node *mem);
450 INLINE ir_node *get_Load_ptr (ir_node *node);
451 INLINE void set_Load_ptr (ir_node *node, ir_node *ptr);
453 INLINE ir_node *get_Store_mem (ir_node *node);
454 INLINE void set_Store_mem (ir_node *node, ir_node *mem);
455 INLINE ir_node *get_Store_ptr (ir_node *node);
456 INLINE void set_Store_ptr (ir_node *node, ir_node *ptr);
457 INLINE ir_node *get_Store_value (ir_node *node);
458 INLINE void set_Store_value (ir_node *node, ir_node *value);
460 INLINE ir_node *get_Alloc_mem (ir_node *node);
461 INLINE void set_Alloc_mem (ir_node *node, ir_node *mem);
462 INLINE ir_node *get_Alloc_size (ir_node *node);
463 INLINE void set_Alloc_size (ir_node *node, ir_node *size);
464 INLINE type *get_Alloc_type (ir_node *node);
465 INLINE void set_Alloc_type (ir_node *node, type *type);
467 stack_alloc, /* Alloc allocates the object on the stack. */
468 heap_alloc /* Alloc allocates the object on the heap. */
470 INLINE where_alloc get_Alloc_where (ir_node *node);
471 INLINE void set_Alloc_where (ir_node *node, where_alloc where);
473 INLINE ir_node *get_Free_mem (ir_node *node);
474 INLINE void set_Free_mem (ir_node *node, ir_node *mem);
475 INLINE ir_node *get_Free_ptr (ir_node *node);
476 INLINE void set_Free_ptr (ir_node *node, ir_node *ptr);
477 INLINE ir_node *get_Free_size (ir_node *node);
478 INLINE void set_Free_size (ir_node *node, ir_node *size);
479 INLINE type *get_Free_type (ir_node *node);
480 INLINE void set_Free_type (ir_node *node, type *type);
482 INLINE ir_node **get_Sync_preds_arr (ir_node *node);
483 INLINE int get_Sync_n_preds (ir_node *node);
484 /* INLINE void set_Sync_n_preds (ir_node *node, int n_preds); */
485 INLINE ir_node *get_Sync_pred (ir_node *node, int pos);
486 INLINE void set_Sync_pred (ir_node *node, int pos, ir_node *pred);
488 INLINE ir_node *get_Proj_pred (ir_node *node);
489 INLINE void set_Proj_pred (ir_node *node, ir_node *pred);
490 INLINE long get_Proj_proj (ir_node *node);
491 INLINE void set_Proj_proj (ir_node *node, long proj);
493 INLINE ir_node **get_Tuple_preds_arr (ir_node *node);
494 INLINE int get_Tuple_n_preds (ir_node *node);
495 /* INLINE void set_Tuple_n_preds (ir_node *node, int n_preds); */
496 INLINE ir_node *get_Tuple_pred (ir_node *node, int pos);
497 INLINE void set_Tuple_pred (ir_node *node, int pos, ir_node *pred);
499 INLINE ir_node *get_Id_pred (ir_node *node);
500 INLINE void set_Id_pred (ir_node *node, ir_node *pred);
502 INLINE ir_node *get_Filter_pred(ir_node *node);
503 INLINE long get_Filter_proj(ir_node *node);
504 /* set the interprocedural predecessors */
505 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in);
506 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred);
508 /* Returns the ir_graph this node belongs to. Only valid for
509 * CallBegin, EndReg and EndExcept */
510 INLINE ir_graph *get_irn_irg(ir_node *node);
514 /****s* irnode/other2
516 * NAME Auxiliary routines
518 * NOTE Not properly documented ;-)
523 /* returns operand of node if node is a Proj. */
524 INLINE ir_node *skip_Proj (ir_node *node);
525 /* returns operand of node if node is a Id */
526 INLINE ir_node *skip_nop (ir_node *node);
527 INLINE ir_node *skip_Id (ir_node *node); /* Same as skip_nop. */
528 /* returns corresponding operand of Tuple if node is a Proj from
530 INLINE ir_node *skip_Tuple (ir_node *node);
531 /* returns true if node is a Bad node. */
532 INLINE int is_Bad (ir_node *node);
533 /* returns true if the node is not a Block */
534 INLINE int is_no_Block (ir_node *node);
535 /* returns true if node is a Proj node or a Filter node in
536 * intraprocedural view */
537 INLINE int is_Proj (ir_node *node);
538 /* Returns true if the operation manipulates control flow:
539 Start, End, Jmp, Cond, Return, Raise, Bad */
540 int is_cfop(ir_node *node);
541 /* Returns true if the operation can change the control flow because
542 of an exception: Call, Quot, DivMod, Div, Mod, Load, Store, Alloc,
544 int is_fragile_op(ir_node *node);
545 /* Returns the memory operand of fragile operations. */
546 ir_node *get_fragile_op_mem(ir_node *node);
550 /* Makros for debugging the libfirm */
553 #define DDMSG printf("%s(l.%i)\n", __FUNCTION__, __LINE__)
554 #define DDMSG1(X) printf("%s(l.%i) %s\n", __FUNCTION__, __LINE__, \
555 id_to_str(get_irn_opident(X)))
556 #define DDMSG2(X) printf("%s(l.%i) %s%s: %ld\n", __FUNCTION__, __LINE__, \
557 id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), \
559 #define DDMSG3(X) printf("%s(l.%i) %s: %p\n", __FUNCTION__, __LINE__, \
560 print_firm_kind(X), (X))
561 #define DDMSG4(X) xprintf("%s(l.%i) %I %I: %p\n", __FUNCTION__, __LINE__, \
562 get_type_tpop_nameid(X), get_type_ident(X), (X))
563 #define DDMSG5(X) printf("%s%s: %ld", \
564 id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), \
568 #define DDMN(X) xprintf("%s(l.%i) %I%I: %ld (%p)\n", __FUNCTION__, __LINE__, \
569 get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), (X))
570 #define DDMNB(X) xprintf("%I%I: %ld (in block %ld)\n", \
571 get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), \
572 get_irn_node_nr(get_nodes_Block(X)))
573 #define DDMT(X) xprintf("%s(l.%i) %I %I: %p\n", __FUNCTION__, __LINE__, \
574 get_type_tpop_nameid(X), get_type_ident(X), (X))
575 #define DDME(X) xprintf("%s(l.%i) %I: %p\n", __FUNCTION__, __LINE__, \
576 get_entity_ident(X), (X))
579 # endif /* _IRNODE_H_ */