Mercurial > libpostproc.hg
changeset 49:cdfe8fc50090 libpostproc
misc typo fixes
author | diego |
---|---|
date | Tue, 12 Jun 2007 18:50:50 +0000 |
parents | 72675332ed82 |
children | 24e913b87066 |
files | postprocess_template.c |
diffstat | 1 files changed, 4 insertions(+), 3 deletions(-) [+] |
line wrap: on
line diff
--- a/postprocess_template.c Tue Jun 12 09:29:25 2007 +0000 +++ b/postprocess_template.c Tue Jun 12 18:50:50 2007 +0000 @@ -373,7 +373,8 @@ * Experimental implementation of the filter (Algorithm 1) described in a paper from Ramkishor & Karandikar * values are correctly clipped (MMX2) * values are wraparound (C) - * conclusion: its fast, but introduces ugly horizontal patterns if there is a continious gradient + * Conclusion: It is fast, but introduces ugly horizontal patterns + * if there is a continuous gradient. 0 8 16 24 x = 8 x/2 = 4 @@ -3498,7 +3499,7 @@ ); #elif defined(HAVE_3DNOW) -//FIXME check if this is faster on an 3dnow chip or if its faster without the prefetch or ... +//FIXME check if this is faster on an 3dnow chip or if it is faster without the prefetch or ... /* prefetch(srcBlock + (((x>>3)&3) + 5)*srcStride + 32); prefetch(srcBlock + (((x>>3)&3) + 9)*srcStride + 32); prefetchw(dstBlock + (((x>>3)&3) + 5)*dstStride + 32); @@ -3642,7 +3643,7 @@ ); #elif defined(HAVE_3DNOW) -//FIXME check if this is faster on an 3dnow chip or if its faster without the prefetch or ... +//FIXME check if this is faster on an 3dnow chip or if it is faster without the prefetch or ... /* prefetch(srcBlock + (((x>>3)&3) + 5)*srcStride + 32); prefetch(srcBlock + (((x>>3)&3) + 9)*srcStride + 32); prefetchw(dstBlock + (((x>>3)&3) + 5)*dstStride + 32);