libFirm
 All Data Structures Functions Variables Typedefs Enumerations Enumerator Groups Pages
iroptimize.h
1 /*
2  * This file is part of libFirm.
3  * Copyright (C) 2012 University of Karlsruhe.
4  */
5 
10 #ifndef FIRM_IROPTIMIZE_H
11 #define FIRM_IROPTIMIZE_H
12 
13 #include "firm_types.h"
14 #include "begin.h"
15 
32 FIRM_API void optimize_cf(ir_graph *irg);
33 
39 FIRM_API void opt_jumpthreading(ir_graph* irg);
40 
47 FIRM_API void opt_bool(ir_graph *irg);
48 
54 FIRM_API void conv_opt(ir_graph *irg);
55 
60 typedef int (*check_alloc_entity_func)(ir_entity *ent);
61 
84 FIRM_API void optimize_funccalls(void);
85 
95 FIRM_API void do_gvn_pre(ir_graph *irg);
96 
108 typedef int (*arch_allow_ifconv_func)(ir_node const *sel,
109  ir_node const *mux_false,
110  ir_node const *mux_true);
111 
120 FIRM_API void opt_if_conv(ir_graph *irg);
121 
131 FIRM_API void opt_if_conv_cb(ir_graph *irg, arch_allow_ifconv_func callback);
132 
138 FIRM_API void opt_parallelize_mem(ir_graph *irg);
139 
151 FIRM_API ir_node *can_replace_load_by_const(const ir_node *load, ir_node *c);
152 
178 FIRM_API void optimize_load_store(ir_graph *irg);
179 
183 FIRM_API void combine_memops(ir_graph *irg);
184 
190 FIRM_API void opt_ldst(ir_graph *irg);
191 
202 FIRM_API void opt_frame_irg(ir_graph *irg);
203 
205 typedef enum osr_flags {
212 } osr_flags;
213 
215 #define osr_flag_default osr_flag_lftr_with_ov_check
216 
273 FIRM_API void opt_osr(ir_graph *irg, unsigned flags);
274 
285 FIRM_API void remove_phi_cycles(ir_graph *irg);
286 
288 #define DEFAULT_CLONE_THRESHOLD 20
289 
301 FIRM_API void proc_cloning(float threshold);
302 
317 FIRM_API void optimize_reassociation(ir_graph *irg);
318 
339 FIRM_API void normalize_one_return(ir_graph *irg);
340 
361 FIRM_API void normalize_n_returns(ir_graph *irg);
362 
370 FIRM_API void scalar_replacement_opt(ir_graph *irg);
371 
386 FIRM_API void opt_tail_rec_irg(ir_graph *irg);
387 
397 FIRM_API void combo(ir_graph *irg);
398 
400 typedef void (*opt_ptr)(ir_graph *irg);
401 
413 FIRM_API void inline_functions(unsigned maxsize, int inline_threshold,
414  opt_ptr after_inline_opt);
415 
421 FIRM_API void shape_blocks(ir_graph *irg);
422 
428 FIRM_API void do_loop_inversion(ir_graph *irg);
429 
435 FIRM_API void do_loop_unrolling(ir_graph *irg);
436 
440 FIRM_API void do_loop_peeling(ir_graph *irg);
441 
450 FIRM_API void garbage_collect_entities(void);
451 
471 FIRM_API void dead_node_elimination(ir_graph *irg);
472 
487 FIRM_API void place_code(ir_graph *irg);
488 
493 FIRM_API void occult_consts(ir_graph*);
494 
502 FIRM_API int value_not_null(const ir_node *n, const ir_node **confirm);
503 
511 FIRM_API ir_tarval *computed_value_Cmp_Confirm(ir_node *left, ir_node *right,
512  ir_relation relation);
513 
518 FIRM_API ir_entity *create_compilerlib_entity(char const *name, ir_type *mt);
519 
522 #include "end.h"
523 
524 #endif
void optimize_reassociation(ir_graph *irg)
Reassociation.
void opt_osr(ir_graph *irg, unsigned flags)
Performs the Operator Scalar Replacement optimization and linear function test replacement for loop c...
void opt_frame_irg(ir_graph *irg)
Optimize the frame type of an irg by removing never touched entities.
void opt_jumpthreading(ir_graph *irg)
Perform path-sensitive jump threading on the given graph.
void optimize_load_store(ir_graph *irg)
Load/Store optimization.
void normalize_n_returns(ir_graph *irg)
Normalize the Returns of a graph by moving the Returns upwards as much as possible.
void combo(ir_graph *irg)
CLiff Click's combo algorithm from "Combining Analyses, combining Optimizations". ...
void occult_consts(ir_graph *)
This optimization finds values where the bits are either constant or irrelevant and exchanges them fo...
void optimize_funccalls(void)
Optimize function calls by handling const functions.
do linear function test replacement only if no overflow can occur.
Definition: iroptimize.h:207
void opt_parallelize_mem(ir_graph *irg)
Tries to reduce dependencies for memory nodes where possible by parallelizing them and synchronizing ...
void remove_phi_cycles(ir_graph *irg)
Removes useless Phi cycles, i.e cycles of Phi nodes with only one non-Phi node.
void normalize_one_return(ir_graph *irg)
Normalize the Returns of a graph by creating a new End block with One Return(Phi).
void garbage_collect_entities(void)
Removes all entities which are unused.
struct ir_graph ir_graph
Procedure Graph.
Definition: firm_types.h:74
ignore Multiplications by 2, 4, 8
Definition: iroptimize.h:209
struct ir_node ir_node
Procedure Graph Node.
Definition: firm_types.h:53
ir_entity * create_compilerlib_entity(char const *name, ir_type *mt)
Constructs the entity for a given function using the current compilerlib entity creation callback...
void do_loop_inversion(ir_graph *irg)
Perform loop inversion on a given graph.
struct ir_type ir_type
Type.
Definition: firm_types.h:71
ir_tarval * computed_value_Cmp_Confirm(ir_node *left, ir_node *right, ir_relation relation)
Returns the value of a Cmp if one or both predecessors are Confirm nodes.
do NOT increase register pressure by introducing new induction variables.
Definition: iroptimize.h:210
void combine_memops(ir_graph *irg)
Combine adjacent "small" load/store operations into bigger ones.
osr_flags
Possible flags for the Operator Scalar Replacement.
Definition: iroptimize.h:205
void do_loop_peeling(ir_graph *irg)
Perform loop peeling on a given graph.
no additional flags
Definition: iroptimize.h:206
int(* arch_allow_ifconv_func)(ir_node const *sel, ir_node const *mux_false, ir_node const *mux_true)
This function is called to evaluate, if a mux(sel, mux_false, mux_true) should be built for the curre...
Definition: iroptimize.h:108
void scalar_replacement_opt(ir_graph *irg)
Performs the scalar replacement optimization.
struct ir_entity ir_entity
Entity.
Definition: firm_types.h:83
void opt_ldst(ir_graph *irg)
New experimental alternative to optimize_load_store.
int value_not_null(const ir_node *n, const ir_node **confirm)
Returns true if the value n is known not be zero/null.
void opt_tail_rec_irg(ir_graph *irg)
Optimizes tail-recursion calls by converting them into loops.
int(* check_alloc_entity_func)(ir_entity *ent)
A callback that checks whether a entity is an allocation routine.
Definition: iroptimize.h:60
void opt_if_conv(ir_graph *irg)
Perform If conversion on a graph.
void proc_cloning(float threshold)
Performs procedure cloning.
void optimize_cf(ir_graph *irg)
Control flow optimization.
void do_gvn_pre(ir_graph *irg)
Does Partial Redundancy Elimination combined with Global Value Numbering.
struct ir_tarval ir_tarval
Target Machine Value.
Definition: firm_types.h:68
void inline_functions(unsigned maxsize, int inline_threshold, opt_ptr after_inline_opt)
Heuristic inliner.
void shape_blocks(ir_graph *irg)
Combines congruent blocks into one.
ir_relation
Relations for comparing numbers.
Definition: firm_types.h:162
void opt_bool(ir_graph *irg)
Simplifies boolean expression in the given ir graph.
void place_code(ir_graph *irg)
Code Placement.
void opt_if_conv_cb(ir_graph *irg, arch_allow_ifconv_func callback)
Perform If conversion on a graph - callback version.
void dead_node_elimination(ir_graph *irg)
Performs dead node elimination by copying the ir graph to a new obstack.
void conv_opt(ir_graph *irg)
Reduces the number of Conv nodes in the given ir graph.
void do_loop_unrolling(ir_graph *irg)
Perform loop unrolling on a given graph.
void(* opt_ptr)(ir_graph *irg)
pointer to an optimization function
Definition: iroptimize.h:400
ir_node * can_replace_load_by_const(const ir_node *load, ir_node *c)
Check if we can replace the load by a given const from the const code irg.