Mercurial > libavcodec.hg

changeset 6054:de71ee8112f4 libavcodec

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
More consistent { placement.
author michael
date Fri, 21 Dec 2007 10:20:10 +0000
parents f4607985f888
children bc22d052c6e5
files dsputil.c
diffstat 1 files changed, 6 insertions(+), 12 deletions(-) [+]
line wrap: on
line diff
--- a/dsputil.c	Fri Dec 21 10:17:25 2007 +0000
+++ b/dsputil.c	Fri Dec 21 10:20:10 2007 +0000
@@ -1441,8 +1441,7 @@
     assert(x<8 && y<8 && x>=0 && y>=0);\
 \
     if(D){\
-        for(i=0; i<h; i++)\
-        {\
+        for(i=0; i<h; i++){\
             OP(dst[0], (A*src[0] + B*src[1] + C*src[stride+0] + D*src[stride+1]));\
             OP(dst[1], (A*src[1] + B*src[2] + C*src[stride+1] + D*src[stride+2]));\
             dst+= stride;\
@@ -1451,8 +1450,7 @@
     }else{\
         const int E= B+C;\
         const int step= C ? stride : 1;\
-        for(i=0; i<h; i++)\
-        {\
+        for(i=0; i<h; i++){\
             OP(dst[0], (A*src[0] + E*src[step+0]));\
             OP(dst[1], (A*src[1] + E*src[step+1]));\
             dst+= stride;\
@@ -1471,8 +1469,7 @@
     assert(x<8 && y<8 && x>=0 && y>=0);\
 \
     if(D){\
-        for(i=0; i<h; i++)\
-        {\
+        for(i=0; i<h; i++){\
             OP(dst[0], (A*src[0] + B*src[1] + C*src[stride+0] + D*src[stride+1]));\
             OP(dst[1], (A*src[1] + B*src[2] + C*src[stride+1] + D*src[stride+2]));\
             OP(dst[2], (A*src[2] + B*src[3] + C*src[stride+2] + D*src[stride+3]));\
@@ -1483,8 +1480,7 @@
     }else{\
         const int E= B+C;\
         const int step= C ? stride : 1;\
-        for(i=0; i<h; i++)\
-        {\
+        for(i=0; i<h; i++){\
             OP(dst[0], (A*src[0] + E*src[step+0]));\
             OP(dst[1], (A*src[1] + E*src[step+1]));\
             OP(dst[2], (A*src[2] + E*src[step+2]));\
@@ -1505,8 +1501,7 @@
     assert(x<8 && y<8 && x>=0 && y>=0);\
 \
     if(D){\
-        for(i=0; i<h; i++)\
-        {\
+        for(i=0; i<h; i++){\
             OP(dst[0], (A*src[0] + B*src[1] + C*src[stride+0] + D*src[stride+1]));\
             OP(dst[1], (A*src[1] + B*src[2] + C*src[stride+1] + D*src[stride+2]));\
             OP(dst[2], (A*src[2] + B*src[3] + C*src[stride+2] + D*src[stride+3]));\
@@ -1521,8 +1516,7 @@
     }else{\
         const int E= B+C;\
         const int step= C ? stride : 1;\
-        for(i=0; i<h; i++)\
-        {\
+        for(i=0; i<h; i++){\
             OP(dst[0], (A*src[0] + E*src[step+0]));\
             OP(dst[1], (A*src[1] + E*src[step+1]));\
             OP(dst[2], (A*src[2] + E*src[step+2]));\