X-Git-Url: http://git.jankratochvil.net/?p=reactos.git;a=blobdiff_plain;f=subsys%2Fwin32k%2Fobjects%2Fbezier.c;h=230749eef2540ab7d2979059309cd12ae6e8d2b0;hp=9337783e4f719d02fe7b43301526a03368e66d9c;hb=HEAD;hpb=7c0db166f81fbe8c8b913d7f26048e337d383605

diff --git a/subsys/win32k/objects/bezier.c b/subsys/win32k/objects/bezier.c
index 9337783..230749e 100644
--- a/subsys/win32k/objects/bezier.c
+++ b/subsys/win32k/objects/bezier.c
@@ -1,5 +1,25 @@
+/*
+ *  ReactOS W32 Subsystem
+ *  Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003 ReactOS Team
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ */
+/* $Id$ */
 #include <windows.h>
 #include <ddk/ntddk.h>
+#include <math.h>
 
 /******************************************************************
  * 
@@ -43,7 +63,15 @@
 #define BEZIERMIDDLE(Mid, P1, P2) \
   (Mid).x=((P1).x+(P2).x + 1)/2;\
   (Mid).y=((P1).y+(P2).y + 1)/2;
-    
+
+static int abs ( int __x )
+{
+  if ( __x < 0 )
+    return -__x;
+  else
+    return __x;
+}
+
 /**********************************************************
 * BezierCheck helper function to check
 * that recursion can be terminated
@@ -52,46 +80,67 @@
 *       level is the recursion depth
 *       returns true if the recusion can be terminated
 */
-static BOOL BezierCheck( int level, POINT *Points)
+static BOOL FASTCALL BezierCheck( int level, POINT *Points)
 { 
   INT dx, dy;
 
   dx=Points[3].x-Points[0].x;
   dy=Points[3].y-Points[0].y;
-  if(abs(dy)<=abs(dx)) {/* shallow line */
+  if ( abs(dy) <= abs(dx) ) /* shallow line */
+  {
     /* check that control points are between begin and end */
-    if(Points[1].x < Points[0].x){
-      if(Points[1].x < Points[3].x) return FALSE;
-    }else
-    if(Points[1].x > Points[3].x) return FALSE;
-    if(Points[2].x < Points[0].x) {
-      if(Points[2].x < Points[3].x) return FALSE;
-    } else
-      if(Points[2].x > Points[3].x) return FALSE;
-      dx=BEZIERSHIFTDOWN(dx);
-      if(!dx) return TRUE;
-      if(abs(Points[1].y-Points[0].y-(dy/dx)*
-        BEZIERSHIFTDOWN(Points[1].x-Points[0].x)) > BEZIERPIXEL ||
-        abs(Points[2].y-Points[0].y-(dy/dx)*
-        BEZIERSHIFTDOWN(Points[2].x-Points[0].x)) > BEZIERPIXEL) return FALSE;
+    if ( Points[1].x < Points[0].x )
+    {
+      if ( Points[1].x < Points[3].x )
+	return FALSE;
+    }
+    else if ( Points[1].x > Points[3].x )
+      return FALSE;
+    if ( Points[2].x < Points[0].x)
+    {
+      if ( Points[2].x < Points[3].x )
+	return FALSE;
+    }
+    else if ( Points[2].x > Points[3].x )
+      return FALSE;
+    dx = BEZIERSHIFTDOWN(dx);
+    if ( !dx )
+      return TRUE;
+    if ( abs(Points[1].y-Points[0].y-(dy/dx)*
+	BEZIERSHIFTDOWN(Points[1].x-Points[0].x)) > BEZIERPIXEL ||
+	abs(Points[2].y-Points[0].y-(dy/dx)*
+	BEZIERSHIFTDOWN(Points[2].x-Points[0].x)) > BEZIERPIXEL
+	)
+	return FALSE;
       else
         return TRUE;
-    } else{ /* steep line */
+  }
+  else
+  { /* steep line */
       /* check that control points are between begin and end */
-      if(Points[1].y < Points[0].y){
-        if(Points[1].y < Points[3].y) return FALSE;
-      } else
-        if(Points[1].y > Points[3].y) return FALSE;
-      if(Points[2].y < Points[0].y){
-        if(Points[2].y < Points[3].y) return FALSE;
-      } else
-        if(Points[2].y > Points[3].y) return FALSE;
-      dy=BEZIERSHIFTDOWN(dy);
-      if(!dy) return TRUE;
-      if(abs(Points[1].x-Points[0].x-(dx/dy)*
+      if(Points[1].y < Points[0].y)
+      {
+        if(Points[1].y < Points[3].y)
+	  return FALSE;
+      }
+      else if(Points[1].y > Points[3].y)
+	return FALSE;
+      if ( Points[2].y < Points[0].y )
+      {
+        if ( Points[2].y < Points[3].y )
+	  return FALSE;
+      }
+      else if ( Points[2].y > Points[3].y )
+	return FALSE;
+      dy = BEZIERSHIFTDOWN(dy);
+      if ( !dy )
+	return TRUE;
+      if ( abs(Points[1].x-Points[0].x-(dx/dy)*
         BEZIERSHIFTDOWN(Points[1].y-Points[0].y)) > BEZIERPIXEL ||
         abs(Points[2].x-Points[0].x-(dx/dy)*
-        BEZIERSHIFTDOWN(Points[2].y-Points[0].y)) > BEZIERPIXEL ) return FALSE;
+        BEZIERSHIFTDOWN(Points[2].y-Points[0].y)) > BEZIERPIXEL
+	)
+	return FALSE;
       else
         return TRUE;
     }
@@ -100,7 +149,7 @@ static BOOL BezierCheck( int level, POINT *Points)
 /* Helper for GDI_Bezier.
  * Just handles one Bezier, so Points should point to four POINTs
  */
-static void GDI_InternalBezier( POINT *Points, POINT **PtsOut, INT *dwOut,
+static void STDCALL GDI_InternalBezier( POINT *Points, POINT **PtsOut, INT *dwOut,
 				INT *nPtsOut, INT level )
 {
   if(*nPtsOut == *dwOut) {
@@ -160,7 +209,7 @@ static void GDI_InternalBezier( POINT *Points, POINT **PtsOut, INT *dwOut,
  *  alternative would be to call the function twice, once to determine the size
  *  and a second time to do the work - I decided this was too much of a pain].
  */
-POINT *GDI_Bezier( const POINT *Points, INT count, INT *nPtsOut )
+POINT * FASTCALL GDI_Bezier( const POINT *Points, INT count, INT *nPtsOut )
 {
   POINT *out;
   INT Bezier, dwOut = BEZIER_INITBUFSIZE, i;
@@ -182,3 +231,4 @@ POINT *GDI_Bezier( const POINT *Points, INT count, INT *nPtsOut )
 
   return out;
 }
+/* EOF */