aboutsummaryrefslogtreecommitdiff
path: root/gcc/cp/decl2.c
diff options
context:
space:
mode:
authorGabriel Dos Reis <gdr@integrable-solutions.net>2006-01-29 09:10:48 +0000
committerGabriel Dos Reis <gdr@gcc.gnu.org>2006-01-29 09:10:48 +0000
commit67f5655f98d39da5e593381ebcc35a1af9540ffa (patch)
tree7c783a02942f4003c69cd3138d64a9042883668f /gcc/cp/decl2.c
parent2990f854e5290b9b23b6f6aeea977d958d80eb58 (diff)
downloadgcc-67f5655f98d39da5e593381ebcc35a1af9540ffa.zip
gcc-67f5655f98d39da5e593381ebcc35a1af9540ffa.tar.gz
gcc-67f5655f98d39da5e593381ebcc35a1af9540ffa.tar.bz2
call.c (alloc_conversion): Use cast when converting from void *.
* call.c (alloc_conversion): Use cast when converting from void *. (alloc_conversions): Likewise. (add_candidate): Likewise. (print_z_candidates): Likewise. (add_warning): Likewise. * pt.c (retrieve_local_specialization): Likewise. (process_partial_specialization): Likewise. (mangle_class_name_for_template): Likewise. (tsubst_template_args): Likewise. * typeck2.c (pat_calc_hash): Likewise. (pat_compare): Likewise. (abstract_virtuals_error): Likewise. * class.c (method_name_cmp): Likewise. (resort_method_name_cmp): Likewise. (get_vfield_name): Likewise. * decl2.c (generate_ctor_and_dtor_functions_for_priority): Likewise. * lex.c (init_reswords): Likewise. * rtti.c (create_pseudo_type_info): Likewise. * search.c (dfs_lookup_base): Likewise. (dfs_dcast_hint_pre): Likewise. (dfs_dcast_hint_post): Likewise. * tree.c (hash_tree_cons): Likewise. * repo.c (extract_string): Likewise. (afgets): Likewise. * cp-objcp-common.c (decl_shadowed_for_var_lookup): Likewise. * g++spec.c (lang_specific_driver): Likewise. From-SVN: r110366
Diffstat (limited to 'gcc/cp/decl2.c')
-rw-r--r--gcc/cp/decl2.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/cp/decl2.c b/gcc/cp/decl2.c
index 637ac8c..be9f326 100644
--- a/gcc/cp/decl2.c
+++ b/gcc/cp/decl2.c
@@ -2683,7 +2683,7 @@ generate_ctor_or_dtor_function (bool constructor_p, int priority,
static int
generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data)
{
- location_t *locus = data;
+ location_t *locus = (location_t *) data;
int priority = (int) n->key;
priority_info pi = (priority_info) n->value;