You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

192 lines
5.3KB

  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 Libav.
  8. *
  9. * Libav 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. * Libav 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 Libav; if not, write to the Free Software
  21. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  22. */
  23. #include "libavutil/avstring.h"
  24. #include "libavutil/mem.h"
  25. #include "avformat.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;
  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. }
  66. }
  67. if (!(nodes = av_realloc(NULL, sizeof(*nodes) * len)))
  68. return AVERROR(ENOMEM);
  69. else
  70. data->nodes = nodes;
  71. /* handle input */
  72. if (!*uri)
  73. err = AVERROR(ENOENT);
  74. for (i = 0; *uri; i++) {
  75. /* parsing uri */
  76. len = strcspn(uri, AV_CAT_SEPARATOR);
  77. if ((err = av_reallocp(&node_uri, len + 1)) < 0)
  78. break;
  79. av_strlcpy(node_uri, uri, len + 1);
  80. uri += len + strspn(uri + len, AV_CAT_SEPARATOR);
  81. /* creating URLContext */
  82. if ((err = ffurl_open(&uc, node_uri, flags,
  83. &h->interrupt_callback, NULL, h->protocols, h)) < 0)
  84. break;
  85. /* creating size */
  86. if ((size = ffurl_size(uc)) < 0) {
  87. ffurl_close(uc);
  88. err = AVERROR(ENOSYS);
  89. break;
  90. }
  91. /* assembling */
  92. nodes[i].uc = uc;
  93. nodes[i].size = size;
  94. }
  95. av_free(node_uri);
  96. data->length = i;
  97. if (err < 0)
  98. concat_close(h);
  99. else if ((err = av_reallocp(&nodes, data->length * sizeof(*nodes))) < 0)
  100. concat_close(h);
  101. else
  102. data->nodes = nodes;
  103. return err;
  104. }
  105. static int concat_read(URLContext *h, unsigned char *buf, int size)
  106. {
  107. int result, total = 0;
  108. struct concat_data *data = h->priv_data;
  109. struct concat_nodes *nodes = data->nodes;
  110. size_t i = data->current;
  111. while (size > 0) {
  112. result = ffurl_read(nodes[i].uc, buf, size);
  113. if (result < 0)
  114. return total ? total : result;
  115. if (!result) {
  116. if (i + 1 == data->length ||
  117. ffurl_seek(nodes[++i].uc, 0, SEEK_SET) < 0)
  118. break;
  119. }
  120. total += result;
  121. buf += result;
  122. size -= result;
  123. }
  124. data->current = i;
  125. return total;
  126. }
  127. static int64_t concat_seek(URLContext *h, int64_t pos, int whence)
  128. {
  129. int64_t result;
  130. struct concat_data *data = h->priv_data;
  131. struct concat_nodes *nodes = data->nodes;
  132. size_t i;
  133. switch (whence) {
  134. case SEEK_END:
  135. for (i = data->length - 1; i && pos < -nodes[i].size; i--)
  136. pos += nodes[i].size;
  137. break;
  138. case SEEK_CUR:
  139. /* get the absolute position */
  140. for (i = 0; i != data->current; i++)
  141. pos += nodes[i].size;
  142. pos += ffurl_seek(nodes[i].uc, 0, SEEK_CUR);
  143. whence = SEEK_SET;
  144. /* fall through with the absolute position */
  145. case SEEK_SET:
  146. for (i = 0; i != data->length - 1 && pos >= nodes[i].size; i++)
  147. pos -= nodes[i].size;
  148. break;
  149. default:
  150. return AVERROR(EINVAL);
  151. }
  152. result = ffurl_seek(nodes[i].uc, pos, whence);
  153. if (result >= 0) {
  154. data->current = i;
  155. while (i)
  156. result += nodes[--i].size;
  157. }
  158. return result;
  159. }
  160. const URLProtocol ff_concat_protocol = {
  161. .name = "concat",
  162. .url_open = concat_open,
  163. .url_read = concat_read,
  164. .url_seek = concat_seek,
  165. .url_close = concat_close,
  166. .priv_data_size = sizeof(struct concat_data),
  167. };