X-Git-Url: http://git.xonotic.org/?p=xonotic%2Fdarkplaces.git;a=blobdiff_plain;f=curves.c;h=1d9b2941934ebcc0ecb947f6dfce267a01dd3654;hp=17d1b9424d0c24c97f2610f180190875d9e2b3f2;hb=f129784b67308e149e458c9dfbdf245535ab2a8f;hpb=f43e9a636561965afc341dee35f19de6c53efaa6

diff --git a/curves.c b/curves.c
index 17d1b942..1d9b2941 100644
--- a/curves.c
+++ b/curves.c
@@ -1,6 +1,5 @@
-
 /*
-this code written by Forest Hale, on 2004-10-17, and placed into public domain
+this code written by Ashley Rose Hale (LadyHavoc), on 2004-10-17, and placed into public domain
 this implements Quadratic BSpline surfaces as seen in Quake3 by id Software
 
 a small rant on misuse of the name 'bezier': many people seem to think that
@@ -156,7 +155,7 @@ static int Q3PatchTesselation(float largestsquared3xcurvearea, float tolerance)
 		// maps [4..8[ to 4
 }
 
-float Squared3xCurveArea(const float *a, const float *control, const float *b, int components)
+static float Squared3xCurveArea(const float *a, const float *control, const float *b, int components)
 {
 #if 0
 	// mimicing the old behaviour with the new code...
@@ -277,7 +276,7 @@ static int FindEqualOddVertexInArray(int numcomponents, float *vertex, float *ve
 	{
 		for (x=0; x<width; x+=2)
 		{
-			qboolean found = true;
+			qbool found = true;
 			for (j=0; j<numcomponents; j++)
 				if (fabs(*(vertex+j) - *(vertices+j)) > 0.05)
 				// div0: this is notably smaller than the smallest radiant grid
@@ -337,7 +336,7 @@ int Q3PatchAdjustTesselation(int numcomponents, patchinfo_t *patch1, float *patc
 	struct {int id1,id2;} commonverts[8];
 	int i, j, k, side1, side2, *tess1, *tess2;
 	int dist1 = 0, dist2 = 0;
-	qboolean modified = false;
+	qbool modified = false;
 
 	// Potential paired vertices (corners of the first patch)
 	commonverts[0].id1 = 0;