Annotation of parser3/src/main/pa_string.C, revision 1.224
1.45 paf 1: /** @file
1.174 paf 2: Parser: string class. @see untalength_t.C.
1.46 paf 3:
1.219 misha 4: Copyright (c) 2001-2009 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.224 ! misha 8: static const char * const IDENT_STRING_C="$Date: 2009-04-28 04:53:26 $";
1.70 paf 9:
1.12 paf 10: #include "pa_string.h"
1.22 paf 11: #include "pa_exception.h"
1.61 paf 12: #include "pa_table.h"
1.101 parser 13: #include "pa_dictionary.h"
1.132 paf 14: #include "pa_charset.h"
1.222 misha 15: #include "pa_vregex.h"
1.215 misha 16:
1.185 paf 17: const String String::Empty;
18:
1.193 paf 19: int pa_atoi(const char* str, const String* problem_source) {
20: if(!str)
21: return 0;
22:
1.199 paf 23: while(*str && isspace((unsigned char)*str))
1.193 paf 24: str++;
25: if(!*str)
26: return 0;
27:
28: int result;
29: char *error_pos;
1.200 paf 30: bool negative=false;
31: if(str[0]=='-') {
32: negative=true;
33: str++;
34: } else if(str[0]=='+') {
35: str++;
36: }
1.193 paf 37: // 0xABC
38: if(str[0]=='0')
39: if(str[1]=='x' || str[1]=='X')
40: result=(int)(unsigned long)strtol(str, &error_pos, 0);
1.197 paf 41: else {
42: // skip leading 0000, to disable octal interpretation
43: do str++; while(*str=='0');
44: result=(int)strtol(str, &error_pos, 0);
45: }
1.193 paf 46: else
47: result=(int)strtol(str, &error_pos, 0);
1.200 paf 48: if(negative)
49: result=-result;
1.193 paf 50:
51: while(char c=*error_pos++)
1.199 paf 52: if(!isspace((unsigned char)c))
1.193 paf 53: throw Exception("number.format",
54: problem_source,
55: problem_source?"invalid number (int)": "'%s' is invalid number (int)", str);
56:
57: return result;
58: }
59:
60: double pa_atod(const char* str, const String* problem_source) {
61: if(!str)
62: return 0;
63:
1.199 paf 64: while(*str && isspace((unsigned char)*str))
1.193 paf 65: str++;
66: if(!*str)
67: return 0;
68:
69: double result;
70: char *error_pos;
1.200 paf 71: bool negative=false;
72: if(str[0]=='-') {
73: negative=true;
74: str++;
75: } else if(str[0]=='+') {
76: str++;
77: }
1.193 paf 78: // 0xABC
79: if(str[0]=='0')
80: if(str[1]=='x' || str[1]=='X')
81: result=(double)(unsigned long)strtol(str, &error_pos, 0);
1.200 paf 82: else {
83: // skip leading 0000, to disable octal interpretation
84: do str++; while(*str=='0');
85: result=(double)strtod(str, &error_pos);
86: }
1.193 paf 87: else
88: result=(double)strtod(str, &error_pos);
1.200 paf 89: if(negative)
90: result=-result;
1.193 paf 91:
92: while(char c=*error_pos++)
1.199 paf 93: if(!isspace((unsigned char)c))
1.193 paf 94: throw Exception("number.format",
95: problem_source,
96: problem_source?"invalid number (double)": "'%s' is invalid number (double)", str);
97:
98: return result;
99: }
100:
1.176 paf 101: // cord lib extension
102:
103: #ifndef DOXYGEN
104: typedef struct {
105: ssize_t countdown;
1.204 paf 106: int target; /* Character we're looking for */
1.176 paf 107: } chr_data;
108: #endif
109: static int CORD_range_contains_chr_greater_then_proc(char c, size_t size, void* client_data)
110: {
111: register chr_data * d = (chr_data *)client_data;
112:
113: if (d -> countdown<=0) return(2);
114: d -> countdown -= size;
115: if (c > d -> target) return(1);
116: return(0);
117: }
118: int CORD_range_contains_chr_greater_then(CORD x, size_t i, size_t n, int c)
119: {
120: chr_data d;
121:
122: d.countdown = n;
123: d.target = c;
124: return(CORD_block_iter(x, i, CORD_range_contains_chr_greater_then_proc, &d) == 1/*alternatives: 0 normally ended, 2=struck 'n'*/);
125: }
126:
1.187 paf 127: static int CORD_block_count_proc(char /*c*/, size_t /*size*/, void* client_data)
1.178 paf 128: {
129: int* result=(int*)client_data;
130: (*result)++;
131: return(0); // 0=continue
132: }
133: size_t CORD_block_count(CORD x)
134: {
135: size_t result=0;
136: CORD_block_iter(x, 0, CORD_block_count_proc, &result);
137: return result;
138: }
139:
1.174 paf 140: // helpers
1.139 paf 141:
1.174 paf 142: /// String::match uses this as replace & global search table columns
1.139 paf 143:
1.174 paf 144: const int MAX_MATCH_GROUPS=100;
1.139 paf 145:
1.174 paf 146: class String_match_table_template_columns: public ArrayString {
147: public:
148: String_match_table_template_columns() {
149: *this+=new String("prematch");
150: *this+=new String("match");
151: *this+=new String("postmatch");
152: for(int i=0; i<MAX_MATCH_GROUPS; i++) {
1.176 paf 153: *this+=new String(String::Body::Format(1+i), String::L_CLEAN);
1.174 paf 154: }
155: }
156: };
157:
158: Table string_match_table_template(new String_match_table_template_columns);
159:
1.176 paf 160: // String::Body methods
1.140 paf 161:
1.176 paf 162: String::Body String::Body::Format(int value) {
1.174 paf 163: char local[MAX_NUMBER];
164: size_t length=snprintf(local, MAX_NUMBER, "%d", value);
1.224 ! misha 165: return String::Body(pa_strdup(local, length));
1.120 paf 166: }
167:
1.195 paf 168: String::Body String::Body::trim(String::Trim_kind kind, const char* chars,
169: size_t* out_start, size_t* out_length) const {
170: size_t our_length=length();
171: if(!our_length)
172: return *this;
173: if(!chars)
174: chars=" \t\n"; // white space
175:
176: size_t start=0;
177: size_t end=our_length;
1.196 paf 178: // from left...
179: if(kind!=TRIM_END) {
1.195 paf 180: CORD_pos pos; set_pos(pos, 0);
181: while(true) {
182: char c=CORD_pos_fetch(pos);
183: if(strchr(chars, c)) {
184: if(++start==our_length)
185: return 0; // all chars are empty, just return empty string
186: } else
187: break;
188:
189: CORD_next(pos);
190: }
191: }
1.196 paf 192: // from right..
193: if(kind!=TRIM_START) {
194: CORD_pos pos; set_pos(pos, end-1);
195: while(true) {
196: char c=CORD_pos_fetch(pos);
197: if(strchr(chars, c)) {
198: if(--end==0) // optimization: NO need to check for 'end>=start', that's(<) impossible
199: return 0; // all chars are empty, just return empty string
200: } else
201: break;
202:
203: CORD_prev(pos);
204: }
205: }
1.195 paf 206:
207: if(start==0 && end==our_length) // nobody moved a thing
208: return *this;
209:
210: if(out_start)
211: *out_start=start;
212: size_t new_length=end-start;
213: if(out_length)
214: *out_length=new_length;
215:
216: return mid(start, new_length);
217: }
218:
1.174 paf 219: static int CORD_batched_iter_fn_generic_hash_code(char c, void * client_data) {
220: uint& result=*static_cast<uint*>(client_data);
221: generic_hash_code(result, c);
222: return 0;
223: }
224: static int CORD_batched_iter_fn_generic_hash_code(const char* s, void * client_data) {
225: uint& result=*static_cast<uint*>(client_data);
226: generic_hash_code(result, s);
227: return 0;
228: };
1.176 paf 229: uint String::Body::hash_code() const {
1.174 paf 230: uint result=0;
1.220 misha 231: if (body && CORD_IS_STRING(body)){
232: generic_hash_code(result, body);
233: } else {
234: CORD_iter5(body, 0,
235: CORD_batched_iter_fn_generic_hash_code,
236: CORD_batched_iter_fn_generic_hash_code, &result);
237: }
1.120 paf 238: return result;
1.94 parser 239: }
240:
1.174 paf 241: // String methods
242:
243: String& String::append_know_length(const char* str, size_t known_length, Language lang) {
244: if(!known_length)
1.9 paf 245: return *this;
1.122 paf 246:
1.176 paf 247: // first: langs
248: langs.append(body, lang, known_length);
249: // next: letters themselves
1.174 paf 250: body.append_know_length(str, known_length);
1.1 paf 251:
1.174 paf 252: ASSERT_STRING_INVARIANT(*this);
1.1 paf 253: return *this;
254: }
1.174 paf 255: String& String::append_help_length(const char* str, size_t helper_length, Language lang) {
256: if(!str)
257: return *this;
258: size_t known_length=helper_length?helper_length:strlen(str);
259: if(!known_length)
260: return *this;
1.1 paf 261:
1.174 paf 262: return append_know_length(str, known_length, lang);
1.5 paf 263: }
1.174 paf 264: String& String::append_strdup(const char* str, size_t helper_length, Language lang) {
265: size_t known_length=helper_length?helper_length:strlen(str);
266: if(!known_length)
267: return *this;
1.5 paf 268:
1.176 paf 269: // first: langs
270: langs.append(body, lang, known_length);
271: // next: letters themselves
1.174 paf 272: body.append_strdup_know_length(str, known_length);
1.33 paf 273:
1.174 paf 274: ASSERT_STRING_INVARIANT(*this);
275: return *this;
1.5 paf 276: }
1.46 paf 277:
1.221 misha 278: int CORD_batched_len(const char* s, size_t* len){
279: (*len) += lengthUTF8( (const XMLByte *)s, (const XMLByte *)s+strlen(s));
280: return 0;
281: }
282:
283: // can be called only for IS_FUNCTION(CORD) which are used only in Lang
284: int CORD_batched_len(const char, size_t *len){
285: (*len)++;
1.220 misha 286: return 0;
287: }
288:
1.210 misha 289: size_t String::length(Charset& charset) const {
290: if(charset.isUTF8()){
1.220 misha 291: size_t len=0;
1.224 ! misha 292: body.for_each<size_t *>(CORD_batched_len, CORD_batched_len, &len);
1.220 misha 293: return len;
1.210 misha 294: } else
295: return body.length();
296: }
297:
1.174 paf 298: /// @todo check in doc: whether it documents NOW bad situation "abc".mid(-1, 3) =were?="ab"
299: String& String::mid(size_t substr_begin, size_t substr_end) const {
300: String& result=*new String;
301:
302: size_t self_length=length();
303: substr_begin=min(substr_begin, self_length);
304: substr_end=min(max(substr_end, substr_begin), self_length);
1.176 paf 305: size_t substr_length=substr_end-substr_begin;
306: if(!substr_length)
1.107 parser 307: return result;
1.53 paf 308:
1.176 paf 309: // first: their langs
310: result.langs.append(result.body, langs, substr_begin, substr_length);
311: // next: letters themselves
312: result.body=body.mid(substr_begin, substr_length);
1.174 paf 313:
314: ASSERT_STRING_INVARIANT(result);
1.53 paf 315: return result;
1.54 paf 316: }
317:
1.211 misha 318: // from, to and helper_length in characters, not in bytes (it's important for utf-8)
319: String& String::mid(Charset& charset, size_t from, size_t to, size_t helper_length) const {
1.210 misha 320: String& result=*new String;
321:
1.211 misha 322: size_t self_length=(helper_length)?helper_length:length(charset);
323:
324: if(!self_length)
325: return result;
326:
327: from=min(min(to, from), self_length);
1.210 misha 328: to=min(max(to, from), self_length);
1.211 misha 329:
1.210 misha 330: size_t substr_length=to-from;
1.211 misha 331:
1.210 misha 332: if(!substr_length)
333: return result;
334:
335: if(charset.isUTF8()){
336: const XMLByte* srcPtr=(const XMLByte*)cstrm();
1.211 misha 337: const XMLByte* srcEnd=srcPtr+body.length();
1.210 misha 338:
1.212 misha 339: // convert 'from' and 'substr_length' from 'characters' to 'bytes'
1.210 misha 340: from=getUTF8BytePos(srcPtr, srcEnd, from);
341: substr_length=getUTF8BytePos(srcPtr+from, srcEnd, substr_length);
342: if(!substr_length)
343: return result;
344: }
345:
346: // first: their langs
347: result.langs.append(result.body, langs, from, substr_length);
348: // next: letters themselves
349: result.body=body.mid(from, substr_length);
350:
351: ASSERT_STRING_INVARIANT(result);
352: return result;
353: }
354:
1.176 paf 355: size_t String::pos(const String::Body substr, size_t this_offset, Language lang) const {
1.183 paf 356: size_t substr_length=substr.length();
357: while(true) {
358: size_t substr_begin=body.pos(substr, this_offset);
359:
360: if(substr_begin==CORD_NOT_FOUND)
361: return STRING_NOT_FOUND;
1.174 paf 362:
1.183 paf 363: if(langs.check_lang(lang, substr_begin, substr_length))
364: return substr_begin;
365:
366: this_offset=substr_begin+substr_length;
367: }
1.58 paf 368: }
369:
1.174 paf 370: size_t String::pos(const String& substr,
371: size_t this_offset, Language lang) const {
372: return pos(substr.body, this_offset, lang);
1.60 paf 373: }
374:
1.210 misha 375: size_t String::pos(Charset& charset, const String& substr,
376: size_t this_offset, Language lang) const {
377:
1.212 misha 378: size_t result;
1.210 misha 379: if(charset.isUTF8()){
380: const XMLByte* srcPtr=(const XMLByte*)cstrm();
1.212 misha 381: const XMLByte* srcEnd=srcPtr+body.length();
382:
383: // convert 'this_offset' from 'characters' to 'bytes'
384: this_offset=getUTF8BytePos(srcPtr, srcEnd, this_offset);
385:
386: result=pos(substr.body, this_offset, lang);
387: if(result==CORD_NOT_FOUND)
388: return STRING_NOT_FOUND;
389:
390: // convert 'result' from 'bytes' to 'characters'
391: result=getUTF8CharPos(srcPtr, srcEnd, result);
392: } else {
393: result=pos(substr.body, this_offset, lang);
394: if(result==CORD_NOT_FOUND)
395: return STRING_NOT_FOUND;
1.210 misha 396: }
397:
398: return result;
399: }
400:
1.174 paf 401: void String::split(ArrayString& result,
402: size_t& pos_after,
403: const char* delim,
404: Language lang, int limit) const {
405: size_t self_length=length();
406: if(size_t delim_length=strlen(delim)) {
1.186 paf 407: size_t pos_before;
1.60 paf 408: // while we have 'delim'...
1.174 paf 409: for(; (pos_before=pos(delim, pos_after, lang))!=STRING_NOT_FOUND && limit; limit--) {
1.69 paf 410: result+=&mid(pos_after, pos_before);
1.174 paf 411: pos_after=pos_before+delim_length;
1.60 paf 412: }
413: // last piece
1.174 paf 414: if(pos_after<self_length && limit) {
415: result+=&mid(pos_after, self_length);
416: pos_after=self_length;
1.60 paf 417: }
418: } else { // empty delim
419: result+=this;
1.174 paf 420: pos_after+=self_length;
1.60 paf 421: }
422: }
423:
1.174 paf 424: void String::split(ArrayString& result,
425: size_t& pos_after,
426: const String& delim, Language lang,
427: int limit) const {
1.140 paf 428: if(!delim.is_empty()) {
1.186 paf 429: size_t pos_before;
1.60 paf 430: // while we have 'delim'...
1.174 paf 431: for(; (pos_before=pos(delim, pos_after, lang))!=STRING_NOT_FOUND && limit; limit--) {
1.69 paf 432: result+=&mid(pos_after, pos_before);
1.174 paf 433: pos_after=pos_before+delim.length();
1.60 paf 434: }
435: // last piece
1.174 paf 436: if(pos_after<length() && limit) {
437: result+=&mid(pos_after, length());
438: pos_after=length();
1.60 paf 439: }
440: } else { // empty delim
441: result+=this;
1.174 paf 442: pos_after+=length();
1.60 paf 443: }
1.61 paf 444: }
445:
1.222 misha 446: Table* String::match(VRegex* vregex,
447: Row_action row_action, void *info,
448: int& matches_count) const {
1.209 misha 449:
1.222 misha 450: // vregex->info(); // I have no idea what does it for?
1.63 paf 451:
1.222 misha 452: bool need_pre_post_match=vregex->is_pre_post_match_needed();
453: bool global=vregex->is_global_search();
1.63 paf 454:
1.174 paf 455: const char* subject=cstr();
456: size_t subject_length=strlen(subject);
1.222 misha 457: const int ovector_size=(1/*match*/+MAX_MATCH_GROUPS)*3;
458: int ovector[ovector_size];
1.155 paf 459:
1.173 paf 460: Table::Action_options table_options;
1.174 paf 461: Table& table=*new Table(string_match_table_template, table_options);
1.63 paf 462:
1.154 paf 463: int prestart=0;
464: int poststart=0;
1.174 paf 465: int postfinish=length();
1.63 paf 466: while(true) {
1.222 misha 467: int exec_result=vregex->exec(subject, subject_length, ovector, ovector_size, prestart);
1.63 paf 468:
1.222 misha 469: if(exec_result<0) // only PCRE_ERROR_NOMATCH might be here, other negative results cause an exception
470: break;
1.63 paf 471:
1.154 paf 472: int prefinish=ovector[0];
473: poststart=ovector[1];
1.174 paf 474: ArrayString* row=new ArrayString;
475: if(need_pre_post_match) {
476: *row+=&mid(0, prefinish); // .prematch column value
477: *row+=&mid(prefinish, poststart); // .match
478: *row+=&mid(poststart, postfinish); // .postmatch
479: } else {
1.185 paf 480: *row+=&Empty; // .prematch column value
481: *row+=&Empty; // .match
482: *row+=&Empty; // .postmatch
1.174 paf 483: }
1.63 paf 484:
1.222 misha 485: for(int i=1; i<exec_result; i++) {
1.69 paf 486: // -1:-1 case handled peacefully by mid() itself
1.174 paf 487: *row+=&mid(ovector[i*2+0], ovector[i*2+1]); // .i column value
1.63 paf 488: }
489:
1.209 misha 490: matches_count++;
1.174 paf 491: row_action(table, row, prestart, prefinish, poststart, postfinish, info);
1.63 paf 492:
1.222 misha 493: if(!global || prestart==poststart) // last step
494: break;
495:
1.154 paf 496: prestart=poststart;
1.222 misha 497: }
1.63 paf 498:
1.222 misha 499: row_action(table, 0/*last time, no raw*/, 0, 0, poststart, postfinish, info);
500: return vregex->is_just_count() ? 0 : &table;
1.82 parser 501: }
502:
1.174 paf 503: String& String::change_case(Charset& source_charset, Change_case_kind kind) const {
504: String& result=*new String();
505: if(is_empty())
506: return result;
507:
508: char* new_cstr=cstrm();
1.216 misha 509:
1.181 paf 510: if(source_charset.isUTF8()) {
1.216 misha 511: size_t new_cstr_len=length();
1.181 paf 512: switch(kind) {
513: case CC_UPPER:
1.192 paf 514: change_case_UTF8((const XMLByte*)new_cstr, new_cstr_len, (XMLByte*)new_cstr, new_cstr_len, UTF8CaseToUpper);
1.181 paf 515: break;
516: case CC_LOWER:
1.192 paf 517: change_case_UTF8((const XMLByte*)new_cstr, new_cstr_len, (XMLByte*)new_cstr, new_cstr_len, UTF8CaseToLower);
1.181 paf 518: break;
519: default:
520: assert(!"unknown change case kind");
521: break; // never
522: }
523:
524: } else {
525: const unsigned char *tables=source_charset.pcre_tables;
1.82 parser 526:
1.181 paf 527: const unsigned char *a;
528: const unsigned char *b;
529: switch(kind) {
530: case CC_UPPER:
531: a=tables+lcc_offset;
532: b=tables+fcc_offset;
533: break;
534: case CC_LOWER:
535: a=tables+lcc_offset;
536: b=0;
537: break;
538: default:
539: assert(!"unknown change case kind");
540: a=b=0; // calm, compiler
541: break; // never
542: }
543:
1.192 paf 544: char *dest=new_cstr;
1.181 paf 545: unsigned char index;
1.190 paf 546: for(const char* current=new_cstr; (index=(unsigned char)*current); current++) {
1.181 paf 547: unsigned char c=a[index];
548: if(b)
549: c=b[c];
550:
551: *dest++=(char)c;
552: }
1.174 paf 553: }
1.176 paf 554: result.langs=langs;
1.174 paf 555: result.body=new_cstr;
1.89 parser 556:
1.101 parser 557: return result;
558: }
559:
1.213 misha 560: const String& String::escape(Charset& source_charset) const {
561: if(is_empty())
562: return *this;
563:
564: return Charset::escape(*this, source_charset);
565: }
566:
1.174 paf 567: const String& String::replace(const Dictionary& dict) const {
568: String& result=*new String();
569: const char* old_cstr=cstr();
570: const char* prematch_begin=old_cstr;
571:
572: const char* current=old_cstr;
573: while(*current) {
1.184 paf 574: if(Dictionary::Subst subst=dict.first_that_begins(current)) {
1.174 paf 575: // prematch
576: if(size_t prematch_length=current-prematch_begin) {
1.179 paf 577: result.langs.append(result.body, langs, prematch_begin-old_cstr, prematch_length);
1.174 paf 578: result.body.append_strdup_know_length(prematch_begin, prematch_length);
1.101 parser 579: }
580:
1.174 paf 581: // match
582: // skip 'a' in 'current'; move prematch_begin
1.184 paf 583: current+=subst.from_length; prematch_begin=current;
1.174 paf 584:
1.184 paf 585: if(const String* b=subst.to) // are there any b?
1.174 paf 586: result<<*b;
587: } else // simply advance
588: current++;
589: }
1.156 paf 590:
1.174 paf 591: // postmatch
592: if(size_t postmatch_length=current-prematch_begin) {
1.179 paf 593: result.langs.append(result.body, langs, prematch_begin-old_cstr, postmatch_length);
1.174 paf 594: result.body.append_strdup_know_length(prematch_begin, postmatch_length);
595: }
1.156 paf 596:
1.174 paf 597: ASSERT_STRING_INVARIANT(result);
1.82 parser 598: return result;
1.61 paf 599: }
1.113 parser 600:
1.180 paf 601: static int serialize_body_char(char c, char** cur) {
602: *((*cur)++)=c;
603: return 0; // 0=continue
604: };
1.174 paf 605: static int serialize_body_piece(const char* s, char** cur) {
606: size_t length=strlen(s);
607: memcpy(*cur, s, length); *cur+=length;
1.178 paf 608: return 0; // 0=continue
1.174 paf 609: };
1.178 paf 610: static int serialize_lang_piece(char alang, size_t asize, char** cur) {
611: // lang
1.191 paf 612: **cur=alang; (*cur)++;
613: // length [WARNING: not cast, addresses must be %4=0 on sparc]
1.178 paf 614: memcpy(*cur, &asize, sizeof(asize)); *cur+=sizeof(asize);
615:
616: return 0; // 0=continue
617: }
1.174 paf 618: String::Cm String::serialize(size_t prolog_length) const {
1.178 paf 619: size_t fragments_count=langs.count();
1.202 paf 620: size_t body_length=body.length();
1.174 paf 621: size_t buf_length=
1.178 paf 622: prolog_length //1
623: +sizeof(size_t) //2
1.202 paf 624: +body_length //3
625: +1 // 4 for zero terminator used in deserialize
626: +sizeof(size_t) //5
627: +fragments_count*(sizeof(char)+sizeof(size_t)); //6
628:
1.174 paf 629: String::Cm result(new(PointerFreeGC) char[buf_length], buf_length);
630:
631: // 1: prolog
632: char *cur=result.str+prolog_length;
1.202 paf 633: // 2: chars.count [WARNING: not cast, addresses must be %4=0 on sparc]
634: memcpy(cur, &body_length, sizeof(body_length)); cur+=sizeof(body_length);
635: // 3: letters
636: body.for_each(serialize_body_char, serialize_body_piece, &cur);
637: // 4: zero terminator
638: *cur++=0;
639: // 5: langs.count [WARNING: not cast, addresses must be %4=0 on sparc]
1.174 paf 640: memcpy(cur, &fragments_count, sizeof(fragments_count)); cur+=sizeof(fragments_count);
1.202 paf 641: // 6: lang info
1.178 paf 642: langs.for_each(body, serialize_lang_piece, &cur);
1.113 parser 643:
1.174 paf 644: return result;
1.113 parser 645: }
1.202 paf 646: bool String::deserialize(size_t prolog_size, void *buf, size_t buf_size) {
647: size_t in_buf=buf_size;
648: if(in_buf<=prolog_size)
1.148 paf 649: return false;
1.202 paf 650: in_buf-=prolog_size;
1.135 paf 651:
1.174 paf 652: // 1: prolog
1.202 paf 653: const char* cur=(const char* )buf+prolog_size;
1.113 parser 654:
1.207 paf 655: // 2: chars.count
1.202 paf 656: size_t body_length;
657: if(in_buf<sizeof(body_length)) // body.length don't fit?
658: return false;
659: // [WARNING: not cast, addresses must be %4=0 on sparc]
660: memcpy(&body_length, cur, sizeof(body_length)); cur+=sizeof(body_length);
661: in_buf-=sizeof(body_length);
662:
663: if(in_buf<body_length+1) // letters+terminator don't fit?
664: return false;
665: // 4: zero terminator
666: if(cur[body_length] != 0) // in place?
667: return false;
668: // 3: letters
1.224 ! misha 669: body=String::Body(cur);
1.202 paf 670: cur+=body_length+1;
671: in_buf-=body_length+1;
672:
673: // 5: langs.count
1.191 paf 674: size_t fragments_count;
1.202 paf 675: if(in_buf<sizeof(fragments_count)) // langs.count don't fit?
1.174 paf 676: return false;
1.191 paf 677: // [WARNING: not cast, addresses must be %4=0 on sparc]
678: memcpy(&fragments_count, cur, sizeof(fragments_count)); cur+=sizeof(fragments_count);
1.202 paf 679: in_buf-=sizeof(fragments_count);
1.174 paf 680:
681: if(fragments_count) {
1.202 paf 682: // 6: lang info
1.174 paf 683: size_t total_length=0;
684: for(size_t f=0; f<fragments_count; f++) {
1.191 paf 685: char lang;
686: size_t fragment_length;
687: size_t piece_length=sizeof(lang)+sizeof(fragment_length);
1.202 paf 688: if(in_buf<piece_length) // lang+length
1.174 paf 689: return false;
690:
1.191 paf 691: // lang
692: lang=*cur++;
693: // length [WARNING: not cast, addresses must be %4=0 on sparc]
694: memcpy(&fragment_length, cur, sizeof(fragment_length)); cur+=sizeof(fragment_length);
695:
1.206 paf 696: size_t combined_length=total_length+fragment_length;
697: if(combined_length>body_length)
698: return false; // file curruption
1.191 paf 699: // uchar needed to prevent propagating 0x80 bit to upper bytes
700: langs.append(total_length, (String::Language)(uchar)lang, fragment_length);
1.206 paf 701: total_length=combined_length;
1.202 paf 702: in_buf-=piece_length;
1.174 paf 703: }
1.128 paf 704:
1.202 paf 705: if(total_length!=body_length) // length(all language fragments) vs length(letters)
1.148 paf 706: return false;
1.174 paf 707: }
1.202 paf 708: if(in_buf!=0) // some strange extra bytes
709: return false;
1.113 parser 710:
1.174 paf 711: ASSERT_STRING_INVARIANT(*this);
1.148 paf 712: return true;
1.176 paf 713: }
714:
715: const char* String::Body::v() const {
716: return CORD_to_const_char_star(body);
717: }
1.201 paf 718: void String::Body::dump() const {
719: CORD_dump(body);
720: }
721:
1.176 paf 722: const char* String::Languages::v() const {
1.177 paf 723: if(opt.is_not_just_lang)
1.176 paf 724: return CORD_to_const_char_star(langs);
725: else
726: return (const char*)&langs;
727: }
1.201 paf 728: void String::Languages::dump() const {
729: if(opt.is_not_just_lang)
730: CORD_dump(langs);
731: else
732: puts((const char*)&langs);
733: }
1.176 paf 734: const char* String::v() const {
1.198 paf 735: const uint LIMIT_VIEW=20;
1.176 paf 736: char* buf=(char*)malloc(MAX_STRING);
737: const char*body_view=body.v();
738: const char*langs_view=langs.v();
739: snprintf(buf, MAX_STRING,
1.178 paf 740: "%d:%.*s%s} "
1.176 paf 741: "{%d:%s",
1.178 paf 742: langs.count(), LIMIT_VIEW, langs_view, strlen(langs_view)>LIMIT_VIEW?"...":"",
1.176 paf 743: strlen(body_view), body_view
744: );
745:
746: return buf;
1.113 parser 747: }
1.201 paf 748: void String::dump() const {
749: body.dump();
750: langs.dump();
751: }
1.195 paf 752: const String& String::trim(String::Trim_kind kind, const char* chars) const {
1.223 misha 753: if(is_empty())
1.195 paf 754: return *this;
755:
756: size_t substr_begin, substr_length;
757: Body new_body=body.trim(kind, chars, &substr_begin, &substr_length);
758: if(new_body==body) // we received unchanged pointer, do likewise
759: return *this;
760: // new_body differs from body, adjust langs along
761:
762: String& result=*new String;
763: if(!new_body) // body.trim produced empty result
764: return result;
765: // body.trim produced nonempty result
766:
767: // first: their langs
768: result.langs.append(result.body, langs, substr_begin, substr_length);
769: // next: letters themselves
770: result.body=new_body;
771:
772: ASSERT_STRING_INVARIANT(result);
773: return result;
1.198 paf 774: }
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