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.

738 lines
28KB

  1. /*
  2. * FLAC parser
  3. * Copyright (c) 2010 Michael Chinen
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * FFmpeg is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file
  23. * FLAC parser
  24. *
  25. * The FLAC parser buffers input until FLAC_MIN_HEADERS has been found.
  26. * Each time it finds and verifies a CRC-8 header it sees which of the
  27. * FLAC_MAX_SEQUENTIAL_HEADERS that came before it have a valid CRC-16 footer
  28. * that ends at the newly found header.
  29. * Headers are scored by FLAC_HEADER_BASE_SCORE plus the max of its crc-verified
  30. * children, penalized by changes in sample rate, frame number, etc.
  31. * The parser returns the frame with the highest score.
  32. **/
  33. #include "libavutil/attributes.h"
  34. #include "libavutil/crc.h"
  35. #include "libavutil/fifo.h"
  36. #include "bytestream.h"
  37. #include "parser.h"
  38. #include "flac.h"
  39. /** maximum number of adjacent headers that compare CRCs against each other */
  40. #define FLAC_MAX_SEQUENTIAL_HEADERS 3
  41. /** minimum number of headers buffered and checked before returning frames */
  42. #define FLAC_MIN_HEADERS 10
  43. /** estimate for average size of a FLAC frame */
  44. #define FLAC_AVG_FRAME_SIZE 8192
  45. /** scoring settings for score_header */
  46. #define FLAC_HEADER_BASE_SCORE 10
  47. #define FLAC_HEADER_CHANGED_PENALTY 7
  48. #define FLAC_HEADER_CRC_FAIL_PENALTY 50
  49. #define FLAC_HEADER_NOT_PENALIZED_YET 100000
  50. #define FLAC_HEADER_NOT_SCORED_YET -100000
  51. /** largest possible size of flac header */
  52. #define MAX_FRAME_HEADER_SIZE 16
  53. typedef struct FLACHeaderMarker {
  54. int offset; /**< byte offset from start of FLACParseContext->buffer */
  55. int *link_penalty; /**< pointer to array of local scores between this header
  56. and the one at a distance equal array position */
  57. int max_score; /**< maximum score found after checking each child that
  58. has a valid CRC */
  59. FLACFrameInfo fi; /**< decoded frame header info */
  60. struct FLACHeaderMarker *next; /**< next CRC-8 verified header that
  61. immediately follows this one in
  62. the bytestream */
  63. struct FLACHeaderMarker *best_child; /**< following frame header with
  64. which this frame has the best
  65. score with */
  66. } FLACHeaderMarker;
  67. typedef struct FLACParseContext {
  68. AVCodecParserContext *pc; /**< parent context */
  69. AVCodecContext *avctx; /**< codec context pointer for logging */
  70. FLACHeaderMarker *headers; /**< linked-list that starts at the first
  71. CRC-8 verified header within buffer */
  72. FLACHeaderMarker *best_header; /**< highest scoring header within buffer */
  73. int nb_headers_found; /**< number of headers found in the last
  74. flac_parse() call */
  75. int nb_headers_buffered; /**< number of headers that are buffered */
  76. int best_header_valid; /**< flag set when the parser returns junk;
  77. if set return best_header next time */
  78. AVFifoBuffer *fifo_buf; /**< buffer to store all data until headers
  79. can be verified */
  80. int end_padded; /**< specifies if fifo_buf's end is padded */
  81. uint8_t *wrap_buf; /**< general fifo read buffer when wrapped */
  82. int wrap_buf_allocated_size; /**< actual allocated size of the buffer */
  83. FLACFrameInfo last_fi; /**< last decoded frame header info */
  84. int last_fi_valid; /**< set if last_fi is valid */
  85. } FLACParseContext;
  86. static int frame_header_is_valid(AVCodecContext *avctx, const uint8_t *buf,
  87. FLACFrameInfo *fi)
  88. {
  89. GetBitContext gb;
  90. init_get_bits(&gb, buf, MAX_FRAME_HEADER_SIZE * 8);
  91. return !ff_flac_decode_frame_header(avctx, &gb, fi, 127);
  92. }
  93. /**
  94. * Non-destructive fast fifo pointer fetching
  95. * Returns a pointer from the specified offset.
  96. * If possible the pointer points within the fifo buffer.
  97. * Otherwise (if it would cause a wrap around,) a pointer to a user-specified
  98. * buffer is used.
  99. * The pointer can be NULL. In any case it will be reallocated to hold the size.
  100. * If the returned pointer will be used after subsequent calls to flac_fifo_read_wrap
  101. * then the subsequent calls should pass in a different wrap_buf so as to not
  102. * overwrite the contents of the previous wrap_buf.
  103. * This function is based on av_fifo_generic_read, which is why there is a comment
  104. * about a memory barrier for SMP.
  105. */
  106. static uint8_t* flac_fifo_read_wrap(FLACParseContext *fpc, int offset, int len,
  107. uint8_t** wrap_buf, int* allocated_size)
  108. {
  109. AVFifoBuffer *f = fpc->fifo_buf;
  110. uint8_t *start = f->rptr + offset;
  111. uint8_t *tmp_buf;
  112. if (start >= f->end)
  113. start -= f->end - f->buffer;
  114. if (f->end - start >= len)
  115. return start;
  116. tmp_buf = av_fast_realloc(*wrap_buf, allocated_size, len);
  117. if (!tmp_buf) {
  118. av_log(fpc->avctx, AV_LOG_ERROR,
  119. "couldn't reallocate wrap buffer of size %d", len);
  120. return NULL;
  121. }
  122. *wrap_buf = tmp_buf;
  123. do {
  124. int seg_len = FFMIN(f->end - start, len);
  125. memcpy(tmp_buf, start, seg_len);
  126. tmp_buf = (uint8_t*)tmp_buf + seg_len;
  127. // memory barrier needed for SMP here in theory
  128. start += seg_len - (f->end - f->buffer);
  129. len -= seg_len;
  130. } while (len > 0);
  131. return *wrap_buf;
  132. }
  133. /**
  134. * Return a pointer in the fifo buffer where the offset starts at until
  135. * the wrap point or end of request.
  136. * len will contain the valid length of the returned buffer.
  137. * A second call to flac_fifo_read (with new offset and len) should be called
  138. * to get the post-wrap buf if the returned len is less than the requested.
  139. **/
  140. static uint8_t* flac_fifo_read(FLACParseContext *fpc, int offset, int *len)
  141. {
  142. AVFifoBuffer *f = fpc->fifo_buf;
  143. uint8_t *start = f->rptr + offset;
  144. if (start >= f->end)
  145. start -= f->end - f->buffer;
  146. *len = FFMIN(*len, f->end - start);
  147. return start;
  148. }
  149. static int find_headers_search_validate(FLACParseContext *fpc, int offset)
  150. {
  151. FLACFrameInfo fi;
  152. uint8_t *header_buf;
  153. int size = 0;
  154. header_buf = flac_fifo_read_wrap(fpc, offset,
  155. MAX_FRAME_HEADER_SIZE,
  156. &fpc->wrap_buf,
  157. &fpc->wrap_buf_allocated_size);
  158. if (frame_header_is_valid(fpc->avctx, header_buf, &fi)) {
  159. FLACHeaderMarker **end_handle = &fpc->headers;
  160. int i;
  161. size = 0;
  162. while (*end_handle) {
  163. end_handle = &(*end_handle)->next;
  164. size++;
  165. }
  166. *end_handle = av_mallocz(sizeof(FLACHeaderMarker));
  167. if (!*end_handle) {
  168. av_log(fpc->avctx, AV_LOG_ERROR,
  169. "couldn't allocate FLACHeaderMarker\n");
  170. return AVERROR(ENOMEM);
  171. }
  172. (*end_handle)->fi = fi;
  173. (*end_handle)->offset = offset;
  174. (*end_handle)->link_penalty = av_malloc(sizeof(int) *
  175. FLAC_MAX_SEQUENTIAL_HEADERS);
  176. for (i = 0; i < FLAC_MAX_SEQUENTIAL_HEADERS; i++)
  177. (*end_handle)->link_penalty[i] = FLAC_HEADER_NOT_PENALIZED_YET;
  178. fpc->nb_headers_found++;
  179. size++;
  180. }
  181. return size;
  182. }
  183. static int find_headers_search(FLACParseContext *fpc, uint8_t *buf, int buf_size,
  184. int search_start)
  185. {
  186. int size = 0, mod_offset = (buf_size - 1) % 4, i, j;
  187. uint32_t x;
  188. for (i = 0; i < mod_offset; i++) {
  189. if ((AV_RB16(buf + i) & 0xFFFE) == 0xFFF8)
  190. size = find_headers_search_validate(fpc, search_start + i);
  191. }
  192. for (; i < buf_size - 1; i += 4) {
  193. x = AV_RB32(buf + i);
  194. if (((x & ~(x + 0x01010101)) & 0x80808080)) {
  195. for (j = 0; j < 4; j++) {
  196. if ((AV_RB16(buf + i + j) & 0xFFFE) == 0xFFF8)
  197. size = find_headers_search_validate(fpc, search_start + i + j);
  198. }
  199. }
  200. }
  201. return size;
  202. }
  203. static int find_new_headers(FLACParseContext *fpc, int search_start)
  204. {
  205. FLACHeaderMarker *end;
  206. int search_end, size = 0, read_len, temp;
  207. uint8_t *buf;
  208. fpc->nb_headers_found = 0;
  209. /* Search for a new header of at most 16 bytes. */
  210. search_end = av_fifo_size(fpc->fifo_buf) - (MAX_FRAME_HEADER_SIZE - 1);
  211. read_len = search_end - search_start + 1;
  212. buf = flac_fifo_read(fpc, search_start, &read_len);
  213. size = find_headers_search(fpc, buf, read_len, search_start);
  214. search_start += read_len - 1;
  215. /* If fifo end was hit do the wrap around. */
  216. if (search_start != search_end) {
  217. uint8_t wrap[2];
  218. wrap[0] = buf[read_len - 1];
  219. read_len = search_end - search_start + 1;
  220. /* search_start + 1 is the post-wrap offset in the fifo. */
  221. buf = flac_fifo_read(fpc, search_start + 1, &read_len);
  222. wrap[1] = buf[0];
  223. if ((AV_RB16(wrap) & 0xFFFE) == 0xFFF8) {
  224. temp = find_headers_search_validate(fpc, search_start);
  225. size = FFMAX(size, temp);
  226. }
  227. search_start++;
  228. /* Continue to do the last half of the wrap. */
  229. temp = find_headers_search(fpc, buf, read_len, search_start);
  230. size = FFMAX(size, temp);
  231. search_start += read_len - 1;
  232. }
  233. /* Return the size even if no new headers were found. */
  234. if (!size && fpc->headers)
  235. for (end = fpc->headers; end; end = end->next)
  236. size++;
  237. return size;
  238. }
  239. static int check_header_fi_mismatch(FLACParseContext *fpc,
  240. FLACFrameInfo *header_fi,
  241. FLACFrameInfo *child_fi,
  242. int log_level_offset)
  243. {
  244. int deduction = 0;
  245. if (child_fi->samplerate != header_fi->samplerate) {
  246. deduction += FLAC_HEADER_CHANGED_PENALTY;
  247. av_log(fpc->avctx, AV_LOG_WARNING + log_level_offset,
  248. "sample rate change detected in adjacent frames\n");
  249. }
  250. if (child_fi->bps != header_fi->bps) {
  251. deduction += FLAC_HEADER_CHANGED_PENALTY;
  252. av_log(fpc->avctx, AV_LOG_WARNING + log_level_offset,
  253. "bits per sample change detected in adjacent frames\n");
  254. }
  255. if (child_fi->is_var_size != header_fi->is_var_size) {
  256. /* Changing blocking strategy not allowed per the spec */
  257. deduction += FLAC_HEADER_BASE_SCORE;
  258. av_log(fpc->avctx, AV_LOG_WARNING + log_level_offset,
  259. "blocking strategy change detected in adjacent frames\n");
  260. }
  261. if (child_fi->channels != header_fi->channels) {
  262. deduction += FLAC_HEADER_CHANGED_PENALTY;
  263. av_log(fpc->avctx, AV_LOG_WARNING + log_level_offset,
  264. "number of channels change detected in adjacent frames\n");
  265. }
  266. return deduction;
  267. }
  268. static int check_header_mismatch(FLACParseContext *fpc,
  269. FLACHeaderMarker *header,
  270. FLACHeaderMarker *child,
  271. int log_level_offset)
  272. {
  273. FLACFrameInfo *header_fi = &header->fi, *child_fi = &child->fi;
  274. int deduction, deduction_expected = 0, i;
  275. deduction = check_header_fi_mismatch(fpc, header_fi, child_fi,
  276. log_level_offset);
  277. /* Check sample and frame numbers. */
  278. if ((child_fi->frame_or_sample_num - header_fi->frame_or_sample_num
  279. != header_fi->blocksize) &&
  280. (child_fi->frame_or_sample_num
  281. != header_fi->frame_or_sample_num + 1)) {
  282. FLACHeaderMarker *curr;
  283. int expected_frame_num, expected_sample_num;
  284. /* If there are frames in the middle we expect this deduction,
  285. as they are probably valid and this one follows it */
  286. expected_frame_num = expected_sample_num = header_fi->frame_or_sample_num;
  287. curr = header;
  288. while (curr != child) {
  289. /* Ignore frames that failed all crc checks */
  290. for (i = 0; i < FLAC_MAX_SEQUENTIAL_HEADERS; i++) {
  291. if (curr->link_penalty[i] < FLAC_HEADER_CRC_FAIL_PENALTY) {
  292. expected_frame_num++;
  293. expected_sample_num += curr->fi.blocksize;
  294. break;
  295. }
  296. }
  297. curr = curr->next;
  298. }
  299. if (expected_frame_num == child_fi->frame_or_sample_num ||
  300. expected_sample_num == child_fi->frame_or_sample_num)
  301. deduction_expected = deduction ? 0 : 1;
  302. deduction += FLAC_HEADER_CHANGED_PENALTY;
  303. av_log(fpc->avctx, AV_LOG_WARNING + log_level_offset,
  304. "sample/frame number mismatch in adjacent frames\n");
  305. }
  306. /* If we have suspicious headers, check the CRC between them */
  307. if (deduction && !deduction_expected) {
  308. FLACHeaderMarker *curr;
  309. int read_len;
  310. uint8_t *buf;
  311. uint32_t crc = 1;
  312. int inverted_test = 0;
  313. /* Since CRC is expensive only do it if we haven't yet.
  314. This assumes a CRC penalty is greater than all other check penalties */
  315. curr = header->next;
  316. for (i = 0; i < FLAC_MAX_SEQUENTIAL_HEADERS && curr != child; i++)
  317. curr = curr->next;
  318. if (header->link_penalty[i] < FLAC_HEADER_CRC_FAIL_PENALTY ||
  319. header->link_penalty[i] == FLAC_HEADER_NOT_PENALIZED_YET) {
  320. FLACHeaderMarker *start, *end;
  321. /* Although overlapping chains are scored, the crc should never
  322. have to be computed twice for a single byte. */
  323. start = header;
  324. end = child;
  325. if (i > 0 &&
  326. header->link_penalty[i - 1] >= FLAC_HEADER_CRC_FAIL_PENALTY) {
  327. while (start->next != child)
  328. start = start->next;
  329. inverted_test = 1;
  330. } else if (i > 0 &&
  331. header->next->link_penalty[i-1] >=
  332. FLAC_HEADER_CRC_FAIL_PENALTY ) {
  333. end = header->next;
  334. inverted_test = 1;
  335. }
  336. read_len = end->offset - start->offset;
  337. buf = flac_fifo_read(fpc, start->offset, &read_len);
  338. crc = av_crc(av_crc_get_table(AV_CRC_16_ANSI), 0, buf, read_len);
  339. read_len = (end->offset - start->offset) - read_len;
  340. if (read_len) {
  341. buf = flac_fifo_read(fpc, end->offset - read_len, &read_len);
  342. crc = av_crc(av_crc_get_table(AV_CRC_16_ANSI), crc, buf, read_len);
  343. }
  344. }
  345. if (!crc ^ !inverted_test) {
  346. deduction += FLAC_HEADER_CRC_FAIL_PENALTY;
  347. av_log(fpc->avctx, AV_LOG_WARNING + log_level_offset,
  348. "crc check failed from offset %i (frame %"PRId64") to %i (frame %"PRId64")\n",
  349. header->offset, header_fi->frame_or_sample_num,
  350. child->offset, child_fi->frame_or_sample_num);
  351. }
  352. }
  353. return deduction;
  354. }
  355. /**
  356. * Score a header.
  357. *
  358. * Give FLAC_HEADER_BASE_SCORE points to a frame for existing.
  359. * If it has children, (subsequent frames of which the preceding CRC footer
  360. * validates against this one,) then take the maximum score of the children,
  361. * with a penalty of FLAC_HEADER_CHANGED_PENALTY applied for each change to
  362. * bps, sample rate, channels, but not decorrelation mode, or blocksize,
  363. * because it can change often.
  364. **/
  365. static int score_header(FLACParseContext *fpc, FLACHeaderMarker *header)
  366. {
  367. FLACHeaderMarker *child;
  368. int dist = 0;
  369. int child_score;
  370. int base_score = FLAC_HEADER_BASE_SCORE;
  371. if (header->max_score != FLAC_HEADER_NOT_SCORED_YET)
  372. return header->max_score;
  373. /* Modify the base score with changes from the last output header */
  374. if (fpc->last_fi_valid) {
  375. /* Silence the log since this will be repeated if selected */
  376. base_score -= check_header_fi_mismatch(fpc, &fpc->last_fi, &header->fi,
  377. AV_LOG_DEBUG);
  378. }
  379. header->max_score = base_score;
  380. /* Check and compute the children's scores. */
  381. child = header->next;
  382. for (dist = 0; dist < FLAC_MAX_SEQUENTIAL_HEADERS && child; dist++) {
  383. /* Look at the child's frame header info and penalize suspicious
  384. changes between the headers. */
  385. if (header->link_penalty[dist] == FLAC_HEADER_NOT_PENALIZED_YET) {
  386. header->link_penalty[dist] = check_header_mismatch(fpc, header,
  387. child, AV_LOG_DEBUG);
  388. }
  389. child_score = score_header(fpc, child) - header->link_penalty[dist];
  390. if (FLAC_HEADER_BASE_SCORE + child_score > header->max_score) {
  391. /* Keep the child because the frame scoring is dynamic. */
  392. header->best_child = child;
  393. header->max_score = base_score + child_score;
  394. }
  395. child = child->next;
  396. }
  397. return header->max_score;
  398. }
  399. static void score_sequences(FLACParseContext *fpc)
  400. {
  401. FLACHeaderMarker *curr;
  402. int best_score = 0;//FLAC_HEADER_NOT_SCORED_YET;
  403. /* First pass to clear all old scores. */
  404. for (curr = fpc->headers; curr; curr = curr->next)
  405. curr->max_score = FLAC_HEADER_NOT_SCORED_YET;
  406. /* Do a second pass to score them all. */
  407. for (curr = fpc->headers; curr; curr = curr->next) {
  408. if (score_header(fpc, curr) > best_score) {
  409. fpc->best_header = curr;
  410. best_score = curr->max_score;
  411. }
  412. }
  413. }
  414. static int get_best_header(FLACParseContext* fpc, const uint8_t **poutbuf,
  415. int *poutbuf_size)
  416. {
  417. FLACHeaderMarker *header = fpc->best_header;
  418. FLACHeaderMarker *child = header->best_child;
  419. if (!child) {
  420. *poutbuf_size = av_fifo_size(fpc->fifo_buf) - header->offset;
  421. } else {
  422. *poutbuf_size = child->offset - header->offset;
  423. /* If the child has suspicious changes, log them */
  424. check_header_mismatch(fpc, header, child, 0);
  425. }
  426. if (header->fi.channels != fpc->avctx->channels ||
  427. !fpc->avctx->channel_layout) {
  428. fpc->avctx->channels = header->fi.channels;
  429. ff_flac_set_channel_layout(fpc->avctx);
  430. }
  431. fpc->avctx->sample_rate = header->fi.samplerate;
  432. fpc->pc->duration = header->fi.blocksize;
  433. *poutbuf = flac_fifo_read_wrap(fpc, header->offset, *poutbuf_size,
  434. &fpc->wrap_buf,
  435. &fpc->wrap_buf_allocated_size);
  436. if (fpc->pc->flags & PARSER_FLAG_USE_CODEC_TS){
  437. if (header->fi.is_var_size)
  438. fpc->pc->pts = header->fi.frame_or_sample_num;
  439. else if (header->best_child)
  440. fpc->pc->pts = header->fi.frame_or_sample_num * header->fi.blocksize;
  441. }
  442. fpc->best_header_valid = 0;
  443. fpc->last_fi_valid = 1;
  444. fpc->last_fi = header->fi;
  445. /* Return the negative overread index so the client can compute pos.
  446. This should be the amount overread to the beginning of the child */
  447. if (child)
  448. return child->offset - av_fifo_size(fpc->fifo_buf);
  449. return 0;
  450. }
  451. static int flac_parse(AVCodecParserContext *s, AVCodecContext *avctx,
  452. const uint8_t **poutbuf, int *poutbuf_size,
  453. const uint8_t *buf, int buf_size)
  454. {
  455. FLACParseContext *fpc = s->priv_data;
  456. FLACHeaderMarker *curr;
  457. int nb_headers;
  458. const uint8_t *read_end = buf;
  459. const uint8_t *read_start = buf;
  460. if (s->flags & PARSER_FLAG_COMPLETE_FRAMES) {
  461. FLACFrameInfo fi;
  462. if (frame_header_is_valid(avctx, buf, &fi)) {
  463. s->duration = fi.blocksize;
  464. if (!avctx->sample_rate)
  465. avctx->sample_rate = fi.samplerate;
  466. if (fpc->pc->flags & PARSER_FLAG_USE_CODEC_TS){
  467. fpc->pc->pts = fi.frame_or_sample_num;
  468. if (!fi.is_var_size)
  469. fpc->pc->pts *= fi.blocksize;
  470. }
  471. }
  472. *poutbuf = buf;
  473. *poutbuf_size = buf_size;
  474. return buf_size;
  475. }
  476. fpc->avctx = avctx;
  477. if (fpc->best_header_valid)
  478. return get_best_header(fpc, poutbuf, poutbuf_size);
  479. /* If a best_header was found last call remove it with the buffer data. */
  480. if (fpc->best_header && fpc->best_header->best_child) {
  481. FLACHeaderMarker *temp;
  482. FLACHeaderMarker *best_child = fpc->best_header->best_child;
  483. /* Remove headers in list until the end of the best_header. */
  484. for (curr = fpc->headers; curr != best_child; curr = temp) {
  485. if (curr != fpc->best_header) {
  486. av_log(avctx, AV_LOG_DEBUG,
  487. "dropping low score %i frame header from offset %i to %i\n",
  488. curr->max_score, curr->offset, curr->next->offset);
  489. }
  490. temp = curr->next;
  491. av_freep(&curr->link_penalty);
  492. av_free(curr);
  493. fpc->nb_headers_buffered--;
  494. }
  495. /* Release returned data from ring buffer. */
  496. av_fifo_drain(fpc->fifo_buf, best_child->offset);
  497. /* Fix the offset for the headers remaining to match the new buffer. */
  498. for (curr = best_child->next; curr; curr = curr->next)
  499. curr->offset -= best_child->offset;
  500. fpc->nb_headers_buffered--;
  501. best_child->offset = 0;
  502. fpc->headers = best_child;
  503. if (fpc->nb_headers_buffered >= FLAC_MIN_HEADERS) {
  504. fpc->best_header = best_child;
  505. return get_best_header(fpc, poutbuf, poutbuf_size);
  506. }
  507. fpc->best_header = NULL;
  508. } else if (fpc->best_header) {
  509. /* No end frame no need to delete the buffer; probably eof */
  510. FLACHeaderMarker *temp;
  511. for (curr = fpc->headers; curr != fpc->best_header; curr = temp) {
  512. temp = curr->next;
  513. av_freep(&curr->link_penalty);
  514. av_free(curr);
  515. }
  516. fpc->headers = fpc->best_header->next;
  517. av_freep(&fpc->best_header->link_penalty);
  518. av_freep(&fpc->best_header);
  519. }
  520. /* Find and score new headers. */
  521. /* buf_size is to zero when padding, so check for this since we do */
  522. /* not want to try to read more input once we have found the end. */
  523. /* Note that as (non-modified) parameters, buf can be non-NULL, */
  524. /* while buf_size is 0. */
  525. while ((buf && buf_size && read_end < buf + buf_size &&
  526. fpc->nb_headers_buffered < FLAC_MIN_HEADERS)
  527. || ((!buf || !buf_size) && !fpc->end_padded)) {
  528. int start_offset;
  529. /* Pad the end once if EOF, to check the final region for headers. */
  530. if (!buf || !buf_size) {
  531. fpc->end_padded = 1;
  532. buf_size = MAX_FRAME_HEADER_SIZE;
  533. read_end = read_start + MAX_FRAME_HEADER_SIZE;
  534. } else {
  535. /* The maximum read size is the upper-bound of what the parser
  536. needs to have the required number of frames buffered */
  537. int nb_desired = FLAC_MIN_HEADERS - fpc->nb_headers_buffered + 1;
  538. read_end = read_end + FFMIN(buf + buf_size - read_end,
  539. nb_desired * FLAC_AVG_FRAME_SIZE);
  540. }
  541. /* Fill the buffer. */
  542. if ( av_fifo_space(fpc->fifo_buf) < read_end - read_start
  543. && av_fifo_realloc2(fpc->fifo_buf, (read_end - read_start) + 2*av_fifo_size(fpc->fifo_buf)) < 0) {
  544. av_log(avctx, AV_LOG_ERROR,
  545. "couldn't reallocate buffer of size %"PTRDIFF_SPECIFIER"\n",
  546. (read_end - read_start) + av_fifo_size(fpc->fifo_buf));
  547. goto handle_error;
  548. }
  549. if (buf && buf_size) {
  550. av_fifo_generic_write(fpc->fifo_buf, (void*) read_start,
  551. read_end - read_start, NULL);
  552. } else {
  553. int8_t pad[MAX_FRAME_HEADER_SIZE] = { 0 };
  554. av_fifo_generic_write(fpc->fifo_buf, (void*) pad, sizeof(pad), NULL);
  555. }
  556. /* Tag headers and update sequences. */
  557. start_offset = av_fifo_size(fpc->fifo_buf) -
  558. ((read_end - read_start) + (MAX_FRAME_HEADER_SIZE - 1));
  559. start_offset = FFMAX(0, start_offset);
  560. nb_headers = find_new_headers(fpc, start_offset);
  561. if (nb_headers < 0) {
  562. av_log(avctx, AV_LOG_ERROR,
  563. "find_new_headers couldn't allocate FLAC header\n");
  564. goto handle_error;
  565. }
  566. fpc->nb_headers_buffered = nb_headers;
  567. /* Wait till FLAC_MIN_HEADERS to output a valid frame. */
  568. if (!fpc->end_padded && fpc->nb_headers_buffered < FLAC_MIN_HEADERS) {
  569. if (buf && read_end < buf + buf_size) {
  570. read_start = read_end;
  571. continue;
  572. } else {
  573. goto handle_error;
  574. }
  575. }
  576. /* If headers found, update the scores since we have longer chains. */
  577. if (fpc->end_padded || fpc->nb_headers_found)
  578. score_sequences(fpc);
  579. /* restore the state pre-padding */
  580. if (fpc->end_padded) {
  581. int warp = fpc->fifo_buf->wptr - fpc->fifo_buf->buffer < MAX_FRAME_HEADER_SIZE;
  582. /* HACK: drain the tail of the fifo */
  583. fpc->fifo_buf->wptr -= MAX_FRAME_HEADER_SIZE;
  584. fpc->fifo_buf->wndx -= MAX_FRAME_HEADER_SIZE;
  585. if (warp) {
  586. fpc->fifo_buf->wptr += fpc->fifo_buf->end -
  587. fpc->fifo_buf->buffer;
  588. }
  589. buf_size = 0;
  590. read_start = read_end = NULL;
  591. }
  592. }
  593. curr = fpc->headers;
  594. for (curr = fpc->headers; curr; curr = curr->next) {
  595. if (curr->max_score > 0 &&
  596. (!fpc->best_header || curr->max_score > fpc->best_header->max_score)) {
  597. fpc->best_header = curr;
  598. }
  599. }
  600. if (fpc->best_header) {
  601. fpc->best_header_valid = 1;
  602. if (fpc->best_header->offset > 0) {
  603. /* Output a junk frame. */
  604. av_log(avctx, AV_LOG_DEBUG, "Junk frame till offset %i\n",
  605. fpc->best_header->offset);
  606. /* Set duration to 0. It is unknown or invalid in a junk frame. */
  607. s->duration = 0;
  608. *poutbuf_size = fpc->best_header->offset;
  609. *poutbuf = flac_fifo_read_wrap(fpc, 0, *poutbuf_size,
  610. &fpc->wrap_buf,
  611. &fpc->wrap_buf_allocated_size);
  612. return buf_size ? (read_end - buf) : (fpc->best_header->offset -
  613. av_fifo_size(fpc->fifo_buf));
  614. }
  615. if (!buf_size)
  616. return get_best_header(fpc, poutbuf, poutbuf_size);
  617. }
  618. handle_error:
  619. *poutbuf = NULL;
  620. *poutbuf_size = 0;
  621. return read_end - buf;
  622. }
  623. static av_cold int flac_parse_init(AVCodecParserContext *c)
  624. {
  625. FLACParseContext *fpc = c->priv_data;
  626. fpc->pc = c;
  627. /* There will generally be FLAC_MIN_HEADERS buffered in the fifo before
  628. it drains. This is allocated early to avoid slow reallocation. */
  629. fpc->fifo_buf = av_fifo_alloc(FLAC_AVG_FRAME_SIZE * (FLAC_MIN_HEADERS + 3));
  630. if (!fpc->fifo_buf)
  631. return AVERROR(ENOMEM);
  632. return 0;
  633. }
  634. static void flac_parse_close(AVCodecParserContext *c)
  635. {
  636. FLACParseContext *fpc = c->priv_data;
  637. FLACHeaderMarker *curr = fpc->headers, *temp;
  638. while (curr) {
  639. temp = curr->next;
  640. av_freep(&curr->link_penalty);
  641. av_free(curr);
  642. curr = temp;
  643. }
  644. av_fifo_free(fpc->fifo_buf);
  645. av_free(fpc->wrap_buf);
  646. }
  647. AVCodecParser ff_flac_parser = {
  648. .codec_ids = { AV_CODEC_ID_FLAC },
  649. .priv_data_size = sizeof(FLACParseContext),
  650. .parser_init = flac_parse_init,
  651. .parser_parse = flac_parse,
  652. .parser_close = flac_parse_close,
  653. };