/* -*- 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*)calloc(buffer_size, sizeof(short));

  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]++;
  }
}