3 * File name: ir/ir/irtools.h
4 * Purpose: Some often needed tool-functions
9 * Copyright: (c) 1999-2005 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
15 #include "firm_config.h"
16 #include "firm_types.h"
19 #include <libcore/lc_opts.h>
20 lc_opt_entry_t *firm_opt_get_root(void);
25 #define MAX(x, y) ((x) > (y) ? (x) : (y))
26 #define MIN(x, y) ((x) < (y) ? (x) : (y))
29 * Three valued compare as demanded by e.g. qsort(3)
31 * @param d Another number.
32 * @return 0 if c == d, -1 if c < d, 1 if c > d.
34 #define CMP(c, d) (((c) > (d)) - ((c) < (d)))
38 * convert an integer into pointer
40 #define INT_TO_PTR(v) ((void *)((char *)0 + (v)))
43 * convert a pointer into an integer
45 #define PTR_TO_INT(v) ((int)((char *)(v) - (char *)0))
48 * The famous clear_link() walker-function.
49 * Do not implement it by yourself, use this one
51 void firm_clear_link(ir_node *n, void *env);
54 * Copies a node to a new irg. The Ins of the new node point to
55 * the predecessors on the old irg. n->link points to the new node.
57 * @param n The node to be copied
58 * @param irg the new irg
60 * Does NOT copy standard nodes like Start, End etc that are fixed
61 * in an irg. Instead, the corresponding nodes of the new irg are returned.
62 * Note further, that the new nodes have no block.
64 void copy_irn_to_irg(ir_node *n, ir_graph *irg);
66 #endif /* _IRTOOLS_H_ */