|
|
| version 1.30, 2003/04/15 14:30:14 | version 1.61, 2012/05/28 10:33:18 |
|---|---|
| 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-2012 Art. Lebedev Studio (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, | portions from gen_uuid.c, |
| Copyright (C) 1996, 1997, 1998, 1999 Theodore Ts'o. | Copyright (C) 1996, 1997, 1998, 1999 Theodore Ts'o. |
| */ | */ |
| static const char* IDENT_MATH_C="$Date$"; | #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" | #include "pa_random.h" |
| #ifdef WIN32 | #ifdef WIN32 |
| # define _WIN32_WINNT 0x400 | # define _WIN32_WINNT 0x400 |
| Line 23 static const char* IDENT_MATH_C="$Date$" | Line 22 static const char* IDENT_MATH_C="$Date$" |
| # include <wincrypt.h> | # include <wincrypt.h> |
| #endif | #endif |
| #ifdef HAVE_CRYPT_H | #ifdef HAVE_CRYPT |
| #include <crypt.h> | # ifdef HAVE_CRYPT_H |
| # include <crypt.h> | |
| # endif | |
| #else | |
| extern char *crypt(const char* , const char* ); | |
| #endif | #endif |
| volatile const char * IDENT_MATH_C="$Id$"; | |
| // defines | // defines |
| #define PI 3.1415926535 | |
| #define MAX_SALT 8 | #define MAX_SALT 8 |
| // class | // class |
| class MMath : public Methoded { | class MMath: public Methoded { |
| public: | public: |
| MMath(Pool& pool); | MMath(); |
| public: // Methoded | public: // Methoded |
| bool used_directly() { return false; } | bool used_directly() { return false; } |
| }; | }; |
| #ifdef WIN32 | // global variables |
| 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) { | DECLARE_CLASS_VAR(math, 0 /*fictive*/, new MMath); |
| #ifdef WIN32 | |
| random_provider.generate(buffer, size); | |
| #else | |
| get_random_bytes(buffer, size); | |
| #endif | |
| } | |
| // methods | // methods |
| static inline int _random(uint top) { | |
| uint raw; | static void _random(Request& r, MethodParams& params) { |
| random(&raw, sizeof(raw)); | double top=params.as_double(0, "range must be expression", r); |
| return int(double(raw) / 0x100000000 * top ); | if(top<=0 || top>MAX_UINT) |
| } | throw Exception(PARSER_RUNTIME, |
| static void _random(Request& r, const String& method_name, MethodParams *params) { | 0, |
| Pool& pool=r.pool(); | "top(%g) must be [1..%u]", top, MAX_UINT); |
| Value& range=params->as_junction(0, "range must be expression"); | |
| double top=r.process_to_value(range).as_double(); | |
| if(top<=0) | |
| throw Exception("parser.runtime", | |
| &method_name, | |
| "top must be above 0(%g)", top); | |
| r.write_no_lang(*new(pool) VInt(pool, _random(uint(top)))); | r.write_no_lang(*new VInt(_random(uint(top)))); |
| } | } |
| Line 169 static double frac(double param) { retur | Line 68 static double frac(double param) { retur |
| static double degrees(double param) { return param /PI *180; } | static double degrees(double param) { return param /PI *180; } |
| static double radians(double param) { return param /180 *PI; } | static double radians(double param) { return param /180 *PI; } |
| static void math1(Request& r, | static void math1(Request& r, MethodParams& params, math1_func_ptr func) { |
| const String& method_name, MethodParams *params, | double param=params.as_double(0, "parameter must be expression", r); |
| math1_func_ptr func) { | double result=func(param); |
| Pool& pool=r.pool(); | r.write_no_lang(*new VDouble(result)); |
| Value& param=params->as_junction(0, "parameter must be expression"); | |
| double result=(*func)(r.process_to_value(param).as_double()); | |
| r.write_no_lang(*new(pool) VDouble(pool, result)); | |
| } | } |
| #define MATH1(name) \ | #define MATH1(name) \ |
| static void _##name(Request& r, const String& method_name, MethodParams *params) {\ | static void _##name(Request& r, MethodParams& params) {\ |
| math1(r, method_name, params, &name);\ | math1(r, params, &name);\ |
| } | } |
| #define MATH1P(name_parser, name_c) \ | #define MATH1P(name_parser, name_c) \ |
| static void _##name_parser(Request& r, const String& method_name, MethodParams *params) {\ | static void _##name_parser(Request& r, MethodParams& params) {\ |
| math1(r, method_name, params, &name_c);\ | math1(r, params, &name_c);\ |
| } | } |
| MATH1(round); MATH1(floor); MATH1P(ceiling, ceil); | MATH1(round); MATH1(floor); MATH1P(ceiling, ceil); |
| MATH1(trunc); MATH1(frac); | MATH1(trunc); MATH1(frac); |
| MATH1P(abs, fabs); MATH1(sign); | MATH1P(abs, fabs); MATH1(sign); |
| MATH1(exp); MATH1(log); | MATH1(exp); |
| MATH1(log); MATH1(log10); | |
| MATH1(sin); MATH1(asin); | MATH1(sin); MATH1(asin); |
| MATH1(cos); MATH1(acos); | MATH1(cos); MATH1(acos); |
| MATH1(tan); MATH1(atan); | MATH1(tan); MATH1(atan); |
| Line 199 MATH1(sqrt); | Line 95 MATH1(sqrt); |
| typedef double (*math2_func_ptr)(double, double); | typedef double (*math2_func_ptr)(double, double); |
| static void math2(Request& r, | static void math2(Request& r, MethodParams& params, math2_func_ptr func) { |
| const String& method_name, MethodParams *params, | double a=params.as_double(0, "parameter must be expression", r); |
| math2_func_ptr func) { | double b=params.as_double(1, "parameter must be expression", r); |
| Pool& pool=r.pool(); | double result=func(a, b); |
| Value& a=params->as_junction(0, "parameter must be expression"); | r.write_no_lang(*new VDouble(result)); |
| Value& b=params->as_junction(1, "parameter must be expression"); | |
| double result=(*func)( | |
| r.process_to_value(a).as_double(), | |
| r.process_to_value(b).as_double()); | |
| r.write_no_lang(*new(pool) VDouble(pool, result)); | |
| } | } |
| #define MATH2(name) \ | #define MATH2(name) \ |
| static void _##name(Request& r, const String& method_name, MethodParams *params) {\ | static void _##name(Request& r, MethodParams& params) {\ |
| math2(r, method_name, params, &name);\ | math2(r, params, &name);\ |
| } | } |
| MATH2(pow); | MATH2(pow); |
| inline bool is_salt_body_char(int c) { | 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 233 static size_t calc_prefix_size(const cha | Line 123 static size_t calc_prefix_size(const cha |
| } else | } else |
| return 0; | return 0; |
| } | } |
| static void _crypt(Request& r, const String& method_name, MethodParams *params) { | static void _crypt(Request& r, MethodParams& params) { |
| Pool& pool=r.pool(); | const char* password=params.as_string(0, "password must be string").cstr(); |
| const char *password=params->as_string(0, "password must be string").cstr(); | const char* maybe_bodyless_salt=params.as_string(1, "salt must be string").cstr(); |
| const char *maybe_bodyless_salt=params->as_string(1, "salt must be string").cstr(); | |
| size_t prefix_size=calc_prefix_size(maybe_bodyless_salt); | size_t prefix_size=calc_prefix_size(maybe_bodyless_salt); |
| const char *normal_salt; | const char* normal_salt; |
| char normalize_buf[MAX_STRING]; | char normalize_buf[MAX_STRING]; |
| if(prefix_size==strlen(maybe_bodyless_salt)) { // bodyless? | if(prefix_size==strlen(maybe_bodyless_salt)) { // bodyless? |
| strncpy(normalize_buf, maybe_bodyless_salt, MAX_STRING-MAX_SALT-1); | strncpy(normalize_buf, maybe_bodyless_salt, MAX_STRING-MAX_SALT-1); |
| Line 254 static void _crypt(Request& r, const Str | Line 143 static void _crypt(Request& r, const Str |
| } else | } else |
| normal_salt=maybe_bodyless_salt; | normal_salt=maybe_bodyless_salt; |
| /* FreeBSD style MD5 string | /* FreeBSD style MD5 string |
| */ | */ |
| if(strncmp(normal_salt, PA_MD5PW_ID, PA_MD5PW_IDLEN) == 0) { | if(strncmp(normal_salt, PA_MD5PW_ID, PA_MD5PW_IDLEN) == 0) { |
| const size_t sample_size=120; | const size_t sample_size=120; |
| char *sample_buf=(char *)pool.malloc(sample_size); | char *sample_buf=new(PointerFreeGC) char[sample_size]; |
| PA_MD5Encode((const unsigned char *)password, | pa_MD5Encode((const unsigned char *)password, |
| (const unsigned char *)normal_salt, 1/*TRUE: mix in magic string*/, | (const unsigned char *)normal_salt, sample_buf, sample_size); |
| sample_buf, sample_size); | String sample(sample_buf); |
| r.write_pass_lang(*new(pool) String(pool, sample_buf)); | r.write_pass_lang(sample); |
| } else { | } else { |
| #ifdef HAVE_CRYPT | #ifdef HAVE_CRYPT |
| const char *sample_buf=crypt(password, normal_salt); | const char* static_sample_buf=crypt(password, normal_salt); |
| if(!sample_buf // nothing generated | if(!static_sample_buf // nothing generated |
| || !sample_buf[0] // generated nothing | || !static_sample_buf[0] // generated nothing |
| || strncmp(sample_buf, normal_salt, prefix_size)!=0) // salt prefix not preserved | || strncmp(static_sample_buf, normal_salt, prefix_size)!=0) // salt prefix not preserved |
| throw Exception("parser.runtime", | throw Exception(PARSER_RUNTIME, |
| &method_name, | 0, |
| "on this platform does not support '%.*s' salt prefix", prefix_size, normal_salt); | "crypt on this platform does not support '%.*s' salt prefix", prefix_size, normal_salt); |
| r.write_pass_lang(*new(pool) String(pool, sample_buf)); | r.write_pass_lang(String(pa_strdup(static_sample_buf))); |
| #else | #else |
| throw Exception("parser.runtime", | throw Exception(PARSER_RUNTIME, |
| &method_name, | 0, |
| "salt must start with '" PA_MD5PW_ID "'"); | "salt must start with '" PA_MD5PW_ID "'"); |
| #endif | #endif |
| } | } |
| } | } |
| static const char* hex_string(Pool& pool, unsigned char* bytes, size_t size, bool upcase) { | static void _md5(Request& r, MethodParams& params) { |
| char *bytes_hex=(char *)pool.malloc(size*2/*byte->hh*/+1/*for zero-teminator*/); | const char *string=params.as_string(0, PARAMETER_MUST_BE_STRING).cstr(); |
| unsigned char *src=bytes; | |
| unsigned char *end=bytes+size; | |
| char *dest=bytes_hex; | |
| const char *format=upcase?"%02X":"%02x"; | |
| while(src<end) | |
| dest+=snprintf(dest, 3, format, *src++); | |
| return bytes_hex; | |
| } | |
| static void _md5(Request& r, const String& method_name, MethodParams *params) { | |
| Pool& pool=r.pool(); | |
| const char *string=params->as_string(0, "parameter must be string").cstr(); | |
| PA_MD5_CTX context; | PA_MD5_CTX context; |
| unsigned char digest[16]; | unsigned char digest[16]; |
| PA_MD5Init(&context); | pa_MD5Init(&context); |
| PA_MD5Update(&context, (const unsigned char*)string, strlen(string)); | pa_MD5Update(&context, (const unsigned char*)string, strlen(string)); |
| PA_MD5Final(digest, &context); | pa_MD5Final(digest, &context); |
| r.write_pass_lang(*new(pool) String(pool, | r.write_pass_lang(*new String(hex_string(digest, sizeof(digest), false))); |
| hex_string(pool, digest, sizeof(digest), false))); | |
| } | } |
| /// to hell with extra bytes on 64bit platforms | |
| struct uuid { | //SHA-1: |
| unsigned int time_low; | |
| unsigned short time_mid; | struct SHA1Context { |
| unsigned short time_hi_and_version; | unsigned Message_Digest[5], Length_Low, Length_High; |
| unsigned short clock_seq; | unsigned int Message_Block[64]; |
| unsigned char node[6]; | int Message_Block_Index, Computed, Corrupted; |
| }; | }; |
| static void _uuid(Request& r, const String& method_name, MethodParams *params) { | |
| Pool& pool=r.pool(); | |
| // random | #define SHA1CircularShift(bits,word) ((((word) << (bits)) & 0xFFFFFFFF)|((word) >> (32-(bits)))) |
| struct uuid uuid; | void SHA1ProcessMessageBlock(SHA1Context *); |
| random(&uuid, sizeof(uuid)); | void SHA1PadMessage(SHA1Context *); |
| void SHA1Reset(SHA1Context *context) { | |
| // http://www.opengroup.org/onlinepubs/9629399/apdxa.htm#tagtcjh_35 | context->Length_Low = context->Length_High = context->Message_Block_Index = 0; |
| // ~ | context->Message_Digest[0] = 0x67452301; |
| // version = DCE Security version, with embedded POSIX UIDs. | context->Message_Digest[1] = 0xEFCDAB89; |
| // variant = DCE | context->Message_Digest[2] = 0x98BADCFE; |
| // | context->Message_Digest[3] = 0x10325476; |
| // DCE=Distributed Computing Environment | context->Message_Digest[4] = 0xC3D2E1F0; |
| // http://www.opengroup.org/dce/ | context->Computed = context->Corrupted = 0; |
| // | } |
| // they say this influences comparison&such, | |
| // but could not figure out how, hence structure layout specified strictly | int SHA1Result(SHA1Context *context) { |
| // anyhow, uuidgen on Win32 yield those values | if (context->Corrupted) |
| // | return 0; |
| // xxxxxxxx-xxxx-4xxx-{8,9,A,B}xxx-xxxxxxxxxxxx | if (!context->Computed) { |
| uuid.clock_seq = (uuid.clock_seq & 0x3FFF) | 0x8000; | SHA1PadMessage(context); |
| uuid.time_hi_and_version = (uuid.time_hi_and_version & 0x0FFF) | 0x4000; | context->Computed = 1; |
| } | |
| // format | return 1; |
| const int uuid_cstr_bufsize=32+1/*for zero-teminator*/; | } |
| char *uuid_cstr=(char *)pool.malloc(uuid_cstr_bufsize); | |
| snprintf(uuid_cstr, uuid_cstr_bufsize, | void SHA1Input(SHA1Context *context, const unsigned char *message_array, unsigned length) { |
| "%08X-%04X-%04X-%02X%02X-%02X%02X%02X%02X%02X%02X", | if (!length) |
| uuid.time_low, uuid.time_mid, uuid.time_hi_and_version, | return; |
| uuid.clock_seq >> 8, uuid.clock_seq & 0xFF, | if (context->Computed || context->Corrupted) { |
| uuid.node[0], uuid.node[1], uuid.node[2], | context->Corrupted = 1; |
| uuid.node[3], uuid.node[4], uuid.node[5]); | return; |
| } | |
| while(length-- && !context->Corrupted) { | |
| context->Message_Block[context->Message_Block_Index++] = (*message_array & 0xFF); | |
| context->Length_Low += 8; | |
| context->Length_Low &= 0xFFFFFFFF; | |
| if (!context->Length_Low && !(context->Length_High=((1+context->Length_High)&0xFFFFFFFF))) | |
| context->Corrupted = 1; // too long message | |
| if (context->Message_Block_Index == 64) | |
| SHA1ProcessMessageBlock(context); | |
| message_array++; | |
| } | |
| } | |
| void SHA1ProcessMessageBlock(SHA1Context *context) { | |
| const unsigned K[] = {0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xCA62C1D6 }; | |
| int t; | |
| unsigned temp, W[80], buf[5]; | |
| unsigned &A=buf[0], &B=buf[1], &C=buf[2], &D=buf[3], &E=buf[4]; | |
| for(t = 0; t < 16; t++) | |
| W[t] = (((unsigned) context->Message_Block[t * 4]) << 24) | (((unsigned) context->Message_Block[t * 4 + 1]) << 16) | (((unsigned) context->Message_Block[t * 4 + 2]) << 8) | ((unsigned) context->Message_Block[t * 4 + 3]); | |
| for(t = 16; t < 80; t++) | |
| W[t] = SHA1CircularShift(1,W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16]); | |
| memcpy (buf, context->Message_Digest, sizeof(buf)); | |
| for(t = 0; t < 20; t++) { | |
| temp = (SHA1CircularShift(5,A) + ((B & C) | ((~B) & D)) + E + W[t] + K[0]) & 0xFFFFFFFF; | |
| E = D; D = C; | |
| C = SHA1CircularShift(30,B); | |
| B = A; A = temp; | |
| } | |
| for(t = 20; t < 40; t++) { | |
| temp = (SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[1]) & 0xFFFFFFFF; | |
| E = D; D = C; | |
| C = SHA1CircularShift(30,B); | |
| B = A; A = temp; | |
| } | |
| for(t = 40; t < 60; t++) { | |
| temp = (SHA1CircularShift(5,A) + ((B & C) | (B & D) | (C & D)) + E + W[t] + K[2]) & 0xFFFFFFFF; | |
| E = D; D = C; | |
| C = SHA1CircularShift(30,B); | |
| B = A; A = temp; | |
| } | |
| for(t = 60; t < 80; t++) { | |
| temp = (SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[3]) & 0xFFFFFFFF; | |
| E = D; D = C; | |
| C = SHA1CircularShift(30,B); | |
| B = A; A = temp; | |
| } | |
| for (t = 0; t < 5; t++) | |
| context->Message_Digest[t] = (context->Message_Digest[t] + buf[t]) & 0xFFFFFFFF; | |
| context->Message_Block_Index = 0; | |
| } | |
| void SHA1PadMessage(SHA1Context *context) { | |
| context->Message_Block[context->Message_Block_Index++] = 0x80; | |
| if (context->Message_Block_Index > 56) { | |
| //was 55, one shift | |
| while(context->Message_Block_Index < 64) | |
| context->Message_Block[context->Message_Block_Index++] = 0; | |
| SHA1ProcessMessageBlock(context); | |
| while(context->Message_Block_Index < 56) | |
| context->Message_Block[context->Message_Block_Index++] = 0; | |
| } else | |
| while(context->Message_Block_Index < 56) | |
| context->Message_Block[context->Message_Block_Index++] = 0; | |
| context->Message_Block[56] = (context->Length_High >> 24) & 0xFF; | |
| context->Message_Block[57] = (context->Length_High >> 16) & 0xFF; | |
| context->Message_Block[58] = (context->Length_High >> 8) & 0xFF; | |
| context->Message_Block[59] = (context->Length_High) & 0xFF; | |
| context->Message_Block[60] = (context->Length_Low >> 24) & 0xFF; | |
| context->Message_Block[61] = (context->Length_Low >> 16) & 0xFF; | |
| context->Message_Block[62] = (context->Length_Low >> 8) & 0xFF; | |
| context->Message_Block[63] = (context->Length_Low) & 0xFF; | |
| SHA1ProcessMessageBlock(context); | |
| } | |
| static void _sha1(Request& r, MethodParams& params) { | |
| const char *string = params.as_string(0, PARAMETER_MUST_BE_STRING).cstr(); | |
| SHA1Context c; | |
| SHA1Reset (&c); | |
| SHA1Input (&c, (const unsigned char*)string, strlen(string)); | |
| if(!SHA1Result(&c)) | |
| throw Exception (PARSER_RUNTIME, 0, "Can not compute SHA1"); | |
| const size_t bufsize=40+1/*zero-teminator*/+1/*for faulty snprintfs*/; | |
| char* cstr=new(PointerFreeGC) char[bufsize]; | |
| snprintf(cstr, bufsize, | |
| "%08x%08x%08x%08x%08x", | |
| c.Message_Digest[0], | |
| c.Message_Digest[1], | |
| c.Message_Digest[2], | |
| c.Message_Digest[3], | |
| c.Message_Digest[4]); | |
| r.write_pass_lang(*new String(cstr)); | |
| } | |
| static void _uuid(Request& r, MethodParams& /*params*/) { | |
| uuid uuid=get_uuid(); | |
| const size_t bufsize=36+1/*zero-teminator*/+1/*for faulty snprintfs*/; | |
| char* cstr=new(PointerFreeGC) char[bufsize]; | |
| snprintf(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(pool) String(pool, uuid_cstr)); | r.write_pass_lang(*new String(cstr)); |
| } | } |
| static void _uid64(Request& r, const String& method_name, MethodParams *params) { | static void _uid64(Request& r, MethodParams& /*params*/) { |
| Pool& pool=r.pool(); | |
| unsigned char id[64/8]; | unsigned char id[64/8]; |
| random(&id, sizeof(id)); | random(&id, sizeof(id)); |
| r.write_pass_lang(*new(pool) String(pool, | r.write_pass_lang(*new String(hex_string(id, sizeof(id), true))); |
| hex_string(pool, id, sizeof(id), true))); | } |
| static void _crc32(Request& r, MethodParams& params) { | |
| const char *string=params.as_string(0, PARAMETER_MUST_BE_STRING).cstr(); | |
| r.write_no_lang(*new VInt(pa_crc32(string, strlen(string)))); | |
| } | |
| static void toBase(unsigned int value, unsigned int base, char*& ptr){ | |
| static const char* hex="0123456789ABCDEF"; | |
| int rest = value % base; | |
| if(value >= base) | |
| toBase( (value-rest)/base, base, ptr); | |
| *ptr++=(char)hex[rest]; | |
| } | |
| static void _convert(Request& r, MethodParams& params) { | |
| const char *str=params.as_string(0, PARAMETER_MUST_BE_STRING).cstr(); | |
| int base_from=params.as_int(1, "base from must be integer", r); | |
| if(base_from < 2 || base_from > 16) | |
| throw Exception(PARSER_RUNTIME, 0, "base from must be an integer from 2 to 16"); | |
| int base_to=params.as_int(2, "base to must be integer", r); | |
| if(base_to < 2 || base_to > 16) | |
| throw Exception(PARSER_RUNTIME, 0, "base to must be an integer from 2 to 16"); | |
| while(isspace(*str)) | |
| str++; | |
| if(!*str) | |
| return; | |
| bool negative=false; | |
| if(str[0]=='-') { | |
| negative=true; | |
| str++; | |
| } else if(str[0]=='+') { | |
| str++; | |
| } | |
| unsigned int value=pa_atoui(str, base_from); | |
| char result_cstr[sizeof(unsigned int)*8+1/*minus for negative number*/+1/*terminator*/]; | |
| char* ptr=result_cstr; | |
| if(negative) | |
| *ptr++='-'; | |
| toBase(value, base_to, ptr); | |
| *ptr=0; | |
| r.write_pass_lang(*new String(pa_strdup(result_cstr))); | |
| } | } |
| // constructor | // constructor |
| MMath::MMath(Pool& apool) : Methoded(apool, "math") { | MMath::MMath(): Methoded("math") { |
| // ^FUNC(expr) | // ^FUNC(expr) |
| #define ADDX(name, X) \ | #define ADDX(name, X) \ |
| add_native_method(#name, Method::CT_STATIC, _##name, X, X) | add_native_method(#name, Method::CT_STATIC, _##name, X, X) |
| Line 376 MMath::MMath(Pool& apool) : Methoded(apo | Line 415 MMath::MMath(Pool& apool) : Methoded(apo |
| ADD1(round); ADD1(floor); ADD1(ceiling); | ADD1(round); ADD1(floor); ADD1(ceiling); |
| ADD1(trunc); ADD1(frac); | ADD1(trunc); ADD1(frac); |
| ADD1(abs); ADD1(sign); | ADD1(abs); ADD1(sign); |
| ADD1(exp); ADD1(log); | ADD1(exp); |
| ADD1(log); ADD1(log10); | |
| ADD1(sin); ADD1(asin); | ADD1(sin); ADD1(asin); |
| ADD1(cos); ADD1(acos); | ADD1(cos); ADD1(acos); |
| ADD1(tan); ADD1(atan); | ADD1(tan); ADD1(atan); |
| Line 384 MMath::MMath(Pool& apool) : Methoded(apo | Line 424 MMath::MMath(Pool& apool) : Methoded(apo |
| ADD1(sqrt); | ADD1(sqrt); |
| ADD1(random); | ADD1(random); |
| // ^pow(x;y) | // ^math:pow(x;y) |
| ADD2(pow); | ADD2(pow); |
| // ^crypt[password;salt] | // ^math:crypt[password;salt] |
| ADD2(crypt); | ADD2(crypt); |
| // ^md5[string] | // ^math:md5[string] |
| ADD1(md5); | ADD1(md5); |
| // ^uuid[] | // ^math:sha1[string] |
| ADD1(sha1); | |
| // ^math:crc32[string] | |
| ADD1(crc32); | |
| // ^math:uuid[] | |
| ADD0(uuid); | ADD0(uuid); |
| // ^uid64[] | // ^math:uid64[] |
| ADD0(uid64); | ADD0(uid64); |
| } | |
| // global variables | |
| Methoded *math_base_class; | |
| Hash *math_consts; | |
| // creator | |
| Methoded *MMath_create(Pool& pool) { | |
| math_consts=new(pool) Hash(pool); | |
| math_consts->put( | |
| *new(pool) String(pool, "PI"), | |
| new(pool) VDouble(pool, PI)); | |
| return math_base_class=new(pool) MMath(pool); | // ^math:convert[number](base-from;base-to) |
| add_native_method("convert", Method::CT_STATIC, _convert, 3, 3); | |
| } | } |