diff options
author | Kaveh R. Ghazi <ghazi@caip.rutgers.edu> | 2003-07-19 14:47:15 +0000 |
---|---|---|
committer | Kaveh Ghazi <ghazi@gcc.gnu.org> | 2003-07-19 14:47:15 +0000 |
commit | 703ad42b4be14b9b1e84816dede360721361ed86 (patch) | |
tree | f3d03226f923b6c64639256ed34bd193427950a7 /gcc/function.c | |
parent | 308ca868d327f306ac4b87741ed828a56e524fd0 (diff) | |
download | gcc-703ad42b4be14b9b1e84816dede360721361ed86.zip gcc-703ad42b4be14b9b1e84816dede360721361ed86.tar.gz gcc-703ad42b4be14b9b1e84816dede360721361ed86.tar.bz2 |
alias.c [...]: Remove unnecessary casts.
* alias.c alloc-pool.c bitmap.c bitmap.h bt-load.c builtins.c
c-common.c c-decl.c c-incpath.c c-lex.c c-opts.c c-parse.in
c-pragma.c c-typeck.c calls.c cfg.c cfganal.c cfgloop.c cfgrtl.c
collect2.c combine.c conflict.c coverage.c cppexp.c cppfiles.c
cpphash.c cppinit.c cpplex.c cpplib.c cppmacro.c cppspec.c
cpptrad.c cse.c cselib.c dbxout.c defaults.h df.c dominance.c
dwarf2out.c dwarfout.c emit-rtl.c except.c expmed.c expr.c final.c
fix-header.c flow.c fold-const.c function.c gcc.c gccspec.c gcov.c
gcse.c genattr.c genattrtab.c genautomata.c genconditions.c
genemit.c genextract.c genoutput.c genrecog.c gensupport.c
ggc-page.c ggc-simple.c global.c graph.c haifa-sched.c hashtable.c
integrate.c jump.c langhooks.c lcm.c line-map.c local-alloc.c
loop.c mips-tdump.c mips-tfile.c mkdeps.c optabs.c params.c
postreload.c prefix.c print-tree.c protoize.c ra-build.c
ra-colorize.c ra-rewrite.c ra.c recog.c reg-stack.c regclass.c
regmove.c regrename.c reload.c reload1.c reorg.c resource.c
sbitmap.c sched-deps.c sched-rgn.c sched-vis.c sdbout.c
simplify-rtx.c ssa-ccp.c ssa.c stmt.c stor-layout.c timevar.c
tlink.c toplev.c tree-dump.c tree.c unroll.c unwind-dw2-fde.c
varasm.c varray.c vmsdbgout.c xcoffout.c: Remove unnecessary
casts.
From-SVN: r69587
Diffstat (limited to 'gcc/function.c')
-rw-r--r-- | gcc/function.c | 29 |
1 files changed, 14 insertions, 15 deletions
diff --git a/gcc/function.c b/gcc/function.c index 6124995..f8cc5a5 100644 --- a/gcc/function.c +++ b/gcc/function.c @@ -692,7 +692,7 @@ assign_stack_temp_for_type (enum machine_mode mode, HOST_WIDE_INT size, int keep if (best_p->size - rounded_size >= alignment) { - p = (struct temp_slot *) ggc_alloc (sizeof (struct temp_slot)); + p = ggc_alloc (sizeof (struct temp_slot)); p->in_use = p->addr_taken = 0; p->size = best_p->size - rounded_size; p->base_offset = best_p->base_offset + rounded_size; @@ -723,7 +723,7 @@ assign_stack_temp_for_type (enum machine_mode mode, HOST_WIDE_INT size, int keep { HOST_WIDE_INT frame_offset_old = frame_offset; - p = (struct temp_slot *) ggc_alloc (sizeof (struct temp_slot)); + p = ggc_alloc (sizeof (struct temp_slot)); /* We are passing an explicit alignment request to assign_stack_local. One side effect of that is assign_stack_local will not round SIZE @@ -1477,8 +1477,7 @@ schedule_fixup_var_refs (struct function *function, rtx reg, tree type, { struct var_refs_queue *temp; - temp - = (struct var_refs_queue *) ggc_alloc (sizeof (struct var_refs_queue)); + temp = ggc_alloc (sizeof (struct var_refs_queue)); temp->modified = reg; temp->promoted_mode = promoted_mode; temp->unsignedp = unsigned_p; @@ -1553,7 +1552,7 @@ find_fixup_replacement (struct fixup_replacement **replacements, rtx x) if (p == 0) { - p = (struct fixup_replacement *) xmalloc (sizeof (struct fixup_replacement)); + p = xmalloc (sizeof (struct fixup_replacement)); p->old = x; p->new = 0; p->next = *replacements; @@ -1627,7 +1626,7 @@ fixup_var_refs_insns_with_hash (htab_t ht, rtx var, enum machine_mode promoted_m rtx insn_list; tmp.key = var; - ime = (struct insns_for_mem_entry *) htab_find (ht, &tmp); + ime = htab_find (ht, &tmp); for (insn_list = ime->insns; insn_list != 0; insn_list = XEXP (insn_list, 1)) if (INSN_P (XEXP (insn_list, 0))) fixup_var_refs_insn (XEXP (insn_list, 0), var, promoted_mode, @@ -3295,7 +3294,7 @@ insns_for_mem_walk (rtx *r, void *data) { struct insns_for_mem_entry *ifme; tmp.key = *r; - ifme = (struct insns_for_mem_entry *) htab_find (ifmwi->ht, &tmp); + ifme = htab_find (ifmwi->ht, &tmp); /* If we have not already recorded this INSN, do so now. Since we process the INSNs in order, we know that if we have @@ -4281,7 +4280,7 @@ assign_parms (tree fndecl) orig_fnargs = fnargs; max_parm_reg = LAST_VIRTUAL_REGISTER + 1; - parm_reg_stack_loc = (rtx *) ggc_alloc_cleared (max_parm_reg * sizeof (rtx)); + parm_reg_stack_loc = ggc_alloc_cleared (max_parm_reg * sizeof (rtx)); if (SPLIT_COMPLEX_ARGS) fnargs = split_complex_args (fnargs); @@ -4944,10 +4943,10 @@ assign_parms (tree fndecl) but it's also rare and we need max_parm_reg to be precisely correct. */ max_parm_reg = regno + 1; - new = (rtx *) ggc_realloc (parm_reg_stack_loc, - max_parm_reg * sizeof (rtx)); - memset ((char *) (new + old_max_parm_reg), 0, - (max_parm_reg - old_max_parm_reg) * sizeof (rtx)); + new = ggc_realloc (parm_reg_stack_loc, + max_parm_reg * sizeof (rtx)); + memset (new + old_max_parm_reg, 0, + (max_parm_reg - old_max_parm_reg) * sizeof (rtx)); parm_reg_stack_loc = new; } @@ -5885,7 +5884,7 @@ identify_blocks (void) /* Fill the BLOCK_VECTOR with all of the BLOCKs in this function, in depth-first order. */ block_vector = get_block_vector (block, &n_blocks); - block_stack = (tree *) xmalloc (n_blocks * sizeof (tree)); + block_stack = xmalloc (n_blocks * sizeof (tree)); last_block_vector = identify_blocks_1 (get_insns (), block_vector + 1, @@ -6189,7 +6188,7 @@ get_block_vector (tree block, int *n_blocks_p) tree *block_vector; *n_blocks_p = all_blocks (block, NULL); - block_vector = (tree *) xmalloc (*n_blocks_p * sizeof (tree)); + block_vector = xmalloc (*n_blocks_p * sizeof (tree)); all_blocks (block, block_vector); return block_vector; @@ -6252,7 +6251,7 @@ debug_find_var_in_block_tree (tree var, tree block) static void prepare_function_start (void) { - cfun = (struct function *) ggc_alloc_cleared (sizeof (struct function)); + cfun = ggc_alloc_cleared (sizeof (struct function)); init_stmt_for_function (); init_eh_for_function (); |