Hi, On Thu, Apr 5, 2012 at 8:01 AM, Christophe Gisquet <[email protected]> wrote: > while the asm part is not very readable, this patch can be summarized > as having 2 sets of bi-weight functions depending on whether weight > fractions can be simplified. This trick was also used in the SSSE3 x86 > implementation, but the check was performed every call, while it > really needs to be done only once per frame. > > I haven't modified the neon code (build would probably fail), although > it should be very simple to modify.
This looks OK. Is there a performance benefit? I assume there isn't anything measurable, because the overhead is relatively low? As for the code, do please document the arrays in rv34dsp.h, so we don't have to look at the code to figure out what the difference between [0][0] and [1][1] is. Ronald _______________________________________________ libav-devel mailing list [email protected] https://lists.libav.org/mailman/listinfo/libav-devel
