[FFmpeg-devel] [PATCH 1/2] avfilter: Implement graph_run_once_find_filter() in O(1)

Nicolas George george at nsup.org
Fri May 27 16:34:53 CEST 2016

Le nonidi 9 prairial, an CCXXIV, Michael Niedermayer a écrit :
> ATM with 10 filters this is 100 times slower than 1 filter
> with 100 filters its 10000 times slower than 1 filter
> with 1000 fiters its 1000000 times slower than 1 filter

What you say seem strange. The code looks O(n×p) with n the number of
filters and p the average number of pads per filter; p is usually quite

> well, if that patch is incovenient for your work ATM we can drop it.


> But i do want this fixed at some point
> i am alergic to code thats by a factor of "~n" slower than what can
> reasonable easy be done (unless n is somehow bounded and its just
> init code or otherwise irrelevant)

I can ease your mind on that, I am allergic to that kind of thing too.
Implementing a priority queue of filters that are ready for processing was
in my TODO queue before this series.

As always, time available to work on the project is the limiting factor.


  Nicolas George
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 819 bytes
Desc: Digital signature
URL: <http://ffmpeg.org/pipermail/ffmpeg-devel/attachments/20160527/1d4755ab/attachment.sig>

More information about the ffmpeg-devel mailing list