sergiotarxz/libvips
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

s/nohalo1 cosmetic

Browse Source
This commit is contained in:
Nicolas Robidoux 2009-05-26 16:23:07 +00:00
parent 073f740993
commit b2542a4152
2 changed files with 5 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
libsrc/resample/nohalo1.cpp
View File

@ -2,9 +2,7 @@
* *
* Hacked for vips by J. Cupitt, 20/1/09 * Hacked for vips by J. Cupitt, 20/1/09
* *
* 16/3/09 * Rename as nohalo1 and move "restrict" support to configure, 16/3/09
* - rename as nohalo1
* - move "restrict" support to configure
* *
* Tweaks by N. Robidoux and J. Cupitt 4-17/3/09 * Tweaks by N. Robidoux and J. Cupitt 4-17/3/09
* *
@ -234,8 +232,8 @@
* FAST_MINMOD is an implementation of the minmod function which only * FAST_MINMOD is an implementation of the minmod function which only
* needs two conditional moves. (Nicolas: I think that this may be * needs two conditional moves. (Nicolas: I think that this may be
* the very first two branch minmod.) The product of the two arguments * the very first two branch minmod.) The product of the two arguments
* and a useful difference involving them are also precomputed to keep * and a useful difference involving them are precomputed as far ahead
* them out of branching way. * of branching as possible.
*/ */
#define FAST_MINMOD(a,b,ab,abminusaa) \ #define FAST_MINMOD(a,b,ab,abminusaa) \
( (ab)>=0. ? ( (abminusaa)>=0. ? (a) : (b) ) : 0. ) ( (ab)>=0. ? ( (abminusaa)>=0. ? (a) : (b) ) : 0. )

4
libsrc/resample/snohalo1.cpp
View File

@ -76,8 +76,8 @@
* FAST_MINMOD is an implementation of the minmod function which only * FAST_MINMOD is an implementation of the minmod function which only
* needs two conditional moves. (Nicolas: I think that this may be * needs two conditional moves. (Nicolas: I think that this may be
* the very first two branch minmod.) The product of the two arguments * the very first two branch minmod.) The product of the two arguments
* and a useful difference involving them are also precomputed to keep * and a useful difference involving them are precomputed as far ahead
* them out of branching way. * of branching as possible.
*/ */
#define FAST_MINMOD(a,b,ab,abminusaa) \ #define FAST_MINMOD(a,b,ab,abminusaa) \
( (ab)>=0. ? ( (abminusaa)>=0. ? (a) : (b) ) : 0. ) ( (ab)>=0. ? ( (abminusaa)>=0. ? (a) : (b) ) : 0. )