concat.c 5.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193
  1. /*
  2. * Concat URL protocol
  3. * Copyright (c) 2006 Steve Lhomme
  4. * Copyright (c) 2007 Wolfram Gloger
  5. * Copyright (c) 2010 Michele Orrù
  6. *
  7. * This file is part of FFmpeg.
  8. *
  9. * FFmpeg is free software; you can redistribute it and/or
  10. * modify it under the terms of the GNU Lesser General Public
  11. * License as published by the Free Software Foundation; either
  12. * version 2.1 of the License, or (at your option) any later version.
  13. *
  14. * FFmpeg is distributed in the hope that it will be useful,
  15. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  17. * Lesser General Public License for more details.
  18. *
  19. * You should have received a copy of the GNU Lesser General Public
  20. * License along with FFmpeg; if not, write to the Free Software
  21. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  22. */
  23. #include "avformat.h"
  24. #include "libavutil/avstring.h"
  25. #include "libavutil/mem.h"
  26. #include "url.h"
  27. #define AV_CAT_SEPARATOR "|"
  28. struct concat_nodes {
  29. URLContext *uc; ///< node's URLContext
  30. int64_t size; ///< url filesize
  31. };
  32. struct concat_data {
  33. struct concat_nodes *nodes; ///< list of nodes to concat
  34. size_t length; ///< number of cat'ed nodes
  35. size_t current; ///< index of currently read node
  36. };
  37. static av_cold int concat_close(URLContext *h)
  38. {
  39. int err = 0;
  40. size_t i;
  41. struct concat_data *data = h->priv_data;
  42. struct concat_nodes *nodes = data->nodes;
  43. for (i = 0; i != data->length; i++)
  44. err |= ffurl_close(nodes[i].uc);
  45. av_freep(&data->nodes);
  46. return err < 0 ? -1 : 0;
  47. }
  48. static av_cold int concat_open(URLContext *h, const char *uri, int flags)
  49. {
  50. char *node_uri = NULL, *tmp_uri;
  51. int err = 0;
  52. int64_t size;
  53. size_t len, i;
  54. URLContext *uc;
  55. struct concat_data *data = h->priv_data;
  56. struct concat_nodes *nodes;
  57. av_strstart(uri, "concat:", &uri);
  58. for (i = 0, len = 1; uri[i]; i++)
  59. if (uri[i] == *AV_CAT_SEPARATOR)
  60. /* integer overflow */
  61. if (++len == UINT_MAX / sizeof(*nodes)) {
  62. av_freep(&h->priv_data);
  63. return AVERROR(ENAMETOOLONG);
  64. }
  65. if (!(nodes = av_malloc(sizeof(*nodes) * len))) {
  66. return AVERROR(ENOMEM);
  67. } else
  68. data->nodes = nodes;
  69. /* handle input */
  70. if (!*uri)
  71. err = AVERROR(ENOENT);
  72. for (i = 0; *uri; i++) {
  73. /* parsing uri */
  74. len = strcspn(uri, AV_CAT_SEPARATOR);
  75. if (!(tmp_uri = av_realloc(node_uri, len+1))) {
  76. err = AVERROR(ENOMEM);
  77. break;
  78. } else
  79. node_uri = tmp_uri;
  80. av_strlcpy(node_uri, uri, len+1);
  81. uri += len + strspn(uri+len, AV_CAT_SEPARATOR);
  82. /* creating URLContext */
  83. if ((err = ffurl_open(&uc, node_uri, flags,
  84. &h->interrupt_callback, NULL)) < 0)
  85. break;
  86. /* creating size */
  87. if ((size = ffurl_size(uc)) < 0) {
  88. ffurl_close(uc);
  89. err = AVERROR(ENOSYS);
  90. break;
  91. }
  92. /* assembling */
  93. nodes[i].uc = uc;
  94. nodes[i].size = size;
  95. }
  96. av_free(node_uri);
  97. data->length = i;
  98. if (err < 0)
  99. concat_close(h);
  100. else if (!(nodes = av_realloc(nodes, data->length * sizeof(*nodes)))) {
  101. concat_close(h);
  102. err = AVERROR(ENOMEM);
  103. } else
  104. data->nodes = nodes;
  105. return err;
  106. }
  107. static int concat_read(URLContext *h, unsigned char *buf, int size)
  108. {
  109. int result, total = 0;
  110. struct concat_data *data = h->priv_data;
  111. struct concat_nodes *nodes = data->nodes;
  112. size_t i = data->current;
  113. while (size > 0) {
  114. result = ffurl_read(nodes[i].uc, buf, size);
  115. if (result < 0)
  116. return total ? total : result;
  117. if (!result)
  118. if (i + 1 == data->length ||
  119. ffurl_seek(nodes[++i].uc, 0, SEEK_SET) < 0)
  120. break;
  121. total += result;
  122. buf += result;
  123. size -= result;
  124. }
  125. data->current = i;
  126. return total;
  127. }
  128. static int64_t concat_seek(URLContext *h, int64_t pos, int whence)
  129. {
  130. int64_t result;
  131. struct concat_data *data = h->priv_data;
  132. struct concat_nodes *nodes = data->nodes;
  133. size_t i;
  134. switch (whence) {
  135. case SEEK_END:
  136. for (i = data->length - 1;
  137. i && pos < -nodes[i].size;
  138. i--)
  139. pos += nodes[i].size;
  140. break;
  141. case SEEK_CUR:
  142. /* get the absolute position */
  143. for (i = 0; i != data->current; i++)
  144. pos += nodes[i].size;
  145. pos += ffurl_seek(nodes[i].uc, 0, SEEK_CUR);
  146. whence = SEEK_SET;
  147. /* fall through with the absolute position */
  148. case SEEK_SET:
  149. for (i = 0; i != data->length - 1 && pos >= nodes[i].size; i++)
  150. pos -= nodes[i].size;
  151. break;
  152. default:
  153. return AVERROR(EINVAL);
  154. }
  155. result = ffurl_seek(nodes[i].uc, pos, whence);
  156. if (result >= 0) {
  157. data->current = i;
  158. while (i)
  159. result += nodes[--i].size;
  160. }
  161. return result;
  162. }
  163. URLProtocol ff_concat_protocol = {
  164. .name = "concat",
  165. .url_open = concat_open,
  166. .url_read = concat_read,
  167. .url_seek = concat_seek,
  168. .url_close = concat_close,
  169. .priv_data_size = sizeof(struct concat_data),
  170. };