Recherche avancée

Sur d’autres sites (8073)

• ffmpeg covert yuv to mp4 failed :"Invalid buffer size, packet size"

  3 janvier 2020, par Sean

  Hi I am trying to convert YUV video to a avi formt with the following command :
  "ffmpeg -f rawvideo -vcodec rawvideo -s 512x512 -r 25 -pix_fmt yuv420p -i output3.yuv -c:v libx264 -preset ultrafast -qp 0 output.avi"

  Then I got an error

  [rawvideo @ 0x1c9e620] Estimating duration from bitrate, this may be inaccurate
Input #0, rawvideo, from 'output3.yuv':
 Duration: 00:00:01.72, start: 0.000000, bitrate: 79250 kb/s
   Stream #0:0: Video: rawvideo (I420 / 0x30323449), yuv420p, 512x512, 78643 kb/s, 25 tbr, 25 tbn, 25 tbc
File 'output.avi' already exists. Overwrite ? [y/N] y
[libx264 @ 0x1ca93e0] using cpu capabilities: MMX2 SSE2Fast SSSE3 SSE4.2 AVX FMA3 AVX2 LZCNT BMI2
[libx264 @ 0x1ca93e0] profile High 4:4:4 Predictive, level 3.0, 4:2:0 8-bit
Output #0, avi, to 'output.avi':
 Metadata:
   ISFT            : Lavf56.40.101
   Stream #0:0: Video: h264 (libx264) (H264 / 0x34363248), yuv420p, 512x512, q=-1--1, 25 fps, 25 tbn, 25 tbc
   Metadata:
     encoder         : Lavc56.60.100 libx264
Stream mapping:
 Stream #0:0 -> #0:0 (rawvideo (native) -> h264 (libx264))
Press [q] to stop, [?] for help
[rawvideo @ 0x1ca7fa0] **Invalid buffer size, packet size 130560 < expected frame_size 393216**
**Error while decoding stream #0:0: Invalid argument**
frame=   43 fps=0.0 q=-1.0 Lsize=    8389kB time=00:00:01.72 bitrate=39954.8kbits/s<br />
video:8382kB audio:0kB subtitle:0kB other streams:0kB global headers:0kB muxing overhead: 0.078511%

  Any help will be appreciated.

  Thanks.

• avformat/matroskadec : Introduce a "last known good" position

  17 mai 2019, par Andreas Rheinhardt

  avformat/matroskadec : Introduce a "last known good" position
  Currently, resyncing during reading packets works as follows :
  
  The current position is recorded, then a call to matroska_parse_cluster
  
  is made and if said call fails, the demuxer tries to resync from the
  
  earlier position. If the call doesn't fail, but also doesn't deliver a
  
  packet, then this is looped.
  There are two problems with this approach :
  
  1. The Matroska file format aims to be forward-compatible ; to achieve
  
  this, a demuxer should simply ignore and skip elements it doesn't
  
  know about. But it is not possible to reliably distinguish unknown
  
  elements from junk. If matroska_parse_cluster encounters an unknown
  
  element, it can therefore not simply error out ; instead it returns zero
  
  and the loop is iterated which includes an update of the position that
  
  is intended to be used in case of errors, i.e. the element that is
  
  skipped is not searched for level 1 element ids to resync to at all if
  
  later calls to matroska_parse_cluster return an error.
  
  Notice that in case that sync has been lost there can be a chain of
  
  several unknown/possibly junk elements before an error is detected.
  2. Even if a call to matroska_parse_cluster delivers a packet, this does
  
  not mean that everything is fine. E.g. it might be that some of the
  
  block's data is missing and that the data that was presumed to be from
  
  the block just read actually contains the beginning of the next element.
  
  This will only be apparent at the next call of matroska_read_packet,
  
  which uses the (false) end of the earlier block as resync position so
  
  that in the (not unlikely) case that the call to matroska_parse_cluster
  
  fails, the data believed to be part of the earlier block is not searched
  
  for a level 1 element to resync to.
  To counter this, a "last known good" position is introduced. When an
  
  element id that is known to be allowed at this position in the hierarchy
  
  (according to the syntax currently in use for parsing) is read and some
  
  further checks (regarding the length of the element and its containing
  
  master element) are passed, then the beginning of the current element is
  
  treated as a "good" position and recorded as such in the
  
  MatroskaDemuxContext. Because of 2., only the start of the element is
  
  treated as a "good" position, not the whole element. If an error occurs
  
  later during parsing of clusters, the resync process starts at the last
  
  known good position.
  Given that when the header is damaged the subsequent resync never skips over
  
  data and is therefore unaffected by both issues, the "last known good"
  
  concept is not used there.
  Signed-off-by : Andreas Rheinhardt <andreas.rheinhardt@gmail.com>
  

  • [DH] libavformat/matroskadec.c

• avformat/matroskadec : Improve check for level 1 duplicates

  17 mai 2019, par Andreas Rheinhardt

  avformat/matroskadec : Improve check for level 1 duplicates
  If a file uses unknown-length level 1 elements besides clusters and such
  
  elements are after the first cluster, then these elements will usually
  
  be parsed twice : Once during parsing of the file header and once when
  
  reading the file reaches the position where these elements are located.
  
  The second time the element is parsed leads to a "Duplicate element"
  
  error message. Known-length elements are not affected by this as they
  
  are skipped except during parsing the header.
  This commit fixes this by explicitly adding a check for whether the
  
  position of the element to be parsed is the same as the position of the
  
  already known level 1 element.
  Signed-off-by : Andreas Rheinhardt <andreas.rheinhardt@gmail.com>
  

  • [DH] libavformat/matroskadec.c