Indented with src/scripts/indent-emp.

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

diff --git a/src/lib/as/as_stats.c b/src/lib/as/as_stats.c
index 6c93fd128053f4fab9fce58e15e3bd982f0216d3..af47a26fa13f0e740ccf0d7a01a68e04261f53c3 100644 (file)
--- a/src/lib/as/as_stats.c
+++ b/src/lib/as/as_stats.c
@@ -21,53 +21,55 @@
 #include "as.h"
 
 #if !defined(lint) && !defined(SABER)
-static char    sccsid[] = "@(#)as_stats.c      1.2     11/13/90";
+static char sccsid[] = "@(#)as_stats.c 1.2     11/13/90";
 #endif /* not lint */
 
 /*
  * Print statistics on algorithm performance to the file pointer "fp".
  */
 void
-as_stats(struct as_data *adp, FILE *fp)
+as_stats(struct as_data *adp, FILE * fp)
 {
-       int             i;
-       int             j;
-       int             total_q;
-       int             total_h;
-       struct as_queue *qp;
-       struct as_hash  *hp;
+    int i;
+    int j;
+    int total_q;
+    int total_h;
+    struct as_queue *qp;
+    struct as_hash *hp;
 
-       fprintf(fp, "Statistics:\n");
+    fprintf(fp, "Statistics:\n");
 
-       fprintf(fp, "queue lengths:\n");
-       total_q = 0;
-       total_h = 0;
-       for (i = 0, qp = adp->head; qp; qp = qp->next)
-               i++;
-       fprintf(fp, "\tmain:\t%d\n", i);
-       total_q += i;
-       for (i = 0, qp = adp->tried; qp; qp = qp->next)
-               i++;
-       fprintf(fp, "\ttried:\t%d\n", i);
-       total_q += i;
-       for (i = 0, qp = adp->subsumed; qp; qp = qp->next)
-               i++;
-       fprintf(fp, "\tsubsumed:\t%d\n", i);
-       total_q += i;
-       fprintf(fp, "hash table statistics (size %d):\n", adp->hashsize);
-       for (i = 0; i < adp->hashsize; i++) {
-               for (j = 0, hp = adp->hashtab[i]; hp; hp = hp->next)
-                       j++;
-               fprintf(fp, "\t%d\t%d\n", i, j);
-               total_h += j;
-       }
-       fprintf(fp, "\ttotal\t%d\n", total_h);
-       fprintf(fp, "approximate memory usage (bytes):\n");
-       fprintf(fp, "\tqueues\t%d\n", (int)(total_q * sizeof (struct as_queue)));
-       fprintf(fp, "\tnodes\t%d\n", (int)(total_q * sizeof (struct as_node)));
-       fprintf(fp, "\thash ents\t%d\n", (int)(total_h * sizeof (struct as_hash)));
-       fprintf(fp, "\ttotal\t%d\n",
-                       (int)(total_q * sizeof (struct as_queue) +
-                                 total_q * sizeof (struct as_node) +
-                                 total_h * sizeof (struct as_hash)));
+    fprintf(fp, "queue lengths:\n");
+    total_q = 0;
+    total_h = 0;
+    for (i = 0, qp = adp->head; qp; qp = qp->next)
+       i++;
+    fprintf(fp, "\tmain:\t%d\n", i);
+    total_q += i;
+    for (i = 0, qp = adp->tried; qp; qp = qp->next)
+       i++;
+    fprintf(fp, "\ttried:\t%d\n", i);
+    total_q += i;
+    for (i = 0, qp = adp->subsumed; qp; qp = qp->next)
+       i++;
+    fprintf(fp, "\tsubsumed:\t%d\n", i);
+    total_q += i;
+    fprintf(fp, "hash table statistics (size %d):\n", adp->hashsize);
+    for (i = 0; i < adp->hashsize; i++) {
+       for (j = 0, hp = adp->hashtab[i]; hp; hp = hp->next)
+           j++;
+       fprintf(fp, "\t%d\t%d\n", i, j);
+       total_h += j;
+    }
+    fprintf(fp, "\ttotal\t%d\n", total_h);
+    fprintf(fp, "approximate memory usage (bytes):\n");
+    fprintf(fp, "\tqueues\t%d\n",
+           (int)(total_q * sizeof(struct as_queue)));
+    fprintf(fp, "\tnodes\t%d\n", (int)(total_q * sizeof(struct as_node)));
+    fprintf(fp, "\thash ents\t%d\n",
+           (int)(total_h * sizeof(struct as_hash)));
+    fprintf(fp, "\ttotal\t%d\n",
+           (int)(total_q * sizeof(struct as_queue) +
+                 total_q * sizeof(struct as_node) +
+                 total_h * sizeof(struct as_hash)));
 }