X-Git-Url: http://git.efficios.com/?a=blobdiff_plain;f=libiberty%2Finsque.c;h=fd02357bb23970dcda529f1f4a939074c07c54ad;hb=3e50a591d9f0c0b22bbf93d09eef7d2286f3716c;hp=c0c1180d42115eb727dd35b7a687c635388c6c5b;hpb=2ee563b53258d390d7446e90a67f465d504ae44c;p=deliverable%2Fbinutils-gdb.git

diff --git a/libiberty/insque.c b/libiberty/insque.c
index c0c1180d42..fd02357bb2 100644
--- a/libiberty/insque.c
+++ b/libiberty/insque.c
@@ -3,7 +3,8 @@
 
 /*
 
-@deftypefn Supplemental void insque (struct qelem *@var{elem}, struct qelem *@var{pred})
+@deftypefn Supplemental void insque (struct qelem *@var{elem}, @
+  struct qelem *@var{pred})
 @deftypefnx Supplemental void remque (struct qelem *@var{elem})
 
 Routines to manipulate queues built from doubly linked lists.  The
@@ -33,9 +34,7 @@ struct qelem {
 
 
 void
-insque (elem, pred)
-  struct qelem *elem;
-  struct qelem *pred;
+insque (struct qelem *elem, struct qelem *pred)
 {
   elem -> q_forw = pred -> q_forw;
   pred -> q_forw -> q_back = elem;
@@ -45,8 +44,7 @@ insque (elem, pred)
 
 
 void
-remque (elem)
-  struct qelem *elem;
+remque (struct qelem *elem)
 {
   elem -> q_forw -> q_back = elem -> q_back;
   elem -> q_back -> q_forw = elem -> q_forw;