Annotation of parser3/src/main/pa_common.C, revision 1.278
1.15 paf 1: /** @file
1.16 paf 2: Parser: commonly functions.
3:
1.267 moko 4: Copyright (c) 2000-2012 Art. Lebedev Studio (http://www.artlebedev.com)
1.101 paf 5: Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru)
1.16 paf 6:
1.210 paf 7: * BASE64 part
8: * Authors: Michael Zucchi <notzed@ximian.com>
9: * Jeffrey Stedfast <fejj@ximian.com>
10: *
11: * Copyright 2000-2004 Ximian, Inc. (www.ximian.com)
12: *
13: * This program is free software; you can redistribute it and/or modify
14: * it under the terms of the GNU General Public License as published by
15: * the Free Software Foundation; either version 2 of the License, or
16: * (at your option) any later version.
17: *
18: * This program is distributed in the hope that it will be useful,
19: * but WITHOUT ANY WARRANTY; without even the implied warranty of
20: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21: * GNU General Public License for more details.
22: *
23: * You should have received a copy of the GNU General Public License
24: * along with this program; if not, write to the Free Software
25: * Foundation, Inc., 59 Temple Street #330, Boston, MA 02111-1307, USA.
26: *
27: */
28:
1.1 paf 29: #include "pa_common.h"
1.4 paf 30: #include "pa_exception.h"
1.154 paf 31: #include "pa_hash.h"
1.14 paf 32: #include "pa_globals.h"
1.154 paf 33: #include "pa_charsets.h"
1.214 paf 34: #include "pa_http.h"
1.223 misha 35: #include "pa_request_charsets.h"
1.237 misha 36: #include "pcre.h"
1.241 misha 37: #include "pa_request.h"
1.98 paf 38:
1.273 moko 39: #ifdef _MSC_VER
1.276 moko 40: #include <windows.h>
1.273 moko 41: #include <direct.h>
42: #endif
43:
1.277 moko 44: #ifdef _MSC_VER
45: #define pa_mkdir(path, mode) _mkdir(path)
46: #else
47: #define pa_mkdir(path, mode) mkdir(path, mode)
48: #endif
49:
1.278 ! moko 50: volatile const char * IDENT_PA_COMMON_C="$Id: pa_common.C,v 1.277 2013/07/30 12:36:22 moko Exp $" IDENT_PA_COMMON_H IDENT_PA_HASH_H IDENT_PA_ARRAY_H IDENT_PA_STACK_H;
1.267 moko 51:
1.93 paf 52: // some maybe-undefined constants
53:
1.82 paf 54: #ifndef _O_TEXT
55: # define _O_TEXT 0
56: #endif
57: #ifndef _O_BINARY
58: # define _O_BINARY 0
1.47 paf 59: #endif
1.80 paf 60:
1.138 paf 61: #ifdef HAVE_FTRUNCATE
62: # define PA_O_TRUNC 0
63: #else
64: # ifdef _O_TRUNC
65: # define PA_O_TRUNC _O_TRUNC
66: # else
67: # error you must have either ftruncate function or _O_TRUNC bit declared
68: # endif
1.154 paf 69: #endif
1.176 paf 70:
1.154 paf 71: // defines for globals
72:
73: #define FILE_STATUS_NAME "status"
74:
75: // globals
76:
77: const String file_status_name(FILE_STATUS_NAME);
78:
79: // functions
1.127 paf 80:
1.271 moko 81: char* file_read_text(Request_charsets& charsets, const String& file_spec, bool fail_on_read_problem, HashStringValue* params, bool transcode_result) {
82: File_read_result file=file_read(charsets, file_spec, true, params, fail_on_read_problem, 0, 0, 0, transcode_result);
1.154 paf 83: return file.success?file.str:0;
1.126 paf 84: }
85:
1.271 moko 86: char* file_load_text(Request& r, const String& file_spec, bool fail_on_read_problem, HashStringValue* params, bool transcode_result) {
87: File_read_result file=file_load(r, file_spec, true, params, fail_on_read_problem, 0, 0, 0, transcode_result);
1.241 misha 88: return file.success?file.str:0;
89: }
90:
1.206 paf 91: /// these options were handled but not checked elsewhere, now check them
1.239 misha 92: int pa_get_valid_file_options_count(HashStringValue& options) {
1.206 paf 93: int result=0;
94: if(options.get(PA_SQL_LIMIT_NAME))
95: result++;
96: if(options.get(PA_SQL_OFFSET_NAME))
97: result++;
98: if(options.get(PA_COLUMN_SEPARATOR_NAME))
99: result++;
100: if(options.get(PA_COLUMN_ENCLOSER_NAME))
101: result++;
1.223 misha 102: if(options.get(PA_CHARSET_NAME))
103: result++;
1.206 paf 104: return result;
105: }
106:
1.123 paf 107: #ifndef DOXYGEN
108: struct File_read_action_info {
1.154 paf 109: char **data; size_t *data_size;
1.188 paf 110: char* buf; size_t offset; size_t count;
1.126 paf 111: };
1.123 paf 112: #endif
1.271 moko 113:
114: static void file_read_action(struct stat& finfo, int f, const String& file_spec, const char* /*fname*/, bool as_text, void *context) {
1.126 paf 115: File_read_action_info& info=*static_cast<File_read_action_info *>(context);
1.188 paf 116: size_t to_read_size=info.count;
117: if(!to_read_size)
118: to_read_size=(size_t)finfo.st_size;
119: assert( !(info.buf && as_text) );
1.271 moko 120: if(to_read_size) {
1.188 paf 121: if(info.offset)
122: lseek(f, info.offset, SEEK_SET);
1.271 moko 123: *info.data=info.buf ? info.buf : (char *)pa_malloc_atomic(to_read_size+1);
124: ssize_t result=read(f, *info.data, to_read_size);
125: if(result<0)
126: throw Exception("file.read", &file_spec, "read failed: %s (%d)", strerror(errno), errno);
127: *info.data_size=result;
1.123 paf 128: } else { // empty file
1.209 paf 129: // for both, text and binary: for text we need that terminator, for binary we need nonzero pointer to be able to save such files
1.253 misha 130: *info.data=(char *)pa_malloc_atomic(1);
1.209 paf 131: *(char*)(*info.data)=0;
1.123 paf 132: *info.data_size=0;
133: return;
134: }
1.126 paf 135: }
1.241 misha 136:
1.154 paf 137: File_read_result file_read(Request_charsets& charsets, const String& file_spec,
1.229 misha 138: bool as_text, HashStringValue *params,
139: bool fail_on_read_problem,
1.234 misha 140: char* buf, size_t offset, size_t count, bool transcode_text_result) {
1.167 paf 141: File_read_result result={false, 0, 0, 0};
1.241 misha 142: if(params){
143: int valid_options=pa_get_valid_file_options_count(*params);
144: if(valid_options!=params->count())
1.262 misha 145: throw Exception(PARSER_RUNTIME, 0, CALLED_WITH_INVALID_OPTION);
1.241 misha 146: }
1.203 paf 147:
1.241 misha 148: File_read_action_info info={&result.str, &result.length, buf, offset, count};
1.161 paf 149:
1.241 misha 150: result.success=file_read_action_under_lock(file_spec,
151: "read", file_read_action, &info,
152: as_text, fail_on_read_problem);
1.223 misha 153:
1.241 misha 154: if(as_text){
155: if(result.success){
1.263 misha 156: Charset* asked_charset=0;
1.236 misha 157: if(result.length>=3 && strncmp(result.str, "\xEF\xBB\xBF", 3)==0){
1.240 misha 158: // skip UTF-8 signature (BOM code)
1.236 misha 159: result.str+=3;
160: result.length-=3;
1.263 misha 161: asked_charset=&UTF8_charset;
1.236 misha 162: }
163:
1.263 misha 164: if(params)
165: if(Value* vcharset_name=params->get(PA_CHARSET_NAME))
166: asked_charset=&::charsets.get(vcharset_name->as_string().change_case(charsets.source(), String::CC_UPPER));
167:
168: if(result.length && transcode_text_result && asked_charset){ // length must be checked because transcode returns CONST string in case length==0, which contradicts hacking few lines below
169: String::C body=String::C(result.str, result.length);
170: body=Charset::transcode(body, *asked_charset, charsets.source());
1.236 misha 171:
1.263 misha 172: result.str=const_cast<char*>(body.str); // hacking a little
173: result.length=body.length;
1.131 paf 174: }
175: }
1.241 misha 176: if(result.length)
177: fix_line_breaks(result.str, result.length);
1.123 paf 178: }
1.241 misha 179:
180: return result;
181: }
182:
183: File_read_result file_load(Request& r, const String& file_spec,
184: bool as_text, HashStringValue *params,
185: bool fail_on_read_problem,
186: char* buf, size_t offset, size_t count, bool transcode_text_result) {
187:
188: File_read_result result={false, 0, 0, 0};
189: if(file_spec.starts_with("http://")) {
190: if(offset || count)
191: throw Exception(PARSER_RUNTIME,
192: 0,
193: "offset and load options are not supported for HTTP:// file load");
194:
195: // fail on read problem
196: File_read_http_result http=pa_internal_file_read_http(r, file_spec, as_text, params, transcode_text_result);
197: result.success=true;
198: result.str=http.str;
199: result.length=http.length;
200: result.headers=http.headers;
201: } else
202: result=
203: file_read(r.charsets, file_spec, as_text, params, fail_on_read_problem, buf, offset, count, transcode_text_result);
1.126 paf 204:
205: return result;
1.123 paf 206: }
207:
1.257 pretende 208:
1.154 paf 209: #ifdef PA_SAFE_MODE
1.259 misha 210: void check_safe_mode(struct stat finfo, const String& file_spec, const char* fname) {
1.154 paf 211: if(finfo.st_uid/*foreign?*/!=geteuid()
212: && finfo.st_gid/*foreign?*/!=getegid())
1.224 misha 213: throw Exception(PARSER_RUNTIME,
1.154 paf 214: &file_spec,
215: "parser is in safe mode: "
216: "reading files of foreign group and user disabled "
217: "[recompile parser with --disable-safe-mode configure option], "
218: "actual filename '%s', "
219: "fuid(%d)!=euid(%d) or fgid(%d)!=egid(%d)",
220: fname,
221: finfo.st_uid, geteuid(),
1.259 misha 222: finfo.st_gid, getegid());
223: }
224: #else
225: void check_safe_mode(struct stat, const String&, const char*) {
226: }
1.257 pretende 227: #endif
1.259 misha 228:
1.257 pretende 229:
1.149 paf 230:
1.154 paf 231: bool file_read_action_under_lock(const String& file_spec,
1.126 paf 232: const char* action_name, File_read_action action, void *context,
233: bool as_text,
1.123 paf 234: bool fail_on_read_problem) {
1.247 misha 235: const char* fname=file_spec.taint_cstr(String::L_FILE_SPEC);
1.33 paf 236: int f;
237:
238: // first open, next stat:
1.45 paf 239: // directory update of NTFS hard links performed on open.
1.33 paf 240: // ex:
241: // a.html:^test[] and b.html hardlink to a.html
242: // user inserts ! before ^test in a.html
1.126 paf 243: // directory entry of b.html in NTFS not updated at once,
1.35 paf 244: // they delay update till open, so we would receive "!^test[" string
245: // if would do stat, next open.
1.123 paf 246: // later: it seems, even this does not help sometimes
1.229 misha 247: if((f=open(fname, O_RDONLY|(as_text?_O_TEXT:_O_BINARY)))>=0) {
1.123 paf 248: try {
1.162 paf 249: if(pa_lock_shared_blocking(f)!=0)
1.126 paf 250: throw Exception("file.lock",
1.123 paf 251: &file_spec,
252: "shared lock failed: %s (%d), actual filename '%s'",
1.154 paf 253: strerror(errno), errno, fname);
1.123 paf 254:
1.124 paf 255: struct stat finfo;
1.254 misha 256: if(fstat(f, &finfo)!=0)
1.124 paf 257: throw Exception("file.missing", // hardly possible: we just opened it OK
258: &file_spec,
259: "stat failed: %s (%d), actual filename '%s'",
1.154 paf 260: strerror(errno), errno, fname);
1.124 paf 261:
1.149 paf 262: check_safe_mode(finfo, file_spec, fname);
1.32 paf 263:
1.154 paf 264: action(finfo, f, file_spec, fname, as_text, context);
1.123 paf 265: } catch(...) {
1.162 paf 266: pa_unlock(f);close(f);
1.123 paf 267: if(fail_on_read_problem)
1.154 paf 268: rethrow;
1.123 paf 269: return false;
270: }
1.87 paf 271:
1.162 paf 272: pa_unlock(f);close(f);
1.72 parser 273: return true;
1.229 misha 274: } else {
1.118 paf 275: if(fail_on_read_problem)
1.256 misha 276: throw Exception(errno==EACCES?"file.access"
277: :(errno==ENOENT || errno==ENOTDIR || errno==ENODEV)?"file.missing":0,
1.118 paf 278: &file_spec,
1.123 paf 279: "%s failed: %s (%d), actual filename '%s'",
1.154 paf 280: action_name, strerror(errno), errno, fname);
1.118 paf 281: return false;
282: }
1.8 paf 283: }
284:
1.202 paf 285: void create_dir_for_file(const String& file_spec) {
1.63 parser 286: size_t pos_after=1;
1.154 paf 287: size_t pos_before;
288: while((pos_before=file_spec.pos('/', pos_after))!=STRING_NOT_FOUND) {
1.277 moko 289: pa_mkdir(file_spec.mid(0, pos_before).taint_cstr(String::L_FILE_SPEC), 0775);
1.63 parser 290: pos_after=pos_before+1;
291: }
292: }
293:
1.98 paf 294: bool file_write_action_under_lock(
1.28 paf 295: const String& file_spec,
1.225 misha 296: const char* action_name,
297: File_write_action action,
298: void *context,
1.126 paf 299: bool as_text,
300: bool do_append,
301: bool do_block,
1.110 paf 302: bool fail_on_lock_problem) {
1.247 misha 303: const char* fname=file_spec.taint_cstr(String::L_FILE_SPEC);
1.28 paf 304: int f;
1.80 paf 305: if(access(fname, W_OK)!=0) // no
1.126 paf 306: create_dir_for_file(file_spec);
1.50 paf 307:
1.80 paf 308: if((f=open(fname,
309: O_CREAT|O_RDWR
310: |(as_text?_O_TEXT:_O_BINARY)
1.138 paf 311: |(do_append?O_APPEND:PA_O_TRUNC), 0664))>=0) {
1.162 paf 312: if((do_block?pa_lock_exclusive_blocking(f):pa_lock_exclusive_nonblocking(f))!=0) {
1.126 paf 313: Exception e("file.lock",
1.110 paf 314: &file_spec,
315: "shared lock failed: %s (%d), actual filename '%s'",
1.154 paf 316: strerror(errno), errno, fname);
1.126 paf 317: close(f);
1.110 paf 318: if(fail_on_lock_problem)
319: throw e;
1.98 paf 320: return false;
321: }
1.96 paf 322:
1.158 paf 323: try {
1.254 misha 324: #if (defined(HAVE_FCHMOD) && defined(PA_SAFE_MODE))
325: struct stat finfo;
326: if(fstat(f, &finfo)==0 && finfo.st_mode & 0111)
327: fchmod(f, finfo.st_mode & 0666/*clear executable bits*/); // backward: ignore errors if any
328: #endif
329: action(f, context);
1.158 paf 330: } catch(...) {
1.138 paf 331: #ifdef HAVE_FTRUNCATE
1.104 paf 332: if(!do_append)
1.125 paf 333: ftruncate(f, lseek(f, 0, SEEK_CUR)); // one can not use O_TRUNC, read lower
1.138 paf 334: #endif
1.162 paf 335: pa_unlock(f);close(f);
1.154 paf 336: rethrow;
1.158 paf 337: }
1.80 paf 338:
1.138 paf 339: #ifdef HAVE_FTRUNCATE
1.104 paf 340: if(!do_append)
1.125 paf 341: ftruncate(f, lseek(f, 0, SEEK_CUR)); // O_TRUNC truncates even exclusevely write-locked file [thanks to Igor Milyakov <virtan@rotabanner.com> for discovering]
1.138 paf 342: #endif
1.162 paf 343: pa_unlock(f);close(f);
1.98 paf 344: return true;
1.80 paf 345: } else
1.126 paf 346: throw Exception(errno==EACCES?"file.access":0,
1.80 paf 347: &file_spec,
1.96 paf 348: "%s failed: %s (%d), actual filename '%s'",
1.154 paf 349: action_name, strerror(errno), errno, fname);
1.96 paf 350: // here should be nothing, see rethrow above
351: }
352:
353: #ifndef DOXYGEN
354: struct File_write_action_info {
1.250 misha 355: const char* str;
356: size_t length;
1.126 paf 357: };
1.96 paf 358: #endif
1.271 moko 359:
1.96 paf 360: static void file_write_action(int f, void *context) {
1.126 paf 361: File_write_action_info& info=*static_cast<File_write_action_info *>(context);
1.154 paf 362: if(info.length) {
1.271 moko 363: ssize_t written=write(f, info.str, info.length);
1.116 paf 364: if(written<0)
1.271 moko 365: throw Exception("file.write", 0, "write failed: %s (%d)", strerror(errno), errno);
1.275 moko 366: if((size_t)written!=info.length)
1.271 moko 367: throw Exception("file.write", 0, "write failed: %u of %u bytes written", written, info.length);
1.113 paf 368: }
1.96 paf 369: }
1.271 moko 370:
1.96 paf 371: void file_write(
1.250 misha 372: Request_charsets& charsets,
373: const String& file_spec,
374: const char* data,
375: size_t size,
1.126 paf 376: bool as_text,
1.250 misha 377: bool do_append,
378: Charset* asked_charset) {
379:
380: if(as_text && asked_charset){
381: String::C body=String::C(data, size);
382: body=Charset::transcode(body, charsets.source(), *asked_charset);
383: data=body.str;
384: size=body.length;
385: };
386:
1.126 paf 387: File_write_action_info info={data, size};
1.225 misha 388:
1.98 paf 389: file_write_action_under_lock(
1.154 paf 390: file_spec,
1.225 misha 391: "write",
392: file_write_action,
393: &info,
1.154 paf 394: as_text,
395: do_append);
1.30 paf 396: }
397:
1.261 misha 398: static size_t get_dir(char* fname, size_t helper_length){
399: bool dir=false;
400: size_t pos=0;
401: for(pos=helper_length; pos; pos--){
402: char c=fname[pos-1];
403: if(c=='/' || c=='\\'){
404: fname[pos-1]=0;
405: dir=true;
406: } else if(dir) break;
407: }
408: return pos;
409: }
410:
411: static bool entry_readable(char* fname, bool need_dir) {
412: if(need_dir){
413: size_t size=strlen(fname);
414: while(size) {
415: char c=fname[size-1];
416: if(c=='/' || c=='\\')
417: fname[--size]=0;
418: else
419: break;
420: }
421: }
422:
423: struct stat finfo;
424: if(access(fname, R_OK)==0 && entry_exists(fname, &finfo)) {
425: bool is_dir=(finfo.st_mode&S_IFDIR) != 0;
426: return is_dir==need_dir;
427: }
428: return false;
429: }
430:
431: static bool entry_readable(const String& file_spec, bool need_dir) {
432: return entry_readable(file_spec.taint_cstrm(String::L_FILE_SPEC), need_dir);
433: }
434:
1.63 parser 435: // throws nothing! [this is required in file_move & file_delete]
1.277 moko 436: static void rmdir(const String& file_spec, size_t pos_after) {
1.261 misha 437: char* dir_spec=file_spec.taint_cstrm(String::L_FILE_SPEC);
438: size_t length=strlen(dir_spec);
439: while( (length=get_dir(dir_spec, length)) && (length > pos_after) ){
1.274 moko 440: #ifdef _MSC_VER
1.261 misha 441: if(!entry_readable(dir_spec, true))
442: break;
443: DWORD attrs=GetFileAttributes(dir_spec);
444: if(
445: (attrs==INVALID_FILE_ATTRIBUTES)
446: || !(attrs & FILE_ATTRIBUTE_DIRECTORY)
447: || (attrs & FILE_ATTRIBUTE_REPARSE_POINT)
448: )
449: break;
450: #endif
451: if( rmdir(dir_spec) )
452: break;
453: };
1.50 paf 454: }
1.239 misha 455:
1.269 misha 456: bool file_delete(const String& file_spec, bool fail_on_problem, bool keep_empty_dirs) {
1.247 misha 457: const char* fname=file_spec.taint_cstr(String::L_FILE_SPEC);
1.54 parser 458: if(unlink(fname)!=0)
1.164 paf 459: if(fail_on_problem)
1.126 paf 460: throw Exception(errno==EACCES?"file.access":errno==ENOENT?"file.missing":0,
1.93 paf 461: &file_spec,
462: "unlink failed: %s (%d), actual filename '%s'",
1.154 paf 463: strerror(errno), errno, fname);
1.93 paf 464: else
465: return false;
1.50 paf 466:
1.269 misha 467: if(!keep_empty_dirs)
468: rmdir(file_spec, 1);
469:
1.93 paf 470: return true;
1.60 parser 471: }
1.239 misha 472:
1.269 misha 473: void file_move(const String& old_spec, const String& new_spec, bool keep_empty_dirs) {
1.247 misha 474: const char* old_spec_cstr=old_spec.taint_cstr(String::L_FILE_SPEC);
475: const char* new_spec_cstr=new_spec.taint_cstr(String::L_FILE_SPEC);
1.63 parser 476:
1.126 paf 477: create_dir_for_file(new_spec);
1.63 parser 478:
1.60 parser 479: if(rename(old_spec_cstr, new_spec_cstr)!=0)
1.126 paf 480: throw Exception(errno==EACCES?"file.access":errno==ENOENT?"file.missing":0,
1.60 parser 481: &old_spec,
482: "rename failed: %s (%d), actual filename '%s' to '%s'",
1.154 paf 483: strerror(errno), errno, old_spec_cstr, new_spec_cstr);
1.63 parser 484:
1.269 misha 485: if(!keep_empty_dirs)
486: rmdir(old_spec, 1);
1.31 paf 487: }
488:
1.51 paf 489:
1.126 paf 490: bool entry_exists(const char* fname, struct stat *afinfo) {
1.118 paf 491: struct stat lfinfo;
492: bool result=stat(fname, &lfinfo)==0;
493: if(afinfo)
494: *afinfo=lfinfo;
495: return result;
1.119 paf 496: }
497:
498: bool entry_exists(const String& file_spec) {
1.247 misha 499: const char* fname=file_spec.taint_cstr(String::L_FILE_SPEC);
1.126 paf 500: return entry_exists(fname, 0);
1.118 paf 501: }
502:
1.215 paf 503: bool file_exist(const String& file_spec) {
1.126 paf 504: return entry_readable(file_spec, false);
1.51 paf 505: }
1.239 misha 506:
1.215 paf 507: bool dir_exists(const String& file_spec) {
1.126 paf 508: return entry_readable(file_spec, true);
1.65 parser 509: }
1.239 misha 510:
1.215 paf 511: const String* file_exist(const String& path, const String& name) {
1.154 paf 512: String& result=*new String(path);
1.270 moko 513: if(path.last_char() != '/')
514: result << "/";
1.154 paf 515: result << name;
1.215 paf 516: return file_exist(result)?&result:0;
1.43 paf 517: }
1.239 misha 518:
1.43 paf 519: bool file_executable(const String& file_spec) {
1.247 misha 520: return access(file_spec.taint_cstr(String::L_FILE_SPEC), X_OK)==0;
1.44 paf 521: }
522:
1.64 parser 523: bool file_stat(const String& file_spec,
1.229 misha 524: size_t& rsize,
525: time_t& ratime,
526: time_t& rmtime,
527: time_t& rctime,
528: bool fail_on_read_problem) {
1.247 misha 529: const char* fname=file_spec.taint_cstr(String::L_FILE_SPEC);
1.154 paf 530: struct stat finfo;
1.44 paf 531: if(stat(fname, &finfo)!=0)
1.64 parser 532: if(fail_on_read_problem)
1.126 paf 533: throw Exception("file.missing",
1.67 parser 534: &file_spec,
535: "getting file size failed: %s (%d), real filename '%s'",
1.154 paf 536: strerror(errno), errno, fname);
1.64 parser 537: else
538: return false;
1.58 parser 539: rsize=finfo.st_size;
540: ratime=finfo.st_atime;
541: rmtime=finfo.st_mtime;
542: rctime=finfo.st_ctime;
1.64 parser 543: return true;
1.18 paf 544: }
545:
1.278 ! moko 546: /**
! 547: String related functions
! 548: */
! 549:
! 550: bool capitalized(const char* s){
! 551: bool upper=true;
! 552: for(const char* c=s; *c; c++){
! 553: if(*c != (upper ? toupper((unsigned char)*c) : tolower((unsigned char)*c)))
! 554: return false;
! 555: upper=strchr("-_ ", *c) != 0;
! 556: }
! 557: return true;
! 558: }
! 559:
! 560: const char* capitalize(const char* s){
! 561: if(!s || capitalized(s))
! 562: return s;
! 563:
! 564: char* result=pa_strdup(s);
! 565: if(result){
! 566: bool upper=true;
! 567: for(char* c=result; *c; c++){
! 568: *c=upper ? (char)toupper((unsigned char)*c) : (char)tolower((unsigned char)*c);
! 569: upper=strchr("-_ ", *c) != 0;
! 570: }
! 571: }
! 572: return (const char*)result;
! 573: }
! 574:
! 575: void fix_line_breaks(char *str, size_t& length) {
! 576: //_asm int 3;
! 577: const char* const eob=str+length;
! 578: char* dest=str;
! 579: // fix DOS: \r\n -> \n
! 580: // fix Macintosh: \r -> \n
! 581: char* bol=str;
! 582: while(char* eol=(char*)memchr(bol, '\r', eob -bol)) {
! 583: size_t len=eol-bol;
! 584: if(dest!=bol)
! 585: memmove(dest, bol, len);
! 586: dest+=len;
! 587: *dest++='\n';
! 588:
! 589: if(&eol[1]<eob && eol[1]=='\n') { // \r, \n = DOS
! 590: bol=eol+2;
! 591: length--;
! 592: } else // \r, not \n = Macintosh
! 593: bol=eol+1;
! 594: }
! 595: // last piece without \r
! 596: if(dest!=bol)
! 597: memmove(dest, bol, eob-bol);
! 598: str[length]=0; // terminating
! 599: }
! 600:
! 601: /**
! 602: scans for @a delim[default \n] in @a *row_ref,
! 603: @return piece of line before it or end of string, if no @a delim found
! 604: assigns @a *row_ref to point right after delimiter if there were one
! 605: or to zero if no @a delim were found.
! 606: */
! 607:
1.126 paf 608: char* getrow(char* *row_ref, char delim) {
1.229 misha 609: char* result=*row_ref;
610: if(result) {
1.126 paf 611: *row_ref=strchr(result, delim);
1.8 paf 612: if(*row_ref)
613: *((*row_ref)++)=0;
614: else if(!*result)
615: return 0;
1.229 misha 616: }
617: return result;
1.8 paf 618: }
619:
1.126 paf 620: char* lsplit(char* string, char delim) {
1.229 misha 621: if(string) {
1.126 paf 622: char* v=strchr(string, delim);
1.8 paf 623: if(v) {
624: *v=0;
625: return v+1;
626: }
1.229 misha 627: }
628: return 0;
1.8 paf 629: }
630:
1.126 paf 631: char* lsplit(char* *string_ref, char delim) {
1.229 misha 632: char* result=*string_ref;
1.126 paf 633: char* next=lsplit(*string_ref, delim);
1.229 misha 634: *string_ref=next;
635: return result;
1.9 paf 636: }
637:
1.126 paf 638: char* rsplit(char* string, char delim) {
1.229 misha 639: if(string) {
1.126 paf 640: char* v=strrchr(string, delim);
1.18 paf 641: if(v) {
1.9 paf 642: *v=0;
643: return v+1;
644: }
1.229 misha 645: }
646: return NULL;
1.10 paf 647: }
648:
1.229 misha 649:
650: // format: %[flags][width][.precision]type http://msdn.microsoft.com/ru-ru/library/56e442dc(en-us,VS.80).aspx
651: // flags: '-', '+', ' ', '#', '0' http://msdn.microsoft.com/ru-ru/library/8aky45ct(en-us,VS.80).aspx
652: // width, precision: non negative decimal number
653: enum FormatType {
654: FormatInvalid,
655: FormatInt,
656: FormatUInt,
657: FormatDouble
658: };
1.272 moko 659: FormatType format_type(const char* fmt){
1.229 misha 660: enum FormatState {
661: Percent,
662: Flags,
663: Width,
664: Precision,
665: Done
666: } state=Percent;
667:
668: FormatType result=FormatInvalid;
669:
1.272 moko 670: const char* pos=fmt;
1.229 misha 671: while(char c=*(pos++)){
672: switch(state){
673: case Percent:
674: if(c=='%'){
675: state=Flags;
676: } else {
677: return FormatInvalid; // 1st char must be '%' only
678: }
679: break;
680: case Flags:
681: if(strchr("-+ #0", c)!=0){
682: break;
683: }
684: // go to the next step
685: case Width:
686: if(c=='.'){
687: state=Precision;
688: break;
689: }
690: // go to the next step
691: case Precision:
692: if(c>='0' && c<='9'){
693: if(state == Flags) state=Width; // no more flags
694: break;
695: } else if(c=='d' || c=='i'){
696: result=FormatInt;
697: } else if(strchr("feEgG", c)!=0){
698: result=FormatDouble;
699: } else if(strchr("uoxX", c)!=0){
700: result=FormatUInt;
701: } else {
702: return FormatInvalid; // invalid char
703: }
704: state=Done;
705: break;
706: case Done:
707: return FormatInvalid; // no chars allowed after 'type'
708: }
709: }
710: return result;
711: }
712:
713:
1.272 moko 714: const char* format(double value, const char* fmt) {
1.229 misha 715: char local_buf[MAX_NUMBER];
1.235 misha 716: int size=-1;
1.229 misha 717:
718: if(fmt && strlen(fmt)){
719: switch(format_type(fmt)){
720: case FormatDouble:
721: size=snprintf(local_buf, sizeof(local_buf), fmt, value);
722: break;
723: case FormatInt:
724: size=snprintf(local_buf, sizeof(local_buf), fmt, (int)value);
725: break;
726: case FormatUInt:
1.126 paf 727: size=snprintf(local_buf, sizeof(local_buf), fmt, (uint)value);
1.229 misha 728: break;
729: case FormatInvalid:
730: throw Exception(PARSER_RUNTIME,
731: 0,
732: "Incorrect format string '%s' was specified.", fmt);
733: }
734: } else
735: size=snprintf(local_buf, sizeof(local_buf), "%d", (int)value);
736:
737: if(size < 0 || size >= MAX_NUMBER-1){ // on win32 we manually reduce max size while printing
738: throw Exception(PARSER_RUNTIME,
739: 0,
740: "Error occure white executing snprintf with format string '%s'.", fmt);
741: }
742:
1.235 misha 743: return pa_strdup(local_buf, (size_t)size);
1.12 paf 744: }
745:
1.36 paf 746: size_t stdout_write(const void *buf, size_t size) {
1.12 paf 747: #ifdef WIN32
1.187 paf 748: size_t to_write = size;
1.12 paf 749: do{
1.154 paf 750: int chunk_written=fwrite(buf, 1, min((size_t)8*0x400, size), stdout);
1.12 paf 751: if(chunk_written<=0)
752: break;
753: size-=chunk_written;
1.36 paf 754: buf=((const char*)buf)+chunk_written;
1.126 paf 755: } while(size>0);
1.12 paf 756:
1.187 paf 757: return to_write-size;
1.12 paf 758: #else
1.126 paf 759: return fwrite(buf, 1, size, stdout);
1.12 paf 760: #endif
1.2 paf 761: }
1.14 paf 762:
1.229 misha 763: enum EscapeState {
764: EscapeRest,
765: EscapeFirst,
766: EscapeSecond,
767: EscapeUnicode
768: };
769:
1.236 misha 770: // @todo prescan for reduce required size (unescaped sting in 1 byte charset requires less memory usually)
1.258 misha 771: char* unescape_chars(const char* cp, int len, Charset* charset, bool js){
1.236 misha 772: char* s=new(PointerFreeGC) char[len+1]; // must be enough (%uXXXX==6 bytes, max utf-8 char length==6 bytes)
1.230 misha 773: char* dst=s;
1.229 misha 774: EscapeState escapeState=EscapeRest;
775: uint escapedValue=0;
776: int srcPos=0;
1.230 misha 777: short int jsCnt=0;
1.236 misha 778: while(srcPos<len){
1.229 misha 779: uchar c=(uchar)cp[srcPos];
1.258 misha 780: if(c=='%' || (c=='\\' && js)){
1.229 misha 781: escapeState=EscapeFirst;
782: } else {
783: switch(escapeState) {
784: case EscapeRest:
1.258 misha 785: if(!js && c=='+'){
1.230 misha 786: *dst++=' ';
1.229 misha 787: } else {
1.230 misha 788: *dst++=c;
1.229 misha 789: }
790: break;
791: case EscapeFirst:
1.232 misha 792: if(charset && c=='u'){
1.229 misha 793: // escaped unicode value: %u0430
794: jsCnt=0;
795: escapedValue=0;
796: escapeState=EscapeUnicode;
797: } else {
1.231 misha 798: if(isxdigit(c)){
1.229 misha 799: escapedValue=hex_value[c] << 4;
800: escapeState=EscapeSecond;
801: } else {
1.230 misha 802: *dst++=c;
1.229 misha 803: escapeState=EscapeRest;
804: }
805: }
806: break;
807: case EscapeSecond:
1.231 misha 808: if(isxdigit(c)){
1.229 misha 809: escapedValue+=hex_value[c];
1.230 misha 810: *dst++=(char)escapedValue;
1.229 misha 811: }
812: escapeState=EscapeRest;
813: break;
814: case EscapeUnicode:
1.231 misha 815: if(isxdigit(c)){
1.229 misha 816: escapedValue=(escapedValue << 4) + hex_value[c];
817: if(++jsCnt==4){
1.230 misha 818: // transcode utf8 char to client charset (we can lost some chars here)
1.232 misha 819: charset->store_Char((XMLByte*&)dst, (XMLCh)escapedValue, '?');
1.229 misha 820: escapeState=EscapeRest;
821: }
822: } else {
823: // not full unicode value
824: escapeState=EscapeRest;
825: }
826: break;
827: }
828: }
829:
830: srcPos++;
831: }
832:
1.230 misha 833: *dst=0; // zero-termination
1.229 misha 834: return s;
835: }
1.24 paf 836:
1.268 misha 837: char *search_stop(char*& current, char cstop_at) {
838: // sanity check
839: if(!current)
840: return 0;
841:
842: // skip leading WS
843: while(*current==' ' || *current=='\t')
844: current++;
845: if(!*current)
846: return current=0;
847:
848: char *result=current;
849: if(char *pstop_at=strchr(current, cstop_at)) {
850: *pstop_at=0;
851: current=pstop_at+1;
852: } else
853: current=0;
854: return result;
855: }
856:
1.24 paf 857: #ifdef WIN32
1.126 paf 858: void back_slashes_to_slashes(char* s) {
1.24 paf 859: if(s)
860: for(; *s; s++)
861: if(*s=='\\')
1.126 paf 862: *s='/';
1.24 paf 863: }
864: #endif
1.41 paf 865:
1.231 misha 866: bool StrStartFromNC(const char* str, const char* substr, bool equal){
1.41 paf 867: while(true) {
1.231 misha 868: if(!(*substr)){
869: if(!(*str))
1.41 paf 870: return true;
871: else
1.231 misha 872: return !equal;
873: }
874: if(!(*str))
875: return false;
876: if(isalpha((unsigned char)*str)) {
877: if(tolower((unsigned char)*str)!=tolower((unsigned char)*substr))
1.41 paf 878: return false;
1.231 misha 879: } else if((*str) != (*substr))
1.41 paf 880: return false;
1.231 misha 881: str++;
882: substr++;
1.41 paf 883: }
1.57 parser 884: }
885:
1.232 misha 886: size_t strpos(const char *str, const char *substr) {
887: const char *p = strstr(str, substr);
888: return (p==0)?STRING_NOT_FOUND:p-str;
889: }
890:
1.226 misha 891: int remove_crlf(char* start, char* end) {
892: char* from=start;
893: char* to=start;
894: bool skip=false;
895: while(from < end){
896: switch(*from){
897: case '\n':
898: case '\r':
899: case '\t':
900: case ' ':
901: if(!skip){
902: *to=' ';
903: to++;
904: skip=true;
905: }
906: break;
907: default:
908: if(from != to)
909: *to=*from;
910: to++;
911: skip=false;
1.69 parser 912: }
1.226 misha 913: from++;
914: }
915: return to-start;
1.91 paf 916: }
917:
1.278 ! moko 918: const char* hex_string(unsigned char* bytes, size_t size, bool upcase) {
! 919: char *bytes_hex=new(PointerFreeGC) char [size*2/*byte->hh*/+1/*for zero-teminator*/];
! 920: unsigned char *src=bytes;
! 921: unsigned char *end=bytes+size;
! 922: char *dest=bytes_hex;
! 923:
! 924: const char *hex=upcase?"0123456789ABCDEF":"0123456789abcdef";
! 925:
! 926: for(; src<end; src++) {
! 927: *dest++=hex[*src/0x10];
! 928: *dest++=hex[*src%0x10];
! 929: }
! 930: *dest=0;
! 931:
! 932: return bytes_hex;
! 933: }
1.91 paf 934:
935: /// must be last in this file
936: #undef vsnprintf
1.126 paf 937: int __vsnprintf(char* b, size_t s, const char* f, va_list l) {
1.91 paf 938: if(!s)
939: return 0;
940:
941: int r;
942: // note: on win32& maybe somewhere else
943: // vsnprintf do not writes terminating 0 in 'buffer full' case, reducing
944: --s;
1.172 paf 945:
946: // clients do not check for negative 's', feature: ignore such prints
947: if((ssize_t)s<0)
948: return 0;
949:
1.273 moko 950: #ifdef _MSC_VER
1.91 paf 951: /*
952: win32:
953: mk:@MSITStore:C:\Program%20Files\Microsoft%20Visual%20Studio\MSDN\2001APR\1033\vccore.chm::/html/_crt__vsnprintf.2c_._vsnwprintf.htm
954:
1.154 paf 955: if the number of bytes to write exceeds buffer, then count bytes are written and Ö1 is returned
1.91 paf 956: */
1.126 paf 957: r=_vsnprintf(b, s, f, l);
1.91 paf 958: if(r<0)
959: r=s;
960: #else
1.126 paf 961: r=vsnprintf(b, s, f, l);
1.91 paf 962: /*
963: solaris:
964: man vsnprintf
965:
966: The snprintf() function returns the number of characters
967: formatted, that is, the number of characters that would have
968: been written to the buffer if it were large enough. If the
969: value of n is 0 on a call to snprintf(), an unspecified
970: value less than 1 is returned.
971: */
972:
973: if(r<0)
974: r=0;
1.167 paf 975: else if((size_t)r>s)
1.91 paf 976: r=s;
977: #endif
978: b[r]=0;
979: return r;
980: }
981:
1.126 paf 982: int __snprintf(char* b, size_t s, const char* f, ...) {
1.91 paf 983: va_list l;
1.241 misha 984: va_start(l, f);
985: int r=__vsnprintf(b, s, f, l);
986: va_end(l);
1.91 paf 987: return r;
1.178 paf 988: }
989:
990: /* mime64 functions are from libgmime[http://spruce.sourceforge.net/gmime/] lib */
991: /*
992: * Authors: Michael Zucchi <notzed@helixcode.com>
993: * Jeffrey Stedfast <fejj@helixcode.com>
994: *
995: * Copyright 2000 Helix Code, Inc. (www.helixcode.com)
996: *
997: * This program is free software; you can redistribute it and/or modify
998: * it under the terms of the GNU General Public License as published by
999: * the Free Software Foundation; either version 2 of the License, or
1000: * (at your option) any later version.
1001: *
1002: * This program is distributed in the hope that it will be useful,
1003: * but WITHOUT ANY WARRANTY; without even the implied warranty of
1004: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
1005: * GNU General Public License for more details.
1006: *
1007: * You should have received a copy of the GNU General Public License
1008: * along with this program; if not, write to the Free Software
1009: * Foundation, Inc., 59 Temple Street #330, Boston, MA 02111-1307, USA.
1010: *
1011: */
1.271 moko 1012: static const char *base64_alphabet =
1.178 paf 1013: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
1014:
1015: /**
1016: * g_mime_utils_base64_encode_step:
1017: * @in: input stream
1018: * @inlen: length of the input
1019: * @out: output string
1020: * @state: holds the number of bits that are stored in @save
1021: * @save: leftover bits that have not yet been encoded
1022: *
1023: * Base64 encodes a chunk of data. Performs an 'encode step', only
1024: * encodes blocks of 3 characters to the output at a time, saves
1025: * left-over state in state and save (initialise to 0 on first
1026: * invocation).
1027: *
1028: * Returns the number of bytes encoded.
1029: **/
1.252 misha 1030:
1031: #define BASE64_GROUPS_IN_LINE 19
1032:
1.178 paf 1033: static size_t
1034: g_mime_utils_base64_encode_step (const unsigned char *in, size_t inlen, unsigned char *out, int *state, int *save)
1035: {
1.186 paf 1036: register const unsigned char *inptr;
1.178 paf 1037: register unsigned char *outptr;
1038:
1039: if (inlen <= 0)
1040: return 0;
1041:
1042: inptr = in;
1043: outptr = out;
1044:
1045: if (inlen + ((unsigned char *)save)[0] > 2) {
1046: const unsigned char *inend = in + inlen - 2;
1047: register int c1 = 0, c2 = 0, c3 = 0;
1048: register int already;
1049:
1050: already = *state;
1051:
1052: switch (((char *)save)[0]) {
1053: case 1: c1 = ((unsigned char *)save)[1]; goto skip1;
1054: case 2: c1 = ((unsigned char *)save)[1];
1055: c2 = ((unsigned char *)save)[2]; goto skip2;
1056: }
1057:
1058: /* yes, we jump into the loop, no i'm not going to change it, its beautiful! */
1059: while (inptr < inend) {
1060: c1 = *inptr++;
1061: skip1:
1062: c2 = *inptr++;
1063: skip2:
1064: c3 = *inptr++;
1065: *outptr++ = base64_alphabet [c1 >> 2];
1066: *outptr++ = base64_alphabet [(c2 >> 4) | ((c1 & 0x3) << 4)];
1067: *outptr++ = base64_alphabet [((c2 & 0x0f) << 2) | (c3 >> 6)];
1068: *outptr++ = base64_alphabet [c3 & 0x3f];
1069: /* this is a bit ugly ... */
1.252 misha 1070: if ((++already) >= BASE64_GROUPS_IN_LINE) {
1.178 paf 1071: *outptr++ = '\n';
1072: already = 0;
1073: }
1074: }
1075:
1076: ((unsigned char *)save)[0] = 0;
1077: inlen = 2 - (inptr - inend);
1078: *state = already;
1079: }
1080:
1081: //d(printf ("state = %d, inlen = %d\n", (int)((char *)save)[0], inlen));
1082:
1083: if (inlen > 0) {
1084: register char *saveout;
1085:
1086: /* points to the slot for the next char to save */
1087: saveout = & (((char *)save)[1]) + ((char *)save)[0];
1088:
1089: /* inlen can only be 0 1 or 2 */
1090: switch (inlen) {
1091: case 2: *saveout++ = *inptr++;
1092: case 1: *saveout++ = *inptr++;
1093: }
1.216 paf 1094: *(char *)save = *(char *)save+(char)inlen;
1.178 paf 1095: }
1096:
1097: /*d(printf ("mode = %d\nc1 = %c\nc2 = %c\n",
1098: (int)((char *)save)[0],
1099: (int)((char *)save)[1],
1100: (int)((char *)save)[2]));*/
1101:
1102: return (outptr - out);
1103: }
1104:
1105: /**
1106: * g_mime_utils_base64_encode_close:
1107: * @in: input stream
1108: * @inlen: length of the input
1109: * @out: output string
1110: * @state: holds the number of bits that are stored in @save
1111: * @save: leftover bits that have not yet been encoded
1112: *
1113: * Base64 encodes the input stream to the output stream. Call this
1114: * when finished encoding data with g_mime_utils_base64_encode_step to
1115: * flush off the last little bit.
1116: *
1117: * Returns the number of bytes encoded.
1118: **/
1119: static size_t
1120: g_mime_utils_base64_encode_close (const unsigned char *in, size_t inlen, unsigned char *out, int *state, int *save)
1121: {
1122: unsigned char *outptr = out;
1123: int c1, c2;
1124:
1125: if (inlen > 0)
1126: outptr += g_mime_utils_base64_encode_step (in, inlen, outptr, state, save);
1127:
1128: c1 = ((unsigned char *)save)[1];
1129: c2 = ((unsigned char *)save)[2];
1130:
1131: switch (((unsigned char *)save)[0]) {
1132: case 2:
1133: outptr[2] = base64_alphabet [(c2 & 0x0f) << 2];
1134: goto skip;
1135: case 1:
1136: outptr[2] = '=';
1137: skip:
1138: outptr[0] = base64_alphabet [c1 >> 2];
1139: outptr[1] = base64_alphabet [c2 >> 4 | ((c1 & 0x3) << 4)];
1140: outptr[3] = '=';
1141: outptr += 4;
1142: break;
1143: }
1144:
1145: *outptr++ = 0;
1146:
1147: *save = 0;
1148: *state = 0;
1149:
1150: return (outptr - out);
1151: }
1152:
1.210 paf 1153: static unsigned char gmime_base64_rank[256] = {
1.266 misha 1154: 255,255,255,255,255,255,255,255,255,254,254,255,255,254,255,255,
1.210 paf 1155: 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
1.266 misha 1156: 254,255,255,255,255,255,255,255,255,255,255, 62,255,255,255, 63,
1.210 paf 1157: 52, 53, 54, 55, 56, 57, 58, 59, 60, 61,255,255,255, 0,255,255,
1158: 255, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
1159: 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,255,255,255,255,255,
1160: 255, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
1161: 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51,255,255,255,255,255,
1162: 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
1163: 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
1164: 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
1165: 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
1166: 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
1167: 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
1168: 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
1169: 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
1170: };
1171:
1172: /**
1173: * g_mime_utils_base64_decode_step:
1174: * @in: input stream
1175: * @inlen: max length of data to decode
1176: * @out: output stream
1177: * @state: holds the number of bits that are stored in @save
1178: * @save: leftover bits that have not yet been decoded
1.266 misha 1179: * @strict: only base64 and whitespace chars are allowed
1.210 paf 1180: *
1181: * Decodes a chunk of base64 encoded data.
1182: *
1183: * Returns the number of bytes decoded (which have been dumped in @out).
1184: **/
1185: size_t
1.266 misha 1186: g_mime_utils_base64_decode_step(const unsigned char *in, size_t inlen, unsigned char *out, int *state, int *save, bool strict=false)
1.210 paf 1187: {
1.213 paf 1188: const unsigned char *inptr;
1189: unsigned char *outptr;
1.210 paf 1190: const unsigned char *inend;
1.213 paf 1191: int saved;
1.210 paf 1192: unsigned char c;
1193: int i;
1194:
1195: inend = in + inlen;
1196: outptr = out;
1197:
1198: /* convert 4 base64 bytes to 3 normal bytes */
1199: saved = *save;
1200: i = *state;
1201: inptr = in;
1202: while (inptr < inend) {
1203: c = gmime_base64_rank[*inptr++];
1.266 misha 1204: switch(c) {
1205: case 0xff: // non-base64 and non-whitespace chars. not allowed in strict mode
1206: if(strict)
1207: throw Exception(BASE64_FORMAT, 0, "Invalid base64 char on position %d is detected", inptr-in-1);
1208: case 0xfe: // whitespace chars 0x09, 0x0A, 0x0D, 0x20 are allowed in any mode
1209: break;
1210: default:
1211: saved = (saved << 6) | c;
1212: i++;
1213: if (i == 4) {
1214: *outptr++ = (unsigned char)(saved >> 16);
1215: *outptr++ = (unsigned char)(saved >> 8);
1216: *outptr++ = (unsigned char)(saved);
1217: i = 0;
1218: }
1.210 paf 1219: }
1220: }
1221:
1222: *save = saved;
1223: *state = i;
1224:
1225: /* quick scan back for '=' on the end somewhere */
1226: /* fortunately we can drop 1 output char for each trailing = (upto 2) */
1227: i = 2;
1228: while (inptr > in && i) {
1229: inptr--;
1.266 misha 1230: if (gmime_base64_rank[*inptr] <= 0xfe) {
1.210 paf 1231: if (*inptr == '=' && outptr > out)
1232: outptr--;
1233: i--;
1234: }
1235: }
1236:
1237: /* if i != 0 then there is a truncation error! */
1238: return (outptr - out);
1239: }
1240:
1241:
1.239 misha 1242: char* pa_base64_encode(const char *in, size_t in_size){
1.252 misha 1243: size_t new_size = ((in_size / 3 + 1) * 4);
1244: new_size += new_size / (BASE64_GROUPS_IN_LINE * 4)/*new lines*/ + 1/*zero terminator*/;
1245: char* result = new(PointerFreeGC) char[new_size];
1.178 paf 1246: int state=0;
1247: int save=0;
1.183 paf 1248: #ifndef NDEBUG
1249: size_t filled=
1250: #endif
1.251 misha 1251: g_mime_utils_base64_encode_close ((const unsigned char*)in, in_size, (unsigned char*)result, &state, &save);
1252:
1253: //throw Exception(PARSER_RUNTIME, 0, "%d %d %d", in_size, new_size, filled);
1254: assert(filled <= new_size);
1.178 paf 1255:
1256: return result;
1.98 paf 1257: }
1.210 paf 1258:
1.278 ! moko 1259: struct File_base64_action_info {
! 1260: unsigned char** base64;
! 1261: };
1.222 misha 1262:
1263: static void file_base64_file_action(
1.229 misha 1264: struct stat& finfo,
1265: int f,
1266: const String&, const char* /*fname*/, bool,
1267: void *context) {
1.222 misha 1268:
1269: if(finfo.st_size) {
1270: File_base64_action_info& info=*static_cast<File_base64_action_info *>(context);
1271: *info.base64=new(PointerFreeGC) unsigned char[finfo.st_size * 2 + 6];
1272: unsigned char* base64 = *info.base64;
1273: int state=0;
1274: int save=0;
1275: int nCount;
1276: do {
1277: unsigned char buffer[FILE_BUFFER_SIZE];
1278: nCount = file_block_read(f, buffer, sizeof(buffer));
1279: if( nCount ){
1280: size_t filled=g_mime_utils_base64_encode_step ((const unsigned char*)buffer, nCount, base64, &state, &save);
1281: base64+=filled;
1282: }
1283: } while(nCount > 0);
1284: g_mime_utils_base64_encode_close (0, 0, base64, &state, &save);
1285: }
1286: }
1287:
1.278 ! moko 1288: char* pa_base64_encode(const String& file_spec){
! 1289: unsigned char* base64=0;
! 1290: File_base64_action_info info={&base64};
! 1291:
! 1292: file_read_action_under_lock(file_spec,
! 1293: "pa_base64_encode", file_base64_file_action, &info);
! 1294:
! 1295: return (char*)base64;
! 1296: }
! 1297:
1.265 misha 1298: void pa_base64_decode(const char *in, size_t in_size, char*& result, size_t& result_size, bool strict) {
1.264 misha 1299: // every 4 base64 bytes are converted into 3 normal bytes
1300: // not full set (tail) of 4-bytes set is ignored
1301: size_t new_size=in_size/4*3;
1302: result=new(PointerFreeGC) char[new_size+1/*terminator*/];
1303:
1.210 paf 1304: int state=0;
1305: int save=0;
1306: result_size=
1.266 misha 1307: g_mime_utils_base64_decode_step ((const unsigned char*)in, in_size,
1308: (unsigned char*)result, &state, &save, strict);
1.264 misha 1309: assert(result_size <= new_size);
1.211 paf 1310: result[result_size]=0; // for text files
1.265 misha 1311:
1312: if(strict && state!=0)
1.266 misha 1313: throw Exception(BASE64_FORMAT, 0, "Unexpected end of chars");
1.210 paf 1314: }
1.218 misha 1315:
1316:
1.221 misha 1317: int file_block_read(const int f, unsigned char* buffer, const size_t size){
1318: int nCount = read(f, buffer, size);
1319: if (nCount < 0)
1.238 misha 1320: throw Exception("file.read",
1.221 misha 1321: 0,
1322: "read failed: %s (%d)", strerror(errno), errno);
1323: return nCount;
1324: }
1325:
1.278 ! moko 1326: static unsigned long crc32Table[256];
! 1327: static void InitCrc32Table()
! 1328: {
! 1329: if(crc32Table[1] == 0){
! 1330: // This is the official polynomial used by CRC32 in PKZip.
! 1331: // Often times the polynomial shown reversed as 0x04C11DB7.
! 1332: static const unsigned long dwPolynomial = 0xEDB88320;
! 1333:
! 1334: for(int i = 0; i < 256; i++)
! 1335: {
! 1336: unsigned long dwCrc = i;
! 1337: for(int j = 8; j > 0; j--)
! 1338: {
! 1339: if(dwCrc & 1)
! 1340: dwCrc = (dwCrc >> 1) ^ dwPolynomial;
! 1341: else
! 1342: dwCrc >>= 1;
! 1343: }
! 1344: crc32Table[i] = dwCrc;
! 1345: }
! 1346: }
! 1347: }
! 1348:
! 1349: inline void CalcCrc32(const unsigned char byte, unsigned long &crc32)
! 1350: {
! 1351: crc32 = ((crc32) >> 8) ^ crc32Table[(byte) ^ ((crc32) & 0x000000FF)];
! 1352: }
! 1353:
! 1354:
1.239 misha 1355: const unsigned long pa_crc32(const char *in, size_t in_size){
1.218 misha 1356: unsigned long crc32=0xFFFFFFFF;
1.220 misha 1357:
1.240 misha 1358: InitCrc32Table();
1.239 misha 1359: for(size_t i = 0; i<in_size; i++)
1360: CalcCrc32(in[i], crc32);
1.220 misha 1361:
1.218 misha 1362: return ~crc32;
1363: }
1364:
1365: static void file_crc32_file_action(
1.229 misha 1366: struct stat& finfo,
1367: int f,
1368: const String&, const char* /*fname*/, bool,
1.239 misha 1369: void *context) {
1.218 misha 1370: unsigned long& crc32=*static_cast<unsigned long *>(context);
1371: if(finfo.st_size) {
1372: InitCrc32Table();
1.220 misha 1373: int nCount=0;
1.218 misha 1374: do {
1.221 misha 1375: unsigned char buffer[FILE_BUFFER_SIZE];
1376: nCount = file_block_read(f, buffer, sizeof(buffer));
1.220 misha 1377: for(int i = 0; i < nCount; i++) CalcCrc32(buffer[i], crc32);
1378: } while(nCount > 0);
1.218 misha 1379: }
1380: }
1381:
1.278 ! moko 1382: const unsigned long pa_crc32(const String& file_spec){
! 1383: unsigned long crc32=0xFFFFFFFF;
! 1384: file_read_action_under_lock(file_spec, "crc32", file_crc32_file_action, &crc32);
! 1385: return ~crc32;
! 1386: }
! 1387:
! 1388: // content-type: xxx; charset=WE-NEED-THIS
! 1389: // content-type: xxx; charset="WE-NEED-THIS"
! 1390: // content-type: xxx; charset="WE-NEED-THIS";
! 1391: Charset* detect_charset(const char* content_type){
! 1392: if(content_type){
! 1393: char* CONTENT_TYPE=pa_strdup(content_type);
! 1394:
! 1395: for(char *p=CONTENT_TYPE; *p; p++)
! 1396: *p=(char)toupper((unsigned char)*p);
! 1397:
! 1398: if(const char* begin=strstr(CONTENT_TYPE, "CHARSET=")){
! 1399: begin+=8; // skip "CHARSET="
! 1400: char* end=0;
! 1401: if(*begin && (*begin=='"' || *begin =='\'')){
! 1402: char quote=*begin;
! 1403: begin++;
! 1404: end=(char*)strchr(begin, quote);
! 1405: }
! 1406: if(!end)
! 1407: end=(char*)strchr(begin, ';');
! 1408:
! 1409: if(end)
! 1410: *end=0; // terminator
! 1411:
! 1412: return *begin?&charsets.get(begin):0;
! 1413: }
! 1414: }
! 1415: return 0;
! 1416: }
! 1417:
! 1418:
! 1419: static bool isLeap(int year) {
! 1420: return !(
! 1421: (year % 4) || ((year % 400) && !(year % 100))
! 1422: );
! 1423: }
! 1424:
! 1425: int getMonthDays(int year, int month) {
! 1426: static int monthDays[]={
! 1427: 31,
! 1428: 28,
! 1429: 31,
! 1430: 30,
! 1431: 31,
! 1432: 30,
! 1433: 31,
! 1434: 31,
! 1435: 30,
! 1436: 31,
! 1437: 30,
! 1438: 31
! 1439: };
! 1440: return (month == 1 /* january -- 0 */ && isLeap(year)) ? 29 : monthDays[month];
! 1441: }
! 1442:
! 1443: String::C date_gmt_string(tm* tms) {
! 1444: /// http://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3
! 1445: static const char month_names[12][4]={
! 1446: "Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"};
! 1447: static const char days[7][4]={
! 1448: "Sun","Mon","Tue","Wed","Thu","Fri","Sat"};
! 1449:
! 1450: char *buf=new(PointerFreeGC) char[MAX_STRING];
! 1451: return String::C(buf,
! 1452: snprintf(buf, MAX_STRING, "%s, %.2d %s %.4d %.2d:%.2d:%.2d GMT",
! 1453: days[tms->tm_wday],
! 1454: tms->tm_mday,month_names[tms->tm_mon],tms->tm_year+1900,
! 1455: tms->tm_hour,tms->tm_min,tms->tm_sec));
! 1456: }
E-mail:
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to pa_common.C CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / main