4d4c0c47811a5c33fec75e98a44fc185f09941d4
hiram
  Thu Nov 21 13:57:01 2013 -0800
there is a macro INLINE for static inline refs #12189
diff --git src/lib/cirTree.c src/lib/cirTree.c
index 61b7523..8004ee8 100644
--- src/lib/cirTree.c
+++ src/lib/cirTree.c
@@ -439,49 +439,49 @@
 freez(pCrt);
 }
 
 void cirTreeFileClose(struct cirTreeFile **pCrt)
 /* Close and free up cirTree file opened with cirTreeFileAttach. */
 {
 struct cirTreeFile *crt = *pCrt;
 if (crt != NULL)
     {
     freez(&crt->fileName);
     udcFileClose(&crt->udc);
     cirTreeFileDetach(pCrt);
     }
 }
 
-static inline int cmpTwoBits32(bits32 aHi, bits32 aLo, bits32 bHi, bits32 bLo)
+INLINE int cmpTwoBits32(bits32 aHi, bits32 aLo, bits32 bHi, bits32 bLo)
 /* Return - if b is less than a , 0 if equal, else +*/
 {
 if (aHi < bHi)
     return 1;
 else if (aHi > bHi)
     return -1;
 else
     {
     if (aLo < bLo)
        return 1;
     else if (aLo > bLo)
        return -1;
     else
        return 0;
     }
 }
 
-static inline boolean cirTreeOverlaps(int qChrom, int qStart, int qEnd, 
+INLINE boolean cirTreeOverlaps(int qChrom, int qStart, int qEnd, 
 	int rStartChrom, int rStartBase, int rEndChrom, int rEndBase)
 {
 return cmpTwoBits32(qChrom, qStart, rEndChrom, rEndBase) > 0 &&
        cmpTwoBits32(qChrom, qEnd, rStartChrom, rStartBase) < 0;
 }
 
 static void rFindOverlappingBlocks(struct cirTreeFile *crt, int level, bits64 indexFileOffset,
 	bits32 chromIx, bits32 start, bits32 end, struct fileOffsetSize **retList)
 /* Recursively find blocks with data. */
 {
 struct udcFile *udc = crt->udc;
 
 /* Seek to start of block. */
 udcSeek(udc, indexFileOffset);