1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set et sw=2 ts=2: */
/***************************************************************************
* soundplayer.cc
*
* Fri Sep 5 17:31:28 CEST 2014
* Copyright 2014 Bent Bisballe Nyeng
* deva@aasimon.org
****************************************************************************/
/*
* This file is part of Kaiman.
*
* Kaiman is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* Kaiman is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Kaiman; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*/
#include "soundplayer.h"
#include "audiobackend.h"
SoundPlayer::SoundPlayer()
{
start();
pread = 0;
for(int i = 0; i < 10; i++) pwrite[i] = 0;
memset(ringbuffer, 0, sizeof(ringbuffer));
buffer_size = g_audiobackend->getBufferSize();
}
SoundPlayer::~SoundPlayer()
{
running = false;
wait();
}
void SoundPlayer::run()
{
running = true;
short *s = (short*)malloc(buffer_size * sizeof(short));
memset(s, 0, sizeof(s));
while(running) {
for(int i = 0; i < buffer_size; i++) {
s[i] = ringbuffer[pread % RINGBUFFER];
ringbuffer[pread % RINGBUFFER] = 0;
pread++;
}
g_audiobackend->write((const char *)s, buffer_size * sizeof(short));
}
free(s);
}
void SoundPlayer::playSamples(int peer, const char *pcm, size_t size)
{
// printf("%d\t%d\t(diff: %d)\n", pwrite[peer], pread, pwrite[peer] - pread);
if(pwrite[peer] < pread) {
pwrite[peer] = pread + (1.5 * buffer_size);
// printf(">>\n");
}
if(pwrite[peer] > (pread + 6 * buffer_size)) {
pwrite[peer] = pread + (1.5 * buffer_size);
// printf("<<\n");
}
short *p = (short*)pcm;
for(int i = 0; i < size / sizeof(short); i++) {
ringbuffer[pwrite[peer] % RINGBUFFER] += p[i];
pwrite[peer]++;
}
}
|
