|
|
| version 1.24.2.12.2.11, 2003/04/04 09:41:54 | version 1.39.8.2, 2005/08/26 11:08:30 |
|---|---|
| Line 1 | Line 1 |
| /** @file | /** @file |
| Parser: @b math parser class. | Parser: @b math parser class. |
| Copyright(c) 2001-2003 ArtLebedev Group(http://www.artlebedev.com) | Copyright(c) 2001-2005 ArtLebedev Group(http://www.artlebedev.com) |
| Author: Alexandr Petrosian <paf@design.ru>(http://paf.design.ru) | Author: Alexandr Petrosian <paf@design.ru>(http://paf.design.ru) |
| portions from gen_uuid.c, | |
| Copyright (C) 1996, 1997, 1998, 1999 Theodore Ts'o. | |
| */ | */ |
| static const char* IDENT_MATH_C="$Date$"; | static const char * const IDENT_MATH_C="$Date$"; |
| #include "pa_vmethod_frame.h" | #include "pa_vmethod_frame.h" |
| #include "pa_common.h" | #include "pa_common.h" |
| #include "pa_vint.h" | #include "pa_vint.h" |
| #include "pa_vmath.h" | #include "pa_vmath.h" |
| #include "pa_request.h" | #include "pa_request.h" |
| #include "pa_md5.h" | #include "pa_md5.h" |
| #include "pa_threads.h" | |
| #ifdef WIN32 | #ifdef WIN32 |
| // for threadID | # define _WIN32_WINNT 0x400 |
| # include <windows.h> | # include <windows.h> |
| # include <wincrypt.h> | |
| #endif | #endif |
| #ifdef HAVE_CRYPT | #ifdef HAVE_CRYPT |
| Line 37 static const char* IDENT_MATH_C="$Date$" | Line 41 static const char* IDENT_MATH_C="$Date$" |
| class MMath: public Methoded { | class MMath: public Methoded { |
| public: | public: |
| MMath(); | MMath(); |
| void configure_admin(Request& r); | |
| public: // Methoded | public: // Methoded |
| bool used_directly() { return false; } | bool used_directly() { return false; } |
| Line 47 public: // Methoded | Line 50 public: // Methoded |
| DECLARE_CLASS_VAR(math, 0 /*fictive*/, new MMath); | DECLARE_CLASS_VAR(math, 0 /*fictive*/, new MMath); |
| #ifdef WIN32 | |
| class Random_provider { | |
| HCRYPTPROV fhProv; | |
| void acquire() { | |
| SYNCHRONIZED; | |
| if(fhProv) | |
| return; | |
| if(!CryptAcquireContext(&fhProv, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT)) | |
| throw Exception(0, | |
| 0, | |
| "CryptAcquireContext failed"); | |
| } | |
| void release() { | |
| if(fhProv) | |
| CryptReleaseContext(fhProv, 0); | |
| } | |
| public: | |
| Random_provider(): fhProv(0) {} | |
| ~Random_provider() { release(); } | |
| void generate(void *buffer, size_t size) { | |
| acquire(); | |
| if(!CryptGenRandom(fhProv, size, (BYTE*)buffer)) | |
| throw Exception(0, | |
| 0, | |
| "CryptGenRandom failed"); | |
| } | |
| } | |
| random_provider; | |
| #else | |
| /// from gen_uuid.c | |
| static int get_random_fd(void) | |
| { | |
| struct timeval tv; | |
| static int fd = -2; | |
| int i; | |
| if (fd == -2) { | |
| gettimeofday(&tv, 0); | |
| fd = open("/dev/urandom", O_RDONLY); | |
| if (fd == -1) | |
| fd = open("/dev/random", O_RDONLY | O_NONBLOCK); | |
| srand((getpid() << 16) ^ getuid() ^ tv.tv_sec ^ tv.tv_usec); | |
| } | |
| /* Crank the random number generator a few times */ | |
| gettimeofday(&tv, 0); | |
| for (i = (tv.tv_sec ^ tv.tv_usec) & 0x1F; i > 0; i--) | |
| rand(); | |
| return fd; | |
| } | |
| /* | |
| * Generate a series of random bytes. Use /dev/urandom if possible, | |
| * and if not, use srandom/random. | |
| */ | |
| static void get_random_bytes(void *buf, int nbytes) | |
| { | |
| int i, fd = get_random_fd(); | |
| int lose_counter = 0; | |
| char *cp = (char *) buf; | |
| if (fd >= 0) { | |
| while (nbytes > 0) { | |
| i = read(fd, cp, nbytes); | |
| if (i <= 0) { | |
| if (lose_counter++ > 16) | |
| break; | |
| continue; | |
| } | |
| nbytes -= i; | |
| cp += i; | |
| lose_counter = 0; | |
| } | |
| } | |
| /* XXX put something better here if no /dev/random! */ | |
| for (i = 0; i < nbytes; i++) | |
| *cp++ = rand() & 0xFF; | |
| return; | |
| } | |
| #endif | |
| // helpers | |
| static void random(void *buffer, size_t size) { | |
| #ifdef WIN32 | |
| random_provider.generate(buffer, size); | |
| #else | |
| get_random_bytes(buffer, size); | |
| #endif | |
| } | |
| // methods | // methods |
| static unsigned int randomizer=0; | |
| #define MAX_UINT 0xFFFFFFFFu | |
| static inline int _random(uint top) { | static inline int _random(uint top) { |
| return (int)(((double)((randomizer=rand())% RAND_MAX)) / RAND_MAX * top ); | uint raw; |
| random(&raw, sizeof(raw)); | |
| return int(double(raw) / MAX_UINT * top ); | |
| } | } |
| #define MAX_UINT 0xFFFFFFFFu | |
| static void _random(Request& r, MethodParams& params) { | static void _random(Request& r, MethodParams& params) { |
| Value& range=params.as_junction(0, "range must be expression"); | double top=params.as_double(0, "range must be expression", r); |
| double top=r.process_to_value(range).as_double(); | |
| if(top<=0 || top>MAX_UINT) | if(top<=0 || top>MAX_UINT) |
| throw Exception("parser.runtime", | throw Exception("parser.runtime", |
| 0, | 0, |
| Line 71 static double degrees(double param) { re | Line 180 static double degrees(double param) { re |
| static double radians(double param) { return param /180 *PI; } | static double radians(double param) { return param /180 *PI; } |
| static void math1(Request& r, MethodParams& params, math1_func_ptr func) { | static void math1(Request& r, MethodParams& params, math1_func_ptr func) { |
| Value& param=params.as_junction(0, "parameter must be expression"); | double param=params.as_double(0, "parameter must be expression", r); |
| double result=func(param); | |
| double result=func(r.process_to_value(param).as_double()); | |
| r.write_no_lang(*new VDouble(result)); | r.write_no_lang(*new VDouble(result)); |
| } | } |
| Line 98 MATH1(sqrt); | Line 206 MATH1(sqrt); |
| typedef double (*math2_func_ptr)(double, double); | typedef double (*math2_func_ptr)(double, double); |
| static void math2(Request& r, MethodParams& params, math2_func_ptr func) { | static void math2(Request& r, MethodParams& params, math2_func_ptr func) { |
| Value& a=params.as_junction(0, "parameter must be expression"); | double a=params.as_double(0, "parameter must be expression", r); |
| Value& b=params.as_junction(1, "parameter must be expression"); | double b=params.as_double(1, "parameter must be expression", r); |
| double result=func(a, b); | |
| double result=func( | |
| r.process_to_value(a).as_double(), | |
| r.process_to_value(b).as_double()); | |
| r.write_no_lang(*new VDouble(result)); | r.write_no_lang(*new VDouble(result)); |
| } | } |
| Line 117 inline bool is_salt_body_char(int c) { | Line 222 inline bool is_salt_body_char(int c) { |
| return isalnum(c) || c == '.' || c=='/'; | return isalnum(c) || c == '.' || c=='/'; |
| } | } |
| static size_t calc_prefix_size(const char* salt) { | static size_t calc_prefix_size(const char* salt) { |
| if(size_t salt_size=strlen(salt)) { | if(strlen(salt)) { |
| if(!is_salt_body_char(salt[0])) { // $... {... | if(!is_salt_body_char((unsigned char)salt[0])) { // $... {... |
| const char* cur=salt+1; // skip | const char* cur=salt+1; // skip |
| while(is_salt_body_char(*cur++)) // ...$ ...} | while(is_salt_body_char((unsigned char)*cur++)) // ...$ ...} |
| ; | ; |
| return cur-salt; | return cur-salt; |
| } else | } else |
| Line 176 static void _crypt(Request& r, MethodPar | Line 281 static void _crypt(Request& r, MethodPar |
| } | } |
| } | } |
| static const char* hex_string(unsigned char* bytes, size_t size, bool upcase) { | |
| char *bytes_hex=new(PointerFreeGC) char [size*2/*byte->hh*/+1/*for zero-teminator*/]; | |
| unsigned char *src=bytes; | |
| unsigned char *end=bytes+size; | |
| char *dest=bytes_hex; | |
| static const char *hex=upcase?"0123456789ABCDEF":"0123456789abcdef"; | |
| for(; src<end; src++) { | |
| *dest++=hex[*src/0x10]; | |
| *dest++=hex[*src%0x10]; | |
| } | |
| *dest=0; | |
| return bytes_hex; | |
| } | |
| static void _md5(Request& r, MethodParams& params) { | |
| const char *string=params.as_string(0, "parameter must be string").cstr(); | |
| PA_MD5_CTX context; | |
| unsigned char digest[16]; | |
| pa_MD5Init(&context); | |
| pa_MD5Update(&context, (const unsigned char*)string, strlen(string)); | |
| pa_MD5Final(digest, &context); | |
| r.write_pass_lang(*new String(hex_string(digest, sizeof(digest), false))); | |
| } | |
| /// to hell with extra bytes on 64bit platforms | |
| struct uuid { | |
| unsigned int time_low; | |
| unsigned short time_mid; | |
| unsigned short time_hi_and_version; | |
| unsigned short clock_seq; | |
| unsigned char node[6]; | |
| }; | |
| static void _uuid(Request& r, MethodParams& /*params*/) { | |
| // random | |
| struct uuid uuid; | |
| random(&uuid, sizeof(uuid)); | |
| // http://www.opengroup.org/onlinepubs/9629399/apdxa.htm#tagtcjh_35 | |
| // ~ | |
| // version = DCE Security version, with embedded POSIX UIDs. | |
| // variant = DCE | |
| // | |
| // DCE=Distributed Computing Environment | |
| // http://www.opengroup.org/dce/ | |
| // | |
| // they say this influences comparison&such, | |
| // but could not figure out how, hence structure layout specified strictly | |
| // anyhow, uuidgen on Win32 yield those values | |
| // | |
| // xxxxxxxx-xxxx-4xxx-{8,9,A,B}xxx-xxxxxxxxxxxx | |
| uuid.clock_seq = (uuid.clock_seq & 0x3FFF) | 0x8000; | |
| uuid.time_hi_and_version = (uuid.time_hi_and_version & 0x0FFF) | 0x4000; | |
| // format | |
| const int uuid_cstr_bufsize=36+1/*for zero-teminator*/+1/*for faulty snprintfs*/; | |
| char *uuid_cstr=new(PointerFreeGC) char[uuid_cstr_bufsize]; | |
| snprintf(uuid_cstr, uuid_cstr_bufsize, | |
| "%08X-%04X-%04X-%02X%02X-%02X%02X%02X%02X%02X%02X", | |
| uuid.time_low, uuid.time_mid, uuid.time_hi_and_version, | |
| uuid.clock_seq >> 8, uuid.clock_seq & 0xFF, | |
| uuid.node[0], uuid.node[1], uuid.node[2], | |
| uuid.node[3], uuid.node[4], uuid.node[5]); | |
| r.write_pass_lang(*new String(uuid_cstr)); | |
| } | |
| static void _uid64(Request& r, MethodParams& /*params*/) { | |
| unsigned char id[64/8]; | |
| random(&id, sizeof(id)); | |
| r.write_pass_lang(*new String(hex_string(id, sizeof(id), true))); | |
| } | |
| // constructor | // constructor |
| MMath::MMath(): Methoded("math") { | MMath::MMath(): Methoded("math") { |
| // ^FUNC(expr) | // ^FUNC(expr) |
| #define ADD1(name) \ | #define ADDX(name, X) \ |
| add_native_method(#name, Method::CT_STATIC, _##name, 1, 1) | add_native_method(#name, Method::CT_STATIC, _##name, X, X) |
| #define ADD0(name) ADDX(name, 0) | |
| #define ADD1(name) ADDX(name, 1) | |
| #define ADD2(name) ADDX(name, 2) | |
| ADD1(round); ADD1(floor); ADD1(ceiling); | ADD1(round); ADD1(floor); ADD1(ceiling); |
| ADD1(trunc); ADD1(frac); | ADD1(trunc); ADD1(frac); |
| Line 194 MMath::MMath(): Methoded("math") { | Line 383 MMath::MMath(): Methoded("math") { |
| ADD1(sqrt); | ADD1(sqrt); |
| ADD1(random); | ADD1(random); |
| #define ADD2(name) \ | |
| add_native_method(#name, Method::CT_STATIC, _##name, 2, 2) | |
| // ^pow(x;y) | // ^pow(x;y) |
| ADD2(pow); | ADD2(pow); |
| // ^crypt[password;salt] | // ^crypt[password;salt] |
| ADD2(crypt); | ADD2(crypt); |
| } | |
| // in MSVC each thread has it's own pseudo-random sequence | // ^md5[string] |
| // in win32 apache each thread can handle multiple requests | ADD1(md5); |
| // so to get proper randoms we remember random generated in one thread | |
| void MMath::configure_admin(Request&) { | // ^uuid[] |
| // setting seed | ADD0(uuid); |
| srand( | |
| randomizer | // ^uid64[] |
| #ifdef WIN32 | ADD0(uid64); |
| ^ GetCurrentThreadId() | |
| #else | |
| ^ getpid() | |
| #endif | |
| ^(unsigned int)time(NULL) | |
| ); | |
| if(!randomizer) | |
| randomizer=rand(); | |
| } | } |