FFmpeg
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
subtitles.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2012 Clément Bœsch
3  *
4  * This file is part of FFmpeg.
5  *
6  * FFmpeg is free software; you can redistribute it and/or
7  * modify it under the terms of the GNU Lesser General Public
8  * License as published by the Free Software Foundation; either
9  * version 2.1 of the License, or (at your option) any later version.
10  *
11  * FFmpeg is distributed in the hope that it will be useful,
12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14  * Lesser General Public License for more details.
15  *
16  * You should have received a copy of the GNU Lesser General Public
17  * License along with FFmpeg; if not, write to the Free Software
18  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19  */
20 
21 #include "avformat.h"
22 #include "subtitles.h"
23 #include "libavutil/avassert.h"
24 #include "libavutil/avstring.h"
25 
27  const uint8_t *event, int len, int merge)
28 {
29  AVPacket *subs, *sub;
30 
31  if (merge && q->nb_subs > 0) {
32  /* merge with previous event */
33 
34  int old_len;
35  sub = &q->subs[q->nb_subs - 1];
36  old_len = sub->size;
37  if (av_grow_packet(sub, len) < 0)
38  return NULL;
39  memcpy(sub->data + old_len, event, len);
40  } else {
41  /* new event */
42 
43  if (q->nb_subs >= INT_MAX/sizeof(*q->subs) - 1)
44  return NULL;
45  subs = av_fast_realloc(q->subs, &q->allocated_size,
46  (q->nb_subs + 1) * sizeof(*q->subs));
47  if (!subs)
48  return NULL;
49  q->subs = subs;
50  sub = &subs[q->nb_subs++];
51  if (av_new_packet(sub, len) < 0)
52  return NULL;
53  sub->flags |= AV_PKT_FLAG_KEY;
54  sub->pts = sub->dts = 0;
55  memcpy(sub->data, event, len);
56  }
57  return sub;
58 }
59 
60 static int cmp_pkt_sub(const void *a, const void *b)
61 {
62  const AVPacket *s1 = a;
63  const AVPacket *s2 = b;
64  if (s1->pts == s2->pts) {
65  if (s1->pos == s2->pos)
66  return 0;
67  return s1->pos > s2->pos ? 1 : -1;
68  }
69  return s1->pts > s2->pts ? 1 : -1;
70 }
71 
73 {
74  int i;
75 
76  qsort(q->subs, q->nb_subs, sizeof(*q->subs), cmp_pkt_sub);
77  for (i = 0; i < q->nb_subs; i++)
78  if (q->subs[i].duration == -1 && i < q->nb_subs - 1)
79  q->subs[i].duration = q->subs[i + 1].pts - q->subs[i].pts;
80 }
81 
83 {
84  AVPacket *sub = q->subs + q->current_sub_idx;
85 
86  if (q->current_sub_idx == q->nb_subs)
87  return AVERROR_EOF;
88  av_copy_packet(pkt, sub);
89 
90  pkt->dts = pkt->pts;
91  q->current_sub_idx++;
92  return 0;
93 }
94 
96  int64_t min_ts, int64_t ts, int64_t max_ts, int flags)
97 {
98  if (flags & AVSEEK_FLAG_BYTE) {
99  return AVERROR(ENOSYS);
100  } else if (flags & AVSEEK_FLAG_FRAME) {
101  if (ts < 0 || ts >= q->nb_subs)
102  return AVERROR(ERANGE);
103  q->current_sub_idx = ts;
104  } else {
105  int i, idx = -1;
106  int64_t min_ts_diff = INT64_MAX;
107  int64_t ts_selected;
108  /* TODO: q->subs[] is sorted by pts so we could do a binary search */
109  for (i = 0; i < q->nb_subs; i++) {
110  int64_t pts = q->subs[i].pts;
111  uint64_t ts_diff = FFABS(pts - ts);
112  if (pts >= min_ts && pts <= max_ts && ts_diff < min_ts_diff) {
113  min_ts_diff = ts_diff;
114  idx = i;
115  }
116  }
117  if (idx < 0)
118  return AVERROR(ERANGE);
119  /* look back in the latest subtitles for overlapping subtitles */
120  ts_selected = q->subs[idx].pts;
121  for (i = idx - 1; i >= 0; i--) {
122  if (q->subs[i].duration <= 0)
123  continue;
124  if (q->subs[i].pts > ts_selected - q->subs[i].duration)
125  idx = i;
126  else
127  break;
128  }
129  q->current_sub_idx = idx;
130  }
131  return 0;
132 }
133 
135 {
136  int i;
137 
138  for (i = 0; i < q->nb_subs; i++)
139  av_free_packet(&q->subs[i]);
140  av_freep(&q->subs);
141  q->nb_subs = q->allocated_size = q->current_sub_idx = 0;
142 }
143 
145 {
146  int i = 0;
147  char end_chr;
148 
149  if (!*c) // cached char?
150  *c = avio_r8(pb);
151  if (!*c)
152  return 0;
153 
154  end_chr = *c == '<' ? '>' : '<';
155  do {
156  av_bprint_chars(buf, *c, 1);
157  *c = avio_r8(pb);
158  i++;
159  } while (*c != end_chr && *c);
160  if (end_chr == '>') {
161  av_bprint_chars(buf, '>', 1);
162  *c = 0;
163  }
164  return i;
165 }
166 
167 const char *ff_smil_get_attr_ptr(const char *s, const char *attr)
168 {
169  int in_quotes = 0;
170  const int len = strlen(attr);
171 
172  while (*s) {
173  while (*s) {
174  if (!in_quotes && av_isspace(*s))
175  break;
176  in_quotes ^= *s == '"'; // XXX: support escaping?
177  s++;
178  }
179  while (av_isspace(*s))
180  s++;
181  if (!av_strncasecmp(s, attr, len) && s[len] == '=')
182  return s + len + 1 + (s[len + 1] == '"');
183  }
184  return NULL;
185 }
186 
187 static inline int is_eol(char c)
188 {
189  return c == '\r' || c == '\n';
190 }
191 
193 {
194  char eol_buf[5];
195  int n = 0, i = 0, nb_eol = 0;
196 
197  av_bprint_clear(buf);
198 
199  for (;;) {
200  char c = avio_r8(pb);
201 
202  if (!c)
203  break;
204 
205  /* ignore all initial line breaks */
206  if (n == 0 && is_eol(c))
207  continue;
208 
209  /* line break buffering: we don't want to add the trailing \r\n */
210  if (is_eol(c)) {
211  nb_eol += c == '\n';
212  if (nb_eol == 2)
213  break;
214  eol_buf[i++] = c;
215  if (i == sizeof(eol_buf) - 1)
216  break;
217  continue;
218  }
219 
220  /* only one line break followed by data: we flush the line breaks
221  * buffer */
222  if (i) {
223  eol_buf[i] = 0;
224  av_bprintf(buf, "%s", eol_buf);
225  i = nb_eol = 0;
226  }
227 
228  av_bprint_chars(buf, c, 1);
229  n++;
230  }
231 }