/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2010 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
*/
FIRM_API ir_graph_pass_t *opt_jumpthreading_pass(const char *name);
-/**
- * Creates an ir_graph pass for opt_loopunroll().
- *
- * @param name the name of this pass or NULL
- *
- * @return the newly created ir_graph pass
- */
-FIRM_API ir_graph_pass_t *opt_loopunroll_pass(const char *name);
-
-
/**
* Try to simplify boolean expression in the given ir graph.
* eg. x < 5 && x < 6 becomes x < 5
*/
FIRM_API ir_graph_pass_t *conv_opt_pass(const char *name);
-/**
- * Do the scalar replacement optimization.
- * Make a date flow analyze and split the
- * data flow edges.
- *
- * @param irg the graph which should be optimized
- */
-FIRM_API void data_flow_scalar_replacement_opt(ir_graph *irg);
-
/**
* A callback that checks whether a entity is an allocation
* routine.
FIRM_API ir_graph_pass_t *opt_if_conv_pass(const char *name);
/**
- * Tries to reduce dependencies for memory nodes where possible by parllelizing
- * them and synchronising with Sync nodes
- * @param irg the graph where memory operations should be parallelised
+ * Tries to reduce dependencies for memory nodes where possible by parallelizing
+ * them and synchronizing with Sync nodes
+ * @param irg the graph where memory operations should be parallelized
*/
FIRM_API void opt_parallelize_mem(ir_graph *irg);
*
* @param irg The graph whose loops will be processed
*
- * This function did not change the graph, only it's frame type.
+ * This function did not change the graph, only its frame type.
* The layout state of the frame type will be set to layout_undefined
* if entities were removed.
*/
*
* @param irg The graph whose frame type will be optimized
*
- * This function did not change the graph, only it's frame type.
+ * This function did not change the graph, only its frame type.
* The layout state of the frame type will be set to layout_undefined
* if entities were removed.
*/
* and for address expression.
* Works only if Constant folding is activated.
*
- * Uses loop information to detect loop-invariant (ie contant
+ * Uses loop information to detect loop-invariant (i.e. contant
* inside the loop) values.
*
* See Muchnik 12.3.1 Algebraic Simplification and Reassociation of
*/
FIRM_API ir_graph_pass_t *scalar_replacement_opt_pass(const char *name);
-/** Performs strength reduction for the passed graph. */
-FIRM_API void reduce_strength(ir_graph *irg);
-
/**
* Optimizes tail-recursion calls by converting them into loops.
* Depends on the flag opt_tail_recursion.
* size are inlined. Further only a limited number of calls are inlined.
* If the method contains more than 1024 inlineable calls none will be
* inlined.
- * Inlining is only performed if flags `optimize' and `inlineing' are set.
+ * Inlining is only performed if flags `optimize' and `inlining' are set.
* The graph may not be in state phase_building.
* It is recommended to call local_optimize_graph() after inlining as this
* function leaves a set of obscure Tuple nodes, e.g. a Proj-Tuple-Jmp
/**
* Inlineing with a different heuristic than inline_small_irgs().
*
- * Inlines leave functions. If inlinening creates new leave
+ * Inlines leave functions. If inlining creates new leave
* function inlines these, too. (If g calls f, and f calls leave h,
* h is first inlined in f and then f in g.)
*
* Then inlines all small functions (this is not recursive).
*
- * For a heuristic this inlineing uses firm node counts. It does
+ * For a heuristic this inlining uses firm node counts. It does
* not count auxiliary nodes as Proj, Tuple, End, Start, Id, Sync.
* If the ignore_runtime flag is set, calls to functions marked with the
* mtp_property_runtime property are ignored.
*
* @param maxsize Do not inline any calls if a method has more than
* maxsize firm nodes. It may reach this limit by
- * inlineing.
+ * inlining.
* @param leavesize Inline leave functions if they have less than leavesize
* nodes.
* @param size Inline all function smaller than size.
* @param name the name of this pass or NULL
* @param maxsize Do not inline any calls if a method has more than
* maxsize firm nodes. It may reach this limit by
- * inlineing.
+ * inlining.
* @param leavesize Inline leave functions if they have less than leavesize
* nodes.
* @param size Inline all function smaller than size.
*
* Dead_node_elimination is only performed if options `optimize' and
* `opt_dead_node_elimination' are set. The graph may
- * not be in state phase_building. The outs datasturcture is freed,
+ * not be in state phase_building. The outs datastructure is freed,
* the outs state set to outs_none. Backedge information is conserved.
* Removes old attributes of nodes. Sets link field to NULL.
* Callee information must be freed (irg_callee_info_none).
FIRM_API ir_graph_pass_t *place_code_pass(const char *name);
/**
- * Determine information about the values of nodes and perform simplications
+ * Determine information about the values of nodes and perform simplifications
* using this information. This optimization performs a data-flow analysis to
* find the minimal fixpoint.
*/
/**
* Creates an ir_graph pass for fixpoint_vrp().
* This pass dDetermines information about the values of nodes
- * and perform simplications using this information.
+ * and perform simplifications using this information.
* This optimization performs a data-flow analysis to
* find the minimal fixpoint.
*
*/
FIRM_API ir_graph_pass_t *fixpoint_vrp_irg_pass(const char *name);
-/** Needed for MSVC to suppress warnings because it doest NOT handle const right. */
-typedef const ir_node *ir_node_cnst_ptr;
-
/**
* Check, if the value of a node is != 0.
*
*/
FIRM_API int value_not_null(const ir_node *n, ir_node_cnst_ptr *confirm);
-/**
- * Possible return values of value_classify().
- */
-typedef enum ir_value_classify_sign {
- value_classified_unknown = 0, /**< could not classify */
- value_classified_positive = 1, /**< value is positive, i.e. >= 0 */
- value_classified_negative = -1 /**< value is negative, i.e. <= 0 if
- no signed zero exists or < 0 else */
-} ir_value_classify_sign;
-
/**
* Check, if the value of a node can be confirmed >= 0 or <= 0,
* If the mode of the value did not honor signed zeros, else
* Return the value of a Cmp if one or both predecessors
* are Confirm nodes.
*
- * @param cmp the compare node that will be evaluated
- * @param left the left operand of the Cmp
- * @param right the right operand of the Cmp
- * @param pnc the compare relation
+ * @param cmp the compare node that will be evaluated
+ * @param left the left operand of the Cmp
+ * @param right the right operand of the Cmp
+ * @param relation the compare relation
*/
FIRM_API ir_tarval *computed_value_Cmp_Confirm(
- ir_node *cmp, ir_node *left, ir_node *right, pn_Cmp pnc);
+ const ir_node *cmp, ir_node *left, ir_node *right, ir_relation relation);
#include "end.h"
projects / libfirm / blobdiff