# HG changeset patch
# User michael
# Date 1198232410 0
# Node ID de71ee8112f4b47ac09e3a0bf86386bc1945eec4
# Parent  f4607985f8880d1eac27253328d45263f17c7afc
More consistent { placement.

diff -r f4607985f888 -r de71ee8112f4 dsputil.c
--- 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]));\