Index: /branches/eam_branches/ipp-20140904/Ohana/src/libdvo/src/HostTable.c
===================================================================
--- /branches/eam_branches/ipp-20140904/Ohana/src/libdvo/src/HostTable.c	(revision 37595)
+++ /branches/eam_branches/ipp-20140904/Ohana/src/libdvo/src/HostTable.c	(revision 37596)
@@ -47,5 +47,4 @@
     free (table->hosts);
   }
-  if (table->index) free (table->index);
   free (table);
   return;
@@ -155,4 +154,5 @@
   // identify the unique host names and the number of times they each exist
   // (Host tables are not very large; I can afford to do this in an inefficient way)
+  int i, j, k;
 
   int Nunique = 0;
@@ -164,5 +164,5 @@
 
   for (i = 0; i < table->Nhosts; i++) {
-    found = FALSE;
+    int found = FALSE;
     for (j = 0; !found && (j < Nunique); j++) {
       if (!strcmp(table->hosts[i].hostname, unique_hosts[j])) {
@@ -194,7 +194,7 @@
   for (i = 0; i < Ngroups; i++) {
     groups[i].Nhosts = 0;
-    ALLOCATE (groups[i].hosts, HostTable *, Nunique);
+    ALLOCATE (groups[i].hosts, HostInfo *, Nunique);
     for (j = 0; j < Nunique; j++) {
-      found = FALSE;
+      int found = FALSE;
       for (k = 0; !found && (k < table->Nhosts); k++) {
 	if (foundHost[k]) continue;