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 /* 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 void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in);
165 void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred);
166 /* @@@ not supported */
167 ir_node ** get_Block_cg_cfgpred_arr(ir_node * node);
168 int get_Block_cg_n_cfgpreds(ir_node * node);
169 ir_node * get_Block_cg_cfgpred(ir_node * node, int pos);
170 void remove_Block_cg_cfgpred_arr(ir_node * node);
172 /* exc handling @@@ ajacs specific -- not supported */
173 void set_Block_exc (ir_node*, exc_t);
174 exc_t get_Block_exc (ir_node*);
176 void set_Node_exc (ir_node*, exc_t);
177 exc_t get_Node_exc (ir_node*);
179 /* handler handling @@@ ajacs specific -- not supported */
180 void set_Block_handler (ir_node*, ir_node*);
181 ir_node* get_Block_handler (ir_node*);
183 void set_Node_handler (ir_node*, ir_node*);
184 ir_node* get_Node_handler (ir_node*);
186 INLINE int get_End_n_keepalives(ir_node *end);
187 INLINE ir_node *get_End_keepalive(ir_node *end, int pos);
188 INLINE void add_End_keepalive (ir_node *end, ir_node *ka);
189 INLINE void set_End_keepalive(ir_node *end, int pos, ir_node *ka);
190 /* Some parts of the End node are allocated seperately -- their memory
191 is not recovered by dead_node_elimination if a End node is dead.
192 free_End frees these data structures. */
193 INLINE void free_End (ir_node *end);
195 ir_graph *get_EndReg_irg (ir_node *end);
197 ir_graph *get_EndExcept_irg (ir_node *end);
199 /* We distinguish three kinds of Cond nodes. These can be distinguished
200 by the mode of the selector operand and an internal flag of type cond_kind.
201 First we distinguish binary Conds and switch Conds.
202 A binary Cond has as selector a boolean value. Proj(0) projects the control
203 flow for case "False", Proj(1) the control flow for "True". A binary Cond
204 is recognized by the boolean selector.
205 The switch Cond has as selector an unsigned integer. It produces as result
206 an n+1 Tuple (cf0, ... , cfn) of control flows.
207 We differ two flavours of this Cond. The first, the dense Cond, passes
208 control along output i if the selector value is i, 0 <= i <= n. If the
209 selector value is >n it passes control along output n.
210 The second Cond flavor differes in the treatment of cases not specified in
211 the source program. It magically knows about the existence of Proj nodes.
212 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
213 exists. Else it passes control along output n (even if this Proj does not
214 exist.) This Cond we call "fragmentary". There is a special constructor
215 new_defaultProj that automatically sets the flavor.
216 The two switch flavors are distinguished by a flag of type cond_kind.
217 Default flavor is "dense"
220 dense, /* Default. Missing Proj nodes are dead control flow. */
221 fragmentary /* Special. No control flow optimizations allowed. Missing
222 Proj nodes mean default control flow, i.e., Proj(n). */
225 INLINE ir_node *get_Cond_selector (ir_node *node);
226 INLINE void set_Cond_selector (ir_node *node, ir_node *selector);
227 INLINE cond_kind get_Cond_kind (ir_node *node);
228 INLINE void set_Cond_kind (ir_node *node, cond_kind kind);
230 INLINE ir_node *get_Return_mem (ir_node *node);
231 INLINE void set_Return_mem (ir_node *node, ir_node *mem);
232 INLINE ir_node **get_Return_res_arr (ir_node *node);
233 INLINE int get_Return_n_ress (ir_node *node);
234 INLINE ir_node *get_Return_res (ir_node *node, int pos);
235 INLINE void set_Return_res (ir_node *node, int pos, ir_node *res);
237 INLINE ir_node *get_Raise_mem (ir_node *node);
238 INLINE void set_Raise_mem (ir_node *node, ir_node *mem);
239 INLINE ir_node *get_Raise_exo_ptr (ir_node *node); /* PoinTeR to EXception Object */
240 INLINE void set_Raise_exo_ptr (ir_node *node, ir_node *exoptr);
242 INLINE tarval *get_Const_tarval (ir_node *node);
243 INLINE void set_Const_tarval (ir_node *node, tarval *con);
245 /* This enum names the three different kinds of symbolic Constants
246 represented by SymConst. The content of the attribute type_or_id
247 depends on this tag. Use the proper access routine after testing
250 type_tag, /* The SymConst is a type tag for the given type.
251 Type_or_id_p is type *. */
252 size, /* The SymConst is the size of the given type.
253 Type_or_id_p is type *. */
254 linkage_ptr_info /* The SymConst is a symbolic pointer to be filled in
255 by the linker. Type_or_id_p is ident *. */
257 typedef union type_or_id * type_or_id_p;
258 INLINE symconst_kind get_SymConst_kind (ir_node *node);
259 INLINE void set_SymConst_kind (ir_node *node, symconst_kind num);
260 /* Only to access SymConst of kind type_tag or size. Else assertion: */
261 INLINE type *get_SymConst_type (ir_node *node);
262 INLINE void set_SymConst_type (ir_node *node, type *type);
263 /* Only to access SymConst of kind linkage_ptr_info. Else assertion: */
264 INLINE ident *get_SymConst_ptrinfo (ir_node *node);
265 INLINE void set_SymConst_ptrinfo (ir_node *node, ident *ptrinfo);
266 /* Sets both: type and ptrinfo. Needed to treat the node independent of
267 its semantics. Does a memcpy for the memory tori points to. */
268 INLINE type_or_id_p get_SymConst_type_or_id (ir_node *node);
269 INLINE void set_SymConst_type_or_id (ir_node *node, type_or_id_p tori);
271 INLINE ir_node *get_Sel_mem (ir_node *node);
272 INLINE void set_Sel_mem (ir_node *node, ir_node *mem);
273 INLINE ir_node *get_Sel_ptr (ir_node *node); /* ptr to the object to select from */
274 INLINE void set_Sel_ptr (ir_node *node, ir_node *ptr);
275 INLINE ir_node **get_Sel_index_arr (ir_node *node);
276 INLINE int get_Sel_n_indexs (ir_node *node);
277 INLINE ir_node *get_Sel_index (ir_node *node, int pos);
278 INLINE void set_Sel_index (ir_node *node, int pos, ir_node *index);
279 INLINE entity *get_Sel_entity (ir_node *node); /* entity to select */
280 INLINE void set_Sel_entity (ir_node *node, entity *ent);
282 /* @@@ ajacs specific node -- not supported */
283 type *get_InstOf_ent (ir_node*);
284 void set_InstOf_ent (ir_node*, type*);
285 ir_node *get_InstOf_obj (ir_node*);
286 void set_InstOf_obj (ir_node*, ir_node*);
287 ir_node *get_InstOf_store (ir_node*);
288 void set_InstOf_store (ir_node*, ir_node*);
290 INLINE ir_node *get_Call_mem (ir_node *node);
291 INLINE void set_Call_mem (ir_node *node, ir_node *mem);
292 INLINE ir_node *get_Call_ptr (ir_node *node);
293 INLINE void set_Call_ptr (ir_node *node, ir_node *ptr);
294 INLINE ir_node **get_Call_param_arr (ir_node *node);
295 INLINE int get_Call_n_params (ir_node *node);
296 INLINE ir_node *get_Call_param (ir_node *node, int pos);
297 INLINE void set_Call_param (ir_node *node, int pos, ir_node *param);
298 INLINE type *get_Call_type (ir_node *node);
299 INLINE void set_Call_type (ir_node *node, type *type);
300 INLINE int get_Call_arity (ir_node *node);
302 /* Set, get and remove the callee-analysis. */
303 int get_Call_n_callees(ir_node * node);
304 entity * get_Call_callee(ir_node * node, int pos);
305 void set_Call_callee_arr(ir_node * node, int n, entity ** arr);
306 void remove_Call_callee_arr(ir_node * node);
308 ir_node * get_CallBegin_ptr (ir_node *node);
309 void set_CallBegin_ptr (ir_node *node, ir_node *ptr);
310 ir_graph *get_CallBegin_irg (ir_node *node);
311 ir_node *get_CallBegin_call (ir_node *node);
312 void set_CallBegin_call (ir_node *node, ir_node *call);
314 /* For unary and binary arithmetic operations the access to the
315 operands can be factored out. Left is the first, right the
316 second arithmetic value as listed in tech report 1999-44.
317 unops are: Minus, Abs, Not, Conv
318 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
319 Shr, Shrs, Rot, Cmp */
320 INLINE int is_unop (ir_node *node);
321 INLINE ir_node *get_unop_op (ir_node *node);
322 INLINE void set_unop_op (ir_node *node, ir_node *op);
323 INLINE int is_binop (ir_node *node);
324 INLINE ir_node *get_binop_left (ir_node *node);
325 INLINE void set_binop_left (ir_node *node, ir_node *left);
326 INLINE ir_node *get_binop_right (ir_node *node);
327 INLINE void set_binop_right (ir_node *node, ir_node *right);
329 INLINE ir_node *get_Add_left (ir_node *node);
330 INLINE void set_Add_left (ir_node *node, ir_node *left);
331 INLINE ir_node *get_Add_right (ir_node *node);
332 INLINE void set_Add_right (ir_node *node, ir_node *right);
334 INLINE ir_node *get_Sub_left (ir_node *node);
335 INLINE void set_Sub_left (ir_node *node, ir_node *left);
336 INLINE ir_node *get_Sub_right (ir_node *node);
337 INLINE void set_Sub_right (ir_node *node, ir_node *right);
339 INLINE ir_node *get_Minus_op (ir_node *node);
340 INLINE void set_Minus_op (ir_node *node, ir_node *op);
342 INLINE ir_node *get_Mul_left (ir_node *node);
343 INLINE void set_Mul_left (ir_node *node, ir_node *left);
344 INLINE ir_node *get_Mul_right (ir_node *node);
345 INLINE void set_Mul_right (ir_node *node, ir_node *right);
347 INLINE ir_node *get_Quot_left (ir_node *node);
348 INLINE void set_Quot_left (ir_node *node, ir_node *left);
349 INLINE ir_node *get_Quot_right (ir_node *node);
350 INLINE void set_Quot_right (ir_node *node, ir_node *right);
351 INLINE ir_node *get_Quot_mem (ir_node *node);
352 INLINE void set_Quot_mem (ir_node *node, ir_node *mem);
354 INLINE ir_node *get_DivMod_left (ir_node *node);
355 INLINE void set_DivMod_left (ir_node *node, ir_node *left);
356 INLINE ir_node *get_DivMod_right (ir_node *node);
357 INLINE void set_DivMod_right (ir_node *node, ir_node *right);
358 INLINE ir_node *get_DivMod_mem (ir_node *node);
359 INLINE void set_DivMod_mem (ir_node *node, ir_node *mem);
361 INLINE ir_node *get_Div_left (ir_node *node);
362 INLINE void set_Div_left (ir_node *node, ir_node *left);
363 INLINE ir_node *get_Div_right (ir_node *node);
364 INLINE void set_Div_right (ir_node *node, ir_node *right);
365 INLINE ir_node *get_Div_mem (ir_node *node);
366 INLINE void set_Div_mem (ir_node *node, ir_node *mem);
368 INLINE ir_node *get_Mod_left (ir_node *node);
369 INLINE void set_Mod_left (ir_node *node, ir_node *left);
370 INLINE ir_node *get_Mod_right (ir_node *node);
371 INLINE void set_Mod_right (ir_node *node, ir_node *right);
372 INLINE ir_node *get_Mod_mem (ir_node *node);
373 INLINE void set_Mod_mem (ir_node *node, ir_node *mem);
375 INLINE ir_node *get_Abs_op (ir_node *node);
376 INLINE void set_Abs_op (ir_node *node, ir_node *op);
378 INLINE ir_node *get_And_left (ir_node *node);
379 INLINE void set_And_left (ir_node *node, ir_node *left);
380 INLINE ir_node *get_And_right (ir_node *node);
381 INLINE void set_And_right (ir_node *node, ir_node *right);
383 INLINE ir_node *get_Or_left (ir_node *node);
384 INLINE void set_Or_left (ir_node *node, ir_node *left);
385 INLINE ir_node *get_Or_right (ir_node *node);
386 INLINE void set_Or_right (ir_node *node, ir_node *right);
388 INLINE ir_node *get_Eor_left (ir_node *node);
389 INLINE void set_Eor_left (ir_node *node, ir_node *left);
390 INLINE ir_node *get_Eor_right (ir_node *node);
391 INLINE void set_Eor_right (ir_node *node, ir_node *right);
393 INLINE ir_node *get_Not_op (ir_node *node);
394 INLINE void set_Not_op (ir_node *node, ir_node *op);
396 /* Projection numbers of compare: use for Proj nodes! */
401 Le, /* less or equal */
403 Ge, /* greater or equal */
404 Lg, /* less or greater */
405 Leg, /* less, equal or greater = ordered */
407 Ue, /* unordered or equal */
408 Ul, /* unordered or less */
409 Ule, /* unordered, less or equal */
410 Ug, /* unordered or greater */
411 Uge, /* unordered, greater or equal */
412 Ne, /* unordered, less or greater = not equal */
414 not_mask = Leg /* bits to flip to negate comparison */
416 INLINE char *get_pnc_string(int pnc);
417 INLINE int get_negated_pnc(int pnc);
418 INLINE ir_node *get_Cmp_left (ir_node *node);
419 INLINE void set_Cmp_left (ir_node *node, ir_node *left);
420 INLINE ir_node *get_Cmp_right (ir_node *node);
421 INLINE void set_Cmp_right (ir_node *node, ir_node *right);
423 INLINE ir_node *get_Shl_left (ir_node *node);
424 INLINE void set_Shl_left (ir_node *node, ir_node *left);
425 INLINE ir_node *get_Shl_right (ir_node *node);
426 INLINE void set_Shl_right (ir_node *node, ir_node *right);
428 INLINE ir_node *get_Shr_left (ir_node *node);
429 INLINE void set_Shr_left (ir_node *node, ir_node *left);
430 INLINE ir_node *get_Shr_right (ir_node *node);
431 INLINE void set_Shr_right (ir_node *node, ir_node *right);
433 INLINE ir_node *get_Shrs_left (ir_node *node);
434 INLINE void set_Shrs_left (ir_node *node, ir_node *left);
435 INLINE ir_node *get_Shrs_right (ir_node *node);
436 INLINE void set_Shrs_right (ir_node *node, ir_node *right);
438 INLINE ir_node *get_Rot_left (ir_node *node);
439 INLINE void set_Rot_left (ir_node *node, ir_node *left);
440 INLINE ir_node *get_Rot_right (ir_node *node);
441 INLINE void set_Rot_right (ir_node *node, ir_node *right);
443 INLINE ir_node *get_Conv_op (ir_node *node);
444 INLINE void set_Conv_op (ir_node *node, ir_node *op);
446 INLINE ir_node **get_Phi_preds_arr (ir_node *node);
447 INLINE int get_Phi_n_preds (ir_node *node);
448 INLINE ir_node *get_Phi_pred (ir_node *node, int pos);
449 INLINE void set_Phi_pred (ir_node *node, int pos, ir_node *pred);
451 INLINE ir_node *get_Filter_pred(ir_node *node);
452 INLINE void set_Filter_pred(ir_node *node, ir_node *pred);
453 INLINE long get_Filter_proj(ir_node *node);
454 INLINE void set_Filter_proj(ir_node *node, long proj);
455 /* set the interprocedural predecessors, ...d_arr uses current_ir_graph. */
456 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in);
457 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred);
458 int get_Filter_n_cg_preds(ir_node *node);
459 ir_node * get_Filter_cg_pred(ir_node *node, int pos);
461 INLINE ir_node *get_Load_mem (ir_node *node);
462 INLINE void set_Load_mem (ir_node *node, ir_node *mem);
463 INLINE ir_node *get_Load_ptr (ir_node *node);
464 INLINE void set_Load_ptr (ir_node *node, ir_node *ptr);
466 INLINE ir_node *get_Store_mem (ir_node *node);
467 INLINE void set_Store_mem (ir_node *node, ir_node *mem);
468 INLINE ir_node *get_Store_ptr (ir_node *node);
469 INLINE void set_Store_ptr (ir_node *node, ir_node *ptr);
470 INLINE ir_node *get_Store_value (ir_node *node);
471 INLINE void set_Store_value (ir_node *node, ir_node *value);
473 INLINE ir_node *get_Alloc_mem (ir_node *node);
474 INLINE void set_Alloc_mem (ir_node *node, ir_node *mem);
475 INLINE ir_node *get_Alloc_size (ir_node *node);
476 INLINE void set_Alloc_size (ir_node *node, ir_node *size);
477 INLINE type *get_Alloc_type (ir_node *node);
478 INLINE void set_Alloc_type (ir_node *node, type *type);
480 stack_alloc, /* Alloc allocates the object on the stack. */
481 heap_alloc /* Alloc allocates the object on the heap. */
483 INLINE where_alloc get_Alloc_where (ir_node *node);
484 INLINE void set_Alloc_where (ir_node *node, where_alloc where);
486 INLINE ir_node *get_Free_mem (ir_node *node);
487 INLINE void set_Free_mem (ir_node *node, ir_node *mem);
488 INLINE ir_node *get_Free_ptr (ir_node *node);
489 INLINE void set_Free_ptr (ir_node *node, ir_node *ptr);
490 INLINE ir_node *get_Free_size (ir_node *node);
491 INLINE void set_Free_size (ir_node *node, ir_node *size);
492 INLINE type *get_Free_type (ir_node *node);
493 INLINE void set_Free_type (ir_node *node, type *type);
495 INLINE ir_node **get_Sync_preds_arr (ir_node *node);
496 INLINE int get_Sync_n_preds (ir_node *node);
497 INLINE ir_node *get_Sync_pred (ir_node *node, int pos);
498 INLINE void set_Sync_pred (ir_node *node, int pos, ir_node *pred);
500 INLINE ir_node *get_Proj_pred (ir_node *node);
501 INLINE void set_Proj_pred (ir_node *node, ir_node *pred);
502 INLINE long get_Proj_proj (ir_node *node);
503 INLINE void set_Proj_proj (ir_node *node, long proj);
505 INLINE ir_node **get_Tuple_preds_arr (ir_node *node);
506 INLINE int get_Tuple_n_preds (ir_node *node);
507 INLINE ir_node *get_Tuple_pred (ir_node *node, int pos);
508 INLINE void set_Tuple_pred (ir_node *node, int pos, ir_node *pred);
510 INLINE ir_node *get_Id_pred (ir_node *node);
511 INLINE void set_Id_pred (ir_node *node, ir_node *pred);
515 /****s* irnode/other2
517 * NAME Auxiliary routines
519 * NOTE Not properly documented ;-)
524 /* returns operand of node if node is a Proj. */
525 INLINE ir_node *skip_Proj (ir_node *node);
526 /* returns operand of node if node is a Id */
527 INLINE ir_node *skip_nop (ir_node *node);
528 INLINE ir_node *skip_Id (ir_node *node); /* Same as skip_nop. */
529 /* returns corresponding operand of Tuple if node is a Proj from
531 INLINE ir_node *skip_Tuple (ir_node *node);
532 /* returns true if node is a Bad node. */
533 INLINE int is_Bad (ir_node *node);
534 /* returns true if the node is not a Block */
535 INLINE int is_no_Block (ir_node *node);
536 /* returns true if node is a Proj node or a Filter node in
537 * intraprocedural view */
538 INLINE int is_Proj (ir_node *node);
539 /* Returns true if the operation manipulates control flow:
540 Start, End, Jmp, Cond, Return, Raise, Bad, CallBegin, EndReg, EndExcept */
541 int is_cfop(ir_node *node);
543 /* Returns true if the operation manipulates interprocedural control flow:
544 CallBegin, EndReg, EndExcept */
545 int is_ip_cfop(ir_node *node);
546 /* Returns true if the operation can change the control flow because
547 of an exception: Call, Quot, DivMod, Div, Mod, Load, Store, Alloc,
549 int is_fragile_op(ir_node *node);
550 /* Returns the memory operand of fragile operations. */
551 ir_node *get_fragile_op_mem(ir_node *node);
555 /* Makros for debugging the libfirm */
558 #define DDMSG printf("%s(l.%i)\n", __FUNCTION__, __LINE__)
559 #define DDMSG1(X) printf("%s(l.%i) %s\n", __FUNCTION__, __LINE__, \
560 id_to_str(get_irn_opident(X)))
561 #define DDMSG2(X) printf("%s(l.%i) %s%s: %ld\n", __FUNCTION__, __LINE__, \
562 id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), \
564 #define DDMSG3(X) printf("%s(l.%i) %s: %p\n", __FUNCTION__, __LINE__, \
565 print_firm_kind(X), (X))
566 #define DDMSG4(X) xprintf("%s(l.%i) %I %I: %p\n", __FUNCTION__, __LINE__, \
567 get_type_tpop_nameid(X), get_type_ident(X), (X))
568 #define DDMSG5(X) printf("%s%s: %ld", \
569 id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), \
573 #define DDMN(X) xprintf("%s(l.%i) %I%I: %ld (%p)\n", __FUNCTION__, __LINE__, \
574 get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), (X))
575 #define DDMNB(X) xprintf("%I%I: %ld (in block %ld)\n", \
576 get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), \
577 get_irn_node_nr(get_nodes_Block(X)))
578 #define DDMT(X) xprintf("%s(l.%i) %I %I: %p\n", __FUNCTION__, __LINE__, \
579 get_type_tpop_nameid(X), get_type_ident(X), (X))
580 #define DDME(X) xprintf("%s(l.%i) %I: %p\n", __FUNCTION__, __LINE__, \
581 get_entity_ident(X), (X))
584 # endif /* _IRNODE_H_ */