Indented with src/scripts/indent-emp.

[empserver] / src / lib / as / as_merge.c

diff --git a/src/lib/as/as_merge.c b/src/lib/as/as_merge.c
index 531b474cd61f3535f3787f586da310801e6a7254..835495426b8ee42ec86ecb1a1579338a15652f79 100644 (file)
--- a/src/lib/as/as_merge.c
+++ b/src/lib/as/as_merge.c
@@ -22,7 +22,7 @@
 #include "as.h"
 
 #if !defined(lint) && !defined(SABER)
-static char    sccsid[] = "@(#)as_merge.c      1.2     11/13/90";
+static char sccsid[] = "@(#)as_merge.c 1.2     11/13/90";
 #endif /* not lint */
 
 /*
@@ -30,55 +30,56 @@ static      char    sccsid[] = "@(#)as_merge.c      1.2     11/13/90";
  * both by lower bound cost and then by secondary cost.
  */
 struct as_queue *
-as_merge(struct as_data *adp, struct as_queue *head, struct as_node **neighbors)
+as_merge(struct as_data *adp, struct as_queue *head,
+        struct as_node **neighbors)
 {
-       struct as_queue *qp;
-       struct as_queue *pp;            /* previous pointer */
-       struct as_queue *ip;            /* insert pointer */
-       struct as_node  *np;
-       int             i;
+    struct as_queue *qp;
+    struct as_queue *pp;       /* previous pointer */
+    struct as_queue *ip;       /* insert pointer */
+    struct as_node *np;
+    int i;
 
-       qp = head;
-       pp = NULL;
-       for (i = 0; neighbors[i]; i++) {
-               np = neighbors[i];
-               /* scan until qp points to a node we should go in front of */
-               while (qp && (qp->np->lbcost < np->lbcost)) {
-                       pp = qp;
-                       qp = qp->next;
-               }
-               /* check for equal lower bounds, and use secondary cost if = */
-               if (qp && qp->np->lbcost == np->lbcost) {
-                       while (qp && (qp->np->lbcost == np->lbcost) &&
-                               (qp->np->seccost < np->seccost)) {
-                               pp = qp;
-                               qp = qp->next;
-                       }
-               }
-               AS_NEW_MALLOC(ip, struct as_queue, NULL);
-               /* if there was such a node, insert us in front of it */
-               if (qp) {
-                       ip->prev = qp->prev;
-                       if (ip->prev)
-                               ip->prev->next = ip;
-                       ip->next = qp;
-                       qp->prev = ip;
-                       if (qp == head)
-                               head = ip;
-               } else {        /* otherwise add us to end of queue */
-                       ip->next = NULL;
-                       ip->prev = pp;
-                       if (ip->prev)
-                               ip->prev->next = ip;
-                       else {
-                               head = ip;
-                       }
-                       pp = ip;
-               }
-               ip->np = np;
-               as_setcinq(adp, np->c, ip);
-               np->step++;
+    qp = head;
+    pp = NULL;
+    for (i = 0; neighbors[i]; i++) {
+       np = neighbors[i];
+       /* scan until qp points to a node we should go in front of */
+       while (qp && (qp->np->lbcost < np->lbcost)) {
+           pp = qp;
+           qp = qp->next;
        }
+       /* check for equal lower bounds, and use secondary cost if = */
+       if (qp && qp->np->lbcost == np->lbcost) {
+           while (qp && (qp->np->lbcost == np->lbcost) &&
+                  (qp->np->seccost < np->seccost)) {
+               pp = qp;
+               qp = qp->next;
+           }
+       }
+       AS_NEW_MALLOC(ip, struct as_queue, NULL);
+       /* if there was such a node, insert us in front of it */
+       if (qp) {
+           ip->prev = qp->prev;
+           if (ip->prev)
+               ip->prev->next = ip;
+           ip->next = qp;
+           qp->prev = ip;
+           if (qp == head)
+               head = ip;
+       } else {                /* otherwise add us to end of queue */
+           ip->next = NULL;
+           ip->prev = pp;
+           if (ip->prev)
+               ip->prev->next = ip;
+           else {
+               head = ip;
+           }
+           pp = ip;
+       }
+       ip->np = np;
+       as_setcinq(adp, np->c, ip);
+       np->step++;
+    }
 
-       return (head);
+    return (head);
 }