* cse.c (cse_insn): Missing cast added.
* loop.c (loop_reg_used_before_p): Ditto.
* gcse.c (Pre_gcse, hoist_code): Ditto.
* varasm.c (decode_rtx_const): Ditto.
* except.c (push_ehqueue): Ditto.
* cccp.c (index0): Ditto.
* toplev.c (main): Useless `&' removed before function name.
From-SVN: r31229
/* C Compatible Compiler Preprocessor (CCCP)
- Copyright (C) 1986, 87, 89, 92-98, 1999 Free Software Foundation, Inc.
+ Copyright (C) 1986, 87, 89, 92-99, 2000 Free Software Foundation, Inc.
Written by Paul Rubin, June 1986
Adapted to ANSI C, Richard Stallman, Jan 1987
for (;;) {
const char *q = index (p, c);
if (q)
- return q;
+ return (const U_CHAR *) q;
else {
size_t l = strlen (p);
if (l == n)
/* Common subexpression elimination for GNU compiler.
- Copyright (C) 1987, 88, 89, 92-7, 1998, 1999 Free Software Foundation, Inc.
+ Copyright (C) 1987, 88, 89, 92-99, 2000 Free Software Foundation, Inc.
This file is part of GNU CC.
int src_eqv_in_memory = 0;
unsigned src_eqv_hash = 0;
- struct set *sets = NULL_PTR;
+ struct set *sets = (struct set *) NULL_PTR;
this_insn = insn;
/* Implements exception handling.
- Copyright (C) 1989, 1992-1999 Free Software Foundation, Inc.
+ Copyright (C) 1989, 1992-1999, 2000 Free Software Foundation, Inc.
Contributed by Mike Stump <mrs@cygnus.com>.
This file is part of GNU CC.
push_ehqueue ()
{
struct eh_queue *q;
- q = xcalloc (1, sizeof (struct eh_queue));
+ q = (struct eh_queue *) xcalloc (1, sizeof (struct eh_queue));
q->next = ehqueue;
ehqueue = q;
}
/* Global common subexpression elimination/Partial redundancy elimination
and global constant/copy propagation for GNU compiler.
- Copyright (C) 1997, 1998, 1999 Free Software Foundation, Inc.
+ Copyright (C) 1997, 1998, 1999, 2000 Free Software Foundation, Inc.
This file is part of GNU CC.
/* Compute a mapping from expression number (`bitmap_index') to
hash table entry. */
- index_map = xcalloc (n_exprs, sizeof (struct expr *));
+ index_map = (struct expr **) xcalloc (n_exprs, sizeof (struct expr *));
for (i = 0; i < expr_hash_table_size; i++)
{
struct expr *expr;
/* Compute a mapping from expression number (`bitmap_index') to
hash table entry. */
- index_map = xcalloc (n_exprs, sizeof (struct expr *));
+ index_map = (struct expr **) xcalloc (n_exprs, sizeof (struct expr *));
for (i = 0; i < expr_hash_table_size; i++)
{
struct expr *expr;
fprintf (loop_dump_stream, "is giv of biv %d\n", bl2->regno);
/* Let this giv be discovered by the generic code. */
REG_IV_TYPE (bl->regno) = UNKNOWN_INDUCT;
- reg_biv_class[bl->regno] = NULL_PTR;
+ reg_biv_class[bl->regno] = (struct iv_class *) NULL_PTR;
/* We can get better optimization if we can move the giv setting
before the first giv use. */
if (dominator
/* Initialize the garbage-collector. */
init_ggc ();
ggc_add_root (&input_file_stack, 1, sizeof input_file_stack,
- &mark_file_stack);
+ mark_file_stack);
ggc_add_rtx_root (&stack_limit_rtx, 1);
/* Perform language-specific options intialization. */
case SYMBOL_REF:
/* Use the string's address, not the SYMBOL_REF's address,
for the sake of addresses of library routines. */
- value->un.addr.base = XSTR (value->un.addr.base, 0);
+ value->un.addr.base = (rtx) XSTR (value->un.addr.base, 0);
break;
case LABEL_REF: