#include <AudioIO.h>

Collaboration diagram for AudioIoCallback::TimeQueue:

Classes
struct	Cursor

Public Member Functions
void	Producer (const PlaybackSchedule &schedule, double rate, double scrubSpeed, size_t nSamples)

double	Consumer (size_t nSamples, double rate)

Public Attributes
Doubles	mData

size_t	mSize { 0 }

double	mLastTime {}

NonInterfering< Cursor >	mHead

NonInterfering< Cursor >	mTail

Detailed Description

Definition at line 455 of file AudioIO.h.

Member Function Documentation

◆ Consumer()

double AudioIO::TimeQueue::Consumer	(	size_t	nSamples,
		double	rate
	)

Definition at line 3565 of file AudioIO.cpp.

 {
    if ( ! mData ) {
       // Recording only.  No scrub or playback time warp.  Don't use the queue.
       return ( mLastTime += nSamples / rate );
    }
  
    // Don't check available space:  assume it is enough because of coordination
    // with RingBuffer.
    auto remainder = mHead.mRemainder;
    auto space = TimeQueueGrainSize - remainder;
    if ( nSamples >= space ) {
       remainder = 0,
       mHead.mIndex = (mHead.mIndex + 1) % mSize,
       nSamples -= space;
       if ( nSamples >= TimeQueueGrainSize )
          mHead.mIndex =
             (mHead.mIndex + ( nSamples / TimeQueueGrainSize ) ) % mSize,
          nSamples %= TimeQueueGrainSize;
    }
    mHead.mRemainder = remainder + nSamples;
    return mData[ mHead.mIndex ];
 }

References TimeQueueGrainSize.

Referenced by AudioIoCallback::UpdateTimePosition().

Here is the caller graph for this function:

◆ Producer()

void AudioIO::TimeQueue::Producer	(	const PlaybackSchedule &	schedule,
		double	rate,
		double	scrubSpeed,
		size_t	nSamples
	)

Definition at line 3532 of file AudioIO.cpp.

 {
    if ( ! mData )
       // Recording only.  Don't fill the queue.
       return;
  
    // Don't check available space:  assume it is enough because of coordination
    // with RingBuffer.
    auto index = mTail.mIndex;
    auto time = mLastTime;
    auto remainder = mTail.mRemainder;
    auto space = TimeQueueGrainSize - remainder;
  
    while ( nSamples >= space ) {
       time = schedule.AdvancedTrackTime( time, space / rate, scrubSpeed );
       index = (index + 1) % mSize;
       mData[ index ] = time;
       nSamples -= space;
       remainder = 0;
       space = TimeQueueGrainSize;
    }
  
    // Last odd lot
    if ( nSamples > 0 )
       time = schedule.AdvancedTrackTime( time, nSamples / rate, scrubSpeed );
  
    mLastTime = time;
    mTail.mRemainder = remainder + nSamples;
    mTail.mIndex = index;
 }