|
|
| version 1.47, 2001/04/17 19:00:41 | version 1.231, 2008/06/06 11:16:55 |
|---|---|
| Line 1 | Line 1 |
| /** @file | /** @file |
| Parser: commonly functions. | Parser: commonly functions. |
| Copyright(c) 2001 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: Alexander Petrosyan <paf@design.ru>(http://design.ru/paf) | * BASE64 part |
| * Authors: Michael Zucchi <notzed@ximian.com> | |
| * Jeffrey Stedfast <fejj@ximian.com> | |
| * | |
| * Copyright 2000-2004 Ximian, Inc. (www.ximian.com) | |
| * | |
| * This program is free software; you can redistribute it and/or modify | |
| * it under the terms of the GNU General Public License as published by | |
| * the Free Software Foundation; either version 2 of the License, or | |
| * (at your option) any later version. | |
| * | |
| * This program is distributed in the hope that it will be useful, | |
| * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
| * GNU General Public License for more details. | |
| * | |
| * You should have received a copy of the GNU General Public License | |
| * along with this program; if not, write to the Free Software | |
| * Foundation, Inc., 59 Temple Street #330, Boston, MA 02111-1307, USA. | |
| * | |
| */ | |
| $Id$ | static const char * const IDENT_COMMON_C="$Date$"; |
| */ | |
| #include "pa_config_includes.h" | |
| #include "pa_common.h" | #include "pa_common.h" |
| #include "pa_types.h" | |
| #include "pa_exception.h" | #include "pa_exception.h" |
| #include "pa_pool.h" | |
| #include "pa_globals.h" | |
| #include "pa_value.h" | |
| #include "pa_hash.h" | #include "pa_hash.h" |
| #include "pa_string.h" | #include "pa_globals.h" |
| #include "pa_charsets.h" | |
| #include "pa_http.h" | |
| #include "pa_request_charsets.h" | |
| #ifndef WIN32 | // some maybe-undefined constants |
| # ifndef _O_TEXT | |
| # define _O_TEXT 0 | #ifndef _O_TEXT |
| # endif | # define _O_TEXT 0 |
| # ifndef _O_BINARY | #endif |
| # define _O_BINARY 0 | #ifndef _O_BINARY |
| # define _O_BINARY 0 | |
| #endif | |
| #ifdef HAVE_FTRUNCATE | |
| # define PA_O_TRUNC 0 | |
| #else | |
| # ifdef _O_TRUNC | |
| # define PA_O_TRUNC _O_TRUNC | |
| # else | |
| # error you must have either ftruncate function or _O_TRUNC bit declared | |
| # endif | # endif |
| #endif | #endif |
| #if _MSC_VER | // defines for globals |
| int __vsnprintf(char *b, size_t s, const char *f, va_list l) { | #define FILE_STATUS_NAME "status" |
| int r=_vsnprintf(b, --s, f, l); | |
| b[s]=0; | // globals |
| return r; | |
| } | const String file_status_name(FILE_STATUS_NAME); |
| int __snprintf(char *b, size_t s, const char *f, ...) { | |
| va_list l; | // functions |
| va_start(l, f); | |
| int r=__vsnprintf(b, s, f, l); | void fix_line_breaks(char *str, size_t& length) { |
| va_end(l); | //_asm int 3; |
| return r; | const char* const eob=str+length; |
| char* dest=str; | |
| // fix DOS: \r\n -> \n | |
| // fix Macintosh: \r -> \n | |
| char* bol=str; | |
| while(char* eol=(char*)memchr(bol, '\r', eob -bol)) { | |
| size_t len=eol-bol; | |
| if(dest!=bol) | |
| memcpy(dest, bol, len); | |
| dest+=len; | |
| *dest++='\n'; | |
| if(&eol[1]<eob && eol[1]=='\n') { // \r, \n = DOS | |
| bol=eol+2; | |
| length--; | |
| } else // \r, not \n = Macintosh | |
| bol=eol+1; | |
| } | |
| // last piece without \r | |
| if(dest!=bol) | |
| memcpy(dest, bol, eob-bol); | |
| str[length]=0; // terminating | |
| } | |
| char* file_read_text(Request_charsets& charsets, | |
| const String& file_spec, | |
| bool fail_on_read_problem, | |
| HashStringValue* params/*, HashStringValue* * out_fields*/) { | |
| File_read_result file= | |
| file_read(charsets, file_spec, true, params, fail_on_read_problem); | |
| return file.success?file.str:0; | |
| } | |
| /// these options were handled but not checked elsewhere, now check them | |
| int pa_get_valid_file_options_count(HashStringValue& options) | |
| { | |
| int result=0; | |
| if(options.get(PA_SQL_LIMIT_NAME)) | |
| result++; | |
| if(options.get(PA_SQL_OFFSET_NAME)) | |
| result++; | |
| if(options.get(PA_COLUMN_SEPARATOR_NAME)) | |
| result++; | |
| if(options.get(PA_COLUMN_ENCLOSER_NAME)) | |
| result++; | |
| if(options.get(PA_CHARSET_NAME)) | |
| result++; | |
| return result; | |
| } | } |
| #ifndef DOXYGEN | |
| struct File_read_action_info { | |
| char **data; size_t *data_size; | |
| char* buf; size_t offset; size_t count; | |
| }; | |
| #endif | #endif |
| static void file_read_action( | |
| struct stat& finfo, | |
| int f, | |
| const String& file_spec, const char* /*fname*/, bool as_text, | |
| void *context) { | |
| File_read_action_info& info=*static_cast<File_read_action_info *>(context); | |
| size_t to_read_size=info.count; | |
| if(!to_read_size) | |
| to_read_size=(size_t)finfo.st_size; | |
| assert( !(info.buf && as_text) ); | |
| if(to_read_size) { | |
| if(info.offset) | |
| lseek(f, info.offset, SEEK_SET); | |
| *info.data=info.buf | |
| ? info.buf | |
| : new(PointerFreeGC) char[to_read_size+(as_text?1:0)]; | |
| *info.data_size=(size_t)read(f, *info.data, to_read_size); | |
| if(ssize_t(*info.data_size)<0 || *info.data_size>to_read_size) | |
| throw Exception(0, | |
| &file_spec, | |
| "read failed: actually read %u bytes count not in [0..%u] valid range", | |
| *info.data_size, to_read_size); | |
| } else { // empty file | |
| // for both, text and binary: for text we need that terminator, for binary we need nonzero pointer to be able to save such files | |
| *info.data=new(PointerFreeGC) char[1]; | |
| *(char*)(*info.data)=0; | |
| *info.data_size=0; | |
| return; | |
| } | |
| } | |
| File_read_result file_read(Request_charsets& charsets, const String& file_spec, | |
| bool as_text, HashStringValue *params, | |
| bool fail_on_read_problem, | |
| char* buf, size_t offset, size_t count) { | |
| File_read_result result={false, 0, 0, 0}; | |
| if(file_spec.starts_with("http://")) { | |
| if(offset || count) | |
| throw Exception(PARSER_RUNTIME, | |
| 0, | |
| "offset and load options are not supported for HTTP:// file load"); | |
| // fail on read problem | |
| File_read_http_result http=pa_internal_file_read_http(charsets, file_spec, as_text, params); | |
| result.success=true; | |
| result.str=http.str; | |
| result.length=http.length; | |
| result.headers=http.headers; | |
| } else { | |
| if(params) { | |
| int valid_options=pa_get_valid_file_options_count(*params); | |
| if(valid_options!=params->count()) | |
| throw Exception(PARSER_RUNTIME, | |
| 0, | |
| "invalid option passed"); | |
| } | |
| char *file_read_text(Pool& pool, const String& file_spec, bool fail_on_read_problem) { | File_read_action_info info={&result.str, &result.length, |
| void *result; | buf, offset, count}; |
| size_t size; | result.success=file_read_action_under_lock(file_spec, |
| return file_read(pool, file_spec, result, size, true, | "read", file_read_action, &info, |
| fail_on_read_problem)?(char *)result:0; | as_text, fail_on_read_problem); |
| if(result.length && as_text && params) { | |
| if( Value* vcharset_name=params->get(PA_CHARSET_NAME) ) { | |
| Charset asked_charset=::charsets.get(vcharset_name->as_string(). | |
| change_case(charsets.source(), String::CC_UPPER)); | |
| String::C body=String::C(result.str, result.length); | |
| body=Charset::transcode(body, asked_charset, charsets.source()); | |
| result.str=const_cast<char *>(body.str); // hacking a little | |
| result.length=body.length; | |
| } | |
| } | |
| } | |
| if(result.success && as_text) { | |
| // UTF-8 signature: EF BB BF | |
| if(result.length>=3) { | |
| char *in=(char *)result.str; | |
| if(strncmp(in, "\xEF\xBB\xBF", 3)==0) { | |
| result.str=in+3; result.length-=3;// skip prefix | |
| } | |
| } | |
| fix_line_breaks((char *)(result.str), result.length); | |
| } | |
| return result; | |
| } | } |
| bool file_read(Pool& pool, const String& file_spec, | |
| void*& data, size_t& read_size, bool as_text, | #ifdef PA_SAFE_MODE |
| bool fail_on_read_problem, | void check_safe_mode(struct stat finfo, const String& file_spec, const char* fname) { |
| size_t offset, size_t limit) { | if(finfo.st_uid/*foreign?*/!=geteuid() |
| const char *fname=file_spec.cstr(String::UL_FILE_NAME); | && finfo.st_gid/*foreign?*/!=getegid()) |
| throw Exception(PARSER_RUNTIME, | |
| &file_spec, | |
| "parser is in safe mode: " | |
| "reading files of foreign group and user disabled " | |
| "[recompile parser with --disable-safe-mode configure option], " | |
| "actual filename '%s', " | |
| "fuid(%d)!=euid(%d) or fgid(%d)!=egid(%d)", | |
| fname, | |
| finfo.st_uid, geteuid(), | |
| finfo.st_gid, getegid()); | |
| } | |
| #endif | |
| bool file_read_action_under_lock(const String& file_spec, | |
| const char* action_name, File_read_action action, void *context, | |
| bool as_text, | |
| bool fail_on_read_problem) { | |
| const char* fname=file_spec.cstr(String::L_FILE_SPEC); | |
| int f; | int f; |
| struct stat finfo; | |
| // first open, next stat: | // first open, next stat: |
| // directory update of NTFS hard links performed on open. | // directory update of NTFS hard links performed on open. |
| // ex: | // ex: |
| // a.html:^test[] and b.html hardlink to a.html | // a.html:^test[] and b.html hardlink to a.html |
| // user inserts ! before ^test in a.html | // user inserts ! before ^test in a.html |
| // directory entry of b.html in NTFS not updated at once, | // directory entry of b.html in NTFS not updated at once, |
| // they delay update till open, so we would receive "!^test[" string | // they delay update till open, so we would receive "!^test[" string |
| // if would do stat, next open. | // if would do stat, next open. |
| if( | // later: it seems, even this does not help sometimes |
| (f=open(fname, O_RDONLY|(as_text?_O_TEXT:_O_BINARY)))>=0 && | if((f=open(fname, O_RDONLY|(as_text?_O_TEXT:_O_BINARY)))>=0) { |
| stat(fname, &finfo)==0) { | try { |
| /*if(exclusive) | if(pa_lock_shared_blocking(f)!=0) |
| flock(f, LOCK_EX);*/ | throw Exception("file.lock", |
| size_t max_size=limit?min(offset+limit, finfo.st_size)-offset:finfo.st_size; | &file_spec, |
| if(!max_size) { // eof | "shared lock failed: %s (%d), actual filename '%s'", |
| data=0; | strerror(errno), errno, fname); |
| read_size=0; | |
| return true; | struct stat finfo; |
| } | if(stat(fname, &finfo)!=0) |
| data=pool.malloc(max_size+(as_text?1:0)); | throw Exception("file.missing", // hardly possible: we just opened it OK |
| if(offset) | &file_spec, |
| lseek(f, offset, SEEK_SET); | "stat failed: %s (%d), actual filename '%s'", |
| read_size=read(f, data, max_size); | strerror(errno), errno, fname); |
| /*if(exclusive) | |
| flock(f, LOCK_UN);*/ | #ifdef PA_SAFE_MODE |
| close(f); | check_safe_mode(finfo, file_spec, fname); |
| #endif | |
| if(read_size>=0 && read_size<=max_size) { | |
| if(as_text) | action(finfo, f, file_spec, fname, as_text, context); |
| ((char*&)data)[read_size]=0; | } catch(...) { |
| } else | pa_unlock(f);close(f); |
| PTHROW(0, 0, | if(fail_on_read_problem) |
| rethrow; | |
| return false; | |
| } | |
| pa_unlock(f);close(f); | |
| return true; | |
| } else { | |
| if(fail_on_read_problem) | |
| throw Exception(errno==EACCES?"file.access":errno==ENOENT?"file.missing":0, | |
| &file_spec, | &file_spec, |
| "read failed: actually read %d bytes count not in [0..%lu] valid range", | "%s failed: %s (%d), actual filename '%s'", |
| read_size, (unsigned long)max_size); //never | action_name, strerror(errno), errno, fname); |
| return false; | |
| return true;//prepare_config(result, remove_empty_lines); | } |
| } | } |
| if(fail_on_read_problem) | |
| PTHROW(0, 0, | void create_dir_for_file(const String& file_spec) { |
| &file_spec, | size_t pos_after=1; |
| "read failed: %s (%d)", strerror(errno), errno); | size_t pos_before; |
| return false; | while((pos_before=file_spec.pos('/', pos_after))!=STRING_NOT_FOUND) { |
| mkdir(file_spec.mid(0, pos_before).cstr(String::L_FILE_SPEC), 0775); | |
| pos_after=pos_before+1; | |
| } | |
| } | } |
| /// @test mkdirs | bool file_write_action_under_lock( |
| void file_write(Pool& pool, | |
| const String& file_spec, | const String& file_spec, |
| const void *data, size_t size, | const char* action_name, |
| bool as_text/*, | File_write_action action, |
| bool exclusive*/) { | void *context, |
| const char *fname=file_spec.cstr(String::UL_FILE_NAME); | bool as_text, |
| bool do_append, | |
| bool do_block, | |
| bool fail_on_lock_problem) { | |
| const char* fname=file_spec.cstr(String::L_FILE_SPEC); | |
| int f; | int f; |
| if(access(fname, F_OK)!=0) {/*no*/ | if(access(fname, W_OK)!=0) // no |
| if((f=open(fname, O_WRONLY|O_CREAT|_O_BINARY, 0666))>0) | create_dir_for_file(file_spec); |
| close(f); | |
| } | if((f=open(fname, |
| if(access(fname, R_OK|W_OK)==0) { | O_CREAT|O_RDWR |
| int mode=O_RDWR|(as_text?_O_TEXT:_O_BINARY) | |(as_text?_O_TEXT:_O_BINARY) |
| #ifdef WIN32 | |(do_append?O_APPEND:PA_O_TRUNC), 0664))>=0) { |
| |O_TRUNC | if((do_block?pa_lock_exclusive_blocking(f):pa_lock_exclusive_nonblocking(f))!=0) { |
| Exception e("file.lock", | |
| &file_spec, | |
| "shared lock failed: %s (%d), actual filename '%s'", | |
| strerror(errno), errno, fname); | |
| close(f); | |
| if(fail_on_lock_problem) | |
| throw e; | |
| return false; | |
| } | |
| try { | |
| action(f, context); | |
| } catch(...) { | |
| #ifdef HAVE_FTRUNCATE | |
| if(!do_append) | |
| ftruncate(f, lseek(f, 0, SEEK_CUR)); // one can not use O_TRUNC, read lower | |
| #endif | #endif |
| ; | pa_unlock(f);close(f); |
| if((f=open(fname, mode, 0666))>=0) { | rethrow; |
| /*if(exclusive) | } |
| flock(f, LOCK_EX);*/ | |
| #ifdef HAVE_FTRUNCATE | |
| if(size) write(f, data, size); | if(!do_append) |
| #ifndef WIN32 | ftruncate(f, lseek(f, 0, SEEK_CUR)); // O_TRUNC truncates even exclusevely write-locked file [thanks to Igor Milyakov <virtan@rotabanner.com> for discovering] |
| ftruncate(f, size); | #endif |
| #endif | pa_unlock(f);close(f); |
| /*if(exclusive) | return true; |
| flock(f, LOCK_UN);*/ | } else |
| close(f); | throw Exception(errno==EACCES?"file.access":0, |
| return; | |
| } | |
| } | |
| PTHROW(0, 0, | |
| &file_spec, | |
| "write failed: %s (%d)", strerror(errno), errno); | |
| } | |
| void file_delete(Pool& pool, const String& file_spec) { | |
| if(unlink(file_spec.cstr(String::UL_FILE_NAME))!=0) | |
| PTHROW(0, 0, | |
| &file_spec, | &file_spec, |
| "unlink failed: %s (%d)", strerror(errno), errno); | "%s failed: %s (%d), actual filename '%s'", |
| action_name, strerror(errno), errno, fname); | |
| // here should be nothing, see rethrow above | |
| } | |
| #ifndef DOXYGEN | |
| struct File_write_action_info { | |
| const char* str; size_t length; | |
| }; | |
| #endif | |
| static void file_write_action(int f, void *context) { | |
| File_write_action_info& info=*static_cast<File_write_action_info *>(context); | |
| if(info.length) { | |
| int written=write(f, info.str, info.length); | |
| if(written<0) | |
| throw Exception(0, | |
| 0, | |
| "write failed: %s (%d)", strerror(errno), errno); | |
| } | |
| } | |
| void file_write( | |
| const String& file_spec, | |
| const char* data, size_t size, | |
| bool as_text, | |
| bool do_append) { | |
| File_write_action_info info={data, size}; | |
| file_write_action_under_lock( | |
| file_spec, | |
| "write", | |
| file_write_action, | |
| &info, | |
| as_text, | |
| do_append); | |
| } | |
| // throws nothing! [this is required in file_move & file_delete] | |
| static void rmdir(const String& file_spec, size_t pos_after) { | |
| size_t pos_before; | |
| if((pos_before=file_spec.pos('/', pos_after))!=STRING_NOT_FOUND) | |
| rmdir(file_spec, pos_before+1); | |
| rmdir(file_spec.mid(0, pos_after-1/* / */).cstr(String::L_FILE_SPEC)); | |
| } | } |
| bool file_delete(const String& file_spec, bool fail_on_problem) { | |
| const char* fname=file_spec.cstr(String::L_FILE_SPEC); | |
| if(unlink(fname)!=0) | |
| if(fail_on_problem) | |
| throw Exception(errno==EACCES?"file.access":errno==ENOENT?"file.missing":0, | |
| &file_spec, | |
| "unlink failed: %s (%d), actual filename '%s'", | |
| strerror(errno), errno, fname); | |
| else | |
| return false; | |
| rmdir(file_spec, 1); | |
| return true; | |
| } | |
| void file_move(const String& old_spec, const String& new_spec) { | |
| const char* old_spec_cstr=old_spec.cstr(String::L_FILE_SPEC); | |
| const char* new_spec_cstr=new_spec.cstr(String::L_FILE_SPEC); | |
| create_dir_for_file(new_spec); | |
| bool file_readable(const String& file_spec) { | if(rename(old_spec_cstr, new_spec_cstr)!=0) |
| return access(file_spec.cstr(String::UL_FILE_NAME), R_OK)==0; | throw Exception(errno==EACCES?"file.access":errno==ENOENT?"file.missing":0, |
| &old_spec, | |
| "rename failed: %s (%d), actual filename '%s' to '%s'", | |
| strerror(errno), errno, old_spec_cstr, new_spec_cstr); | |
| rmdir(old_spec, 1); | |
| } | |
| bool entry_exists(const char* fname, struct stat *afinfo) { | |
| struct stat lfinfo; | |
| bool result=stat(fname, &lfinfo)==0; | |
| if(afinfo) | |
| *afinfo=lfinfo; | |
| return result; | |
| } | |
| bool entry_exists(const String& file_spec) { | |
| const char* fname=file_spec.cstr(String::L_FILE_SPEC); | |
| return entry_exists(fname, 0); | |
| } | |
| static bool entry_readable(const String& file_spec, bool need_dir) { | |
| char* fname=file_spec.cstrm(String::L_FILE_SPEC); | |
| if(need_dir) { | |
| size_t size=strlen(fname); | |
| while(size) { | |
| char c=fname[size-1]; | |
| if(c=='/' || c=='\\') | |
| fname[--size]=0; | |
| else | |
| break; | |
| } | |
| } | |
| struct stat finfo; | |
| if(access(fname, R_OK)==0 && entry_exists(fname, &finfo)) { | |
| bool is_dir=(finfo.st_mode&S_IFDIR) != 0; | |
| return is_dir==need_dir; | |
| } | |
| return false; | |
| } | |
| bool file_exist(const String& file_spec) { | |
| return entry_readable(file_spec, false); | |
| } | |
| bool dir_exists(const String& file_spec) { | |
| return entry_readable(file_spec, true); | |
| } | |
| const String* file_exist(const String& path, const String& name) { | |
| String& result=*new String(path); | |
| result << "/"; | |
| result << name; | |
| return file_exist(result)?&result:0; | |
| } | } |
| bool file_executable(const String& file_spec) { | bool file_executable(const String& file_spec) { |
| return access(file_spec.cstr(String::UL_FILE_NAME), X_OK)==0; | return access(file_spec.cstr(String::L_FILE_SPEC), X_OK)==0; |
| } | } |
| size_t file_size(const String& file_spec) { | bool file_stat(const String& file_spec, |
| Pool& pool=file_spec.pool(); | size_t& rsize, |
| const char *fname=file_spec.cstr(String::UL_FILE_NAME); | time_t& ratime, |
| struct stat finfo; | time_t& rmtime, |
| time_t& rctime, | |
| bool fail_on_read_problem) { | |
| const char* fname=file_spec.cstr(String::L_FILE_SPEC); | |
| struct stat finfo; | |
| if(stat(fname, &finfo)!=0) | if(stat(fname, &finfo)!=0) |
| PTHROW(0, 0, | if(fail_on_read_problem) |
| &file_spec, | throw Exception("file.missing", |
| "write failed: %s (%d)", strerror(errno), errno); | &file_spec, |
| return finfo.st_size; | "getting file size failed: %s (%d), real filename '%s'", |
| strerror(errno), errno, fname); | |
| else | |
| return false; | |
| rsize=finfo.st_size; | |
| ratime=finfo.st_atime; | |
| rmtime=finfo.st_mtime; | |
| rctime=finfo.st_ctime; | |
| return true; | |
| } | } |
| char *getrow(char **row_ref, char delim) { | char* getrow(char* *row_ref, char delim) { |
| char *result=*row_ref; | char* result=*row_ref; |
| if(result) { | if(result) { |
| *row_ref=strchr(result, delim); | *row_ref=strchr(result, delim); |
| if(*row_ref) | if(*row_ref) |
| *((*row_ref)++)=0; | *((*row_ref)++)=0; |
| else if(!*result) | else if(!*result) |
| return 0; | return 0; |
| } | } |
| return result; | return result; |
| } | } |
| char *lsplit(char *string, char delim) { | char* lsplit(char* string, char delim) { |
| if(string) { | if(string) { |
| char *v=strchr(string, delim); | char* v=strchr(string, delim); |
| if(v) { | if(v) { |
| *v=0; | *v=0; |
| return v+1; | return v+1; |
| } | } |
| } | } |
| return 0; | return 0; |
| } | } |
| char *lsplit(char **string_ref, char delim) { | char* lsplit(char* *string_ref, char delim) { |
| char *result=*string_ref; | char* result=*string_ref; |
| char *next=lsplit(*string_ref, delim); | char* next=lsplit(*string_ref, delim); |
| *string_ref=next; | *string_ref=next; |
| return result; | return result; |
| } | } |
| char *rsplit(char *string, char delim) { | char* rsplit(char* string, char delim) { |
| if(string) { | if(string) { |
| char *v=strrchr(string, delim); | char* v=strrchr(string, delim); |
| if(v) { | if(v) { |
| *v=0; | *v=0; |
| return v+1; | return v+1; |
| } | } |
| } | } |
| return NULL; | return NULL; |
| } | } |
| /// @todo less stupid type detection | |
| char *format(Pool& pool, double value, char *fmt) { | // format: %[flags][width][.precision]type http://msdn.microsoft.com/ru-ru/library/56e442dc(en-us,VS.80).aspx |
| char *result=(char *)pool.malloc(MAX_NUMBER); | // flags: '-', '+', ' ', '#', '0' http://msdn.microsoft.com/ru-ru/library/8aky45ct(en-us,VS.80).aspx |
| if(fmt) | // width, precision: non negative decimal number |
| if(strpbrk(fmt, "diouxX")) | enum FormatType { |
| if(strpbrk(fmt, "ouxX")) | FormatInvalid, |
| snprintf(result, MAX_NUMBER, fmt, (uint)value ); | FormatInt, |
| else | FormatUInt, |
| snprintf(result, MAX_NUMBER, fmt, (int)value ); | FormatDouble |
| else | }; |
| snprintf(result, MAX_NUMBER, fmt, value); | FormatType format_type(char* fmt){ |
| else | enum FormatState { |
| snprintf(result, MAX_NUMBER, "%d", (int)value); | Percent, |
| Flags, | |
| Width, | |
| Precision, | |
| Done | |
| } state=Percent; | |
| FormatType result=FormatInvalid; | |
| char* pos=fmt; | |
| while(char c=*(pos++)){ | |
| switch(state){ | |
| case Percent: | |
| if(c=='%'){ | |
| state=Flags; | |
| } else { | |
| return FormatInvalid; // 1st char must be '%' only | |
| } | |
| break; | |
| case Flags: | |
| if(strchr("-+ #0", c)!=0){ | |
| break; | |
| } | |
| // go to the next step | |
| case Width: | |
| if(c=='.'){ | |
| state=Precision; | |
| break; | |
| } | |
| // go to the next step | |
| case Precision: | |
| if(c>='0' && c<='9'){ | |
| if(state == Flags) state=Width; // no more flags | |
| break; | |
| } else if(c=='d' || c=='i'){ | |
| result=FormatInt; | |
| } else if(strchr("feEgG", c)!=0){ | |
| result=FormatDouble; | |
| } else if(strchr("uoxX", c)!=0){ | |
| result=FormatUInt; | |
| } else { | |
| return FormatInvalid; // invalid char | |
| } | |
| state=Done; | |
| break; | |
| case Done: | |
| return FormatInvalid; // no chars allowed after 'type' | |
| } | |
| } | |
| return result; | return result; |
| } | } |
| const char* format(double value, char* fmt) { | |
| char local_buf[MAX_NUMBER]; | |
| size_t size; | |
| if(fmt && strlen(fmt)){ | |
| switch(format_type(fmt)){ | |
| case FormatDouble: | |
| size=snprintf(local_buf, sizeof(local_buf), fmt, value); | |
| break; | |
| case FormatInt: | |
| size=snprintf(local_buf, sizeof(local_buf), fmt, (int)value); | |
| break; | |
| case FormatUInt: | |
| size=snprintf(local_buf, sizeof(local_buf), fmt, (uint)value); | |
| break; | |
| case FormatInvalid: | |
| throw Exception(PARSER_RUNTIME, | |
| 0, | |
| "Incorrect format string '%s' was specified.", fmt); | |
| } | |
| } else | |
| size=snprintf(local_buf, sizeof(local_buf), "%d", (int)value); | |
| if(size < 0 || size >= MAX_NUMBER-1){ // on win32 we manually reduce max size while printing | |
| throw Exception(PARSER_RUNTIME, | |
| 0, | |
| "Error occure white executing snprintf with format string '%s'.", fmt); | |
| } | |
| return pa_strdup(local_buf, size); | |
| } | |
| size_t stdout_write(const void *buf, size_t size) { | size_t stdout_write(const void *buf, size_t size) { |
| #ifdef WIN32 | #ifdef WIN32 |
| size_t to_write = size; | |
| do{ | do{ |
| int chunk_written=fwrite(buf, 1, min(8*0x400, size), stdout); | int chunk_written=fwrite(buf, 1, min((size_t)8*0x400, size), stdout); |
| if(chunk_written<=0) | if(chunk_written<=0) |
| break; | break; |
| size-=chunk_written; | size-=chunk_written; |
| buf=((const char*)buf)+chunk_written; | buf=((const char*)buf)+chunk_written; |
| } while(size>0); | } while(size>0); |
| return size; | return to_write-size; |
| #else | #else |
| return fwrite(buf, 1, size, stdout); | return fwrite(buf, 1, size, stdout); |
| #endif | #endif |
| } | } |
| const char *unescape_chars(Pool& pool, const char *cp, int len) { | enum EscapeState { |
| char *s=(char *)pool.malloc(len + 1); | EscapeRest, |
| enum EscapeState { | EscapeFirst, |
| EscapeRest, | EscapeSecond, |
| EscapeFirst, | EscapeUnicode |
| EscapeSecond | }; |
| } escapeState=EscapeRest; | /* |
| int escapedValue=0; | char* unescape_chars(const char* cp, int len) { |
| char* s=new(PointerFreeGC) char[len + 1]; | |
| EscapeState escapeState=EscapeRest; | |
| uint escapedValue=0; | |
| int srcPos=0; | int srcPos=0; |
| int dstPos=0; | int dstPos=0; |
| while(srcPos < len) { | while(srcPos < len) { |
| int ch=cp[srcPos]; | uchar ch=(uchar)cp[srcPos]; |
| switch(escapeState) { | switch(escapeState) { |
| case EscapeRest: | case EscapeRest: |
| if(ch=='%') { | if(ch=='%') { |
| escapeState=EscapeFirst; | escapeState=EscapeFirst; |
| } else if(ch=='+') { | } else if(ch=='+'){ |
| s[dstPos++]=' '; | s[dstPos++]=' '; |
| } else { | } else { |
| s[dstPos++]=ch; | s[dstPos++]=ch; |
| } | } |
| break; | break; |
| case EscapeFirst: | case EscapeFirst: |
| escapedValue=hex_value[ch] << 4; | escapedValue=hex_value[ch] << 4; |
| escapeState=EscapeSecond; | escapeState=EscapeSecond; |
| break; | break; |
| case EscapeSecond: | case EscapeSecond: |
| escapedValue +=hex_value[ch]; | escapedValue +=hex_value[ch]; |
| s[dstPos++]=escapedValue; | s[dstPos++]=(char)escapedValue; |
| escapeState=EscapeRest; | escapeState=EscapeRest; |
| break; | break; |
| } | } |
| srcPos++; | srcPos++; |
| } | } |
| s[dstPos]=0; | s[dstPos]=0; |
| return s; | return s; |
| } | } |
| */ | |
| struct Attributed_meaning_info { | char* unescape_chars(const char* cp, int len, Request_charsets* charsets){ |
| String::Untaint_lang lang; | char* s=new(PointerFreeGC) char[len + 1]; // enough (%uXXXX==6 bytes, max utf-8 char length==6 bytes) |
| String *header; | char* dst=s; |
| }; | EscapeState escapeState=EscapeRest; |
| static void append_attribute_subattribute(const Hash::Key& akey, Hash::Val *avalue, | uint escapedValue=0; |
| void *info) { | int srcPos=0; |
| if(akey==VALUE_NAME) | short int jsCnt=0; |
| return; | while(srcPos < len) { |
| uchar c=(uchar)cp[srcPos]; | |
| Attributed_meaning_info& ami=*static_cast<Attributed_meaning_info *>(info); | if(c=='%'){ |
| escapeState=EscapeFirst; | |
| } else { | |
| switch(escapeState) { | |
| case EscapeRest: | |
| if(c=='+'){ | |
| *dst++=' '; | |
| } else { | |
| *dst++=c; | |
| } | |
| break; | |
| case EscapeFirst: | |
| if(charsets && c=='u'){ | |
| // escaped unicode value: %u0430 | |
| jsCnt=0; | |
| escapedValue=0; | |
| escapeState=EscapeUnicode; | |
| } else { | |
| if(isxdigit(c)){ | |
| escapedValue=hex_value[c] << 4; | |
| escapeState=EscapeSecond; | |
| } else { | |
| *dst++=c; | |
| escapeState=EscapeRest; | |
| } | |
| } | |
| break; | |
| case EscapeSecond: | |
| if(isxdigit(c)){ | |
| escapedValue+=hex_value[c]; | |
| *dst++=(char)escapedValue; | |
| } | |
| escapeState=EscapeRest; | |
| break; | |
| case EscapeUnicode: | |
| if(isxdigit(c)){ | |
| escapedValue=(escapedValue << 4) + hex_value[c]; | |
| if(++jsCnt==4){ | |
| // transcode utf8 char to client charset (we can lost some chars here) | |
| charsets->client().store_Char((XMLByte*&)dst, (XMLCh)escapedValue, '?'); | |
| escapeState=EscapeRest; | |
| } | |
| } else { | |
| // not full unicode value | |
| escapeState=EscapeRest; | |
| } | |
| break; | |
| } | |
| } | |
| // ...; charset=windows1251 | srcPos++; |
| ami.header->APPEND_CONST("; "); | } |
| ami.header->append(akey, ami.lang, true); | |
| ami.header->APPEND_CONST("="); | |
| ami.header->append(static_cast<Value *>(avalue)->as_string(), | |
| ami.lang, true); | |
| } | |
| const String& attributed_meaning_to_string(Value& meaning, String::Untaint_lang lang) { | |
| String &result=*new(meaning.pool()) String(meaning.pool()); | |
| if(Hash *hash=meaning.get_hash()) { | |
| // $value(value) $subattribute(subattribute value) | |
| if(Value *value=static_cast<Value *>(hash->get(*value_name))) | |
| result.append(value->as_string(), lang, true); | |
| Attributed_meaning_info attributed_meaning_info={ | |
| lang, | |
| &result | |
| }; | |
| hash->for_each(append_attribute_subattribute, &attributed_meaning_info); | |
| } else // result value | |
| result.append(meaning.as_string(), lang, true); | |
| return result; | *dst=0; // zero-termination |
| return s; | |
| } | } |
| #ifdef WIN32 | #ifdef WIN32 |
| void back_slashes_to_slashes(char *s) { | void back_slashes_to_slashes(char* s) { |
| if(s) | if(s) |
| for(; *s; s++) | for(; *s; s++) |
| if(*s=='\\') | if(*s=='\\') |
| *s='/'; | *s='/'; |
| } | } |
| /* | /* |
| void slashes_to_back_slashes(char *s) { | void slashes_to_back_slashes(char* s) { |
| if(s) | if(s) |
| for(; *s; s++) | for(; *s; s++) |
| if(*s=='/') | if(*s=='/') |
| *s='\\'; | *s='\\'; |
| } | } |
| */ | */ |
| #endif | #endif |
| bool StrEqNc(const char *s1, const char *s2, bool strict) { | bool StrStartFromNC(const char* str, const char* substr, bool equal){ |
| while(true) { | while(true) { |
| if(!(*s1)) { | if(!(*substr)){ |
| if(!(*s2)) | if(!(*str)) |
| return true; | return true; |
| else | else |
| return !strict; | return !equal; |
| } else if(!(*s2)) | } |
| return !strict; | if(!(*str)) |
| if(isalpha(*s1)) { | return false; |
| if(tolower(*s1) !=tolower(*s2)) | if(isalpha((unsigned char)*str)) { |
| if(tolower((unsigned char)*str)!=tolower((unsigned char)*substr)) | |
| return false; | return false; |
| } else if((*s1) !=(*s2)) | } else if((*str) != (*substr)) |
| return false; | return false; |
| s1++; | str++; |
| s2++; | substr++; |
| } | |
| } | |
| static bool isLeap(int year) { | |
| return !( | |
| (year % 4) || ((year % 400) && !(year % 100)) | |
| ); | |
| } | |
| int getMonthDays(int year, int month) { | |
| static int monthDays[]={ | |
| 31, | |
| 28, | |
| 31, | |
| 30, | |
| 31, | |
| 30, | |
| 31, | |
| 31, | |
| 30, | |
| 31, | |
| 30, | |
| 31 | |
| }; | |
| return (month == 1 /* january -- 0 */ && isLeap(year)) ? 29 : monthDays[month]; | |
| } | |
| int remove_crlf(char* start, char* end) { | |
| char* from=start; | |
| char* to=start; | |
| bool skip=false; | |
| while(from < end){ | |
| switch(*from){ | |
| case '\n': | |
| case '\r': | |
| case '\t': | |
| case ' ': | |
| if(!skip){ | |
| *to=' '; | |
| to++; | |
| skip=true; | |
| } | |
| break; | |
| default: | |
| if(from != to) | |
| *to=*from; | |
| to++; | |
| skip=false; | |
| } | |
| from++; | |
| } | } |
| return to-start; | |
| } | } |
| /// must be last in this file | |
| #undef vsnprintf | |
| int __vsnprintf(char* b, size_t s, const char* f, va_list l) { | |
| if(!s) | |
| return 0; | |
| int r; | |
| // note: on win32& maybe somewhere else | |
| // vsnprintf do not writes terminating 0 in 'buffer full' case, reducing | |
| --s; | |
| // clients do not check for negative 's', feature: ignore such prints | |
| if((ssize_t)s<0) | |
| return 0; | |
| #if _MSC_VER | |
| /* | |
| win32: | |
| mk:@MSITStore:C:\Program%20Files\Microsoft%20Visual%20Studio\MSDN\2001APR\1033\vccore.chm::/html/_crt__vsnprintf.2c_._vsnwprintf.htm | |
| if the number of bytes to write exceeds buffer, then count bytes are written and Ö1 is returned | |
| */ | |
| r=_vsnprintf(b, s, f, l); | |
| if(r<0) | |
| r=s; | |
| #else | |
| r=vsnprintf(b, s, f, l); | |
| /* | |
| solaris: | |
| man vsnprintf | |
| The snprintf() function returns the number of characters | |
| formatted, that is, the number of characters that would have | |
| been written to the buffer if it were large enough. If the | |
| value of n is 0 on a call to snprintf(), an unspecified | |
| value less than 1 is returned. | |
| */ | |
| if(r<0) | |
| r=0; | |
| else if((size_t)r>s) | |
| r=s; | |
| #endif | |
| b[r]=0; | |
| return r; | |
| } | |
| int __snprintf(char* b, size_t s, const char* f, ...) { | |
| va_list l; | |
| va_start(l, f); | |
| int r=__vsnprintf(b, s, f, l); | |
| va_end(l); | |
| return r; | |
| } | |
| /* mime64 functions are from libgmime[http://spruce.sourceforge.net/gmime/] lib */ | |
| /* | |
| * Authors: Michael Zucchi <notzed@helixcode.com> | |
| * Jeffrey Stedfast <fejj@helixcode.com> | |
| * | |
| * Copyright 2000 Helix Code, Inc. (www.helixcode.com) | |
| * | |
| * This program is free software; you can redistribute it and/or modify | |
| * it under the terms of the GNU General Public License as published by | |
| * the Free Software Foundation; either version 2 of the License, or | |
| * (at your option) any later version. | |
| * | |
| * This program is distributed in the hope that it will be useful, | |
| * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
| * GNU General Public License for more details. | |
| * | |
| * You should have received a copy of the GNU General Public License | |
| * along with this program; if not, write to the Free Software | |
| * Foundation, Inc., 59 Temple Street #330, Boston, MA 02111-1307, USA. | |
| * | |
| */ | |
| static char *base64_alphabet = | |
| "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; | |
| /** | |
| * g_mime_utils_base64_encode_step: | |
| * @in: input stream | |
| * @inlen: length of the input | |
| * @out: output string | |
| * @state: holds the number of bits that are stored in @save | |
| * @save: leftover bits that have not yet been encoded | |
| * | |
| * Base64 encodes a chunk of data. Performs an 'encode step', only | |
| * encodes blocks of 3 characters to the output at a time, saves | |
| * left-over state in state and save (initialise to 0 on first | |
| * invocation). | |
| * | |
| * Returns the number of bytes encoded. | |
| **/ | |
| static size_t | |
| g_mime_utils_base64_encode_step (const unsigned char *in, size_t inlen, unsigned char *out, int *state, int *save) | |
| { | |
| register const unsigned char *inptr; | |
| register unsigned char *outptr; | |
| if (inlen <= 0) | |
| return 0; | |
| inptr = in; | |
| outptr = out; | |
| if (inlen + ((unsigned char *)save)[0] > 2) { | |
| const unsigned char *inend = in + inlen - 2; | |
| register int c1 = 0, c2 = 0, c3 = 0; | |
| register int already; | |
| already = *state; | |
| switch (((char *)save)[0]) { | |
| case 1: c1 = ((unsigned char *)save)[1]; goto skip1; | |
| case 2: c1 = ((unsigned char *)save)[1]; | |
| c2 = ((unsigned char *)save)[2]; goto skip2; | |
| } | |
| /* yes, we jump into the loop, no i'm not going to change it, its beautiful! */ | |
| while (inptr < inend) { | |
| c1 = *inptr++; | |
| skip1: | |
| c2 = *inptr++; | |
| skip2: | |
| c3 = *inptr++; | |
| *outptr++ = base64_alphabet [c1 >> 2]; | |
| *outptr++ = base64_alphabet [(c2 >> 4) | ((c1 & 0x3) << 4)]; | |
| *outptr++ = base64_alphabet [((c2 & 0x0f) << 2) | (c3 >> 6)]; | |
| *outptr++ = base64_alphabet [c3 & 0x3f]; | |
| /* this is a bit ugly ... */ | |
| if ((++already) >= 19) { | |
| *outptr++ = '\n'; | |
| already = 0; | |
| } | |
| } | |
| ((unsigned char *)save)[0] = 0; | |
| inlen = 2 - (inptr - inend); | |
| *state = already; | |
| } | |
| //d(printf ("state = %d, inlen = %d\n", (int)((char *)save)[0], inlen)); | |
| if (inlen > 0) { | |
| register char *saveout; | |
| /* points to the slot for the next char to save */ | |
| saveout = & (((char *)save)[1]) + ((char *)save)[0]; | |
| /* inlen can only be 0 1 or 2 */ | |
| switch (inlen) { | |
| case 2: *saveout++ = *inptr++; | |
| case 1: *saveout++ = *inptr++; | |
| } | |
| *(char *)save = *(char *)save+(char)inlen; | |
| } | |
| /*d(printf ("mode = %d\nc1 = %c\nc2 = %c\n", | |
| (int)((char *)save)[0], | |
| (int)((char *)save)[1], | |
| (int)((char *)save)[2]));*/ | |
| return (outptr - out); | |
| } | |
| /** | |
| * g_mime_utils_base64_encode_close: | |
| * @in: input stream | |
| * @inlen: length of the input | |
| * @out: output string | |
| * @state: holds the number of bits that are stored in @save | |
| * @save: leftover bits that have not yet been encoded | |
| * | |
| * Base64 encodes the input stream to the output stream. Call this | |
| * when finished encoding data with g_mime_utils_base64_encode_step to | |
| * flush off the last little bit. | |
| * | |
| * Returns the number of bytes encoded. | |
| **/ | |
| static size_t | |
| g_mime_utils_base64_encode_close (const unsigned char *in, size_t inlen, unsigned char *out, int *state, int *save) | |
| { | |
| unsigned char *outptr = out; | |
| int c1, c2; | |
| if (inlen > 0) | |
| outptr += g_mime_utils_base64_encode_step (in, inlen, outptr, state, save); | |
| c1 = ((unsigned char *)save)[1]; | |
| c2 = ((unsigned char *)save)[2]; | |
| switch (((unsigned char *)save)[0]) { | |
| case 2: | |
| outptr[2] = base64_alphabet [(c2 & 0x0f) << 2]; | |
| goto skip; | |
| case 1: | |
| outptr[2] = '='; | |
| skip: | |
| outptr[0] = base64_alphabet [c1 >> 2]; | |
| outptr[1] = base64_alphabet [c2 >> 4 | ((c1 & 0x3) << 4)]; | |
| outptr[3] = '='; | |
| outptr += 4; | |
| break; | |
| } | |
| *outptr++ = 0; | |
| *save = 0; | |
| *state = 0; | |
| return (outptr - out); | |
| } | |
| static unsigned char gmime_base64_rank[256] = { | |
| 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, | |
| 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, | |
| 255,255,255,255,255,255,255,255,255,255,255, 62,255,255,255, 63, | |
| 52, 53, 54, 55, 56, 57, 58, 59, 60, 61,255,255,255, 0,255,255, | |
| 255, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, | |
| 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,255,255,255,255,255, | |
| 255, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, | |
| 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51,255,255,255,255,255, | |
| 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, | |
| 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, | |
| 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, | |
| 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, | |
| 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, | |
| 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, | |
| 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, | |
| 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, | |
| }; | |
| /** | |
| * g_mime_utils_base64_decode_step: | |
| * @in: input stream | |
| * @inlen: max length of data to decode | |
| * @out: output stream | |
| * @state: holds the number of bits that are stored in @save | |
| * @save: leftover bits that have not yet been decoded | |
| * | |
| * Decodes a chunk of base64 encoded data. | |
| * | |
| * Returns the number of bytes decoded (which have been dumped in @out). | |
| **/ | |
| size_t | |
| g_mime_utils_base64_decode_step (const unsigned char *in, size_t inlen, unsigned char *out, int *state, int *save) | |
| { | |
| const unsigned char *inptr; | |
| unsigned char *outptr; | |
| const unsigned char *inend; | |
| int saved; | |
| unsigned char c; | |
| int i; | |
| inend = in + inlen; | |
| outptr = out; | |
| /* convert 4 base64 bytes to 3 normal bytes */ | |
| saved = *save; | |
| i = *state; | |
| inptr = in; | |
| while (inptr < inend) { | |
| c = gmime_base64_rank[*inptr++]; | |
| if (c != 0xff) { | |
| saved = (saved << 6) | c; | |
| i++; | |
| if (i == 4) { | |
| *outptr++ = (unsigned char)(saved >> 16); | |
| *outptr++ = (unsigned char)(saved >> 8); | |
| *outptr++ = (unsigned char)(saved); | |
| i = 0; | |
| } | |
| } | |
| } | |
| *save = saved; | |
| *state = i; | |
| /* quick scan back for '=' on the end somewhere */ | |
| /* fortunately we can drop 1 output char for each trailing = (upto 2) */ | |
| i = 2; | |
| while (inptr > in && i) { | |
| inptr--; | |
| if (gmime_base64_rank[*inptr] != 0xff) { | |
| if (*inptr == '=' && outptr > out) | |
| outptr--; | |
| i--; | |
| } | |
| } | |
| /* if i != 0 then there is a truncation error! */ | |
| return (outptr - out); | |
| } | |
| char* pa_base64_encode(const char *in, size_t in_size) | |
| { | |
| /* wont go to more than 2x size (overly conservative) */ | |
| char* result=new(PointerFreeGC) char[in_size * 2 + 6]; | |
| int state=0; | |
| int save=0; | |
| #ifndef NDEBUG | |
| size_t filled= | |
| #endif | |
| g_mime_utils_base64_encode_close ((const unsigned char*)in, in_size, | |
| (unsigned char*)result, &state, &save); | |
| assert(filled <= in_size * 2 + 6); | |
| return result; | |
| } | |
| char* pa_base64_encode(const String& file_spec) | |
| { | |
| unsigned char* base64=0; | |
| File_base64_action_info info={&base64}; | |
| file_read_action_under_lock(file_spec, | |
| "pa_base64_encode", file_base64_file_action, &info); | |
| return (char*)base64; | |
| } | |
| static void file_base64_file_action( | |
| struct stat& finfo, | |
| int f, | |
| const String&, const char* /*fname*/, bool, | |
| void *context) { | |
| if(finfo.st_size) { | |
| File_base64_action_info& info=*static_cast<File_base64_action_info *>(context); | |
| *info.base64=new(PointerFreeGC) unsigned char[finfo.st_size * 2 + 6]; | |
| unsigned char* base64 = *info.base64; | |
| int state=0; | |
| int save=0; | |
| int nCount; | |
| do { | |
| unsigned char buffer[FILE_BUFFER_SIZE]; | |
| nCount = file_block_read(f, buffer, sizeof(buffer)); | |
| if( nCount ){ | |
| size_t filled=g_mime_utils_base64_encode_step ((const unsigned char*)buffer, nCount, base64, &state, &save); | |
| base64+=filled; | |
| } | |
| } while(nCount > 0); | |
| g_mime_utils_base64_encode_close (0, 0, base64, &state, &save); | |
| } | |
| } | |
| void pa_base64_decode(const char *in, size_t in_size, char*& result, size_t& result_size) | |
| { | |
| /* wont go to more than had (overly conservative) */ | |
| result=new(PointerFreeGC) char[in_size+1/*terminator*/]; | |
| int state=0; | |
| int save=0; | |
| result_size= | |
| g_mime_utils_base64_decode_step ((const unsigned char*)in, in_size, | |
| (unsigned char*)result, &state, &save); | |
| assert(result_size <= in_size); | |
| result[result_size]=0; // for text files | |
| } | |
| int file_block_read(const int f, unsigned char* buffer, const size_t size){ | |
| int nCount = read(f, buffer, size); | |
| if (nCount < 0) | |
| throw Exception(0, | |
| 0, | |
| "read failed: %s (%d)", strerror(errno), errno); | |
| return nCount; | |
| } | |
| const unsigned long pa_crc32(const char *in, size_t in_size) | |
| { | |
| unsigned long crc32=0xFFFFFFFF; | |
| InitCrc32Table(); | |
| for(size_t i = 0; i < in_size; i++) CalcCrc32(in[i], crc32); | |
| return ~crc32; | |
| } | |
| const unsigned long pa_crc32(const String& file_spec) | |
| { | |
| unsigned long crc32=0xFFFFFFFF; | |
| file_read_action_under_lock(file_spec, "crc32", file_crc32_file_action, &crc32); | |
| return ~crc32; | |
| } | |
| static void file_crc32_file_action( | |
| struct stat& finfo, | |
| int f, | |
| const String&, const char* /*fname*/, bool, | |
| void *context) | |
| { | |
| unsigned long& crc32=*static_cast<unsigned long *>(context); | |
| if(finfo.st_size) { | |
| InitCrc32Table(); | |
| int nCount=0; | |
| do { | |
| unsigned char buffer[FILE_BUFFER_SIZE]; | |
| nCount = file_block_read(f, buffer, sizeof(buffer)); | |
| for(int i = 0; i < nCount; i++) CalcCrc32(buffer[i], crc32); | |
| } while(nCount > 0); | |
| } | |
| } | |