1d76bf881d3e18580739e44698a0d1a499c2f9f1
hiram
  Fri Oct 2 10:31:39 2015 -0700
fixup gcc warnings for -Wunused-but-set-variable refs #16121

diff --git src/lib/codebias.c src/lib/codebias.c
index 9de37b4..325a358 100644
--- src/lib/codebias.c
+++ src/lib/codebias.c
@@ -89,31 +89,30 @@
 {
 int i;
 int val;
 for (i=0; i<dnaSize; ++i)
     {
     if ((val = ntVal[(int)dna[i]]) < 0)
         dna[i] = 't';
     }
 }
 
 int codonFindFrame(DNA *dna, int dnaSize, struct codonBias *forBias)
 /* Assuming a stretch of DNA is an exon, find most likely frame that it's in. 
  * Beware this routine will replace N's with T's in the input dna.*/
 {
 double logOneFourth = log(0.25);
-double logProbs[3];
 int frame;
 int dnaIx;
 double logP;
 double bestLogP = -0x6fffffff;
 int bestFrame = -1;
 int lastDnaStart = dnaSize-3;
 DNA *d;
 int codon = 0, lastCodon; 
 
 unN(dna, dnaSize);
 for (frame=0; frame<3; ++frame)
     {
     /* Partial first codon just gets even background score. */
     logP = frame*logOneFourth;
     /* 1st order model on first full codon. */
@@ -121,27 +120,26 @@
         {
         d = dna+frame;
         codon = (ntVal[(int)d[0]]<<4) + (ntVal[(int)d[1]]<<2) + ntVal[(int)d[2]];
         logP += forBias->mark0[codon];
         }
     /* 2nd order model on subsequent full codons. */
     for (dnaIx = frame+3; dnaIx <= lastDnaStart; dnaIx += 3)
         {
         lastCodon = codon;
         d = dna+dnaIx;
         codon = (ntVal[(int)d[0]]<<4) + (ntVal[(int)d[1]]<<2) + ntVal[(int)d[2]];
         logP += forBias->mark1[lastCodon][codon];
         }
     /* Partial last codon gets even background score. */
     logP += (dnaSize-dnaIx)*logOneFourth;
-    logProbs[frame] = logP;
     if (logP > bestLogP)
         {
         bestLogP = logP;
         bestFrame = frame;
         }
     }
 return bestFrame;
 }