Annotation of parser3/src/main/pa_string.C, revision 1.172.2.21.2.38
1.45 paf 1: /** @file
1.172.2.21.2. (paf 2:): Parser: string class. @see untalength_t.C.
1.46 paf 3:
1.172.2.11 paf 4: Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com)
1.138 paf 5: Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru)
1.164 paf 6: */
1.46 paf 7:
1.172.2.21.2. 8(paf 8:3): static const char* IDENT_STRING_C="$Date: 2003/04/08 12:47:31 $";
1.4 paf 9:
1.70 paf 10: #include "pcre.h"
11:
1.12 paf 12: #include "pa_string.h"
1.22 paf 13: #include "pa_exception.h"
1.61 paf 14: #include "pa_table.h"
1.101 parser 15: #include "pa_dictionary.h"
1.132 paf 16: #include "pa_charset.h"
1.60 paf 17:
1.172.2.2 paf 18: // helpers
1.139 paf 19:
1.172.2.2 paf 20: /// String::match uses this as replace & global search table columns
1.139 paf 21:
1.172.2.4 paf 22: const int MAX_MATCH_GROUPS=100;
23:
1.172.2.14 paf 24: class String_match_table_template_columns: public ArrayString {
1.172.2.2 paf 25: public:
1.172.2.4 paf 26: String_match_table_template_columns() {
1.172.2.21.2. (paf 27:): *this+=new String("prematch");
28:): *this+=new String("match");
29:): *this+=new String("postmatch");
1.172.2.4 paf 30: for(int i=0; i<MAX_MATCH_GROUPS; i++) {
1.172.2.21.2. 5(paf 31:3): *this+=new String(StringBody::Format(1+i), String::L_CLEAN);
1.172.2.2 paf 32: }
1.172.2.21 paf 33: }
1.172.2.4 paf 34: };
35:
1.172.2.21.2. (paf 36:): Table string_match_table_template(new String_match_table_template_columns);
1.172.2.2 paf 37:
1.172.2.21.2. (paf 38:): // String::ArrayFragment methods
39:):
3(paf 40:3): void String::ArrayFragment::append_positions(const ArrayFragment& src,
41:3): size_t substr_begin, size_t substr_end) {
1(paf 42:3): if(substr_begin==substr_end)
3(paf 43:3): return;
(paf 44:):
8(paf 45:3): // FILE *err=fopen("append.log", "wt");
6(paf 46:3):
1(paf 47:3): size_t fragment_begin=0;
(paf 48:): size_t fragment_end;
1(paf 49:3): for(Array_iterator<element_type> i(src); ; fragment_begin=fragment_end) {
6(paf 50:3): const Fragment fragment=i.next();
1(paf 51:3): fragment_end=fragment_begin+fragment.length;
8(paf 52:3): //fprintf(err, "1end=%u\n", fragment_end);fflush(err);
(paf 53:):
6(paf 54:3): // not reached fragments which may include 'substr'?
55:3): if(!(substr_begin>=fragment_begin && substr_begin<=fragment_end))
56:3): continue;
57:3):
(paf 58:): // found first fragment including piece of 'substr'
6(paf 59:3): if(substr_end<=fragment_end) // fits into first fragment?
60:3): *this+=Fragment(fragment.lang, substr_end-substr_begin);
61:3): else { // spans more then one fragment
62:3): *this+=Fragment(fragment.lang, fragment_end-substr_begin);
63:3): while(true) {
64:3): const Fragment fragment=i.next();
65:3): fragment_end=(fragment_begin=fragment_end)+fragment.length;
8(paf 66:3): //fprintf(err, "2end=%u\n", fragment_end);fflush(err);
6(paf 67:3):
68:3): if(substr_end>fragment_end) // are there still more?
69:3): append(Fragment(fragment.lang, fragment.length)); // appending whole fragment
70:3): else { // no, it was last
71:3): append(Fragment(fragment.lang, substr_end-fragment_begin));
8(paf 72:3): //fclose(err);
6(paf 73:3): return;
74:3): }
(paf 75:): }
76:): }
77:):
78:): break;
6(paf 79:3): }
8(paf 80:3): //fclose(err);
(paf 81:): }
82:):
8(paf 83:3): // StringBody methods
5(paf 84:3):
9(paf 85:3): StringBody StringBody::Format(int value) {
8(paf 86:3): char local[MAX_NUMBER];
9(paf 87:3): size_t length=snprintf(local, MAX_NUMBER, "%d", value);
88:3): return StringBody(pa_strdup(local, length), length);
8(paf 89:3): }
5(paf 90:3):
3(paf 91:3): static int CORD_batched_iter_fn_generic_hash_code(char c, void * client_data) {
92:3): uint& result=*static_cast<uint*>(client_data);
93:3): generic_hash_code(result, c);
94:3): return 0;
95:3): }
5(paf 96:3): static int CORD_batched_iter_fn_generic_hash_code(const char* s, void * client_data) {
97:3): uint& result=*static_cast<uint*>(client_data);
98:3): generic_hash_code(result, s);
99:3): return 0;
100:3): };
7(paf 101:3): uint StringBody::hash_code() const {
5(paf 102:3): uint result=0;
3(paf 103:3): CORD_iter5(body, 0,
104:3): CORD_batched_iter_fn_generic_hash_code,
105:3): CORD_batched_iter_fn_generic_hash_code, &result);
5(paf 106:3): return result;
107:3): }
108:3):
(paf 109:): // String methods
1.172.2.2 paf 110:
1.172.2.21.2. 6(paf 111:3): String::String(const char* cstr, size_t helper_length, bool tainted): body(CORD_EMPTY) {
112:3): append_help_length(cstr, helper_length, tainted?L_TAINTED:L_CLEAN);
1.1 paf 113: }
1.172.2.21.2. 8(paf 114:3): String::String(const String::C cstr, bool tainted): body(CORD_EMPTY) {
115:3): append_know_length(cstr.str, cstr.length, tainted?L_TAINTED:L_CLEAN);
7(paf 116:3): }
1.140 paf 117:
1.172.2.21.2. 0(paf 118:3): String::String(const String& src): body(src.body) {
119:3): fragments.append(src.fragments);
8(paf 120:3): ASSERT_STRING_INVARIANT(*this);
0(paf 121:3): }
1.28 paf 122:
1.172.2.21.2. 7(paf 123:3): String& String::append_know_length(const char* str, size_t known_length, Language lang) {
124:3): body.append_know_length(str, known_length);
125:3): fragments+=Fragment(lang, known_length);
126:3):
8(paf 127:3): ASSERT_STRING_INVARIANT(*this);
7(paf 128:3): return *this;
129:3): }
4(paf 130:3): String& String::append_help_length(const char* str, size_t helper_length, Language lang) {
3(paf 131:3): if(!str)
1.9 paf 132: return *this;
1.172.2.21.2. 6(paf 133:3): size_t known_length=helper_length?helper_length:strlen(str);
134:3): if(!known_length)
1.9 paf 135: return *this;
1.122 paf 136:
1.172.2.21.2. 7(paf 137:3): return append_know_length(str, known_length, lang);
1.1 paf 138: }
1.172.2.21.2. 6(paf 139:3): String& String::append_strdup(const char* str, size_t helper_length, Language lang) {
140:3): size_t known_length=helper_length?helper_length:strlen(str);
141:3): if(!known_length)
142:3): return *this;
143:3):
144:3): body.append_strdup_know_length(str, known_length);
145:3): fragments+=Fragment(lang, known_length);
4(paf 146:3):
8(paf 147:3): ASSERT_STRING_INVARIANT(*this);
4(paf 148:3): return *this;
149:3): }
1.1 paf 150:
1.172.2.21.2. 1(paf 151:3): /// @todo check in doc: whether it documents NOW bad situation "abc".mid(-1, 3) =were?="ab"
8(paf 152:3): String& String::mid(size_t substr_begin, size_t substr_end) const {
(paf 153:): String& result=*new String;
1.33 paf 154:
1.172.2.21.2. 1(paf 155:3): size_t self_length=length();
6(paf 156:3): substr_begin=min(substr_begin, self_length);
1(paf 157:3): substr_end=min(max(substr_end, substr_begin), self_length);
158:3): if(substr_begin==substr_end)
(paf 159:): return result;
1.52 paf 160:
1.172.2.21.2. (paf 161:): // first: letters themselves
7(paf 162:3): result.body=body.mid(substr_begin, substr_end-substr_begin);
1.46 paf 163:
1.172.2.21.2. (paf 164:): // next: their langs
3(paf 165:3): result.fragments.append_positions(fragments, substr_begin, substr_end);
1.53 paf 166:
1.172.2.21.2. 5(paf 167:3): // SAPI::log("piece of '%s' from %d to %d is '%s'",
1(paf 168:3): //cstr(), substr_begin, substr_end, result.cstr());
8(paf 169:3): ASSERT_STRING_INVARIANT(result);
1.53 paf 170: return result;
1.54 paf 171: }
172:
1.172.2.21.2. 7(paf 173:3): size_t String::pos(const StringBody substr,
5(paf 174:3): size_t this_offset, Language lang) const {
(paf 175:): // first: letters themselves
2(paf 176:3): size_t substr_begin=body.pos(substr, this_offset);
1(paf 177:3): if(substr_begin==CORD_NOT_FOUND)
(paf 178:): return STRING_NOT_FOUND;
179:):
180:): // next: check the lang when specified
181:):
5(paf 182:3): if(lang==L_UNSPECIFIED) // ignore lang?
1(paf 183:3): return substr_begin;
(paf 184:):
185:): // substr must be in one fragment, and fragments' lang must = lang
7(paf 186:3): size_t substr_end=substr_begin+substr.length();
1(paf 187:3): size_t fragment_begin=0;
(paf 188:): size_t fragment_end;
1(paf 189:3): for(Array_iterator<ArrayFragment::element_type> i(fragments); i.has_next(); fragment_begin=fragment_end) {
3(paf 190:3): const Fragment fragment=i.next();
1(paf 191:3): fragment_end=fragment_begin+fragment.length;
(paf 192:):
1(paf 193:3): if(substr_begin<fragment_begin) // not reached fragments which may include 'result'?
(paf 194:): continue;
2(paf 195:3): if(substr_begin>=fragment_end) // begin of substr OUT of current fragment?
196:3): continue;
(paf 197:):
198:): if(substr_end>fragment_end) // end of substr OUT of current fragment?
2(paf 199:3): throw Exception(0, // (*) see below
200:3): this,
201:3): "searching for '%s' starting from %ud problem: found begin in one fragment, but end in another",
7(paf 202:3): substr.cstr(), this_offset);
(paf 203:):
4(paf 204:3): if(fragment.lang<=lang)
2(paf 205:3): return substr_begin;
206:3): else { // bad lang...
207:3): /// WARNING: this possibly skips assert (*), but it's fast
208:3): substr_begin=body.pos(substr, fragment_end/*...search AFTER for more*/);
209:3): if(substr_begin==CORD_NOT_FOUND)
210:3): return STRING_NOT_FOUND;
211:3):
7(paf 212:3): size_t substr_end=substr_begin+substr.length();
2(paf 213:3): // and continuing with next fragment
214:3): }
(paf 215:): }
216:):
217:): return STRING_NOT_FOUND;
1.58 paf 218: }
219:
1.172.2.21.2. (paf 220:): size_t String::pos(const String& substr,
5(paf 221:3): size_t this_offset, Language lang) const {
(paf 222:): return pos(substr.body, this_offset, lang);
1.60 paf 223: }
224:
1.172.2.14 paf 225: void String::split(ArrayString& result,
1.172.2.21.2. (paf 226:): size_t& pos_after,
227:): const char* delim,
2(paf 228:3): Language lang, int limit) const {
(paf 229:): size_t self_length=length();
230:): if(size_t delim_length=strlen(delim)) {
1.60 paf 231: int pos_before;
232: // while we have 'delim'...
1.172.2.21.2. (paf 233:): for(; (pos_before=pos(delim, pos_after, lang))>=0 && limit; limit--) {
234:): result+=&mid(pos_after, pos_before);
235:): pos_after=pos_before+delim_length;
1.60 paf 236: }
237: // last piece
1.172.2.21.2. (paf 238:): if(pos_after<self_length && limit) {
239:): result+=&mid(pos_after, self_length);
240:): pos_after=self_length;
1.60 paf 241: }
242: } else { // empty delim
1.172.2.21.2. (paf 243:): result+=this;
244:): pos_after+=self_length;
1.60 paf 245: }
246: }
247:
1.172.2.14 paf 248: void String::split(ArrayString& result,
1.172.2.21.2. (paf 249:): size_t& pos_after,
5(paf 250:3): const String& delim, Language lang,
(paf 251:): int limit) const {
5(paf 252:3): if(!delim.is_empty()) {
1.60 paf 253: int pos_before;
254: // while we have 'delim'...
255: for(; (pos_before=pos(delim, pos_after, lang))>=0 && limit; limit--) {
1.172.2.21.2. (paf 256:): result+=&mid(pos_after, pos_before);
257:): pos_after=pos_before+delim.length();
1.60 paf 258: }
259: // last piece
1.172.2.21.2. (paf 260:): if(pos_after<length() && limit) {
261:): result+=&mid(pos_after, length());
262:): pos_after=length();
1.60 paf 263: }
264: } else { // empty delim
1.172.2.21.2. (paf 265:): result+=this;
266:): pos_after+=length();
1.60 paf 267: }
1.61 paf 268: }
269:
1.172.2.21.2. 2(paf 270:3): static void regex_options(const String* options, int *result, bool& need_pre_post_match){
1.63 paf 271: struct Regex_option {
1.172.2.11 paf 272: const char* keyL;
273: const char* keyU;
1.63 paf 274: int clear, set;
275: int *result;
1.154 paf 276: bool *flag;
1.63 paf 277: } regex_option[]={
1.153 paf 278: {"i", "I", 0, PCRE_CASELESS, result}, // a=A
279: {"s", "S", 0, PCRE_DOTALL, result}, // \n\n$ [default]
280: {"x", "U", 0, PCRE_EXTENDED, result}, // whitespace in regex ignored
281: {"m", "M", PCRE_DOTALL, PCRE_MULTILINE, result}, // ^aaa\n$^bbb\n$
282: {"g", "G", 0, true, result+1}, // many rows
1.154 paf 283: {"'", 0, 0, 0, 0, &need_pre_post_match},
284: {0}
1.63 paf 285: };
1.171 paf 286: result[0]=PCRE_EXTRA | PCRE_DOTALL | PCRE_DOLLAR_ENDONLY;
1.63 paf 287: result[1]=0;
288:
1.172.2.21.2. 2(paf 289:3): if(options && !options->is_empty())
1.153 paf 290: for(Regex_option *o=regex_option; o->keyL; o++)
1.172.2.21.2. 2(paf 291:3): if(options->pos(o->keyL)>=0
292:3): || (o->keyU && options->pos(o->keyU)>=0)) {
1.154 paf 293: if(o->flag)
294: *o->flag=true;
295: else { // result
296: *o->result &= ~o->clear;
297: *o->result |= o->set;
298: }
1.63 paf 299: }
300: }
301:
1.172.2.21.2. (paf 302:): Table* String::match(Charset& source_charset,
1.172.2.4 paf 303: const String& regexp,
1.172.2.21.2. 2(paf 304:3): const String* options,
1.172.2.4 paf 305: Row_action row_action, void *info,
1.172.2.20 paf 306: bool& just_matched) const {
1.172.2.21.2. 5(paf 307:3): if(regexp.is_empty())
(paf 308:): throw Exception(0,
309:): 0,
1.73 paf 310: "regexp is empty");
1.154 paf 311:
1.172.2.21.2. (paf 312:): const char* pattern=regexp.cstr();
1.172.2.11 paf 313: const char* errptr;
1.62 paf 314: int erroffset;
1.172.2.21.2. (paf 315:): bool need_pre_post_match=false;
7(paf 316:3): int option_bits[2]={0}; regex_options(options, option_bits, need_pre_post_match);
1.172.2.20 paf 317: bool global=option_bits[1]!=0;
1.172.2.21.2. (paf 318:): pcre *code=pcre_compile(pattern, option_bits[0],
1.62 paf 319: &errptr, &erroffset,
1.172.2.1 paf 320: source_charset.pcre_tables);
1.62 paf 321:
1.67 paf 322: if(!code)
1.172.2.21.2. (paf 323:): throw Exception(0,
324:): ®exp.mid(erroffset, regexp.length()),
1.74 paf 325: "regular expression syntax error - %s", errptr);
1.62 paf 326:
1.172.2.20 paf 327: int subpatterns=pcre_info(code, 0, 0);
328: if(subpatterns<0) {
1.100 parser 329: pcre_free(code);
1.149 paf 330: throw Exception(0,
1.172.2.21.2. (paf 331:): ®exp,
1.76 paf 332: "pcre_info error (%d)",
1.172.2.20 paf 333: subpatterns);
1.63 paf 334: }
335:
1.172.2.21.2. (paf 336:): const char* subject=cstr();
337:): size_t subject_length=strlen(subject);
338:): const int oveclength=(1/*match*/+MAX_MATCH_GROUPS)*3;
339:): int ovector[oveclength];
1.155 paf 340:
341: // create table
1.172.2.21.2. 1(paf 342:3): Table& table=*new Table(string_match_table_template);
1.63 paf 343:
1.64 paf 344: int exec_option_bits=0;
1.154 paf 345: int prestart=0;
346: int poststart=0;
1.172.2.21.2. (paf 347:): int postfinish=length();
1.63 paf 348: while(true) {
349: int exec_substrings=pcre_exec(code, 0,
1.172.2.21.2. (paf 350:): subject, subject_length, prestart,
351:): exec_option_bits, ovector, oveclength);
1.63 paf 352:
353: if(exec_substrings==PCRE_ERROR_NOMATCH) {
1.100 parser 354: pcre_free(code);
1.172.2.21.2. (paf 355:): row_action(table, 0/*last time, no raw*/, 0, 0, poststart, postfinish, info);
1.172.2.20 paf 356: if(global || subpatterns)
1.172.2.21.2. 2(paf 357:3): return &table; // global or with subpatterns=true+result
1.172.2.20 paf 358: else {
1.172.2.21.2. (paf 359:): just_matched=false; return 0; // not global=no result
1.172.2.20 paf 360: }
1.63 paf 361: }
362:
363: if(exec_substrings<0) {
1.100 parser 364: pcre_free(code);
1.172.2.21.2. (paf 365:): throw Exception(0,
366:): ®exp,
1.76 paf 367: "regular expression execute error (%d)",
1.63 paf 368: exec_substrings);
369: }
370:
1.154 paf 371: int prefinish=ovector[0];
372: poststart=ovector[1];
1.172.2.21.2. (paf 373:): ArrayString* row=new ArrayString;
1.172.2.4 paf 374: if(need_pre_post_match) {
1.172.2.21.2. (paf 375:): *row+=&mid(0, prefinish); // .prematch column value
376:): *row+=&mid(prefinish, poststart); // .match
377:): *row+=&mid(poststart, postfinish); // .postmatch
1.172.2.4 paf 378: } else {
1.172.2.21.2. (paf 379:): *row+=0; // .prematch column value
380:): *row+=0; // .match
381:): *row+=0; // .postmatch
1.172.2.4 paf 382: }
1.63 paf 383:
384: for(int i=1; i<exec_substrings; i++) {
1.69 paf 385: // -1:-1 case handled peacefully by mid() itself
1.172.2.21.2. (paf 386:): *row+=&mid(ovector[i*2+0], ovector[i*2+1]); // .i column value
1.63 paf 387: }
388:
1.172.2.20 paf 389: row_action(table, row, prestart, prefinish, poststart, postfinish, info);
1.63 paf 390:
1.172.2.20 paf 391: if(!global || prestart==poststart) { // not global | going to hang
1.100 parser 392: pcre_free(code);
1.172.2.21.2. (paf 393:): row_action(table, 0/*last time, no row*/, 0, 0, poststart, postfinish, info);
2(paf 394:3): return &table;
1.63 paf 395: }
1.154 paf 396: prestart=poststart;
1.63 paf 397:
398: /*
399: if(option_bits[0] & PCRE_MULTILINE)
1.64 paf 400: exec_option_bits|=PCRE_NOTBOL; // start of subject+startoffset not BOL
1.63 paf 401: */
402: }
1.82 parser 403: }
404:
1.172.2.21.2. 0(paf 405:3): String& String::change_case(Charset& source_charset, Change_case_kind kind) const {
(paf 406:): String& result=*new String();
0(paf 407:3): if(is_empty())
408:3): return result;
1.172.2.4 paf 409:
1.172.2.1 paf 410: const unsigned char *tables=source_charset.pcre_tables;
1.82 parser 411:
412: const unsigned char *a;
413: const unsigned char *b;
414: switch(kind) {
415: case CC_UPPER:
416: a=tables+lcc_offset;
417: b=tables+fcc_offset;
418: break;
419: case CC_LOWER:
420: a=tables+lcc_offset;
421: b=0;
422: break;
423: default:
1.172.2.21.2. (paf 424:): throw Exception(0,
425:): this,
1.82 parser 426: "unknown change case kind #%d",
427: static_cast<int>(kind)); // never
428: a=b=0; // calm, compiler
429: break; // never
430: }
431:
1.172.2.21.2. (paf 432:): char* new_cstr=cstrm();
433:): char *dest=new_cstr;
434:): unsigned char index;
435:): for(const char* current=new_cstr; index=(unsigned char)*current; current++) {
436:): unsigned char c=a[index];
437:): if(b)
438:): c=b[c];
1.82 parser 439:
1.172.2.21.2. (paf 440:): *dest++=(char)c;
441:): }
442:): result.body=new_cstr;
3(paf 443:3): result.fragments.append(fragments);
1.89 parser 444:
1.101 parser 445: return result;
446: }
447:
1.172.2.21.2. (paf 448:): const String& String::replace(const Dictionary& dict) const {
449:): String& result=*new String();
450:): const char* old_cstr=cstr();
1(paf 451:3): const char* prematch_begin=old_cstr;
(paf 452:):
1(paf 453:3): const char* current=old_cstr;
454:3): while(*current) {
455:3): if(Table::element_type row=dict.first_that_begins(current)) {
(paf 456:): // prematch
1(paf 457:3): if(size_t prematch_length=current-prematch_begin) {
6(paf 458:3): result.body.append_strdup_know_length(prematch_begin, prematch_length);
4(paf 459:3): result.fragments.append_positions(fragments, prematch_begin-old_cstr, current-old_cstr);
1.101 parser 460: }
461:
1.172.2.21.2. (paf 462:): // match
463:):
464:): const String* a=row->get(0);
1(paf 465:3): // skip 'a' in 'current'; move prematch_begin
466:3): current+=a->length(); prematch_begin=current;
1.170 paf 467:
1.172.2.21.2. (paf 468:): if(row->count()>1) { // are there any b?
469:): const String* b=row->get(1);
6(paf 470:3): result<<*b;
(paf 471:): }
472:): } else // simply advance
473:): current++;
474:): }
1.156 paf 475:
1.172.2.21.2. (paf 476:): // postmatch
3(paf 477:3): if(size_t postmatch_length=current-prematch_begin) {
6(paf 478:3): result.body.append_strdup_know_length(prematch_begin, postmatch_length);
4(paf 479:3): result.fragments.append_positions(fragments, prematch_begin-old_cstr, current-old_cstr);
(paf 480:): }
1.156 paf 481:
1.172.2.21.2. 8(paf 482:3): ASSERT_STRING_INVARIANT(result);
1.89 parser 483: return result;
484: }
485:
1.172.2.21.2. (paf 486:): double String::as_double() const {
1.89 parser 487: double result;
1.172.2.21.2. (paf 488:): const char *str=cstr();
489:):
490:): while(*str && isspace(*str))
491:): str++;
492:): if(!*str)
1.162 paf 493: return 0;
1.161 paf 494:
1.102 parser 495: char *error_pos;
1.89 parser 496: // 0xABC
1.172.2.21.2. (paf 497:): if(str[0]=='0')
498:): if(str[1]=='x' || str[1]=='X')
499:): result=(double)(unsigned long)strtol(str, &error_pos, 0);
1.99 parser 500: else
1.172.2.21.2. (paf 501:): result=(double)strtod(str+1/*skip leading 0*/, &error_pos);
1.89 parser 502: else
1.172.2.21.2. (paf 503:): result=(double)strtod(str, &error_pos);
1.89 parser 504:
1.159 paf 505: while(char c=*error_pos++)
506: if(!isspace(c))
507: throw Exception("number.format",
1.172.2.21.2. (paf 508:): this,
1.159 paf 509: "invalid number (double)");
1.89 parser 510:
511: return result;
512: }
1.172.2.21.2. (paf 513:): int String::as_int() const {
1.89 parser 514: int result;
1.172.2.21.2. (paf 515:): const char *str=cstr();
516:):
517:): while(*str && isspace(*str))
518:): str++;
519:): if(!*str)
1.162 paf 520: return 0;
1.161 paf 521:
1.102 parser 522: char *error_pos;
1.89 parser 523: // 0xABC
1.172.2.21.2. (paf 524:): if(str[0]=='0')
525:): if(str[1]=='x' || str[1]=='X')
526:): result=(int)(unsigned long)strtol(str, &error_pos, 0);
1.99 parser 527: else
1.172.2.21.2. (paf 528:): result=(int)strtol(str+1/*skip leading 0*/, &error_pos, 0);
1.89 parser 529: else
1.172.2.21.2. (paf 530:): result=(int)strtol(str, &error_pos, 0);
1.89 parser 531:
1.159 paf 532: while(char c=*error_pos++)
533: if(!isspace(c))
534: throw Exception("number.format",
1.172.2.21.2. (paf 535:): this,
1.159 paf 536: "invalid number (int)");
1.82 parser 537:
538: return result;
1.61 paf 539: }
1.113 parser 540:
1.172.2.4 paf 541: inline void uint2uchars(uint word, uchar *bytes) {
542: bytes[0]=word&0xFF;
543: bytes[1]=(word>>8)&0xFF;
544: bytes[2]=(word>>16)&0xFF;
545: bytes[3]=(word>>24)&0xFF;
546: }
547: inline uint uchars2uint(uchar *bytes) {
548: return bytes[3]<<24
549: | bytes[2]<<16
550: | bytes[1]<<8
551: | bytes[0];
552: }
553:
1.172.2.21.2. 7(paf 554:3): static int serialize_body_piece(const char* s, char** cur) {
(paf 555:): size_t length=strlen(s);
7(paf 556:3): memcpy(*cur, s, length); *cur+=length;
(paf 557:): return 0;
558:): };
7(paf 559:3): String::Cm String::serialize(size_t prolog_length) const {
(paf 560:): size_t buf_length=
561:): prolog_length
5(paf 562:3): +fragments.count()*(sizeof(Language)+sizeof(size_t))
(paf 563:): +length();
7(paf 564:3): String::Cm result(new(PointerFreeGC) char[buf_length], buf_length);
(paf 565:):
566:): // 1: prolog
567:): char *cur=result.str+prolog_length;
568:):
569:):
570:): // 2: fragments.count
571:): size_t fragments_count=fragments.count();
572:): memcpy(cur, &fragments_count, sizeof(fragments_count)); cur+=sizeof(fragments_count);
1.113 parser 573:
1.172.2.21.2. (paf 574:): // 3: lang info
575:): for(Array_iterator<ArrayFragment::element_type> i(fragments); i.has_next(); ) {
3(paf 576:3): const Fragment fragment=i.next();
1.123 paf 577: // lang
1.172.2.21.2. (paf 578:): memcpy(cur, &fragment.lang, sizeof(fragment.lang)); cur+=sizeof(fragment.lang);
579:): // length
580:): memcpy(cur, &fragment.length, sizeof(fragment.length)); cur+=sizeof(fragment.length);
581:): }
582:):
583:): // 4: letters
7(paf 584:3): body.for_each(serialize_body_piece, &cur);
(paf 585:):
586:): return result;
1.113 parser 587: }
1.172.2.21.2. 9(paf 588:3): bool String::deserialize(size_t prolog_length, void *buf, size_t buf_length) {
(paf 589:): if(buf_length<=prolog_length)
1.148 paf 590: return false;
1.172.2.21.2. (paf 591:): buf_length-=prolog_length;
1.113 parser 592:
1.172.2.21.2. (paf 593:): // 1: prolog
594:): const char* cur=(const char* )buf+prolog_length;
1.148 paf 595:
1.172.2.21.2. (paf 596:): // 2: fragments.count
597:): if(buf_length<sizeof(size_t)) // fragments.count don't fit?
598:): return false;
599:): size_t fragments_count=*reinterpret_cast<const size_t*>(cur); cur+=sizeof(size_t);
600:): buf_length-=sizeof(size_t);
6(paf 601:3):
602:3): if(fragments_count) {
603:3): // 3: lang info
604:3): size_t total_length=0;
605:3): for(size_t f=0; f<fragments_count; f++) {
606:3): size_t piece_length=sizeof(Language)+sizeof(size_t);
607:3): if(buf_length<piece_length) // lang+length
608:3): return false;
609:3):
610:3): Language lang=*reinterpret_cast<const Language *>(cur); cur+=sizeof(Language);
611:3): size_t fragment_length=*reinterpret_cast<const size_t*>(cur); cur+=sizeof(size_t);
612:3): fragments+=Fragment(lang, fragment_length);
613:3): total_length+=fragment_length;
1.128 paf 614:
1.172.2.21.2. 6(paf 615:3): buf_length-=piece_length;
616:3): }
1.148 paf 617:
1.172.2.21.2. 6(paf 618:3): // 4: letters
619:3): if(buf_length!=total_length)
620:3): return false;
1.113 parser 621:
1.172.2.21.2. 6(paf 622:3): body=StringBody(cur, buf_length);
1.113 parser 623: }
1.172.2.21.2. (paf 624:):
8(paf 625:3): ASSERT_STRING_INVARIANT(*this);
1.148 paf 626: return true;
1.113 parser 627: }
E-mail:
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to pa_string.C CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / main