aboutsummaryrefslogtreecommitdiff
path: root/gcc/ra.h
diff options
context:
space:
mode:
authorKaveh R. Ghazi <ghazi@caip.rutgers.edu>2008-07-16 17:49:20 +0000
committerKaveh Ghazi <ghazi@gcc.gnu.org>2008-07-16 17:49:20 +0000
commitd858f359363662cf2555f4d9c259d80aaecae031 (patch)
treef4483861429c61796d6c351bc9c5766c15c43137 /gcc/ra.h
parent1bc39d2fcdee654ea1904b9e50d74b3ff7b69dbc (diff)
downloadgcc-d858f359363662cf2555f4d9c259d80aaecae031.zip
gcc-d858f359363662cf2555f4d9c259d80aaecae031.tar.gz
gcc-d858f359363662cf2555f4d9c259d80aaecae031.tar.bz2
cfg.c (dump_reg_info): Avoid C++ keywords.
* cfg.c (dump_reg_info): Avoid C++ keywords. * dwarf2asm.c (dw2_force_const_mem, dw2_asm_output_encoded_addr_rtx): Likewise. * except.c (gen_eh_region, add_action_record, output_ttype): Likewise. * expmed.c (expand_shift): Likewise. * global.c (find_reg): Likewise. * graph.c (draw_edge): Likewise. * local-alloc.c (reg_meets_class_p, find_free_reg): Likewise. * optabs.c (expand_binop, expand_twoval_unop, expand_twoval_binop, widen_clz, widen_bswap, expand_parity, expand_unop, emit_cmp_and_jump_insn_1): Likewise. * postreload.c (reload_cse_simplify_operands): Likewise. * ra.h (add_neighbor): Likewise. * reg-stack.c (remove_regno_note, change_stack): Likewise. * regclass.c (memory_move_secondary_cost, dump_regclass, regclass, record_reg_classes, copy_cost, record_address_regs, invalid_mode_change_p): Likewise. * regrename.c (regrename_optimize, scan_rtx_reg, dump_def_use_chain, find_oldest_value_reg, replace_oldest_value_reg, copyprop_hardreg_forward_1): Likewise. From-SVN: r137893
Diffstat (limited to 'gcc/ra.h')
-rw-r--r--gcc/ra.h8
1 files changed, 4 insertions, 4 deletions
diff --git a/gcc/ra.h b/gcc/ra.h
index bd41952..4fe80c8 100644
--- a/gcc/ra.h
+++ b/gcc/ra.h
@@ -144,10 +144,10 @@ add_neighbor (int alloc_no, int neighbor)
if (adjlist == NULL || adjlist->index == ADJACENCY_VEC_LENGTH)
{
- adjacency_t *new = (adjacency_t *) pool_alloc (adjacency_pool);
- new->index = 0;
- new->next = adjlist;
- adjlist = new;
+ adjacency_t *new_adj = (adjacency_t *) pool_alloc (adjacency_pool);
+ new_adj->index = 0;
+ new_adj->next = adjlist;
+ adjlist = new_adj;
adjacency[alloc_no] = adjlist;
}