2010-02-07 10:25:58 +00:00
|
|
|
/*
|
|
|
|
* Concat URL protocol
|
|
|
|
* Copyright (c) 2006 Steve Lhomme
|
|
|
|
* Copyright (c) 2007 Wolfram Gloger
|
|
|
|
* Copyright (c) 2010 Michele Orrù
|
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* This file is part of Libav.
|
2010-02-07 10:25:58 +00:00
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* Libav is free software; you can redistribute it and/or
|
2010-02-07 10:25:58 +00:00
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* Libav is distributed in the hope that it will be useful,
|
2010-02-07 10:25:58 +00:00
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
2011-03-18 17:35:10 +00:00
|
|
|
* License along with Libav; if not, write to the Free Software
|
2010-02-07 10:25:58 +00:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "libavutil/avstring.h"
|
|
|
|
#include "libavutil/mem.h"
|
2014-09-23 14:29:57 +00:00
|
|
|
|
|
|
|
#include "avformat.h"
|
2011-03-31 14:25:10 +00:00
|
|
|
#include "url.h"
|
2010-02-07 10:25:58 +00:00
|
|
|
|
|
|
|
#define AV_CAT_SEPARATOR "|"
|
|
|
|
|
|
|
|
struct concat_nodes {
|
|
|
|
URLContext *uc; ///< node's URLContext
|
|
|
|
int64_t size; ///< url filesize
|
|
|
|
};
|
|
|
|
|
|
|
|
struct concat_data {
|
|
|
|
struct concat_nodes *nodes; ///< list of nodes to concat
|
|
|
|
size_t length; ///< number of cat'ed nodes
|
|
|
|
size_t current; ///< index of currently read node
|
|
|
|
};
|
|
|
|
|
|
|
|
static av_cold int concat_close(URLContext *h)
|
|
|
|
{
|
|
|
|
int err = 0;
|
|
|
|
size_t i;
|
|
|
|
struct concat_data *data = h->priv_data;
|
|
|
|
struct concat_nodes *nodes = data->nodes;
|
|
|
|
|
|
|
|
for (i = 0; i != data->length; i++)
|
2011-03-31 15:36:06 +00:00
|
|
|
err |= ffurl_close(nodes[i].uc);
|
2010-02-07 10:25:58 +00:00
|
|
|
|
|
|
|
av_freep(&data->nodes);
|
|
|
|
|
|
|
|
return err < 0 ? -1 : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static av_cold int concat_open(URLContext *h, const char *uri, int flags)
|
|
|
|
{
|
2013-09-18 16:12:36 +00:00
|
|
|
char *node_uri = NULL;
|
2010-02-07 10:25:58 +00:00
|
|
|
int err = 0;
|
|
|
|
int64_t size;
|
2014-09-23 14:29:57 +00:00
|
|
|
size_t len, i;
|
2010-02-07 10:25:58 +00:00
|
|
|
URLContext *uc;
|
2011-12-01 09:44:21 +00:00
|
|
|
struct concat_data *data = h->priv_data;
|
2010-02-07 10:25:58 +00:00
|
|
|
struct concat_nodes *nodes;
|
|
|
|
|
|
|
|
av_strstart(uri, "concat:", &uri);
|
|
|
|
|
2014-09-23 14:29:57 +00:00
|
|
|
for (i = 0, len = 1; uri[i]; i++) {
|
|
|
|
if (uri[i] == *AV_CAT_SEPARATOR) {
|
2010-02-07 10:25:58 +00:00
|
|
|
/* integer overflow */
|
|
|
|
if (++len == UINT_MAX / sizeof(*nodes)) {
|
|
|
|
av_freep(&h->priv_data);
|
|
|
|
return AVERROR(ENAMETOOLONG);
|
|
|
|
}
|
2014-09-23 14:29:57 +00:00
|
|
|
}
|
|
|
|
}
|
2010-02-07 10:25:58 +00:00
|
|
|
|
2014-09-23 14:29:57 +00:00
|
|
|
if (!(nodes = av_realloc(NULL, sizeof(*nodes) * len)))
|
2010-02-07 10:25:58 +00:00
|
|
|
return AVERROR(ENOMEM);
|
2014-09-23 14:29:57 +00:00
|
|
|
else
|
2010-02-07 10:25:58 +00:00
|
|
|
data->nodes = nodes;
|
|
|
|
|
|
|
|
/* handle input */
|
|
|
|
if (!*uri)
|
|
|
|
err = AVERROR(ENOENT);
|
|
|
|
for (i = 0; *uri; i++) {
|
|
|
|
/* parsing uri */
|
|
|
|
len = strcspn(uri, AV_CAT_SEPARATOR);
|
2013-09-18 16:12:36 +00:00
|
|
|
if ((err = av_reallocp(&node_uri, len + 1)) < 0)
|
2010-02-07 10:25:58 +00:00
|
|
|
break;
|
2014-09-23 14:29:57 +00:00
|
|
|
av_strlcpy(node_uri, uri, len + 1);
|
|
|
|
uri += len + strspn(uri + len, AV_CAT_SEPARATOR);
|
2010-02-07 10:25:58 +00:00
|
|
|
|
|
|
|
/* creating URLContext */
|
2011-11-05 09:04:04 +00:00
|
|
|
if ((err = ffurl_open(&uc, node_uri, flags,
|
2015-02-28 00:00:50 +00:00
|
|
|
&h->interrupt_callback, NULL, h->protocols, h)) < 0)
|
2010-02-07 10:25:58 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
/* creating size */
|
2011-03-31 15:46:00 +00:00
|
|
|
if ((size = ffurl_size(uc)) < 0) {
|
2011-03-31 15:36:06 +00:00
|
|
|
ffurl_close(uc);
|
2010-02-07 10:25:58 +00:00
|
|
|
err = AVERROR(ENOSYS);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* assembling */
|
|
|
|
nodes[i].uc = uc;
|
|
|
|
nodes[i].size = size;
|
|
|
|
}
|
|
|
|
av_free(node_uri);
|
|
|
|
data->length = i;
|
|
|
|
|
|
|
|
if (err < 0)
|
|
|
|
concat_close(h);
|
2013-09-18 16:12:36 +00:00
|
|
|
else if ((err = av_reallocp(&nodes, data->length * sizeof(*nodes))) < 0)
|
2010-02-07 10:25:58 +00:00
|
|
|
concat_close(h);
|
2013-09-18 16:12:36 +00:00
|
|
|
else
|
2010-02-07 10:25:58 +00:00
|
|
|
data->nodes = nodes;
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int concat_read(URLContext *h, unsigned char *buf, int size)
|
|
|
|
{
|
|
|
|
int result, total = 0;
|
|
|
|
struct concat_data *data = h->priv_data;
|
|
|
|
struct concat_nodes *nodes = data->nodes;
|
2014-09-23 14:29:57 +00:00
|
|
|
size_t i = data->current;
|
2010-02-07 10:25:58 +00:00
|
|
|
|
|
|
|
while (size > 0) {
|
2011-03-31 14:31:43 +00:00
|
|
|
result = ffurl_read(nodes[i].uc, buf, size);
|
2010-02-07 10:25:58 +00:00
|
|
|
if (result < 0)
|
|
|
|
return total ? total : result;
|
2014-09-23 14:29:57 +00:00
|
|
|
if (!result) {
|
2010-02-07 10:25:58 +00:00
|
|
|
if (i + 1 == data->length ||
|
2011-03-31 15:30:31 +00:00
|
|
|
ffurl_seek(nodes[++i].uc, 0, SEEK_SET) < 0)
|
2010-02-07 10:25:58 +00:00
|
|
|
break;
|
2014-09-23 14:29:57 +00:00
|
|
|
}
|
2010-02-07 10:25:58 +00:00
|
|
|
total += result;
|
|
|
|
buf += result;
|
|
|
|
size -= result;
|
|
|
|
}
|
|
|
|
data->current = i;
|
|
|
|
return total;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int64_t concat_seek(URLContext *h, int64_t pos, int whence)
|
|
|
|
{
|
|
|
|
int64_t result;
|
|
|
|
struct concat_data *data = h->priv_data;
|
|
|
|
struct concat_nodes *nodes = data->nodes;
|
|
|
|
size_t i;
|
|
|
|
|
|
|
|
switch (whence) {
|
|
|
|
case SEEK_END:
|
2014-09-23 14:29:57 +00:00
|
|
|
for (i = data->length - 1; i && pos < -nodes[i].size; i--)
|
2010-03-08 00:40:22 +00:00
|
|
|
pos += nodes[i].size;
|
2010-02-07 10:25:58 +00:00
|
|
|
break;
|
|
|
|
case SEEK_CUR:
|
|
|
|
/* get the absolute position */
|
|
|
|
for (i = 0; i != data->current; i++)
|
|
|
|
pos += nodes[i].size;
|
2011-03-31 15:30:31 +00:00
|
|
|
pos += ffurl_seek(nodes[i].uc, 0, SEEK_CUR);
|
2010-02-07 10:25:58 +00:00
|
|
|
whence = SEEK_SET;
|
|
|
|
/* fall through with the absolute position */
|
|
|
|
case SEEK_SET:
|
|
|
|
for (i = 0; i != data->length - 1 && pos >= nodes[i].size; i++)
|
|
|
|
pos -= nodes[i].size;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return AVERROR(EINVAL);
|
|
|
|
}
|
|
|
|
|
2011-03-31 15:30:31 +00:00
|
|
|
result = ffurl_seek(nodes[i].uc, pos, whence);
|
2010-02-07 10:25:58 +00:00
|
|
|
if (result >= 0) {
|
|
|
|
data->current = i;
|
|
|
|
while (i)
|
2010-03-08 00:22:03 +00:00
|
|
|
result += nodes[--i].size;
|
2010-02-07 10:25:58 +00:00
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2016-02-19 09:39:29 +00:00
|
|
|
const URLProtocol ff_concat_protocol = {
|
2011-12-01 09:53:57 +00:00
|
|
|
.name = "concat",
|
|
|
|
.url_open = concat_open,
|
|
|
|
.url_read = concat_read,
|
|
|
|
.url_seek = concat_seek,
|
|
|
|
.url_close = concat_close,
|
2011-12-01 09:44:21 +00:00
|
|
|
.priv_data_size = sizeof(struct concat_data),
|
2010-02-07 10:25:58 +00:00
|
|
|
};
|