summaryrefslogtreecommitdiff
path: root/gcc/ada/elists.h
diff options
context:
space:
mode:
authorneroden <neroden@138bc75d-0d04-0410-961f-82ee72b054a4>2003-10-24 02:28:37 +0000
committerneroden <neroden@138bc75d-0d04-0410-961f-82ee72b054a4>2003-10-24 02:28:37 +0000
commitba4fc7dfb72cdf46c4f2c20ca7a4ebc2395a8877 (patch)
tree88b1021b4a595fc67a1bc99941b3db47b9dc7dcb /gcc/ada/elists.h
parent0a5370530729695532e72ecf176973d9454682d6 (diff)
downloadgcc-ba4fc7dfb72cdf46c4f2c20ca7a4ebc2395a8877.tar.gz
* adadecode.h, atree.h, elists.h, namet.h, nlists.h, raise.h,
stringt.h: Convert to ISO C90 declarations and definitions. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@72877 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/ada/elists.h')
-rw-r--r--gcc/ada/elists.h25
1 files changed, 10 insertions, 15 deletions
diff --git a/gcc/ada/elists.h b/gcc/ada/elists.h
index 0a1ad06b1ee..9869f553f4f 100644
--- a/gcc/ada/elists.h
+++ b/gcc/ada/elists.h
@@ -56,36 +56,32 @@ extern struct Elmt_Item *Elmts_Ptr;
/* Element List Access Functions: */
-static Node_Id Node PARAMS ((Elmt_Id));
-static Elmt_Id First_Elmt PARAMS ((Elist_Id));
-static Elmt_Id Last_Elmt PARAMS ((Elist_Id));
-static Elmt_Id Next_Elmt PARAMS ((Elmt_Id));
-static Boolean Is_Empty_Elmt_List PARAMS ((Elist_Id));
+static Node_Id Node (Elmt_Id);
+static Elmt_Id First_Elmt (Elist_Id);
+static Elmt_Id Last_Elmt (Elist_Id);
+static Elmt_Id Next_Elmt (Elmt_Id);
+static Boolean Is_Empty_Elmt_List (Elist_Id);
INLINE Node_Id
-Node (Elmt)
- Elmt_Id Elmt;
+Node (Elmt_Id Elmt)
{
return Elmts_Ptr[Elmt - First_Elmt_Id].node;
}
INLINE Elmt_Id
-First_Elmt (List)
- Elist_Id List;
+First_Elmt (Elist_Id List)
{
return Elists_Ptr[List - First_Elist_Id].first;
}
INLINE Elmt_Id
-Last_Elmt (List)
- Elist_Id List;
+Last_Elmt (Elist_Id List)
{
return Elists_Ptr[List - First_Elist_Id].last;
}
INLINE Elmt_Id
-Next_Elmt (Node)
- Elmt_Id Node;
+Next_Elmt (Elmt_Id Node)
{
Int N = Elmts_Ptr[Node - First_Elmt_Id].next;
@@ -96,8 +92,7 @@ Next_Elmt (Node)
}
INLINE Boolean
-Is_Empty_Elmt_List (Id)
- Elist_Id Id;
+Is_Empty_Elmt_List (Elist_Id Id)
{
return Elists_Ptr[Id - First_Elist_Id].first == No_Elmt;
}