71846b84aa4e4c3b938ebc76ab6de4f7e7913fdd
hiram
  Wed Nov 25 10:48:36 2015 -0800
fixup gcc warnings for -Wunused-but-set-variable refs #16121

diff --git src/hg/lfsOverlap/lfsOverlap.c src/hg/lfsOverlap/lfsOverlap.c
index 94a7f4a..dcf1a32 100644
--- src/hg/lfsOverlap/lfsOverlap.c
+++ src/hg/lfsOverlap/lfsOverlap.c
@@ -209,59 +209,61 @@
         removeRecord = FALSE;
         }
     if ((overlapPercent >= minOverlapPercent) && (removeRecord))
         {
         verbose(4, "remove %s\n",lfs->name);
         slRemoveEl(lfsList, lfs);
         }
     }
 }
 
 void removeOverlap(int lfsSize , struct lfsStub *lfsList)
 /* pick highest scoring record from each overlapping cluster
  * then remove all overlapping records and call recursively
  * return list of best scoring records in each cluster */
 {
-struct lfsStub *lfs, *bestMatch = NULL, *prevLfs = NULL;
+struct lfsStub *lfs, *bestMatch = NULL;
+// struct lfsStub *prevLfs = NULL;  unused
 bool first = TRUE;
-int prevStart = 0, prevEnd = 0;
+int prevEnd = 0;
+// int prevStart = 0, prevEnd = 0;  unused
 int bestScore = 0;
                                                                                 
 if (lfsList == NULL)
     return;
                                                                                 
 verbose(4, "list now %d\n",slCount(lfsList));
 for (lfs = lfsList; lfs != NULL; lfs = lfs->next)
     {
     int start = lfs->chromStart;
     int end = lfs->chromEnd;
     int score = lfs->score;
     if (first || start <= prevEnd )
         {
         if (first)
             {
-            prevStart = start;
+//            prevStart = start;  unused
             prevEnd = end;
             first = FALSE;
             }
         if (score > bestScore)
             {
             bestMatch = lfs;
             bestScore = score;
             }
         prevEnd = max(prevEnd, end);
-        prevLfs = lfs;
+//        prevLfs = lfs;  unused
         }
     else
         break;
     }
 if (bestMatch != NULL)
     {
     slRemoveEl(&lfsList, bestMatch);
     slAddHead(&outList, bestMatch);
     verbose(4, "add to outList %d count %d\n",slCount(outList), outCall++);
     if (lfsList != NULL)
         {
         verbose(4, "before pare %d\n",slCount(lfsList));
         /* remove elements from the list that overlap the best match */
         pareList(&lfsList, bestMatch);
         verbose(4, "after  pare %d\n",slCount(lfsList));