On Fri, Dec 02, 2022 at 12:58:48AM +0000, Wang, Fei W wrote:
> On Fri, 2022-12-02 at 01:21 +0100, Michael Niedermayer wrote:
> > On Thu, Dec 01, 2022 at 04:13:58PM +0800, Fei Wang wrote:
> > > From: Linjie Fu <linjie.fu@intel.com>
> > > 
> > > 1. Add extension syntax according to 7.3.2.2.3/7.3.2.3.3 in T-REC-
> > > H.265-201911.
> > > 2. Keep using parsed PPS when bitstream overread for compatibility.
> > > For
> > > example, the clip PS_A_VIDYO_3.bit in FATE test has incomplete
> > > extension
> > > syntax which will be overread and un-decodable if without this
> > > change.
> > > 3. Format brace in pps_range_extensions().
> > > 
> > > Signed-off-by: Linjie Fu <linjie.justin.fu@gmail.com>
> > > Signed-off-by: Haihao Xiang <haihao.xiang@intel.com>
> > > Signed-off-by: Fei Wang <fei.w.wang@intel.com>
> > > ---
> > >  libavcodec/hevc.h    |   3 +
> > >  libavcodec/hevc_ps.c | 293
> > > +++++++++++++++++++++++++++++++++++++++++--
> > >  libavcodec/hevc_ps.h |  69 ++++++++++
> > >  3 files changed, 357 insertions(+), 8 deletions(-)
> > 
> > This causes segfaults
> > 
> > shortened stack trace looks like this, 
> > seems like classic stack overflow from infinite recursion
> 
> Thanks Michael, Could you send me the clip caused this issue?

file sent privatly

thx

[...]
-- 
Michael     GnuPG fingerprint: 9FF2128B147EF6730BADF133611EC787040B0FAB

Awnsering whenever a program halts or runs forever is
On a turing machine, in general impossible (turings halting problem).
On any real computer, always possible as a real computer has a finite number
of states N, and will either halt in less than N cycles or never halt.