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