chiark / gitweb /
leave a TODO relating to revno 78
[disorder] / clients / playrtp.c
CommitLineData
e83d0967
RK
1/*
2 * This file is part of DisOrder.
3 * Copyright (C) 2007 Richard Kettlewell
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
9 *
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
18 * USA
19 */
28bacdc0
RK
20/** @file clients/playrtp.c
21 * @brief RTP player
22 *
b0fdc63d 23 * This player supports Linux (<a href="http://www.alsa-project.org/">ALSA</a>)
24 * and Apple Mac (<a
25 * href="http://developer.apple.com/audio/coreaudio.html">Core Audio</a>)
26 * systems. There is no support for Microsoft Windows yet, and that will in
27 * fact probably an entirely separate program.
28 *
189e9830
RK
29 * The program runs (at least) three threads. listen_thread() is responsible
30 * for reading RTP packets off the wire and adding them to the linked list @ref
31 * received_packets, assuming they are basically sound. queue_thread() takes
32 * packets off this linked list and adds them to @ref packets (an operation
33 * which might be much slower due to contention for @ref lock).
b0fdc63d 34 *
35 * The main thread is responsible for actually playing audio. In ALSA this
36 * means it waits until ALSA says it's ready for more audio which it then
37 * plays.
38 *
39 * InCore Audio the main thread is only responsible for starting and stopping
40 * play: the system does the actual playback in its own private thread, and
41 * calls adioproc() to fetch the audio data.
42 *
43 * Sometimes it happens that there is no audio available to play. This may
44 * because the server went away, or a packet was dropped, or the server
45 * deliberately did not send any sound because it encountered a silence.
189e9830
RK
46 *
47 * Assumptions:
48 * - it is safe to read uint32_t values without a lock protecting them
28bacdc0 49 */
e83d0967
RK
50
51#include <config.h>
52#include "types.h"
53
54#include <getopt.h>
55#include <stdio.h>
56#include <stdlib.h>
57#include <sys/socket.h>
58#include <sys/types.h>
59#include <sys/socket.h>
60#include <netdb.h>
61#include <pthread.h>
0b75463f 62#include <locale.h>
2c7c9eae 63#include <sys/uio.h>
28bacdc0 64#include <string.h>
e83d0967
RK
65
66#include "log.h"
67#include "mem.h"
68#include "configuration.h"
69#include "addr.h"
70#include "syscalls.h"
71#include "rtp.h"
0b75463f 72#include "defs.h"
28bacdc0
RK
73#include "vector.h"
74#include "heap.h"
189e9830 75#include "timeval.h"
e83d0967
RK
76
77#if HAVE_COREAUDIO_AUDIOHARDWARE_H
78# include <CoreAudio/AudioHardware.h>
79#endif
0b75463f 80#if API_ALSA
81#include <alsa/asoundlib.h>
82#endif
e83d0967 83
1153fd23 84#define readahead linux_headers_are_borked
85
0b75463f 86/** @brief RTP socket */
e83d0967
RK
87static int rtpfd;
88
345ebe66
RK
89/** @brief Log output */
90static FILE *logfp;
91
0b75463f 92/** @brief Output device */
93static const char *device;
94
95/** @brief Maximum samples per packet we'll support
96 *
97 * NB that two channels = two samples in this program.
98 */
99#define MAXSAMPLES 2048
100
9086a105 101/** @brief Minimum low watermark
0b75463f 102 *
103 * We'll stop playing if there's only this many samples in the buffer. */
1153fd23 104static unsigned minbuffer = 2 * 44100 / 10; /* 0.2 seconds */
0b75463f 105
9086a105 106/** @brief Buffer high watermark
1153fd23 107 *
108 * We'll only start playing when this many samples are available. */
8d0c14d7 109static unsigned readahead = 2 * 2 * 44100;
0b75463f 110
9086a105
RK
111/** @brief Maximum buffer size
112 *
113 * We'll stop reading from the network if we have this many samples. */
114static unsigned maxbuffer;
115
28bacdc0
RK
116/** @brief Number of samples to infill by in one go
117 *
58b5a68f 118 * This is an upper bound - in practice we expect the underlying audio API to
28bacdc0
RK
119 * only ask for a much smaller number of samples in any one go.
120 */
c0e41690 121#define INFILL_SAMPLES (44100 * 2) /* 1s */
122
28bacdc0
RK
123/** @brief Received packet
124 *
125 * Received packets are kept in a binary heap (see @ref pheap) ordered by
126 * timestamp.
127 */
0b75463f 128struct packet {
189e9830
RK
129 /** @brief Next packet in @ref next_free_packet or @ref received_packets */
130 struct packet *next;
131
0b75463f 132 /** @brief Number of samples in this packet */
c0e41690 133 uint32_t nsamples;
58b5a68f 134
0b75463f 135 /** @brief Timestamp from RTP packet
136 *
28bacdc0
RK
137 * NB that "timestamps" are really sample counters. Use lt() or lt_packet()
138 * to compare timestamps.
139 */
0b75463f 140 uint32_t timestamp;
58b5a68f
RK
141
142 /** @brief Flags
143 *
144 * Valid values are:
b0fdc63d 145 * - @ref IDLE - the idle bit was set in the RTP packet
58b5a68f
RK
146 */
147 unsigned flags;
b0fdc63d 148/** @brief idle bit set in RTP packet*/
149#define IDLE 0x0001
58b5a68f 150
28bacdc0
RK
151 /** @brief Raw sample data
152 *
153 * Only the first @p nsamples samples are defined; the rest is uninitialized
154 * data.
155 */
b64efe7e 156 uint16_t samples_raw[MAXSAMPLES];
e83d0967
RK
157};
158
28bacdc0 159/** @brief Return true iff \f$a < b\f$ in sequence-space arithmetic
0b75463f 160 *
28bacdc0
RK
161 * Specifically it returns true if \f$(a-b) mod 2^{32} < 2^{31}\f$.
162 *
163 * See also lt_packet().
164 */
165static inline int lt(uint32_t a, uint32_t b) {
166 return (uint32_t)(a - b) & 0x80000000;
167}
2c7c9eae 168
28bacdc0
RK
169/** @brief Return true iff a >= b in sequence-space arithmetic */
170static inline int ge(uint32_t a, uint32_t b) {
171 return !lt(a, b);
172}
173
174/** @brief Return true iff a > b in sequence-space arithmetic */
175static inline int gt(uint32_t a, uint32_t b) {
176 return lt(b, a);
177}
178
179/** @brief Return true iff a <= b in sequence-space arithmetic */
180static inline int le(uint32_t a, uint32_t b) {
181 return !lt(b, a);
182}
183
184/** @brief Ordering for packets, used by @ref pheap */
185static inline int lt_packet(const struct packet *a, const struct packet *b) {
186 return lt(a->timestamp, b->timestamp);
187}
188
189e9830
RK
189/** @brief Received packets
190 * Protected by @ref receive_lock
191 *
192 * Received packets are added to this list, and queue_thread() picks them off
193 * it and adds them to @ref packets. Whenever a packet is added to it, @ref
194 * receive_cond is signalled.
195 */
196static struct packet *received_packets;
197
198/** @brief Tail of @ref received_packets
199 * Protected by @ref receive_lock
200 */
201static struct packet **received_tail = &received_packets;
202
203/** @brief Lock protecting @ref received_packets
204 *
205 * Only listen_thread() and queue_thread() ever hold this lock. It is vital
206 * that queue_thread() not hold it any longer than it strictly has to. */
207static pthread_mutex_t receive_lock = PTHREAD_MUTEX_INITIALIZER;
208
209/** @brief Condition variable signalled when @ref received_packets is updated
210 *
211 * Used by listen_thread() to notify queue_thread() that it has added another
212 * packet to @ref received_packets. */
213static pthread_cond_t receive_cond = PTHREAD_COND_INITIALIZER;
214
215/** @brief Length of @ref received_packets */
216static uint32_t nreceived;
217
28bacdc0
RK
218/** @struct pheap
219 * @brief Binary heap of packets ordered by timestamp */
220HEAP_TYPE(pheap, struct packet *, lt_packet);
221
222/** @brief Binary heap of received packets */
223static struct pheap packets;
224
189e9830
RK
225/** @brief Total number of samples available
226 *
227 * We make this volatile because we inspect it without a protecting lock,
228 * so the usual pthread_* guarantees aren't available.
229 */
230static volatile uint32_t nsamples;
0b75463f 231
232/** @brief Timestamp of next packet to play.
233 *
234 * This is set to the timestamp of the last packet, plus the number of
09ee2f0d 235 * samples it contained. Only valid if @ref active is nonzero.
0b75463f 236 */
237static uint32_t next_timestamp;
e83d0967 238
09ee2f0d 239/** @brief True if actively playing
240 *
241 * This is true when playing and false when just buffering. */
242static int active;
243
189e9830
RK
244/** @brief Lock protecting @ref packets */
245static pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER;
246
247/** @brief Condition variable signalled whenever @ref packets is changed */
248static pthread_cond_t cond = PTHREAD_COND_INITIALIZER;
249
2c7c9eae
RK
250/** @brief Structure of free packet list */
251union free_packet {
252 struct packet p;
253 union free_packet *next;
254};
255
28bacdc0
RK
256/** @brief Linked list of free packets
257 *
258 * This is a linked list of formerly used packets. For preference we re-use
259 * packets that have already been used rather than unused ones, to limit the
260 * size of the program's working set. If there are no free packets in the list
261 * we try @ref next_free_packet instead.
262 *
263 * Must hold @ref lock when accessing this.
264 */
2c7c9eae
RK
265static union free_packet *free_packets;
266
28bacdc0
RK
267/** @brief Array of new free packets
268 *
269 * There are @ref count_free_packets ready to use at this address. If there
270 * are none left we allocate more memory.
271 *
272 * Must hold @ref lock when accessing this.
273 */
2c7c9eae
RK
274static union free_packet *next_free_packet;
275
28bacdc0
RK
276/** @brief Count of new free packets at @ref next_free_packet
277 *
278 * Must hold @ref lock when accessing this.
279 */
2c7c9eae
RK
280static size_t count_free_packets;
281
189e9830
RK
282/** @brief Lock protecting packet allocator */
283static pthread_mutex_t mem_lock = PTHREAD_MUTEX_INITIALIZER;
e83d0967
RK
284
285static const struct option options[] = {
286 { "help", no_argument, 0, 'h' },
287 { "version", no_argument, 0, 'V' },
288 { "debug", no_argument, 0, 'd' },
0b75463f 289 { "device", required_argument, 0, 'D' },
1153fd23 290 { "min", required_argument, 0, 'm' },
9086a105 291 { "max", required_argument, 0, 'x' },
1153fd23 292 { "buffer", required_argument, 0, 'b' },
1f10f780 293 { "rcvbuf", required_argument, 0, 'R' },
e83d0967
RK
294 { 0, 0, 0, 0 }
295};
296
795192f4 297/** @brief Return a new packet */
2c7c9eae
RK
298static struct packet *new_packet(void) {
299 struct packet *p;
189e9830
RK
300
301 pthread_mutex_lock(&mem_lock);
2c7c9eae
RK
302 if(free_packets) {
303 p = &free_packets->p;
304 free_packets = free_packets->next;
305 } else {
306 if(!count_free_packets) {
307 next_free_packet = xcalloc(1024, sizeof (union free_packet));
308 count_free_packets = 1024;
309 }
310 p = &(next_free_packet++)->p;
311 --count_free_packets;
312 }
189e9830 313 pthread_mutex_unlock(&mem_lock);
2c7c9eae
RK
314 return p;
315}
316
189e9830 317/** @brief Free a packet */
2c7c9eae
RK
318static void free_packet(struct packet *p) {
319 union free_packet *u = (union free_packet *)p;
189e9830 320 pthread_mutex_lock(&mem_lock);
2c7c9eae
RK
321 u->next = free_packets;
322 free_packets = u;
189e9830 323 pthread_mutex_unlock(&mem_lock);
2c7c9eae
RK
324}
325
28bacdc0
RK
326/** @brief Drop the first packet
327 *
328 * Assumes that @ref lock is held.
329 */
330static void drop_first_packet(void) {
331 if(pheap_count(&packets)) {
332 struct packet *const p = pheap_remove(&packets);
333 nsamples -= p->nsamples;
334 free_packet(p);
2c7c9eae 335 pthread_cond_broadcast(&cond);
2c7c9eae 336 }
9086a105
RK
337}
338
189e9830
RK
339/** @brief Background thread adding packets to heap
340 *
341 * This just transfers packets from @ref received_packets to @ref packets. It
342 * is important that it holds @ref receive_lock for as little time as possible,
343 * in order to minimize the interval between calls to read() in
344 * listen_thread().
345 */
346static void *queue_thread(void attribute((unused)) *arg) {
347 struct packet *p;
348
349 for(;;) {
350 /* Get the next packet */
351 pthread_mutex_lock(&receive_lock);
352 while(!received_packets)
353 pthread_cond_wait(&receive_cond, &receive_lock);
354 p = received_packets;
355 received_packets = p->next;
356 if(!received_packets)
357 received_tail = &received_packets;
358 --nreceived;
359 pthread_mutex_unlock(&receive_lock);
360 /* Add it to the heap */
361 pthread_mutex_lock(&lock);
362 pheap_insert(&packets, p);
363 nsamples += p->nsamples;
364 pthread_cond_broadcast(&cond);
365 pthread_mutex_unlock(&lock);
366 }
367}
368
09ee2f0d 369/** @brief Background thread collecting samples
0b75463f 370 *
371 * This function collects samples, perhaps converts them to the target format,
b0fdc63d 372 * and adds them to the packet list.
373 *
374 * It is crucial that the gap between successive calls to read() is as small as
375 * possible: otherwise packets will be dropped.
376 *
377 * We use a binary heap to ensure that the unavoidable effort is at worst
378 * logarithmic in the total number of packets - in fact if packets are mostly
379 * received in order then we will largely do constant work per packet since the
380 * newest packet will always be last.
381 *
382 * Of more concern is that we must acquire the lock on the heap to add a packet
383 * to it. If this proves a problem in practice then the answer would be
384 * (probably doubly) linked list with new packets added the end and a second
385 * thread which reads packets off the list and adds them to the heap.
386 *
387 * We keep memory allocation (mostly) very fast by keeping pre-allocated
388 * packets around; see @ref new_packet().
389 */
0b75463f 390static void *listen_thread(void attribute((unused)) *arg) {
2c7c9eae 391 struct packet *p = 0;
0b75463f 392 int n;
2c7c9eae
RK
393 struct rtp_header header;
394 uint16_t seq;
395 uint32_t timestamp;
396 struct iovec iov[2];
e83d0967
RK
397
398 for(;;) {
189e9830 399 if(!p)
2c7c9eae 400 p = new_packet();
2c7c9eae
RK
401 iov[0].iov_base = &header;
402 iov[0].iov_len = sizeof header;
403 iov[1].iov_base = p->samples_raw;
b64efe7e 404 iov[1].iov_len = sizeof p->samples_raw / sizeof *p->samples_raw;
2c7c9eae 405 n = readv(rtpfd, iov, 2);
e83d0967
RK
406 if(n < 0) {
407 switch(errno) {
408 case EINTR:
409 continue;
410 default:
411 fatal(errno, "error reading from socket");
412 }
413 }
0b75463f 414 /* Ignore too-short packets */
345ebe66
RK
415 if((size_t)n <= sizeof (struct rtp_header)) {
416 info("ignored a short packet");
0b75463f 417 continue;
345ebe66 418 }
2c7c9eae
RK
419 timestamp = htonl(header.timestamp);
420 seq = htons(header.seq);
09ee2f0d 421 /* Ignore packets in the past */
2c7c9eae 422 if(active && lt(timestamp, next_timestamp)) {
c0e41690 423 info("dropping old packet, timestamp=%"PRIx32" < %"PRIx32,
2c7c9eae 424 timestamp, next_timestamp);
09ee2f0d 425 continue;
c0e41690 426 }
189e9830 427 p->next = 0;
58b5a68f 428 p->flags = 0;
2c7c9eae 429 p->timestamp = timestamp;
e83d0967 430 /* Convert to target format */
58b5a68f
RK
431 if(header.mpt & 0x80)
432 p->flags |= IDLE;
2c7c9eae 433 switch(header.mpt & 0x7F) {
e83d0967 434 case 10:
2c7c9eae 435 p->nsamples = (n - sizeof header) / sizeof(uint16_t);
e83d0967
RK
436 break;
437 /* TODO support other RFC3551 media types (when the speaker does) */
438 default:
0b75463f 439 fatal(0, "unsupported RTP payload type %d",
2c7c9eae 440 header.mpt & 0x7F);
e83d0967 441 }
345ebe66
RK
442 if(logfp)
443 fprintf(logfp, "sequence %u timestamp %"PRIx32" length %"PRIx32" end %"PRIx32"\n",
2c7c9eae 444 seq, timestamp, p->nsamples, timestamp + p->nsamples);
0b75463f 445 /* Stop reading if we've reached the maximum.
446 *
447 * This is rather unsatisfactory: it means that if packets get heavily
448 * out of order then we guarantee dropouts. But for now... */
345ebe66 449 if(nsamples >= maxbuffer) {
189e9830 450 pthread_mutex_lock(&lock);
345ebe66
RK
451 while(nsamples >= maxbuffer)
452 pthread_cond_wait(&cond, &lock);
189e9830 453 pthread_mutex_unlock(&lock);
345ebe66 454 }
189e9830
RK
455 /* Add the packet to the receive queue */
456 pthread_mutex_lock(&receive_lock);
457 *received_tail = p;
458 received_tail = &p->next;
459 ++nreceived;
460 pthread_cond_signal(&receive_cond);
461 pthread_mutex_unlock(&receive_lock);
58b5a68f
RK
462 /* We'll need a new packet */
463 p = 0;
e83d0967
RK
464 }
465}
466
b0fdc63d 467/** @brief Return true if @p p contains @p timestamp
468 *
469 * Containment implies that a sample @p timestamp exists within the packet.
470 */
2c7c9eae
RK
471static inline int contains(const struct packet *p, uint32_t timestamp) {
472 const uint32_t packet_start = p->timestamp;
473 const uint32_t packet_end = p->timestamp + p->nsamples;
474
475 return (ge(timestamp, packet_start)
476 && lt(timestamp, packet_end));
477}
478
5626f6d2
RK
479/** @brief Wait until the buffer is adequately full
480 *
481 * Must be called with @ref lock held.
482 */
483static void fill_buffer(void) {
bfd27c14
RK
484 while(nsamples)
485 drop_first_packet();
5626f6d2
RK
486 info("Buffering...");
487 while(nsamples < readahead)
488 pthread_cond_wait(&cond, &lock);
489 next_timestamp = pheap_first(&packets)->timestamp;
490 active = 1;
491}
492
493/** @brief Find next packet
494 * @return Packet to play or NULL if none found
495 *
496 * The return packet is merely guaranteed not to be in the past: it might be
497 * the first packet in the future rather than one that is actually suitable to
498 * play.
499 *
500 * Must be called with @ref lock held.
501 */
502static struct packet *next_packet(void) {
503 while(pheap_count(&packets)) {
504 struct packet *const p = pheap_first(&packets);
505 if(le(p->timestamp + p->nsamples, next_timestamp)) {
506 /* This packet is in the past. Drop it and try another one. */
507 drop_first_packet();
508 } else
509 /* This packet is NOT in the past. (It might be in the future
510 * however.) */
511 return p;
512 }
513 return 0;
514}
515
e83d0967 516#if HAVE_COREAUDIO_AUDIOHARDWARE_H
09ee2f0d 517/** @brief Callback from Core Audio */
9086a105
RK
518static OSStatus adioproc
519 (AudioDeviceID attribute((unused)) inDevice,
520 const AudioTimeStamp attribute((unused)) *inNow,
521 const AudioBufferList attribute((unused)) *inInputData,
522 const AudioTimeStamp attribute((unused)) *inInputTime,
523 AudioBufferList *outOutputData,
524 const AudioTimeStamp attribute((unused)) *inOutputTime,
525 void attribute((unused)) *inClientData) {
e83d0967
RK
526 UInt32 nbuffers = outOutputData->mNumberBuffers;
527 AudioBuffer *ab = outOutputData->mBuffers;
28bacdc0 528 uint32_t samples_available;
e83d0967 529
0b75463f 530 pthread_mutex_lock(&lock);
9086a105
RK
531 while(nbuffers > 0) {
532 float *samplesOut = ab->mData;
533 size_t samplesOutLeft = ab->mDataByteSize / sizeof (float);
2c7c9eae 534
9086a105 535 while(samplesOutLeft > 0) {
5626f6d2 536 const struct packet *p = next_packet();
28bacdc0
RK
537 if(p && contains(p, next_timestamp)) {
538 /* This packet is ready to play */
539 const uint32_t packet_end = p->timestamp + p->nsamples;
540 const uint32_t offset = next_timestamp - p->timestamp;
b64efe7e 541 const uint16_t *ptr = (void *)(p->samples_raw + offset);
28bacdc0
RK
542
543 samples_available = packet_end - next_timestamp;
544 if(samples_available > samplesOutLeft)
545 samples_available = samplesOutLeft;
546 next_timestamp += samples_available;
547 samplesOutLeft -= samples_available;
548 while(samples_available-- > 0)
549 *samplesOut++ = (int16_t)ntohs(*ptr++) * (0.5 / 32767);
550 /* We don't bother junking the packet - that'll be dealt with next time
551 * round */
552 } else {
553 /* No packet is ready to play (and there might be no packet at all) */
554 samples_available = p ? p->timestamp - next_timestamp
555 : samplesOutLeft;
9086a105
RK
556 if(samples_available > samplesOutLeft)
557 samples_available = samplesOutLeft;
58b5a68f 558 //info("infill by %"PRIu32, samples_available);
28bacdc0 559 /* Conveniently the buffer is 0 to start with */
9086a105
RK
560 next_timestamp += samples_available;
561 samplesOut += samples_available;
562 samplesOutLeft -= samples_available;
9086a105 563 }
e83d0967 564 }
9086a105
RK
565 ++ab;
566 --nbuffers;
e83d0967
RK
567 }
568 pthread_mutex_unlock(&lock);
569 return 0;
570}
571#endif
572
b64efe7e 573
574#if API_ALSA
575/** @brief PCM handle */
576static snd_pcm_t *pcm;
577
578/** @brief True when @ref pcm is up and running */
579static int alsa_prepared = 1;
580
581/** @brief Initialize @ref pcm */
582static void setup_alsa(void) {
583 snd_pcm_hw_params_t *hwparams;
584 snd_pcm_sw_params_t *swparams;
585 /* Only support one format for now */
586 const int sample_format = SND_PCM_FORMAT_S16_BE;
587 unsigned rate = 44100;
588 const int channels = 2;
589 const int samplesize = channels * sizeof(uint16_t);
590 snd_pcm_uframes_t pcm_bufsize = MAXSAMPLES * samplesize * 3;
591 /* If we can write more than this many samples we'll get a wakeup */
592 const int avail_min = 256;
593 int err;
594
595 /* Open ALSA */
596 if((err = snd_pcm_open(&pcm,
597 device ? device : "default",
598 SND_PCM_STREAM_PLAYBACK,
599 SND_PCM_NONBLOCK)))
600 fatal(0, "error from snd_pcm_open: %d", err);
601 /* Set up 'hardware' parameters */
602 snd_pcm_hw_params_alloca(&hwparams);
603 if((err = snd_pcm_hw_params_any(pcm, hwparams)) < 0)
604 fatal(0, "error from snd_pcm_hw_params_any: %d", err);
605 if((err = snd_pcm_hw_params_set_access(pcm, hwparams,
606 SND_PCM_ACCESS_RW_INTERLEAVED)) < 0)
607 fatal(0, "error from snd_pcm_hw_params_set_access: %d", err);
608 if((err = snd_pcm_hw_params_set_format(pcm, hwparams,
609 sample_format)) < 0)
610
611 fatal(0, "error from snd_pcm_hw_params_set_format (%d): %d",
612 sample_format, err);
613 if((err = snd_pcm_hw_params_set_rate_near(pcm, hwparams, &rate, 0)) < 0)
614 fatal(0, "error from snd_pcm_hw_params_set_rate (%d): %d",
615 rate, err);
616 if((err = snd_pcm_hw_params_set_channels(pcm, hwparams,
617 channels)) < 0)
618 fatal(0, "error from snd_pcm_hw_params_set_channels (%d): %d",
619 channels, err);
620 if((err = snd_pcm_hw_params_set_buffer_size_near(pcm, hwparams,
621 &pcm_bufsize)) < 0)
622 fatal(0, "error from snd_pcm_hw_params_set_buffer_size (%d): %d",
623 MAXSAMPLES * samplesize * 3, err);
624 if((err = snd_pcm_hw_params(pcm, hwparams)) < 0)
625 fatal(0, "error calling snd_pcm_hw_params: %d", err);
626 /* Set up 'software' parameters */
627 snd_pcm_sw_params_alloca(&swparams);
628 if((err = snd_pcm_sw_params_current(pcm, swparams)) < 0)
629 fatal(0, "error calling snd_pcm_sw_params_current: %d", err);
630 if((err = snd_pcm_sw_params_set_avail_min(pcm, swparams, avail_min)) < 0)
631 fatal(0, "error calling snd_pcm_sw_params_set_avail_min %d: %d",
632 avail_min, err);
633 if((err = snd_pcm_sw_params(pcm, swparams)) < 0)
634 fatal(0, "error calling snd_pcm_sw_params: %d", err);
635}
636
637/** @brief Wait until ALSA wants some audio */
638static void wait_alsa(void) {
639 struct pollfd fds[64];
640 int nfds, err;
641 unsigned short events;
642
643 for(;;) {
644 do {
645 if((nfds = snd_pcm_poll_descriptors(pcm,
646 fds, sizeof fds / sizeof *fds)) < 0)
647 fatal(0, "error calling snd_pcm_poll_descriptors: %d", nfds);
648 } while(poll(fds, nfds, -1) < 0 && errno == EINTR);
649 if((err = snd_pcm_poll_descriptors_revents(pcm, fds, nfds, &events)))
650 fatal(0, "error calling snd_pcm_poll_descriptors_revents: %d", err);
651 if(events & POLLOUT)
652 return;
653 }
654}
655
b0fdc63d 656/** @brief Play some sound via ALSA
b64efe7e 657 * @param s Pointer to sample data
658 * @param n Number of samples
659 * @return 0 on success, -1 on non-fatal error
660 */
661static int alsa_writei(const void *s, size_t n) {
662 /* Do the write */
663 const snd_pcm_sframes_t frames_written = snd_pcm_writei(pcm, s, n / 2);
664 if(frames_written < 0) {
665 /* Something went wrong */
666 switch(frames_written) {
667 case -EAGAIN:
668 return 0;
669 case -EPIPE:
670 error(0, "error calling snd_pcm_writei: %ld",
671 (long)frames_written);
672 return -1;
673 default:
674 fatal(0, "error calling snd_pcm_writei: %ld",
675 (long)frames_written);
676 }
677 } else {
678 /* Success */
679 next_timestamp += frames_written * 2;
680 return 0;
681 }
682}
683
684/** @brief Play the relevant part of a packet
685 * @param p Packet to play
686 * @return 0 on success, -1 on non-fatal error
687 */
688static int alsa_play(const struct packet *p) {
b64efe7e 689 return alsa_writei(p->samples_raw + next_timestamp - p->timestamp,
690 (p->timestamp + p->nsamples) - next_timestamp);
691}
692
693/** @brief Play some silence
694 * @param p Next packet or NULL
695 * @return 0 on success, -1 on non-fatal error
696 */
697static int alsa_infill(const struct packet *p) {
698 static const uint16_t zeros[INFILL_SAMPLES];
699 size_t samples_available = INFILL_SAMPLES;
700
701 if(p && samples_available > p->timestamp - next_timestamp)
702 samples_available = p->timestamp - next_timestamp;
b64efe7e 703 return alsa_writei(zeros, samples_available);
704}
705
706/** @brief Reset ALSA state after we lost synchronization */
707static void alsa_reset(int hard_reset) {
708 int err;
709
710 if((err = snd_pcm_nonblock(pcm, 0)))
711 fatal(0, "error calling snd_pcm_nonblock: %d", err);
712 if(hard_reset) {
713 if((err = snd_pcm_drop(pcm)))
714 fatal(0, "error calling snd_pcm_drop: %d", err);
715 } else
716 if((err = snd_pcm_drain(pcm)))
717 fatal(0, "error calling snd_pcm_drain: %d", err);
718 if((err = snd_pcm_nonblock(pcm, 1)))
719 fatal(0, "error calling snd_pcm_nonblock: %d", err);
720 alsa_prepared = 0;
721}
722#endif
723
09ee2f0d 724/** @brief Play an RTP stream
725 *
726 * This is the guts of the program. It is responsible for:
727 * - starting the listening thread
728 * - opening the audio device
729 * - reading ahead to build up a buffer
730 * - arranging for audio to be played
731 * - detecting when the buffer has got too small and re-buffering
732 */
0b75463f 733static void play_rtp(void) {
734 pthread_t ltid;
e83d0967
RK
735
736 /* We receive and convert audio data in a background thread */
0b75463f 737 pthread_create(&ltid, 0, listen_thread, 0);
189e9830
RK
738 /* We have a second thread to add received packets to the queue */
739 pthread_create(&ltid, 0, queue_thread, 0);
e83d0967 740#if API_ALSA
0b75463f 741 {
b64efe7e 742 struct packet *p;
743 int escape, err;
744
745 /* Open the sound device */
746 setup_alsa();
0b75463f 747 pthread_mutex_lock(&lock);
748 for(;;) {
749 /* Wait for the buffer to fill up a bit */
b64efe7e 750 fill_buffer();
751 if(!alsa_prepared) {
0b75463f 752 if((err = snd_pcm_prepare(pcm)))
753 fatal(0, "error calling snd_pcm_prepare: %d", err);
b64efe7e 754 alsa_prepared = 1;
0b75463f 755 }
c0e41690 756 escape = 0;
ed13cbc8 757 info("Playing...");
b64efe7e 758 /* Keep playing until the buffer empties out, or ALSA tells us to get
759 * lost */
ca8d597c
RK
760 while((nsamples >= minbuffer
761 || (nsamples > 0
762 && contains(pheap_first(&packets), next_timestamp)))
763 && !escape) {
0b75463f 764 /* Wait for ALSA to ask us for more data */
765 pthread_mutex_unlock(&lock);
b64efe7e 766 wait_alsa();
0b75463f 767 pthread_mutex_lock(&lock);
b64efe7e 768 /* ALSA is ready for more data, find something to play */
769 p = next_packet();
770 /* Play it or play some silence */
771 if(contains(p, next_timestamp))
772 escape = alsa_play(p);
773 else
774 escape = alsa_infill(p);
0b75463f 775 }
09ee2f0d 776 active = 0;
0b75463f 777 /* We stop playing for a bit until the buffer re-fills */
778 pthread_mutex_unlock(&lock);
b64efe7e 779 alsa_reset(escape);
0b75463f 780 pthread_mutex_lock(&lock);
781 }
782
783 }
e83d0967
RK
784#elif HAVE_COREAUDIO_AUDIOHARDWARE_H
785 {
786 OSStatus status;
787 UInt32 propertySize;
788 AudioDeviceID adid;
789 AudioStreamBasicDescription asbd;
790
791 /* If this looks suspiciously like libao's macosx driver there's an
792 * excellent reason for that... */
793
794 /* TODO report errors as strings not numbers */
795 propertySize = sizeof adid;
796 status = AudioHardwareGetProperty(kAudioHardwarePropertyDefaultOutputDevice,
797 &propertySize, &adid);
798 if(status)
799 fatal(0, "AudioHardwareGetProperty: %d", (int)status);
800 if(adid == kAudioDeviceUnknown)
801 fatal(0, "no output device");
802 propertySize = sizeof asbd;
803 status = AudioDeviceGetProperty(adid, 0, false,
804 kAudioDevicePropertyStreamFormat,
805 &propertySize, &asbd);
806 if(status)
807 fatal(0, "AudioHardwareGetProperty: %d", (int)status);
808 D(("mSampleRate %f", asbd.mSampleRate));
9086a105
RK
809 D(("mFormatID %08lx", asbd.mFormatID));
810 D(("mFormatFlags %08lx", asbd.mFormatFlags));
811 D(("mBytesPerPacket %08lx", asbd.mBytesPerPacket));
812 D(("mFramesPerPacket %08lx", asbd.mFramesPerPacket));
813 D(("mBytesPerFrame %08lx", asbd.mBytesPerFrame));
814 D(("mChannelsPerFrame %08lx", asbd.mChannelsPerFrame));
815 D(("mBitsPerChannel %08lx", asbd.mBitsPerChannel));
816 D(("mReserved %08lx", asbd.mReserved));
e83d0967
RK
817 if(asbd.mFormatID != kAudioFormatLinearPCM)
818 fatal(0, "audio device does not support kAudioFormatLinearPCM");
819 status = AudioDeviceAddIOProc(adid, adioproc, 0);
820 if(status)
821 fatal(0, "AudioDeviceAddIOProc: %d", (int)status);
822 pthread_mutex_lock(&lock);
823 for(;;) {
824 /* Wait for the buffer to fill up a bit */
b64efe7e 825 fill_buffer();
e83d0967 826 /* Start playing now */
8dcb5ff0 827 info("Playing...");
28bacdc0 828 next_timestamp = pheap_first(&packets)->timestamp;
8dcb5ff0 829 active = 1;
e83d0967
RK
830 status = AudioDeviceStart(adid, adioproc);
831 if(status)
832 fatal(0, "AudioDeviceStart: %d", (int)status);
833 /* Wait until the buffer empties out */
ca8d597c
RK
834 while(nsamples >= minbuffer
835 || (nsamples > 0
836 && contains(pheap_first(&packets), next_timestamp)))
e83d0967
RK
837 pthread_cond_wait(&cond, &lock);
838 /* Stop playing for a bit until the buffer re-fills */
839 status = AudioDeviceStop(adid, adioproc);
840 if(status)
841 fatal(0, "AudioDeviceStop: %d", (int)status);
8dcb5ff0 842 active = 0;
e83d0967
RK
843 /* Go back round */
844 }
845 }
846#else
847# error No known audio API
848#endif
849}
850
851/* display usage message and terminate */
852static void help(void) {
853 xprintf("Usage:\n"
854 " disorder-playrtp [OPTIONS] ADDRESS [PORT]\n"
855 "Options:\n"
1153fd23 856 " --device, -D DEVICE Output device\n"
857 " --min, -m FRAMES Buffer low water mark\n"
9086a105
RK
858 " --buffer, -b FRAMES Buffer high water mark\n"
859 " --max, -x FRAMES Buffer maximum size\n"
1f10f780 860 " --rcvbuf, -R BYTES Socket receive buffer size\n"
9086a105
RK
861 " --help, -h Display usage message\n"
862 " --version, -V Display version number\n"
863 );
e83d0967
RK
864 xfclose(stdout);
865 exit(0);
866}
867
868/* display version number and terminate */
869static void version(void) {
870 xprintf("disorder-playrtp version %s\n", disorder_version_string);
871 xfclose(stdout);
872 exit(0);
873}
874
875int main(int argc, char **argv) {
876 int n;
877 struct addrinfo *res;
878 struct stringlist sl;
0b75463f 879 char *sockname;
1f10f780
RK
880 int rcvbuf, target_rcvbuf = 131072;
881 socklen_t len;
e83d0967 882
0b75463f 883 static const struct addrinfo prefs = {
e83d0967
RK
884 AI_PASSIVE,
885 PF_INET,
886 SOCK_DGRAM,
887 IPPROTO_UDP,
888 0,
889 0,
890 0,
891 0
892 };
893
894 mem_init();
895 if(!setlocale(LC_CTYPE, "")) fatal(errno, "error calling setlocale");
1f10f780 896 while((n = getopt_long(argc, argv, "hVdD:m:b:x:L:R:", options, 0)) >= 0) {
e83d0967
RK
897 switch(n) {
898 case 'h': help();
899 case 'V': version();
900 case 'd': debugging = 1; break;
0b75463f 901 case 'D': device = optarg; break;
1153fd23 902 case 'm': minbuffer = 2 * atol(optarg); break;
903 case 'b': readahead = 2 * atol(optarg); break;
9086a105 904 case 'x': maxbuffer = 2 * atol(optarg); break;
345ebe66 905 case 'L': logfp = fopen(optarg, "w"); break;
1f10f780 906 case 'R': target_rcvbuf = atoi(optarg); break;
e83d0967
RK
907 default: fatal(0, "invalid option");
908 }
909 }
9086a105
RK
910 if(!maxbuffer)
911 maxbuffer = 4 * readahead;
e83d0967
RK
912 argc -= optind;
913 argv += optind;
914 if(argc < 1 || argc > 2)
915 fatal(0, "usage: disorder-playrtp [OPTIONS] ADDRESS [PORT]");
916 sl.n = argc;
917 sl.s = argv;
918 /* Listen for inbound audio data */
0b75463f 919 if(!(res = get_address(&sl, &prefs, &sockname)))
e83d0967
RK
920 exit(1);
921 if((rtpfd = socket(res->ai_family,
922 res->ai_socktype,
923 res->ai_protocol)) < 0)
924 fatal(errno, "error creating socket");
925 if(bind(rtpfd, res->ai_addr, res->ai_addrlen) < 0)
926 fatal(errno, "error binding socket to %s", sockname);
1f10f780
RK
927 len = sizeof rcvbuf;
928 if(getsockopt(rtpfd, SOL_SOCKET, SO_RCVBUF, &rcvbuf, &len) < 0)
929 fatal(errno, "error calling getsockopt SO_RCVBUF");
f0bae611 930 if(target_rcvbuf > rcvbuf) {
1f10f780
RK
931 if(setsockopt(rtpfd, SOL_SOCKET, SO_RCVBUF,
932 &target_rcvbuf, sizeof target_rcvbuf) < 0)
933 error(errno, "error calling setsockopt SO_RCVBUF %d",
934 target_rcvbuf);
935 /* We try to carry on anyway */
936 else
937 info("changed socket receive buffer from %d to %d",
938 rcvbuf, target_rcvbuf);
939 } else
940 info("default socket receive buffer %d", rcvbuf);
941 if(logfp)
942 info("WARNING: -L option can impact performance");
e83d0967
RK
943 play_rtp();
944 return 0;
945}
946
947/*
948Local Variables:
949c-basic-offset:2
950comment-column:40
951fill-column:79
952indent-tabs-mode:nil
953End:
954*/