99b1c316ec
gcc/c/ChangeLog: PR c++/61339 * c-decl.c (xref_tag): Change class-key of PODs to struct and others to class. (field_decl_cmp): Same. * c-parser.c (c_parser_struct_or_union_specifier): Same. * c-tree.h: Same. * gimple-parser.c (c_parser_gimple_compound_statement): Same. gcc/c-family/ChangeLog: PR c++/61339 * c-opts.c (handle_deferred_opts): : Change class-key of PODs to struct and others to class. * c-pretty-print.h: Same. gcc/cp/ChangeLog: PR c++/61339 * cp-tree.h: Change class-key of PODs to struct and others to class. * search.c: Same. * semantics.c (finalize_nrv_r): Same. gcc/lto/ChangeLog: PR c++/61339 * lto-common.c (lto_splay_tree_new): : Change class-key of PODs to struct and others to class. (mentions_vars_p): Same. (register_resolution): Same. (lto_register_var_decl_in_symtab): Same. (lto_register_function_decl_in_symtab): Same. (cmp_tree): Same. (lto_read_decls): Same. gcc/ChangeLog: PR c++/61339 * auto-profile.c: Change class-key of PODs to struct and others to class. * basic-block.h: Same. * bitmap.c (bitmap_alloc): Same. * bitmap.h: Same. * builtins.c (expand_builtin_prefetch): Same. (expand_builtin_interclass_mathfn): Same. (expand_builtin_strlen): Same. (expand_builtin_mempcpy_args): Same. (expand_cmpstr): Same. (expand_builtin___clear_cache): Same. (expand_ifn_atomic_bit_test_and): Same. (expand_builtin_thread_pointer): Same. (expand_builtin_set_thread_pointer): Same. * caller-save.c (setup_save_areas): Same. (replace_reg_with_saved_mem): Same. (insert_restore): Same. (insert_save): Same. (add_used_regs): Same. * cfg.c (get_bb_copy): Same. (set_loop_copy): Same. * cfg.h: Same. * cfganal.h: Same. * cfgexpand.c (alloc_stack_frame_space): Same. (add_stack_var): Same. (add_stack_var_conflict): Same. (add_scope_conflicts_1): Same. (update_alias_info_with_stack_vars): Same. (expand_used_vars): Same. * cfghooks.c (redirect_edge_and_branch_force): Same. (delete_basic_block): Same. (split_edge): Same. (make_forwarder_block): Same. (force_nonfallthru): Same. (duplicate_block): Same. (lv_flush_pending_stmts): Same. * cfghooks.h: Same. * cfgloop.c (flow_loops_cfg_dump): Same. (flow_loop_nested_p): Same. (superloop_at_depth): Same. (get_loop_latch_edges): Same. (flow_loop_dump): Same. (flow_loops_dump): Same. (flow_loops_free): Same. (flow_loop_nodes_find): Same. (establish_preds): Same. (flow_loop_tree_node_add): Same. (flow_loop_tree_node_remove): Same. (flow_loops_find): Same. (find_subloop_latch_edge_by_profile): Same. (find_subloop_latch_edge_by_ivs): Same. (mfb_redirect_edges_in_set): Same. (form_subloop): Same. (merge_latch_edges): Same. (disambiguate_multiple_latches): Same. (disambiguate_loops_with_multiple_latches): Same. (flow_bb_inside_loop_p): Same. (glb_enum_p): Same. (get_loop_body_with_size): Same. (get_loop_body): Same. (fill_sons_in_loop): Same. (get_loop_body_in_dom_order): Same. (get_loop_body_in_custom_order): Same. (release_recorded_exits): Same. (get_loop_exit_edges): Same. (num_loop_branches): Same. (remove_bb_from_loops): Same. (find_common_loop): Same. (delete_loop): Same. (cancel_loop): Same. (verify_loop_structure): Same. (loop_preheader_edge): Same. (loop_exit_edge_p): Same. (single_exit): Same. (loop_exits_to_bb_p): Same. (loop_exits_from_bb_p): Same. (get_loop_location): Same. (record_niter_bound): Same. (get_estimated_loop_iterations_int): Same. (max_stmt_executions_int): Same. (likely_max_stmt_executions_int): Same. (get_estimated_loop_iterations): Same. (get_max_loop_iterations): Same. (get_max_loop_iterations_int): Same. (get_likely_max_loop_iterations): Same. * cfgloop.h (simple_loop_desc): Same. (get_loop): Same. (loop_depth): Same. (loop_outer): Same. (loop_iterator::next): Same. (loop_outermost): Same. * cfgloopanal.c (mark_irreducible_loops): Same. (num_loop_insns): Same. (average_num_loop_insns): Same. (expected_loop_iterations_unbounded): Same. (expected_loop_iterations): Same. (mark_loop_exit_edges): Same. (single_likely_exit): Same. * cfgloopmanip.c (fix_bb_placement): Same. (fix_bb_placements): Same. (remove_path): Same. (place_new_loop): Same. (add_loop): Same. (scale_loop_frequencies): Same. (scale_loop_profile): Same. (create_empty_if_region_on_edge): Same. (create_empty_loop_on_edge): Same. (loopify): Same. (unloop): Same. (fix_loop_placements): Same. (copy_loop_info): Same. (duplicate_loop): Same. (duplicate_subloops): Same. (loop_redirect_edge): Same. (can_duplicate_loop_p): Same. (duplicate_loop_to_header_edge): Same. (mfb_keep_just): Same. (has_preds_from_loop): Same. (create_preheader): Same. (create_preheaders): Same. (lv_adjust_loop_entry_edge): Same. (loop_version): Same. * cfgloopmanip.h: Same. * cgraph.h: Same. * cgraphbuild.c: Same. * combine.c (make_extraction): Same. * config/i386/i386-features.c: Same. * config/i386/i386-features.h: Same. * config/i386/i386.c (ix86_emit_outlined_ms2sysv_save): Same. (ix86_emit_outlined_ms2sysv_restore): Same. (ix86_noce_conversion_profitable_p): Same. (ix86_init_cost): Same. (ix86_simd_clone_usable): Same. * configure.ac: Same. * coretypes.h: Same. * data-streamer-in.c (string_for_index): Same. (streamer_read_indexed_string): Same. (streamer_read_string): Same. (bp_unpack_indexed_string): Same. (bp_unpack_string): Same. (streamer_read_uhwi): Same. (streamer_read_hwi): Same. (streamer_read_gcov_count): Same. (streamer_read_wide_int): Same. * data-streamer.h (streamer_write_bitpack): Same. (bp_unpack_value): Same. (streamer_write_char_stream): Same. (streamer_write_hwi_in_range): Same. (streamer_write_record_start): Same. * ddg.c (create_ddg_dep_from_intra_loop_link): Same. (add_cross_iteration_register_deps): Same. (build_intra_loop_deps): Same. * df-core.c (df_analyze): Same. (loop_post_order_compute): Same. (loop_inverted_post_order_compute): Same. * df-problems.c (df_rd_alloc): Same. (df_rd_simulate_one_insn): Same. (df_rd_local_compute): Same. (df_rd_init_solution): Same. (df_rd_confluence_n): Same. (df_rd_transfer_function): Same. (df_rd_free): Same. (df_rd_dump_defs_set): Same. (df_rd_top_dump): Same. (df_lr_alloc): Same. (df_lr_reset): Same. (df_lr_local_compute): Same. (df_lr_init): Same. (df_lr_confluence_n): Same. (df_lr_free): Same. (df_lr_top_dump): Same. (df_lr_verify_transfer_functions): Same. (df_live_alloc): Same. (df_live_reset): Same. (df_live_init): Same. (df_live_confluence_n): Same. (df_live_finalize): Same. (df_live_free): Same. (df_live_top_dump): Same. (df_live_verify_transfer_functions): Same. (df_mir_alloc): Same. (df_mir_reset): Same. (df_mir_init): Same. (df_mir_confluence_n): Same. (df_mir_free): Same. (df_mir_top_dump): Same. (df_word_lr_alloc): Same. (df_word_lr_reset): Same. (df_word_lr_init): Same. (df_word_lr_confluence_n): Same. (df_word_lr_free): Same. (df_word_lr_top_dump): Same. (df_md_alloc): Same. (df_md_simulate_one_insn): Same. (df_md_reset): Same. (df_md_init): Same. (df_md_free): Same. (df_md_top_dump): Same. * df-scan.c (df_insn_delete): Same. (df_insn_rescan): Same. (df_notes_rescan): Same. (df_sort_and_compress_mws): Same. (df_install_mws): Same. (df_refs_add_to_chains): Same. (df_ref_create_structure): Same. (df_ref_record): Same. (df_def_record_1): Same. (df_find_hard_reg_defs): Same. (df_uses_record): Same. (df_get_conditional_uses): Same. (df_get_call_refs): Same. (df_recompute_luids): Same. (df_get_entry_block_def_set): Same. (df_entry_block_defs_collect): Same. (df_get_exit_block_use_set): Same. (df_exit_block_uses_collect): Same. (df_mws_verify): Same. (df_bb_verify): Same. * df.h (df_scan_get_bb_info): Same. * doc/tm.texi: Same. * dse.c (record_store): Same. * dumpfile.h: Same. * emit-rtl.c (const_fixed_hasher::equal): Same. (set_mem_attributes_minus_bitpos): Same. (change_address): Same. (adjust_address_1): Same. (offset_address): Same. * emit-rtl.h: Same. * except.c (dw2_build_landing_pads): Same. (sjlj_emit_dispatch_table): Same. * explow.c (allocate_dynamic_stack_space): Same. (emit_stack_probe): Same. (probe_stack_range): Same. * expmed.c (store_bit_field_using_insv): Same. (store_bit_field_1): Same. (store_integral_bit_field): Same. (extract_bit_field_using_extv): Same. (extract_bit_field_1): Same. (emit_cstore): Same. * expr.c (emit_block_move_via_cpymem): Same. (expand_cmpstrn_or_cmpmem): Same. (set_storage_via_setmem): Same. (emit_single_push_insn_1): Same. (expand_assignment): Same. (store_constructor): Same. (expand_expr_real_2): Same. (expand_expr_real_1): Same. (try_casesi): Same. * flags.h: Same. * function.c (try_fit_stack_local): Same. (assign_stack_local_1): Same. (assign_stack_local): Same. (cut_slot_from_list): Same. (insert_slot_to_list): Same. (max_slot_level): Same. (move_slot_to_level): Same. (temp_address_hasher::equal): Same. (remove_unused_temp_slot_addresses): Same. (assign_temp): Same. (combine_temp_slots): Same. (update_temp_slot_address): Same. (preserve_temp_slots): Same. * function.h: Same. * fwprop.c: Same. * gcc-rich-location.h: Same. * gcov.c: Same. * genattrtab.c (check_attr_test): Same. (check_attr_value): Same. (convert_set_attr_alternative): Same. (convert_set_attr): Same. (check_defs): Same. (copy_boolean): Same. (get_attr_value): Same. (expand_delays): Same. (make_length_attrs): Same. (min_fn): Same. (make_alternative_compare): Same. (simplify_test_exp): Same. (tests_attr_p): Same. (get_attr_order): Same. (clear_struct_flag): Same. (gen_attr): Same. (compares_alternatives_p): Same. (gen_insn): Same. (gen_delay): Same. (find_attrs_to_cache): Same. (write_test_expr): Same. (walk_attr_value): Same. (write_attr_get): Same. (eliminate_known_true): Same. (write_insn_cases): Same. (write_attr_case): Same. (write_attr_valueq): Same. (write_attr_value): Same. (write_dummy_eligible_delay): Same. (next_comma_elt): Same. (find_attr): Same. (make_internal_attr): Same. (copy_rtx_unchanging): Same. (gen_insn_reserv): Same. (check_tune_attr): Same. (make_automaton_attrs): Same. (handle_arg): Same. * genextract.c (gen_insn): Same. (VEC_char_to_string): Same. * genmatch.c (print_operand): Same. (lower): Same. (parser::parse_operation): Same. (parser::parse_capture): Same. (parser::parse_c_expr): Same. (parser::parse_simplify): Same. (main): Same. * genoutput.c (output_operand_data): Same. (output_get_insn_name): Same. (compare_operands): Same. (place_operands): Same. (process_template): Same. (validate_insn_alternatives): Same. (validate_insn_operands): Same. (gen_expand): Same. (note_constraint): Same. * genpreds.c (write_one_predicate_function): Same. (add_constraint): Same. (process_define_register_constraint): Same. (write_lookup_constraint_1): Same. (write_lookup_constraint_array): Same. (write_insn_constraint_len): Same. (write_reg_class_for_constraint_1): Same. (write_constraint_satisfied_p_array): Same. * genrecog.c (optimize_subroutine_group): Same. * gensupport.c (process_define_predicate): Same. (queue_pattern): Same. (remove_from_queue): Same. (process_rtx): Same. (is_predicable): Same. (change_subst_attribute): Same. (subst_pattern_match): Same. (alter_constraints): Same. (alter_attrs_for_insn): Same. (shift_output_template): Same. (alter_output_for_subst_insn): Same. (process_one_cond_exec): Same. (subst_dup): Same. (process_define_cond_exec): Same. (mnemonic_htab_callback): Same. (gen_mnemonic_attr): Same. (read_md_rtx): Same. * ggc-page.c: Same. * gimple-loop-interchange.cc (dump_reduction): Same. (dump_induction): Same. (loop_cand::~loop_cand): Same. (free_data_refs_with_aux): Same. (tree_loop_interchange::interchange_loops): Same. (tree_loop_interchange::map_inductions_to_loop): Same. (tree_loop_interchange::move_code_to_inner_loop): Same. (compute_access_stride): Same. (compute_access_strides): Same. (proper_loop_form_for_interchange): Same. (tree_loop_interchange_compute_ddrs): Same. (prune_datarefs_not_in_loop): Same. (prepare_data_references): Same. (pass_linterchange::execute): Same. * gimple-loop-jam.c (bb_prevents_fusion_p): Same. (unroll_jam_possible_p): Same. (fuse_loops): Same. (adjust_unroll_factor): Same. (tree_loop_unroll_and_jam): Same. * gimple-loop-versioning.cc (loop_versioning::~loop_versioning): Same. (loop_versioning::expensive_stmt_p): Same. (loop_versioning::version_for_unity): Same. (loop_versioning::dump_inner_likelihood): Same. (loop_versioning::find_per_loop_multiplication): Same. (loop_versioning::analyze_term_using_scevs): Same. (loop_versioning::record_address_fragment): Same. (loop_versioning::analyze_expr): Same. (loop_versioning::analyze_blocks): Same. (loop_versioning::prune_conditions): Same. (loop_versioning::merge_loop_info): Same. (loop_versioning::add_loop_to_queue): Same. (loop_versioning::decide_whether_loop_is_versionable): Same. (loop_versioning::make_versioning_decisions): Same. (loop_versioning::implement_versioning_decisions): Same. * gimple-ssa-evrp-analyze.c (evrp_range_analyzer::record_ranges_from_phis): Same. * gimple-ssa-store-merging.c (split_store::split_store): Same. (count_multiple_uses): Same. (split_group): Same. (imm_store_chain_info::output_merged_store): Same. (pass_store_merging::process_store): Same. * gimple-ssa-strength-reduction.c (slsr_process_phi): Same. * gimple-ssa-warn-alloca.c (adjusted_warn_limit): Same. (is_max): Same. (alloca_call_type): Same. (pass_walloca::execute): Same. * gimple-streamer-in.c (input_phi): Same. (input_gimple_stmt): Same. * gimple-streamer.h: Same. * godump.c (go_force_record_alignment): Same. (go_format_type): Same. (go_output_type): Same. (go_output_fndecl): Same. (go_output_typedef): Same. (keyword_hash_init): Same. (find_dummy_types): Same. * graph.c (draw_cfg_nodes_no_loops): Same. (draw_cfg_nodes_for_loop): Same. * hard-reg-set.h (hard_reg_set_iter_next): Same. * hsa-brig.c: Same. * hsa-common.h (hsa_internal_fn_hasher::equal): Same. * hsa-dump.c (dump_hsa_cfun): Same. * hsa-gen.c (gen_function_def_parameters): Same. * hsa-regalloc.c (dump_hsa_cfun_regalloc): Same. * input.c (dump_line_table_statistics): Same. (test_lexer): Same. * input.h: Same. * internal-fn.c (get_multi_vector_move): Same. (expand_load_lanes_optab_fn): Same. (expand_GOMP_SIMT_ENTER_ALLOC): Same. (expand_GOMP_SIMT_EXIT): Same. (expand_GOMP_SIMT_LAST_LANE): Same. (expand_GOMP_SIMT_ORDERED_PRED): Same. (expand_GOMP_SIMT_VOTE_ANY): Same. (expand_GOMP_SIMT_XCHG_BFLY): Same. (expand_GOMP_SIMT_XCHG_IDX): Same. (expand_addsub_overflow): Same. (expand_neg_overflow): Same. (expand_mul_overflow): Same. (expand_call_mem_ref): Same. (expand_mask_load_optab_fn): Same. (expand_scatter_store_optab_fn): Same. (expand_gather_load_optab_fn): Same. * ipa-cp.c (ipa_get_parm_lattices): Same. (print_all_lattices): Same. (ignore_edge_p): Same. (build_toporder_info): Same. (free_toporder_info): Same. (push_node_to_stack): Same. (ipcp_lattice<valtype>::set_contains_variable): Same. (set_agg_lats_to_bottom): Same. (ipcp_bits_lattice::meet_with): Same. (set_single_call_flag): Same. (initialize_node_lattices): Same. (ipa_get_jf_ancestor_result): Same. (ipcp_verify_propagated_values): Same. (propagate_scalar_across_jump_function): Same. (propagate_context_across_jump_function): Same. (propagate_bits_across_jump_function): Same. (ipa_vr_operation_and_type_effects): Same. (propagate_vr_across_jump_function): Same. (set_check_aggs_by_ref): Same. (set_chain_of_aglats_contains_variable): Same. (merge_aggregate_lattices): Same. (agg_pass_through_permissible_p): Same. (propagate_aggs_across_jump_function): Same. (call_passes_through_thunk_p): Same. (propagate_constants_across_call): Same. (devirtualization_time_bonus): Same. (good_cloning_opportunity_p): Same. (context_independent_aggregate_values): Same. (gather_context_independent_values): Same. (perform_estimation_of_a_value): Same. (estimate_local_effects): Same. (value_topo_info<valtype>::add_val): Same. (add_all_node_vals_to_toposort): Same. (value_topo_info<valtype>::propagate_effects): Same. (ipcp_propagate_stage): Same. (ipcp_discover_new_direct_edges): Same. (same_node_or_its_all_contexts_clone_p): Same. (cgraph_edge_brings_value_p): Same. (gather_edges_for_value): Same. (create_specialized_node): Same. (find_more_scalar_values_for_callers_subset): Same. (find_more_contexts_for_caller_subset): Same. (copy_plats_to_inter): Same. (intersect_aggregates_with_edge): Same. (find_aggregate_values_for_callers_subset): Same. (cgraph_edge_brings_all_agg_vals_for_node): Same. (decide_about_value): Same. (decide_whether_version_node): Same. (spread_undeadness): Same. (identify_dead_nodes): Same. (ipcp_store_vr_results): Same. * ipa-devirt.c (final_warning_record::grow_type_warnings): Same. * ipa-fnsummary.c (ipa_fn_summary::account_size_time): Same. (redirect_to_unreachable): Same. (edge_set_predicate): Same. (evaluate_conditions_for_known_args): Same. (evaluate_properties_for_edge): Same. (ipa_fn_summary_t::duplicate): Same. (ipa_call_summary_t::duplicate): Same. (dump_ipa_call_summary): Same. (ipa_dump_fn_summary): Same. (eliminated_by_inlining_prob): Same. (set_cond_stmt_execution_predicate): Same. (set_switch_stmt_execution_predicate): Same. (compute_bb_predicates): Same. (will_be_nonconstant_expr_predicate): Same. (phi_result_unknown_predicate): Same. (analyze_function_body): Same. (compute_fn_summary): Same. (estimate_edge_devirt_benefit): Same. (estimate_edge_size_and_time): Same. (estimate_calls_size_and_time): Same. (estimate_node_size_and_time): Same. (remap_edge_change_prob): Same. (remap_edge_summaries): Same. (ipa_merge_fn_summary_after_inlining): Same. (ipa_fn_summary_generate): Same. (inline_read_section): Same. (ipa_fn_summary_read): Same. (ipa_fn_summary_write): Same. * ipa-fnsummary.h: Same. * ipa-hsa.c (ipa_hsa_read_section): Same. * ipa-icf-gimple.c (func_checker::compare_loops): Same. * ipa-icf.c (sem_function::param_used_p): Same. * ipa-inline-analysis.c (do_estimate_edge_time): Same. * ipa-inline.c (edge_badness): Same. (inline_small_functions): Same. * ipa-polymorphic-call.c (ipa_polymorphic_call_context::stream_out): Same. * ipa-predicate.c (predicate::remap_after_duplication): Same. (predicate::remap_after_inlining): Same. (predicate::stream_out): Same. * ipa-predicate.h: Same. * ipa-profile.c (ipa_profile_read_summary): Same. * ipa-prop.c (ipa_get_param_decl_index_1): Same. (count_formal_params): Same. (ipa_dump_param): Same. (ipa_alloc_node_params): Same. (ipa_print_node_jump_functions_for_edge): Same. (ipa_print_node_jump_functions): Same. (ipa_load_from_parm_agg): Same. (get_ancestor_addr_info): Same. (ipa_compute_jump_functions_for_edge): Same. (ipa_analyze_virtual_call_uses): Same. (ipa_analyze_stmt_uses): Same. (ipa_analyze_params_uses_in_bb): Same. (update_jump_functions_after_inlining): Same. (try_decrement_rdesc_refcount): Same. (ipa_impossible_devirt_target): Same. (update_indirect_edges_after_inlining): Same. (combine_controlled_uses_counters): Same. (ipa_edge_args_sum_t::duplicate): Same. (ipa_write_jump_function): Same. (ipa_write_indirect_edge_info): Same. (ipa_write_node_info): Same. (ipa_read_edge_info): Same. (ipa_prop_read_section): Same. (read_replacements_section): Same. * ipa-prop.h (ipa_get_param_count): Same. (ipa_get_param): Same. (ipa_get_type): Same. (ipa_get_param_move_cost): Same. (ipa_set_param_used): Same. (ipa_get_controlled_uses): Same. (ipa_set_controlled_uses): Same. (ipa_get_cs_argument_count): Same. * ipa-pure-const.c (analyze_function): Same. (pure_const_read_summary): Same. * ipa-ref.h: Same. * ipa-reference.c (ipa_reference_read_optimization_summary): Same. * ipa-split.c (test_nonssa_use): Same. (dump_split_point): Same. (dominated_by_forbidden): Same. (split_part_set_ssa_name_p): Same. (find_split_points): Same. * ira-build.c (finish_loop_tree_nodes): Same. (low_pressure_loop_node_p): Same. * ira-color.c (ira_reuse_stack_slot): Same. * ira-int.h: Same. * ira.c (setup_reg_equiv): Same. (print_insn_chain): Same. (ira): Same. * loop-doloop.c (doloop_condition_get): Same. (add_test): Same. (record_reg_sets): Same. (doloop_optimize): Same. * loop-init.c (loop_optimizer_init): Same. (fix_loop_structure): Same. * loop-invariant.c (merge_identical_invariants): Same. (compute_always_reached): Same. (find_exits): Same. (may_assign_reg_p): Same. (find_invariants_bb): Same. (find_invariants_body): Same. (replace_uses): Same. (can_move_invariant_reg): Same. (free_inv_motion_data): Same. (move_single_loop_invariants): Same. (change_pressure): Same. (mark_ref_regs): Same. (calculate_loop_reg_pressure): Same. * loop-iv.c (biv_entry_hasher::equal): Same. (iv_extend_to_rtx_code): Same. (check_iv_ref_table_size): Same. (clear_iv_info): Same. (latch_dominating_def): Same. (iv_get_reaching_def): Same. (iv_constant): Same. (iv_subreg): Same. (iv_extend): Same. (iv_neg): Same. (iv_add): Same. (iv_mult): Same. (get_biv_step): Same. (record_iv): Same. (analyzed_for_bivness_p): Same. (record_biv): Same. (iv_analyze_biv): Same. (iv_analyze_expr): Same. (iv_analyze_def): Same. (iv_analyze_op): Same. (iv_analyze): Same. (iv_analyze_result): Same. (biv_p): Same. (eliminate_implied_conditions): Same. (simplify_using_initial_values): Same. (shorten_into_mode): Same. (canonicalize_iv_subregs): Same. (determine_max_iter): Same. (check_simple_exit): Same. (find_simple_exit): Same. (get_simple_loop_desc): Same. * loop-unroll.c (report_unroll): Same. (decide_unrolling): Same. (unroll_loops): Same. (loop_exit_at_end_p): Same. (decide_unroll_constant_iterations): Same. (unroll_loop_constant_iterations): Same. (compare_and_jump_seq): Same. (unroll_loop_runtime_iterations): Same. (decide_unroll_stupid): Same. (unroll_loop_stupid): Same. (referenced_in_one_insn_in_loop_p): Same. (reset_debug_uses_in_loop): Same. (analyze_iv_to_split_insn): Same. * lra-eliminations.c (lra_debug_elim_table): Same. (setup_can_eliminate): Same. (form_sum): Same. (lra_get_elimination_hard_regno): Same. (lra_eliminate_regs_1): Same. (eliminate_regs_in_insn): Same. (update_reg_eliminate): Same. (init_elimination): Same. (lra_eliminate): Same. * lra-int.h: Same. * lra-lives.c (initiate_live_solver): Same. * lra-remat.c (create_remat_bb_data): Same. * lra-spills.c (lra_spill): Same. * lra.c (lra_set_insn_recog_data): Same. (lra_set_used_insn_alternative_by_uid): Same. (init_reg_info): Same. (expand_reg_info): Same. * lto-cgraph.c (output_symtab): Same. (read_identifier): Same. (get_alias_symbol): Same. (input_node): Same. (input_varpool_node): Same. (input_ref): Same. (input_edge): Same. (input_cgraph_1): Same. (input_refs): Same. (input_symtab): Same. (input_offload_tables): Same. (output_cgraph_opt_summary): Same. (input_edge_opt_summary): Same. (input_cgraph_opt_section): Same. * lto-section-in.c (lto_free_raw_section_data): Same. (lto_create_simple_input_block): Same. (lto_free_function_in_decl_state_for_node): Same. * lto-streamer-in.c (lto_tag_check_set): Same. (lto_location_cache::revert_location_cache): Same. (lto_location_cache::input_location): Same. (lto_input_location): Same. (stream_input_location_now): Same. (lto_input_tree_ref): Same. (lto_input_eh_catch_list): Same. (input_eh_region): Same. (lto_init_eh): Same. (make_new_block): Same. (input_cfg): Same. (fixup_call_stmt_edges): Same. (input_struct_function_base): Same. (input_function): Same. (lto_read_body_or_constructor): Same. (lto_read_tree_1): Same. (lto_read_tree): Same. (lto_input_scc): Same. (lto_input_tree_1): Same. (lto_input_toplevel_asms): Same. (lto_input_mode_table): Same. (lto_reader_init): Same. (lto_data_in_create): Same. * lto-streamer-out.c (output_cfg): Same. * lto-streamer.h: Same. * modulo-sched.c (duplicate_insns_of_cycles): Same. (generate_prolog_epilog): Same. (mark_loop_unsched): Same. (dump_insn_location): Same. (loop_canon_p): Same. (sms_schedule): Same. * omp-expand.c (expand_omp_for_ordered_loops): Same. (expand_omp_for_generic): Same. (expand_omp_for_static_nochunk): Same. (expand_omp_for_static_chunk): Same. (expand_omp_simd): Same. (expand_omp_taskloop_for_inner): Same. (expand_oacc_for): Same. (expand_omp_atomic_pipeline): Same. (mark_loops_in_oacc_kernels_region): Same. * omp-offload.c (oacc_xform_loop): Same. * omp-simd-clone.c (simd_clone_adjust): Same. * optabs-query.c (get_traditional_extraction_insn): Same. * optabs.c (expand_vector_broadcast): Same. (expand_binop_directly): Same. (expand_twoval_unop): Same. (expand_twoval_binop): Same. (expand_unop_direct): Same. (emit_indirect_jump): Same. (emit_conditional_move): Same. (emit_conditional_neg_or_complement): Same. (emit_conditional_add): Same. (vector_compare_rtx): Same. (expand_vec_perm_1): Same. (expand_vec_perm_const): Same. (expand_vec_cond_expr): Same. (expand_vec_series_expr): Same. (maybe_emit_atomic_exchange): Same. (maybe_emit_sync_lock_test_and_set): Same. (expand_atomic_compare_and_swap): Same. (expand_atomic_load): Same. (expand_atomic_store): Same. (maybe_emit_op): Same. (valid_multiword_target_p): Same. (create_integer_operand): Same. (maybe_legitimize_operand_same_code): Same. (maybe_legitimize_operand): Same. (create_convert_operand_from_type): Same. (can_reuse_operands_p): Same. (maybe_legitimize_operands): Same. (maybe_gen_insn): Same. (maybe_expand_insn): Same. (maybe_expand_jump_insn): Same. (expand_insn): Same. * optabs.h (create_expand_operand): Same. (create_fixed_operand): Same. (create_output_operand): Same. (create_input_operand): Same. (create_convert_operand_to): Same. (create_convert_operand_from): Same. * optinfo.h: Same. * poly-int.h: Same. * predict.c (optimize_insn_for_speed_p): Same. (optimize_loop_for_size_p): Same. (optimize_loop_for_speed_p): Same. (optimize_loop_nest_for_speed_p): Same. (get_base_value): Same. (predicted_by_loop_heuristics_p): Same. (predict_extra_loop_exits): Same. (predict_loops): Same. (predict_paths_for_bb): Same. (predict_paths_leading_to): Same. (propagate_freq): Same. (pass_profile::execute): Same. * predict.h: Same. * profile-count.c (profile_count::differs_from_p): Same. (profile_probability::differs_lot_from_p): Same. * profile-count.h: Same. * profile.c (branch_prob): Same. * regrename.c (free_chain_data): Same. (mark_conflict): Same. (create_new_chain): Same. (merge_overlapping_regs): Same. (init_rename_info): Same. (merge_chains): Same. (regrename_analyze): Same. (regrename_do_replace): Same. (scan_rtx_reg): Same. (record_out_operands): Same. (build_def_use): Same. * regrename.h: Same. * reload.h: Same. * reload1.c (init_reload): Same. (maybe_fix_stack_asms): Same. (copy_reloads): Same. (count_pseudo): Same. (count_spilled_pseudo): Same. (find_reg): Same. (find_reload_regs): Same. (select_reload_regs): Same. (spill_hard_reg): Same. (fixup_eh_region_note): Same. (set_reload_reg): Same. (allocate_reload_reg): Same. (compute_reload_subreg_offset): Same. (reload_adjust_reg_for_icode): Same. (emit_input_reload_insns): Same. (emit_output_reload_insns): Same. (do_input_reload): Same. (inherit_piecemeal_p): Same. * rtl.h: Same. * sanopt.c (maybe_get_dominating_check): Same. (maybe_optimize_ubsan_ptr_ifn): Same. (can_remove_asan_check): Same. (maybe_optimize_asan_check_ifn): Same. (sanopt_optimize_walker): Same. * sched-deps.c (add_dependence_list): Same. (chain_to_prev_insn): Same. (add_insn_mem_dependence): Same. (create_insn_reg_set): Same. (maybe_extend_reg_info_p): Same. (sched_analyze_reg): Same. (sched_analyze_1): Same. (get_implicit_reg_pending_clobbers): Same. (chain_to_prev_insn_p): Same. (deps_analyze_insn): Same. (deps_start_bb): Same. (sched_free_deps): Same. (init_deps): Same. (init_deps_reg_last): Same. (free_deps): Same. * sched-ebb.c: Same. * sched-int.h: Same. * sched-rgn.c (add_branch_dependences): Same. (concat_insn_mem_list): Same. (deps_join): Same. (sched_rgn_compute_dependencies): Same. * sel-sched-ir.c (reset_target_context): Same. (copy_deps_context): Same. (init_id_from_df): Same. (has_dependence_p): Same. (change_loops_latches): Same. (bb_top_order_comparator): Same. (make_region_from_loop_preheader): Same. (sel_init_pipelining): Same. (get_loop_nest_for_rgn): Same. (make_regions_from_the_rest): Same. (sel_is_loop_preheader_p): Same. * sel-sched-ir.h (inner_loop_header_p): Same. (get_all_loop_exits): Same. * selftest.h: Same. * sese.c (sese_build_liveouts): Same. (sese_insert_phis_for_liveouts): Same. * sese.h (defined_in_sese_p): Same. * sreal.c (sreal::stream_out): Same. * sreal.h: Same. * streamer-hooks.h: Same. * target-globals.c (save_target_globals): Same. * target-globals.h: Same. * target.def: Same. * target.h: Same. * targhooks.c (default_has_ifunc_p): Same. (default_empty_mask_is_expensive): Same. (default_init_cost): Same. * targhooks.h: Same. * toplev.c: Same. * tree-affine.c (aff_combination_mult): Same. (aff_combination_expand): Same. (aff_combination_constant_multiple_p): Same. * tree-affine.h: Same. * tree-cfg.c (build_gimple_cfg): Same. (replace_loop_annotate_in_block): Same. (replace_uses_by): Same. (remove_bb): Same. (dump_cfg_stats): Same. (gimple_duplicate_sese_region): Same. (gimple_duplicate_sese_tail): Same. (move_block_to_fn): Same. (replace_block_vars_by_duplicates): Same. (move_sese_region_to_fn): Same. (print_loops_bb): Same. (print_loop): Same. (print_loops): Same. (debug): Same. (debug_loops): Same. * tree-cfg.h: Same. * tree-chrec.c (chrec_fold_plus_poly_poly): Same. (chrec_fold_multiply_poly_poly): Same. (chrec_evaluate): Same. (chrec_component_in_loop_num): Same. (reset_evolution_in_loop): Same. (is_multivariate_chrec): Same. (chrec_contains_symbols): Same. (nb_vars_in_chrec): Same. (chrec_convert_1): Same. (chrec_convert_aggressive): Same. * tree-chrec.h: Same. * tree-core.h: Same. * tree-data-ref.c (dump_data_dependence_relation): Same. (canonicalize_base_object_address): Same. (data_ref_compare_tree): Same. (prune_runtime_alias_test_list): Same. (get_segment_min_max): Same. (create_intersect_range_checks): Same. (conflict_fn_no_dependence): Same. (object_address_invariant_in_loop_p): Same. (analyze_ziv_subscript): Same. (analyze_siv_subscript_cst_affine): Same. (analyze_miv_subscript): Same. (analyze_overlapping_iterations): Same. (build_classic_dist_vector_1): Same. (add_other_self_distances): Same. (same_access_functions): Same. (build_classic_dir_vector): Same. (subscript_dependence_tester_1): Same. (subscript_dependence_tester): Same. (access_functions_are_affine_or_constant_p): Same. (get_references_in_stmt): Same. (loop_nest_has_data_refs): Same. (graphite_find_data_references_in_stmt): Same. (find_data_references_in_bb): Same. (get_base_for_alignment): Same. (find_loop_nest_1): Same. (find_loop_nest): Same. * tree-data-ref.h (dr_alignment): Same. (ddr_dependence_level): Same. * tree-if-conv.c (fold_build_cond_expr): Same. (add_to_predicate_list): Same. (add_to_dst_predicate_list): Same. (phi_convertible_by_degenerating_args): Same. (idx_within_array_bound): Same. (all_preds_critical_p): Same. (pred_blocks_visited_p): Same. (predicate_bbs): Same. (build_region): Same. (if_convertible_loop_p_1): Same. (is_cond_scalar_reduction): Same. (predicate_scalar_phi): Same. (remove_conditions_and_labels): Same. (combine_blocks): Same. (version_loop_for_if_conversion): Same. (versionable_outer_loop_p): Same. (ifcvt_local_dce): Same. (tree_if_conversion): Same. (pass_if_conversion::gate): Same. * tree-if-conv.h: Same. * tree-inline.c (maybe_move_debug_stmts_to_successors): Same. * tree-loop-distribution.c (bb_top_order_cmp): Same. (free_rdg): Same. (stmt_has_scalar_dependences_outside_loop): Same. (copy_loop_before): Same. (create_bb_after_loop): Same. (const_with_all_bytes_same): Same. (generate_memset_builtin): Same. (generate_memcpy_builtin): Same. (destroy_loop): Same. (build_rdg_partition_for_vertex): Same. (compute_access_range): Same. (data_ref_segment_size): Same. (latch_dominated_by_data_ref): Same. (compute_alias_check_pairs): Same. (fuse_memset_builtins): Same. (finalize_partitions): Same. (find_seed_stmts_for_distribution): Same. (prepare_perfect_loop_nest): Same. * tree-parloops.c (lambda_transform_legal_p): Same. (loop_parallel_p): Same. (reduc_stmt_res): Same. (add_field_for_name): Same. (create_call_for_reduction_1): Same. (replace_uses_in_bb_by): Same. (transform_to_exit_first_loop_alt): Same. (try_transform_to_exit_first_loop_alt): Same. (transform_to_exit_first_loop): Same. (num_phis): Same. (gen_parallel_loop): Same. (gather_scalar_reductions): Same. (get_omp_data_i_param): Same. (try_create_reduction_list): Same. (oacc_entry_exit_single_gang): Same. (parallelize_loops): Same. * tree-pass.h: Same. * tree-predcom.c (determine_offset): Same. (last_always_executed_block): Same. (split_data_refs_to_components): Same. (suitable_component_p): Same. (valid_initializer_p): Same. (find_looparound_phi): Same. (insert_looparound_copy): Same. (add_looparound_copies): Same. (determine_roots_comp): Same. (predcom_tmp_var): Same. (initialize_root_vars): Same. (initialize_root_vars_store_elim_1): Same. (initialize_root_vars_store_elim_2): Same. (finalize_eliminated_stores): Same. (initialize_root_vars_lm): Same. (remove_stmt): Same. (determine_unroll_factor): Same. (execute_pred_commoning_cbck): Same. (base_names_in_chain_on): Same. (combine_chains): Same. (pcom_stmt_dominates_stmt_p): Same. (try_combine_chains): Same. (prepare_initializers_chain_store_elim): Same. (prepare_initializers_chain): Same. (prepare_initializers): Same. (prepare_finalizers_chain): Same. (prepare_finalizers): Same. (insert_init_seqs): Same. * tree-scalar-evolution.c (loop_phi_node_p): Same. (compute_overall_effect_of_inner_loop): Same. (add_to_evolution_1): Same. (add_to_evolution): Same. (follow_ssa_edge_binary): Same. (follow_ssa_edge_expr): Same. (backedge_phi_arg_p): Same. (follow_ssa_edge_in_condition_phi_branch): Same. (follow_ssa_edge_in_condition_phi): Same. (follow_ssa_edge_inner_loop_phi): Same. (follow_ssa_edge): Same. (analyze_evolution_in_loop): Same. (analyze_initial_condition): Same. (interpret_loop_phi): Same. (interpret_condition_phi): Same. (interpret_rhs_expr): Same. (interpret_expr): Same. (interpret_gimple_assign): Same. (analyze_scalar_evolution_1): Same. (analyze_scalar_evolution): Same. (analyze_scalar_evolution_for_address_of): Same. (get_instantiated_value_entry): Same. (loop_closed_phi_def): Same. (instantiate_scev_name): Same. (instantiate_scev_poly): Same. (instantiate_scev_binary): Same. (instantiate_scev_convert): Same. (instantiate_scev_not): Same. (instantiate_scev_r): Same. (instantiate_scev): Same. (resolve_mixers): Same. (initialize_scalar_evolutions_analyzer): Same. (scev_reset_htab): Same. (scev_reset): Same. (derive_simple_iv_with_niters): Same. (simple_iv_with_niters): Same. (expression_expensive_p): Same. (final_value_replacement_loop): Same. * tree-scalar-evolution.h (block_before_loop): Same. * tree-ssa-address.h: Same. * tree-ssa-dce.c (find_obviously_necessary_stmts): Same. * tree-ssa-dom.c (edge_info::record_simple_equiv): Same. (record_edge_info): Same. * tree-ssa-live.c (var_map_base_fini): Same. (remove_unused_locals): Same. * tree-ssa-live.h: Same. * tree-ssa-loop-ch.c (should_duplicate_loop_header_p): Same. (pass_ch_vect::execute): Same. (pass_ch::process_loop_p): Same. * tree-ssa-loop-im.c (mem_ref_hasher::hash): Same. (movement_possibility): Same. (outermost_invariant_loop): Same. (stmt_cost): Same. (determine_max_movement): Same. (invariantness_dom_walker::before_dom_children): Same. (move_computations): Same. (may_move_till): Same. (force_move_till_op): Same. (force_move_till): Same. (memref_free): Same. (record_mem_ref_loc): Same. (set_ref_stored_in_loop): Same. (mark_ref_stored): Same. (sort_bbs_in_loop_postorder_cmp): Same. (sort_locs_in_loop_postorder_cmp): Same. (analyze_memory_references): Same. (mem_refs_may_alias_p): Same. (find_ref_loc_in_loop_cmp): Same. (rewrite_mem_ref_loc::operator): Same. (first_mem_ref_loc_1::operator): Same. (sm_set_flag_if_changed::operator): Same. (execute_sm_if_changed_flag_set): Same. (execute_sm): Same. (hoist_memory_references): Same. (ref_always_accessed::operator): Same. (refs_independent_p): Same. (record_dep_loop): Same. (ref_indep_loop_p_1): Same. (ref_indep_loop_p): Same. (can_sm_ref_p): Same. (find_refs_for_sm): Same. (loop_suitable_for_sm): Same. (store_motion_loop): Same. (store_motion): Same. (fill_always_executed_in): Same. * tree-ssa-loop-ivcanon.c (constant_after_peeling): Same. (estimated_unrolled_size): Same. (loop_edge_to_cancel): Same. (remove_exits_and_undefined_stmts): Same. (remove_redundant_iv_tests): Same. (unloop_loops): Same. (estimated_peeled_sequence_size): Same. (try_peel_loop): Same. (canonicalize_loop_induction_variables): Same. (canonicalize_induction_variables): Same. * tree-ssa-loop-ivopts.c (iv_inv_expr_hasher::equal): Same. (name_info): Same. (stmt_after_inc_pos): Same. (contains_abnormal_ssa_name_p): Same. (niter_for_exit): Same. (find_bivs): Same. (mark_bivs): Same. (find_givs_in_bb): Same. (find_induction_variables): Same. (find_interesting_uses_cond): Same. (outermost_invariant_loop_for_expr): Same. (idx_find_step): Same. (add_candidate_1): Same. (add_iv_candidate_derived_from_uses): Same. (alloc_use_cost_map): Same. (prepare_decl_rtl): Same. (generic_predict_doloop_p): Same. (computation_cost): Same. (determine_common_wider_type): Same. (get_computation_aff_1): Same. (get_use_type): Same. (determine_group_iv_cost_address): Same. (iv_period): Same. (difference_cannot_overflow_p): Same. (may_eliminate_iv): Same. (determine_set_costs): Same. (cheaper_cost_pair): Same. (compare_cost_pair): Same. (iv_ca_cand_for_group): Same. (iv_ca_recount_cost): Same. (iv_ca_set_remove_invs): Same. (iv_ca_set_no_cp): Same. (iv_ca_set_add_invs): Same. (iv_ca_set_cp): Same. (iv_ca_add_group): Same. (iv_ca_cost): Same. (iv_ca_compare_deps): Same. (iv_ca_delta_reverse): Same. (iv_ca_delta_commit): Same. (iv_ca_cand_used_p): Same. (iv_ca_delta_free): Same. (iv_ca_new): Same. (iv_ca_free): Same. (iv_ca_dump): Same. (iv_ca_extend): Same. (iv_ca_narrow): Same. (iv_ca_prune): Same. (cheaper_cost_with_cand): Same. (iv_ca_replace): Same. (try_add_cand_for): Same. (get_initial_solution): Same. (try_improve_iv_set): Same. (find_optimal_iv_set_1): Same. (create_new_iv): Same. (rewrite_use_compare): Same. (remove_unused_ivs): Same. (determine_scaling_factor): Same. * tree-ssa-loop-ivopts.h: Same. * tree-ssa-loop-manip.c (create_iv): Same. (compute_live_loop_exits): Same. (add_exit_phi): Same. (add_exit_phis): Same. (find_uses_to_rename_use): Same. (find_uses_to_rename_def): Same. (find_uses_to_rename_in_loop): Same. (rewrite_into_loop_closed_ssa): Same. (check_loop_closed_ssa_bb): Same. (split_loop_exit_edge): Same. (ip_end_pos): Same. (ip_normal_pos): Same. (copy_phi_node_args): Same. (gimple_duplicate_loop_to_header_edge): Same. (can_unroll_loop_p): Same. (determine_exit_conditions): Same. (scale_dominated_blocks_in_loop): Same. (niter_for_unrolled_loop): Same. (tree_transform_and_unroll_loop): Same. (rewrite_all_phi_nodes_with_iv): Same. * tree-ssa-loop-manip.h: Same. * tree-ssa-loop-niter.c (number_of_iterations_ne_max): Same. (number_of_iterations_ne): Same. (assert_no_overflow_lt): Same. (assert_loop_rolls_lt): Same. (number_of_iterations_lt): Same. (adjust_cond_for_loop_until_wrap): Same. (tree_simplify_using_condition): Same. (simplify_using_initial_conditions): Same. (simplify_using_outer_evolutions): Same. (loop_only_exit_p): Same. (ssa_defined_by_minus_one_stmt_p): Same. (number_of_iterations_popcount): Same. (number_of_iterations_exit): Same. (find_loop_niter): Same. (finite_loop_p): Same. (chain_of_csts_start): Same. (get_val_for): Same. (loop_niter_by_eval): Same. (derive_constant_upper_bound_ops): Same. (do_warn_aggressive_loop_optimizations): Same. (record_estimate): Same. (get_cst_init_from_scev): Same. (record_nonwrapping_iv): Same. (idx_infer_loop_bounds): Same. (infer_loop_bounds_from_ref): Same. (infer_loop_bounds_from_array): Same. (infer_loop_bounds_from_pointer_arith): Same. (infer_loop_bounds_from_signedness): Same. (bound_index): Same. (discover_iteration_bound_by_body_walk): Same. (maybe_lower_iteration_bound): Same. (estimate_numbers_of_iterations): Same. (estimated_loop_iterations): Same. (estimated_loop_iterations_int): Same. (max_loop_iterations): Same. (max_loop_iterations_int): Same. (likely_max_loop_iterations): Same. (likely_max_loop_iterations_int): Same. (estimated_stmt_executions_int): Same. (max_stmt_executions): Same. (likely_max_stmt_executions): Same. (estimated_stmt_executions): Same. (stmt_dominates_stmt_p): Same. (nowrap_type_p): Same. (loop_exits_before_overflow): Same. (scev_var_range_cant_overflow): Same. (scev_probably_wraps_p): Same. (free_numbers_of_iterations_estimates): Same. * tree-ssa-loop-niter.h: Same. * tree-ssa-loop-prefetch.c (release_mem_refs): Same. (idx_analyze_ref): Same. (analyze_ref): Same. (gather_memory_references_ref): Same. (mark_nontemporal_store): Same. (emit_mfence_after_loop): Same. (may_use_storent_in_loop_p): Same. (mark_nontemporal_stores): Same. (should_unroll_loop_p): Same. (volume_of_dist_vector): Same. (add_subscript_strides): Same. (self_reuse_distance): Same. (insn_to_prefetch_ratio_too_small_p): Same. * tree-ssa-loop-split.c (split_at_bb_p): Same. (patch_loop_exit): Same. (find_or_create_guard_phi): Same. (easy_exit_values): Same. (connect_loop_phis): Same. (connect_loops): Same. (compute_new_first_bound): Same. (split_loop): Same. (tree_ssa_split_loops): Same. * tree-ssa-loop-unswitch.c (tree_ssa_unswitch_loops): Same. (is_maybe_undefined): Same. (tree_may_unswitch_on): Same. (simplify_using_entry_checks): Same. (tree_unswitch_single_loop): Same. (tree_unswitch_loop): Same. (tree_unswitch_outer_loop): Same. (empty_bb_without_guard_p): Same. (used_outside_loop_p): Same. (get_vop_from_header): Same. (hoist_guard): Same. * tree-ssa-loop.c (gate_oacc_kernels): Same. (get_lsm_tmp_name): Same. * tree-ssa-loop.h: Same. * tree-ssa-reassoc.c (add_repeat_to_ops_vec): Same. (build_and_add_sum): Same. (no_side_effect_bb): Same. (get_ops): Same. (linearize_expr): Same. (should_break_up_subtract): Same. (linearize_expr_tree): Same. * tree-ssa-scopedtables.c: Same. * tree-ssa-scopedtables.h: Same. * tree-ssa-structalias.c (condense_visit): Same. (label_visit): Same. (dump_pred_graph): Same. (perform_var_substitution): Same. (move_complex_constraints): Same. (remove_preds_and_fake_succs): Same. * tree-ssa-threadupdate.c (dbds_continue_enumeration_p): Same. (determine_bb_domination_status): Same. (duplicate_thread_path): Same. (thread_through_all_blocks): Same. * tree-ssa-threadupdate.h: Same. * tree-streamer-in.c (streamer_read_string_cst): Same. (input_identifier): Same. (unpack_ts_type_common_value_fields): Same. (unpack_ts_block_value_fields): Same. (unpack_ts_translation_unit_decl_value_fields): Same. (unpack_ts_omp_clause_value_fields): Same. (streamer_read_tree_bitfields): Same. (streamer_alloc_tree): Same. (lto_input_ts_common_tree_pointers): Same. (lto_input_ts_vector_tree_pointers): Same. (lto_input_ts_poly_tree_pointers): Same. (lto_input_ts_complex_tree_pointers): Same. (lto_input_ts_decl_minimal_tree_pointers): Same. (lto_input_ts_decl_common_tree_pointers): Same. (lto_input_ts_decl_non_common_tree_pointers): Same. (lto_input_ts_decl_with_vis_tree_pointers): Same. (lto_input_ts_field_decl_tree_pointers): Same. (lto_input_ts_function_decl_tree_pointers): Same. (lto_input_ts_type_common_tree_pointers): Same. (lto_input_ts_type_non_common_tree_pointers): Same. (lto_input_ts_list_tree_pointers): Same. (lto_input_ts_vec_tree_pointers): Same. (lto_input_ts_exp_tree_pointers): Same. (lto_input_ts_block_tree_pointers): Same. (lto_input_ts_binfo_tree_pointers): Same. (lto_input_ts_constructor_tree_pointers): Same. (lto_input_ts_omp_clause_tree_pointers): Same. (streamer_read_tree_body): Same. * tree-streamer.h: Same. * tree-switch-conversion.c (bit_test_cluster::is_beneficial): Same. * tree-vect-data-refs.c (vect_get_smallest_scalar_type): Same. (vect_analyze_possibly_independent_ddr): Same. (vect_analyze_data_ref_dependence): Same. (vect_compute_data_ref_alignment): Same. (vect_enhance_data_refs_alignment): Same. (vect_analyze_data_ref_access): Same. (vect_check_gather_scatter): Same. (vect_find_stmt_data_reference): Same. (vect_create_addr_base_for_vector_ref): Same. (vect_setup_realignment): Same. (vect_supportable_dr_alignment): Same. * tree-vect-loop-manip.c (rename_variables_in_bb): Same. (adjust_phi_and_debug_stmts): Same. (vect_set_loop_mask): Same. (add_preheader_seq): Same. (vect_maybe_permute_loop_masks): Same. (vect_set_loop_masks_directly): Same. (vect_set_loop_condition_masked): Same. (vect_set_loop_condition_unmasked): Same. (slpeel_duplicate_current_defs_from_edges): Same. (slpeel_add_loop_guard): Same. (slpeel_can_duplicate_loop_p): Same. (create_lcssa_for_virtual_phi): Same. (iv_phi_p): Same. (vect_update_ivs_after_vectorizer): Same. (vect_gen_vector_loop_niters_mult_vf): Same. (slpeel_update_phi_nodes_for_loops): Same. (slpeel_update_phi_nodes_for_guard1): Same. (find_guard_arg): Same. (slpeel_update_phi_nodes_for_guard2): Same. (slpeel_update_phi_nodes_for_lcssa): Same. (vect_do_peeling): Same. (vect_create_cond_for_alias_checks): Same. (vect_loop_versioning): Same. * tree-vect-loop.c (vect_determine_vf_for_stmt): Same. (vect_inner_phi_in_double_reduction_p): Same. (vect_analyze_scalar_cycles_1): Same. (vect_fixup_scalar_cycles_with_patterns): Same. (vect_get_loop_niters): Same. (bb_in_loop_p): Same. (vect_get_max_nscalars_per_iter): Same. (vect_verify_full_masking): Same. (vect_compute_single_scalar_iteration_cost): Same. (vect_analyze_loop_form_1): Same. (vect_analyze_loop_form): Same. (vect_active_double_reduction_p): Same. (vect_analyze_loop_operations): Same. (neutral_op_for_slp_reduction): Same. (vect_is_simple_reduction): Same. (vect_model_reduction_cost): Same. (get_initial_def_for_reduction): Same. (get_initial_defs_for_reduction): Same. (vect_create_epilog_for_reduction): Same. (vectorize_fold_left_reduction): Same. (vectorizable_reduction): Same. (vectorizable_induction): Same. (vectorizable_live_operation): Same. (loop_niters_no_overflow): Same. (vect_get_loop_mask): Same. (vect_transform_loop_stmt): Same. (vect_transform_loop): Same. * tree-vect-patterns.c (vect_reassociating_reduction_p): Same. (vect_determine_precisions): Same. (vect_pattern_recog_1): Same. * tree-vect-slp.c (vect_analyze_slp_instance): Same. * tree-vect-stmts.c (stmt_vectype): Same. (process_use): Same. (vect_init_vector_1): Same. (vect_truncate_gather_scatter_offset): Same. (get_group_load_store_type): Same. (vect_build_gather_load_calls): Same. (vect_get_strided_load_store_ops): Same. (vectorizable_simd_clone_call): Same. (vectorizable_store): Same. (permute_vec_elements): Same. (vectorizable_load): Same. (vect_transform_stmt): Same. (supportable_widening_operation): Same. * tree-vectorizer.c (vec_info::replace_stmt): Same. (vec_info::free_stmt_vec_info): Same. (vect_free_loop_info_assumptions): Same. (vect_loop_vectorized_call): Same. (set_uid_loop_bbs): Same. (vectorize_loops): Same. * tree-vectorizer.h (STMT_VINFO_BB_VINFO): Same. * tree.c (add_tree_to_fld_list): Same. (fld_type_variant_equal_p): Same. (fld_decl_context): Same. (fld_incomplete_type_of): Same. (free_lang_data_in_binfo): Same. (need_assembler_name_p): Same. (find_decls_types_r): Same. (get_eh_types_for_runtime): Same. (find_decls_types_in_eh_region): Same. (find_decls_types_in_node): Same. (assign_assembler_name_if_needed): Same. * value-prof.c (stream_out_histogram_value): Same. * value-prof.h: Same. * var-tracking.c (use_narrower_mode): Same. (prepare_call_arguments): Same. (vt_expand_loc_callback): Same. (resolve_expansions_pending_recursion): Same. (vt_expand_loc): Same. * varasm.c (const_hash_1): Same. (compare_constant): Same. (tree_output_constant_def): Same. (simplify_subtraction): Same. (get_pool_constant): Same. (output_constant_pool_2): Same. (output_constant_pool_1): Same. (mark_constants_in_pattern): Same. (mark_constant_pool): Same. (get_section_anchor): Same. * vr-values.c (compare_range_with_value): Same. (vr_values::extract_range_from_phi_node): Same. * vr-values.h: Same. * web.c (unionfind_union): Same. * wide-int.h: Same. From-SVN: r273311
2029 lines
57 KiB
C
2029 lines
57 KiB
C
/* Part of CPP library. File handling.
|
||
Copyright (C) 1986-2019 Free Software Foundation, Inc.
|
||
Written by Per Bothner, 1994.
|
||
Based on CCCP program by Paul Rubin, June 1986
|
||
Adapted to ANSI C, Richard Stallman, Jan 1987
|
||
Split out of cpplib.c, Zack Weinberg, Oct 1998
|
||
Reimplemented, Neil Booth, Jul 2003
|
||
|
||
This program is free software; you can redistribute it and/or modify it
|
||
under the terms of the GNU General Public License as published by the
|
||
Free Software Foundation; either version 3, or (at your option) any
|
||
later version.
|
||
|
||
This program is distributed in the hope that it will be useful,
|
||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
GNU General Public License for more details.
|
||
|
||
You should have received a copy of the GNU General Public License
|
||
along with this program; see the file COPYING3. If not see
|
||
<http://www.gnu.org/licenses/>. */
|
||
|
||
#include "config.h"
|
||
#include "system.h"
|
||
#include "cpplib.h"
|
||
#include "internal.h"
|
||
#include "mkdeps.h"
|
||
#include "obstack.h"
|
||
#include "hashtab.h"
|
||
#include "md5.h"
|
||
#include <dirent.h>
|
||
|
||
/* Variable length record files on VMS will have a stat size that includes
|
||
record control characters that won't be included in the read size. */
|
||
#ifdef VMS
|
||
# define FAB_C_VAR 2 /* variable length records (see Starlet fabdef.h) */
|
||
# define STAT_SIZE_RELIABLE(ST) ((ST).st_fab_rfm != FAB_C_VAR)
|
||
#else
|
||
# define STAT_SIZE_RELIABLE(ST) true
|
||
#endif
|
||
|
||
#ifdef __DJGPP__
|
||
#include <io.h>
|
||
/* For DJGPP redirected input is opened in text mode. */
|
||
# define set_stdin_to_binary_mode() \
|
||
if (! isatty (0)) setmode (0, O_BINARY)
|
||
#else
|
||
# define set_stdin_to_binary_mode() /* Nothing */
|
||
#endif
|
||
|
||
/* This structure represents a file searched for by CPP, whether it
|
||
exists or not. An instance may be pointed to by more than one
|
||
cpp_file_hash_entry; at present no reference count is kept. */
|
||
struct _cpp_file
|
||
{
|
||
/* Filename as given to #include or command line switch. */
|
||
const char *name;
|
||
|
||
/* The full path used to find the file. */
|
||
const char *path;
|
||
|
||
/* The full path of the pch file. */
|
||
const char *pchname;
|
||
|
||
/* The file's path with the basename stripped. NULL if it hasn't
|
||
been calculated yet. */
|
||
const char *dir_name;
|
||
|
||
/* Chain through all files. */
|
||
struct _cpp_file *next_file;
|
||
|
||
/* The contents of NAME after calling read_file(). */
|
||
const uchar *buffer;
|
||
|
||
/* Pointer to the real start of BUFFER. read_file() might increment
|
||
BUFFER; when freeing, this this pointer must be used instead. */
|
||
const uchar *buffer_start;
|
||
|
||
/* The macro, if any, preventing re-inclusion. */
|
||
const cpp_hashnode *cmacro;
|
||
|
||
/* The directory in the search path where FILE was found. Used for
|
||
#include_next and determining whether a header is a system
|
||
header. */
|
||
cpp_dir *dir;
|
||
|
||
/* As filled in by stat(2) for the file. */
|
||
struct stat st;
|
||
|
||
/* File descriptor. Invalid if -1, otherwise open. */
|
||
int fd;
|
||
|
||
/* Zero if this file was successfully opened and stat()-ed,
|
||
otherwise errno obtained from failure. */
|
||
int err_no;
|
||
|
||
/* Number of times the file has been stacked for preprocessing. */
|
||
unsigned short stack_count;
|
||
|
||
/* If opened with #import or contains #pragma once. */
|
||
bool once_only;
|
||
|
||
/* If read() failed before. */
|
||
bool dont_read;
|
||
|
||
/* If this file is the main file. */
|
||
bool main_file;
|
||
|
||
/* If BUFFER above contains the true contents of the file. */
|
||
bool buffer_valid;
|
||
|
||
/* If this file is implicitly preincluded. */
|
||
bool implicit_preinclude;
|
||
};
|
||
|
||
/* A singly-linked list for all searches for a given file name, with
|
||
its head pointed to by a slot in FILE_HASH. The file name is what
|
||
appeared between the quotes in a #include directive; it can be
|
||
determined implicitly from the hash table location or explicitly
|
||
from FILE->name.
|
||
|
||
FILE is a structure containing details about the file that was
|
||
found with that search, or details of how the search failed.
|
||
|
||
START_DIR is the starting location of the search in the include
|
||
chain. The current directories for "" includes are also hashed in
|
||
the hash table and therefore unique. Files that are looked up
|
||
without using a search path, such as absolute filenames and file
|
||
names from the command line share a special starting directory so
|
||
they don't cause cache hits with normal include-chain lookups.
|
||
|
||
If START_DIR is NULL then the entry is for a directory, not a file,
|
||
and the directory is in DIR. Since the starting point in a file
|
||
lookup chain is never NULL, this means that simple pointer
|
||
comparisons against START_DIR can be made to determine cache hits
|
||
in file lookups.
|
||
|
||
If a cache lookup fails because of e.g. an extra "./" in the path,
|
||
then nothing will break. It is just less efficient as CPP will
|
||
have to do more work re-preprocessing the file, and/or comparing
|
||
its contents against earlier once-only files.
|
||
*/
|
||
struct cpp_file_hash_entry
|
||
{
|
||
struct cpp_file_hash_entry *next;
|
||
cpp_dir *start_dir;
|
||
location_t location;
|
||
union
|
||
{
|
||
_cpp_file *file;
|
||
cpp_dir *dir;
|
||
} u;
|
||
};
|
||
|
||
/* Number of entries to put in a cpp_file_hash_entry pool. */
|
||
#define FILE_HASH_POOL_SIZE 127
|
||
|
||
/* A file hash entry pool. We allocate cpp_file_hash_entry object from
|
||
one of these. */
|
||
struct file_hash_entry_pool
|
||
{
|
||
/* Number of entries used from this pool. */
|
||
unsigned int file_hash_entries_used;
|
||
/* Next pool in the chain; used when freeing. */
|
||
struct file_hash_entry_pool *next;
|
||
/* The memory pool. */
|
||
struct cpp_file_hash_entry pool[FILE_HASH_POOL_SIZE];
|
||
};
|
||
|
||
static bool open_file (_cpp_file *file);
|
||
static bool pch_open_file (cpp_reader *pfile, _cpp_file *file,
|
||
bool *invalid_pch);
|
||
static bool find_file_in_dir (cpp_reader *pfile, _cpp_file *file,
|
||
bool *invalid_pch, location_t loc);
|
||
static bool read_file_guts (cpp_reader *pfile, _cpp_file *file,
|
||
location_t loc);
|
||
static bool read_file (cpp_reader *pfile, _cpp_file *file,
|
||
location_t loc);
|
||
static bool should_stack_file (cpp_reader *, _cpp_file *file, bool import,
|
||
location_t loc);
|
||
static struct cpp_dir *search_path_head (cpp_reader *, const char *fname,
|
||
int angle_brackets, enum include_type);
|
||
static const char *dir_name_of_file (_cpp_file *file);
|
||
static void open_file_failed (cpp_reader *pfile, _cpp_file *file, int,
|
||
location_t);
|
||
static struct cpp_file_hash_entry *search_cache (struct cpp_file_hash_entry *head,
|
||
const cpp_dir *start_dir);
|
||
static _cpp_file *make_cpp_file (cpp_reader *, cpp_dir *, const char *fname);
|
||
static void destroy_cpp_file (_cpp_file *);
|
||
static cpp_dir *make_cpp_dir (cpp_reader *, const char *dir_name, int sysp);
|
||
static void allocate_file_hash_entries (cpp_reader *pfile);
|
||
static struct cpp_file_hash_entry *new_file_hash_entry (cpp_reader *pfile);
|
||
static int report_missing_guard (void **slot, void *b);
|
||
static hashval_t file_hash_hash (const void *p);
|
||
static int file_hash_eq (const void *p, const void *q);
|
||
static char *read_filename_string (int ch, FILE *f);
|
||
static void read_name_map (cpp_dir *dir);
|
||
static char *remap_filename (cpp_reader *pfile, _cpp_file *file);
|
||
static char *append_file_to_dir (const char *fname, cpp_dir *dir);
|
||
static bool validate_pch (cpp_reader *, _cpp_file *file, const char *pchname);
|
||
static int pchf_save_compare (const void *e1, const void *e2);
|
||
static int pchf_compare (const void *d_p, const void *e_p);
|
||
static bool check_file_against_entries (cpp_reader *, _cpp_file *, bool);
|
||
|
||
/* Given a filename in FILE->PATH, with the empty string interpreted
|
||
as <stdin>, open it.
|
||
|
||
On success FILE contains an open file descriptor and stat
|
||
information for the file. On failure the file descriptor is -1 and
|
||
the appropriate errno is also stored in FILE. Returns TRUE iff
|
||
successful.
|
||
|
||
We used to open files in nonblocking mode, but that caused more
|
||
problems than it solved. Do take care not to acquire a controlling
|
||
terminal by mistake (this can't happen on sane systems, but
|
||
paranoia is a virtue).
|
||
|
||
Use the three-argument form of open even though we aren't
|
||
specifying O_CREAT, to defend against broken system headers.
|
||
|
||
O_BINARY tells some runtime libraries (notably DJGPP) not to do
|
||
newline translation; we can handle DOS line breaks just fine
|
||
ourselves. */
|
||
static bool
|
||
open_file (_cpp_file *file)
|
||
{
|
||
if (file->path[0] == '\0')
|
||
{
|
||
file->fd = 0;
|
||
set_stdin_to_binary_mode ();
|
||
}
|
||
else
|
||
file->fd = open (file->path, O_RDONLY | O_NOCTTY | O_BINARY, 0666);
|
||
|
||
if (file->fd != -1)
|
||
{
|
||
if (fstat (file->fd, &file->st) == 0)
|
||
{
|
||
if (!S_ISDIR (file->st.st_mode))
|
||
{
|
||
file->err_no = 0;
|
||
return true;
|
||
}
|
||
|
||
/* Ignore a directory and continue the search. The file we're
|
||
looking for may be elsewhere in the search path. */
|
||
errno = ENOENT;
|
||
}
|
||
|
||
close (file->fd);
|
||
file->fd = -1;
|
||
}
|
||
#if defined(_WIN32) && !defined(__CYGWIN__)
|
||
else if (errno == EACCES)
|
||
{
|
||
/* On most UNIX systems, open succeeds on a directory. Above,
|
||
we check if we have opened a directory and if so, set errno
|
||
to ENOENT. However, on Windows, opening a directory
|
||
fails with EACCES. We want to return ENOENT in that
|
||
case too. */
|
||
if (stat (file->path, &file->st) == 0
|
||
&& S_ISDIR (file->st.st_mode))
|
||
errno = ENOENT;
|
||
else
|
||
/* The call to stat may have reset errno. */
|
||
errno = EACCES;
|
||
}
|
||
#endif
|
||
else if (errno == ENOTDIR)
|
||
errno = ENOENT;
|
||
|
||
file->err_no = errno;
|
||
|
||
return false;
|
||
}
|
||
|
||
/* Temporary PCH intercept of opening a file. Try to find a PCH file
|
||
based on FILE->name and FILE->dir, and test those found for
|
||
validity using PFILE->cb.valid_pch. Return true iff a valid file is
|
||
found. Set *INVALID_PCH if a PCH file is found but wasn't valid. */
|
||
|
||
static bool
|
||
pch_open_file (cpp_reader *pfile, _cpp_file *file, bool *invalid_pch)
|
||
{
|
||
static const char extension[] = ".gch";
|
||
const char *path = file->path;
|
||
size_t len, flen;
|
||
char *pchname;
|
||
struct stat st;
|
||
bool valid = false;
|
||
|
||
/* No PCH on <stdin> or if not requested. */
|
||
if (file->name[0] == '\0' || !pfile->cb.valid_pch)
|
||
return false;
|
||
|
||
/* If the file is not included as first include from either the toplevel
|
||
file or the command-line it is not a valid use of PCH. */
|
||
for (_cpp_file *f = pfile->all_files; f; f = f->next_file)
|
||
if (f->implicit_preinclude)
|
||
continue;
|
||
else if (f->main_file)
|
||
break;
|
||
else
|
||
return false;
|
||
|
||
flen = strlen (path);
|
||
len = flen + sizeof (extension);
|
||
pchname = XNEWVEC (char, len);
|
||
memcpy (pchname, path, flen);
|
||
memcpy (pchname + flen, extension, sizeof (extension));
|
||
|
||
if (stat (pchname, &st) == 0)
|
||
{
|
||
DIR *pchdir;
|
||
struct dirent *d;
|
||
size_t dlen, plen = len;
|
||
|
||
if (!S_ISDIR (st.st_mode))
|
||
valid = validate_pch (pfile, file, pchname);
|
||
else if ((pchdir = opendir (pchname)) != NULL)
|
||
{
|
||
pchname[plen - 1] = '/';
|
||
while ((d = readdir (pchdir)) != NULL)
|
||
{
|
||
dlen = strlen (d->d_name) + 1;
|
||
if ((strcmp (d->d_name, ".") == 0)
|
||
|| (strcmp (d->d_name, "..") == 0))
|
||
continue;
|
||
if (dlen + plen > len)
|
||
{
|
||
len += dlen + 64;
|
||
pchname = XRESIZEVEC (char, pchname, len);
|
||
}
|
||
memcpy (pchname + plen, d->d_name, dlen);
|
||
valid = validate_pch (pfile, file, pchname);
|
||
if (valid)
|
||
break;
|
||
}
|
||
closedir (pchdir);
|
||
}
|
||
if (!valid)
|
||
*invalid_pch = true;
|
||
}
|
||
|
||
if (valid)
|
||
file->pchname = pchname;
|
||
else
|
||
free (pchname);
|
||
|
||
return valid;
|
||
}
|
||
|
||
/* Canonicalize the path to FILE. Return the canonical form if it is
|
||
shorter, otherwise return NULL. This function does NOT free the
|
||
memory pointed by FILE. */
|
||
|
||
static char *
|
||
maybe_shorter_path (const char * file)
|
||
{
|
||
char * file2 = lrealpath (file);
|
||
if (file2 && strlen (file2) < strlen (file))
|
||
{
|
||
return file2;
|
||
}
|
||
else
|
||
{
|
||
free (file2);
|
||
return NULL;
|
||
}
|
||
}
|
||
|
||
/* Try to open the path FILE->name appended to FILE->dir. This is
|
||
where remap and PCH intercept the file lookup process. Return true
|
||
if the file was found, whether or not the open was successful.
|
||
Set *INVALID_PCH to true if a PCH file is found but wasn't valid.
|
||
Use LOC when emitting any diagnostics. */
|
||
|
||
static bool
|
||
find_file_in_dir (cpp_reader *pfile, _cpp_file *file, bool *invalid_pch,
|
||
location_t loc)
|
||
{
|
||
char *path;
|
||
|
||
if (CPP_OPTION (pfile, remap) && (path = remap_filename (pfile, file)))
|
||
;
|
||
else
|
||
if (file->dir->construct)
|
||
path = file->dir->construct (file->name, file->dir);
|
||
else
|
||
path = append_file_to_dir (file->name, file->dir);
|
||
|
||
if (path)
|
||
{
|
||
hashval_t hv;
|
||
char *copy;
|
||
void **pp;
|
||
|
||
/* We try to canonicalize system headers. For DOS based file
|
||
* system, we always try to shorten non-system headers, as DOS
|
||
* has a tighter constraint on max path length. */
|
||
if ((CPP_OPTION (pfile, canonical_system_headers) && file->dir->sysp)
|
||
#ifdef HAVE_DOS_BASED_FILE_SYSTEM
|
||
|| !file->dir->sysp
|
||
#endif
|
||
)
|
||
{
|
||
char * canonical_path = maybe_shorter_path (path);
|
||
if (canonical_path)
|
||
{
|
||
/* The canonical path was newly allocated. Let's free the
|
||
non-canonical one. */
|
||
free (path);
|
||
path = canonical_path;
|
||
}
|
||
}
|
||
|
||
hv = htab_hash_string (path);
|
||
if (htab_find_with_hash (pfile->nonexistent_file_hash, path, hv) != NULL)
|
||
{
|
||
file->err_no = ENOENT;
|
||
return false;
|
||
}
|
||
|
||
file->path = path;
|
||
if (pch_open_file (pfile, file, invalid_pch))
|
||
return true;
|
||
|
||
if (open_file (file))
|
||
return true;
|
||
|
||
if (file->err_no != ENOENT)
|
||
{
|
||
open_file_failed (pfile, file, 0, loc);
|
||
return true;
|
||
}
|
||
|
||
/* We copy the path name onto an obstack partly so that we don't
|
||
leak the memory, but mostly so that we don't fragment the
|
||
heap. */
|
||
copy = (char *) obstack_copy0 (&pfile->nonexistent_file_ob, path,
|
||
strlen (path));
|
||
free (path);
|
||
pp = htab_find_slot_with_hash (pfile->nonexistent_file_hash,
|
||
copy, hv, INSERT);
|
||
*pp = copy;
|
||
|
||
file->path = file->name;
|
||
}
|
||
else
|
||
{
|
||
file->err_no = ENOENT;
|
||
file->path = NULL;
|
||
}
|
||
|
||
return false;
|
||
}
|
||
|
||
/* Return true iff the missing_header callback found the given HEADER. */
|
||
static bool
|
||
search_path_exhausted (cpp_reader *pfile, const char *header, _cpp_file *file)
|
||
{
|
||
missing_header_cb func = pfile->cb.missing_header;
|
||
|
||
/* When the regular search path doesn't work, try context dependent
|
||
headers search paths. */
|
||
if (func
|
||
&& file->dir == NULL)
|
||
{
|
||
if ((file->path = func (pfile, header, &file->dir)) != NULL)
|
||
{
|
||
if (open_file (file))
|
||
return true;
|
||
free ((void *)file->path);
|
||
}
|
||
file->path = file->name;
|
||
}
|
||
|
||
return false;
|
||
}
|
||
|
||
bool
|
||
_cpp_find_failed (_cpp_file *file)
|
||
{
|
||
return file->err_no != 0;
|
||
}
|
||
|
||
/* Given a filename FNAME search for such a file in the include path
|
||
starting from START_DIR. If FNAME is the empty string it is
|
||
interpreted as STDIN if START_DIR is PFILE->no_search_path.
|
||
|
||
If the file is not found in the file cache fall back to the O/S and
|
||
add the result to our cache.
|
||
|
||
If the file was not found in the filesystem, or there was an error
|
||
opening it, then ERR_NO is nonzero and FD is -1. If the file was
|
||
found, then ERR_NO is zero and FD could be -1 or an open file
|
||
descriptor. FD can be -1 if the file was found in the cache and
|
||
had previously been closed. To open it again pass the return value
|
||
to open_file().
|
||
|
||
If IMPLICIT_PREINCLUDE then it is OK for the file to be missing.
|
||
If present, it is OK for a precompiled header to be included after
|
||
it.
|
||
|
||
Use LOC as the location for any errors. */
|
||
|
||
_cpp_file *
|
||
_cpp_find_file (cpp_reader *pfile, const char *fname, cpp_dir *start_dir,
|
||
bool fake, int angle_brackets, bool implicit_preinclude,
|
||
location_t loc)
|
||
{
|
||
struct cpp_file_hash_entry *entry;
|
||
void **hash_slot;
|
||
_cpp_file *file;
|
||
bool invalid_pch = false;
|
||
bool saw_bracket_include = false;
|
||
bool saw_quote_include = false;
|
||
struct cpp_dir *found_in_cache = NULL;
|
||
|
||
/* Ensure we get no confusion between cached files and directories. */
|
||
if (start_dir == NULL)
|
||
cpp_error_at (pfile, CPP_DL_ICE, loc, "NULL directory in find_file");
|
||
|
||
hash_slot
|
||
= htab_find_slot_with_hash (pfile->file_hash, fname,
|
||
htab_hash_string (fname), INSERT);
|
||
|
||
/* First check the cache before we resort to memory allocation. */
|
||
entry = search_cache ((struct cpp_file_hash_entry *) *hash_slot, start_dir);
|
||
if (entry)
|
||
return entry->u.file;
|
||
|
||
file = make_cpp_file (pfile, start_dir, fname);
|
||
file->implicit_preinclude
|
||
= (implicit_preinclude
|
||
|| (pfile->buffer
|
||
&& pfile->buffer->file->implicit_preinclude));
|
||
|
||
/* Try each path in the include chain. */
|
||
for (; !fake ;)
|
||
{
|
||
if (find_file_in_dir (pfile, file, &invalid_pch, loc))
|
||
break;
|
||
|
||
file->dir = file->dir->next;
|
||
if (file->dir == NULL)
|
||
{
|
||
if (search_path_exhausted (pfile, fname, file))
|
||
{
|
||
/* Although this file must not go in the cache, because
|
||
the file found might depend on things (like the current file)
|
||
that aren't represented in the cache, it still has to go in
|
||
the list of all files so that #import works. */
|
||
file->next_file = pfile->all_files;
|
||
pfile->all_files = file;
|
||
if (*hash_slot == NULL)
|
||
{
|
||
/* If *hash_slot is NULL, the above htab_find_slot_with_hash
|
||
call just created the slot, but we aren't going to store
|
||
there anything, so need to remove the newly created entry.
|
||
htab_clear_slot requires that it is non-NULL, so store
|
||
there some non-NULL pointer, htab_clear_slot will
|
||
overwrite it immediately. */
|
||
*hash_slot = file;
|
||
htab_clear_slot (pfile->file_hash, hash_slot);
|
||
}
|
||
return file;
|
||
}
|
||
|
||
if (invalid_pch)
|
||
{
|
||
cpp_error (pfile, CPP_DL_ERROR,
|
||
"one or more PCH files were found, but they were invalid");
|
||
if (!cpp_get_options (pfile)->warn_invalid_pch)
|
||
cpp_error (pfile, CPP_DL_ERROR,
|
||
"use -Winvalid-pch for more information");
|
||
}
|
||
if (implicit_preinclude)
|
||
{
|
||
free ((char *) file->name);
|
||
free (file);
|
||
if (*hash_slot == NULL)
|
||
{
|
||
/* See comment on the above htab_clear_slot call. */
|
||
*hash_slot = file;
|
||
htab_clear_slot (pfile->file_hash, hash_slot);
|
||
}
|
||
return NULL;
|
||
}
|
||
else
|
||
open_file_failed (pfile, file, angle_brackets, loc);
|
||
break;
|
||
}
|
||
|
||
/* Only check the cache for the starting location (done above)
|
||
and the quote and bracket chain heads because there are no
|
||
other possible starting points for searches. */
|
||
if (file->dir == pfile->bracket_include)
|
||
saw_bracket_include = true;
|
||
else if (file->dir == pfile->quote_include)
|
||
saw_quote_include = true;
|
||
else
|
||
continue;
|
||
|
||
entry = search_cache ((struct cpp_file_hash_entry *) *hash_slot, file->dir);
|
||
if (entry)
|
||
{
|
||
found_in_cache = file->dir;
|
||
break;
|
||
}
|
||
}
|
||
|
||
if (entry)
|
||
{
|
||
/* Cache for START_DIR too, sharing the _cpp_file structure. */
|
||
free ((char *) file->name);
|
||
free (file);
|
||
file = entry->u.file;
|
||
}
|
||
else
|
||
{
|
||
/* This is a new file; put it in the list. */
|
||
file->next_file = pfile->all_files;
|
||
pfile->all_files = file;
|
||
}
|
||
|
||
/* Store this new result in the hash table. */
|
||
entry = new_file_hash_entry (pfile);
|
||
entry->next = (struct cpp_file_hash_entry *) *hash_slot;
|
||
entry->start_dir = start_dir;
|
||
entry->location = pfile->line_table->highest_location;
|
||
entry->u.file = file;
|
||
*hash_slot = (void *) entry;
|
||
|
||
/* If we passed the quote or bracket chain heads, cache them also.
|
||
This speeds up processing if there are lots of -I options. */
|
||
if (saw_bracket_include
|
||
&& pfile->bracket_include != start_dir
|
||
&& found_in_cache != pfile->bracket_include)
|
||
{
|
||
entry = new_file_hash_entry (pfile);
|
||
entry->next = (struct cpp_file_hash_entry *) *hash_slot;
|
||
entry->start_dir = pfile->bracket_include;
|
||
entry->location = pfile->line_table->highest_location;
|
||
entry->u.file = file;
|
||
*hash_slot = (void *) entry;
|
||
}
|
||
if (saw_quote_include
|
||
&& pfile->quote_include != start_dir
|
||
&& found_in_cache != pfile->quote_include)
|
||
{
|
||
entry = new_file_hash_entry (pfile);
|
||
entry->next = (struct cpp_file_hash_entry *) *hash_slot;
|
||
entry->start_dir = pfile->quote_include;
|
||
entry->location = pfile->line_table->highest_location;
|
||
entry->u.file = file;
|
||
*hash_slot = (void *) entry;
|
||
}
|
||
|
||
return file;
|
||
}
|
||
|
||
/* Read a file into FILE->buffer, returning true on success.
|
||
|
||
If FILE->fd is something weird, like a block device, we don't want
|
||
to read it at all. Don't even try to figure out what something is,
|
||
except for plain files and block devices, since there is no
|
||
reliable portable way of doing this.
|
||
|
||
Use LOC for any diagnostics.
|
||
|
||
FIXME: Flush file cache and try again if we run out of memory. */
|
||
static bool
|
||
read_file_guts (cpp_reader *pfile, _cpp_file *file, location_t loc)
|
||
{
|
||
ssize_t size, total, count;
|
||
uchar *buf;
|
||
bool regular;
|
||
|
||
if (S_ISBLK (file->st.st_mode))
|
||
{
|
||
cpp_error_at (pfile, CPP_DL_ERROR, loc,
|
||
"%s is a block device", file->path);
|
||
return false;
|
||
}
|
||
|
||
regular = S_ISREG (file->st.st_mode) != 0;
|
||
if (regular)
|
||
{
|
||
/* off_t might have a wider range than ssize_t - in other words,
|
||
the max size of a file might be bigger than the address
|
||
space. We can't handle a file that large. (Anyone with
|
||
a single source file bigger than 2GB needs to rethink
|
||
their coding style.) Some systems (e.g. AIX 4.1) define
|
||
SSIZE_MAX to be much smaller than the actual range of the
|
||
type. Use INTTYPE_MAXIMUM unconditionally to ensure this
|
||
does not bite us. */
|
||
if (file->st.st_size > INTTYPE_MAXIMUM (ssize_t))
|
||
{
|
||
cpp_error_at (pfile, CPP_DL_ERROR, loc,
|
||
"%s is too large", file->path);
|
||
return false;
|
||
}
|
||
|
||
size = file->st.st_size;
|
||
}
|
||
else
|
||
/* 8 kilobytes is a sensible starting size. It ought to be bigger
|
||
than the kernel pipe buffer, and it's definitely bigger than
|
||
the majority of C source files. */
|
||
size = 8 * 1024;
|
||
|
||
/* The + 16 here is space for the final '\n' and 15 bytes of padding,
|
||
used to quiet warnings from valgrind or Address Sanitizer, when the
|
||
optimized lexer accesses aligned 16-byte memory chunks, including
|
||
the bytes after the malloced, area, and stops lexing on '\n'. */
|
||
buf = XNEWVEC (uchar, size + 16);
|
||
total = 0;
|
||
while ((count = read (file->fd, buf + total, size - total)) > 0)
|
||
{
|
||
total += count;
|
||
|
||
if (total == size)
|
||
{
|
||
if (regular)
|
||
break;
|
||
size *= 2;
|
||
buf = XRESIZEVEC (uchar, buf, size + 16);
|
||
}
|
||
}
|
||
|
||
if (count < 0)
|
||
{
|
||
cpp_errno_filename (pfile, CPP_DL_ERROR, file->path, loc);
|
||
free (buf);
|
||
return false;
|
||
}
|
||
|
||
if (regular && total != size && STAT_SIZE_RELIABLE (file->st))
|
||
cpp_error_at (pfile, CPP_DL_WARNING, loc,
|
||
"%s is shorter than expected", file->path);
|
||
|
||
file->buffer = _cpp_convert_input (pfile,
|
||
CPP_OPTION (pfile, input_charset),
|
||
buf, size + 16, total,
|
||
&file->buffer_start,
|
||
&file->st.st_size);
|
||
file->buffer_valid = true;
|
||
|
||
return true;
|
||
}
|
||
|
||
/* Convenience wrapper around read_file_guts that opens the file if
|
||
necessary and closes the file descriptor after reading. FILE must
|
||
have been passed through find_file() at some stage. Use LOC for
|
||
any diagnostics. */
|
||
static bool
|
||
read_file (cpp_reader *pfile, _cpp_file *file, location_t loc)
|
||
{
|
||
/* If we already have its contents in memory, succeed immediately. */
|
||
if (file->buffer_valid)
|
||
return true;
|
||
|
||
/* If an earlier read failed for some reason don't try again. */
|
||
if (file->dont_read || file->err_no)
|
||
return false;
|
||
|
||
if (file->fd == -1 && !open_file (file))
|
||
{
|
||
open_file_failed (pfile, file, 0, loc);
|
||
return false;
|
||
}
|
||
|
||
file->dont_read = !read_file_guts (pfile, file, loc);
|
||
close (file->fd);
|
||
file->fd = -1;
|
||
|
||
return !file->dont_read;
|
||
}
|
||
|
||
/* Returns TRUE if FILE's contents have been successfully placed in
|
||
FILE->buffer and the file should be stacked, otherwise false.
|
||
Use LOC for any diagnostics. */
|
||
static bool
|
||
should_stack_file (cpp_reader *pfile, _cpp_file *file, bool import,
|
||
location_t loc)
|
||
{
|
||
_cpp_file *f;
|
||
|
||
/* Skip once-only files. */
|
||
if (file->once_only)
|
||
return false;
|
||
|
||
/* We must mark the file once-only if #import now, before header
|
||
guard checks. Otherwise, undefining the header guard might
|
||
cause the file to be re-stacked. */
|
||
if (import)
|
||
{
|
||
_cpp_mark_file_once_only (pfile, file);
|
||
|
||
/* Don't stack files that have been stacked before. */
|
||
if (file->stack_count)
|
||
return false;
|
||
}
|
||
|
||
/* Skip if the file had a header guard and the macro is defined.
|
||
PCH relies on this appearing before the PCH handler below. */
|
||
if (file->cmacro && cpp_macro_p (file->cmacro))
|
||
return false;
|
||
|
||
/* Handle PCH files immediately; don't stack them. */
|
||
if (file->pchname)
|
||
{
|
||
pfile->cb.read_pch (pfile, file->pchname, file->fd, file->path);
|
||
file->fd = -1;
|
||
free ((void *) file->pchname);
|
||
file->pchname = NULL;
|
||
return false;
|
||
}
|
||
|
||
if (!read_file (pfile, file, loc))
|
||
return false;
|
||
|
||
/* Check the file against the PCH file. This is done before
|
||
checking against files we've already seen, since it may save on
|
||
I/O. */
|
||
if (check_file_against_entries (pfile, file, import))
|
||
{
|
||
/* If this isn't a #import, but yet we can't include the file,
|
||
that means that it was #import-ed in the PCH file,
|
||
so we can never include it again. */
|
||
if (! import)
|
||
_cpp_mark_file_once_only (pfile, file);
|
||
return false;
|
||
}
|
||
|
||
/* Now we've read the file's contents, we can stack it if there
|
||
are no once-only files. */
|
||
if (!pfile->seen_once_only)
|
||
return true;
|
||
|
||
/* We may have read the file under a different name. Look
|
||
for likely candidates and compare file contents to be sure. */
|
||
for (f = pfile->all_files; f; f = f->next_file)
|
||
{
|
||
if (f == file)
|
||
continue;
|
||
|
||
if ((import || f->once_only)
|
||
&& f->err_no == 0
|
||
&& f->st.st_mtime == file->st.st_mtime
|
||
&& f->st.st_size == file->st.st_size)
|
||
{
|
||
_cpp_file *ref_file;
|
||
bool same_file_p = false;
|
||
|
||
if (f->buffer && !f->buffer_valid)
|
||
{
|
||
/* We already have a buffer but it is not valid, because
|
||
the file is still stacked. Make a new one. */
|
||
ref_file = make_cpp_file (pfile, f->dir, f->name);
|
||
ref_file->path = f->path;
|
||
}
|
||
else
|
||
/* The file is not stacked anymore. We can reuse it. */
|
||
ref_file = f;
|
||
|
||
same_file_p = read_file (pfile, ref_file, loc)
|
||
/* Size might have changed in read_file(). */
|
||
&& ref_file->st.st_size == file->st.st_size
|
||
&& !memcmp (ref_file->buffer,
|
||
file->buffer,
|
||
file->st.st_size);
|
||
|
||
if (f->buffer && !f->buffer_valid)
|
||
{
|
||
ref_file->path = 0;
|
||
destroy_cpp_file (ref_file);
|
||
}
|
||
|
||
if (same_file_p)
|
||
break;
|
||
}
|
||
}
|
||
|
||
return f == NULL;
|
||
}
|
||
|
||
/* Place the file referenced by FILE into a new buffer on the buffer
|
||
stack if possible. IMPORT is true if this stacking attempt is
|
||
because of a #import directive. Returns true if a buffer is
|
||
stacked. Use LOC for any diagnostics. */
|
||
bool
|
||
_cpp_stack_file (cpp_reader *pfile, _cpp_file *file, bool import,
|
||
location_t loc)
|
||
{
|
||
cpp_buffer *buffer;
|
||
int sysp;
|
||
|
||
if (!should_stack_file (pfile, file, import, loc))
|
||
return false;
|
||
|
||
if (pfile->buffer == NULL || file->dir == NULL)
|
||
sysp = 0;
|
||
else
|
||
sysp = MAX (pfile->buffer->sysp, file->dir->sysp);
|
||
|
||
/* Add the file to the dependencies on its first inclusion. */
|
||
if (!file->stack_count
|
||
&& CPP_OPTION (pfile, deps.style) > !!sysp
|
||
&& file->path[0]
|
||
&& (!file->main_file || !CPP_OPTION (pfile, deps.ignore_main_file)))
|
||
deps_add_dep (pfile->deps, file->path);
|
||
|
||
/* Clear buffer_valid since _cpp_clean_line messes it up. */
|
||
file->buffer_valid = false;
|
||
file->stack_count++;
|
||
|
||
/* Stack the buffer. */
|
||
buffer = cpp_push_buffer (pfile, file->buffer, file->st.st_size,
|
||
CPP_OPTION (pfile, preprocessed)
|
||
&& !CPP_OPTION (pfile, directives_only));
|
||
buffer->file = file;
|
||
buffer->sysp = sysp;
|
||
buffer->to_free = file->buffer_start;
|
||
|
||
/* Initialize controlling macro state. */
|
||
pfile->mi_valid = true;
|
||
pfile->mi_cmacro = 0;
|
||
|
||
/* Generate the call back. */
|
||
_cpp_do_file_change (pfile, LC_ENTER, file->path, 1, sysp);
|
||
|
||
return true;
|
||
}
|
||
|
||
/* Mark FILE to be included once only. */
|
||
void
|
||
_cpp_mark_file_once_only (cpp_reader *pfile, _cpp_file *file)
|
||
{
|
||
pfile->seen_once_only = true;
|
||
file->once_only = true;
|
||
}
|
||
|
||
/* Return the directory from which searching for FNAME should start,
|
||
considering the directive TYPE and ANGLE_BRACKETS. If there is
|
||
nothing left in the path, returns NULL. */
|
||
static struct cpp_dir *
|
||
search_path_head (cpp_reader *pfile, const char *fname, int angle_brackets,
|
||
enum include_type type)
|
||
{
|
||
cpp_dir *dir;
|
||
_cpp_file *file;
|
||
|
||
if (IS_ABSOLUTE_PATH (fname))
|
||
return &pfile->no_search_path;
|
||
|
||
/* pfile->buffer is NULL when processing an -include command-line flag. */
|
||
file = pfile->buffer == NULL ? pfile->main_file : pfile->buffer->file;
|
||
|
||
/* For #include_next, skip in the search path past the dir in which
|
||
the current file was found, but if it was found via an absolute
|
||
path use the normal search logic. */
|
||
if (type == IT_INCLUDE_NEXT && file->dir
|
||
&& file->dir != &pfile->no_search_path)
|
||
dir = file->dir->next;
|
||
else if (angle_brackets)
|
||
dir = pfile->bracket_include;
|
||
else if (type == IT_CMDLINE)
|
||
/* -include and -imacros use the #include "" chain with the
|
||
preprocessor's cwd prepended. */
|
||
return make_cpp_dir (pfile, "./", false);
|
||
else if (pfile->quote_ignores_source_dir)
|
||
dir = pfile->quote_include;
|
||
else
|
||
return make_cpp_dir (pfile, dir_name_of_file (file),
|
||
pfile->buffer ? pfile->buffer->sysp : 0);
|
||
|
||
if (dir == NULL)
|
||
cpp_error (pfile, CPP_DL_ERROR,
|
||
"no include path in which to search for %s", fname);
|
||
|
||
return dir;
|
||
}
|
||
|
||
/* Strip the basename from the file's path. It ends with a slash if
|
||
of nonzero length. Note that this procedure also works for
|
||
<stdin>, which is represented by the empty string. */
|
||
static const char *
|
||
dir_name_of_file (_cpp_file *file)
|
||
{
|
||
if (!file->dir_name)
|
||
{
|
||
size_t len = lbasename (file->path) - file->path;
|
||
char *dir_name = XNEWVEC (char, len + 1);
|
||
|
||
memcpy (dir_name, file->path, len);
|
||
dir_name[len] = '\0';
|
||
file->dir_name = dir_name;
|
||
}
|
||
|
||
return file->dir_name;
|
||
}
|
||
|
||
/* Handles #include-family directives (distinguished by TYPE),
|
||
including HEADER, and the command line -imacros and -include.
|
||
Returns true if a buffer was stacked. */
|
||
bool
|
||
_cpp_stack_include (cpp_reader *pfile, const char *fname, int angle_brackets,
|
||
enum include_type type, location_t loc)
|
||
{
|
||
struct cpp_dir *dir;
|
||
_cpp_file *file;
|
||
bool stacked;
|
||
bool decremented = false;
|
||
|
||
/* For -include command-line flags we have type == IT_CMDLINE.
|
||
When the first -include file is processed we have the case, where
|
||
pfile->cur_token == pfile->cur_run->base, we are directly called up
|
||
by the front end. However in the case of the second -include file,
|
||
we are called from _cpp_lex_token -> _cpp_get_fresh_line ->
|
||
cpp_push_include, with pfile->cur_token != pfile->cur_run->base,
|
||
and pfile->cur_token[-1].src_loc not (yet) initialized.
|
||
However, when the include file cannot be found, we need src_loc to
|
||
be initialized to some safe value: 0 means UNKNOWN_LOCATION. */
|
||
if (type == IT_CMDLINE && pfile->cur_token != pfile->cur_run->base)
|
||
pfile->cur_token[-1].src_loc = 0;
|
||
|
||
dir = search_path_head (pfile, fname, angle_brackets, type);
|
||
if (!dir)
|
||
return false;
|
||
|
||
file = _cpp_find_file (pfile, fname, dir, false, angle_brackets,
|
||
type == IT_DEFAULT, loc);
|
||
if (type == IT_DEFAULT && file == NULL)
|
||
return false;
|
||
|
||
/* Compensate for the increment in linemap_add that occurs if
|
||
_cpp_stack_file actually stacks the file. In the case of a normal
|
||
#include, we're currently at the start of the line *following* the
|
||
#include. A separate location_t for this location makes no
|
||
sense (until we do the LC_LEAVE), and complicates
|
||
LAST_SOURCE_LINE_LOCATION. This does not apply if we found a PCH
|
||
file (in which case linemap_add is not called) or we were included
|
||
from the command-line. In the case that the #include is the last
|
||
line in the file, highest_location still points to the current
|
||
line, not the start of the next line, so we do not decrement in
|
||
this case. See plugin/location-overflow-test-pr83173.h for an
|
||
example. */
|
||
if (file->pchname == NULL && file->err_no == 0
|
||
&& type != IT_CMDLINE && type != IT_DEFAULT)
|
||
{
|
||
int highest_line = linemap_get_expansion_line (pfile->line_table,
|
||
pfile->line_table->highest_location);
|
||
int source_line = linemap_get_expansion_line (pfile->line_table, loc);
|
||
if (highest_line > source_line)
|
||
{
|
||
pfile->line_table->highest_location--;
|
||
decremented = true;
|
||
}
|
||
}
|
||
|
||
stacked = _cpp_stack_file (pfile, file, type == IT_IMPORT, loc);
|
||
|
||
if (decremented && !stacked)
|
||
/* _cpp_stack_file didn't stack the file, so let's rollback the
|
||
compensation dance we performed above. */
|
||
pfile->line_table->highest_location++;
|
||
|
||
return stacked;
|
||
}
|
||
|
||
/* Could not open FILE. The complication is dependency output. */
|
||
static void
|
||
open_file_failed (cpp_reader *pfile, _cpp_file *file, int angle_brackets,
|
||
location_t loc)
|
||
{
|
||
int sysp = pfile->line_table->highest_line > 1 && pfile->buffer ? pfile->buffer->sysp : 0;
|
||
bool print_dep = CPP_OPTION (pfile, deps.style) > (angle_brackets || !!sysp);
|
||
|
||
if (pfile->state.in__has_include__)
|
||
return;
|
||
|
||
errno = file->err_no;
|
||
if (print_dep && CPP_OPTION (pfile, deps.missing_files) && errno == ENOENT)
|
||
{
|
||
deps_add_dep (pfile->deps, file->name);
|
||
/* If the preprocessor output (other than dependency information) is
|
||
being used, we must also flag an error. */
|
||
if (CPP_OPTION (pfile, deps.need_preprocessor_output))
|
||
cpp_errno_filename (pfile, CPP_DL_FATAL,
|
||
file->path ? file->path : file->name,
|
||
loc);
|
||
}
|
||
else
|
||
{
|
||
/* If we are not outputting dependencies, or if we are and dependencies
|
||
were requested for this file, or if preprocessor output is needed
|
||
in addition to dependency information, this is an error.
|
||
|
||
Otherwise (outputting dependencies but not for this file, and not
|
||
using the preprocessor output), we can still produce correct output
|
||
so it's only a warning. */
|
||
if (CPP_OPTION (pfile, deps.style) == DEPS_NONE
|
||
|| print_dep
|
||
|| CPP_OPTION (pfile, deps.need_preprocessor_output))
|
||
cpp_errno_filename (pfile, CPP_DL_FATAL,
|
||
file->path ? file->path : file->name,
|
||
loc);
|
||
else
|
||
cpp_errno_filename (pfile, CPP_DL_WARNING,
|
||
file->path ? file->path : file->name,
|
||
loc);
|
||
}
|
||
}
|
||
|
||
/* Search in the chain beginning at HEAD for a file whose search path
|
||
started at START_DIR != NULL. */
|
||
static struct cpp_file_hash_entry *
|
||
search_cache (struct cpp_file_hash_entry *head, const cpp_dir *start_dir)
|
||
{
|
||
while (head && head->start_dir != start_dir)
|
||
head = head->next;
|
||
|
||
return head;
|
||
}
|
||
|
||
/* Allocate a new _cpp_file structure. */
|
||
static _cpp_file *
|
||
make_cpp_file (cpp_reader *pfile, cpp_dir *dir, const char *fname)
|
||
{
|
||
_cpp_file *file;
|
||
|
||
file = XCNEW (_cpp_file);
|
||
file->main_file = !pfile->buffer;
|
||
file->fd = -1;
|
||
file->dir = dir;
|
||
file->name = xstrdup (fname);
|
||
|
||
return file;
|
||
}
|
||
|
||
/* Release a _cpp_file structure. */
|
||
static void
|
||
destroy_cpp_file (_cpp_file *file)
|
||
{
|
||
free ((void *) file->buffer_start);
|
||
free ((void *) file->name);
|
||
free ((void *) file->path);
|
||
free (file);
|
||
}
|
||
|
||
/* Release all the files allocated by this reader. */
|
||
static void
|
||
destroy_all_cpp_files (cpp_reader *pfile)
|
||
{
|
||
_cpp_file *iter = pfile->all_files;
|
||
while (iter)
|
||
{
|
||
_cpp_file *next = iter->next_file;
|
||
destroy_cpp_file (iter);
|
||
iter = next;
|
||
}
|
||
}
|
||
|
||
/* A hash of directory names. The directory names are the path names
|
||
of files which contain a #include "", the included file name is
|
||
appended to this directories.
|
||
|
||
To avoid duplicate entries we follow the convention that all
|
||
non-empty directory names should end in a '/'. DIR_NAME must be
|
||
stored in permanently allocated memory. */
|
||
static cpp_dir *
|
||
make_cpp_dir (cpp_reader *pfile, const char *dir_name, int sysp)
|
||
{
|
||
struct cpp_file_hash_entry *entry, **hash_slot;
|
||
cpp_dir *dir;
|
||
|
||
hash_slot = (struct cpp_file_hash_entry **)
|
||
htab_find_slot_with_hash (pfile->dir_hash, dir_name,
|
||
htab_hash_string (dir_name),
|
||
INSERT);
|
||
|
||
/* Have we already hashed this directory? */
|
||
for (entry = *hash_slot; entry; entry = entry->next)
|
||
if (entry->start_dir == NULL)
|
||
return entry->u.dir;
|
||
|
||
dir = XCNEW (cpp_dir);
|
||
dir->next = pfile->quote_include;
|
||
dir->name = (char *) dir_name;
|
||
dir->len = strlen (dir_name);
|
||
dir->sysp = sysp;
|
||
dir->construct = 0;
|
||
|
||
/* Store this new result in the hash table. */
|
||
entry = new_file_hash_entry (pfile);
|
||
entry->next = *hash_slot;
|
||
entry->start_dir = NULL;
|
||
entry->location = pfile->line_table->highest_location;
|
||
entry->u.dir = dir;
|
||
*hash_slot = entry;
|
||
|
||
return dir;
|
||
}
|
||
|
||
/* Create a new block of memory for file hash entries. */
|
||
static void
|
||
allocate_file_hash_entries (cpp_reader *pfile)
|
||
{
|
||
struct file_hash_entry_pool *pool = XNEW (struct file_hash_entry_pool);
|
||
pool->file_hash_entries_used = 0;
|
||
pool->next = pfile->file_hash_entries;
|
||
pfile->file_hash_entries = pool;
|
||
}
|
||
|
||
/* Return a new file hash entry. */
|
||
static struct cpp_file_hash_entry *
|
||
new_file_hash_entry (cpp_reader *pfile)
|
||
{
|
||
unsigned int idx;
|
||
if (pfile->file_hash_entries->file_hash_entries_used == FILE_HASH_POOL_SIZE)
|
||
allocate_file_hash_entries (pfile);
|
||
|
||
idx = pfile->file_hash_entries->file_hash_entries_used++;
|
||
return &pfile->file_hash_entries->pool[idx];
|
||
}
|
||
|
||
/* Free the file hash entry pools. */
|
||
static void
|
||
free_file_hash_entries (cpp_reader *pfile)
|
||
{
|
||
struct file_hash_entry_pool *iter = pfile->file_hash_entries;
|
||
while (iter)
|
||
{
|
||
struct file_hash_entry_pool *next = iter->next;
|
||
free (iter);
|
||
iter = next;
|
||
}
|
||
}
|
||
|
||
/* Returns TRUE if a file FNAME has ever been successfully opened.
|
||
This routine is not intended to correctly handle filenames aliased
|
||
by links or redundant . or .. traversals etc. */
|
||
bool
|
||
cpp_included (cpp_reader *pfile, const char *fname)
|
||
{
|
||
struct cpp_file_hash_entry *entry;
|
||
|
||
entry = (struct cpp_file_hash_entry *)
|
||
htab_find_with_hash (pfile->file_hash, fname, htab_hash_string (fname));
|
||
|
||
while (entry && (entry->start_dir == NULL || entry->u.file->err_no))
|
||
entry = entry->next;
|
||
|
||
return entry != NULL;
|
||
}
|
||
|
||
/* Returns TRUE if a file FNAME has ever been successfully opened
|
||
before LOCATION. This routine is not intended to correctly handle
|
||
filenames aliased by links or redundant . or .. traversals etc. */
|
||
bool
|
||
cpp_included_before (cpp_reader *pfile, const char *fname,
|
||
location_t location)
|
||
{
|
||
struct cpp_file_hash_entry *entry
|
||
= (struct cpp_file_hash_entry *)
|
||
htab_find_with_hash (pfile->file_hash, fname, htab_hash_string (fname));
|
||
|
||
if (IS_ADHOC_LOC (location))
|
||
location = get_location_from_adhoc_loc (pfile->line_table, location);
|
||
|
||
while (entry && (entry->start_dir == NULL || entry->u.file->err_no
|
||
|| entry->location > location))
|
||
entry = entry->next;
|
||
|
||
return entry != NULL;
|
||
}
|
||
|
||
/* Calculate the hash value of a file hash entry P. */
|
||
|
||
static hashval_t
|
||
file_hash_hash (const void *p)
|
||
{
|
||
struct cpp_file_hash_entry *entry = (struct cpp_file_hash_entry *) p;
|
||
const char *hname;
|
||
if (entry->start_dir)
|
||
hname = entry->u.file->name;
|
||
else
|
||
hname = entry->u.dir->name;
|
||
|
||
return htab_hash_string (hname);
|
||
}
|
||
|
||
/* Compare a string Q against a file hash entry P. */
|
||
static int
|
||
file_hash_eq (const void *p, const void *q)
|
||
{
|
||
struct cpp_file_hash_entry *entry = (struct cpp_file_hash_entry *) p;
|
||
const char *fname = (const char *) q;
|
||
const char *hname;
|
||
|
||
if (entry->start_dir)
|
||
hname = entry->u.file->name;
|
||
else
|
||
hname = entry->u.dir->name;
|
||
|
||
return filename_cmp (hname, fname) == 0;
|
||
}
|
||
|
||
/* Compare entries in the nonexistent file hash table. These are just
|
||
strings. */
|
||
static int
|
||
nonexistent_file_hash_eq (const void *p, const void *q)
|
||
{
|
||
return filename_cmp ((const char *) p, (const char *) q) == 0;
|
||
}
|
||
|
||
/* Initialize everything in this source file. */
|
||
void
|
||
_cpp_init_files (cpp_reader *pfile)
|
||
{
|
||
pfile->file_hash = htab_create_alloc (127, file_hash_hash, file_hash_eq,
|
||
NULL, xcalloc, free);
|
||
pfile->dir_hash = htab_create_alloc (127, file_hash_hash, file_hash_eq,
|
||
NULL, xcalloc, free);
|
||
allocate_file_hash_entries (pfile);
|
||
pfile->nonexistent_file_hash = htab_create_alloc (127, htab_hash_string,
|
||
nonexistent_file_hash_eq,
|
||
NULL, xcalloc, free);
|
||
obstack_specify_allocation (&pfile->nonexistent_file_ob, 0, 0,
|
||
xmalloc, free);
|
||
}
|
||
|
||
/* Finalize everything in this source file. */
|
||
void
|
||
_cpp_cleanup_files (cpp_reader *pfile)
|
||
{
|
||
htab_delete (pfile->file_hash);
|
||
htab_delete (pfile->dir_hash);
|
||
htab_delete (pfile->nonexistent_file_hash);
|
||
obstack_free (&pfile->nonexistent_file_ob, 0);
|
||
free_file_hash_entries (pfile);
|
||
destroy_all_cpp_files (pfile);
|
||
}
|
||
|
||
/* Make the parser forget about files it has seen. This can be useful
|
||
for resetting the parser to start another run. */
|
||
void
|
||
cpp_clear_file_cache (cpp_reader *pfile)
|
||
{
|
||
_cpp_cleanup_files (pfile);
|
||
pfile->file_hash_entries = NULL;
|
||
pfile->all_files = NULL;
|
||
_cpp_init_files (pfile);
|
||
}
|
||
|
||
/* Enter a file name in the hash for the sake of cpp_included. */
|
||
void
|
||
_cpp_fake_include (cpp_reader *pfile, const char *fname)
|
||
{
|
||
_cpp_find_file (pfile, fname, pfile->buffer->file->dir, true, 0, false, 0);
|
||
}
|
||
|
||
/* Not everyone who wants to set system-header-ness on a buffer can
|
||
see the details of a buffer. This is an exported interface because
|
||
fix-header needs it. */
|
||
void
|
||
cpp_make_system_header (cpp_reader *pfile, int syshdr, int externc)
|
||
{
|
||
int flags = 0;
|
||
const class line_maps *line_table = pfile->line_table;
|
||
const line_map_ordinary *map = LINEMAPS_LAST_ORDINARY_MAP (line_table);
|
||
/* 1 = system header, 2 = system header to be treated as C. */
|
||
if (syshdr)
|
||
flags = 1 + (externc != 0);
|
||
pfile->buffer->sysp = flags;
|
||
_cpp_do_file_change (pfile, LC_RENAME, ORDINARY_MAP_FILE_NAME (map),
|
||
SOURCE_LINE (map, pfile->line_table->highest_line), flags);
|
||
}
|
||
|
||
/* Allow the client to change the current file. Used by the front end
|
||
to achieve pseudo-file names like <built-in>.
|
||
If REASON is LC_LEAVE, then NEW_NAME must be NULL. */
|
||
void
|
||
cpp_change_file (cpp_reader *pfile, enum lc_reason reason,
|
||
const char *new_name)
|
||
{
|
||
_cpp_do_file_change (pfile, reason, new_name, 1, 0);
|
||
}
|
||
|
||
struct report_missing_guard_data
|
||
{
|
||
const char **paths;
|
||
size_t count;
|
||
};
|
||
|
||
/* Callback function for htab_traverse. */
|
||
static int
|
||
report_missing_guard (void **slot, void *d)
|
||
{
|
||
struct cpp_file_hash_entry *entry = (struct cpp_file_hash_entry *) *slot;
|
||
struct report_missing_guard_data *data
|
||
= (struct report_missing_guard_data *) d;
|
||
|
||
/* Skip directories. */
|
||
if (entry->start_dir != NULL)
|
||
{
|
||
_cpp_file *file = entry->u.file;
|
||
|
||
/* We don't want MI guard advice for the main file. */
|
||
if (!file->once_only && file->cmacro == NULL
|
||
&& file->stack_count == 1 && !file->main_file)
|
||
{
|
||
if (data->paths == NULL)
|
||
{
|
||
data->paths = XCNEWVEC (const char *, data->count);
|
||
data->count = 0;
|
||
}
|
||
|
||
data->paths[data->count++] = file->path;
|
||
}
|
||
}
|
||
|
||
/* Keep traversing the hash table. */
|
||
return 1;
|
||
}
|
||
|
||
/* Comparison function for qsort. */
|
||
static int
|
||
report_missing_guard_cmp (const void *p1, const void *p2)
|
||
{
|
||
return strcmp (*(const char *const *) p1, *(const char *const *) p2);
|
||
}
|
||
|
||
/* Report on all files that might benefit from a multiple include guard.
|
||
Triggered by -H. */
|
||
void
|
||
_cpp_report_missing_guards (cpp_reader *pfile)
|
||
{
|
||
struct report_missing_guard_data data;
|
||
|
||
data.paths = NULL;
|
||
data.count = htab_elements (pfile->file_hash);
|
||
htab_traverse (pfile->file_hash, report_missing_guard, &data);
|
||
|
||
if (data.paths != NULL)
|
||
{
|
||
size_t i;
|
||
|
||
/* Sort the paths to avoid outputting them in hash table
|
||
order. */
|
||
qsort (data.paths, data.count, sizeof (const char *),
|
||
report_missing_guard_cmp);
|
||
fputs (_("Multiple include guards may be useful for:\n"),
|
||
stderr);
|
||
for (i = 0; i < data.count; i++)
|
||
{
|
||
fputs (data.paths[i], stderr);
|
||
putc ('\n', stderr);
|
||
}
|
||
free (data.paths);
|
||
}
|
||
}
|
||
|
||
/* Locate HEADER, and determine whether it is newer than the current
|
||
file. If it cannot be located or dated, return -1, if it is
|
||
newer, return 1, otherwise 0. */
|
||
int
|
||
_cpp_compare_file_date (cpp_reader *pfile, const char *fname,
|
||
int angle_brackets)
|
||
{
|
||
_cpp_file *file;
|
||
struct cpp_dir *dir;
|
||
|
||
dir = search_path_head (pfile, fname, angle_brackets, IT_INCLUDE);
|
||
if (!dir)
|
||
return -1;
|
||
|
||
file = _cpp_find_file (pfile, fname, dir, false, angle_brackets, false, 0);
|
||
if (file->err_no)
|
||
return -1;
|
||
|
||
if (file->fd != -1)
|
||
{
|
||
close (file->fd);
|
||
file->fd = -1;
|
||
}
|
||
|
||
return file->st.st_mtime > pfile->buffer->file->st.st_mtime;
|
||
}
|
||
|
||
/* Pushes the given file onto the buffer stack. Returns nonzero if
|
||
successful. */
|
||
bool
|
||
cpp_push_include (cpp_reader *pfile, const char *fname)
|
||
{
|
||
return _cpp_stack_include (pfile, fname, false, IT_CMDLINE, 0);
|
||
}
|
||
|
||
/* Pushes the given file, implicitly included at the start of a
|
||
compilation, onto the buffer stack but without any errors if the
|
||
file is not found. Returns nonzero if successful. */
|
||
bool
|
||
cpp_push_default_include (cpp_reader *pfile, const char *fname)
|
||
{
|
||
return _cpp_stack_include (pfile, fname, true, IT_DEFAULT, 0);
|
||
}
|
||
|
||
/* Do appropriate cleanup when a file INC's buffer is popped off the
|
||
input stack. */
|
||
void
|
||
_cpp_pop_file_buffer (cpp_reader *pfile, _cpp_file *file,
|
||
const unsigned char *to_free)
|
||
{
|
||
/* Record the inclusion-preventing macro, which could be NULL
|
||
meaning no controlling macro. */
|
||
if (pfile->mi_valid && file->cmacro == NULL)
|
||
file->cmacro = pfile->mi_cmacro;
|
||
|
||
/* Invalidate control macros in the #including file. */
|
||
pfile->mi_valid = false;
|
||
|
||
if (to_free)
|
||
{
|
||
if (to_free == file->buffer_start)
|
||
{
|
||
file->buffer_start = NULL;
|
||
file->buffer = NULL;
|
||
file->buffer_valid = false;
|
||
}
|
||
free ((void *) to_free);
|
||
}
|
||
}
|
||
|
||
/* Return the file name associated with FILE. */
|
||
const char *
|
||
_cpp_get_file_name (_cpp_file *file)
|
||
{
|
||
return file->name;
|
||
}
|
||
|
||
/* Inteface to file statistics record in _cpp_file structure. */
|
||
struct stat *
|
||
_cpp_get_file_stat (_cpp_file *file)
|
||
{
|
||
return &file->st;
|
||
}
|
||
|
||
/* Set the include chain for "" to QUOTE, for <> to BRACKET. If
|
||
QUOTE_IGNORES_SOURCE_DIR, then "" includes do not look in the
|
||
directory of the including file.
|
||
|
||
If BRACKET does not lie in the QUOTE chain, it is set to QUOTE. */
|
||
void
|
||
cpp_set_include_chains (cpp_reader *pfile, cpp_dir *quote, cpp_dir *bracket,
|
||
int quote_ignores_source_dir)
|
||
{
|
||
pfile->quote_include = quote;
|
||
pfile->bracket_include = quote;
|
||
pfile->quote_ignores_source_dir = quote_ignores_source_dir;
|
||
|
||
for (; quote; quote = quote->next)
|
||
{
|
||
quote->name_map = NULL;
|
||
quote->len = strlen (quote->name);
|
||
if (quote == bracket)
|
||
pfile->bracket_include = bracket;
|
||
}
|
||
}
|
||
|
||
/* Append the file name to the directory to create the path, but don't
|
||
turn / into // or // into ///; // may be a namespace escape. */
|
||
static char *
|
||
append_file_to_dir (const char *fname, cpp_dir *dir)
|
||
{
|
||
size_t dlen, flen;
|
||
char *path;
|
||
|
||
dlen = dir->len;
|
||
flen = strlen (fname);
|
||
path = XNEWVEC (char, dlen + 1 + flen + 1);
|
||
memcpy (path, dir->name, dlen);
|
||
if (dlen && !IS_DIR_SEPARATOR (path[dlen - 1]))
|
||
path[dlen++] = '/';
|
||
memcpy (&path[dlen], fname, flen + 1);
|
||
|
||
return path;
|
||
}
|
||
|
||
/* Read a space delimited string of unlimited length from a stdio
|
||
file F. */
|
||
static char *
|
||
read_filename_string (int ch, FILE *f)
|
||
{
|
||
char *alloc, *set;
|
||
int len;
|
||
|
||
len = 20;
|
||
set = alloc = XNEWVEC (char, len + 1);
|
||
if (! is_space (ch))
|
||
{
|
||
*set++ = ch;
|
||
while ((ch = getc (f)) != EOF && ! is_space (ch))
|
||
{
|
||
if (set - alloc == len)
|
||
{
|
||
len *= 2;
|
||
alloc = XRESIZEVEC (char, alloc, len + 1);
|
||
set = alloc + len / 2;
|
||
}
|
||
*set++ = ch;
|
||
}
|
||
}
|
||
*set = '\0';
|
||
ungetc (ch, f);
|
||
return alloc;
|
||
}
|
||
|
||
/* Read the file name map file for DIR. */
|
||
static void
|
||
read_name_map (cpp_dir *dir)
|
||
{
|
||
static const char FILE_NAME_MAP_FILE[] = "header.gcc";
|
||
char *name;
|
||
FILE *f;
|
||
size_t len, count = 0, room = 9;
|
||
|
||
len = dir->len;
|
||
name = (char *) alloca (len + sizeof (FILE_NAME_MAP_FILE) + 1);
|
||
memcpy (name, dir->name, len);
|
||
if (len && !IS_DIR_SEPARATOR (name[len - 1]))
|
||
name[len++] = '/';
|
||
strcpy (name + len, FILE_NAME_MAP_FILE);
|
||
f = fopen (name, "r");
|
||
|
||
dir->name_map = XNEWVEC (const char *, room);
|
||
|
||
/* Silently return NULL if we cannot open. */
|
||
if (f)
|
||
{
|
||
int ch;
|
||
|
||
while ((ch = getc (f)) != EOF)
|
||
{
|
||
char *to;
|
||
|
||
if (is_space (ch))
|
||
continue;
|
||
|
||
if (count + 2 > room)
|
||
{
|
||
room += 8;
|
||
dir->name_map = XRESIZEVEC (const char *, dir->name_map, room);
|
||
}
|
||
|
||
dir->name_map[count] = read_filename_string (ch, f);
|
||
while ((ch = getc (f)) != EOF && is_hspace (ch))
|
||
;
|
||
|
||
to = read_filename_string (ch, f);
|
||
if (IS_ABSOLUTE_PATH (to))
|
||
dir->name_map[count + 1] = to;
|
||
else
|
||
{
|
||
dir->name_map[count + 1] = append_file_to_dir (to, dir);
|
||
free (to);
|
||
}
|
||
|
||
count += 2;
|
||
while ((ch = getc (f)) != '\n')
|
||
if (ch == EOF)
|
||
break;
|
||
}
|
||
|
||
fclose (f);
|
||
}
|
||
|
||
/* Terminate the list of maps. */
|
||
dir->name_map[count] = NULL;
|
||
}
|
||
|
||
/* Remap a FILE's name based on the file_name_map, if any, for
|
||
FILE->dir. If the file name has any directory separators,
|
||
recursively check those directories too. */
|
||
static char *
|
||
remap_filename (cpp_reader *pfile, _cpp_file *file)
|
||
{
|
||
const char *fname, *p;
|
||
char *new_dir, *p3;
|
||
cpp_dir *dir;
|
||
size_t index, len;
|
||
|
||
dir = file->dir;
|
||
fname = file->name;
|
||
|
||
for (;;)
|
||
{
|
||
if (!dir->name_map)
|
||
read_name_map (dir);
|
||
|
||
for (index = 0; dir->name_map[index]; index += 2)
|
||
if (!filename_cmp (dir->name_map[index], fname))
|
||
return xstrdup (dir->name_map[index + 1]);
|
||
if (IS_ABSOLUTE_PATH (fname))
|
||
return NULL;
|
||
p = strchr (fname, '/');
|
||
#ifdef HAVE_DOS_BASED_FILE_SYSTEM
|
||
{
|
||
char *p2 = strchr (fname, '\\');
|
||
if (!p || (p > p2))
|
||
p = p2;
|
||
}
|
||
#endif
|
||
if (!p || p == fname)
|
||
return NULL;
|
||
|
||
len = dir->len + (p - fname + 1);
|
||
new_dir = XNEWVEC (char, len + 2);
|
||
p3 = new_dir + dir->len;
|
||
memcpy (new_dir, dir->name, dir->len);
|
||
if (dir->len && !IS_DIR_SEPARATOR (dir->name[dir->len - 1]))
|
||
{
|
||
*p3++ = '/';
|
||
len++;
|
||
}
|
||
memcpy (p3, fname, p - fname + 1);
|
||
new_dir[len] = '\0';
|
||
|
||
dir = make_cpp_dir (pfile, new_dir, dir->sysp);
|
||
fname = p + 1;
|
||
}
|
||
}
|
||
|
||
/* Returns true if PCHNAME is a valid PCH file for FILE. */
|
||
static bool
|
||
validate_pch (cpp_reader *pfile, _cpp_file *file, const char *pchname)
|
||
{
|
||
const char *saved_path = file->path;
|
||
bool valid = false;
|
||
|
||
file->path = pchname;
|
||
if (open_file (file))
|
||
{
|
||
valid = 1 & pfile->cb.valid_pch (pfile, pchname, file->fd);
|
||
|
||
if (!valid)
|
||
{
|
||
close (file->fd);
|
||
file->fd = -1;
|
||
}
|
||
|
||
if (CPP_OPTION (pfile, print_include_names))
|
||
{
|
||
unsigned int i;
|
||
for (i = 1; i < pfile->line_table->depth; i++)
|
||
putc ('.', stderr);
|
||
fprintf (stderr, "%c %s\n",
|
||
valid ? '!' : 'x', pchname);
|
||
}
|
||
}
|
||
|
||
file->path = saved_path;
|
||
return valid;
|
||
}
|
||
|
||
/* Get the path associated with the _cpp_file F. The path includes
|
||
the base name from the include directive and the directory it was
|
||
found in via the search path. */
|
||
|
||
const char *
|
||
cpp_get_path (struct _cpp_file *f)
|
||
{
|
||
return f->path;
|
||
}
|
||
|
||
/* Get the directory associated with the _cpp_file F. */
|
||
|
||
cpp_dir *
|
||
cpp_get_dir (struct _cpp_file *f)
|
||
{
|
||
return f->dir;
|
||
}
|
||
|
||
/* Get the cpp_buffer currently associated with the cpp_reader
|
||
PFILE. */
|
||
|
||
cpp_buffer *
|
||
cpp_get_buffer (cpp_reader *pfile)
|
||
{
|
||
return pfile->buffer;
|
||
}
|
||
|
||
/* Get the _cpp_file associated with the cpp_buffer B. */
|
||
|
||
_cpp_file *
|
||
cpp_get_file (cpp_buffer *b)
|
||
{
|
||
return b->file;
|
||
}
|
||
|
||
/* Get the previous cpp_buffer given a cpp_buffer B. The previous
|
||
buffer is the buffer that included the given buffer. */
|
||
|
||
cpp_buffer *
|
||
cpp_get_prev (cpp_buffer *b)
|
||
{
|
||
return b->prev;
|
||
}
|
||
|
||
/* This data structure holds the list of header files that were seen
|
||
while the PCH was being built. The 'entries' field is kept sorted
|
||
in memcmp() order; yes, this means that on little-endian systems,
|
||
it's sorted initially by the least-significant byte of 'size', but
|
||
that's OK. The code does rely on having entries with the same size
|
||
next to each other. */
|
||
|
||
struct pchf_entry {
|
||
/* The size of this file. This is used to save running a MD5 checksum
|
||
if the sizes don't match. */
|
||
off_t size;
|
||
/* The MD5 checksum of this file. */
|
||
unsigned char sum[16];
|
||
/* Is this file to be included only once? */
|
||
bool once_only;
|
||
};
|
||
|
||
struct pchf_data {
|
||
/* Number of pchf_entry structures. */
|
||
size_t count;
|
||
|
||
/* Are there any values with once_only set?
|
||
This is used as an optimisation, it means we don't have to search
|
||
the structure if we're processing a regular #include. */
|
||
bool have_once_only;
|
||
|
||
struct pchf_entry entries[1];
|
||
};
|
||
|
||
static struct pchf_data *pchf;
|
||
|
||
/* A qsort ordering function for pchf_entry structures. */
|
||
|
||
static int
|
||
pchf_save_compare (const void *e1, const void *e2)
|
||
{
|
||
return memcmp (e1, e2, sizeof (struct pchf_entry));
|
||
}
|
||
|
||
/* Create and write to F a pchf_data structure. */
|
||
|
||
bool
|
||
_cpp_save_file_entries (cpp_reader *pfile, FILE *fp)
|
||
{
|
||
size_t count = 0;
|
||
struct pchf_data *result;
|
||
size_t result_size;
|
||
_cpp_file *f;
|
||
bool ret;
|
||
|
||
for (f = pfile->all_files; f; f = f->next_file)
|
||
++count;
|
||
|
||
result_size = (sizeof (struct pchf_data)
|
||
+ sizeof (struct pchf_entry) * (count - 1));
|
||
result = XCNEWVAR (struct pchf_data, result_size);
|
||
|
||
result->count = 0;
|
||
result->have_once_only = false;
|
||
|
||
for (f = pfile->all_files; f; f = f->next_file)
|
||
{
|
||
size_t count;
|
||
|
||
/* This should probably never happen, since if a read error occurred
|
||
the PCH file shouldn't be written... */
|
||
if (f->dont_read || f->err_no)
|
||
continue;
|
||
|
||
if (f->stack_count == 0)
|
||
continue;
|
||
|
||
count = result->count++;
|
||
|
||
result->entries[count].once_only = f->once_only;
|
||
/* |= is avoided in the next line because of an HP C compiler bug */
|
||
result->have_once_only = result->have_once_only | f->once_only;
|
||
if (f->buffer_valid)
|
||
md5_buffer ((const char *)f->buffer,
|
||
f->st.st_size, result->entries[count].sum);
|
||
else
|
||
{
|
||
FILE *ff;
|
||
int oldfd = f->fd;
|
||
|
||
if (!open_file (f))
|
||
{
|
||
open_file_failed (pfile, f, 0, 0);
|
||
free (result);
|
||
return false;
|
||
}
|
||
ff = fdopen (f->fd, "rb");
|
||
md5_stream (ff, result->entries[count].sum);
|
||
fclose (ff);
|
||
f->fd = oldfd;
|
||
}
|
||
result->entries[count].size = f->st.st_size;
|
||
}
|
||
|
||
result_size = (sizeof (struct pchf_data)
|
||
+ sizeof (struct pchf_entry) * (result->count - 1));
|
||
|
||
qsort (result->entries, result->count, sizeof (struct pchf_entry),
|
||
pchf_save_compare);
|
||
|
||
ret = fwrite (result, result_size, 1, fp) == 1;
|
||
free (result);
|
||
return ret;
|
||
}
|
||
|
||
/* Read the pchf_data structure from F. */
|
||
|
||
bool
|
||
_cpp_read_file_entries (cpp_reader *pfile ATTRIBUTE_UNUSED, FILE *f)
|
||
{
|
||
struct pchf_data d;
|
||
|
||
if (fread (&d, sizeof (struct pchf_data) - sizeof (struct pchf_entry), 1, f)
|
||
!= 1)
|
||
return false;
|
||
|
||
pchf = XNEWVAR (struct pchf_data, sizeof (struct pchf_data)
|
||
+ sizeof (struct pchf_entry) * (d.count - 1));
|
||
memcpy (pchf, &d, sizeof (struct pchf_data) - sizeof (struct pchf_entry));
|
||
if (fread (pchf->entries, sizeof (struct pchf_entry), d.count, f)
|
||
!= d.count)
|
||
return false;
|
||
return true;
|
||
}
|
||
|
||
/* The parameters for pchf_compare. */
|
||
|
||
struct pchf_compare_data
|
||
{
|
||
/* The size of the file we're looking for. */
|
||
off_t size;
|
||
|
||
/* The MD5 checksum of the file, if it's been computed. */
|
||
unsigned char sum[16];
|
||
|
||
/* Is SUM valid? */
|
||
bool sum_computed;
|
||
|
||
/* Do we need to worry about entries that don't have ONCE_ONLY set? */
|
||
bool check_included;
|
||
|
||
/* The file that we're searching for. */
|
||
_cpp_file *f;
|
||
};
|
||
|
||
/* bsearch comparison function; look for D_P in E_P. */
|
||
|
||
static int
|
||
pchf_compare (const void *d_p, const void *e_p)
|
||
{
|
||
const struct pchf_entry *e = (const struct pchf_entry *)e_p;
|
||
struct pchf_compare_data *d = (struct pchf_compare_data *)d_p;
|
||
int result;
|
||
|
||
result = memcmp (&d->size, &e->size, sizeof (off_t));
|
||
if (result != 0)
|
||
return result;
|
||
|
||
if (! d->sum_computed)
|
||
{
|
||
_cpp_file *const f = d->f;
|
||
|
||
md5_buffer ((const char *)f->buffer, f->st.st_size, d->sum);
|
||
d->sum_computed = true;
|
||
}
|
||
|
||
result = memcmp (d->sum, e->sum, 16);
|
||
if (result != 0)
|
||
return result;
|
||
|
||
if (d->check_included || e->once_only)
|
||
return 0;
|
||
else
|
||
return 1;
|
||
}
|
||
|
||
/* Check that F is not in a list read from a PCH file (if any).
|
||
Assumes that f->buffer_valid is true. Return TRUE if the file
|
||
should not be read. */
|
||
|
||
static bool
|
||
check_file_against_entries (cpp_reader *pfile ATTRIBUTE_UNUSED,
|
||
_cpp_file *f,
|
||
bool check_included)
|
||
{
|
||
struct pchf_compare_data d;
|
||
|
||
if (pchf == NULL
|
||
|| (! check_included && ! pchf->have_once_only))
|
||
return false;
|
||
|
||
d.size = f->st.st_size;
|
||
d.sum_computed = false;
|
||
d.f = f;
|
||
d.check_included = check_included;
|
||
return bsearch (&d, pchf->entries, pchf->count, sizeof (struct pchf_entry),
|
||
pchf_compare) != NULL;
|
||
}
|
||
|
||
/* Return true if the file FNAME is found in the appropriate include file path
|
||
as indicated by ANGLE_BRACKETS. */
|
||
|
||
bool
|
||
_cpp_has_header (cpp_reader *pfile, const char *fname, int angle_brackets,
|
||
enum include_type type)
|
||
{
|
||
cpp_dir *start_dir = search_path_head (pfile, fname, angle_brackets, type);
|
||
_cpp_file *file = _cpp_find_file (pfile, fname, start_dir,
|
||
/*fake=*/false, angle_brackets,
|
||
/*implicit_preinclude=*/false, 0);
|
||
return file->err_no != ENOENT;
|
||
}
|
||
|