e82710c932466ad56434e0a33dcfcd415606795a
jcasper
  Sat Feb 22 11:59:05 2025 -0800
Minor change to get txGeneExplainUpdate2 compiling again, refs #35189

diff --git src/hg/txGene/txGeneExplainUpdate2/txGeneExplainUpdate2.c src/hg/txGene/txGeneExplainUpdate2/txGeneExplainUpdate2.c
index 89d115d28ff..e77af5cd40b 100644
--- src/hg/txGene/txGeneExplainUpdate2/txGeneExplainUpdate2.c
+++ src/hg/txGene/txGeneExplainUpdate2/txGeneExplainUpdate2.c
@@ -49,31 +49,31 @@
 	if (bedExactMatch(oldBed, newBed))
 	    {
 	    matchingBed = newBed;
 	    break;
 	    }
 	}
     }
 slFreeList(&binList);
 return matchingBed;
 }
 
 struct bed *findCompatible(struct bed *oldBed, struct hash *newAccHash)
 /* Find bed in newHash with same accession (but maybe different version) */
 {
 char accOnly[64];
-safef(accOnly, sizeof(accOnly), oldBed->name);
+safef(accOnly, sizeof(accOnly), "%s", oldBed->name);
 chopSuffix(accOnly);
 return hashFindVal(newAccHash, accOnly);
 }
 
 struct bed *findMostOverlapping(struct bed *bed, struct hash *keeperHash)
 /* Try find most overlapping thing to bed in keeper hash. */
 {
 struct bed *bestBed = NULL;
 int bestOverlap = 0;
 struct binKeeper *bk = hashFindVal(keeperHash, bed->chrom);
 if (bk == NULL)
     return NULL;
 struct binElement *bin, *binList = binKeeperFind(bk, bed->chromStart, bed->chromEnd);
 for (bin = binList; bin != NULL; bin = bin->next)
     {
@@ -182,31 +182,31 @@
 /* Write out a line explaining why old gene has gone missing. */
 {
 char *note = diffNote(oldBed, newBed);
 fprintf(f, "%s\t%s\t%d\t%d\t%s\t%s\t%s\n", oldBed->name, oldBed->chrom, 
 	oldBed->chromStart, oldBed->chromEnd, newBed->name, type, note);
 }
 
 struct hash *makeAccHash(struct bed *list)
 /* Make hash keyed by accession (without version) with beds for values. */
 {
 struct bed *bed;
 struct hash *hash = hashNew(16);
 for (bed = list; bed != NULL; bed = bed->next)
     {
     char accOnly[64];
-    safef(accOnly, sizeof(accOnly), bed->name);
+    safef(accOnly, sizeof(accOnly), "%s", bed->name);
     chopSuffix(accOnly);
     hashAdd(hash, accOnly, bed);
     }
 return hash;
 }
 
 struct hash *hashBedList(struct bed *list)
 /* Make hash keyed by bed->name with bed values. */
 {
 struct bed *bed;
 struct hash *hash = hashNew(16);
 for (bed = list; bed != NULL; bed = bed->next)
     hashAdd(hash, bed->name, bed);
 return hash;
 }