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.

767 lines
30KB

  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(**end_handle));
  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. if (!(*end_handle)->link_penalty) {
  177. av_freep(end_handle);
  178. av_log(fpc->avctx, AV_LOG_ERROR,
  179. "couldn't allocate link_penalty\n");
  180. return AVERROR(ENOMEM);
  181. }
  182. for (i = 0; i < FLAC_MAX_SEQUENTIAL_HEADERS; i++)
  183. (*end_handle)->link_penalty[i] = FLAC_HEADER_NOT_PENALIZED_YET;
  184. fpc->nb_headers_found++;
  185. size++;
  186. }
  187. return size;
  188. }
  189. static int find_headers_search(FLACParseContext *fpc, uint8_t *buf, int buf_size,
  190. int search_start)
  191. {
  192. int size = 0, mod_offset = (buf_size - 1) % 4, i, j;
  193. uint32_t x;
  194. for (i = 0; i < mod_offset; i++) {
  195. if ((AV_RB16(buf + i) & 0xFFFE) == 0xFFF8) {
  196. int ret = find_headers_search_validate(fpc, search_start + i);
  197. size = FFMAX(size, ret);
  198. }
  199. }
  200. for (; i < buf_size - 1; i += 4) {
  201. x = AV_RB32(buf + i);
  202. if (((x & ~(x + 0x01010101)) & 0x80808080)) {
  203. for (j = 0; j < 4; j++) {
  204. if ((AV_RB16(buf + i + j) & 0xFFFE) == 0xFFF8) {
  205. int ret = find_headers_search_validate(fpc, search_start + i + j);
  206. size = FFMAX(size, ret);
  207. }
  208. }
  209. }
  210. }
  211. return size;
  212. }
  213. static int find_new_headers(FLACParseContext *fpc, int search_start)
  214. {
  215. FLACHeaderMarker *end;
  216. int search_end, size = 0, read_len, temp;
  217. uint8_t *buf;
  218. fpc->nb_headers_found = 0;
  219. /* Search for a new header of at most 16 bytes. */
  220. search_end = av_fifo_size(fpc->fifo_buf) - (MAX_FRAME_HEADER_SIZE - 1);
  221. read_len = search_end - search_start + 1;
  222. buf = flac_fifo_read(fpc, search_start, &read_len);
  223. size = find_headers_search(fpc, buf, read_len, search_start);
  224. search_start += read_len - 1;
  225. /* If fifo end was hit do the wrap around. */
  226. if (search_start != search_end) {
  227. uint8_t wrap[2];
  228. wrap[0] = buf[read_len - 1];
  229. read_len = search_end - search_start + 1;
  230. /* search_start + 1 is the post-wrap offset in the fifo. */
  231. buf = flac_fifo_read(fpc, search_start + 1, &read_len);
  232. wrap[1] = buf[0];
  233. if ((AV_RB16(wrap) & 0xFFFE) == 0xFFF8) {
  234. temp = find_headers_search_validate(fpc, search_start);
  235. size = FFMAX(size, temp);
  236. }
  237. search_start++;
  238. /* Continue to do the last half of the wrap. */
  239. temp = find_headers_search(fpc, buf, read_len, search_start);
  240. size = FFMAX(size, temp);
  241. search_start += read_len - 1;
  242. }
  243. /* Return the size even if no new headers were found. */
  244. if (!size && fpc->headers)
  245. for (end = fpc->headers; end; end = end->next)
  246. size++;
  247. return size;
  248. }
  249. static int check_header_fi_mismatch(FLACParseContext *fpc,
  250. FLACFrameInfo *header_fi,
  251. FLACFrameInfo *child_fi,
  252. int log_level_offset)
  253. {
  254. int deduction = 0;
  255. if (child_fi->samplerate != header_fi->samplerate) {
  256. deduction += FLAC_HEADER_CHANGED_PENALTY;
  257. av_log(fpc->avctx, AV_LOG_WARNING + log_level_offset,
  258. "sample rate change detected in adjacent frames\n");
  259. }
  260. if (child_fi->bps != header_fi->bps) {
  261. deduction += FLAC_HEADER_CHANGED_PENALTY;
  262. av_log(fpc->avctx, AV_LOG_WARNING + log_level_offset,
  263. "bits per sample change detected in adjacent frames\n");
  264. }
  265. if (child_fi->is_var_size != header_fi->is_var_size) {
  266. /* Changing blocking strategy not allowed per the spec */
  267. deduction += FLAC_HEADER_BASE_SCORE;
  268. av_log(fpc->avctx, AV_LOG_WARNING + log_level_offset,
  269. "blocking strategy change detected in adjacent frames\n");
  270. }
  271. if (child_fi->channels != header_fi->channels) {
  272. deduction += FLAC_HEADER_CHANGED_PENALTY;
  273. av_log(fpc->avctx, AV_LOG_WARNING + log_level_offset,
  274. "number of channels change detected in adjacent frames\n");
  275. }
  276. return deduction;
  277. }
  278. static int check_header_mismatch(FLACParseContext *fpc,
  279. FLACHeaderMarker *header,
  280. FLACHeaderMarker *child,
  281. int log_level_offset)
  282. {
  283. FLACFrameInfo *header_fi = &header->fi, *child_fi = &child->fi;
  284. int deduction, deduction_expected = 0, i;
  285. deduction = check_header_fi_mismatch(fpc, header_fi, child_fi,
  286. log_level_offset);
  287. /* Check sample and frame numbers. */
  288. if ((child_fi->frame_or_sample_num - header_fi->frame_or_sample_num
  289. != header_fi->blocksize) &&
  290. (child_fi->frame_or_sample_num
  291. != header_fi->frame_or_sample_num + 1)) {
  292. FLACHeaderMarker *curr;
  293. int expected_frame_num, expected_sample_num;
  294. /* If there are frames in the middle we expect this deduction,
  295. as they are probably valid and this one follows it */
  296. expected_frame_num = expected_sample_num = header_fi->frame_or_sample_num;
  297. curr = header;
  298. while (curr != child) {
  299. /* Ignore frames that failed all crc checks */
  300. for (i = 0; i < FLAC_MAX_SEQUENTIAL_HEADERS; i++) {
  301. if (curr->link_penalty[i] < FLAC_HEADER_CRC_FAIL_PENALTY) {
  302. expected_frame_num++;
  303. expected_sample_num += curr->fi.blocksize;
  304. break;
  305. }
  306. }
  307. curr = curr->next;
  308. }
  309. if (expected_frame_num == child_fi->frame_or_sample_num ||
  310. expected_sample_num == child_fi->frame_or_sample_num)
  311. deduction_expected = deduction ? 0 : 1;
  312. deduction += FLAC_HEADER_CHANGED_PENALTY;
  313. av_log(fpc->avctx, AV_LOG_WARNING + log_level_offset,
  314. "sample/frame number mismatch in adjacent frames\n");
  315. }
  316. /* If we have suspicious headers, check the CRC between them */
  317. if (deduction && !deduction_expected) {
  318. FLACHeaderMarker *curr;
  319. int read_len;
  320. uint8_t *buf;
  321. uint32_t crc = 1;
  322. int inverted_test = 0;
  323. /* Since CRC is expensive only do it if we haven't yet.
  324. This assumes a CRC penalty is greater than all other check penalties */
  325. curr = header->next;
  326. for (i = 0; i < FLAC_MAX_SEQUENTIAL_HEADERS && curr != child; i++)
  327. curr = curr->next;
  328. if (header->link_penalty[i] < FLAC_HEADER_CRC_FAIL_PENALTY ||
  329. header->link_penalty[i] == FLAC_HEADER_NOT_PENALIZED_YET) {
  330. FLACHeaderMarker *start, *end;
  331. /* Although overlapping chains are scored, the crc should never
  332. have to be computed twice for a single byte. */
  333. start = header;
  334. end = child;
  335. if (i > 0 &&
  336. header->link_penalty[i - 1] >= FLAC_HEADER_CRC_FAIL_PENALTY) {
  337. while (start->next != child)
  338. start = start->next;
  339. inverted_test = 1;
  340. } else if (i > 0 &&
  341. header->next->link_penalty[i-1] >=
  342. FLAC_HEADER_CRC_FAIL_PENALTY ) {
  343. end = header->next;
  344. inverted_test = 1;
  345. }
  346. read_len = end->offset - start->offset;
  347. buf = flac_fifo_read(fpc, start->offset, &read_len);
  348. crc = av_crc(av_crc_get_table(AV_CRC_16_ANSI), 0, buf, read_len);
  349. read_len = (end->offset - start->offset) - read_len;
  350. if (read_len) {
  351. buf = flac_fifo_read(fpc, end->offset - read_len, &read_len);
  352. crc = av_crc(av_crc_get_table(AV_CRC_16_ANSI), crc, buf, read_len);
  353. }
  354. }
  355. if (!crc ^ !inverted_test) {
  356. deduction += FLAC_HEADER_CRC_FAIL_PENALTY;
  357. av_log(fpc->avctx, AV_LOG_WARNING + log_level_offset,
  358. "crc check failed from offset %i (frame %"PRId64") to %i (frame %"PRId64")\n",
  359. header->offset, header_fi->frame_or_sample_num,
  360. child->offset, child_fi->frame_or_sample_num);
  361. }
  362. }
  363. return deduction;
  364. }
  365. /**
  366. * Score a header.
  367. *
  368. * Give FLAC_HEADER_BASE_SCORE points to a frame for existing.
  369. * If it has children, (subsequent frames of which the preceding CRC footer
  370. * validates against this one,) then take the maximum score of the children,
  371. * with a penalty of FLAC_HEADER_CHANGED_PENALTY applied for each change to
  372. * bps, sample rate, channels, but not decorrelation mode, or blocksize,
  373. * because it can change often.
  374. **/
  375. static int score_header(FLACParseContext *fpc, FLACHeaderMarker *header)
  376. {
  377. FLACHeaderMarker *child;
  378. int dist = 0;
  379. int child_score;
  380. int base_score = FLAC_HEADER_BASE_SCORE;
  381. if (header->max_score != FLAC_HEADER_NOT_SCORED_YET)
  382. return header->max_score;
  383. /* Modify the base score with changes from the last output header */
  384. if (fpc->last_fi_valid) {
  385. /* Silence the log since this will be repeated if selected */
  386. base_score -= check_header_fi_mismatch(fpc, &fpc->last_fi, &header->fi,
  387. AV_LOG_DEBUG);
  388. }
  389. header->max_score = base_score;
  390. /* Check and compute the children's scores. */
  391. child = header->next;
  392. for (dist = 0; dist < FLAC_MAX_SEQUENTIAL_HEADERS && child; dist++) {
  393. /* Look at the child's frame header info and penalize suspicious
  394. changes between the headers. */
  395. if (header->link_penalty[dist] == FLAC_HEADER_NOT_PENALIZED_YET) {
  396. header->link_penalty[dist] = check_header_mismatch(fpc, header,
  397. child, AV_LOG_DEBUG);
  398. }
  399. child_score = score_header(fpc, child) - header->link_penalty[dist];
  400. if (FLAC_HEADER_BASE_SCORE + child_score > header->max_score) {
  401. /* Keep the child because the frame scoring is dynamic. */
  402. header->best_child = child;
  403. header->max_score = base_score + child_score;
  404. }
  405. child = child->next;
  406. }
  407. return header->max_score;
  408. }
  409. static void score_sequences(FLACParseContext *fpc)
  410. {
  411. FLACHeaderMarker *curr;
  412. int best_score = 0;//FLAC_HEADER_NOT_SCORED_YET;
  413. /* First pass to clear all old scores. */
  414. for (curr = fpc->headers; curr; curr = curr->next)
  415. curr->max_score = FLAC_HEADER_NOT_SCORED_YET;
  416. /* Do a second pass to score them all. */
  417. for (curr = fpc->headers; curr; curr = curr->next) {
  418. if (score_header(fpc, curr) > best_score) {
  419. fpc->best_header = curr;
  420. best_score = curr->max_score;
  421. }
  422. }
  423. }
  424. static int get_best_header(FLACParseContext* fpc, const uint8_t **poutbuf,
  425. int *poutbuf_size)
  426. {
  427. FLACHeaderMarker *header = fpc->best_header;
  428. FLACHeaderMarker *child = header->best_child;
  429. if (!child) {
  430. *poutbuf_size = av_fifo_size(fpc->fifo_buf) - header->offset;
  431. } else {
  432. *poutbuf_size = child->offset - header->offset;
  433. /* If the child has suspicious changes, log them */
  434. check_header_mismatch(fpc, header, child, 0);
  435. }
  436. if (header->fi.channels != fpc->avctx->channels ||
  437. !fpc->avctx->channel_layout) {
  438. fpc->avctx->channels = header->fi.channels;
  439. ff_flac_set_channel_layout(fpc->avctx);
  440. }
  441. fpc->avctx->sample_rate = header->fi.samplerate;
  442. fpc->pc->duration = header->fi.blocksize;
  443. *poutbuf = flac_fifo_read_wrap(fpc, header->offset, *poutbuf_size,
  444. &fpc->wrap_buf,
  445. &fpc->wrap_buf_allocated_size);
  446. if (fpc->pc->flags & PARSER_FLAG_USE_CODEC_TS){
  447. if (header->fi.is_var_size)
  448. fpc->pc->pts = header->fi.frame_or_sample_num;
  449. else if (header->best_child)
  450. fpc->pc->pts = header->fi.frame_or_sample_num * header->fi.blocksize;
  451. }
  452. fpc->best_header_valid = 0;
  453. fpc->last_fi_valid = 1;
  454. fpc->last_fi = header->fi;
  455. /* Return the negative overread index so the client can compute pos.
  456. This should be the amount overread to the beginning of the child */
  457. if (child)
  458. return child->offset - av_fifo_size(fpc->fifo_buf);
  459. return 0;
  460. }
  461. static int flac_parse(AVCodecParserContext *s, AVCodecContext *avctx,
  462. const uint8_t **poutbuf, int *poutbuf_size,
  463. const uint8_t *buf, int buf_size)
  464. {
  465. FLACParseContext *fpc = s->priv_data;
  466. FLACHeaderMarker *curr;
  467. int nb_headers;
  468. const uint8_t *read_end = buf;
  469. const uint8_t *read_start = buf;
  470. if (s->flags & PARSER_FLAG_COMPLETE_FRAMES) {
  471. FLACFrameInfo fi;
  472. if (frame_header_is_valid(avctx, buf, &fi)) {
  473. s->duration = fi.blocksize;
  474. if (!avctx->sample_rate)
  475. avctx->sample_rate = fi.samplerate;
  476. if (fpc->pc->flags & PARSER_FLAG_USE_CODEC_TS){
  477. fpc->pc->pts = fi.frame_or_sample_num;
  478. if (!fi.is_var_size)
  479. fpc->pc->pts *= fi.blocksize;
  480. }
  481. }
  482. *poutbuf = buf;
  483. *poutbuf_size = buf_size;
  484. return buf_size;
  485. }
  486. fpc->avctx = avctx;
  487. if (fpc->best_header_valid)
  488. return get_best_header(fpc, poutbuf, poutbuf_size);
  489. /* If a best_header was found last call remove it with the buffer data. */
  490. if (fpc->best_header && fpc->best_header->best_child) {
  491. FLACHeaderMarker *temp;
  492. FLACHeaderMarker *best_child = fpc->best_header->best_child;
  493. /* Remove headers in list until the end of the best_header. */
  494. for (curr = fpc->headers; curr != best_child; curr = temp) {
  495. if (curr != fpc->best_header) {
  496. av_log(avctx, AV_LOG_DEBUG,
  497. "dropping low score %i frame header from offset %i to %i\n",
  498. curr->max_score, curr->offset, curr->next->offset);
  499. }
  500. temp = curr->next;
  501. av_freep(&curr->link_penalty);
  502. av_free(curr);
  503. fpc->nb_headers_buffered--;
  504. }
  505. /* Release returned data from ring buffer. */
  506. av_fifo_drain(fpc->fifo_buf, best_child->offset);
  507. /* Fix the offset for the headers remaining to match the new buffer. */
  508. for (curr = best_child->next; curr; curr = curr->next)
  509. curr->offset -= best_child->offset;
  510. fpc->nb_headers_buffered--;
  511. best_child->offset = 0;
  512. fpc->headers = best_child;
  513. if (fpc->nb_headers_buffered >= FLAC_MIN_HEADERS) {
  514. fpc->best_header = best_child;
  515. return get_best_header(fpc, poutbuf, poutbuf_size);
  516. }
  517. fpc->best_header = NULL;
  518. } else if (fpc->best_header) {
  519. /* No end frame no need to delete the buffer; probably eof */
  520. FLACHeaderMarker *temp;
  521. for (curr = fpc->headers; curr != fpc->best_header; curr = temp) {
  522. temp = curr->next;
  523. av_freep(&curr->link_penalty);
  524. av_free(curr);
  525. fpc->nb_headers_buffered--;
  526. }
  527. fpc->headers = fpc->best_header->next;
  528. av_freep(&fpc->best_header->link_penalty);
  529. av_freep(&fpc->best_header);
  530. fpc->nb_headers_buffered--;
  531. }
  532. /* Find and score new headers. */
  533. /* buf_size is to zero when padding, so check for this since we do */
  534. /* not want to try to read more input once we have found the end. */
  535. /* Note that as (non-modified) parameters, buf can be non-NULL, */
  536. /* while buf_size is 0. */
  537. while ((buf && buf_size && read_end < buf + buf_size &&
  538. fpc->nb_headers_buffered < FLAC_MIN_HEADERS)
  539. || ((!buf || !buf_size) && !fpc->end_padded)) {
  540. int start_offset;
  541. /* Pad the end once if EOF, to check the final region for headers. */
  542. if (!buf || !buf_size) {
  543. fpc->end_padded = 1;
  544. buf_size = MAX_FRAME_HEADER_SIZE;
  545. read_end = read_start + MAX_FRAME_HEADER_SIZE;
  546. } else {
  547. /* The maximum read size is the upper-bound of what the parser
  548. needs to have the required number of frames buffered */
  549. int nb_desired = FLAC_MIN_HEADERS - fpc->nb_headers_buffered + 1;
  550. read_end = read_end + FFMIN(buf + buf_size - read_end,
  551. nb_desired * FLAC_AVG_FRAME_SIZE);
  552. }
  553. if (!av_fifo_space(fpc->fifo_buf) &&
  554. av_fifo_size(fpc->fifo_buf) / FLAC_AVG_FRAME_SIZE >
  555. fpc->nb_headers_buffered * 20) {
  556. /* There is less than one valid flac header buffered for 20 headers
  557. * buffered. Therefore the fifo is most likely filled with invalid
  558. * data and the input is not a flac file. */
  559. goto handle_error;
  560. }
  561. /* Fill the buffer. */
  562. if ( av_fifo_space(fpc->fifo_buf) < read_end - read_start
  563. && av_fifo_realloc2(fpc->fifo_buf, (read_end - read_start) + 2*av_fifo_size(fpc->fifo_buf)) < 0) {
  564. av_log(avctx, AV_LOG_ERROR,
  565. "couldn't reallocate buffer of size %"PTRDIFF_SPECIFIER"\n",
  566. (read_end - read_start) + av_fifo_size(fpc->fifo_buf));
  567. goto handle_error;
  568. }
  569. if (buf && buf_size) {
  570. av_fifo_generic_write(fpc->fifo_buf, (void*) read_start,
  571. read_end - read_start, NULL);
  572. } else {
  573. int8_t pad[MAX_FRAME_HEADER_SIZE] = { 0 };
  574. av_fifo_generic_write(fpc->fifo_buf, (void*) pad, sizeof(pad), NULL);
  575. }
  576. /* Tag headers and update sequences. */
  577. start_offset = av_fifo_size(fpc->fifo_buf) -
  578. ((read_end - read_start) + (MAX_FRAME_HEADER_SIZE - 1));
  579. start_offset = FFMAX(0, start_offset);
  580. nb_headers = find_new_headers(fpc, start_offset);
  581. if (nb_headers < 0) {
  582. av_log(avctx, AV_LOG_ERROR,
  583. "find_new_headers couldn't allocate FLAC header\n");
  584. goto handle_error;
  585. }
  586. fpc->nb_headers_buffered = nb_headers;
  587. /* Wait till FLAC_MIN_HEADERS to output a valid frame. */
  588. if (!fpc->end_padded && fpc->nb_headers_buffered < FLAC_MIN_HEADERS) {
  589. if (buf && read_end < buf + buf_size) {
  590. read_start = read_end;
  591. continue;
  592. } else {
  593. goto handle_error;
  594. }
  595. }
  596. /* If headers found, update the scores since we have longer chains. */
  597. if (fpc->end_padded || fpc->nb_headers_found)
  598. score_sequences(fpc);
  599. /* restore the state pre-padding */
  600. if (fpc->end_padded) {
  601. int warp = fpc->fifo_buf->wptr - fpc->fifo_buf->buffer < MAX_FRAME_HEADER_SIZE;
  602. /* HACK: drain the tail of the fifo */
  603. fpc->fifo_buf->wptr -= MAX_FRAME_HEADER_SIZE;
  604. fpc->fifo_buf->wndx -= MAX_FRAME_HEADER_SIZE;
  605. if (warp) {
  606. fpc->fifo_buf->wptr += fpc->fifo_buf->end -
  607. fpc->fifo_buf->buffer;
  608. }
  609. buf_size = 0;
  610. read_start = read_end = NULL;
  611. }
  612. }
  613. for (curr = fpc->headers; curr; curr = curr->next) {
  614. if (!fpc->best_header || curr->max_score > fpc->best_header->max_score) {
  615. fpc->best_header = curr;
  616. }
  617. }
  618. if (fpc->best_header && fpc->best_header->max_score <= 0) {
  619. // Only accept a bad header if there is no other option to continue
  620. if (!buf_size || !buf || read_end != buf || fpc->nb_headers_buffered < FLAC_MIN_HEADERS)
  621. fpc->best_header = NULL;
  622. }
  623. if (fpc->best_header) {
  624. fpc->best_header_valid = 1;
  625. if (fpc->best_header->offset > 0) {
  626. /* Output a junk frame. */
  627. av_log(avctx, AV_LOG_DEBUG, "Junk frame till offset %i\n",
  628. fpc->best_header->offset);
  629. /* Set duration to 0. It is unknown or invalid in a junk frame. */
  630. s->duration = 0;
  631. *poutbuf_size = fpc->best_header->offset;
  632. *poutbuf = flac_fifo_read_wrap(fpc, 0, *poutbuf_size,
  633. &fpc->wrap_buf,
  634. &fpc->wrap_buf_allocated_size);
  635. return buf_size ? (read_end - buf) : (fpc->best_header->offset -
  636. av_fifo_size(fpc->fifo_buf));
  637. }
  638. if (!buf_size)
  639. return get_best_header(fpc, poutbuf, poutbuf_size);
  640. }
  641. handle_error:
  642. *poutbuf = NULL;
  643. *poutbuf_size = 0;
  644. return buf_size ? read_end - buf : 0;
  645. }
  646. static av_cold int flac_parse_init(AVCodecParserContext *c)
  647. {
  648. FLACParseContext *fpc = c->priv_data;
  649. fpc->pc = c;
  650. /* There will generally be FLAC_MIN_HEADERS buffered in the fifo before
  651. it drains. This is allocated early to avoid slow reallocation. */
  652. fpc->fifo_buf = av_fifo_alloc_array(FLAC_MIN_HEADERS + 3, FLAC_AVG_FRAME_SIZE);
  653. if (!fpc->fifo_buf) {
  654. av_log(fpc->avctx, AV_LOG_ERROR,
  655. "couldn't allocate fifo_buf\n");
  656. return AVERROR(ENOMEM);
  657. }
  658. return 0;
  659. }
  660. static void flac_parse_close(AVCodecParserContext *c)
  661. {
  662. FLACParseContext *fpc = c->priv_data;
  663. FLACHeaderMarker *curr = fpc->headers, *temp;
  664. while (curr) {
  665. temp = curr->next;
  666. av_freep(&curr->link_penalty);
  667. av_free(curr);
  668. curr = temp;
  669. }
  670. av_fifo_freep(&fpc->fifo_buf);
  671. av_freep(&fpc->wrap_buf);
  672. }
  673. AVCodecParser ff_flac_parser = {
  674. .codec_ids = { AV_CODEC_ID_FLAC },
  675. .priv_data_size = sizeof(FLACParseContext),
  676. .parser_init = flac_parse_init,
  677. .parser_parse = flac_parse,
  678. .parser_close = flac_parse_close,
  679. };