New path finder

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

diff --git a/src/lib/as/as_hash.c b/src/lib/as/as_hash.c
index 8e4b971352504f907be3d49f755c1ab61df4b341..c211befca9a311453ccd0b75acd30ab6410cb7c9 100644 (file)
--- a/src/lib/as/as_hash.c
+++ b/src/lib/as/as_hash.c
@@ -17,14 +17,12 @@
  *  along with this program; if not, write to the Free Software
  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  */
-#include <stdio.h>
+
+#include <config.h>
+
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char    sccsid[] = "@(#)as_hash.c       1.2     11/13/90";
-#endif /* not lint */
-
 /*
  * Return a pointer to the as_queue structure associated with
  * this coordinate if the coordinate is in the queue.
@@ -32,16 +30,16 @@ static      char    sccsid[] = "@(#)as_hash.c       1.2     11/13/90";
 struct as_queue *
 as_iscinq(struct as_data *adp, struct as_coord c)
 {
-       int             hashval;
-       struct as_hash  *hp;
+    int hashval;
+    struct as_hash *hp;
 
-       hashval = (*adp->hash)(c) % adp->hashsize;
+    hashval = adp->hash(c) % adp->hashsize;
 
-       for (hp = adp->hashtab[hashval]; hp; hp = hp->next)
-               if (hp->c.x == c.x && hp->c.y == c.y)
-                               return (hp->qp);
+    for (hp = adp->hashtab[hashval]; hp; hp = hp->next)
+       if (hp->c.x == c.x && hp->c.y == c.y)
+           return hp->qp;
 
-       return (NULL);
+    return NULL;
 }
 
 /*
@@ -50,19 +48,19 @@ as_iscinq(struct as_data *adp, struct as_coord c)
 void
 as_setcinq(struct as_data *adp, struct as_coord c, struct as_queue *qp)
 {
-       int             hashval;
-       struct as_hash  *hp;
-       struct as_hash  *new;
+    int hashval;
+    struct as_hash *hp;
+    struct as_hash *new;
 
-       new = (struct as_hash *)malloc(sizeof(struct as_hash));
-       new->c = c;
-       new->qp = qp;
+    new = (struct as_hash *)malloc(sizeof(struct as_hash));
+    new->c = c;
+    new->qp = qp;
 
-       hashval = (*adp->hash)(c) % adp->hashsize;
-       hp = adp->hashtab[hashval];
+    hashval = adp->hash(c) % adp->hashsize;
+    hp = adp->hashtab[hashval];
 
-       new->next = (hp) ? hp : NULL;
-       adp->hashtab[hashval] = new;
+    new->next = (hp) ? hp : NULL;
+    adp->hashtab[hashval] = new;
 }
 
 /*
@@ -72,14 +70,14 @@ as_setcinq(struct as_data *adp, struct as_coord c, struct as_queue *qp)
 void
 as_free_hashtab(struct as_data *adp)
 {
-       int             i;
-       struct as_hash  *hp, *hp2;
+    int i;
+    struct as_hash *hp, *hp2;
 
-       for (i = 0; i < adp->hashsize; i++) {
-               for (hp = adp->hashtab[i]; hp; hp = hp2) {
-                       hp2 = hp->next;
-                       free((char *)hp);
-               }
-               adp->hashtab[i] = NULL;
+    for (i = 0; i < adp->hashsize; i++) {
+       for (hp = adp->hashtab[i]; hp; hp = hp2) {
+           hp2 = hp->next;
+           free(hp);
        }
+       adp->hashtab[i] = NULL;
+    }
 }