+2005-05-29 Kazu Hirata <kazu@cs.umass.edu>
+
+ * cgraphunit.c, ipa-inline.c, loop-iv.c, modulo-sched.c,
+ opts.c, postreload-gcse.c, tree-browser.def, tree-eh.c,
+ tree-ssa-copyrename.c, tree-vect-analyze.c: Fix typos and
+ follow spelling conventions in error/dump messages.
+
+2005-05-29 Roger Sayle <roger@eyesopen.com>
+ Richard Henderson <rth@redhat.com>
+
+ * ifcvt.c (noce_emit_move_insn): Construct a SET pattern directly
+ if the RHS isn't suitable for calling emit_move_insn.
+
+2005-05-29 Kazu Hirata <kazu@cs.umass.edu>
+
+ * tree-ssa-ccp.c (ccp_fold): Return immediately after calling
+ fold_unary and fold_binary.
+
+2005-05-29 Roger Sayle <roger@eyesopen.com>
+
+ * reg-stack.c (propagate_stack): Always copy the source stack to
+ the destination. This routine is now only called when this is safe.
+ (better_edge): New function split out from convert_regs_1 to
+ determine which of two edges is better to propagate across.
+ (convert_regs_1): We need only search for a best edge if the
+ stack layout hasn't been defined yet. Use better_edge to help
+ find beste. No longer traverse unnecessary edges.
+
+2005-05-29 Keith Besaw <kbesaw@us.ibm.com>
+
+ * tree-ssa-alias.c (new_type_alias): New procedure to
+ create a type memory tag for a pointer with a may-alias
+ set determined from a variable declaration.
+ * tree-flow.h: export declaration of new_type_alias
+ * tree-optimize.c (init_tree_optimization_passes): document
+ that pass_may_alias cannot be called after pass_vectorize.
+ * tree-vect-transform (vect_create_data_ref_ptr): Call
+ new_type_alias when an type memory tag isn't available
+ for a reference.
+ (vectorizable_store): Use copy_virtual_operands to update
+ virtual defs in place (so that loop_version can be called).
+ Call mark_for_renaming for the virtual defs in case peeling
+ is done and virtual uses outside the loop need to be updated.
+
+2005-05-29 Dorit Naishlos <dorit@il.ibm.com>
+
+ PR tree-optimization/21639
+ * tree-complex.c (pass_lower_vector_s): Remove TODO_ggc_collect.
+
+2005-05-29 Jan Hubicka <jh@suse.cz>
+
+ PR tree-optimization/21562
+ * cfgexpand.c (construct_init_block): Deal properly with the case
+ of entry edge not pointing to very first basic block.
+
2005-05-28 Kazu Hirata <kazu@cs.umass.edu>
* tree-ssa-ccp.c (ccp_fold): Remove code that produces
- non-gimple min minvariant.
+ non-gimple min invariant.
+
+ * Makefile.in (OBJS-common): Add tree-cfgcleanup.o.
+ * tree-flow.h: Add prototypes for start_recording_case_labels
+ and end_recording_case_labels.
+ * tree-cfg.c (start_recording_case_labels,
+ end_recording_case_labels): Export.
+ (cleanup_tree_cfg_loop, modified_noreturn_calls,
+ cleanup_control_flow, cleanup_control_expr_graph,
+ remove_fallthru_edge, phi_alternatives_equal,
+ tree_forwarder_block_p, has_abnormal_incoming_edge_p,
+ remove_forwarder_block, cleanup_forwarder_blocks,
+ remove_forwarder_block_with_phi, merge_phi_nodes,
+ gate_merge_phi, pass_merge_phi): Move to ...
+ * tree-cfgcleanup.c: ... here.
+
+ * basic-block.h: Remove forward declaration of bb_ann_d.
2005-05-28 Jan Hubicka <jh@suse.cz>
OSDN Git Service
