Annotation of parser3/src/classes/math.C, revision 1.24.2.12.2.17
1.1 parser 1: /** @file
2: Parser: @b math parser class.
3:
1.24.2.2 paf 4: Copyright(c) 2001-2003 ArtLebedev Group(http://www.artlebedev.com)
1.20 paf 5: Author: Alexandr Petrosian <paf@design.ru>(http://paf.design.ru)
1.24.2.12.2.1 (paf 6:):
7:): portions from gen_uuid.c,
8:): Copyright (C) 1996, 1997, 1998, 1999 Theodore Ts'o.
1.22 paf 9: */
1.1 parser 10:
1.24.2.12.2.1 (paf 11:): static const char* IDENT_MATH_C="$Date: 2003/07/24 06:18:38 $";
1.24.2.4 paf 12:
13: #include "pa_vmethod_frame.h"
1.1 parser 14: #include "pa_common.h"
15: #include "pa_vint.h"
1.2 parser 16: #include "pa_vmath.h"
1.1 parser 17: #include "pa_request.h"
1.19 paf 18: #include "pa_md5.h"
1.24.2.12.2.1 (paf 19:): #include "pa_threads.h"
1.1 parser 20:
1.5 parser 21: #ifdef WIN32
1.24.2.12.2.1 (paf 22:): # define _WIN32_WINNT 0x400
1.5 parser 23: # include <windows.h>
1.24.2.12.2.1 (paf 24:): # include <wincrypt.h>
1.5 parser 25: #endif
26:
1.24.2.12 paf 27: #ifdef HAVE_CRYPT
28: # ifdef HAVE_CRYPT_H
29: # include <crypt.h>
30: # endif
31: #else
1.24.2.12.2.3 (paf 32:: extern char *crypt(const char* , const char* );
1.20 paf 33: #endif
34:
1.1 parser 35: // defines
36:
1.20 paf 37: #define MAX_SALT 8
1.1 parser 38:
39: // class
40:
1.24.2.8 paf 41: class MMath: public Methoded {
1.1 parser 42: public:
1.24.2.6 paf 43: MMath();
1.5 parser 44:
1.1 parser 45: public: // Methoded
1.15 paf 46: bool used_directly() { return false; }
1.1 parser 47: };
48:
1.24.2.6 paf 49: // global variables
50:
1.24.2.10 paf 51: DECLARE_CLASS_VAR(math, 0 /*fictive*/, new MMath);
1.24.2.6 paf 52:
1.24.2.12.2.1 (paf 53:): #ifdef WIN32
54:): class Random_provider {
55:): HCRYPTPROV fhProv;
56:):
57:): void acquire() {
58:): SYNCHRONIZED;
59:):
60:): if(fhProv)
61:): return;
62:):
63:): if(!CryptAcquireContext(&fhProv, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT))
64:): throw Exception(0,
65:): 0,
66:): "CryptAcquireContext failed");
67:): }
68:): void release() {
69:): if(fhProv)
70:): CryptReleaseContext(fhProv, 0);
71:): }
72:):
73:): public:
74:): Random_provider(): fhProv(0) {}
75:): ~Random_provider() { release(); }
76:): void generate(void *buffer, size_t size) {
77:): acquire();
78:):
79:): if(!CryptGenRandom(fhProv, size, (BYTE*)buffer))
80:): throw Exception(0,
81:): 0,
82:): "CryptGenRandom failed");
83:): }
84:): }
85:): random_provider;
86:):
87:): #else
88:):
89:): /// from gen_uuid.c
90:): static int get_random_fd(void)
91:): {
92:): struct timeval tv;
93:): static int fd = -2;
94:): int i;
95:):
96:): if (fd == -2) {
97:): gettimeofday(&tv, 0);
98:): fd = open("/dev/urandom", O_RDONLY);
99:): if (fd == -1)
100:): fd = open("/dev/random", O_RDONLY | O_NONBLOCK);
101:): srand((getpid() << 16) ^ getuid() ^ tv.tv_sec ^ tv.tv_usec);
102:): }
103:): /* Crank the random number generator a few times */
104:): gettimeofday(&tv, 0);
105:): for (i = (tv.tv_sec ^ tv.tv_usec) & 0x1F; i > 0; i--)
106:): rand();
107:): return fd;
108:): }
109:):
110:):
111:): /*
112:): * Generate a series of random bytes. Use /dev/urandom if possible,
113:): * and if not, use srandom/random.
114:): */
115:): static void get_random_bytes(void *buf, int nbytes)
116:): {
117:): int i, fd = get_random_fd();
118:): int lose_counter = 0;
119:): char *cp = (char *) buf;
120:):
121:): if (fd >= 0) {
122:): while (nbytes > 0) {
123:): i = read(fd, cp, nbytes);
124:): if (i <= 0) {
125:): if (lose_counter++ > 16)
126:): break;
127:): continue;
128:): }
129:): nbytes -= i;
130:): cp += i;
131:): lose_counter = 0;
132:): }
133:): }
134:):
135:): /* XXX put something better here if no /dev/random! */
136:): for (i = 0; i < nbytes; i++)
137:): *cp++ = rand() & 0xFF;
138:): return;
139:): }
140:):
141:):
142:): #endif
143:):
144:):
145:): // helpers
146:):
147:): static void random(void *buffer, size_t size) {
148:): #ifdef WIN32
149:): random_provider.generate(buffer, size);
150:): #else
151:): get_random_bytes(buffer, size);
152:): #endif
153:): }
154:):
155:):
1.1 parser 156: // methods
1.24.2.12.2.1 (paf 157:):
158:): #define MAX_UINT 0xFFFFFFFFu
159:):
1.20 paf 160: static inline int _random(uint top) {
1.24.2.12.2.1 (paf 161:): uint raw;
162:): random(&raw, sizeof(raw));
163:): return int(double(raw) / MAX_UINT * top );
1.20 paf 164: }
1.24.2.12.2.1 (paf 165:):
1.24.2.12.2.9 (paf 166:: static void _random(Request& r, MethodParams& params) {
167:: Value& range=params.as_junction(0, "range must be expression");
1.24.2.12.2.6 (paf 168:: double top=r.process_to_value(range).as_double();
1.24.2.12.2.1 (paf 169:): if(top<=0 || top>MAX_UINT)
1.16 paf 170: throw Exception("parser.runtime",
1.24.2.12.2.6 (paf 171:: 0,
1.24.2.12.2.1 (paf 172:): "top(%g) must be [1..%u]", top, MAX_UINT);
1.1 parser 173:
1.24.2.12.2.6 (paf 174:: r.write_no_lang(*new VInt(_random(uint(top))));
1.1 parser 175: }
176:
177:
1.20 paf 178: typedef double(*math1_func_ptr)(double);
1.3 parser 179: static double frac(double param) { return param-trunc(param); }
180: static double degrees(double param) { return param /PI *180; }
181: static double radians(double param) { return param /180 *PI; }
1.1 parser 182:
1.24.2.12.2.9 (paf 183:: static void math1(Request& r, MethodParams& params, math1_func_ptr func) {
184:: Value& param=params.as_junction(0, "parameter must be expression");
1.1 parser 185:
1.24.2.12.2.6 (paf 186:: double result=func(r.process_to_value(param).as_double());
187:: r.write_no_lang(*new VDouble(result));
1.1 parser 188: }
189:
190: #define MATH1(name) \
1.24.2.12.2.9 (paf 191:: static void _##name(Request& r, MethodParams& params) {\
1.24.2.12.2.6 (paf 192:: math1(r, params, &name);\
1.1 parser 193: }
194: #define MATH1P(name_parser, name_c) \
1.24.2.12.2.9 (paf 195:: static void _##name_parser(Request& r, MethodParams& params) {\
1.24.2.12.2.6 (paf 196:: math1(r, params, &name_c);\
1.1 parser 197: }
198: MATH1(round); MATH1(floor); MATH1P(ceiling, ceil);
1.3 parser 199: MATH1(trunc); MATH1(frac);
1.1 parser 200: MATH1P(abs, fabs); MATH1(sign);
201: MATH1(exp); MATH1(log);
202: MATH1(sin); MATH1(asin);
203: MATH1(cos); MATH1(acos);
204: MATH1(tan); MATH1(atan);
1.3 parser 205: MATH1(degrees); MATH1(radians);
1.1 parser 206: MATH1(sqrt);
207:
208:
209: typedef double (*math2_func_ptr)(double, double);
1.24.2.12.2.9 (paf 210:: static void math2(Request& r, MethodParams& params, math2_func_ptr func) {
211:: Value& a=params.as_junction(0, "parameter must be expression");
212:: Value& b=params.as_junction(1, "parameter must be expression");
1.1 parser 213:
1.24.2.6 paf 214: double result=func(
1.24.2.12.2.6 (paf 215:: r.process_to_value(a).as_double(),
216:: r.process_to_value(b).as_double());
217:: r.write_no_lang(*new VDouble(result));
1.1 parser 218: }
219:
220: #define MATH2(name) \
1.24.2.12.2.9 (paf 221:: static void _##name(Request& r, MethodParams& params) {\
1.24.2.12.2.6 (paf 222:: math2(r, params, &name);\
1.1 parser 223: }
224: MATH2(pow);
225:
1.20 paf 226: inline bool is_salt_body_char(int c) {
227: return isalnum(c) || c == '.' || c=='/';
228: }
1.24.2.2 paf 229: static size_t calc_prefix_size(const char* salt) {
1.20 paf 230: if(size_t salt_size=strlen(salt)) {
231: if(!is_salt_body_char(salt[0])) { // $... {...
1.24.2.2 paf 232: const char* cur=salt+1; // skip
1.20 paf 233: while(is_salt_body_char(*cur++)) // ...$ ...}
234: ;
235: return cur-salt;
236: } else
237: return 0;
238: } else
239: return 0;
240: }
1.24.2.12.2.9 (paf 241:: static void _crypt(Request& r, MethodParams& params) {
242:: const char* password=params.as_string(0, "password must be string").cstr();
243:: const char* maybe_bodyless_salt=params.as_string(1, "salt must be string").cstr();
1.20 paf 244:
245: size_t prefix_size=calc_prefix_size(maybe_bodyless_salt);
1.24.2.2 paf 246: const char* normal_salt;
1.20 paf 247: char normalize_buf[MAX_STRING];
248: if(prefix_size==strlen(maybe_bodyless_salt)) { // bodyless?
249: strncpy(normalize_buf, maybe_bodyless_salt, MAX_STRING-MAX_SALT-1);
250: char *cur=normalize_buf+strlen(normalize_buf);
251: // sould add up MAX_SALT random chars
252: static unsigned char itoa64[] = /* 0 ... 63 => ASCII - 64 */
253: "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
254: for(int i=0; i<MAX_SALT; i++)
255: *cur++=itoa64[_random(64)];
256: *cur=0;
257: normal_salt=normalize_buf;
258: } else
259: normal_salt=maybe_bodyless_salt;
1.19 paf 260:
261: /* FreeBSD style MD5 string
262: */
1.20 paf 263: if(strncmp(normal_salt, PA_MD5PW_ID, PA_MD5PW_IDLEN) == 0) {
1.19 paf 264: const size_t sample_size=120;
1.24.2.12.2.7 (paf 265:: char *sample_buf=new(PointerFreeGC) char[sample_size];
1.24.2.12.2.1 (paf 266:): pa_MD5Encode((const unsigned char *)password,
1.20 paf 267: (const unsigned char *)normal_salt, sample_buf, sample_size);
1.24.2.6 paf 268: String sample(sample_buf);
269: r.write_pass_lang(sample);
1.20 paf 270: } else {
271: #ifdef HAVE_CRYPT
1.24.2.6 paf 272: const char* static_sample_buf=crypt(password, normal_salt);
273: if(!static_sample_buf // nothing generated
274: || !static_sample_buf[0] // generated nothing
275: || strncmp(static_sample_buf, normal_salt, prefix_size)!=0) // salt prefix not preserved
1.20 paf 276: throw Exception("parser.runtime",
1.24.2.12.2.8 (paf 277:: 0,
278:: "crypt on this platform does not support '%.*s' salt prefix", prefix_size, normal_salt);
1.20 paf 279:
1.24.2.12.2.8 (paf 280:: r.write_pass_lang(String(pa_strdup(static_sample_buf)));
1.20 paf 281: #else
1.19 paf 282: throw Exception("parser.runtime",
1.24.2.12.2.6 (paf 283:: 0,
1.19 paf 284: "salt must start with '" PA_MD5PW_ID "'");
1.20 paf 285: #endif
286: }
1.19 paf 287: }
288:
1.24.2.12.2.1 (paf 289:): static const char* hex_string(unsigned char* bytes, size_t size, bool upcase) {
290:): char *bytes_hex=new(PointerFreeGC) char [size*2/*byte->hh*/+1/*for zero-teminator*/];
291:): unsigned char *src=bytes;
292:): unsigned char *end=bytes+size;
293:): char *dest=bytes_hex;
294:):
295:): static const char *hex=upcase?"0123456789ABCDEF":"0123456789abcdef";
296:):
297:): const char *format=upcase?"%02X":"%02x";
298:): for(; src<end; src++) {
299:): *dest++=hex[*src/0x10];
300:): *dest++=hex[*src%0x10];
301:): }
302:): *dest=0;
303:):
304:): return bytes_hex;
305:): }
306:):
307:): static void _md5(Request& r, MethodParams& params) {
308:): const char *string=params.as_string(0, "parameter must be string").cstr();
309:):
310:):
311:): PA_MD5_CTX context;
312:): unsigned char digest[16];
313:): pa_MD5Init(&context);
314:): pa_MD5Update(&context, (const unsigned char*)string, strlen(string));
315:): pa_MD5Final(digest, &context);
316:):
317:): r.write_pass_lang(*new String(hex_string(digest, sizeof(digest), false)));
318:): }
319:):
320:): /// to hell with extra bytes on 64bit platforms
321:): struct uuid {
322:): unsigned int time_low;
323:): unsigned short time_mid;
324:): unsigned short time_hi_and_version;
325:): unsigned short clock_seq;
326:): unsigned char node[6];
327:): };
328:): static void _uuid(Request& r, MethodParams& /*params*/) {
329:):
330:): // random
331:): struct uuid uuid;
332:): random(&uuid, sizeof(uuid));
333:):
334:): // http://www.opengroup.org/onlinepubs/9629399/apdxa.htm#tagtcjh_35
335:): // ~
336:): // version = DCE Security version, with embedded POSIX UIDs.
337:): // variant = DCE
338:): //
339:): // DCE=Distributed Computing Environment
340:): // http://www.opengroup.org/dce/
341:): //
342:): // they say this influences comparison&such,
343:): // but could not figure out how, hence structure layout specified strictly
344:): // anyhow, uuidgen on Win32 yield those values
345:): //
346:): // xxxxxxxx-xxxx-4xxx-{8,9,A,B}xxx-xxxxxxxxxxxx
347:): uuid.clock_seq = (uuid.clock_seq & 0x3FFF) | 0x8000;
348:): uuid.time_hi_and_version = (uuid.time_hi_and_version & 0x0FFF) | 0x4000;
349:):
350:): // format
351:): const int uuid_cstr_bufsize=36+1/*for zero-teminator*/+1/*for faulty snprintfs*/;
352:): char *uuid_cstr=new(PointerFreeGC) char[uuid_cstr_bufsize];
353:): snprintf(uuid_cstr, uuid_cstr_bufsize,
354:): "%08X-%04X-%04X-%02X%02X-%02X%02X%02X%02X%02X%02X",
355:): uuid.time_low, uuid.time_mid, uuid.time_hi_and_version,
356:): uuid.clock_seq >> 8, uuid.clock_seq & 0xFF,
357:): uuid.node[0], uuid.node[1], uuid.node[2],
358:): uuid.node[3], uuid.node[4], uuid.node[5]);
359:):
360:): r.write_pass_lang(*new String(uuid_cstr));
361:): }
362:):
363:): static void _uid64(Request& r, MethodParams& /*params*/) {
364:):
365:): unsigned char id[64/8];
366:): random(&id, sizeof(id));
367:):
368:): r.write_pass_lang(*new String(hex_string(id, sizeof(id), true)));
369:): }
370:):
1.1 parser 371: // constructor
372:
1.24.2.6 paf 373: MMath::MMath(): Methoded("math") {
1.1 parser 374: // ^FUNC(expr)
1.24.2.12.2.1 (paf 375:): #define ADDX(name, X) \
376:): add_native_method(#name, Method::CT_STATIC, _##name, X, X)
377:): #define ADD0(name) ADDX(name, 0)
378:): #define ADD1(name) ADDX(name, 1)
379:): #define ADD2(name) ADDX(name, 2)
1.1 parser 380:
381: ADD1(round); ADD1(floor); ADD1(ceiling);
1.3 parser 382: ADD1(trunc); ADD1(frac);
1.1 parser 383: ADD1(abs); ADD1(sign);
384: ADD1(exp); ADD1(log);
385: ADD1(sin); ADD1(asin);
386: ADD1(cos); ADD1(acos);
387: ADD1(tan); ADD1(atan);
1.3 parser 388: ADD1(degrees); ADD1(radians);
1.1 parser 389: ADD1(sqrt);
1.3 parser 390: ADD1(random);
1.1 parser 391:
392: // ^pow(x;y)
393: ADD2(pow);
394:
1.19 paf 395: // ^crypt[password;salt]
396: ADD2(crypt);
1.5 parser 397:
1.24.2.12.2.1 (paf 398:): // ^md5[string]
399:): ADD1(md5);
400:):
401:): // ^uuid[]
402:): ADD0(uuid);
403:):
404:): // ^uid64[]
405:): ADD0(uid64);
1.1 parser 406: }
E-mail:
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to math.C CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / classes