Some aspect of GCC memory consumption increased by recent patch
Jan Hubicka
jh@suse.cz
Tue Sep 28 16:30:00 GMT 2004
> Hi,
> Comparing memory consumption on compilation of combine.i and generate-3.4.ii I got:
Hi,
up to 3% memory consumption increase looks pretty serious even tought we
save some memory on generate-3.4.ii. Is there some understanding why it
happens and/or some hope that it will get solved?
Honza
>
>
> comparing combine.c compilation at -O0 level:
> Overall memory allocated via mmap and sbrk increased from 24733k to 25261k, overall 2.13%
> Peak amount of GGC memory allocated before garbage collecting increased from 9296k to 9345k, overall 0.53%
> Peak amount of GGC memory still allocated after garbage collectin increased from 8607k to 8657k, overall 0.58%
> Amount of produced GGC garbage increased from 42621k to 43119k, overall 1.17%
> Overall memory needed: 24733k -> 25261k
> Peak memory use before GGC: 9296k -> 9345k
> Peak memory use after GGC: 8607k -> 8657k
> Maximum of released memory in single GGC run: 2870k -> 2939k
> Garbage: 42621k -> 43119k
> Leak: 6090k -> 6090k
> Overhead: 5587k -> 5694k
> GGC runs: 363
>
> comparing combine.c compilation at -O1 level:
> Overall memory allocated via mmap and sbrk increased from 26609k to 26669k, overall 0.23%
> Peak amount of GGC memory allocated before garbage collecting increased from 9377k to 9426k, overall 0.52%
> Peak amount of GGC memory still allocated after garbage collectin increased from 8800k to 8872k, overall 0.82%
> Amount of produced GGC garbage increased from 69227k to 70247k, overall 1.47%
> Overall memory needed: 26609k -> 26669k
> Peak memory use before GGC: 9377k -> 9426k
> Peak memory use after GGC: 8800k -> 8872k
> Maximum of released memory in single GGC run: 2025k -> 2070k
> Garbage: 69227k -> 70247k
> Leak: 6674k -> 6674k
> Overhead: 11107k -> 11303k
> GGC runs: 575 -> 578
>
> comparing combine.c compilation at -O2 level:
> Overall memory allocated via mmap and sbrk increased from 29885k to 29917k, overall 0.11%
> Amount of produced GGC garbage increased from 84279k to 85398k, overall 1.33%
> Overall memory needed: 29885k -> 29917k
> Peak memory use before GGC: 12772k -> 12773k
> Peak memory use after GGC: 12613k
> Maximum of released memory in single GGC run: 2525k -> 2593k
> Garbage: 84279k -> 85398k
> Leak: 6428k -> 6428k
> Overhead: 15639k -> 15850k
> GGC runs: 571 -> 576
>
> comparing combine.c compilation at -O3 level:
> Peak amount of GGC memory allocated before garbage collecting increased from 13044k to 13082k, overall 0.29%
> Peak amount of GGC memory still allocated after garbage collectin increased from 12692k to 12727k, overall 0.28%
> Amount of produced GGC garbage increased from 112197k to 113921k, overall 1.54%
> Amount of memory still referenced at the end of compilation increased from 6929k to 6940k, overall 0.16%
> Overall memory needed: 21480k -> 21456k
> Peak memory use before GGC: 13044k -> 13082k
> Peak memory use after GGC: 12692k -> 12727k
> Maximum of released memory in single GGC run: 3356k -> 3462k
> Garbage: 112197k -> 113921k
> Leak: 6929k -> 6940k
> Overhead: 20688k -> 20997k
> GGC runs: 637 -> 641
>
> comparing insn-attrtab.c compilation at -O0 level:
> Overall memory allocated via mmap and sbrk increased from 116476k to 118920k, overall 2.10%
> Peak amount of GGC memory allocated before garbage collecting increased from 77101k to 79665k, overall 3.33%
> Peak amount of GGC memory still allocated after garbage collectin increased from 45186k to 46310k, overall 2.49%
> Amount of produced GGC garbage increased from 159508k to 163564k, overall 2.54%
> Overall memory needed: 116476k -> 118920k
> Peak memory use before GGC: 77101k -> 79665k
> Peak memory use after GGC: 45186k -> 46310k
> Maximum of released memory in single GGC run: 42129k -> 43569k
> Garbage: 159508k -> 163564k
> Leak: 10645k -> 10645k
> Overhead: 19805k -> 20607k
> GGC runs: 309 -> 307
>
> comparing insn-attrtab.c compilation at -O1 level:
> Overall memory allocated via mmap and sbrk increased from 133072k to 134928k, overall 1.39%
> Peak amount of GGC memory allocated before garbage collecting increased from 93162k to 95523k, overall 2.53%
> Peak amount of GGC memory still allocated after garbage collectin increased from 71529k to 73511k, overall 2.77%
> Amount of produced GGC garbage increased from 453089k to 463073k, overall 2.20%
> Overall memory needed: 133072k -> 134928k
> Peak memory use before GGC: 93162k -> 95523k
> Peak memory use after GGC: 71529k -> 73511k
> Maximum of released memory in single GGC run: 41234k -> 42593k
> Garbage: 453089k -> 463073k
> Leak: 11078k -> 11078k
> Overhead: 73707k -> 75712k
> GGC runs: 461 -> 462
>
> comparing insn-attrtab.c compilation at -O2 level:
> Overall memory allocated via mmap and sbrk increased from 207744k to 210888k, overall 1.51%
> Peak amount of GGC memory allocated before garbage collecting increased from 108721k to 111082k, overall 2.17%
> Peak amount of GGC memory still allocated after garbage collectin increased from 87088k to 89070k, overall 2.28%
> Amount of produced GGC garbage increased from 502463k to 513624k, overall 2.22%
> Overall memory needed: 207744k -> 210888k
> Peak memory use before GGC: 108721k -> 111082k
> Peak memory use after GGC: 87088k -> 89070k
> Maximum of released memory in single GGC run: 34490k -> 36136k
> Garbage: 502463k -> 513624k
> Leak: 11210k -> 11213k
> Overhead: 83073k -> 85261k
> GGC runs: 384 -> 386
>
> comparing insn-attrtab.c compilation at -O3 level:
> Overall memory allocated via mmap and sbrk increased from 207744k to 211168k, overall 1.65%
> Peak amount of GGC memory allocated before garbage collecting increased from 108726k to 111087k, overall 2.17%
> Peak amount of GGC memory still allocated after garbage collectin increased from 87093k to 89075k, overall 2.28%
> Amount of produced GGC garbage increased from 503616k to 514783k, overall 2.22%
> Overall memory needed: 207744k -> 211168k
> Peak memory use before GGC: 108726k -> 111087k
> Peak memory use after GGC: 87093k -> 89075k
> Maximum of released memory in single GGC run: 34491k -> 36136k
> Garbage: 503616k -> 514783k
> Leak: 11256k -> 11259k
> Overhead: 83469k -> 85657k
> GGC runs: 393 -> 394
>
> comparing Gerald's testcase PR8361 compilation at -O0 level:
> Overall memory needed: 115352k -> 114044k
> Peak memory use before GGC: 92231k -> 90997k
> Peak memory use after GGC: 90025k -> 89747k
> Maximum of released memory in single GGC run: 20139k -> 20088k
> Garbage: 265681k -> 262334k
> Leak: 60277k -> 60277k
> Overhead: 47198k -> 47622k
> GGC runs: 378 -> 374
>
> comparing Gerald's testcase PR8361 compilation at -O1 level:
> Ovarall memory allocated via mmap and sbrk decreased from 109988k to 105252k, overall -4.50%
> Peak amount of GGC memory allocated before garbage collecting run decreased from 95750k to 90059k, overall -6.32%
> Amount of produced GGC garbage increased from 594441k to 596609k, overall 0.36%
> Overall memory needed: 109988k -> 105252k
> Peak memory use before GGC: 95750k -> 90059k
> Peak memory use after GGC: 88882k -> 88623k
> Maximum of released memory in single GGC run: 19569k -> 19791k
> Garbage: 594441k -> 596609k
> Leak: 62357k -> 62370k
> Overhead: 131028k -> 131721k
> GGC runs: 605 -> 606
>
> comparing Gerald's testcase PR8361 compilation at -O2 level:
> Ovarall memory allocated via mmap and sbrk decreased from 110300k to 105700k, overall -4.35%
> Peak amount of GGC memory allocated before garbage collecting run decreased from 95751k to 90059k, overall -6.32%
> Amount of produced GGC garbage increased from 647338k to 649619k, overall 0.35%
> Overall memory needed: 110300k -> 105700k
> Peak memory use before GGC: 95751k -> 90059k
> Peak memory use after GGC: 88883k -> 88623k
> Maximum of released memory in single GGC run: 19570k -> 19790k
> Garbage: 647338k -> 649619k
> Leak: 62911k -> 62924k
> Overhead: 154291k -> 155008k
> GGC runs: 639 -> 636
>
> comparing Gerald's testcase PR8361 compilation at -O3 level:
> Amount of produced GGC garbage increased from 682722k to 685587k, overall 0.42%
> Overall memory needed: 108004k -> 108024k
> Peak memory use before GGC: 91612k -> 91627k
> Peak memory use after GGC: 90197k -> 90205k
> Maximum of released memory in single GGC run: 20252k -> 20194k
> Garbage: 682722k -> 685587k
> Leak: 63340k -> 63352k
> Overhead: 163439k -> 164188k
> GGC runs: 626
>
> Head of changelog is:
>
> --- /usr/src/SpecTests/sandbox-britten-memory/x86_64/mem-result/ChangeLog 2004-09-28 00:18:42.000000000 +0000
> +++ /usr/src/SpecTests/sandbox-britten-memory/gcc/gcc/ChangeLog 2004-09-28 12:29:02.000000000 +0000
> @@ -1,3 +1,386 @@
> +2004-09-28 Kazu Hirata <kazu@cs.umass.edu>
> +
> + * basic-block.h: Fix a comment typo.
> +
> +2004-09-28 Kazu Hirata <kazu@cs.umass.edu>
> +
> + * optabs.c, optabs.h: Fix comment typos.
> +
> +2004-09-28 Eric Botcazou <ebotcazou@act-europe.fr>
> +
> + * config/sparc/sparc.md (call_address_struct_value_sp32):
> + Properly mask the immediate field of the 'unimp' instruction.
> + (call_symbolic_struct_value_sp32): Likewise.
> +
> +2004-09-24 Ben Elliston <bje@au.ibm.com>
> + Steven Bosscher <stevenb@suse.de>
> + Andrew Pinski <pinskia@physics.uc.edu>
> +
> + Merge from edge-vector-branch:
> + * basic-block.h: Include vec.h, errors.h. Instantiate a VEC(edge).
> + (struct edge_def): Remove pred_next, succ_next members.
> + (struct basic_block_def): Remove pred, succ members. Add preds
> + and succs members of type VEC(edge).
> + (FALLTHRU_EDGE): Redefine using EDGE_SUCC.
> + (BRANCH_EDGE): Likewise.
> + (EDGE_CRITICAL_P): Redefine using EDGE_COUNT.
> + (EDGE_COUNT, EDGE_I, EDGE_PRED, EDGE_SUCC): New.
> + (edge_iterator): New.
> + (ei_start, ei_last, ei_end_p, ei_one_before_end_p): New.
> + (ei_next, ei_prev, ei_edge, ei_safe_edge): Likewise.
> + (FOR_EACH_EDGE): New.
> + * bb-reorder.c (find_traces): Use FOR_EACH_EDGE and EDGE_* macros
> + where applicable.
> + (rotate_loop): Likewise.
> + (find_traces_1_route): Likewise.
> + (bb_to_key): Likewise.
> + (connect_traces): Likewise.
> + (copy_bb_p): Likewise.
> + (find_rarely_executed_basic_blocks_and_crossing_edges): Likewise.
> + (add_labels_and_missing_jumps): Likewise.
> + (fix_up_fall_thru_edges): Likewise.
> + (find_jump_block): Likewise.
> + (fix_crossing_conditional_branches): Likewise.
> + (fix_crossing_unconditional_branches): Likewise.
> + (add_reg_crossing_jump_notes): Likewise.
> + * bt-load.c (augment_live_range): Likewise.
> + * cfg.c (clear_edges): Likewise.
> + (unchecked_make_edge): Likewise.
> + (cached_make_edge): Likewise.
> + (make_single_succ_edge): Likewise.
> + (remove_edge): Likewise.
> + (redirect_edge_succ_nodup): Likewise.
> + (check_bb_profile): Likewise.
> + (dump_flow_info): Likewise.
> + (alloc_aux_for_edges): Likewise.
> + (clear_aux_for_edges): Likewise.
> + (dump_cfg_bb_info): Likewise.
> + * cfganal.c (forwarder_block_p): Likewise.
> + (can_fallthru): Likewise.
> + (could_fall_through): Likewise.
> + (mark_dfs_back_edges): Likewise.
> + (set_edge_can_fallthru_flag): Likewise.
> + (find_unreachable_blocks): Likewise.
> + (create_edge_list): Likewise.
> + (verify_edge_list): Likewise.
> + (add_noreturn_fake_exit_edges): Likewise.
> + (connect_infinite_loops_to_exit): Likewise.
> + (flow_reverse_top_sort_order_compute): Likewise.
> + (flow_depth_first_order_compute): Likewise.
> + (flow_preorder_transversal_compute): Likewise.
> + (flow_dfs_compute_reverse_execute): Likewise.
> + (dfs_enumerate_from): Likewise.
> + (compute_dominance_frontiers_1): Likewise.
> + * cfgbuild.c (make_edges): Likewise.
> + (compute_outgoing_frequencies): Likewise.
> + (find_many_sub_basic_blocks): Likewise.
> + (find_sub_basic_blocks): Likewise.
> + * cfgcleanup.c (try_simplify_condjump): Likewise.
> + (thread_jump): Likewise.
> + (try_forward_edges): Likewise.
> + (merge_blocks_move): Likewise.
> + (outgoing_edges_match): Likewise.
> + (try_crossjump_to_edge): Likewise.
> + (try_crossjump_bb): Likewise.
> + (try_optimize_cfg): Likewise.
> + (merge_seq_blocks): Likewise.
> + * cfgexpand.c (expand_gimple_tailcall): Likewise.
> + (expand_gimple_basic_block): Likewise.
> + (construct_init_block): Likewise.
> + (construct_exit_block): Likewise.
> + * cfghooks.c (verify_flow_info): Likewise.
> + (dump_bb): Likewise.
> + (delete_basic_block): Likewise.
> + (split_edge): Likewise.
> + (merge_blocks): Likewise.
> + (make_forwarder_block): Likewise.
> + (tidy_fallthru_edges): Likewise.
> + (can_duplicate_block_p): Likewise.
> + (duplicate_block): Likewise.
> + * cfglayout.c (fixup_reorder_chain): Likewise.
> + (fixup_fallthru_exit_predecessor): Likewise.
> + (can_copy_bbs_p): Likewise.
> + (copy_bbs): Likewise.
> + * cfgloop.c (flow_loops_cfg_dump): Likewise.
> + (flow_loop_entry_edges_find): Likewise.
> + (flow_loop_exit_edges_find): Likewise.
> + (flow_loop_nodes_find): Likewise.
> + (mark_single_exit_loops): Likewise.
> + (flow_loop_pre_header_scan): Likewise.
> + (flow_loop_pre_header_find): Likewise.
> + (update_latch_info): Likewise.
> + (canonicalize_loop_headers): Likewise.
> + (flow_loops_find): Likewise.
> + (get_loop_body_in_bfs_order): Likewise.
> + (get_loop_exit_edges): Likewise.
> + (num_loop_branches): Likewise.
> + (verify_loop_structure): Likewise.
> + (loop_latch_edge): Likewise.
> + (loop_preheader_edge): Likewise.
> + * cfgloopanal.c (mark_irreducible_loops): Likewise.
> + (expected_loop_iterations): Likewise.
> + * cfgloopmanip.c (remove_bbs): Likewise.
> + (fix_bb_placement): Likewise.
> + (fix_irreducible_loops): Likewise.
> + (remove_path): Likewise.
> + (scale_bbs_frequencies): Likewise.
> + (loopify): Likewise.
> + (unloop): Likewise.
> + (fix_loop_placement): Likewise.
> + (loop_delete_branch_edge): Likewise.
> + (duplicate_loop_to_header_edge): Likewise.
> + (mfb_keep_just): Likewise.
> + (create_preheader): Likewise.
> + (force_single_succ_latches): Likewise.
> + (loop_split_edge_with): Likewise.
> + (create_loop_notes): Likewise.
> + * cfgrtl.c (rtl_split_block): Likewise.
> + (rtl_merge_blocks): Likewise.
> + (rtl_can_merge_blocks): Likewise.
> + (try_redirect_by_replacing_jump): Likewise.
> + (force_nonfallthru_and_redirect): Likewise.
> + (rtl_tidy_fallthru_edge): Likewise.
> + (commit_one_edge_insertion): Likewise.
> + (commit_edge_insertions): Likewise.
> + (commit_edge_insertions_watch_calls): Likewise.
> + (rtl_verify_flow_info_1): Likewise.
> + (rtl_verify_flow_info): Likewise.
> + (purge_dead_edges): Likewise.
> + (cfg_layout_redirect_edge_and_branch): Likewise.
> + (cfg_layout_can_merge_blocks_p): Likewise.
> + (rtl_flow_call_edges_add): Likewise.
> + * cse.c (cse_cc_succs): Likewise.
> + * df.c (hybrid_search): Likewise.
> + * dominance.c (calc_dfs_tree_nonrec): Likewise.
> + (calc_dfs_tree): Likewise.
> + (calc_idoms): Likewise.
> + (recount_dominator): Likewise.
> + * domwalk.c (walk_dominator_tree): Likewise.
> + * except.c (emit_to_new_bb_before): Likewise.
> + (connect_post_landing_pads): Likewise.
> + (sjlj_emit_function_enter): Likewise.
> + (sjlj_emit_function_exit): Likewise.
> + (finish_eh_generation): Likewise.
> + * final.c (compute_alignments): Likewise.
> + * flow.c (calculate_global_regs_live): Likewise.
> + (initialize_uninitialized_subregs): Likewise.
> + (init_propagate_block_info): Likewise.
> + * function.c (thread_prologue_and_epilogue_insns): Likewise.
> + * gcse.c (find_implicit_sets): Likewise.
> + (bypass_block): Likewise.
> + (bypass_conditional_jumps): Likewise.
> + (compute_pre_data): Likewise.
> + (insert_insn_end_bb): Likewise.
> + (insert_store): Likewise.
> + (remove_reachable_equiv_notes): Likewise.
> + * global.c (global_conflicts): Likewise.
> + (calculate_reg_pav): Likewise.
> + * graph.c (print_rtl_graph_with_bb): Likewise.
> + * ifcvt.c (mark_loop_exit_edges): Likewise.
> + (merge_if_block): Likewise.
> + (find_if_header): Likewise.
> + (block_jumps_and_fallthru_p): Likewise.
> + (find_if_block): Likewise.
> + (find_cond_trap): Likewise.
> + (block_has_only_trap): Likewise.
> + (find_if_case1): Likewise.
> + (find_if_case_2): Likewise.
> + * lambda-code.c (lambda_loopnest_to_gcc_loopnest): Likewise.
> + (perfect_nestify): Likewise.
> + * lcm.c (compute_antinout_edge): Likewise.
> + (compute_laterin): Likewise.
> + (compute_available): Likewise.
> + (compute_nearerout): Likewise.
> + * loop-doloop.c (doloop_modify): Likewise.
> + * loop-init.c (loop_optimizer_init): Likewise.
> + * loop-invariant.c (find_exits): Likewise.
> + * loop-iv.c (simplify_using_initial_values): Likewise.
> + (check_simple_exit): Likewise.
> + (find_simple_exit): Likewise.
> + * loop-unroll.c (peel_loop_completely): Likewise.
> + (unroll_loop_constant_iterations): Likewise.
> + (unroll_loop_runtime_iterations): Likewise.
> + * loop-unswitch.c (may_unswitch_on): Likewise.
> + (unswitch_loop): Likewise.
> + * modulo-sched.c (generate_prolog_epilog): Likewise.
> + (sms_schedule): Likewise.
> + * postreload-gcse.c (eliminate_partially_redundant_load):
> + Likewise.
> + * predict.c (can_predict_insn_p): Likewise.
> + (set_even_probabilities): Likewise.
> + (combine_predictions_for_bb): Likewise.
> + (predict_loops): Likewise.
> + (estimate_probability): Likewise.
> + (tree_predict_by_opcode): Likewise.
> + (tree_estimate_probability): Likewise.
> + (last_basic_block_p): Likewise.
> + (propagate_freq): Likewise.
> + (estimate_loops_at_level): Likewise.
> + (estimate_bb_frequencies): Likewise.
> + * profile.c (instrument_edges): Likewise.
> + (get_exec_counts): Likewise.
> + (compute_branch_probabilities): Likewise.
> + (branch_prob): Likewise.
> + * ra-build.c (live_in): Likewise.
> + * ra-rewrite.c (rewrite_program2): Likewise.
> + * ra.c (reg_alloc): Likewise.
> + * reg-stack.c (reg_to_stack): Likewise.
> + (convert_regs_entry): Likewise.
> + (compensate_edge): Likewise.
> + (convert_regs_1): Likewise,
> + (convert_regs_2): Likewise.
> + (convert_regs): Likewise.
> + * regrename.c (copyprop_hardreg_forward): Likewise.
> + * reload1.c (fixup_abnormal_edges): Likewise.
> + * sbitmap.c (sbitmap_intersection_of_succs): Likewise.
> + (sbitmap_insersection_of_preds): Likewise.
> + (sbitmap_union_of_succs): Likewise.
> + (sbitmap_union_of_preds): Likewise.
> + * sched-ebb.c (compute_jump_reg_dependencies): Likewise.
> + (fix_basic_block_boundaries): Likewise.
> + (sched_ebbs): Likewise.
> + * sched-rgn.c (build_control_flow): Likewise.
> + (find_rgns): Likewise.
> + * tracer.c (find_best_successor): Likewise.
> + (find_best_predecessor): Likewise.
> + (tail_duplicate): Likewise.
> + * tree-cfg.c (make_edges): Likewise.
> + (make_ctrl_stmt_edges): Likewise.
> + (make_goto_expr_edges): Likewise.
> + (tree_can_merge_blocks_p): Likewise.
> + (tree_merge_blocks): Likewise.
> + (cfg_remove_useless_stmts_bb): Likewise.
> + (remove_phi_nodes_and_edges_for_unreachable_block): Likewise.
> + (tree_block_forwards_to): Likewise.
> + (cleanup_control_expr_graph): Likewise.
> + (find_taken_edge): Likewise.
> + (dump_cfg_stats): Likewise.
> + (tree_cfg2vcg): Likewise.
> + (disband_implicit_edges): Likewise.
> + (tree_find_edge_insert_loc): Likewise.
> + (bsi_commit_edge_inserts): Likewise.
> + (tree_split_edge): Likewise.
> + (tree_verify_flow_info): Likewise.
> + (tree_make_forwarder_block): Likewise.
> + (tree_forwarder_block_p): Likewise.
> + (thread_jumps): Likewise.
> + (tree_try_redirect_by_replacing_jump): Likewise.
> + (tree_split_block): Likewise.
> + (add_phi_args_after_copy_bb): Likewise.
> + (rewrite_to_new_ssa_names_bb): Likewise.
> + (dump_function_to_file): Likewise.
> + (print_pred_bbs): Likewise.
> + (print_loop): Likewise.
> + (tree_flow_call_edges_add): Likewise.
> + (split_critical_edges): Likewise.
> + (execute_warn_function_return): Likewise.
> + (extract_true_false_edges_from_block): Likewise.
> + * tree-if-conv.c (tree_if_conversion): Likewise.
> + (if_convertable_bb_p): Likewise.
> + (find_phi_replacement_condition): Likewise.
> + (combine_blocks): Likewise.
> + * tree-into-ssa.c (compute_global_livein): Likewise.
> + (ssa_mark_phi_uses): Likewise.
> + (ssa_rewrite_initialize_block): Likewise.
> + (rewrite_add_phi_arguments): Likewise.
> + (ssa_rewrite_phi_arguments): Likewise.
> + (insert_phi_nodes_for): Likewise.
> + (rewrite_into_ssa): Likewise.
> + (rewrite_ssa_into_ssa): Likewise.
> + * tree-mudflap.c (mf_build_check_statement_for): Likewise.
> + * tree-outof-ssa.c (coalesce_abnormal_edges): Likewise.
> + (rewrite_trees): Likewise.
> + * tree-pretty-print.c (dump_bb_header): Likewise.
> + (dump_implicit_edges): Likewise.
> + * tree-sra.c (insert_edge_copies): Likewise.
> + (find_obviously_necessary_stmts): Likewise.
> + (remove_data_stmt): Likewise.
> + * tree-ssa-dom.c (thread_across_edge): Likewise.
> + (dom_opt_finalize_block): Likewise.
> + (single_incoming_edge_ignoring_loop_edges): Likewise.
> + (record_equivalences_from_incoming_edges): Likewise.
> + (cprop_into_successor_phis): Likewise.
> + * tree-ssa-live.c (live_worklist): Likewise.
> + (calculate_live_on_entry): Likewise.
> + (calculate_live_on_exit): Likewise.
> + * tree-ssa-loop-ch.c (should_duplicate_loop_header_p): Likewise.
> + (copy_loop_headers): Likewise.
> + * tree-ssa-loop-im.c (loop_commit_inserts): Likewise.
> + (fill_always_executed_in): Likewise.
> + * tree-ssa-loop-ivcanon.c (create_canonical_iv): Likewise.
> + * tree-ssa-loop-ivopts.c (find_interesting_uses): Likewise.
> + (compute_phi_arg_on_exit): Likewise.
> + * tree-ssa-loop-manip.c (add_exit_phis_edge): Likewise.
> + (get_loops_exit): Likewise.
> + (split_loop_exit_edge): Likewise.
> + (ip_normal_pos): Likewise.
> + * tree-ssa-loop-niter.c (simplify_using_initial_conditions):
> + Likewise.
> + * tree-ssa-phiopt.c (candidate_bb_for_phi_optimization): Likewise.
> + (replace_phi_with_stmt): Likewise.
> + (value_replacement): Likewise.
> + * tree-ssa-pre.c (compute_antic_aux): Likewise.
> + (insert_aux): Likewise.
> + (init_pre): Likewise.
> + * tree-ssa-propagate.c (simulate_stmt): Likewise.
> + (simulate_block): Likewise.
> + (ssa_prop_init): Likewise.
> + * tree-ssa-threadupdate.c (thread_block): Likewise.
> + (create_block_for_threading): Likewise.
> + (remove_last_stmt_and_useless_edges): Likewise.
> + * tree-ssa.c (verify_phi_args): Likewise.
> + (verify_ssa): Likewise.
> + * tree_tailcall.c (independent_of_stmt_p): Likewise.
> + (find_tail_calls): Likewise.
> + (eliminate_tail_call): Likewise.
> + (tree_optimize_tail_calls_1): Likewise.
> + * tree-vectorizer.c (vect_transform_loop): Likewise.
> + * var-tracking.c (prologue_stack_adjust): Likewise.
> + (vt_stack_adjustments): Likewise.
> + (vt_find_locations): Likewise.
> + * config/frv/frv.c (frv_ifcvt_modify_tests): Likewise.
> + * config/i386/i386.c (ix86_pad_returns): Likewise.
> + * config/ia64/ia64.c (ia64_expand_prologue): Likewise.
> + * config/rs6000/rs6000.c (rs6000_emit_prologue): Likewise.
> +
> +2004-09-28 Eric Botcazou <ebotcazou@libertysurf.fr>
> +
> + PR target/16532
> + * config/sparc/sparc.c (struct machine_function): New field
> + 'leaf_function_p' and 'prologue_data_valid_p'.
> + (sparc_leaf_function_p, sparc_prologue_data_valid_p): New macro
> + to conveniently access the above fields.
> + (TARGET_LATE_RTL_PROLOGUE_EPILOGUE): Delete.
> + (eligible_for_return_delay): Use 'sparc_leaf_function_p' instead
> + of the generic flavor 'current_function_uses_only_leaf_regs'.
> + (eligible_for_sibcall_delay): Likewise.
> + (sparc_expand_prologue): Compute 'sparc_leaf_function_p' and set
> + 'sparc_prologue_data_valid_p'. Use 'sparc_leaf_function_p'.
> + (sparc_asm_function_prologue): Add sanity check for the assumption
> + made in 'sparc_expand_prologue'. Use 'sparc_leaf_function_p'.
> + (sparc_can_use_return_insn_p): New function.
> + (sparc_expand_epilogue): Use 'sparc_leaf_function_p'.
> + (output_restore): Likewise.
> + (output_sibcall): Likewise.
> + (sparc_output_mi_thunk): Likewise.
> + * config/sparc/sparc-protos.h (sparc_can_use_return_insn_p): Declare.
> + * config/sparc/sparc.md (return): New expander.
> +
> + * config/sparc/sparc.h (INITIAL_ELIMINATION_OFFSET): Minor tweak.
> +
> +2004-09-27 Mark Mitchell <mark@codesourcery.com>
> +
> + PR c++/17642
> + * stor-layout.c (layout_decl): Use fold_convert, not convert.
> + (bit_from_pos): Likewise.
> + (byte_from_pos): Likewise.
> + (pos_from_bit): Likewise.
> + (normalize_offset): Likewise.
> + (place_field): Likewise.
> + (finalize_type_size): Likewise.
> + (layout_type): Likewise.
> + * tree.c (build_index_type): Likewise.
> +
> 2004-09-27 Devang Patel <dpatel@apple.com>
>
> * expr.c (expand_expr_real_1): Handle VEC_COND_EXPR.
> --- /usr/src/SpecTests/sandbox-britten-memory/x86_64/mem-result/ChangeLog.cp 2004-09-28 00:18:45.000000000 +0000
> +++ /usr/src/SpecTests/sandbox-britten-memory/gcc/gcc/cp/ChangeLog 2004-09-28 12:29:10.000000000 +0000
> @@ -1,6 +1,54 @@
> +2004-09-28 Kazu Hirata <kazu@cs.umass.edu>
> +
> + * tree.c: Fix a comment typo.
> +
> +2004-09-28 Nathan Sidwell <nathan@codesourcery.com>
> +
> + * class.c (VTT_TOP_LEVEL_P, VTT_MARKED_BINFO_P): Remove.
> + (struct secondary_vptr_vtt_init_data_s): New.
> + (build_vtt_inits): Adjust dfs_walkers.
> + (dfs_build_secondary_vptr_vtt_inits): Caller data is a
> + secondary_vptr_vtt_init_data_s structure. Adjust.
> + (dfs_ctor_vtable_bases_queue_p): Remove.
> + (dfs_fixup_binfo_vtbls): No need to clear BINFO_MARKED. Simplify.
> +
> + * pt.c (struct get_template_base_data_s): Remove.
> + (get_template_base_r): Fold into get_template_base.
> + (get_template_base): Walk base binfos directly in inheritance
> + graph order.
> +
> +2004-09-27 Mark Mitchell <mark@codesourcery.com>
> +
> + PR c++/17642
> + * cp-tree.h (fold_if_not_in_template): New function.
> + * call.c (build_conditional_expr): Use fold_if_not_in_template.
> + (build_cxx_call): Likewise.
> + * cvt.c (convert_to_complex): Likewise.
> + (ocp_convert): Likewise.
> + (convert): Likewise.
> + (convert_force): Likewise.
> + * decl.c (compute_array_index_type): Clear
> + processing_template_decl while folding array bounds.
> + * pt.c (convert_nontype_argument): Clear
> + processing_template_decl while processing non-type argument
> + initialization.
> + * tree.c (fold_if_not_in_template): New function.
> + * typeck.c (build_class_member_access_expr): Use
> + fold_if_not_in_template.
> + (build_array_ref): Likewise.
> + (build_binary_op): Likewise. Do not try to optimize computations
> + when processing templates.
> + (cp_pointer_int_sum): Use fold_if_not_in_template.
> + (pointer_diff): Likewise.
> + (build_unary_op): Likewise.
> + (build_reinterpret_cast): Likewise.
> + (get_delta_difference): Likewise.
> + (expand_ptrmemfunc_cst): Likewise.
> + (dubious_conversion_warnings): Likewise.
> +
> 2004-09-27 Matt Austern <austern@apple.com>
>
> - * cp/parser.c (struct cp_token): new one-bit field , implicit_extern_c
> + * cp/parser.c (struct cp_token): New one-bit field , implicit_extern_c
> (cp_lexer_get_preprocessor_token): Set implicit_extern_c for
> tokens that come from headers that are implicitly extern "C".
> (struct cp_parser): new one-bit field, implicit_extern_c.
> @@ -44,40 +92,6 @@
> return NULL on failure.
> (unify): Remove error_mark_node check from get_template_base result.
>
> -2004-09-27 Mark Mitchell <mark@codesourcery.com>
> -
> - PR c++/17585
> - * cp-tree.h (shared_member_p): Declare.
> - * search.c (shared_member_p): Give it external linkage.
> - * semantics.c (finish_qualified_id_expr): Use it.
> - (finish_id_expression): Likewise.
> -
> - PR c++/17585
> - * semantics.c (finish_id_expression): Do not add "this->" to
> - static member functions.
> -
> -2004-09-27 Nathan Sidwell <nathan@codesourcery.com>
> -
> - PR c++/17681
> - * error.c (dump_type): Change TREE_VEC case into TREE_BINFO.
> -
> - * class.c (struct count_depth_data): Remove.
> - (dfs_depth_post, dfs_depth_q): Remove.
> - (find_final_overrider): Use number of vbase classes as depth
> - bound.
> -
> - * cp-tree.h (types_overlap_p): Remove.
> - * search.c (struct overlap_info): Remove.
> - (dfs_check_overlap, dfs_no_overlap_yet, types_overlap_p): Remove.
> -
> - * pt.c (GTB_VIA_VIRTUAL, GTB_IGNORE_TYPE): Remove.
> - (get_template_base_recursive): Remove. Replace with ...
> - (get_template_base_r): ... this.
> - (struct get_template_base_data_s): New.
> - (get_template_base): Use get_template_base_r via dfs_walk. Always
> - return NULL on failure.
> - (unify): Remove error_mark_node check from get_template_base result.
> -
> 2004-09-24 Paolo Bonzini <bonzini@gnu.org>
>
> * parser.c (cp_parser_expression_stack): Clarify why it is
>
> I am friendly script caring about memory consumption in GCC. Please contact
> jh@suse.cz if something is going wrong.
>
> The results can be reproduced by building compiler with
> --enable-gather-detailed-mem-stats targetting x86-64 and compiling preprocessed
> combine.c or testcase from PR8632 with:
>
> -fmem-report --param=ggc-min-heapsize=1024 --param=ggc-min-expand=1 -Ox -Q
>
> The memory consumption summary appears in the dump after detailed listing of
> the places they are allocated in. Peak memory consumption is actually computed
> by looking for maximal value in {GC XXXX -> YYYY} report.
>
> Yours testing script.
More information about the Gcc-regression
mailing list