This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.
| Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
|---|---|---|
| Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
| Other format: | [Raw text] | |
This converts the tree-ssa specific tree-*.h files to ISO C90,
committed as pre-approved after bootstrapping/regtesting on
x86_64-linux-gnu.
Andreas
2003-07-14 Andreas Jaeger <aj@suse.de>
* tree-alias-common.h: Convert prototypes to ISO C90, remove extra
whitespace.
* tree-alias-type.h: Convert prototypes to ISO C90.
* tree-dchain.h: Likewise.
* tree-flow-inline.h: Likewise.
* tree-flow.h: Likewise.
* tree-iterator.h: Likewise.
* tree-mudflap.h: Likewise.
* tree-simple.h: Likewise.
============================================================
Index: gcc/tree-alias-common.h
--- gcc/tree-alias-common.h 4 Feb 2003 05:10:22 -0000 1.1.2.7
+++ gcc/tree-alias-common.h 15 Jul 2003 03:11:24 -0000
@@ -3,7 +3,7 @@
#include "tree-alias-type.h"
/**
@brief Alias analysis function pointers.
-
+
Functions implemented by the actual alias analysis algorithms in
order for them to work with the common points-to structure.
*/
@@ -18,19 +18,19 @@ struct tree_alias_ops
/**
@brief Cleanup
-
+
Called when we are finished with the alias analyzer.
*/
void (*cleanup) (struct tree_alias_ops *);
-
+
/**
@brief Add variable
-
+
Called when we want to inform the alias analyzer about a new
variable we've found.
*/
alias_typevar (*add_var) (struct tree_alias_ops *, tree);
-
+
/**
@brief Add variable equivalent to existing one.
@@ -41,7 +41,7 @@ struct tree_alias_ops
alias_typevar);
/**
@brief Process a simple assignment (<tt>a = b</tt>)
-
+
Called to process simple assignment statements of the form <tt>a =
b</tt>, where a and b are both variables.
*/
@@ -49,7 +49,7 @@ struct tree_alias_ops
alias_typevar);
/**
@brief Process an address assignment (<tt>a = &b</tt>)
-
+
Called to process address assignment statements of the form <tt>a =
&b</tt>, where a and b are both variables.
*/
@@ -65,7 +65,7 @@ struct tree_alias_ops
/**
@brief Process an operator assignment (<tt>a = op (...)</tt>)
-
+
Called to process operators of the form <tt>a = op(....)</tt>, where a is
a variable.
*/
@@ -73,16 +73,16 @@ struct tree_alias_ops
/**
@brief Process a heap assignment (<tt>a = alloc (...)</tt>)
-
+
Called to process a heap assignment of the form <tt>a = *alloc
(...)</tt>, where a is a variable, and *alloc is a function that
- returns new memory.
+ returns new memory.
*/
void (*heap_assign) (struct tree_alias_ops *, alias_typevar);
/**
@brief Process an assignment to a pointer (<tt>*a = b</tt>)
-
+
Called to process assignment to pointer statements of the form
<tt>*a = b</tt>, where a and b are both variables.
*/
@@ -90,7 +90,7 @@ struct tree_alias_ops
/**
@brief Process a function definition
-
+
Called to inform the alias analyzer about a new function
definition.
*/
@@ -100,11 +100,11 @@ struct tree_alias_ops
/**
@brief Process a function call
@return Return 1 if we need to assume conservative side-effects.
-
+
*/
int (*function_call) (struct tree_alias_ops *, alias_typevar,
alias_typevar, varray_type);
-
+
/**
@brief Determine if two typevars may alias
*/
@@ -121,10 +121,10 @@ struct tree_alias_ops
};
extern struct tree_alias_ops *current_alias_ops;
-extern void create_alias_vars PARAMS ((tree));
-extern void delete_alias_vars PARAMS ((void));
-extern void init_alias_vars PARAMS ((void));
-extern bool ptr_may_alias_var PARAMS ((tree, tree));
+extern void create_alias_vars (tree);
+extern void delete_alias_vars (void);
+extern void init_alias_vars (void);
+extern bool ptr_may_alias_var (tree, tree);
enum pta_type
{
@@ -132,5 +132,5 @@ enum pta_type
PTA_ANDERSEN
};
extern enum pta_type flag_tree_points_to;
-extern const char *alias_get_name PARAMS ((tree));
+extern const char *alias_get_name (tree);
#endif
============================================================
Index: gcc/tree-alias-type.h
--- gcc/tree-alias-type.h 24 Feb 2003 19:32:27 -0000 1.1.2.8
+++ gcc/tree-alias-type.h 15 Jul 2003 03:11:25 -0000
@@ -35,5 +35,5 @@ typedef union alias_typevar_def *alias_t
union alias_type_def;
typedef union alias_type_def *alias_type;
-alias_typevar alias_tvar_new_with_aterm PARAMS ((tree, struct aterm_ *));
+alias_typevar alias_tvar_new_with_aterm (tree, struct aterm_ *);
#endif
============================================================
Index: gcc/tree-dchain.h
--- gcc/tree-dchain.h 22 Jun 2002 04:39:41 -0000 1.1.4.1
+++ gcc/tree-dchain.h 15 Jul 2003 03:11:25 -0000
@@ -1,5 +1,5 @@
-/* Interface to the double linked statement chain.
- Copyright (C) 2002 Free Software Foundation, Inc.
+/* Interface to the double linked statement chain.
+ Copyright (C) 2002, 2003 Free Software Foundation, Inc.
Contributed by Sebastian Pop <s.pop@laposte.net>
This file is part of GCC.
@@ -24,24 +24,23 @@ Software Foundation, 59 Temple Place - S
#define NEXT_STMT(NODE) TREE_CHAIN (NODE)
/* In tree-dchain.c */
-extern void double_chain_stmts PARAMS ((tree));
-extern void double_chain_free PARAMS ((tree));
-extern void dchain_insert_stmt_after PARAMS ((tree, tree));
-extern void dchain_insert_stmt_before PARAMS ((tree, tree));
-extern void dchain_delete_stmts PARAMS ((tree, tree));
-extern void dchain_insert_chain PARAMS ((tree, tree, tree, tree));
-extern void dchain_two_chains PARAMS ((tree, tree, tree, tree,
- tree, tree, tree, tree));
-extern tree dchain_deep_copy_node PARAMS ((tree));
-extern void dchain_replace_stmt PARAMS ((tree, tree));
-extern void dchain_build_scope PARAMS ((tree *));
-extern tree dchain_declare_tmp_vars PARAMS ((tree, tree));
-extern void dchain_delete_labels PARAMS ((tree));
-
-
-/* Define a double linked list interface for the COMPOUND_STMT path tree.
- This interface is used in goto and break elimination passes.
- The first element pointed by PATH_TOP is the innermost statement.
+extern void double_chain_stmts (tree);
+extern void double_chain_free (tree);
+extern void dchain_insert_stmt_after (tree, tree);
+extern void dchain_insert_stmt_before (tree, tree);
+extern void dchain_delete_stmts (tree, tree);
+extern void dchain_insert_chain (tree, tree, tree, tree);
+extern void dchain_two_chains (tree, tree, tree, tree, tree, tree, tree, tree);
+extern tree dchain_deep_copy_node (tree);
+extern void dchain_replace_stmt (tree, tree);
+extern void dchain_build_scope (tree *);
+extern tree dchain_declare_tmp_vars (tree, tree);
+extern void dchain_delete_labels (tree);
+
+
+/* Define a double linked list interface for the COMPOUND_STMT path tree.
+ This interface is used in goto and break elimination passes.
+ The first element pointed by PATH_TOP is the innermost statement.
This implementation uses a TREE_LIST node as its basic element. */
#define PATH_TYPE tree
#define PATH_TOP compound_stmt_path
@@ -82,16 +81,16 @@ extern void dchain_delete_labels
/* In simple-break-elim.c */
-extern void break_continue_elimination PARAMS ((tree));
-extern int chain_contains_stmt_p PARAMS ((tree, enum tree_code));
-extern void flow_out_of PARAMS ((PATH_TYPE, PATH_TYPE, tree, tree, void (*)
- PARAMS ((tree, tree, tree, tree))));
-extern void insert_andif_in_condition PARAMS ((tree, tree));
-extern void insert_orif_in_condition PARAMS ((tree, tree));
-extern void eliminate_compound_stmts PARAMS ((tree));
+extern void break_continue_elimination (tree);
+extern int chain_contains_stmt_p (tree, enum tree_code);
+extern void flow_out_of (PATH_TYPE, PATH_TYPE, tree, tree,
+ void (*) (tree, tree, tree, tree));
+extern void insert_andif_in_condition (tree, tree);
+extern void insert_orif_in_condition (tree, tree);
+extern void eliminate_compound_stmts (tree);
/* In simple-goto-elim.c */
-extern void goto_elimination PARAMS ((tree));
-extern void eliminate_with_if PARAMS ((tree, tree, tree,
- void (*) PARAMS ((tree, tree, tree, tree))));
+extern void goto_elimination (tree);
+extern void eliminate_with_if (tree, tree, tree,
+ void (*) (tree, tree, tree, tree));
============================================================
Index: gcc/tree-flow-inline.h
--- gcc/tree-flow-inline.h 14 Jul 2003 21:18:48 -0000 1.1.2.40
+++ gcc/tree-flow-inline.h 15 Jul 2003 03:11:25 -0000
@@ -1,5 +1,5 @@
/* Inline functions for tree-flow.h
- Copyright (C) 2001 Free Software Foundation, Inc.
+ Copyright (C) 2001, 2003 Free Software Foundation, Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
This file is part of GCC.
@@ -26,8 +26,7 @@ Boston, MA 02111-1307, USA. */
tree-flow.h. See tree-flow.h for documentation. */
static inline var_ann_t
-var_ann (t)
- tree t;
+var_ann (tree t)
{
#if defined ENABLE_CHECKING
if (t == NULL_TREE
@@ -48,8 +47,7 @@ get_var_ann (tree var)
}
static inline stmt_ann_t
-stmt_ann (t)
- tree t;
+stmt_ann (tree t)
{
#if defined ENABLE_CHECKING
if (!is_gimple_stmt (t) && !is_essa_node (t))
@@ -67,31 +65,27 @@ get_stmt_ann (tree stmt)
}
static inline enum tree_ann_type
-ann_type (ann)
- tree_ann ann;
+ann_type (tree_ann ann)
{
return ann->common.type;
}
static inline basic_block
-bb_for_stmt (t)
- tree t;
+bb_for_stmt (tree t)
{
stmt_ann_t ann = stmt_ann (t);
return ann ? ann->bb : NULL;
}
static inline varray_type
-may_aliases (var)
- tree var;
+may_aliases (tree var)
{
var_ann_t ann = var_ann (var);
return ann ? ann->may_aliases : NULL;
}
static inline void
-set_may_alias_global_mem (var)
- tree var;
+set_may_alias_global_mem (tree var)
{
var_ann_t ann = var_ann (var);
if (ann == NULL)
@@ -100,16 +94,14 @@ set_may_alias_global_mem (var)
}
static inline bool
-may_alias_global_mem_p (var)
- tree var;
+may_alias_global_mem_p (tree var)
{
var_ann_t ann = var_ann (var);
return ann ? ann->may_alias_global_mem : false;
}
static inline void
-set_may_point_to_global_mem (var)
- tree var;
+set_may_point_to_global_mem (tree var)
{
var_ann_t ann;
@@ -125,24 +117,21 @@ set_may_point_to_global_mem (var)
}
static inline bool
-may_point_to_global_mem_p (var)
- tree var;
+may_point_to_global_mem_p (tree var)
{
var_ann_t ann = var_ann (var);
return ann ? ann->may_point_to_global_mem : false;
}
static inline bool
-has_hidden_use (var)
- tree var;
+has_hidden_use (tree var)
{
var_ann_t ann = var_ann (var);
return ann ? ann->has_hidden_use : false;
}
static inline void
-set_has_hidden_use (var)
- tree var;
+set_has_hidden_use (tree var)
{
var_ann_t ann = var_ann (var);
if (ann == NULL)
@@ -151,8 +140,7 @@ set_has_hidden_use (var)
}
static inline int
-get_lineno (expr)
- tree expr;
+get_lineno (tree expr)
{
if (expr == NULL_TREE)
return -1;
@@ -167,8 +155,7 @@ get_lineno (expr)
}
static inline const char *
-get_filename (expr)
- tree expr;
+get_filename (tree expr)
{
if (expr == NULL_TREE)
return "???";
@@ -183,8 +170,7 @@ get_filename (expr)
}
static inline void
-modify_stmt (t)
- tree t;
+modify_stmt (tree t)
{
stmt_ann_t ann = stmt_ann (t);
if (ann == NULL)
@@ -193,8 +179,7 @@ modify_stmt (t)
}
static inline void
-unmodify_stmt (t)
- tree t;
+unmodify_stmt (tree t)
{
stmt_ann_t ann = stmt_ann (t);
if (ann == NULL)
@@ -203,8 +188,7 @@ unmodify_stmt (t)
}
static inline bool
-stmt_modified_p (t)
- tree t;
+stmt_modified_p (tree t)
{
stmt_ann_t ann = stmt_ann (t);
@@ -215,16 +199,14 @@ stmt_modified_p (t)
}
static inline tree *
-def_op (stmt)
- tree stmt;
+def_op (tree stmt)
{
stmt_ann_t ann = stmt_ann (stmt);
return ann ? (ann->ops ? ann->ops->def_op : NULL) : NULL;
}
static inline varray_type
-use_ops (stmt)
- tree stmt;
+use_ops (tree stmt)
{
stmt_ann_t ann = stmt_ann (stmt);
return ann ? (ann->ops ? ann->ops->use_ops : NULL) : NULL;
@@ -232,71 +214,62 @@ use_ops (stmt)
static inline varray_type
-vdef_ops (stmt)
- tree stmt;
+vdef_ops (tree stmt)
{
stmt_ann_t ann = stmt_ann (stmt);
return ann ? (ann->vops ? ann->vops->vdef_ops : NULL) : NULL;
}
static inline varray_type
-vuse_ops (stmt)
- tree stmt;
+vuse_ops (tree stmt)
{
stmt_ann_t ann = stmt_ann (stmt);
return ann ? (ann->vops ? ann->vops->vuse_ops : NULL) : NULL;
}
static inline varray_type
-addresses_taken (stmt)
- tree stmt;
+addresses_taken (tree stmt)
{
stmt_ann_t ann = stmt_ann (stmt);
return ann ? ann->addresses_taken : NULL;
}
static inline varray_type
-immediate_uses (stmt)
- tree stmt;
+immediate_uses (tree stmt)
{
stmt_ann_t ann = stmt_ann (stmt);
return ann ? (ann->df ? ann->df->immediate_uses : NULL) : NULL;
}
static inline varray_type
-reaching_defs (stmt)
- tree stmt;
+reaching_defs (tree stmt)
{
stmt_ann_t ann = stmt_ann (stmt);
return ann ? (ann->df ? ann->df->reaching_defs : NULL) : NULL;
}
static inline bb_ann_t
-bb_ann (bb)
- basic_block bb;
+bb_ann (basic_block bb)
{
return (bb_ann_t)bb->aux;
}
static inline basic_block
-parent_block (bb)
- basic_block bb;
+parent_block (basic_block bb)
{
tree parent = (bb->head_tree_p) ? parent_stmt (*bb->head_tree_p) : NULL_TREE;
return parent ? bb_for_stmt (parent) : NULL;
}
static inline tree
-parent_stmt (stmt)
- tree stmt;
+parent_stmt (tree stmt)
{
stmt_ann_t ann = stmt_ann (stmt);
return (ann) ? ann->parent_stmt : NULL_TREE;
}
static inline tree
-phi_nodes (bb)
- basic_block bb;
+phi_nodes (basic_block bb)
{
return bb_ann (bb)->phi_nodes;
}
@@ -304,9 +277,7 @@ phi_nodes (bb)
/* Return the phi index number for an edge. */
static inline int
-phi_arg_from_edge (phi, e)
- tree phi;
- edge e;
+phi_arg_from_edge (tree phi, edge e)
{
int i;
#if defined ENABLE_CHECKING
@@ -324,9 +295,7 @@ phi_arg_from_edge (phi, e)
/* Return the phi argument number for an edge. */
static inline struct phi_arg_d *
-phi_element_for_edge (phi, e)
- tree phi;
- edge e;
+phi_element_for_edge (tree phi, edge e)
{
int i;
@@ -338,9 +307,7 @@ phi_element_for_edge (phi, e)
}
static inline void
-add_dom_child (bb, child_bb)
- basic_block bb;
- basic_block child_bb;
+add_dom_child (basic_block bb, basic_block child_bb)
{
bb_ann_t ann = bb_ann (bb);
if (ann->dom_children == NULL)
@@ -349,8 +316,7 @@ add_dom_child (bb, child_bb)
}
static inline bitmap
-dom_children (bb)
- basic_block bb;
+dom_children (basic_block bb)
{
return bb_ann (bb)->dom_children;
}
@@ -358,8 +324,7 @@ dom_children (bb)
/* ----------------------------------------------------------------------- */
static inline bool
-bsi_end_p (i)
-block_stmt_iterator i;
+bsi_end_p (block_stmt_iterator i)
{
return (i.tp == NULL || bsi_stmt (i) == NULL_TREE);
}
@@ -368,8 +333,7 @@ block_stmt_iterator i;
has bb_for_stmt() set (can't be an empty statement node). */
static inline void
-bsi_next (i)
- block_stmt_iterator *i;
+bsi_next (block_stmt_iterator *i)
{
extern void bsi_next_in_bb (block_stmt_iterator *, basic_block);
@@ -378,8 +342,7 @@ bsi_next (i)
}
static inline tree *
-bsi_stmt_ptr (i)
- block_stmt_iterator i;
+bsi_stmt_ptr (block_stmt_iterator i)
{
#if defined ENABLE_CHECKING
if (i.tp == NULL || *i.tp == NULL_TREE)
@@ -393,15 +356,13 @@ bsi_stmt_ptr (i)
}
static inline tree
-bsi_stmt (i)
- block_stmt_iterator i;
+bsi_stmt (block_stmt_iterator i)
{
return *(bsi_stmt_ptr (i));
}
static inline tree *
-bsi_container (i)
- block_stmt_iterator i;
+bsi_container (block_stmt_iterator i)
{
return i.tp;
}
@@ -409,15 +370,13 @@ bsi_container (i)
/* Return a tree_stmt_iterator for the stmt a block iterator refers to. */
static inline tree_stmt_iterator
-tsi_from_bsi (bi)
- block_stmt_iterator bi;
+tsi_from_bsi (block_stmt_iterator bi)
{
return tsi_start (bi.tp);
}
static inline bool
-is_exec_stmt (t)
- tree t;
+is_exec_stmt (tree t)
{
return (t && !IS_EMPTY_STMT (t) && t != error_mark_node);
}
@@ -426,8 +385,7 @@ is_exec_stmt (t)
/* Return true if this stmt can be the target of a control transfer stmt such
as a goto. */
static inline bool
-is_label_stmt (t)
- tree t;
+is_label_stmt (tree t)
{
if (t)
switch (TREE_CODE (t))
@@ -455,16 +413,15 @@ typedef struct bsi_list_d {
} *bsi_list_p;
-static inline bsi_list_p new_bsi_list PARAMS ((void));
-static inline int empty_bsi_stack PARAMS ((bsi_list_p));
-extern void push_bsi PARAMS ((bsi_list_p *,
- block_stmt_iterator));
-extern block_stmt_iterator pop_bsi PARAMS ((bsi_list_p *));
+static inline bsi_list_p new_bsi_list (void);
+static inline int empty_bsi_stack (bsi_list_p);
+extern void push_bsi (bsi_list_p *, block_stmt_iterator);
+extern block_stmt_iterator pop_bsi (bsi_list_p *);
/* Allocate a bsi_list structure. */
static inline bsi_list_p
-new_bsi_list ()
+new_bsi_list (void)
{
bsi_list_p b;
b = (bsi_list_p) xmalloc (sizeof (struct bsi_list_d));
@@ -476,8 +433,7 @@ new_bsi_list ()
/* Is the iterator stack empty? */
static inline int
-empty_bsi_stack (list)
- bsi_list_p list;
+empty_bsi_stack (bsi_list_p list)
{
if (!list || (list->curr_index < 0 && list->next == NULL))
return 1;
@@ -486,11 +442,11 @@ empty_bsi_stack (list)
/* Process an entire block of bsi's in reverse by pushing them on a stack
- as they are encountered, and then popping them off as they are needed.
- There are a couple of odd things. Since the last loop is a for loop,
+ as they are encountered, and then popping them off as they are needed.
+ There are a couple of odd things. Since the last loop is a for loop,
a dummy entry is pushed on the beginning of the stack, this allows the first
item pushed on the stack to be processed in the final for loop, as well
- as guaranteeing there will be at least one to pop off.
+ as guaranteeing there will be at least one to pop off.
usage:
bsi_list_p stack;
@@ -513,11 +469,11 @@ empty_bsi_stack (list)
/* This macro can be used if all that is ever examined is the stmt nodes
of bsi. Ie, if the usage is
- FOR_EACH_BSI_IN_REVERSE (stack, bb, bsi)
+ FOR_EACH_BSI_IN_REVERSE (stack, bb, bsi)
{
tree stmt = bsi_stmt (bsi);
...
- Then less overhead exists to simply use this macro.
+ Then less overhead exists to simply use this macro.
usage:
varray_type stmt_stack;
@@ -539,8 +495,8 @@ empty_bsi_stack (list)
} \
stmt = VARRAY_TOP_TREE (stmt_stack); \
VARRAY_POP (stmt_stack); \
- for ( ; VARRAY_ACTIVE_SIZE (stmt_stack) > 0 ; \
- stmt = VARRAY_TOP_TREE (stmt_stack), VARRAY_POP (stmt_stack))
+ for ( ; VARRAY_ACTIVE_SIZE (stmt_stack) > 0 ; \
+ stmt = VARRAY_TOP_TREE (stmt_stack), VARRAY_POP (stmt_stack))
static inline bool
============================================================
Index: gcc/tree-flow.h
--- gcc/tree-flow.h 14 Jul 2003 21:18:48 -0000 1.1.4.89
+++ gcc/tree-flow.h 15 Jul 2003 03:11:26 -0000
@@ -1,5 +1,5 @@
/* Data and Control Flow Analysis for Trees.
- Copyright (C) 2001 Free Software Foundation, Inc.
+ Copyright (C) 2001, 2003 Free Software Foundation, Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
This file is part of GCC.
@@ -104,11 +104,11 @@ struct var_ann_d GTY(())
/* Variables that may alias this variable. */
varray_type may_aliases;
-
+
/* Unique ID of this variable. */
size_t uid;
- /* Used when going out of SSA form to indicate which partition this
+ /* Used when going out of SSA form to indicate which partition this
variable represents storage for. */
unsigned partition;
@@ -150,7 +150,7 @@ struct dataflow_d GTY(())
/* Reached uses. This is a list of all the possible program statements
that may be reached directly or indirectly by definitions made in this
- statement. Notice that this is a superset of IMMEDIATE_USES.
+ statement. Notice that this is a superset of IMMEDIATE_USES.
For instance, given the following piece of code:
1 a1 = 10;
@@ -220,7 +220,7 @@ struct stmt_ann_d GTY(())
structure to which this statement belongs to. */
tree parent_stmt;
- /* For nodes which can throw REACHABLE_EXCEPTION_HANDLERS contains a
+ /* For nodes which can throw REACHABLE_EXCEPTION_HANDLERS contains a
tree list of all the directly reachable exception handlers. */
tree reachable_exception_handlers;
@@ -240,35 +240,35 @@ typedef union tree_ann_d *tree_ann;
typedef struct var_ann_d *var_ann_t;
typedef struct stmt_ann_d *stmt_ann_t;
-static inline var_ann_t var_ann PARAMS ((tree));
-static inline var_ann_t get_var_ann PARAMS ((tree));
-static inline stmt_ann_t stmt_ann PARAMS ((tree));
-static inline stmt_ann_t get_stmt_ann PARAMS ((tree));
-static inline enum tree_ann_type ann_type PARAMS ((tree_ann));
-static inline basic_block bb_for_stmt PARAMS ((tree));
-extern void set_bb_for_stmt PARAMS ((tree, basic_block));
-static inline void modify_stmt PARAMS ((tree));
-static inline void unmodify_stmt PARAMS ((tree));
-static inline bool stmt_modified_p PARAMS ((tree));
-static inline varray_type may_aliases PARAMS ((tree));
-static inline void set_may_alias_global_mem PARAMS ((tree));
-static inline bool may_alias_global_mem_p PARAMS ((tree));
-static inline bool may_point_to_global_mem_p PARAMS ((tree));
-static inline void set_may_point_to_global_mem PARAMS ((tree));
-static inline int get_lineno PARAMS ((tree));
-static inline const char *get_filename PARAMS ((tree));
-static inline bool is_exec_stmt PARAMS ((tree));
-static inline bool is_label_stmt PARAMS ((tree));
-static inline varray_type vdef_ops PARAMS ((tree));
-static inline varray_type vuse_ops PARAMS ((tree));
-static inline varray_type use_ops PARAMS ((tree));
-static inline tree *def_op PARAMS ((tree));
-static inline varray_type addresses_taken PARAMS ((tree));
-static inline varray_type immediate_uses PARAMS ((tree));
-static inline varray_type reaching_defs PARAMS ((tree));
-static inline bool has_hidden_use PARAMS ((tree));
-static inline void set_has_hidden_use PARAMS ((tree));
-static inline tree parent_stmt PARAMS ((tree));
+static inline var_ann_t var_ann (tree);
+static inline var_ann_t get_var_ann (tree);
+static inline stmt_ann_t stmt_ann (tree);
+static inline stmt_ann_t get_stmt_ann (tree);
+static inline enum tree_ann_type ann_type (tree_ann);
+static inline basic_block bb_for_stmt (tree);
+extern void set_bb_for_stmt (tree, basic_block);
+static inline void modify_stmt (tree);
+static inline void unmodify_stmt (tree);
+static inline bool stmt_modified_p (tree);
+static inline varray_type may_aliases (tree);
+static inline void set_may_alias_global_mem (tree);
+static inline bool may_alias_global_mem_p (tree);
+static inline bool may_point_to_global_mem_p (tree);
+static inline void set_may_point_to_global_mem (tree);
+static inline int get_lineno (tree);
+static inline const char *get_filename (tree);
+static inline bool is_exec_stmt (tree);
+static inline bool is_label_stmt (tree);
+static inline varray_type vdef_ops (tree);
+static inline varray_type vuse_ops (tree);
+static inline varray_type use_ops (tree);
+static inline tree *def_op (tree);
+static inline varray_type addresses_taken (tree);
+static inline varray_type immediate_uses (tree);
+static inline varray_type reaching_defs (tree);
+static inline bool has_hidden_use (tree);
+static inline void set_has_hidden_use (tree);
+static inline tree parent_stmt (tree);
/*---------------------------------------------------------------------------
@@ -278,7 +278,7 @@ struct bb_ann_d
{
/* Chain of PHI nodes created in this block. */
tree phi_nodes;
-
+
tree ephi_nodes;
/* Set of blocks immediately dominated by this node. */
@@ -288,11 +288,11 @@ struct bb_ann_d
typedef struct bb_ann_d *bb_ann_t;
/* Accessors for basic block annotations. */
-static inline bb_ann_t bb_ann PARAMS ((basic_block));
-static inline basic_block parent_block PARAMS ((basic_block));
-static inline tree phi_nodes PARAMS ((basic_block));
-static inline void add_dom_child PARAMS ((basic_block, basic_block));
-static inline bitmap dom_children PARAMS ((basic_block));
+static inline bb_ann_t bb_ann (basic_block);
+static inline basic_block parent_block (basic_block);
+static inline tree phi_nodes (basic_block);
+static inline void add_dom_child (basic_block, basic_block);
+static inline bitmap dom_children (basic_block);
/*---------------------------------------------------------------------------
@@ -306,19 +306,19 @@ typedef struct {
tree context; /* Stack for decending into BIND_EXPR's. */
} block_stmt_iterator;
-extern block_stmt_iterator bsi_start PARAMS ((basic_block));
-extern block_stmt_iterator bsi_last PARAMS ((basic_block));
-static inline bool bsi_end_p PARAMS ((block_stmt_iterator));
-static inline void bsi_next PARAMS ((block_stmt_iterator *));
-extern void bsi_prev PARAMS ((block_stmt_iterator *));
-static inline tree bsi_stmt PARAMS ((block_stmt_iterator));
-static inline tree *bsi_stmt_ptr PARAMS ((block_stmt_iterator));
-static inline tree *bsi_container PARAMS ((block_stmt_iterator));
+extern block_stmt_iterator bsi_start (basic_block);
+extern block_stmt_iterator bsi_last (basic_block);
+static inline bool bsi_end_p (block_stmt_iterator);
+static inline void bsi_next (block_stmt_iterator *);
+extern void bsi_prev (block_stmt_iterator *);
+static inline tree bsi_stmt (block_stmt_iterator);
+static inline tree *bsi_stmt_ptr (block_stmt_iterator);
+static inline tree *bsi_container (block_stmt_iterator);
-extern block_stmt_iterator bsi_from_tsi PARAMS ((tree_stmt_iterator));
-static inline tree_stmt_iterator tsi_from_bsi PARAMS ((block_stmt_iterator));
+extern block_stmt_iterator bsi_from_tsi (tree_stmt_iterator);
+static inline tree_stmt_iterator tsi_from_bsi (block_stmt_iterator);
-extern void bsi_remove PARAMS ((block_stmt_iterator *));
+extern void bsi_remove (block_stmt_iterator *);
enum bsi_iterator_update
{
@@ -328,22 +328,22 @@ enum bsi_iterator_update
/* Single stmt insertion routines. */
-extern void bsi_insert_before PARAMS ((block_stmt_iterator *, tree, enum bsi_iterator_update));
-extern void bsi_insert_after PARAMS ((block_stmt_iterator *, tree, enum bsi_iterator_update));
-extern void bsi_insert_on_edge PARAMS ((edge, tree));
-extern int bsi_commit_edge_inserts PARAMS ((int, int *));
-extern block_stmt_iterator bsi_insert_on_edge_immediate
- PARAMS ((edge, tree, block_stmt_iterator *, basic_block *));
+extern void bsi_insert_before (block_stmt_iterator *, tree, enum bsi_iterator_update);
+extern void bsi_insert_after (block_stmt_iterator *, tree, enum bsi_iterator_update);
+extern void bsi_insert_on_edge (edge, tree);
+extern int bsi_commit_edge_inserts (int, int *);
+extern block_stmt_iterator bsi_insert_on_edge_immediate
+ (edge, tree, block_stmt_iterator *, basic_block *);
-extern void bsi_replace PARAMS ((block_stmt_iterator, tree));
+extern void bsi_replace (block_stmt_iterator, tree);
/* Stmt list insertion routines. */
-extern void bsi_insert_list_before PARAMS ((block_stmt_iterator *, tree_stmt_anchor));
-extern void bsi_insert_list_after PARAMS ((block_stmt_iterator *, tree_stmt_anchor));
-extern block_stmt_iterator bsi_insert_list_on_edge PARAMS ((edge, tree_stmt_anchor));
+extern void bsi_insert_list_before (block_stmt_iterator *, tree_stmt_anchor);
+extern void bsi_insert_list_after (block_stmt_iterator *, tree_stmt_anchor);
+extern block_stmt_iterator bsi_insert_list_on_edge (edge, tree_stmt_anchor);
-void bsi_next_in_bb PARAMS ((block_stmt_iterator *, basic_block));
+void bsi_next_in_bb (block_stmt_iterator *, basic_block);
/*---------------------------------------------------------------------------
Global declarations
@@ -463,7 +463,7 @@ extern void ssa_remove_edge (edge);
extern void set_is_used (tree);
/* In tree-ssa-pre.c */
-extern void tree_perform_ssapre PARAMS ((tree));
+extern void tree_perform_ssapre (tree);
/* In tree-ssa-ccp.c */
============================================================
Index: gcc/tree-iterator.h
--- gcc/tree-iterator.h 30 Jun 2003 13:17:28 -0000 1.1.2.6
+++ gcc/tree-iterator.h 15 Jul 2003 03:11:26 -0000
@@ -1,4 +1,4 @@
-/* Iterator routines for manipulating GENERIC and GIMPLE tree statements.
+/* Iterator routines for manipulating GENERIC and GIMPLE tree statements.
Copyright (C) 2003 Free Software Foundation, Inc.
Contributed by Andrew MacLeod <amacleod@redhat.com>
@@ -21,11 +21,11 @@ Boston, MA 02111-1307, USA. */
/* This file is dependant upon the implementation of tree's. It provides an
- abstract interface to the tree objects such that if all tree creation and
- manipulations are done through this interface, we can easily change the
+ abstract interface to the tree objects such that if all tree creation and
+ manipulations are done through this interface, we can easily change the
implementation of tree's, and not impact other code.
- In particular, we wish to replace the current linking scheme which uses
+ In particular, we wish to replace the current linking scheme which uses
COMPOUND_EXPR nodes to link statements. We'd like to either use doubly
linked lists, or another mechanism which takes the links completely out
of the tree nodes all together. Before this can be done, the front end
@@ -44,20 +44,19 @@ typedef struct {
tree *tp;
} tree_stmt_iterator;
-static inline tree_stmt_iterator tsi_start PARAMS ((tree *));
-static inline tree_stmt_iterator tsi_last PARAMS ((tree *));
-static inline bool tsi_end_p PARAMS ((tree_stmt_iterator));
-static inline bool tsi_one_before_end_p PARAMS ((tree_stmt_iterator));
-static inline void tsi_next PARAMS ((tree_stmt_iterator *));
-static inline void tsi_prev PARAMS ((tree_stmt_iterator *));
-static inline tree tsi_stmt PARAMS ((tree_stmt_iterator));
-static inline tree *tsi_stmt_ptr PARAMS ((tree_stmt_iterator));
-static inline tree *tsi_container PARAMS ((tree_stmt_iterator));
+static inline tree_stmt_iterator tsi_start (tree *);
+static inline tree_stmt_iterator tsi_last (tree *);
+static inline bool tsi_end_p (tree_stmt_iterator);
+static inline bool tsi_one_before_end_p (tree_stmt_iterator);
+static inline void tsi_next (tree_stmt_iterator *);
+static inline void tsi_prev (tree_stmt_iterator *);
+static inline tree tsi_stmt (tree_stmt_iterator);
+static inline tree *tsi_stmt_ptr (tree_stmt_iterator);
+static inline tree *tsi_container (tree_stmt_iterator);
static inline tree_stmt_iterator
-tsi_start (tp)
- tree *tp;
+tsi_start (tree *tp)
{
tree_stmt_iterator i;
i.tp = tp;
@@ -66,8 +65,7 @@ tsi_start (tp)
/* Return an iterator pointing to the last stmt in a chain. */
static inline tree_stmt_iterator
-tsi_last (tp)
- tree *tp;
+tsi_last (tree *tp)
{
tree_stmt_iterator i;
@@ -79,15 +77,13 @@ tsi_last (tp)
}
static inline bool
-tsi_end_p (i)
- tree_stmt_iterator i;
+tsi_end_p (tree_stmt_iterator i)
{
return (i.tp == NULL || *(i.tp) == error_mark_node);
}
static inline void
-tsi_next (i)
- tree_stmt_iterator *i;
+tsi_next (tree_stmt_iterator *i)
{
tree t = *(i->tp);
if (TREE_CODE (t) == COMPOUND_EXPR)
@@ -97,24 +93,21 @@ tsi_next (i)
}
static inline void
-tsi_prev (i)
- tree_stmt_iterator *i;
+tsi_prev (tree_stmt_iterator *i)
{
printf (" tsi_prev (%p) is not implemented yet\n",(void *)i);
abort();
}
static inline bool
-tsi_one_before_end_p (i)
- tree_stmt_iterator i;
+tsi_one_before_end_p (tree_stmt_iterator i)
{
tsi_next (&i);
return tsi_end_p (i);
}
static inline tree *
-tsi_stmt_ptr (i)
- tree_stmt_iterator i;
+tsi_stmt_ptr (tree_stmt_iterator i)
{
tree t;
@@ -132,8 +125,7 @@ tsi_stmt_ptr (i)
}
static inline tree
-tsi_stmt (i)
- tree_stmt_iterator i;
+tsi_stmt (tree_stmt_iterator i)
{
tree t = *(tsi_stmt_ptr (i));
if (t == error_mark_node)
@@ -142,8 +134,7 @@ tsi_stmt (i)
}
static inline tree *
-tsi_container (i)
- tree_stmt_iterator i;
+tsi_container (tree_stmt_iterator i)
{
return i.tp;
}
@@ -161,10 +152,10 @@ enum tsi_iterator_update
TSI_SAME_STMT
};
-void tsi_link_before PARAMS ((tree_stmt_iterator *, tree, enum tsi_iterator_update));
-void tsi_link_after PARAMS ((tree_stmt_iterator *, tree, enum tsi_iterator_update));
-void tsi_delink PARAMS ((tree_stmt_iterator *));
-tree_stmt_iterator tsi_new_stmt_list PARAMS ((tree, tree_stmt_anchor *));
-tree_stmt_iterator tsi_stmt_list_head PARAMS ((tree_stmt_anchor));
+void tsi_link_before (tree_stmt_iterator *, tree, enum tsi_iterator_update);
+void tsi_link_after (tree_stmt_iterator *, tree, enum tsi_iterator_update);
+void tsi_delink (tree_stmt_iterator *);
+tree_stmt_iterator tsi_new_stmt_list (tree, tree_stmt_anchor *);
+tree_stmt_iterator tsi_stmt_list_head (tree_stmt_anchor);
#endif /* _TREE_ITERATOR_H */
============================================================
Index: gcc/tree-mudflap.h
--- gcc/tree-mudflap.h 13 Jun 2003 21:09:13 -0000 1.1.2.5
+++ gcc/tree-mudflap.h 15 Jul 2003 03:11:26 -0000
@@ -23,19 +23,19 @@ Software Foundation, 59 Temple Place - S
#define TREE_MUDFLAP_H
/* Instrumentation. */
-extern tree mudflap_c_function PARAMS ((tree));
-extern void mudflap_enqueue_decl PARAMS ((tree, const char *));
-extern void mudflap_enqueue_constant PARAMS ((tree, const char *));
-extern void mudflap_finish_file PARAMS ((void));
+extern tree mudflap_c_function (tree);
+extern void mudflap_enqueue_decl (tree, const char *);
+extern void mudflap_enqueue_constant (tree, const char *);
+extern void mudflap_finish_file (void);
/* Tree node marking. */
-extern int mf_marked_p PARAMS ((tree));
-extern tree mf_mark PARAMS ((tree));
+extern int mf_marked_p (tree);
+extern tree mf_mark (tree);
/* To be provided by a front-end interface module. */
-extern tree mflang_lookup_decl PARAMS ((const char *));
-extern tree mflang_register_call PARAMS ((const char*, tree, tree, tree));
-extern void mflang_flush_calls PARAMS ((tree));
+extern tree mflang_lookup_decl (const char *);
+extern tree mflang_register_call (const char*, tree, tree, tree);
+extern void mflang_flush_calls (tree);
#endif /* TREE_MUDFLAP_H */
============================================================
Index: gcc/tree-simple.h
--- gcc/tree-simple.h 13 Jun 2003 19:00:18 -0000 1.1.4.24
+++ gcc/tree-simple.h 15 Jul 2003 03:11:26 -0000
@@ -1,5 +1,5 @@
/* Functions to analyze and validate GIMPLE trees.
- Copyright (C) 2002 Free Software Foundation, Inc.
+ Copyright (C) 2002, 2003 Free Software Foundation, Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
This file is part of GCC.
@@ -26,58 +26,58 @@ Boston, MA 02111-1307, USA. */
#include "tree-iterator.h"
/* Interface used in [break/goto]-elimination: to be declared in a .h file. */
-extern void insert_before_continue_end PARAMS ((tree, tree));
-extern void tree_build_scope PARAMS ((tree *));
-extern tree create_tmp_var PARAMS ((tree, const char *));
-extern tree create_tmp_alias_var PARAMS ((tree, const char *));
-extern bool is_gimple_tmp_var PARAMS ((tree));
-extern tree get_initialized_tmp_var PARAMS ((tree, tree *));
-extern tree get_formal_tmp_var PARAMS ((tree, tree *));
-extern void declare_tmp_vars PARAMS ((tree, tree));
-extern tree deep_copy_list PARAMS ((tree));
-extern tree deep_copy_node PARAMS ((tree));
-extern tree update_line_number PARAMS ((tree, int));
-
-extern tree rationalize_compound_expr PARAMS ((tree));
-extern tree right_assocify_expr PARAMS ((tree));
-extern void annotate_all_with_file_line PARAMS ((tree *, const char *, int));
+extern void insert_before_continue_end (tree, tree);
+extern void tree_build_scope (tree *);
+extern tree create_tmp_var (tree, const char *);
+extern tree create_tmp_alias_var (tree, const char *);
+extern bool is_gimple_tmp_var (tree);
+extern tree get_initialized_tmp_var (tree, tree *);
+extern tree get_formal_tmp_var (tree, tree *);
+extern void declare_tmp_vars (tree, tree);
+extern tree deep_copy_list (tree);
+extern tree deep_copy_node (tree);
+extern tree update_line_number (tree, int);
+
+extern tree rationalize_compound_expr (tree);
+extern tree right_assocify_expr (tree);
+extern void annotate_all_with_file_line (tree *, const char *, int);
/* Validation of GIMPLE expressions. */
-int is_gimple_expr PARAMS ((tree));
-int is_gimple_rhs PARAMS ((tree));
-int is_gimple_modify_expr PARAMS ((tree));
-int is_gimple_modify_expr_lhs PARAMS ((tree));
-bool is_gimple_relop PARAMS ((enum tree_code));
-int is_gimple_binary_expr PARAMS ((tree));
-int is_gimple_condexpr PARAMS ((tree));
-int is_gimple_unary_expr PARAMS ((tree));
-int is_gimple_call_expr PARAMS ((tree));
-int is_gimple_arglist PARAMS ((tree));
-int is_gimple_const PARAMS ((tree));
-int is_gimple_id PARAMS ((tree));
-int is_gimple_varname PARAMS ((tree));
-int is_gimple_addr_expr_arg PARAMS ((tree));
-int is_gimple_val PARAMS ((tree));
-int is_gimple_min_lval PARAMS ((tree));
-int is_gimple_compound_lval PARAMS ((tree));
-int is_gimple_arrayref PARAMS ((tree));
-int is_gimple_compref PARAMS ((tree));
-int is_gimple_cast PARAMS ((tree));
-int is_gimple_cast_op PARAMS ((tree));
-int is_gimple_exprseq PARAMS ((tree));
-int is_gimple_constructor PARAMS ((tree));
-int is_gimple_constructor_elt PARAMS ((tree));
-int is_gimple_initializer PARAMS ((tree));
-int is_gimplifiable_builtin PARAMS ((tree));
-int is_gimple_stmt PARAMS ((tree));
+int is_gimple_expr (tree);
+int is_gimple_rhs (tree);
+int is_gimple_modify_expr (tree);
+int is_gimple_modify_expr_lhs (tree);
+bool is_gimple_relop (enum tree_code);
+int is_gimple_binary_expr (tree);
+int is_gimple_condexpr (tree);
+int is_gimple_unary_expr (tree);
+int is_gimple_call_expr (tree);
+int is_gimple_arglist (tree);
+int is_gimple_const (tree);
+int is_gimple_id (tree);
+int is_gimple_varname (tree);
+int is_gimple_addr_expr_arg (tree);
+int is_gimple_val (tree);
+int is_gimple_min_lval (tree);
+int is_gimple_compound_lval (tree);
+int is_gimple_arrayref (tree);
+int is_gimple_compref (tree);
+int is_gimple_cast (tree);
+int is_gimple_cast_op (tree);
+int is_gimple_exprseq (tree);
+int is_gimple_constructor (tree);
+int is_gimple_constructor_elt (tree);
+int is_gimple_initializer (tree);
+int is_gimplifiable_builtin (tree);
+int is_gimple_stmt (tree);
-void recalculate_side_effects PARAMS ((tree));
+void recalculate_side_effects (tree);
-typedef void foreach_stmt_fn PARAMS ((tree *));
-void foreach_stmt PARAMS ((tree *, foreach_stmt_fn *));
+typedef void foreach_stmt_fn (tree *);
+void foreach_stmt (tree *, foreach_stmt_fn *);
/* FIXME this needs a better name. */
-tree add_tree PARAMS ((tree, tree *));
+tree add_tree (tree, tree *);
/* FIXME we should deduce this from the predicate. */
typedef enum fallback_t {
@@ -86,22 +86,20 @@ typedef enum fallback_t {
fb_lvalue=2,
fb_either=1|2
} fallback_t;
-int gimplify_expr PARAMS ((tree *, tree *, tree *,
- int (*) PARAMS ((tree)),
- fallback_t));
-int gimplify_stmt PARAMS ((tree *));
+int gimplify_expr (tree *, tree *, tree *, int (*) (tree), fallback_t);
+int gimplify_stmt (tree *);
/* Miscellaneous helpers. */
-tree get_base_symbol PARAMS ((tree));
-void gimple_add_tmp_var PARAMS ((tree));
-tree gimple_current_bind_expr PARAMS ((void));
-void gimple_push_bind_expr PARAMS ((tree));
-void gimple_pop_bind_expr PARAMS ((void));
-void mark_not_gimple PARAMS ((tree *));
-void unshare_all_trees PARAMS ((tree));
-tree voidify_wrapper_expr PARAMS ((tree));
-tree gimple_build_eh_filter PARAMS ((tree, tree, tree));
-tree maybe_protect_cleanup PARAMS ((tree));
+tree get_base_symbol (tree);
+void gimple_add_tmp_var (tree);
+tree gimple_current_bind_expr (void);
+void gimple_push_bind_expr (tree);
+void gimple_pop_bind_expr (void);
+void mark_not_gimple (tree *);
+void unshare_all_trees (tree);
+tree voidify_wrapper_expr (tree);
+tree gimple_build_eh_filter (tree, tree, tree);
+tree maybe_protect_cleanup (tree);
#endif /* _TREE_SIMPLE_H */
--
Andreas Jaeger, aj@suse.de, http://www.suse.de/~aj
SuSE Linux AG, Deutschherrnstr. 15-19, 90429 Nürnberg, Germany
GPG fingerprint = 93A3 365E CE47 B889 DF7F FED1 389A 563C C272 A126
Attachment:
pgp00000.pgp
Description: PGP signature
| Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
|---|---|---|
| Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |