From 65d3284bfe05bd65415f9caf9f535e8bb745bdd1 Mon Sep 17 00:00:00 2001 From: Richard Sandiford Date: Mon, 30 Sep 2013 20:35:40 +0000 Subject: basic-block.h (edge_list): Prefix member names with "m_". gcc/ * basic-block.h (edge_list): Prefix member names with "m_". * context.h (context): Likewise. * domwalk.h (dom_walker): Likewise. * gengtype-state.c (s_expr_writer, state_writer): Likewise. * graphite-sese-to-poly.c (sese_dom_walker): Likewise. * hash-table.h (hash_table): Likewise. * machmode.h (bit_field_mode_iterator): Likewise. * pass_manager.h (pass_list): Likewise. * tree-into-ssa.c (mark_def_dom_walker): Likewise. * tree-pass.h (pass_data): Likewise. * tree-ssa-dom.c (dom_opt_dom_walker): Likewise. * tree-ssa-phiopt.c (nontrapping_dom_walker): Likewise, * tree-ssa-uncprop.c (uncprop_dom_walker): Likewise. * asan.c (pass_data_asan): Update accordingly. * cfganal.c (control_dependences::find_control_dependence): Likewise. (control_dependences::control_dependences): Likewise. (control_dependences::~control_dependences): Likewise. (control_dependences::~control_dependences): Likewise. (control_dependences::get_edges_dependent_on): Likewise. * cgraphbuild.c (pass_data_rebuild_cgraph_edges::clone): Likewise. (pass_data_remove_cgraph_callee_edges::clone): Likewise. * context.c (gcc::context::context): Likewise. * cprop.c (pass_rtl_cprop::clone): Likewise. * domwalk.c (dom_walker::walk): Likewise. * ipa-inline-analysis.c (pass_inline_parameters::clone): Likewise. * ipa-pure-const.c (pass_local_pure_const::clone): Likewise. * mode-switching.c (pass_mode_switching::clone): Likewise. * passes.c (opt_pass::opt_pass): Likewise. (pass_manager::pass_manager): Likewise. * predict.c (pass_strip_predict_hints::clone): Likewise. * recog.c (pass_data pass_data_peephole2::clone): Likewise. (pass_split_all_insns::clone): Likewise. * stor-layout.c (bit_field_mode_iterator::bit_field_mode_iterator): Likewise. (bit_field_mode_iterator::next_mode): Likewise. (bit_field_mode_iterator::prefer_smaller_modes): Likewise. * tree-cfg.c (pass_split_crit_edges::clone): Likewise. * tree-cfgcleanup.c (pass_merge_phi::clone): Likewise. * tree-complex.c (pass_lower_complex::clone): Likewise. * tree-eh.c (pass_cleanup_eh::clone): Likewise. * tree-object-size.c (pass_object_sizes::clone): Likewise. * tree-optimize.c (pass_fixup_cfg::clone): Likewise. * tree-ssa-ccp.c (pass_data_ccp::clone): Likewise. (pass_fold_builtins::clone): Likewise. * tree-ssa-copy.c (pass_data_copy_prop::clone): Likewise. * tree-ssa-copyrename.c (pass_rename_ssa_copies::clone): Likewise. * tree-ssa-dce.c (pass_dce::clone, pass_dce_loop::clone): Likewise. (pass_cd_dce::clone): Likewise. * tree-ssa-dom.c (pass_dominator::clone): Likewise. (pass_phi_only_cprop::clone): Likewise. * tree-ssa-dse.c (pass_dse::clone): Likewise. * tree-ssa-forwprop.c (pass_forwprop::clone): Likewise. * tree-ssa-loop.c (pass_lim::clone): Likewise. * tree-ssa-phiopt.c (pass_phiopt::clone): Likewise. * tree-ssa-pre.c (pass_fre::clone): Likewise. * tree-ssa-reassoc.c (pass_reassoc::clone): Likewise. * tree-ssa-uninit.c (pass_late_warn_uninitialized::clone): Likewise. * tree-tailcall.c (pass_tail_recursion::clone): Likewise. * tree-vect-generic.c (pass_lower_vector_ssa::clone): Likewise. * tree-vrp.c (pass_vrp::clone): Likewise. * tsan.c (pass_tsan::clone): Likewise. From-SVN: r203046 --- gcc/hash-table.h | 22 +++++++++++----------- 1 file changed, 11 insertions(+), 11 deletions(-) (limited to 'gcc/hash-table.h') diff --git a/gcc/hash-table.h b/gcc/hash-table.h index 6d01188fe40..5f80efb6bf4 100644 --- a/gcc/hash-table.h +++ b/gcc/hash-table.h @@ -419,8 +419,8 @@ public: inline iterator &operator ++ (); inline bool operator != (const iterator &) const; private: - value_type **slot_; - value_type **limit_; + value_type **m_slot; + value_type **m_limit; }; private: @@ -959,7 +959,7 @@ template class Allocator> inline hash_table ::iterator::iterator () -: slot_ (NULL), limit_ (NULL) +: m_slot (NULL), m_limit (NULL) { } @@ -970,7 +970,7 @@ template ::iterator::iterator (value_type **slot, value_type **limit) -: slot_ (slot), limit_ (limit) +: m_slot (slot), m_limit (limit) { } @@ -981,7 +981,7 @@ template ::value_type & hash_table ::iterator::operator * () { - return **slot_; + return **m_slot; } /* Slide down the iterator slots until an active entry is found. */ @@ -991,14 +991,14 @@ template ::iterator::slide () { - for ( ; slot_ < limit_; ++slot_ ) + for ( ; m_slot < m_limit; ++m_slot ) { - value_type *x = *slot_; + value_type *x = *m_slot; if (x != HTAB_EMPTY_ENTRY && x != HTAB_DELETED_ENTRY) return; } - slot_ = NULL; - limit_ = NULL; + m_slot = NULL; + m_limit = NULL; } /* Bump the iterator. */ @@ -1008,7 +1008,7 @@ template ::iterator & hash_table ::iterator::operator ++ () { - ++slot_; + ++m_slot; slide (); return *this; } @@ -1021,7 +1021,7 @@ inline bool hash_table ::iterator:: operator != (const iterator &other) const { - return slot_ != other.slot_ || limit_ != other.limit_; + return m_slot != other.m_slot || m_limit != other.m_limit; } /* Hash table iterator producers. */ -- cgit v1.2.1