1 /* === S Y N F I G ========================================================= */
2 /*! \file mod_noise/random.cpp
8 ** Copyright (c) 2002-2005 Robert B. Quattlebaum Jr., Adrian Bentley
10 ** This package is free software; you can redistribute it and/or
11 ** modify it under the terms of the GNU General Public License as
12 ** published by the Free Software Foundation; either version 2 of
13 ** the License, or (at your option) any later version.
15 ** This package is distributed in the hope that it will be useful,
16 ** but WITHOUT ANY WARRANTY; without even the implied warranty of
17 ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 ** General Public License for more details.
21 /* ========================================================================= */
23 /* === H E A D E R S ======================================================= */
37 // A fast 32-bit linear congruential random number generator
42 quick_rng(unsigned long seed):next(seed) { }
44 void set_seed(unsigned long x)
51 static const unsigned long a(1664525);
52 static const unsigned long c(1013904223);
64 static const float m(int(65535));
66 return float(i16())/m;
70 /* === M A C R O S ========================================================= */
72 #define PI (3.1415927)
74 /* === G L O B A L S ======================================================= */
76 /* === P R O C E D U R E S ================================================= */
78 /* === M E T H O D S ======================================================= */
81 Random::set_seed(int x)
87 Random::operator()(const int salt,const int x,const int y,const int t)const
89 static const unsigned int a(21870);
90 static const unsigned int b(11213);
91 static const unsigned int c(36979);
92 static const unsigned int d(31337);
95 ( static_cast<unsigned int>(x+y) * a ) ^
96 ( static_cast<unsigned int>(y+t) * b ) ^
97 ( static_cast<unsigned int>(t+x) * c ) ^
98 ( static_cast<unsigned int>(seed_+salt) * d )
101 return rng.f() * 2.0f - 1.0f;
105 Random::operator()(int smooth,int subseed,float xf,float yf,float tf)const
107 int x((int)floor(xf));
108 int y((int)floor(yf));
109 int t((int)floor(tf));
115 #define f(j,i,k) ((*this)(subseed,i,j,k))
116 //Using catmull rom interpolation because it doesn't blur at all
117 //bezier curve with intermediate ctrl pts: 0.5/3(p(i+1) - p(i-1)) and similar
118 float xfa [4], tfa[4];
120 //precalculate indices (all clamped) and offset
121 const int xa[] = {x-1,x,x+1,x+2};
123 const int ya[] = {y-1,y,y+1,y+2};
125 const int ta[] = {t-1,t,t+1,t+2};
127 const float dx(xf-x);
128 const float dy(yf-y);
129 const float dt(tf-t);
131 //figure polynomials for each point
134 0.5*dx*(dx*(dx*(-1) + 2) - 1), //-t + 2t^2 -t^3
135 0.5*(dx*(dx*(3*dx - 5)) + 2), //2 - 5t^2 + 3t^3
136 0.5*dx*(dx*(-3*dx + 4) + 1), //t + 4t^2 - 3t^3
137 0.5*dx*dx*(dx-1) //-t^2 + t^3
142 0.5*dy*(dy*(dy*(-1) + 2) - 1), //-t + 2t^2 -t^3
143 0.5*(dy*(dy*(3*dy - 5)) + 2), //2 - 5t^2 + 3t^3
144 0.5*dy*(dy*(-3*dy + 4) + 1), //t + 4t^2 - 3t^3
145 0.5*dy*dy*(dy-1) //-t^2 + t^3
150 0.5*dt*(dt*(dt*(-1) + 2) - 1), //-t + 2t^2 -t^3
151 0.5*(dt*(dt*(3*dt - 5)) + 2), //2 - 5t^2 + 3t^3
152 0.5*dt*(dt*(-3*dt + 4) + 1), //t + 4t^2 - 3t^3
153 0.5*dt*dt*(dt-1) //-t^2 + t^3
156 //evaluate polynomial for each row
157 for(int i = 0; i < 4; ++i)
159 for(int j = 0; j < 4; ++j)
161 tfa[j] = f(ya[i],xa[j],ta[0])*ttf[0] + f(ya[i],xa[j],ta[1])*ttf[1] + f(ya[i],xa[j],ta[2])*ttf[2] + f(ya[i],xa[j],ta[3])*ttf[3];
163 xfa[i] = tfa[0]*txf[0] + tfa[1]*txf[1] + tfa[2]*txf[2] + tfa[3]*txf[3];
166 //return the cumulative column evaluation
167 return xfa[0]*tyf[0] + xfa[1]*tyf[1] + xfa[2]*tyf[2] + xfa[3]*tyf[3];
173 case 5: // Fast Spline (non-animated)
175 #define P(x) (((x)>0)?((x)*(x)*(x)):0.0f)
176 #define R(x) ( P(x+2) - 4.0f*P(x+1) + 6.0f*P(x) - 4.0f*P(x-1) )*(1.0f/6.0f)
177 #define F(i,j) ((*this)(subseed,i+x,j+y)*(R((i)-a)*R(b-(j))))
178 #define FT(i,j,k) ((*this)(subseed,i+x,j+y,k+t)*(R((i)-a)*R(b-(j))*R((k)-c)))
179 #define Z(i,j) ret+=F(i,j)
180 #define ZT(i,j,k) ret+=FT(i,j,k)
181 #define X(i,j) // placeholder... To make box more symmetric
182 #define XT(i,j,k) // placeholder... To make box more symmetric
184 float a(xf-x), b(yf-y);
188 Z(-1,-1); Z(-1, 0); Z(-1, 1); Z(-1, 2);
189 Z( 0,-1); X( 0, 0); Z( 0, 1); Z( 0, 2);
190 Z( 1,-1); Z( 1, 0); Z( 1, 1); Z( 1, 2);
191 Z( 2,-1); Z( 2, 0); Z( 2, 1); Z( 2, 2);
196 case 3: // Spline (animated)
198 float a(xf-x), b(yf-y), c(tf-t);
201 float ret(FT(0,0,0));
202 ZT(-1,-1,-1); ZT(-1, 0,-1); ZT(-1, 1,-1); ZT(-1, 2,-1);
203 ZT( 0,-1,-1); ZT( 0, 0,-1); ZT( 0, 1,-1); ZT( 0, 2,-1);
204 ZT( 1,-1,-1); ZT( 1, 0,-1); ZT( 1, 1,-1); ZT( 1, 2,-1);
205 ZT( 2,-1,-1); ZT( 2, 0,-1); ZT( 2, 1,-1); ZT( 2, 2,-1);
207 ZT(-1,-1, 0); ZT(-1, 0, 0); ZT(-1, 1, 0); ZT(-1, 2, 0);
208 ZT( 0,-1, 0); XT( 0, 0, 0); ZT( 0, 1, 0); ZT( 0, 2, 0);
209 ZT( 1,-1, 0); ZT( 1, 0, 0); ZT( 1, 1, 0); ZT( 1, 2, 0);
210 ZT( 2,-1, 0); ZT( 2, 0, 0); ZT( 2, 1, 0); ZT( 2, 2, 0);
212 ZT(-1,-1, 1); ZT(-1, 0, 1); ZT(-1, 1, 1); ZT(-1, 2, 1);
213 ZT( 0,-1, 1); ZT( 0, 0, 1); ZT( 0, 1, 1); ZT( 0, 2, 1);
214 ZT( 1,-1, 1); ZT( 1, 0, 1); ZT( 1, 1, 1); ZT( 1, 2, 1);
215 ZT( 2,-1, 1); ZT( 2, 0, 1); ZT( 2, 1, 1); ZT( 2, 2, 1);
217 ZT(-1,-1, 2); ZT(-1, 0, 2); ZT(-1, 1, 2); ZT(-1, 2, 2);
218 ZT( 0,-1, 2); ZT( 0, 0, 2); ZT( 0, 1, 2); ZT( 0, 2, 2);
219 ZT( 1,-1, 2); ZT( 1, 0, 2); ZT( 1, 1, 2); ZT( 1, 2, 2);
220 ZT( 2,-1, 2); ZT( 2, 0, 2); ZT( 2, 1, 2); ZT( 2, 2, 2);
235 ret+=(*this)(subseed,i+x,j+y,h+t)*(R(i-dx)*R(j-dy)*R(h-dt));
249 int x((int)floor(xf));
250 int y((int)floor(yf));
253 a=(1.0f-cos(a*PI))*0.5f;
254 b=(1.0f-cos(b*PI))*0.5f;
259 (*this)(subseed,x,y,t)*(c*d)+
260 (*this)(subseed,x2,y,t)*(a*d)+
261 (*this)(subseed,x,y2,t)*(c*b)+
262 (*this)(subseed,x2,y2,t)*(a*b);
270 a=(1.0f-cos(a*3.1415927))*0.5f;
271 b=(1.0f-cos(b*3.1415927))*0.5f;
273 // We don't perform this on the time axis, otherwise we won't
275 //c=(1.0f-cos(c*3.1415927))*0.5f;
281 int x2=x+1,y2=y+1,t2=t+1;
284 (*this)(subseed,x,y,t)*(d*e*f)+
285 (*this)(subseed,x2,y,t)*(a*e*f)+
286 (*this)(subseed,x,y2,t)*(d*b*f)+
287 (*this)(subseed,x2,y2,t)*(a*b*f)+
288 (*this)(subseed,x,y,t2)*(d*e*c)+
289 (*this)(subseed,x2,y,t2)*(a*e*c)+
290 (*this)(subseed,x,y2,t2)*(d*b*c)+
291 (*this)(subseed,x2,y2,t2)*(a*b*c);
296 int x((int)floor(xf));
297 int y((int)floor(yf));
304 (*this)(subseed,x,y,t)*(c*d)+
305 (*this)(subseed,x2,y,t)*(a*d)+
306 (*this)(subseed,x,y2,t)*(c*b)+
307 (*this)(subseed,x2,y2,t)*(a*b);
320 int x2=x+1,y2=y+1,t2=t+1;
323 (*this)(subseed,x,y,t)*(d*e*f)+
324 (*this)(subseed,x2,y,t)*(a*e*f)+
325 (*this)(subseed,x,y2,t)*(d*b*f)+
326 (*this)(subseed,x2,y2,t)*(a*b*f)+
327 (*this)(subseed,x,y,t2)*(d*e*c)+
328 (*this)(subseed,x2,y,t2)*(a*e*c)+
329 (*this)(subseed,x,y2,t2)*(d*b*c)+
330 (*this)(subseed,x2,y2,t2)*(a*b*c);
334 return (*this)(subseed,x,y,t);