2008-10-26 19:32:43 +01:00
|
|
|
/* the Music Player Daemon (MPD)
|
|
|
|
* Copyright (C) 2008 Max Kellermann <max@duempel.org>
|
|
|
|
* This project's homepage is: http://www.musicpd.org
|
|
|
|
*
|
|
|
|
* This program 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.
|
|
|
|
*
|
|
|
|
* This program 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 this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "input_curl.h"
|
2008-10-26 19:38:50 +01:00
|
|
|
#include "input_stream.h"
|
2009-01-13 22:57:05 +01:00
|
|
|
#include "conf.h"
|
2008-11-30 13:06:18 +01:00
|
|
|
#include "config.h"
|
2009-01-03 23:29:45 +01:00
|
|
|
#include "tag.h"
|
2009-01-03 23:55:03 +01:00
|
|
|
#include "icy_metadata.h"
|
2008-10-26 19:32:43 +01:00
|
|
|
|
|
|
|
#include <assert.h>
|
|
|
|
#include <sys/select.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <errno.h>
|
|
|
|
|
|
|
|
#include <curl/curl.h>
|
|
|
|
#include <glib.h>
|
|
|
|
|
2008-11-02 17:06:15 +01:00
|
|
|
/** rewinding is possible after up to 64 kB */
|
|
|
|
static const off_t max_rewind_size = 64 * 1024;
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
/**
|
|
|
|
* Buffers created by input_curl_writefunction().
|
|
|
|
*/
|
|
|
|
struct buffer {
|
|
|
|
/** size of the payload */
|
|
|
|
size_t size;
|
|
|
|
|
|
|
|
/** how much has been consumed yet? */
|
|
|
|
size_t consumed;
|
|
|
|
|
|
|
|
/** the payload */
|
|
|
|
unsigned char data[sizeof(long)];
|
|
|
|
};
|
|
|
|
|
|
|
|
struct input_curl {
|
|
|
|
/* some buffers which were passed to libcurl, which we have
|
|
|
|
too free */
|
|
|
|
char *url, *range;
|
|
|
|
struct curl_slist *request_headers;
|
|
|
|
|
|
|
|
/** the curl handles */
|
|
|
|
CURL *easy;
|
|
|
|
CURLM *multi;
|
|
|
|
|
|
|
|
/** list of buffers, where input_curl_writefunction() appends
|
|
|
|
to, and input_curl_read() reads from them */
|
2009-01-07 16:30:43 +01:00
|
|
|
GQueue *buffers;
|
2008-10-26 19:32:43 +01:00
|
|
|
|
|
|
|
/** has something been added to the buffers list? */
|
|
|
|
bool buffered;
|
|
|
|
|
|
|
|
/** did libcurl tell us the we're at the end of the response body? */
|
|
|
|
bool eof;
|
2008-11-02 17:06:15 +01:00
|
|
|
|
|
|
|
/** limited list of old buffers, for rewinding */
|
2009-01-07 16:30:43 +01:00
|
|
|
GQueue *rewind;
|
2008-11-06 06:48:30 +01:00
|
|
|
|
|
|
|
/** error message provided by libcurl */
|
|
|
|
char error[CURL_ERROR_SIZE];
|
2009-01-03 23:29:45 +01:00
|
|
|
|
2009-01-03 23:55:03 +01:00
|
|
|
/** parser for icy-metadata */
|
|
|
|
struct icy_metadata icy_metadata;
|
|
|
|
|
2009-01-03 23:29:45 +01:00
|
|
|
/** the stream name from the icy-name response header */
|
|
|
|
char *meta_name;
|
|
|
|
|
|
|
|
/** the tag object ready to be requested via
|
|
|
|
input_stream_tag() */
|
|
|
|
struct tag *tag;
|
2008-10-26 19:32:43 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
/** libcurl should accept "ICY 200 OK" */
|
|
|
|
static struct curl_slist *http_200_aliases;
|
|
|
|
|
|
|
|
void input_curl_global_init(void)
|
|
|
|
{
|
|
|
|
CURLcode code = curl_global_init(CURL_GLOBAL_ALL);
|
|
|
|
if (code != CURLE_OK)
|
|
|
|
g_warning("curl_global_init() failed: %s\n",
|
|
|
|
curl_easy_strerror(code));
|
|
|
|
|
|
|
|
http_200_aliases = curl_slist_append(http_200_aliases, "ICY 200 OK");
|
|
|
|
}
|
|
|
|
|
|
|
|
void input_curl_global_finish(void)
|
|
|
|
{
|
|
|
|
curl_slist_free_all(http_200_aliases);
|
|
|
|
|
|
|
|
curl_global_cleanup();
|
|
|
|
}
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
static void
|
|
|
|
buffer_free_callback(gpointer data, G_GNUC_UNUSED gpointer user_data)
|
|
|
|
{
|
|
|
|
struct buffer *buffer = data;
|
|
|
|
|
|
|
|
assert(buffer->consumed <= buffer->size);
|
|
|
|
|
|
|
|
g_free(data);
|
|
|
|
}
|
|
|
|
|
2009-01-15 09:20:01 +01:00
|
|
|
/* g_queue_clear() was introduced in GLib 2.14 */
|
|
|
|
#if GLIB_MAJOR_VERSION == 2 && GLIB_MINOR_VERSION < 14
|
|
|
|
#define g_queue_clear(q) do { g_queue_free(q); q = g_queue_new(); } while (0)
|
|
|
|
#endif
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
/**
|
|
|
|
* Frees the current "libcurl easy" handle, and everything associated
|
|
|
|
* with it.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
input_curl_easy_free(struct input_curl *c)
|
|
|
|
{
|
|
|
|
if (c->easy != NULL) {
|
|
|
|
curl_multi_remove_handle(c->multi, c->easy);
|
|
|
|
curl_easy_cleanup(c->easy);
|
|
|
|
c->easy = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
curl_slist_free_all(c->request_headers);
|
|
|
|
c->request_headers = NULL;
|
|
|
|
|
|
|
|
g_free(c->range);
|
|
|
|
c->range = NULL;
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
g_queue_foreach(c->buffers, buffer_free_callback, NULL);
|
|
|
|
g_queue_clear(c->buffers);
|
2008-11-02 17:06:15 +01:00
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
if (c->rewind != NULL) {
|
|
|
|
g_queue_foreach(c->rewind, buffer_free_callback, NULL);
|
|
|
|
g_queue_clear(c->rewind);
|
2008-11-02 17:06:15 +01:00
|
|
|
}
|
2008-10-26 19:32:43 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Frees this stream (but not the input_stream struct itself).
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
input_curl_free(struct input_stream *is)
|
|
|
|
{
|
|
|
|
struct input_curl *c = is->data;
|
|
|
|
|
2009-01-03 23:29:45 +01:00
|
|
|
if (c->tag != NULL)
|
|
|
|
tag_free(c->tag);
|
2009-01-03 23:55:03 +01:00
|
|
|
g_free(c->meta_name);
|
2009-01-03 23:29:45 +01:00
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
input_curl_easy_free(c);
|
|
|
|
|
|
|
|
if (c->multi != NULL)
|
|
|
|
curl_multi_cleanup(c->multi);
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
g_queue_free(c->buffers);
|
|
|
|
if (c->rewind != NULL)
|
|
|
|
g_queue_free(c->rewind);
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
g_free(c->url);
|
|
|
|
g_free(c);
|
|
|
|
}
|
|
|
|
|
2009-01-03 23:29:45 +01:00
|
|
|
static struct tag *
|
|
|
|
input_curl_tag(struct input_stream *is)
|
|
|
|
{
|
|
|
|
struct input_curl *c = is->data;
|
|
|
|
struct tag *tag = c->tag;
|
|
|
|
|
|
|
|
c->tag = NULL;
|
|
|
|
return tag;
|
|
|
|
}
|
|
|
|
|
2008-11-03 21:49:43 +01:00
|
|
|
static bool
|
|
|
|
input_curl_multi_info_read(struct input_stream *is)
|
|
|
|
{
|
|
|
|
struct input_curl *c = is->data;
|
|
|
|
CURLMsg *msg;
|
|
|
|
int msgs_in_queue;
|
|
|
|
|
|
|
|
while ((msg = curl_multi_info_read(c->multi,
|
|
|
|
&msgs_in_queue)) != NULL) {
|
2008-11-20 12:41:59 +01:00
|
|
|
if (msg->msg == CURLMSG_DONE) {
|
2008-11-03 21:49:43 +01:00
|
|
|
c->eof = true;
|
2009-01-15 16:12:22 +01:00
|
|
|
is->ready = true;
|
2008-11-20 12:41:59 +01:00
|
|
|
|
|
|
|
if (msg->data.result != CURLE_OK) {
|
|
|
|
g_warning("curl failed: %s\n", c->error);
|
|
|
|
is->error = -1;
|
|
|
|
return false;
|
|
|
|
}
|
2008-11-03 21:49:43 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
/**
|
|
|
|
* Wait for the libcurl socket.
|
|
|
|
*
|
|
|
|
* @return -1 on error, 0 if no data is available yet, 1 if data is
|
|
|
|
* available
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
input_curl_select(struct input_curl *c)
|
|
|
|
{
|
|
|
|
fd_set rfds, wfds, efds;
|
|
|
|
int max_fd, ret;
|
|
|
|
CURLMcode mcode;
|
|
|
|
/* XXX hard coded timeout value.. */
|
|
|
|
struct timeval timeout = {
|
|
|
|
.tv_sec = 1,
|
|
|
|
.tv_usec = 0,
|
|
|
|
};
|
|
|
|
|
2009-01-15 16:12:44 +01:00
|
|
|
assert(!c->eof);
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
FD_ZERO(&rfds);
|
|
|
|
FD_ZERO(&wfds);
|
|
|
|
FD_ZERO(&efds);
|
|
|
|
|
|
|
|
mcode = curl_multi_fdset(c->multi, &rfds, &wfds, &efds, &max_fd);
|
|
|
|
if (mcode != CURLM_OK) {
|
|
|
|
g_warning("curl_multi_fdset() failed: %s\n",
|
|
|
|
curl_multi_strerror(mcode));
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(max_fd >= 0);
|
|
|
|
|
|
|
|
ret = select(max_fd + 1, &rfds, &wfds, &efds, &timeout);
|
|
|
|
if (ret < 0)
|
|
|
|
g_warning("select() failed: %s\n", strerror(errno));
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2008-11-21 16:57:55 +01:00
|
|
|
/**
|
|
|
|
* Mark a part of the buffer object as consumed.
|
|
|
|
*/
|
2009-01-07 16:30:43 +01:00
|
|
|
static struct buffer *
|
|
|
|
consume_buffer(struct buffer *buffer, size_t length, GQueue *rewind_buffers)
|
2008-11-21 16:57:55 +01:00
|
|
|
{
|
|
|
|
assert(buffer != NULL);
|
|
|
|
assert(buffer->consumed < buffer->size);
|
|
|
|
|
|
|
|
buffer->consumed += length;
|
|
|
|
if (buffer->consumed < buffer->size)
|
2009-01-07 16:30:43 +01:00
|
|
|
return buffer;
|
2008-11-21 16:57:55 +01:00
|
|
|
|
|
|
|
assert(buffer->consumed == buffer->size);
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
if (rewind_buffers != NULL)
|
2008-11-21 16:57:55 +01:00
|
|
|
/* append this buffer to the rewind buffer list */
|
2009-01-07 16:30:43 +01:00
|
|
|
g_queue_push_tail(rewind_buffers, buffer);
|
2008-11-21 16:57:55 +01:00
|
|
|
else
|
|
|
|
g_free(buffer);
|
2009-01-07 16:30:43 +01:00
|
|
|
|
|
|
|
return NULL;
|
2008-11-21 16:57:55 +01:00
|
|
|
}
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
static size_t
|
2009-01-07 16:30:43 +01:00
|
|
|
read_from_buffer(struct icy_metadata *icy_metadata, GQueue *buffers,
|
2009-01-03 23:55:03 +01:00
|
|
|
void *dest0, size_t length,
|
2009-01-07 16:30:43 +01:00
|
|
|
GQueue *rewind_buffers)
|
2008-10-26 19:32:43 +01:00
|
|
|
{
|
2009-01-07 16:30:43 +01:00
|
|
|
struct buffer *buffer = g_queue_pop_head(buffers);
|
2009-01-03 23:55:03 +01:00
|
|
|
uint8_t *dest = dest0;
|
|
|
|
size_t nbytes = 0;
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
assert(buffer->size > 0);
|
|
|
|
assert(buffer->consumed < buffer->size);
|
|
|
|
|
|
|
|
if (length > buffer->size - buffer->consumed)
|
|
|
|
length = buffer->size - buffer->consumed;
|
|
|
|
|
2009-01-03 23:55:03 +01:00
|
|
|
while (true) {
|
|
|
|
size_t chunk;
|
|
|
|
|
|
|
|
chunk = icy_data(icy_metadata, length);
|
|
|
|
if (chunk > 0) {
|
|
|
|
memcpy(dest, buffer->data + buffer->consumed,
|
|
|
|
chunk);
|
2009-01-07 16:30:43 +01:00
|
|
|
buffer = consume_buffer(buffer, chunk, rewind_buffers);
|
2009-01-03 23:55:03 +01:00
|
|
|
|
|
|
|
nbytes += chunk;
|
|
|
|
dest += chunk;
|
|
|
|
length -= chunk;
|
|
|
|
|
|
|
|
if (length == 0)
|
|
|
|
break;
|
2009-01-07 16:30:43 +01:00
|
|
|
|
|
|
|
assert(buffer != NULL);
|
2009-01-03 23:55:03 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
chunk = icy_meta(icy_metadata, buffer->data + buffer->consumed,
|
|
|
|
length);
|
|
|
|
if (chunk > 0) {
|
2009-01-07 16:30:43 +01:00
|
|
|
buffer = consume_buffer(buffer, chunk, rewind_buffers);
|
2009-01-03 23:55:03 +01:00
|
|
|
|
|
|
|
length -= chunk;
|
|
|
|
|
|
|
|
if (length == 0)
|
|
|
|
break;
|
2009-01-07 16:30:43 +01:00
|
|
|
|
|
|
|
assert(buffer != NULL);
|
2009-01-03 23:55:03 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
if (buffer != NULL)
|
|
|
|
g_queue_push_head(buffers, buffer);
|
|
|
|
|
2009-01-03 23:55:03 +01:00
|
|
|
return nbytes;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
copy_icy_tag(struct input_curl *c)
|
|
|
|
{
|
|
|
|
struct tag *tag = icy_tag(&c->icy_metadata);
|
|
|
|
|
|
|
|
if (tag == NULL)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (c->tag != NULL)
|
|
|
|
tag_free(c->tag);
|
|
|
|
|
|
|
|
if (c->meta_name != NULL && !tag_has_type(tag, TAG_ITEM_NAME))
|
|
|
|
tag_add_item(tag, TAG_ITEM_NAME, c->meta_name);
|
|
|
|
|
|
|
|
c->tag = tag;
|
2008-10-26 19:32:43 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static size_t
|
|
|
|
input_curl_read(struct input_stream *is, void *ptr, size_t size)
|
|
|
|
{
|
|
|
|
struct input_curl *c = is->data;
|
|
|
|
CURLMcode mcode = CURLM_CALL_MULTI_PERFORM;
|
2009-01-07 16:30:43 +01:00
|
|
|
GQueue *rewind_buffers;
|
2008-10-26 19:32:43 +01:00
|
|
|
size_t nbytes = 0;
|
|
|
|
char *dest = ptr;
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
#ifndef NDEBUG
|
|
|
|
if (c->rewind != NULL &&
|
|
|
|
(!g_queue_is_empty(c->rewind) || is->offset == 0)) {
|
|
|
|
off_t offset = 0;
|
|
|
|
struct buffer *buffer;
|
|
|
|
|
|
|
|
for (GList *list = g_queue_peek_head_link(c->rewind);
|
|
|
|
list != NULL; list = g_list_next(list)) {
|
|
|
|
buffer = list->data;
|
|
|
|
offset += buffer->consumed;
|
|
|
|
assert(offset <= is->offset);
|
|
|
|
}
|
|
|
|
|
|
|
|
buffer = g_queue_peek_head(c->buffers);
|
|
|
|
if (buffer != NULL)
|
|
|
|
offset += buffer->consumed;
|
|
|
|
|
|
|
|
assert(offset == is->offset);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
/* fill the buffer */
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
while (!c->eof && g_queue_is_empty(c->buffers)) {
|
2008-10-26 19:32:43 +01:00
|
|
|
int running_handles;
|
2008-11-03 21:49:43 +01:00
|
|
|
bool bret;
|
2008-10-26 19:32:43 +01:00
|
|
|
|
|
|
|
if (mcode != CURLM_CALL_MULTI_PERFORM) {
|
|
|
|
/* if we're still here, there is no input yet
|
|
|
|
- wait for input */
|
|
|
|
int ret = input_curl_select(c);
|
|
|
|
if (ret <= 0)
|
|
|
|
/* no data yet or error */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
mcode = curl_multi_perform(c->multi, &running_handles);
|
|
|
|
if (mcode != CURLM_OK && mcode != CURLM_CALL_MULTI_PERFORM) {
|
|
|
|
g_warning("curl_multi_perform() failed: %s\n",
|
|
|
|
curl_multi_strerror(mcode));
|
|
|
|
c->eof = true;
|
2009-01-15 16:12:22 +01:00
|
|
|
is->ready = true;
|
2008-10-26 19:32:43 +01:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-11-03 21:49:43 +01:00
|
|
|
bret = input_curl_multi_info_read(is);
|
|
|
|
if (!bret)
|
2008-11-06 06:44:19 +01:00
|
|
|
return 0;
|
2008-10-26 19:32:43 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/* send buffer contents */
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
if (c->rewind != NULL &&
|
|
|
|
(!g_queue_is_empty(c->rewind) || is->offset == 0))
|
2008-11-02 17:06:15 +01:00
|
|
|
/* at the beginning or already writing the rewind
|
|
|
|
buffer list */
|
2009-01-07 16:30:43 +01:00
|
|
|
rewind_buffers = c->rewind;
|
2008-11-02 17:06:15 +01:00
|
|
|
else
|
|
|
|
/* we don't need the rewind buffers anymore */
|
2009-01-07 16:30:43 +01:00
|
|
|
rewind_buffers = NULL;
|
2008-11-02 17:06:15 +01:00
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
while (size > 0 && !g_queue_is_empty(c->buffers)) {
|
|
|
|
size_t copy = read_from_buffer(&c->icy_metadata, c->buffers,
|
2009-01-03 23:55:03 +01:00
|
|
|
dest + nbytes, size,
|
2009-01-07 16:30:43 +01:00
|
|
|
rewind_buffers);
|
2008-10-26 19:32:43 +01:00
|
|
|
|
|
|
|
nbytes += copy;
|
|
|
|
size -= copy;
|
|
|
|
}
|
|
|
|
|
2009-01-03 23:55:03 +01:00
|
|
|
if (icy_defined(&c->icy_metadata))
|
|
|
|
copy_icy_tag(c);
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
is->offset += (off_t)nbytes;
|
2008-11-02 17:06:15 +01:00
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
#ifndef NDEBUG
|
|
|
|
if (rewind_buffers != NULL) {
|
|
|
|
off_t offset = 0;
|
|
|
|
struct buffer *buffer;
|
|
|
|
|
|
|
|
for (GList *list = g_queue_peek_head_link(c->rewind);
|
|
|
|
list != NULL; list = g_list_next(list)) {
|
|
|
|
buffer = list->data;
|
|
|
|
offset += buffer->consumed;
|
|
|
|
assert(offset <= is->offset);
|
|
|
|
}
|
2008-11-02 17:06:15 +01:00
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
buffer = g_queue_peek_head(c->buffers);
|
|
|
|
if (buffer != NULL)
|
|
|
|
offset += buffer->consumed;
|
2008-11-02 17:06:15 +01:00
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
assert(offset == is->offset);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (rewind_buffers != NULL && is->offset > max_rewind_size) {
|
|
|
|
/* drop the rewind buffer, it has grown too large */
|
|
|
|
|
|
|
|
g_queue_foreach(c->rewind, buffer_free_callback, NULL);
|
|
|
|
g_queue_clear(c->rewind);
|
2008-11-02 17:06:15 +01:00
|
|
|
}
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
return nbytes;
|
|
|
|
}
|
|
|
|
|
2008-10-26 20:54:52 +01:00
|
|
|
static void
|
2008-10-26 19:32:43 +01:00
|
|
|
input_curl_close(struct input_stream *is)
|
|
|
|
{
|
|
|
|
input_curl_free(is);
|
|
|
|
}
|
|
|
|
|
2008-10-26 20:56:46 +01:00
|
|
|
static bool
|
2008-11-24 14:33:25 +01:00
|
|
|
input_curl_eof(G_GNUC_UNUSED struct input_stream *is)
|
2008-10-26 19:32:43 +01:00
|
|
|
{
|
|
|
|
struct input_curl *c = is->data;
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
return c->eof && g_queue_is_empty(c->buffers);
|
2008-10-26 19:32:43 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2008-11-03 21:49:43 +01:00
|
|
|
input_curl_buffer(struct input_stream *is)
|
2008-10-26 19:32:43 +01:00
|
|
|
{
|
|
|
|
struct input_curl *c = is->data;
|
|
|
|
CURLMcode mcode;
|
|
|
|
int running_handles;
|
2008-11-03 21:49:43 +01:00
|
|
|
bool ret;
|
2008-10-26 19:32:43 +01:00
|
|
|
|
|
|
|
c->buffered = false;
|
|
|
|
|
2009-01-15 16:12:44 +01:00
|
|
|
if (!is->ready && !c->eof)
|
2009-01-13 19:30:34 +01:00
|
|
|
/* not ready yet means the caller is waiting in a busy
|
|
|
|
loop; relax that by calling select() on the
|
|
|
|
socket */
|
|
|
|
input_curl_select(c);
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
do {
|
|
|
|
mcode = curl_multi_perform(c->multi, &running_handles);
|
2009-01-07 16:30:43 +01:00
|
|
|
} while (mcode == CURLM_CALL_MULTI_PERFORM &&
|
|
|
|
g_queue_is_empty(c->buffers));
|
2008-10-26 19:32:43 +01:00
|
|
|
|
|
|
|
if (mcode != CURLM_OK && mcode != CURLM_CALL_MULTI_PERFORM) {
|
|
|
|
g_warning("curl_multi_perform() failed: %s\n",
|
|
|
|
curl_multi_strerror(mcode));
|
|
|
|
c->eof = true;
|
2009-01-15 16:12:22 +01:00
|
|
|
is->ready = true;
|
2008-10-26 19:32:43 +01:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2008-11-03 21:49:43 +01:00
|
|
|
ret = input_curl_multi_info_read(is);
|
|
|
|
if (!ret)
|
|
|
|
return -1;
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
return c->buffered;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** called by curl when new data is available */
|
|
|
|
static size_t
|
|
|
|
input_curl_headerfunction(void *ptr, size_t size, size_t nmemb, void *stream)
|
|
|
|
{
|
|
|
|
struct input_stream *is = stream;
|
2009-01-03 23:29:45 +01:00
|
|
|
struct input_curl *c = is->data;
|
2008-10-26 21:12:56 +01:00
|
|
|
const char *header = ptr, *end, *value;
|
2008-10-26 19:32:43 +01:00
|
|
|
char name[64];
|
|
|
|
|
|
|
|
size *= nmemb;
|
|
|
|
end = header + size;
|
|
|
|
|
2008-10-26 21:12:56 +01:00
|
|
|
value = memchr(header, ':', size);
|
|
|
|
if (value == NULL || (size_t)(value - header) >= sizeof(name))
|
2008-10-26 19:32:43 +01:00
|
|
|
return size;
|
|
|
|
|
2008-10-26 21:12:56 +01:00
|
|
|
memcpy(name, header, value - header);
|
|
|
|
name[value - header] = 0;
|
|
|
|
|
|
|
|
/* skip the colon */
|
|
|
|
|
|
|
|
++value;
|
|
|
|
|
|
|
|
/* strip the value */
|
|
|
|
|
|
|
|
while (value < end && g_ascii_isspace(*value))
|
|
|
|
++value;
|
|
|
|
|
|
|
|
while (end > value && g_ascii_isspace(end[-1]))
|
|
|
|
--end;
|
2008-10-26 19:32:43 +01:00
|
|
|
|
2009-01-03 23:55:03 +01:00
|
|
|
if (strcasecmp(name, "accept-ranges") == 0) {
|
|
|
|
/* a stream with icy-metadata is not seekable */
|
|
|
|
if (!icy_defined(&c->icy_metadata))
|
|
|
|
is->seekable = true;
|
|
|
|
} else if (strcasecmp(name, "content-length") == 0) {
|
2008-10-26 21:12:56 +01:00
|
|
|
char buffer[64];
|
2008-10-26 19:32:43 +01:00
|
|
|
|
2008-10-26 21:12:56 +01:00
|
|
|
if ((size_t)(end - header) >= sizeof(buffer))
|
2008-10-26 19:32:43 +01:00
|
|
|
return size;
|
|
|
|
|
2008-10-26 21:12:56 +01:00
|
|
|
memcpy(buffer, value, end - value);
|
|
|
|
buffer[end - value] = 0;
|
2008-10-26 19:32:43 +01:00
|
|
|
|
2008-10-26 21:12:56 +01:00
|
|
|
is->size = is->offset + g_ascii_strtoull(buffer, NULL, 10);
|
2008-10-26 21:19:32 +01:00
|
|
|
} else if (strcasecmp(name, "content-type") == 0) {
|
|
|
|
g_free(is->mime);
|
|
|
|
is->mime = g_strndup(value, end - value);
|
2008-10-26 21:20:02 +01:00
|
|
|
} else if (strcasecmp(name, "icy-name") == 0 ||
|
|
|
|
strcasecmp(name, "ice-name") == 0 ||
|
|
|
|
strcasecmp(name, "x-audiocast-name") == 0) {
|
2009-01-03 23:29:45 +01:00
|
|
|
g_free(c->meta_name);
|
|
|
|
c->meta_name = g_strndup(value, end - value);
|
|
|
|
|
|
|
|
if (c->tag != NULL)
|
|
|
|
tag_free(c->tag);
|
|
|
|
|
|
|
|
c->tag = tag_new();
|
|
|
|
tag_add_item(c->tag, TAG_ITEM_NAME, c->meta_name);
|
2009-01-03 23:55:03 +01:00
|
|
|
} else if (strcasecmp(name, "icy-metaint") == 0) {
|
|
|
|
char buffer[64];
|
|
|
|
size_t icy_metaint;
|
|
|
|
|
|
|
|
if ((size_t)(end - header) >= sizeof(buffer) ||
|
|
|
|
icy_defined(&c->icy_metadata))
|
|
|
|
return size;
|
|
|
|
|
|
|
|
memcpy(buffer, value, end - value);
|
|
|
|
buffer[end - value] = 0;
|
|
|
|
|
|
|
|
icy_metaint = g_ascii_strtoull(buffer, NULL, 10);
|
|
|
|
g_debug("icy-metaint=%zu", icy_metaint);
|
|
|
|
|
|
|
|
if (icy_metaint > 0) {
|
|
|
|
icy_start(&c->icy_metadata, icy_metaint);
|
|
|
|
|
|
|
|
/* a stream with icy-metadata is not
|
|
|
|
seekable */
|
2009-01-07 10:31:30 +01:00
|
|
|
is->seekable = false;
|
2009-01-07 16:30:43 +01:00
|
|
|
|
|
|
|
if (c->rewind != NULL) {
|
|
|
|
/* rewinding with icy-metadata is too
|
|
|
|
hairy for me .. */
|
|
|
|
assert(g_queue_is_empty(c->rewind));
|
|
|
|
|
|
|
|
g_queue_free(c->rewind);
|
|
|
|
c->rewind = NULL;
|
|
|
|
}
|
2009-01-03 23:55:03 +01:00
|
|
|
}
|
2008-10-26 19:32:43 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return size;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** called by curl when new data is available */
|
|
|
|
static size_t
|
|
|
|
input_curl_writefunction(void *ptr, size_t size, size_t nmemb, void *stream)
|
|
|
|
{
|
|
|
|
struct input_stream *is = stream;
|
|
|
|
struct input_curl *c = is->data;
|
|
|
|
struct buffer *buffer;
|
|
|
|
|
|
|
|
size *= nmemb;
|
|
|
|
if (size == 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
buffer = g_malloc(sizeof(*buffer) - sizeof(buffer->data) + size);
|
|
|
|
buffer->size = size;
|
|
|
|
buffer->consumed = 0;
|
|
|
|
memcpy(buffer->data, ptr, size);
|
2009-01-07 16:30:43 +01:00
|
|
|
g_queue_push_tail(c->buffers, buffer);
|
2008-10-26 19:32:43 +01:00
|
|
|
|
|
|
|
c->buffered = true;
|
|
|
|
is->ready = true;
|
|
|
|
|
|
|
|
return size;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool
|
|
|
|
input_curl_easy_init(struct input_stream *is)
|
|
|
|
{
|
|
|
|
struct input_curl *c = is->data;
|
|
|
|
CURLcode code;
|
|
|
|
CURLMcode mcode;
|
2009-01-25 16:00:51 +01:00
|
|
|
const char *proxy_host;
|
|
|
|
const char *proxy_port;
|
|
|
|
const char *proxy_user;
|
|
|
|
const char *proxy_pass;
|
2008-10-26 19:32:43 +01:00
|
|
|
|
|
|
|
c->eof = false;
|
|
|
|
|
|
|
|
c->easy = curl_easy_init();
|
|
|
|
if (c->easy == NULL) {
|
|
|
|
g_warning("curl_easy_init() failed\n");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
mcode = curl_multi_add_handle(c->multi, c->easy);
|
|
|
|
if (mcode != CURLM_OK)
|
|
|
|
return false;
|
|
|
|
|
2008-11-30 13:06:18 +01:00
|
|
|
curl_easy_setopt(c->easy, CURLOPT_USERAGENT,
|
|
|
|
"Music Player Daemon " VERSION);
|
2008-10-26 19:32:43 +01:00
|
|
|
curl_easy_setopt(c->easy, CURLOPT_HEADERFUNCTION,
|
|
|
|
input_curl_headerfunction);
|
|
|
|
curl_easy_setopt(c->easy, CURLOPT_WRITEHEADER, is);
|
|
|
|
curl_easy_setopt(c->easy, CURLOPT_WRITEFUNCTION,
|
|
|
|
input_curl_writefunction);
|
|
|
|
curl_easy_setopt(c->easy, CURLOPT_WRITEDATA, is);
|
|
|
|
curl_easy_setopt(c->easy, CURLOPT_HTTP200ALIASES, http_200_aliases);
|
2008-11-30 13:06:21 +01:00
|
|
|
curl_easy_setopt(c->easy, CURLOPT_FOLLOWLOCATION, 1);
|
|
|
|
curl_easy_setopt(c->easy, CURLOPT_MAXREDIRS, 5);
|
2008-11-06 06:36:25 +01:00
|
|
|
curl_easy_setopt(c->easy, CURLOPT_FAILONERROR, true);
|
2008-11-06 06:48:30 +01:00
|
|
|
curl_easy_setopt(c->easy, CURLOPT_ERRORBUFFER, c->error);
|
2008-10-26 19:32:43 +01:00
|
|
|
|
2009-01-25 16:00:51 +01:00
|
|
|
proxy_host = config_get_string(CONF_HTTP_PROXY_HOST, NULL);
|
|
|
|
proxy_port = config_get_string(CONF_HTTP_PROXY_PORT, NULL);
|
2009-01-13 22:57:05 +01:00
|
|
|
|
|
|
|
if (proxy_host != NULL) {
|
|
|
|
char *proxy_host_str;
|
|
|
|
|
|
|
|
if (proxy_port == NULL) {
|
2009-01-25 16:00:51 +01:00
|
|
|
proxy_host_str = g_strdup(proxy_host);
|
2009-01-13 22:57:05 +01:00
|
|
|
} else {
|
|
|
|
proxy_host_str =
|
2009-01-25 16:00:51 +01:00
|
|
|
g_strconcat(proxy_host, ":", proxy_port, NULL);
|
2009-01-13 22:57:05 +01:00
|
|
|
}
|
|
|
|
curl_easy_setopt(c->easy, CURLOPT_PROXY, proxy_host_str);
|
|
|
|
g_free(proxy_host_str);
|
|
|
|
}
|
|
|
|
|
2009-01-25 16:00:51 +01:00
|
|
|
proxy_user = config_get_string(CONF_HTTP_PROXY_USER, NULL);
|
|
|
|
proxy_pass = config_get_string(CONF_HTTP_PROXY_PASSWORD, NULL);
|
|
|
|
|
2009-01-13 22:57:05 +01:00
|
|
|
if ((proxy_user != NULL) && (proxy_pass != NULL)) {
|
|
|
|
char *proxy_auth_str =
|
2009-01-25 16:00:51 +01:00
|
|
|
g_strconcat(proxy_user, ":", proxy_pass, NULL);
|
2009-01-13 22:57:05 +01:00
|
|
|
curl_easy_setopt(c->easy, CURLOPT_PROXYUSERPWD, proxy_auth_str);
|
|
|
|
g_free(proxy_auth_str);
|
|
|
|
}
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
code = curl_easy_setopt(c->easy, CURLOPT_URL, c->url);
|
|
|
|
if (code != CURLE_OK)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
c->request_headers = NULL;
|
|
|
|
c->request_headers = curl_slist_append(c->request_headers,
|
|
|
|
"Icy-Metadata: 1");
|
|
|
|
curl_easy_setopt(c->easy, CURLOPT_HTTPHEADER, c->request_headers);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool
|
|
|
|
input_curl_send_request(struct input_curl *c)
|
|
|
|
{
|
|
|
|
CURLMcode mcode;
|
|
|
|
int running_handles;
|
|
|
|
|
|
|
|
do {
|
|
|
|
mcode = curl_multi_perform(c->multi, &running_handles);
|
|
|
|
} while (mcode == CURLM_CALL_MULTI_PERFORM);
|
|
|
|
|
|
|
|
if (mcode != CURLM_OK) {
|
|
|
|
g_warning("curl_multi_perform() failed: %s\n",
|
|
|
|
curl_multi_strerror(mcode));
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2008-11-02 17:06:15 +01:00
|
|
|
static bool
|
|
|
|
input_curl_can_rewind(struct input_stream *is)
|
|
|
|
{
|
|
|
|
struct input_curl *c = is->data;
|
|
|
|
struct buffer *buffer;
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
if (c->rewind == NULL)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!g_queue_is_empty(c->rewind))
|
2008-11-02 17:06:15 +01:00
|
|
|
/* the rewind buffer hasn't been wiped yet */
|
|
|
|
return true;
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
if (g_queue_is_empty(c->buffers))
|
2008-11-02 17:06:15 +01:00
|
|
|
/* there are no buffers at all - cheap rewind not
|
|
|
|
possible */
|
|
|
|
return false;
|
|
|
|
|
|
|
|
/* rewind is possible if this is the very first buffer of the
|
|
|
|
resource */
|
2009-01-07 16:30:43 +01:00
|
|
|
buffer = (struct buffer*)g_queue_peek_head(c->buffers);
|
2008-11-02 17:06:15 +01:00
|
|
|
return (off_t)buffer->consumed == is->offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
input_curl_rewind(struct input_stream *is)
|
|
|
|
{
|
|
|
|
struct input_curl *c = is->data;
|
|
|
|
#ifndef NDEBUG
|
|
|
|
off_t offset = 0;
|
|
|
|
#endif
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
assert(c->rewind != NULL);
|
2008-11-02 17:06:15 +01:00
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
/* rewind the current buffer */
|
|
|
|
|
|
|
|
if (!g_queue_is_empty(c->buffers)) {
|
|
|
|
struct buffer *buffer =
|
|
|
|
(struct buffer*)g_queue_peek_head(c->buffers);
|
2008-11-02 17:06:15 +01:00
|
|
|
#ifndef NDEBUG
|
|
|
|
offset += buffer->consumed;
|
|
|
|
#endif
|
|
|
|
buffer->consumed = 0;
|
|
|
|
}
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
/* reset and move all rewind buffers back to the regular buffer list */
|
2008-11-02 17:06:15 +01:00
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
while (!g_queue_is_empty(c->rewind)) {
|
|
|
|
struct buffer *buffer =
|
|
|
|
(struct buffer*)g_queue_pop_tail(c->rewind);
|
2008-11-02 17:06:15 +01:00
|
|
|
#ifndef NDEBUG
|
|
|
|
offset += buffer->consumed;
|
|
|
|
#endif
|
|
|
|
buffer->consumed = 0;
|
2009-01-07 16:30:43 +01:00
|
|
|
g_queue_push_head(c->buffers, buffer);
|
2008-11-02 17:06:15 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
assert(offset == is->offset);
|
|
|
|
|
|
|
|
is->offset = 0;
|
2009-01-03 23:55:03 +01:00
|
|
|
|
|
|
|
/* rewind the icy_metadata object */
|
|
|
|
|
|
|
|
icy_reset(&c->icy_metadata);
|
2008-11-02 17:06:15 +01:00
|
|
|
}
|
|
|
|
|
2008-10-26 20:56:46 +01:00
|
|
|
static bool
|
2008-10-28 20:39:09 +01:00
|
|
|
input_curl_seek(struct input_stream *is, off_t offset, int whence)
|
2008-10-26 19:32:43 +01:00
|
|
|
{
|
|
|
|
struct input_curl *c = is->data;
|
|
|
|
bool ret;
|
|
|
|
|
2009-01-15 16:12:22 +01:00
|
|
|
assert(is->ready);
|
|
|
|
|
2008-11-02 17:06:15 +01:00
|
|
|
if (whence == SEEK_SET && offset == 0) {
|
|
|
|
if (is->offset == 0)
|
|
|
|
/* no-op */
|
|
|
|
return true;
|
|
|
|
|
|
|
|
if (input_curl_can_rewind(is)) {
|
|
|
|
/* we have enough rewind buffers left */
|
|
|
|
input_curl_rewind(is);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
if (!is->seekable)
|
2008-10-26 20:56:46 +01:00
|
|
|
return false;
|
2008-10-26 19:32:43 +01:00
|
|
|
|
|
|
|
/* calculate the absolute offset */
|
|
|
|
|
|
|
|
switch (whence) {
|
|
|
|
case SEEK_SET:
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SEEK_CUR:
|
2008-11-21 16:56:10 +01:00
|
|
|
offset += is->offset;
|
2008-10-26 19:32:43 +01:00
|
|
|
break;
|
|
|
|
|
|
|
|
case SEEK_END:
|
2008-11-16 20:42:08 +01:00
|
|
|
if (is->size < 0)
|
|
|
|
/* stream size is not known */
|
|
|
|
return false;
|
|
|
|
|
2008-11-21 16:56:10 +01:00
|
|
|
offset += is->size;
|
2008-10-26 19:32:43 +01:00
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
2008-10-26 20:56:46 +01:00
|
|
|
return false;
|
2008-10-26 19:32:43 +01:00
|
|
|
}
|
|
|
|
|
2008-11-21 16:56:10 +01:00
|
|
|
if (offset < 0)
|
2008-10-26 20:56:46 +01:00
|
|
|
return false;
|
2008-10-26 19:32:43 +01:00
|
|
|
|
2008-11-21 17:10:20 +01:00
|
|
|
/* check if we can fast-forward the buffer */
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
while (offset > is->offset && !g_queue_is_empty(c->buffers)) {
|
|
|
|
GQueue *rewind_buffers;
|
|
|
|
struct buffer *buffer;
|
2008-11-21 17:10:20 +01:00
|
|
|
size_t length;
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
if (c->rewind != NULL &&
|
|
|
|
(!g_queue_is_empty(c->rewind) || is->offset == 0))
|
2008-11-21 17:10:20 +01:00
|
|
|
/* at the beginning or already writing the rewind
|
|
|
|
buffer list */
|
2009-01-07 16:30:43 +01:00
|
|
|
rewind_buffers = c->rewind;
|
2008-11-21 17:10:20 +01:00
|
|
|
else
|
|
|
|
/* we don't need the rewind buffers anymore */
|
2009-01-07 16:30:43 +01:00
|
|
|
rewind_buffers = NULL;
|
|
|
|
|
|
|
|
buffer = (struct buffer *)g_queue_pop_head(c->buffers);
|
2008-11-21 17:10:20 +01:00
|
|
|
|
|
|
|
length = buffer->size - buffer->consumed;
|
|
|
|
if (offset - is->offset < (off_t)length)
|
|
|
|
length = offset - is->offset;
|
|
|
|
|
2009-01-07 16:30:43 +01:00
|
|
|
buffer = consume_buffer(buffer, length, rewind_buffers);
|
|
|
|
if (buffer != NULL)
|
|
|
|
g_queue_push_head(c->buffers, buffer);
|
|
|
|
|
2008-11-21 17:10:20 +01:00
|
|
|
is->offset += length;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (offset == is->offset)
|
|
|
|
return true;
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
/* close the old connection and open a new one */
|
|
|
|
|
|
|
|
input_curl_easy_free(c);
|
|
|
|
|
2008-11-21 16:56:10 +01:00
|
|
|
is->offset = offset;
|
2008-11-20 12:45:17 +01:00
|
|
|
if (is->offset == is->size) {
|
|
|
|
/* seek to EOF: simulate empty result; avoid
|
|
|
|
triggering a "416 Requested Range Not Satisfiable"
|
|
|
|
response */
|
|
|
|
c->eof = true;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
ret = input_curl_easy_init(is);
|
|
|
|
if (!ret)
|
2008-10-26 20:56:46 +01:00
|
|
|
return false;
|
2008-10-26 19:32:43 +01:00
|
|
|
|
|
|
|
/* send the "Range" header */
|
|
|
|
|
|
|
|
if (is->offset > 0) {
|
2008-10-28 20:39:09 +01:00
|
|
|
c->range = g_strdup_printf("%lld-", (long long)is->offset);
|
2008-10-26 19:32:43 +01:00
|
|
|
curl_easy_setopt(c->easy, CURLOPT_RANGE, c->range);
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = input_curl_send_request(c);
|
|
|
|
if (!ret)
|
2008-10-26 20:56:46 +01:00
|
|
|
return false;
|
2008-10-26 19:32:43 +01:00
|
|
|
|
2008-11-20 12:42:42 +01:00
|
|
|
return input_curl_multi_info_read(is);
|
2008-10-26 19:32:43 +01:00
|
|
|
}
|
|
|
|
|
2008-10-26 20:38:44 +01:00
|
|
|
static bool
|
|
|
|
input_curl_open(struct input_stream *is, const char *url)
|
2008-10-26 19:32:43 +01:00
|
|
|
{
|
|
|
|
struct input_curl *c;
|
|
|
|
bool ret;
|
|
|
|
|
2008-10-27 10:10:24 +01:00
|
|
|
if (strncmp(url, "http://", 7) != 0)
|
|
|
|
return false;
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
c = g_new0(struct input_curl, 1);
|
|
|
|
c->url = g_strdup(url);
|
2009-01-07 16:30:43 +01:00
|
|
|
c->buffers = g_queue_new();
|
|
|
|
c->rewind = g_queue_new();
|
2008-10-26 19:32:43 +01:00
|
|
|
|
|
|
|
is->data = c;
|
|
|
|
|
|
|
|
c->multi = curl_multi_init();
|
|
|
|
if (c->multi == NULL) {
|
|
|
|
g_warning("curl_multi_init() failed\n");
|
|
|
|
|
|
|
|
input_curl_free(is);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-01-03 23:55:03 +01:00
|
|
|
icy_clear(&c->icy_metadata);
|
2009-01-03 23:29:45 +01:00
|
|
|
c->tag = NULL;
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
ret = input_curl_easy_init(is);
|
|
|
|
if (!ret) {
|
|
|
|
input_curl_free(is);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = input_curl_send_request(c);
|
|
|
|
if (!ret) {
|
|
|
|
input_curl_free(is);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-01-15 16:12:11 +01:00
|
|
|
ret = input_curl_multi_info_read(is);
|
|
|
|
if (!ret) {
|
|
|
|
input_curl_free(is);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2008-10-26 19:32:43 +01:00
|
|
|
return true;
|
|
|
|
}
|
2008-10-26 20:38:44 +01:00
|
|
|
|
|
|
|
const struct input_plugin input_plugin_curl = {
|
|
|
|
.open = input_curl_open,
|
|
|
|
.close = input_curl_close,
|
2009-01-03 23:29:45 +01:00
|
|
|
.tag = input_curl_tag,
|
2008-10-26 20:38:44 +01:00
|
|
|
.buffer = input_curl_buffer,
|
|
|
|
.read = input_curl_read,
|
|
|
|
.eof = input_curl_eof,
|
|
|
|
.seek = input_curl_seek,
|
|
|
|
};
|