2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Generic hooks for various libFirm functions.
23 * @author Michael Beck
26 #ifndef FIRM_IR_IRHOOKS_H
27 #define FIRM_IR_IRHOOKS_H
35 * options for the hook_merge_nodes hook
38 HOOK_OPT_DEAD_BLOCK, /**< a block was removed because it's dead */
39 HOOK_OPT_STG, /**< straightening optimization */
40 HOOK_OPT_IFSIM, /**< if simplification */
41 HOOK_OPT_CONST_EVAL, /**< constant evaluation */
42 HOOK_OPT_ALGSIM, /**< algebraic simplification */
43 HOOK_OPT_PHI, /**< Phi optimization */
44 HOOK_OPT_SYNC, /**< Sync optimization */
45 HOOK_OPT_WAW, /**< Write-After-Write optimization */
46 HOOK_OPT_WAR, /**< Write-After-Read optimization */
47 HOOK_OPT_RAW, /**< Read-After-Write optimization */
48 HOOK_OPT_RAR, /**< Read-After-Read optimization */
49 HOOK_OPT_RC, /**< Read-a-Const optimization */
50 HOOK_OPT_TUPLE, /**< Tuple optimization */
51 HOOK_OPT_ID, /**< ID optimization */
52 HOOK_OPT_CSE, /**< common subexpression elimination */
53 HOOK_OPT_STRENGTH_RED,/**< strength reduction */
54 HOOK_OPT_ARCH_DEP, /**< architecture dependent optimization */
55 HOOK_OPT_REASSOC, /**< reassociation */
56 HOOK_OPT_POLY_CALL, /**< polymorphic call optimization */
57 HOOK_OPT_IF_CONV, /**< an if conversion was tried */
58 HOOK_OPT_FUNC_CALL, /**< a real function call was removed */
59 HOOK_OPT_CONFIRM, /**< a value was substituted by another due to a Confirm */
60 HOOK_OPT_CONFIRM_C, /**< a value was substituted by a const due to a Confirm */
61 HOOK_OPT_CONFIRM_E, /**< a value was evaluated due to a Confirm */
62 HOOK_OPT_EXC_REM, /**< a exception edge was removed due to a Confirmation prove */
63 HOOK_OPT_NORMALIZE, /**< a commutative node was normalized */
64 HOOK_LOWERED, /**< lowered */
65 HOOK_BACKEND, /**< a backend transformation */
69 typedef enum _if_result_t {
70 IF_RESULT_SUCCESS = 0, /**< if conversion could be done */
71 IF_RESULT_SIDE_EFFECT = 1, /**< if conversion failed because of side effect */
72 IF_RESULT_SIDE_EFFECT_PHI = 2, /**< if conversion failed because of Phi node found */
73 IF_RESULT_TOO_DEEP = 3, /**< if conversion failed because of to deep DAG's */
74 IF_RESULT_BAD_CF = 4, /**< if conversion failed because of bad control flow */
75 IF_RESULT_DENIED = 5, /**< if conversion failed because of architecture deny */
80 * A generic function type.
82 typedef void (generic_func)(void);
87 typedef struct hook_entry {
88 /** A union of all possible hook types. */
90 /** This hook is called, after a new ir_op was created. */
91 void (*_hook_new_ir_op)(void *context, ir_op *op);
93 /** This hook is called, before am ir_op is destroyed. */
94 void (*_hook_free_ir_op)(void *context, ir_op *op);
96 /** This hook is called, after a new IR-node was created and before it is optimized. */
97 void (*_hook_new_node)(void *context, ir_graph *graph, ir_node *node);
99 /** This hook is called, before a node input was changed. */
100 void (*_hook_set_irn_n)(void *context, ir_node *src,
101 int pos, ir_node *tgt, ir_node *old_tgt);
103 /** This hook is called, before a node is replaced (exchange()) by another. */
104 void (*_hook_replace)(void *context, ir_node *old_node, ir_node *new_node);
106 /** This hook is called, before a node is changed into an Id node. */
107 void (*_hook_turn_into_id)(void *context, ir_node *node);
109 /** This hook is called, after a commutative node was normalized. */
110 void (*_hook_normalize)(void *context, ir_node *node);
112 /** This hook is called, after a new graph was created and before the first block
113 * on this graph is build. */
114 void (*_hook_new_graph)(void *context, ir_graph *irg, ir_entity *ent);
116 /** This hook is called before a graph is freed. */
117 void (*_hook_free_graph)(void *context, ir_graph *irg);
119 /** This hook is called before an irg walk is started. */
120 void (*_hook_irg_walk)(void *context, ir_graph *irg, generic_func *pre, generic_func *post);
122 /** This hook is called before an block wise irg walk is started. */
123 void (*_hook_irg_walk_blkwise)(void *context, ir_graph *irg, generic_func *pre, generic_func *post);
125 /** This hook is called before an block walk is started. */
126 void (*_hook_irg_block_walk)(void *context, ir_graph *irg, ir_node *node, generic_func *pre, generic_func *post);
128 /** This hook is called, when debug info must be merged. */
129 void (*_hook_merge_nodes)(void *context, ir_node **new_node_array, int new_num_entries,
130 ir_node **old_node_array, int old_num_entries, hook_opt_kind opt);
132 /** This hook is called, when reassociation is started/stopped. */
133 void (*_hook_reassociate)(void *context, int start);
135 /** This hook is called, before a node is lowered. */
136 void (*_hook_lower)(void *context, ir_node *node);
138 /** This hook is called, before a graph is inlined. */
139 void (*_hook_inline)(void *context, ir_node *call, ir_graph *irg);
141 /** This hook is called, before tail recursion is applied to a graph. */
142 void (*_hook_tail_rec)(void *context, ir_graph *irg, int n_calls);
144 /** This hook is called, before a node is replaced due to strength reduction */
145 void (*_hook_strength_red)(void *context, ir_graph *irg, ir_node *node);
147 /** This hook is called, when dead node elimination is started/stopped. */
148 void (*_hook_dead_node_elim)(void *context, ir_graph *irg, int start);
150 /** This hook is called, when a node is substituted during dead node elimination. */
151 void (*_hook_dead_node_elim_subst)(void *context, ir_graph *irg, ir_node *old, ir_node *nw);
153 /** This hook is called after if conversion has run. */
154 void (*_hook_if_conversion)(void *context, ir_graph *irg, ir_node *phi, int pos, ir_node *mux, if_result_t reason);
156 /** This hook is called after a call was detected as const call */
157 void (*_hook_func_call)(void *context, ir_graph *irg, ir_node *call);
159 /** This hook is called after a Mul was replaced by a series of Shift and Add/Sub operations. */
160 void (*_hook_arch_dep_replace_mul_with_shifts)(void *context, ir_node *irn);
162 /** This hook is called after a Div/Mod/DivMod by a constant value was replaced. */
163 void (*_hook_arch_dep_replace_division_by_const)(void *context, ir_node *irn);
165 /** This hook is called after a new mode was registered. */
166 void (*_hook_new_mode)(void *context, const ir_mode *tmpl, ir_mode *mode);
168 /** This hook is called after a new entity was created. */
169 void (*_hook_new_entity)(void *context, ir_entity *ent);
171 /** This hook is called after a new type was created. */
172 void (*_hook_new_type)(void *context, ir_type *tp);
174 /** This hook is called at the end of the node info dumper to dump additional node info. */
175 void (*_hook_node_info)(void *context, FILE *f, const ir_node *n);
178 /** the context for every hook */
181 /** needed for chaining */
182 struct hook_entry *next;
199 hook_irg_walk_blkwise,
208 hook_dead_node_elim_subst,
211 hook_arch_dep_replace_mul_with_shifts,
212 hook_arch_dep_replace_division_by_const,
221 * register a hook entry.
223 * @param hook the hook type
224 * @param entry the hook entry
226 FIRM_API void register_hook(hook_type_t hook, hook_entry_t *entry);
229 * unregister a hook entry.
231 * @param hook the hook type
232 * @param entry the hook entry
234 FIRM_API void unregister_hook(hook_type_t hook, hook_entry_t *entry);
236 FIRM_API hook_entry_t *hooks[hook_last];
239 * execute the hook what with the args args
240 * Do not use this macro directly.
242 #define hook_exec(what, args) do { \
244 for (_p = hooks[what]; _p; _p = _p->next){ \
245 void *ctx = _p->context; \
246 _p->hook._##what args; \
250 #define hook_new_ir_op(op) hook_exec(hook_new_ir_op, (ctx, op))
251 #define hook_free_ir_op(op) hook_exec(hook_free_ir_op, (ctx, op))
252 #define hook_new_node(graph, node) hook_exec(hook_new_node, (ctx, graph, node))
253 #define hook_set_irn_n(src, pos, tgt, old_tgt) \
254 hook_exec(hook_set_irn_n, (ctx, src, pos, tgt, old_tgt))
255 #define hook_replace(old, nw) hook_exec(hook_replace, (ctx, old, nw))
256 #define hook_turn_into_id(node) hook_exec(hook_turn_into_id, (ctx, node))
257 #define hook_normalize(node) hook_exec(hook_normalize, (ctx, node))
258 #define hook_new_graph(irg, ent) hook_exec(hook_new_graph, (ctx, irg, ent))
259 #define hook_free_graph(irg) hook_exec(hook_free_graph, (ctx, irg))
260 #define hook_irg_walk(irg, pre, post) hook_exec(hook_irg_walk, (ctx, irg, pre, post))
261 #define hook_irg_walk_blkwise(irg, pre, post) \
262 hook_exec(hook_irg_walk_blkwise, (ctx, irg, pre, post))
263 #define hook_irg_block_walk(irg, node, pre, post) \
264 hook_exec(hook_irg_block_walk, (ctx, irg, node, pre, post))
265 #define hook_merge_nodes(new_node_array, new_num_entries, old_node_array, old_num_entries, opt) \
266 hook_exec(hook_merge_nodes, (ctx, new_node_array, new_num_entries, old_node_array, old_num_entries, opt))
267 #define hook_reassociate(start) hook_exec(hook_reassociate, (ctx, start))
268 #define hook_lower(node) hook_exec(hook_lower, (ctx, node))
269 #define hook_inline(call, irg) hook_exec(hook_inline, (ctx, call, irg))
270 #define hook_tail_rec(irg, n_calls) hook_exec(hook_tail_rec, (ctx, irg, n_calls))
271 #define hook_strength_red(irg, node) \
272 hook_exec(hook_strength_red, (ctx, irg, node))
273 #define hook_dead_node_elim(irg, start) hook_exec(hook_dead_node_elim, (ctx, irg, start))
274 #define hook_dead_node_elim_subst(irg, old, nw) \
275 hook_exec(hook_dead_node_elim_subst, (ctx, irg, old, nw))
276 #define hook_if_conversion(irg, phi, pos, mux, reason) \
277 hook_exec(hook_if_conversion, (ctx, irg, phi, pos, mux, reason))
278 #define hook_func_call(irg, call) \
279 hook_exec(hook_func_call, (ctx, irg, call))
280 #define hook_arch_dep_replace_mul_with_shifts(irn) \
281 hook_exec(hook_arch_dep_replace_mul_with_shifts, (ctx, irn))
282 #define hook_arch_dep_replace_division_by_const(irn) \
283 hook_exec(hook_arch_dep_replace_division_by_const, (ctx, irn))
284 #define hook_new_mode(tmpl, mode) hook_exec(hook_new_mode, (ctx, tmpl, mode))
285 #define hook_new_entity(ent) hook_exec(hook_new_entity, (ctx, ent))
286 #define hook_new_type(tp) hook_exec(hook_new_type, (ctx, tp))
287 #define hook_node_info(F, node) hook_exec(hook_node_info, (ctx, F, node))