If our closest seek point is not the last one, we only need to search between it and the next one. The section below calculates an appropriate starting
value for byteRangeHi which will clamp it appropriately.
Note that the next seekpoint must have an offset greater than the closest seekpoint because otherwise our binary search algorithm will break down. There
have been cases where a seektable consists of seek points where every byte offset is set to 0 which causes problems. If this happens we need to abort.
*/
if(iClosestSeekpoint<pFlac->seekpointCount-1){
if(pFlac->pSeekpoints[iClosestSeekpoint+1].firstPCMFrame!=(((drflac_uint64)0xFFFFFFFF<<32)|0xFFFFFFFF)){/* Is it a placeholder seekpoint. */
byteRangeHi=pFlac->firstFLACFramePosInBytes+pFlac->pSeekpoints[iClosestSeekpoint+1].flacFrameOffset-1;/* Must be zero based. */
drflac_uint32iNextSeekpoint=iClosestSeekpoint+1;
/* Basic validation on the seekpoints to ensure they're usable. */