Skip to content

R
riscv-gcc-1
Commit 4682ae04 by Andreas Jaeger Committed by Andreas Jaeger
Options

alloc-pool.c: Convert to ISO C90 prototypes. 


	* alloc-pool.c: Convert to ISO C90 prototypes.
	* alloc-pool.h: Likewise.
	* alias.c: Likewise.
	* attribs.c: Likewise.
	* bb-reorder.c: Likewise.
	* bitmap.h: Likewise.
	* bitmap.c: Likewise.
	* builtins.c: Likewise.

	* tree.h: Convert prototypes of attribs.c to ISO C90.
	* basic-block.h: Convert prototypes of bb-reorder.c to ISO C90.
	* rtl.h: Convert prototypes of alias.c and builtins.c to ISO C90.
	* expr.h: Convert prototypes of builtins.c to ISO C90.

From-SVN: r67975
parent cbdb4ba2
Showing with 148 additions and 219 deletions
gcc/ChangeLog
2003-06-15 Andreas Jaeger <aj@suse.de>
* alloc-pool.c: Convert to ISO C90 prototypes.
* alloc-pool.h: Likewise.
* alias.c: Likewise.
* attribs.c: Likewise.
* bb-reorder.c: Likewise.
* bitmap.h: Likewise.
* bitmap.c: Likewise.
* builtins.c: Likewise.
* tree.h: Convert prototypes of attribs.c to ISO C90.
* basic-block.h: Convert prototypes of bb-reorder.c to ISO C90.
* rtl.h: Convert prototypes of alias.c and builtins.c to ISO C90.
* expr.h: Convert prototypes of builtins.c to ISO C90.
2003-06-15 Roger Sayle <roger@eyesopen.com>
* config/i386/i386.md (expsf2, expdf2, expxf2): New patterns to
......
gcc/alloc-pool.c
......@@ -30,7 +30,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
special abort includes one or both. toplev.h gets too few files,
system.h gets too many. */
extern void fancy_abort PARAMS ((const char *, int, const char *))
extern void fancy_abort (const char *, int, const char *)
ATTRIBUTE_NORETURN;
#define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
......@@ -80,10 +80,7 @@ static ALLOC_POOL_ID_TYPE last_id;
allocate. */
alloc_pool
create_alloc_pool (name, size, num)
const char *name;
size_t size;
size_t num;
create_alloc_pool (const char *name, size_t size, size_t num)
{
alloc_pool pool;
size_t pool_size, header_size;
......@@ -143,8 +140,7 @@ create_alloc_pool (name, size, num)
/* Free all memory allocated for the given memory pool. */
void
free_alloc_pool (pool)
alloc_pool pool;
free_alloc_pool (alloc_pool pool)
{
alloc_pool_list block, next_block;
......@@ -166,8 +162,7 @@ free_alloc_pool (pool)
/* Allocates one element from the pool specified. */
void *
pool_alloc (pool)
alloc_pool pool;
pool_alloc (alloc_pool pool)
{
alloc_pool_list header;
char *block;
......@@ -225,9 +220,7 @@ pool_alloc (pool)
/* Puts PTR back on POOL's free list. */
void
pool_free (pool, ptr)
alloc_pool pool;
void *ptr;
pool_free (alloc_pool pool, void *ptr)
{
alloc_pool_list header;
......
gcc/alloc-pool.h
......@@ -47,8 +47,8 @@ typedef struct alloc_pool_def
}
*alloc_pool;
extern alloc_pool create_alloc_pool PARAMS ((const char *, size_t, size_t));
extern void free_alloc_pool PARAMS ((alloc_pool));
extern void *pool_alloc PARAMS ((alloc_pool));
extern void pool_free PARAMS ((alloc_pool, void *));
extern alloc_pool create_alloc_pool (const char *, size_t, size_t);
extern void free_alloc_pool (alloc_pool);
extern void *pool_alloc (alloc_pool);
extern void pool_free (alloc_pool, void *);
#endif
gcc/attribs.c
/* Functions dealing with attribute handling, used by most front ends.
Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001,
2002 Free Software Foundation, Inc.
2002, 2003 Free Software Foundation, Inc.
This file is part of GCC.
......@@ -35,7 +35,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
#include "target.h"
#include "langhooks.h"
static void init_attributes PARAMS ((void));
static void init_attributes (void);
/* Table of the tables of attributes (common, language, format, machine)
searched. */
......@@ -53,7 +53,7 @@ static const struct attribute_spec empty_attribute_table[] =
if --enable-checking. */
static void
init_attributes ()
init_attributes (void)
{
size_t i;
......@@ -141,9 +141,7 @@ init_attributes ()
and ATTR_FLAG_BUILT_IN set. */
tree
decl_attributes (node, attributes, flags)
tree *node, attributes;
int flags;
decl_attributes (tree *node, tree attributes, int flags)
{
tree a;
tree returned_attrs = NULL_TREE;
......@@ -317,9 +315,7 @@ decl_attributes (node, attributes, flags)
resulting attributes together the way decl_attributes expects them. */
void
split_specs_attrs (specs_attrs, declspecs, prefix_attributes)
tree specs_attrs;
tree *declspecs, *prefix_attributes;
split_specs_attrs (tree specs_attrs, tree *declspecs, tree *prefix_attributes)
{
tree t, s, a, next, specs, attrs;
......@@ -394,8 +390,7 @@ split_specs_attrs (specs_attrs, declspecs, prefix_attributes)
A warning is issued for every ignored attribute. */
tree
strip_attrs (specs_attrs)
tree specs_attrs;
strip_attrs (tree specs_attrs)
{
tree specs, attrs;
......@@ -410,4 +405,3 @@ strip_attrs (specs_attrs)
return specs;
}
gcc/basic-block.h
......@@ -542,7 +542,6 @@ extern bool probably_never_executed_bb_p PARAMS ((basic_block));
/* In flow.c */
extern void init_flow PARAMS ((void));
extern void reorder_basic_blocks PARAMS ((void));
extern void dump_bb PARAMS ((basic_block, FILE *));
extern void debug_bb PARAMS ((basic_block));
extern basic_block debug_bb_n PARAMS ((int));
......@@ -619,6 +618,9 @@ extern rtx hoist_insn_to_edge PARAMS ((rtx, edge, rtx, rtx));
extern bool inside_basic_block_p PARAMS ((rtx));
extern bool control_flow_insn_p PARAMS ((rtx));
/* In bb-reorder.c */
extern void reorder_basic_blocks (void);
/* In dominance.c */
enum cdi_direction
......
gcc/bb-reorder.c
......@@ -141,29 +141,24 @@ int max_entry_frequency;
gcov_type max_entry_count;
/* Local function prototypes. */
static void find_traces PARAMS ((int *, struct trace *));
static basic_block rotate_loop PARAMS ((edge, struct trace *, int));
static void mark_bb_visited PARAMS ((basic_block, int));
static void find_traces_1_round PARAMS ((int, int, gcov_type,
struct trace *, int *, int,
fibheap_t *));
static basic_block copy_bb PARAMS ((basic_block, edge,
basic_block, int));
static fibheapkey_t bb_to_key PARAMS ((basic_block));
static bool better_edge_p PARAMS ((basic_block, edge, int, int,
int, int));
static void connect_traces PARAMS ((int, struct trace *));
static bool copy_bb_p PARAMS ((basic_block, int));
static int get_uncond_jump_length PARAMS ((void));
static void find_traces (int *, struct trace *);
static basic_block rotate_loop (edge, struct trace *, int);
static void mark_bb_visited (basic_block, int);
static void find_traces_1_round (int, int, gcov_type, struct trace *, int *,
int, fibheap_t *);
static basic_block copy_bb (basic_block, edge, basic_block, int);
static fibheapkey_t bb_to_key (basic_block);
static bool better_edge_p (basic_block, edge, int, int, int, int);
static void connect_traces (int, struct trace *);
static bool copy_bb_p (basic_block, int);
static int get_uncond_jump_length (void);
/* Find the traces for Software Trace Cache. Chain each trace through
RBI()->next. Store the number of traces to N_TRACES and description of
traces to TRACES. */
static void
find_traces (n_traces, traces)
int *n_traces;
struct trace *traces;
find_traces (int *n_traces, struct trace *traces)
{
int i;
edge e;
......@@ -222,10 +217,7 @@ find_traces (n_traces, traces)
(with sequential number TRACE_N). */
static basic_block
rotate_loop (back_edge, trace, trace_n)
edge back_edge;
struct trace *trace;
int trace_n;
rotate_loop (edge back_edge, struct trace *trace, int trace_n)
{
basic_block bb;
......@@ -339,9 +331,7 @@ rotate_loop (back_edge, trace, trace_n)
/* This function marks BB that it was visited in trace number TRACE. */
static void
mark_bb_visited (bb, trace)
basic_block bb;
int trace;
mark_bb_visited (basic_block bb, int trace)
{
RBI (bb)->visited = trace;
if (bbd[bb->index].heap)
......@@ -361,15 +351,9 @@ mark_bb_visited (bb, trace)
*HEAP and stores starting points for the next round into new *HEAP. */
static void
find_traces_1_round (branch_th, exec_th, count_th, traces, n_traces, round,
heap)
int branch_th;
int exec_th;
gcov_type count_th;
struct trace *traces;
int *n_traces;
int round;
fibheap_t *heap;
find_traces_1_round (int branch_th, int exec_th, gcov_type count_th,
struct trace *traces, int *n_traces, int round,
fibheap_t *heap)
{
/* Heap for discarded basic blocks which are possible starting points for
the next round. */
......@@ -664,11 +648,7 @@ find_traces_1_round (branch_th, exec_th, count_th, traces, n_traces, round,
(TRACE is a number of trace which OLD_BB is duplicated to). */
static basic_block
copy_bb (old_bb, e, bb, trace)
basic_block old_bb;
edge e;
basic_block bb;
int trace;
copy_bb (basic_block old_bb, edge e, basic_block bb, int trace)
{
basic_block new_bb;
......@@ -716,8 +696,7 @@ copy_bb (old_bb, e, bb, trace)
/* Compute and return the key (for the heap) of the basic block BB. */
static fibheapkey_t
bb_to_key (bb)
basic_block bb;
bb_to_key (basic_block bb)
{
edge e;
......@@ -755,13 +734,8 @@ bb_to_key (bb)
BEST_PROB; similarly for frequency. */
static bool
better_edge_p (bb, e, prob, freq, best_prob, best_freq)
basic_block bb;
edge e;
int prob;
int freq;
int best_prob;
int best_freq;
better_edge_p (basic_block bb, edge e, int prob, int freq, int best_prob,
int best_freq)
{
bool is_better_edge;
......@@ -798,9 +772,7 @@ better_edge_p (bb, e, prob, freq, best_prob, best_freq)
/* Connect traces in array TRACES, N_TRACES is the count of traces. */
static void
connect_traces (n_traces, traces)
int n_traces;
struct trace *traces;
connect_traces (int n_traces, struct trace *traces)
{
int i;
bool *connected;
......@@ -1022,9 +994,7 @@ connect_traces (n_traces, traces)
when code size is allowed to grow by duplication. */
static bool
copy_bb_p (bb, code_may_grow)
basic_block bb;
int code_may_grow;
copy_bb_p (basic_block bb, int code_may_grow)
{
int size = 0;
int max_size = uncond_jump_length;
......@@ -1063,7 +1033,7 @@ copy_bb_p (bb, code_may_grow)
/* Return the length of unconditional jump instruction. */
static int
get_uncond_jump_length ()
get_uncond_jump_length (void)
{
rtx label, jump;
int length;
......@@ -1081,7 +1051,7 @@ get_uncond_jump_length ()
/* Reorder basic blocks. The main entry point to this file. */
void
reorder_basic_blocks ()
reorder_basic_blocks (void)
{
int n_traces;
int i;
......@@ -1100,7 +1070,7 @@ reorder_basic_blocks ()
/* We are estimating the lenght of uncond jump insn only once since the code
for getting the insn lenght always returns the minimal length now. */
if (uncond_jump_length == 0)
if (uncond_jump_length == 0)
uncond_jump_length = get_uncond_jump_length ();
/* We need to know some information for each basic block. */
......
gcc/bitmap.c
......@@ -46,18 +46,16 @@ bitmap_element bitmap_zero_bits; /* An element of all zero bits. */
static bitmap_element *bitmap_free; /* Freelist of bitmap elements. */
static GTY((deletable (""))) bitmap_element *bitmap_ggc_free;
static void bitmap_elem_to_freelist PARAMS ((bitmap, bitmap_element *));
static void bitmap_element_free PARAMS ((bitmap, bitmap_element *));
static bitmap_element *bitmap_element_allocate PARAMS ((bitmap));
static int bitmap_element_zerop PARAMS ((bitmap_element *));
static void bitmap_element_link PARAMS ((bitmap, bitmap_element *));
static bitmap_element *bitmap_find_bit PARAMS ((bitmap, unsigned int));
static void bitmap_elem_to_freelist (bitmap, bitmap_element *);
static void bitmap_element_free (bitmap, bitmap_element *);
static bitmap_element *bitmap_element_allocate (bitmap);
static int bitmap_element_zerop (bitmap_element *);
static void bitmap_element_link (bitmap, bitmap_element *);
static bitmap_element *bitmap_find_bit (bitmap, unsigned int);
/* Add ELEM to the appropriate freelist. */
static INLINE void
bitmap_elem_to_freelist (head, elt)
bitmap head;
bitmap_element *elt;
bitmap_elem_to_freelist (bitmap head, bitmap_element *elt)
{
if (head->using_obstack)
{
......@@ -75,9 +73,7 @@ bitmap_elem_to_freelist (head, elt)
bitmap_obstack, "free" actually means "put onto the freelist". */
static INLINE void
bitmap_element_free (head, elt)
bitmap head;
bitmap_element *elt;
bitmap_element_free (bitmap head, bitmap_element *elt)
{
bitmap_element *next = elt->next;
bitmap_element *prev = elt->prev;
......@@ -105,8 +101,7 @@ bitmap_element_free (head, elt)
/* Allocate a bitmap element. The bits are cleared, but nothing else is. */
static INLINE bitmap_element *
bitmap_element_allocate (head)
bitmap head;
bitmap_element_allocate (bitmap head)
{
bitmap_element *element;
......@@ -159,7 +154,7 @@ bitmap_element_allocate (head)
/* Release any memory allocated by bitmaps. */
void
bitmap_release_memory ()
bitmap_release_memory (void)
{
bitmap_free = 0;
if (bitmap_obstack_init)
......@@ -172,8 +167,7 @@ bitmap_release_memory ()
/* Return nonzero if all bits in an element are zero. */
static INLINE int
bitmap_element_zerop (element)
bitmap_element *element;
bitmap_element_zerop (bitmap_element *element)
{
#if BITMAP_ELEMENT_WORDS == 2
return (element->bits[0] | element->bits[1]) == 0;
......@@ -191,9 +185,7 @@ bitmap_element_zerop (element)
/* Link the bitmap element into the current bitmap linked list. */
static INLINE void
bitmap_element_link (head, element)
bitmap head;
bitmap_element *element;
bitmap_element_link (bitmap head, bitmap_element *element)
{
unsigned int indx = element->indx;
bitmap_element *ptr;
......@@ -248,8 +240,7 @@ bitmap_element_link (head, element)
/* Clear a bitmap by freeing the linked list. */
INLINE void
bitmap_clear (head)
bitmap head;
bitmap_clear (bitmap head)
{
bitmap_element *element, *next;
......@@ -265,9 +256,7 @@ bitmap_clear (head)
/* Copy a bitmap to another bitmap. */
void
bitmap_copy (to, from)
bitmap to;
bitmap from;
bitmap_copy (bitmap to, bitmap from)
{
bitmap_element *from_ptr, *to_ptr = 0;
#if BITMAP_ELEMENT_WORDS != 2
......@@ -316,9 +305,7 @@ bitmap_copy (to, from)
faster. */
static INLINE bitmap_element *
bitmap_find_bit (head, bit)
bitmap head;
unsigned int bit;
bitmap_find_bit (bitmap head, unsigned int bit)
{
bitmap_element *element;
unsigned int indx = bit / BITMAP_ELEMENT_ALL_BITS;
......@@ -352,9 +339,7 @@ bitmap_find_bit (head, bit)
/* Clear a single bit in a bitmap. */
void
bitmap_clear_bit (head, bit)
bitmap head;
int bit;
bitmap_clear_bit (bitmap head, int bit)
{
bitmap_element *ptr = bitmap_find_bit (head, bit);
......@@ -373,9 +358,7 @@ bitmap_clear_bit (head, bit)
/* Set a single bit in a bitmap. */
void
bitmap_set_bit (head, bit)
bitmap head;
int bit;
bitmap_set_bit (bitmap head, int bit)
{
bitmap_element *ptr = bitmap_find_bit (head, bit);
unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
......@@ -396,9 +379,7 @@ bitmap_set_bit (head, bit)
/* Return whether a bit is set within a bitmap. */
int
bitmap_bit_p (head, bit)
bitmap head;
int bit;
bitmap_bit_p (bitmap head, int bit)
{
bitmap_element *ptr;
unsigned bit_num;
......@@ -418,8 +399,7 @@ bitmap_bit_p (head, bit)
if the bitmap is empty. */
int
bitmap_first_set_bit (a)
bitmap a;
bitmap_first_set_bit (bitmap a)
{
bitmap_element *ptr = a->first;
BITMAP_WORD word;
......@@ -471,8 +451,7 @@ bitmap_first_set_bit (a)
if the bitmap is empty. */
int
bitmap_last_set_bit (a)
bitmap a;
bitmap_last_set_bit (bitmap a)
{
bitmap_element *ptr = a->first;
BITMAP_WORD word;
......@@ -524,11 +503,8 @@ bitmap_last_set_bit (a)
a specific bit manipulation. Return true if TO changes. */
int
bitmap_operation (to, from1, from2, operation)
bitmap to;
bitmap from1;
bitmap from2;
enum bitmap_bits operation;
bitmap_operation (bitmap to, bitmap from1, bitmap from2,
enum bitmap_bits operation)
{
#define HIGHEST_INDEX (unsigned int) ~0
......@@ -687,14 +663,12 @@ bitmap_operation (to, from1, from2, operation)
/* Return true if two bitmaps are identical. */
int
bitmap_equal_p (a, b)
bitmap a;
bitmap b;
bitmap_equal_p (bitmap a, bitmap b)
{
bitmap_head c;
int ret;
memset (&c, 0, sizeof (c));
memset (&c, 0, sizeof (c));
ret = ! bitmap_operation (&c, a, b, BITMAP_XOR);
bitmap_clear (&c);
......@@ -705,10 +679,7 @@ bitmap_equal_p (a, b)
bitmap FROM2. */
void
bitmap_ior_and_compl (to, from1, from2)
bitmap to;
bitmap from1;
bitmap from2;
bitmap_ior_and_compl (bitmap to, bitmap from1, bitmap from2)
{
bitmap_head tmp;
......@@ -721,11 +692,7 @@ bitmap_ior_and_compl (to, from1, from2)
}
int
bitmap_union_of_diff (dst, a, b, c)
bitmap dst;
bitmap a;
bitmap b;
bitmap c;
bitmap_union_of_diff (bitmap dst, bitmap a, bitmap b, bitmap c)
{
bitmap_head tmp;
int changed;
......@@ -743,13 +710,11 @@ bitmap_union_of_diff (dst, a, b, c)
/* Initialize a bitmap header. */
bitmap
bitmap_initialize (head, using_obstack)
bitmap head;
int using_obstack;
bitmap_initialize (bitmap head, int using_obstack)
{
if (head == NULL && ! using_obstack)
head = ggc_alloc (sizeof (*head));
head->first = head->current = 0;
head->using_obstack = using_obstack;
......@@ -759,9 +724,7 @@ bitmap_initialize (head, using_obstack)
/* Debugging function to print out the contents of a bitmap. */
void
debug_bitmap_file (file, head)
FILE *file;
bitmap head;
debug_bitmap_file (FILE *file, bitmap head)
{
bitmap_element *ptr;
......@@ -806,8 +769,7 @@ debug_bitmap_file (file, head)
of a bitmap. */
void
debug_bitmap (head)
bitmap head;
debug_bitmap (bitmap head)
{
debug_bitmap_file (stdout, head);
}
......@@ -816,11 +778,7 @@ debug_bitmap (head)
it does not print anything but the bits. */
void
bitmap_print (file, head, prefix, suffix)
FILE *file;
bitmap head;
const char *prefix;
const char *suffix;
bitmap_print (FILE *file, bitmap head, const char *prefix, const char *suffix)
{
const char *comma = "";
int i;
......
gcc/bitmap.h
......@@ -79,53 +79,52 @@ enum bitmap_bits {
extern bitmap_element bitmap_zero_bits; /* Zero bitmap element */
/* Clear a bitmap by freeing up the linked list. */
extern void bitmap_clear PARAMS ((bitmap));
extern void bitmap_clear (bitmap);
/* Copy a bitmap to another bitmap. */
extern void bitmap_copy PARAMS ((bitmap, bitmap));
extern void bitmap_copy (bitmap, bitmap);
/* True if two bitmaps are identical. */
extern int bitmap_equal_p PARAMS ((bitmap, bitmap));
extern int bitmap_equal_p (bitmap, bitmap);
/* Perform an operation on two bitmaps, yielding a third. */
extern int bitmap_operation PARAMS ((bitmap, bitmap, bitmap, enum bitmap_bits));
extern int bitmap_operation (bitmap, bitmap, bitmap, enum bitmap_bits);
/* `or' into one bitmap the `and' of a second bitmap witih the complement
of a third. */
extern void bitmap_ior_and_compl PARAMS ((bitmap, bitmap, bitmap));
extern void bitmap_ior_and_compl (bitmap, bitmap, bitmap);
/* Clear a single register in a register set. */
extern void bitmap_clear_bit PARAMS ((bitmap, int));
extern void bitmap_clear_bit (bitmap, int);
/* Set a single register in a register set. */
extern void bitmap_set_bit PARAMS ((bitmap, int));
extern void bitmap_set_bit (bitmap, int);
/* Return true if a register is set in a register set. */
extern int bitmap_bit_p PARAMS ((bitmap, int));
extern int bitmap_bit_p (bitmap, int);
/* Debug functions to print a bitmap linked list. */
extern void debug_bitmap PARAMS ((bitmap));
extern void debug_bitmap_file PARAMS ((FILE *, bitmap));
extern void debug_bitmap (bitmap);
extern void debug_bitmap_file (FILE *, bitmap);
/* Print a bitmap */
extern void bitmap_print PARAMS ((FILE *, bitmap, const char *, const char *));
extern void bitmap_print (FILE *, bitmap, const char *, const char *);
/* Initialize a bitmap header. If HEAD is NULL, a new header will be
allocated. USING_OBSTACK indicates how elements should be allocated. */
extern bitmap bitmap_initialize PARAMS ((bitmap head,
int using_obstack));
extern bitmap bitmap_initialize (bitmap head, int using_obstack);
/* Release all memory used by the bitmap obstack. */
extern void bitmap_release_memory PARAMS ((void));
extern void bitmap_release_memory (void);
/* A few compatibility/functions macros for compatibility with sbitmaps */
#define dump_bitmap(file, bitmap) bitmap_print (file, bitmap, "", "\n")
#define bitmap_zero(a) bitmap_clear (a)
#define bitmap_a_or_b(a,b,c) bitmap_operation (a, b, c, BITMAP_IOR)
#define bitmap_a_and_b(a,b,c) bitmap_operation (a, b, c, BITMAP_AND)
extern int bitmap_union_of_diff PARAMS((bitmap, bitmap, bitmap, bitmap));
extern int bitmap_first_set_bit PARAMS((bitmap));
extern int bitmap_last_set_bit PARAMS((bitmap));
extern int bitmap_union_of_diff (bitmap, bitmap, bitmap, bitmap);
extern int bitmap_first_set_bit (bitmap);
extern int bitmap_last_set_bit (bitmap);
/* Allocate a bitmap with oballoc. */
#define BITMAP_OBSTACK_ALLOC(OBSTACK) \
......@@ -249,7 +248,7 @@ do { \
ptr2_ = ptr2_->next; \
\
tmp2_ = ((ptr2_ != 0 && ptr2_->indx == ptr1_->indx) \
? ptr2_ : &bitmap_zero_bits); \
? ptr2_ : &bitmap_zero_bits); \
\
for (; word_num_ < BITMAP_ELEMENT_WORDS; word_num_++) \
{ \
......
gcc/expr.h
......@@ -352,25 +352,23 @@ extern rtx get_condition PARAMS ((rtx, rtx *));
extern rtx gen_cond_trap PARAMS ((enum rtx_code, rtx, rtx, rtx));
/* Functions from builtins.c: */
extern rtx expand_builtin PARAMS ((tree, rtx, rtx, enum machine_mode, int));
extern void std_expand_builtin_va_start PARAMS ((tree, rtx));
extern rtx std_expand_builtin_va_arg PARAMS ((tree, tree));
extern rtx expand_builtin_va_arg PARAMS ((tree, tree));
extern void default_init_builtins PARAMS ((void));
extern rtx default_expand_builtin PARAMS ((tree, rtx, rtx,
enum machine_mode, int));
extern void expand_builtin_setjmp_setup PARAMS ((rtx, rtx));
extern void expand_builtin_setjmp_receiver PARAMS ((rtx));
extern void expand_builtin_longjmp PARAMS ((rtx, rtx));
extern rtx expand_builtin_saveregs PARAMS ((void));
extern void expand_builtin_trap PARAMS ((void));
extern HOST_WIDE_INT get_varargs_alias_set PARAMS ((void));
extern HOST_WIDE_INT get_frame_alias_set PARAMS ((void));
extern void record_base_value PARAMS ((unsigned int, rtx, int));
extern void record_alias_subset PARAMS ((HOST_WIDE_INT,
HOST_WIDE_INT));
extern HOST_WIDE_INT new_alias_set PARAMS ((void));
extern int can_address_p PARAMS ((tree));
extern rtx expand_builtin (tree, rtx, rtx, enum machine_mode, int);
extern void std_expand_builtin_va_start (tree, rtx);
extern rtx std_expand_builtin_va_arg (tree, tree);
extern rtx expand_builtin_va_arg (tree, tree);
extern void default_init_builtins (void);
extern rtx default_expand_builtin (tree, rtx, rtx, enum machine_mode, int);
extern void expand_builtin_setjmp_setup (rtx, rtx);
extern void expand_builtin_setjmp_receiver (rtx);
extern void expand_builtin_longjmp (rtx, rtx);
extern rtx expand_builtin_saveregs (void);
extern void expand_builtin_trap (void);
extern HOST_WIDE_INT get_varargs_alias_set (void);
extern HOST_WIDE_INT get_frame_alias_set (void);
extern void record_base_value (unsigned int, rtx, int);
extern void record_alias_subset (HOST_WIDE_INT, HOST_WIDE_INT);
extern HOST_WIDE_INT new_alias_set (void);
extern int can_address_p (tree);
/* Functions from expr.c: */
......
gcc/rtl.h
......@@ -1406,8 +1406,8 @@ extern int ceil_log2 PARAMS ((unsigned HOST_WIDE_INT));
#define plus_constant(X, C) plus_constant_wide ((X), (HOST_WIDE_INT) (C))
/* In builtins.c */
extern rtx expand_builtin_expect_jump PARAMS ((tree, rtx, rtx));
extern void purge_builtin_constant_p PARAMS ((void));
extern rtx expand_builtin_expect_jump (tree, rtx, rtx);
extern void purge_builtin_constant_p (void);
/* In explow.c */
extern void set_stack_check_libfunc PARAMS ((rtx));
......@@ -1558,8 +1558,8 @@ extern rtx prev_cc0_setter PARAMS ((rtx));
/* In cfglayout.c */
extern tree choose_inner_scope PARAMS ((tree, tree));
extern int insn_line PARAMS ((rtx));
extern const char * insn_file PARAMS ((rtx));
extern int insn_line PARAMS ((rtx));
extern const char * insn_file PARAMS ((rtx));
extern int prologue_locator, epilogue_locator;
/* In jump.c */
......@@ -2320,23 +2320,22 @@ extern void fancy_abort PARAMS ((const char *, int, const char *))
#define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
/* In alias.c */
extern void clear_reg_alias_info PARAMS ((rtx));
extern rtx canon_rtx PARAMS ((rtx));
extern int true_dependence PARAMS ((rtx, enum machine_mode, rtx,
int (*)(rtx, int)));
extern rtx get_addr PARAMS ((rtx));
extern int canon_true_dependence PARAMS ((rtx, enum machine_mode, rtx,
rtx, int (*)(rtx, int)));
extern int read_dependence PARAMS ((rtx, rtx));
extern int anti_dependence PARAMS ((rtx, rtx));
extern int output_dependence PARAMS ((rtx, rtx));
extern void mark_constant_function PARAMS ((void));
extern void init_alias_once PARAMS ((void));
extern void init_alias_analysis PARAMS ((void));
extern void end_alias_analysis PARAMS ((void));
extern rtx addr_side_effect_eval PARAMS ((rtx, int, int));
extern bool memory_modified_in_insn_p PARAMS ((rtx, rtx));
extern rtx find_base_term PARAMS ((rtx));
extern void clear_reg_alias_info (rtx);
extern rtx canon_rtx (rtx);
extern int true_dependence (rtx, enum machine_mode, rtx, int (*)(rtx, int));
extern rtx get_addr (rtx);
extern int canon_true_dependence (rtx, enum machine_mode, rtx, rtx,
int (*)(rtx, int));
extern int read_dependence (rtx, rtx);
extern int anti_dependence (rtx, rtx);
extern int output_dependence (rtx, rtx);
extern void mark_constant_function (void);
extern void init_alias_once (void);
extern void init_alias_analysis (void);
extern void end_alias_analysis (void);
extern rtx addr_side_effect_eval (rtx, int, int);
extern bool memory_modified_in_insn_p (rtx, rtx);
extern rtx find_base_term (rtx);
/* In sibcall.c */
typedef enum {
......
gcc/tree.h
......@@ -2199,11 +2199,11 @@ extern void default_register_cpp_builtins PARAMS ((struct cpp_reader *));
/* Split a list of declspecs and attributes into two. */
extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
extern void split_specs_attrs (tree, tree *, tree *);
/* Strip attributes from a list of combined specs and attrs. */
extern tree strip_attrs PARAMS ((tree));
extern tree strip_attrs (tree);
/* Return 1 if an attribute and its arguments are valid for a decl or type. */
......@@ -2892,7 +2892,7 @@ extern bool alloca_call_p PARAMS ((tree));
from tree.h. Depending on these flags, some attributes may be
returned to be applied at a later stage (for example, to apply
a decl attribute to the declaration rather than to its type). */
extern tree decl_attributes PARAMS ((tree *, tree, int));
extern tree decl_attributes (tree *, tree, int);
/* In integrate.c */
extern void save_for_inline PARAMS ((tree));
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment