/* -*- 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 #include #define BUFSZ 512 SoundPlayer::SoundPlayer() { start(); pread = 0; for(int i = 0; i < 10; i++) pwrite[i] = BUFSZ * 4; memset(ringbuffer, 0, sizeof(ringbuffer)); } SoundPlayer::~SoundPlayer() { running = false; wait(); } void SoundPlayer::run() { ao_initialize(); ao_sample_format sf; memset(&sf, 0, sizeof(sf)); sf.bits = 16; sf.rate = 16000; sf.channels = 1; sf.byte_format = AO_FMT_NATIVE; ao_device *dev = ao_open_live(ao_default_driver_id(), &sf, 0); running = true; short s[BUFSZ]; memset(s, 0, sizeof(s)); while(running) { for(int i = 0; i < BUFSZ; i++) { s[i] = ringbuffer[pread % RINGBUFFER]; ringbuffer[pread % RINGBUFFER] = 0; pread++; } ao_play(dev, (char *)s, sizeof(s)); } ao_close(dev); ao_shutdown(); } void SoundPlayer::playSamples(int peer, const char *pcm, size_t size) { short *p = (short*)pcm; for(int i = 0; i < size / sizeof(short); i++) { ringbuffer[pwrite[peer] % RINGBUFFER] += p[i]; pwrite[peer]++; } }