From e337c1fd3af03c45e9b6cfaadca5d39b5a05131e Mon Sep 17 00:00:00 2001 From: Michael Beck Date: Fri, 8 Oct 2010 19:29:19 +0000 Subject: [PATCH] Moved enum into firm_types, fixed some typos. [r28076] --- include/libfirm/firm_types.h | 15 +++++++++++++- include/libfirm/iroptimize.h | 39 ++++++++++++------------------------ 2 files changed, 27 insertions(+), 27 deletions(-) diff --git a/include/libfirm/firm_types.h b/include/libfirm/firm_types.h index 889ef132f..2f5dee17f 100644 --- a/include/libfirm/firm_types.h +++ b/include/libfirm/firm_types.h @@ -1,5 +1,5 @@ /* - * 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. * @@ -70,6 +70,9 @@ typedef void irg_reg_walk_func(ir_region *, void *); typedef struct ir_settings_arch_dep_t ir_settings_arch_dep_t; typedef struct ir_settings_if_conv_t ir_settings_if_conv_t; +/* Needed for MSVC to suppress warnings because it doest NOT handle const right. */ +typedef const ir_node *ir_node_cnst_ptr; + /* states */ /** @@ -213,6 +216,16 @@ enum pn_generic { pn_Generic_other = 3 /**< First free projection number */ }; +/** + * Possible return values of value_classify(). + */ +typedef enum { + 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; + #include "end.h" #endif diff --git a/include/libfirm/iroptimize.h b/include/libfirm/iroptimize.h index 9aa0e1d4e..347c75d1c 100644 --- a/include/libfirm/iroptimize.h +++ b/include/libfirm/iroptimize.h @@ -1,5 +1,5 @@ /* - * 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. * @@ -275,9 +275,9 @@ FIRM_API void opt_if_conv(ir_graph *irg); 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); @@ -530,7 +530,7 @@ FIRM_API ir_prog_pass_t *proc_cloning_pass(const char *name, float threshold); * 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 @@ -779,7 +779,7 @@ FIRM_API ir_graph_pass_t *combo_pass(const char *name); * 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 @@ -800,20 +800,20 @@ FIRM_API ir_graph_pass_t *inline_small_irgs_pass(const char *name, int size); /** * 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. @@ -829,7 +829,7 @@ FIRM_API void inline_leave_functions(unsigned maxsize, unsigned leavesize, * @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. @@ -978,7 +978,7 @@ FIRM_API ir_prog_pass_t *garbage_collect_entities_pass(const char *name); * * 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). @@ -1060,7 +1060,7 @@ FIRM_API void place_code(ir_graph *irg); 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. */ @@ -1069,7 +1069,7 @@ FIRM_API void fixpoint_vrp(ir_graph*); /** * 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. * @@ -1079,9 +1079,6 @@ FIRM_API void fixpoint_vrp(ir_graph*); */ 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. * @@ -1109,16 +1106,6 @@ FIRM_API int value_not_zero(const ir_node *n, ir_node_cnst_ptr *confirm); */ 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 -- 2.20.1