Initial revision.
This commit is contained in:
curt
@@ -0,0 +1,370 @@
|
||||
|
||||
#include "sl.h"
|
||||
|
||||
slScheduler *slScheduler::current = NULL ;
|
||||
|
||||
void slScheduler::init ()
|
||||
{
|
||||
current = this ;
|
||||
|
||||
if ( not_working () )
|
||||
{
|
||||
fprintf ( stderr, "slScheduler: soundcard init failed.\n" ) ;
|
||||
setError () ;
|
||||
return ;
|
||||
}
|
||||
|
||||
if ( getBps() != 8 )
|
||||
{
|
||||
fprintf ( stderr, "slScheduler: Needs a sound card that supports 8 bits per sample.\n" ) ;
|
||||
setError () ;
|
||||
return ;
|
||||
}
|
||||
|
||||
if ( getStereo() )
|
||||
{
|
||||
fprintf ( stderr, "slScheduler: Needs a sound card that supports monophonic replay.\n" ) ;
|
||||
setError () ;
|
||||
return ;
|
||||
}
|
||||
|
||||
for ( int i = 0 ; i < SL_MAX_SAMPLES ; i++ )
|
||||
samplePlayer [ i ] = NULL ;
|
||||
|
||||
amount_left = 0 ;
|
||||
now = 0 ;
|
||||
num_pending_callbacks = 0 ;
|
||||
safety_margin = 1.0 ;
|
||||
|
||||
mixer = NULL ;
|
||||
mixer_buffer = NULL ;
|
||||
spare_buffer1 [ 0 ] = NULL ;
|
||||
spare_buffer1 [ 1 ] = NULL ;
|
||||
spare_buffer1 [ 2 ] = NULL ;
|
||||
spare_buffer2 [ 0 ] = NULL ;
|
||||
spare_buffer2 [ 1 ] = NULL ;
|
||||
spare_buffer2 [ 2 ] = NULL ;
|
||||
|
||||
initBuffers () ;
|
||||
}
|
||||
|
||||
void slScheduler::initBuffers ()
|
||||
{
|
||||
if ( not_working () ) return ;
|
||||
|
||||
delete mixer_buffer ;
|
||||
delete spare_buffer1 [ 0 ] ;
|
||||
delete spare_buffer1 [ 1 ] ;
|
||||
delete spare_buffer1 [ 2 ] ;
|
||||
delete spare_buffer2 [ 0 ] ;
|
||||
delete spare_buffer2 [ 1 ] ;
|
||||
delete spare_buffer2 [ 2 ] ;
|
||||
|
||||
mixer_buffer_size = getDriverBufferSize () ;
|
||||
|
||||
mixer_buffer = new Uchar [ mixer_buffer_size ] ;
|
||||
memset ( mixer_buffer, 0x80, mixer_buffer_size ) ;
|
||||
|
||||
spare_buffer1 [ 0 ] = new Uchar [ mixer_buffer_size ] ;
|
||||
spare_buffer1 [ 1 ] = new Uchar [ mixer_buffer_size ] ;
|
||||
spare_buffer1 [ 2 ] = new Uchar [ mixer_buffer_size ] ;
|
||||
|
||||
spare_buffer2 [ 0 ] = new Uchar [ mixer_buffer_size ] ;
|
||||
spare_buffer2 [ 1 ] = new Uchar [ mixer_buffer_size ] ;
|
||||
spare_buffer2 [ 2 ] = new Uchar [ mixer_buffer_size ] ;
|
||||
}
|
||||
|
||||
slScheduler::~slScheduler ()
|
||||
{
|
||||
if ( current == this )
|
||||
current = NULL ;
|
||||
|
||||
delete mixer_buffer ;
|
||||
|
||||
delete spare_buffer1 [ 0 ] ;
|
||||
delete spare_buffer1 [ 1 ] ;
|
||||
delete spare_buffer1 [ 2 ] ;
|
||||
delete spare_buffer2 [ 0 ] ;
|
||||
delete spare_buffer2 [ 1 ] ;
|
||||
delete spare_buffer2 [ 2 ] ;
|
||||
}
|
||||
|
||||
Uchar *slScheduler::mergeBlock ( Uchar *d )
|
||||
{
|
||||
register int l = amount_left ;
|
||||
amount_left = 0 ;
|
||||
memset ( d, 0x80, l ) ;
|
||||
|
||||
return d + l ;
|
||||
}
|
||||
|
||||
|
||||
Uchar *slScheduler::mergeBlock ( Uchar *d, slSamplePlayer *spa )
|
||||
{
|
||||
register int l = spa -> getAmountLeft () ;
|
||||
|
||||
if ( l > amount_left )
|
||||
l = amount_left ;
|
||||
|
||||
amount_left -= l ;
|
||||
|
||||
memcpy ( d, spa->read(l, spare_buffer1[0], spare_buffer2[0]), l ) ;
|
||||
|
||||
return d + l ;
|
||||
}
|
||||
|
||||
|
||||
Uchar *slScheduler::mergeBlock ( Uchar *d, slSamplePlayer *spa, slSamplePlayer *spb )
|
||||
{
|
||||
int la = spa -> getAmountLeft () ;
|
||||
int lb = spb -> getAmountLeft () ;
|
||||
|
||||
register int l = ( la < lb ) ? la : lb ;
|
||||
|
||||
if ( l > amount_left )
|
||||
l = amount_left ;
|
||||
|
||||
amount_left -= l ;
|
||||
|
||||
register Uchar *a = spa -> read ( l, spare_buffer1[0], spare_buffer2[0] ) ;
|
||||
register Uchar *b = spb -> read ( l, spare_buffer1[1], spare_buffer2[1] ) ;
|
||||
|
||||
while ( l-- ) *d++ = mix ( *a++, *b++ ) ;
|
||||
|
||||
return d ;
|
||||
}
|
||||
|
||||
Uchar *slScheduler::mergeBlock ( Uchar *d, slSamplePlayer *spa, slSamplePlayer *spb, slSamplePlayer *spc )
|
||||
{
|
||||
int la = spa -> getAmountLeft () ;
|
||||
int lb = spb -> getAmountLeft () ;
|
||||
int lc = spc -> getAmountLeft () ;
|
||||
|
||||
register int l = ( la < lb ) ?
|
||||
(( la < lc ) ? la : lc ) :
|
||||
(( lb < lc ) ? lb : lc ) ;
|
||||
|
||||
if ( l > amount_left )
|
||||
l = amount_left ;
|
||||
|
||||
amount_left -= l ;
|
||||
|
||||
register Uchar *a = spa -> read ( l, spare_buffer1[0], spare_buffer2[0] ) ;
|
||||
register Uchar *b = spb -> read ( l, spare_buffer1[1], spare_buffer2[1] ) ;
|
||||
register Uchar *c = spc -> read ( l, spare_buffer1[2], spare_buffer2[2] ) ;
|
||||
|
||||
while ( l-- ) *d++ = mix ( *a++, *b++, *c++ ) ;
|
||||
|
||||
return d ;
|
||||
}
|
||||
|
||||
|
||||
void slScheduler::mixBuffer ()
|
||||
{
|
||||
register Uchar *d = mixer_buffer ;
|
||||
|
||||
amount_left = mixer_buffer_size ;
|
||||
|
||||
while ( amount_left > 0 )
|
||||
d = mergeBlock ( d ) ;
|
||||
}
|
||||
|
||||
|
||||
void slScheduler::mixBuffer ( slSamplePlayer *spa )
|
||||
{
|
||||
register Uchar *d = mixer_buffer ;
|
||||
|
||||
amount_left = mixer_buffer_size ;
|
||||
|
||||
while ( amount_left > 0 )
|
||||
{
|
||||
int la = spa -> getAmountLeft () ;
|
||||
|
||||
if ( la > 0 ) /* Buffer has data left... */
|
||||
d = mergeBlock ( d, spa ) ;
|
||||
else /* Buffer is empty */
|
||||
d = mergeBlock ( d ) ;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void slScheduler::mixBuffer ( slSamplePlayer *spa, slSamplePlayer *spb )
|
||||
{
|
||||
register Uchar *d = mixer_buffer ;
|
||||
amount_left = mixer_buffer_size ;
|
||||
|
||||
while ( amount_left > 0 )
|
||||
{
|
||||
int la = spa -> getAmountLeft () ;
|
||||
int lb = spb -> getAmountLeft () ;
|
||||
|
||||
if ( la > 0 && lb > 0 ) /* Both buffers have data left... */
|
||||
d = mergeBlock ( d, spa, spb ) ;
|
||||
else
|
||||
if ( la > 0 && lb <= 0 ) /* Only the A buffer has data left... */
|
||||
d = mergeBlock ( d, spa ) ;
|
||||
else
|
||||
if ( la <= 0 && lb > 0 ) /* Only the B buffer has data left... */
|
||||
d = mergeBlock ( d, spb ) ;
|
||||
else /* Both buffers are empty */
|
||||
d = mergeBlock ( d ) ;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
||||
void slScheduler::mixBuffer ( slSamplePlayer *spa, slSamplePlayer *spb,
|
||||
slSamplePlayer *spc )
|
||||
{
|
||||
register Uchar *d = mixer_buffer ;
|
||||
|
||||
amount_left = mixer_buffer_size ;
|
||||
|
||||
while ( amount_left > 0 )
|
||||
{
|
||||
int la = spa -> getAmountLeft () ;
|
||||
int lb = spb -> getAmountLeft () ;
|
||||
int lc = spc -> getAmountLeft () ;
|
||||
|
||||
if ( lc > 0 ) /* C buffer has data left... */
|
||||
{
|
||||
if ( la > 0 && lb > 0 ) /* All three buffers have data left... */
|
||||
d = mergeBlock ( d, spa, spb, spc ) ;
|
||||
else
|
||||
if ( la > 0 && lb <= 0 ) /* Only the A&C buffers have data left... */
|
||||
d = mergeBlock ( d, spa, spc ) ;
|
||||
else
|
||||
if ( la <= 0 && lb > 0 ) /* Only the B&C buffers have data left... */
|
||||
d = mergeBlock ( d, spb, spc ) ;
|
||||
else /* Only the C buffer has data left */
|
||||
d = mergeBlock ( d, spc ) ;
|
||||
}
|
||||
else
|
||||
{
|
||||
if ( la > 0 && lb > 0 ) /* Only the A&B buffers have data left... */
|
||||
d = mergeBlock ( d, spa, spb ) ;
|
||||
else
|
||||
if ( la > 0 && lb <= 0 ) /* Only the A buffer has data left... */
|
||||
d = mergeBlock ( d, spa ) ;
|
||||
else
|
||||
if ( la <= 0 && lb > 0 ) /* Only the B buffer has data left... */
|
||||
d = mergeBlock ( d, spb ) ;
|
||||
else /* All three buffers are empty */
|
||||
d = mergeBlock ( d ) ;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void slScheduler::realUpdate ( int dump_first )
|
||||
{
|
||||
int i ;
|
||||
|
||||
if ( not_working () )
|
||||
return ;
|
||||
|
||||
while ( secondsUsed() <= safety_margin )
|
||||
{
|
||||
slSamplePlayer *psp [ 3 ] ;
|
||||
int pri [ 3 ] ;
|
||||
|
||||
pri [ 0 ] = pri [ 1 ] = pri [ 2 ] = -1 ;
|
||||
|
||||
for ( i = 0 ; i < SL_MAX_SAMPLES ; i++ )
|
||||
{
|
||||
if ( samplePlayer [ i ] == NULL )
|
||||
continue ;
|
||||
|
||||
/* Clean up dead sample players */
|
||||
|
||||
if ( samplePlayer [ i ] -> isDone () )
|
||||
{
|
||||
delete samplePlayer [ i ] ;
|
||||
samplePlayer [ i ] = NULL ;
|
||||
continue ;
|
||||
}
|
||||
|
||||
if ( samplePlayer [ i ] -> isPaused () )
|
||||
continue ;
|
||||
|
||||
int lowest = ( pri [0] <= pri [2] ) ?
|
||||
(( pri [0] <= pri [1] ) ? 0 : 1 ) :
|
||||
(( pri [1] <= pri [2] ) ? 1 : 2 ) ;
|
||||
|
||||
if ( samplePlayer[i]->getPriority() > pri[lowest] )
|
||||
{
|
||||
psp[lowest] = samplePlayer[i] ;
|
||||
pri[lowest] = samplePlayer[i]->getPriority() ;
|
||||
}
|
||||
}
|
||||
|
||||
for ( i = 0 ; i < SL_MAX_SAMPLES ; i++ )
|
||||
{
|
||||
if ( samplePlayer [ i ] == NULL )
|
||||
continue ;
|
||||
|
||||
if ( ! samplePlayer [ i ] -> isPaused () &&
|
||||
samplePlayer [ i ] != psp[0] &&
|
||||
samplePlayer [ i ] != psp[1] &&
|
||||
samplePlayer [ i ] != psp[2] )
|
||||
{
|
||||
samplePlayer [ i ] -> preempt ( mixer_buffer_size ) ;
|
||||
}
|
||||
}
|
||||
|
||||
if ( pri[0] < 0 ) mixBuffer () ; else
|
||||
if ( pri[1] < 0 ) mixBuffer ( psp[0] ) ; else
|
||||
if ( pri[2] < 0 ) mixBuffer ( psp[0], psp[1] ) ; else
|
||||
mixBuffer ( psp[0], psp[1], psp[2] ) ;
|
||||
|
||||
if ( dump_first )
|
||||
{
|
||||
stop () ;
|
||||
dump_first = SL_FALSE ;
|
||||
}
|
||||
|
||||
play ( mixer_buffer, mixer_buffer_size ) ;
|
||||
|
||||
now += mixer_buffer_size ;
|
||||
}
|
||||
|
||||
flushCallBacks () ;
|
||||
}
|
||||
|
||||
void slScheduler::addCallBack ( slCallBack c, slSample *s, slEvent e, int m )
|
||||
{
|
||||
if ( num_pending_callbacks >= SL_MAX_CALLBACKS )
|
||||
{
|
||||
fprintf ( stderr, "slScheduler: Too many pending callback events!\n" ) ;
|
||||
return ;
|
||||
}
|
||||
|
||||
slPendingCallBack *p = & ( pending_callback [ num_pending_callbacks++ ] ) ;
|
||||
|
||||
p -> callback = c ;
|
||||
p -> sample = s ;
|
||||
p -> event = e ;
|
||||
p -> magic = m ;
|
||||
}
|
||||
|
||||
void slScheduler::flushCallBacks ()
|
||||
{
|
||||
/*
|
||||
Execute all the callbacks that we accumulated
|
||||
in this iteration.
|
||||
|
||||
This is done at the end of 'update' to reduce the risk
|
||||
of nasty side-effects caused by 'unusual' activities
|
||||
in the application's callback function.
|
||||
*/
|
||||
|
||||
while ( num_pending_callbacks > 0 )
|
||||
{
|
||||
slPendingCallBack *p = & ( pending_callback [ --num_pending_callbacks ] ) ;
|
||||
|
||||
if ( p -> callback )
|
||||
(*(p->callback))( p->sample, p->event, p->magic ) ;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user