--- parser3/src/main/pa_string.C 2003/01/21 15:51:15 1.172 +++ parser3/src/main/pa_string.C 2003/03/20 13:09:54 1.172.2.21.2.8 @@ -1,105 +1,97 @@ /** @file Parser: string class. @see untasize_t.C. - Copyright (c) 2001, 2003 ArtLebedev Group (http://www.artlebedev.com) + Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com) Author: Alexandr Petrosian (http://paf.design.ru) */ -static const char* IDENT_STRING_C="$Date: 2003/01/21 15:51:15 $"; +static const char* IDENT_STRING_C="$Date: 2003/03/20 13:09:54 $"; #include "pcre.h" -#include "pa_pool.h" #include "pa_string.h" -#include "pa_hash.h" #include "pa_exception.h" -#include "pa_common.h" -#include "pa_array.h" -#include "pa_globals.h" #include "pa_table.h" #include "pa_dictionary.h" #include "pa_charset.h" -#define DEBUG_STRING_APPENDS_VS_EXPANDS +// helpers +/// String::match uses this as replace & global search table columns -#ifdef DEBUG_STRING_APPENDS_VS_EXPANDS -ulong string_piece_appends=0; -#endif +const int MAX_MATCH_GROUPS=100; -String& String::OnPool(Pool& apool, const char *local_src, size_t src_size, bool tainted) { - if(local_src && *local_src) { - if(src_size==0) - src_size=strlen(local_src); - - char *pooled_src=(char *)apool.malloc(src_size); - memcpy(pooled_src, local_src, src_size); - return *new(apool) String(apool, pooled_src, src_size, tainted); - } else - return *new(apool) String(apool); -} -String::String(Pool& apool, const char *src, size_t src_size, bool tainted) : - Pooled(apool) { - last_chunk=&head.chunk; - head.chunk.count=CR_PREALLOCATED_COUNT; - append_here=head.chunk.rows; +class String_match_table_template_columns: public ArrayString { +public: + String_match_table_template_columns() { + *this+=new String("prematch"); + *this+=new String("match"); + *this+=new String("postmatch"); + for(int i=0; iitem.size; - ); - return result; -} + size_t fragment_start=0; + size_t fragment_end; + for(Array_iterator i(src); ; fragment_start=fragment_end) { + const element_type& fragment=i.next(); + fragment_end=fragment_start+fragment.size; + + if(substr_startfragment_end) { // are there more fragments including pieces of 'substr'? + const element_type& fragment=i.next(); + fragment_end=fragment_start+fragment.size; + + if(substr_end>fragment_end) // are there still more? + simple_append(Fragment(fragment.lang, fragment.size)); // appending whole fragment + else { // no, it was last + simple_append(Fragment(fragment.lang, substr_end-fragment_start)); + goto break2; + } + } -/// @todo not very optimal -uint String::used_rows() const { - uint result=0; - STRING_FOREACH_ROW( - result++; - ); - return result; -} -void String::expand() { - uint new_chunk_count=last_chunk->count+CR_GROW_COUNT; - if(new_chunk_count>max_integral(Chunk::count_type)) - new_chunk_count=max_integral(Chunk::count_type); - - Chunk *new_chunk=static_cast(malloc( - sizeof(Chunk)// count+interpadding(?)+rows[CR_PREALLOCATED_COUNT]+tailpadding(??) - -sizeof(Chunk::rows_type) // PREALLOCATED rows - +sizeof(Chunk::Row)*new_chunk_count // neaded rows - +sizeof(Chunk *) // link size - , 10)); - new_chunk->rows[new_chunk->count=new_chunk_count].link=0; - last_chunk->rows[last_chunk->count].link=new_chunk; + break; + } +break2: - last_chunk=new_chunk; - append_here=last_chunk->rows; + return *this; } +/* +void String::ArrayFragment::mid(ArrayFragment& result, size_t substr_start, size_t substr_end) { +} +*/ -String& String::real_append(STRING_APPEND_PARAMS) { - if(!last_chunk) // growth stopped [we're appended as string to somebody] - throw Exception(0, - this, - "string growth stopped (append cstr)"); +// String methods + +String::String(const char* src, size_t src_size, bool tainted): body(CORD_EMPTY) { + if(src) + if(tainted) + APPEND_TAINTED(src, src_size); + else + APPEND_CLEAN(src, src_size); +} +String::String(const String& src): body(src.body), fragments(src.fragments) {} + +String& String::append(const char* src, size_t size, Untaint_lang lang) { if(!src) return *this; if(!size) @@ -107,299 +99,88 @@ String& String::real_append(STRING_APPEN if(!size) return *this; -#ifdef DEBUG_STRING_APPENDS_VS_EXPANDS - string_piece_appends++; -#endif - - // manually unrolled to avoid extra check - while(size>max_integral(Chunk::Row::item_size_type)) { - if(chunk_is_full()) - expand(); - - append_here->item.ptr=src; - append_here->item.size=max_integral(Chunk::Row::item_size_type); - append_here->item.lang=lang; -#ifndef NO_STRING_ORIGIN - append_here->item.origin.file=file; - append_here->item.origin.line=line; -#endif - append_here++; - - src+=max_integral(Chunk::Row::item_size_type); - size-=max_integral(Chunk::Row::item_size_type); - } - - if(chunk_is_full()) - expand(); - - append_here->item.ptr=src; - append_here->item.size=size; - append_here->item.lang=lang; -#ifndef NO_STRING_ORIGIN - append_here->item.origin.file=file; - append_here->item.origin.line=line; -#endif - append_here++; + body=CORD_cat_char_star(body, src, size); + fragments+=Fragment(lang, size); return *this; } +static int CORD_batched_iter_fn_generic_hash_code(const char* s, void * client_data) { + uint& result=*static_cast(client_data); + generic_hash_code(result, s); + return 0; +}; uint String::hash_code() const { uint result=0; - STRING_FOREACH_ROW( - result=Hash::generic_code(result, row->item.ptr, row->item.size); - ); + CORD_iter5(body, 0, 0, CORD_batched_iter_fn_generic_hash_code, &result); return result; } -/// @todo move 'lang' skipping to pos -int String::cmp(int& partial, const String& src, - size_t this_offset, Untaint_lang lang) const { - partial=-1; - size_t a_size=size(); - this_offset=min(this_offset, a_size-1); - - const Chunk *a_chunk=&head.chunk; - const Chunk *b_chunk=&src.head.chunk; - const Chunk::Row *a_row=a_chunk->rows; - const Chunk::Row *b_row=b_chunk->rows; - size_t a_offset=this_offset; - size_t b_offset=0; - Chunk::Row *a_end=append_here; - Chunk::Row *b_end=src.append_here; - uint a_countdown=a_chunk->count; - uint b_countdown=b_chunk->count; - int result; - size_t pos=0; +const String& String::mid(size_t substr_start, size_t substr_end) const { + String& result=*new String; - bool a_break=a_size==0; - bool b_break=src.is_empty(); - if(!(a_break || b_break)) while(true) { - if(pos+a_row->item.size > this_offset) { - if(lang!=UL_UNSPECIFIED && a_row->item.lang>lang) - return -1; // wrong lang -- bail out - - int size_diff= - (a_row->item.size-a_offset)- - (b_row->item.size-b_offset); - - if(size_diff==0) { // a has same size as b - result=memcmp(a_row->item.ptr+a_offset, b_row->item.ptr+b_offset, - a_row->item.size-a_offset); - if(result) - return result; - pos+=a_row->item.size; - a_row++; a_countdown--; a_offset=0; - b_row++; b_countdown--; b_offset=0; - } else if (size_diff>0) { // a longer - result=memcmp(a_row->item.ptr+a_offset, b_row->item.ptr+b_offset, - b_row->item.size-b_offset); - if(result) - return result; - a_offset+=b_row->item.size-b_offset; - b_row++; b_countdown--; b_offset=0; - } else { // b longer - result=memcmp(a_row->item.ptr+a_offset, b_row->item.ptr+b_offset, - a_row->item.size-a_offset); - if(result) - return result; - b_offset+=a_row->item.size-a_offset; - pos+=a_row->item.size; - a_row++; a_countdown--; a_offset=0; - } - if(b_break=b_row==b_end) { - a_break=a_row==a_end; - break; - } - if(!b_countdown) { - b_chunk=b_row->link; - b_row=b_chunk->rows; - b_countdown=b_chunk->count; - } - } else { - a_offset-=a_row->item.size; - pos+=a_row->item.size; - a_row++; a_countdown--; - } + substr_start=min(substr_start, size()); + substr_end=max(substr_start, substr_end); + if(substr_start==substr_end) + return result; - if(a_break=a_row==a_end) { - b_break=b_row==b_end; - break; - } - if(!a_countdown) { - a_chunk=a_row->link; - a_row=a_chunk->rows; - a_countdown=a_chunk->count; - } - } - if(a_break==b_break) { // ended simultaneously - partial=0; return 0; - } else if(a_break) { // first bytes equal, but a ended before b - partial=1; return -1; - } else { - partial=2; return +1; - } -} + // first: letters themselves + result.body=CORD_substr(body, substr_start, substr_end-substr_start); -/// @todo move 'lang' skipping to pos -int String::cmp(int& partial, const char* b_ptr, size_t src_size, - size_t this_offset, Untaint_lang lang) const { - partial=-1; - size_t a_size=size(); - size_t b_size=src_size?src_size:b_ptr?strlen(b_ptr):0; - this_offset=min(this_offset, a_size-1); - - const Chunk *a_chunk=&head.chunk; - const Chunk::Row *a_row=a_chunk->rows; - size_t a_offset=this_offset; - size_t b_offset=0; - Chunk::Row *a_end=append_here; - uint a_countdown=a_chunk->count; - size_t pos=0; - - bool a_break=a_size==0; - bool b_break=b_size==0; - if(!(a_break || b_break)) while(true) { - if(pos+a_row->item.size > this_offset) { - if(lang!=UL_UNSPECIFIED && a_row->item.lang>lang) - return -1; // wrong lang -- bail out - - int size_diff= - (a_row->item.size-a_offset)- - (b_size-b_offset); - - if(size_diff==0) { // a has same size as b - if(int result=memcmp(a_row->item.ptr+a_offset, b_ptr+b_offset, - a_row->item.size-a_offset)!=0) - return result; - pos+=a_row->item.size; - a_row++; a_countdown--; a_offset=0; - b_break=true; - } else if (size_diff>0) { // a longer - if(int result=memcmp(a_row->item.ptr+a_offset, b_ptr+b_offset, - b_size-b_offset)!=0) - return result; - a_offset+=b_size-b_offset; - b_break=true; - } else { // b longer - if(int result=memcmp(a_row->item.ptr+a_offset, b_ptr+b_offset, - a_row->item.size-a_offset)!=0) - return result; - b_offset+=a_row->item.size-a_offset; - pos+=a_row->item.size; - a_row++; a_countdown--; a_offset=0; - } - } else { - a_offset-=a_row->item.size; - pos+=a_row->item.size; - a_row++; a_countdown--; - } + // next: their langs + result.fragments.append(fragments, substr_start, substr_end); - a_break=a_row==a_end; - if(a_break || b_break) - break; - if(!a_countdown) { - a_chunk=a_row->link; - a_row=a_chunk->rows; - a_countdown=a_chunk->count; - } - } - if(a_break==b_break) { // ended simultaneously - partial=0; return 0; - } else if(a_break) { // first bytes equal, but a ended before b - partial=1; return -1; - } else { - partial=2; return +1; - } -} - -#ifndef NO_STRING_ORIGIN -const Origin& String::origin() const { - if(is_empty()) { - static const Origin empty_origin={"empty string"}; - return empty_origin; - } - - // determining origin by first piece or last appended piece - // because any of them can be constant=without origin: - // ex: ^load[/file] "document_root" + "/file" - // when last peice is constant, - // ex: parser_root_auto_path{dynamic} / auto.p{const} - // using first piece - Origin& first_origin=head.chunk.rows[0].item.origin; - return first_origin.file ? first_origin : append_here[-1].item.origin; -} -#endif - -String& String::mid(size_t start, size_t finish) const { - String& result=*NEW String(pool()); - - start=min(start, size()); - finish=max(start, finish); - if(start==finish) - return result; - - size_t pos=0; - STRING_FOREACH_ROW( - size_t item_finish=pos+row->item.size; - if(item_finish > start) { // started now or already? - bool started=result.is_empty(); // started now? - bool finished=finish <= item_finish; // finished now? - size_t offset=started?start-pos:0; - size_t size=finished?finish-pos:row->item.size; - result.APPEND( - row->item.ptr+offset, size-offset, - row->item.lang, - row->item.origin.file, row->item.origin.line); - if(finished) - goto break2; - } - pos+=row->item.size; - ); -break2: // SAPI::log(pool(), "piece of '%s' from %d to %d is '%s'", - //cstr(), start, finish, result.cstr()); + //cstr(), substr_start, substr_end, result.cstr()); return result; } -int String::pos(const String& substr, - int result, Untaint_lang lang) const { - size_t self_size=size(); - for(; size_t(result) i(fragments); i.has_next(); fragment_start=fragment_end) { + const Fragment& fragment=i.next(); + fragment_end=fragment_start+fragment.size; + + if(substr_startfragment_end) // end of substr OUT of current fragment? + break; + + return fragment.lang==lang?substr_end:STRING_NOT_FOUND; + } + + return STRING_NOT_FOUND; } -int String::pos(const char *substr, size_t substr_size, - int result, Untaint_lang lang) const { - size_t self_size=size(); - for(; size_t(result)=0 && limit; limit--) { + for(; (pos_before=pos(delim, pos_after, lang))>=0 && limit; limit--) { result+=&mid(pos_after, pos_before); pos_after=pos_before+delim_size; } @@ -408,21 +189,17 @@ void String::split(Array& result, result+=&mid(pos_after, self_size); pos_after=self_size; } - if(pos_after_ref) - *pos_after_ref=pos_after; } else { // empty delim result+=this; - if(pos_after_ref) - *pos_after_ref+=self_size; + pos_after+=self_size; } } -void String::split(Array& result, - size_t* pos_after_ref, +void String::split(ArrayString& result, + size_t& pos_after, const String& delim, Untaint_lang lang, int limit) const { - if(!delim.is_empty()) { - size_t pos_after=pos_after_ref?*pos_after_ref:0; + if(delim) { int pos_before; // while we have 'delim'... for(; (pos_before=pos(delim, pos_after, lang))>=0 && limit; limit--) { @@ -434,19 +211,16 @@ void String::split(Array& result, result+=&mid(pos_after, size()); pos_after=size(); } - if(pos_after_ref) - *pos_after_ref=pos_after; } else { // empty delim result+=this; - if(pos_after_ref) - *pos_after_ref+=size(); + pos_after+=size(); } } -static void regex_options(const String *options, int *result, bool& need_pre_post_match){ +static void regex_options(const String& options, int *result, bool& need_pre_post_match){ struct Regex_option { - const char *keyL; - const char *keyU; + const char* keyL; + const char* keyU; int clear, set; int *result; bool *flag; @@ -464,8 +238,8 @@ static void regex_options(const String * if(options) for(Regex_option *o=regex_option; o->keyL; o++) - if(options->pos(o->keyL)>=0 - || (o->keyU && options->pos(o->keyU)>=0)) { + if(options.pos(o->keyL)>=0 + || (o->keyU && options.pos(o->keyU)>=0)) { if(o->flag) *o->flag=true; else { // result @@ -475,52 +249,47 @@ static void regex_options(const String * } } -/// @todo make replacement Table stacked -bool String::match( - const String *aorigin, - const String& regexp, - const String *options, - Table **table, - Row_action row_action, void *info, - bool *was_global) const { - - if(regexp.is_empty()) +Table* String::match(Charset& source_charset, + const String& regexp, + const String& options, + Row_action row_action, void *info, + bool& just_matched) const { + if(!regexp) throw Exception(0, - aorigin, + 0, "regexp is empty"); - const char *pattern=regexp.cstr(); - const char *errptr; + const char* pattern=regexp.cstr(); + const char* errptr; int erroffset; - bool need_pre_post_match=false; + bool need_pre_post_match=false; int option_bits[2]; regex_options(options, option_bits, need_pre_post_match); - if(was_global) - *was_global=option_bits[1]!=0; + bool global=option_bits[1]!=0; pcre *code=pcre_compile(pattern, option_bits[0], &errptr, &erroffset, - pool().get_source_charset().pcre_tables); + source_charset.pcre_tables); if(!code) throw Exception(0, ®exp.mid(erroffset, regexp.size()), "regular expression syntax error - %s", errptr); - int info_substrings=pcre_info(code, 0, 0); - if(info_substrings<0) { + int subpatterns=pcre_info(code, 0, 0); + if(subpatterns<0) { pcre_free(code); throw Exception(0, - aorigin, + ®exp, "pcre_info error (%d)", - info_substrings); + subpatterns); } - const char *subject=cstr(); - int length=strlen(subject); - const int ovecsize=(1/*match*/+MAX_STRING_MATCH_TABLE_COLUMNS)*3; + const char* subject=cstr(); + size_t subject_size=strlen(subject); + const int ovecsize=(1/*match*/+MAX_MATCH_GROUPS)*3; int ovector[ovecsize]; // create table - *table=NEW Table(pool(), *string_match_table_template); + Table* table=new Table(string_match_table_template); int exec_option_bits=0; int prestart=0; @@ -528,41 +297,51 @@ bool String::match( int postfinish=size(); while(true) { int exec_substrings=pcre_exec(code, 0, - subject, length, prestart, + subject, subject_size, prestart, exec_option_bits, ovector, ovecsize); if(exec_substrings==PCRE_ERROR_NOMATCH) { pcre_free(code); - row_action(**table, 0/*last time, no row*/, 0, 0, poststart, postfinish, info); - return option_bits[1]!=0; // global=true+table, not global=false + row_action(table, 0/*last time, no raw*/, 0, 0, poststart, postfinish, info); + if(global || subpatterns) + return table; // global or with subpatterns=true+result + else { + just_matched=false; return 0; // not global=no result + } } if(exec_substrings<0) { pcre_free(code); throw Exception(0, - aorigin, + ®exp, "regular expression execute error (%d)", exec_substrings); } int prefinish=ovector[0]; poststart=ovector[1]; - Array& row=*NEW Array(pool()); - row+=need_pre_post_match?&mid(0, prefinish):0; // .prematch column value - row+=need_pre_post_match?&mid(prefinish, poststart):0; // .match - row+=need_pre_post_match?&mid(poststart, postfinish):0; // .postmatch + ArrayString* row=new ArrayString; + if(need_pre_post_match) { + *row+=&mid(0, prefinish); // .prematch column value + *row+=&mid(prefinish, poststart); // .match + *row+=&mid(poststart, postfinish); // .postmatch + } else { + *row+=0; // .prematch column value + *row+=0; // .match + *row+=0; // .postmatch + } for(int i=1; iitem.size, 12); - char *dest=new_cstr; - const char *src=row->item.ptr; - for(int size=row->item.size; size--; src++) { - unsigned char c=a[(unsigned char)*src]; - if(b) - c=b[c]; + char* new_cstr=cstrm(); + char *dest=new_cstr; + unsigned char index; + for(const char* current=new_cstr; index=(unsigned char)*current; current++) { + unsigned char c=a[index]; + if(b) + c=b[c]; - *dest++=(char)c; - } - - result.APPEND(new_cstr, row->item.size, - row->item.lang, - row->item.origin.file, row->item.origin.line); - ); + *dest++=(char)c; + } + result.body=new_cstr; + result.fragments.append(fragments, 0, fragments.count()); return result; } -/// @test if in some piece were found no dict words, append it, not it's duplicate -String& String::replace(Pool& pool, Dictionary& dict) const { - char *lcstr=cstr(); - const char *current=lcstr; - - String& result=*new(pool) String(pool); - STRING_FOREACH_ROW( -IFNDEF_NO_STRING_ORIGIN( - const char *joined_origin_file=row->item.origin.file; - const size_t joined_origin_line=row->item.origin.line; -); - uchar joined_lang=row->item.lang; - const char *joined_ptr=current; - // calc size - size_t joined_size=0; - STRING_PREPARED_FOREACH_ROW(*this, - if(row->item.lang==joined_lang) - joined_size+=row->item.size; - else - break; // before non-ours - ); - current+=joined_size; - - // pointers are after joined piece - // & one step back, see STRING_FOREACH_ROW - --row; ++countdown; - - char *new_cstr=(char *)pool.malloc((size_t)ceil(joined_size*dict.max_ratio()), 14); - char *dest=new_cstr; - while(joined_size) { - // there is a row where first column starts 'joined_ptr' - if(Table::Item *item=dict.first_that_starts(joined_ptr, joined_size)) { - // get a=>b values - const String& a=*static_cast(item)->get_string(0); - const String& b=*static_cast(item)->get_string(1); - // skip 'a' in 'joined_ptr' && reduce work size - joined_ptr+=a.size(); joined_size-=a.size(); - // write 'b' to 'dest' && skip 'b' in 'dest' - b.store_to(dest); dest+=b.size(); - } else { - // write a char to b && reduce work size - *dest++=*joined_ptr++; joined_size--; +const String& String::replace(const Dictionary& dict) const { + String& result=*new String(); + const char* old_cstr=cstr(); + const char* prematch_start=old_cstr; + + for(const char* current=old_cstr; *current; ) { + if(Table::element_type row=dict.first_that_starts(current)) { + // prematch + if(size_t prematch_size=current-prematch_start) { + result.body=CORD_cat_char_star(result.body, prematch_start, prematch_size); + result.fragments.append(fragments, prematch_start-old_cstr, prematch_size); } - } - result.APPEND(new_cstr, dest-new_cstr, joined_lang, - joined_origin_file, joined_origin_line); - ); + // match - return result; -} + const String* a=row->get(0); + // skip 'a' in 'current'; move prematch_start + current+=a->size(); prematch_start=current; + + if(row->count()>1) { // are there any b? + const String* b=row->get(1); + if(size_t b_size=b->size()) { + result.body=CORD_cat(result.body, b->cstr_to_cord()); + result.fragments.append(b->fragments, 0, b->fragments.count()); + } + } + } else // simply advance + current++; + } -String& String::join_chains(Pool& pool, char** acstr) const { - char *lcstr=cstr(); - const char *current=lcstr; - - String& result=*new(pool) String(pool); - STRING_FOREACH_ROW( -IFNDEF_NO_STRING_ORIGIN( - const char *joined_origin_file=row->item.origin.file; - const size_t joined_origin_line=row->item.origin.line; -); - uchar joined_lang=row->item.lang; - const char *joined_ptr=current; - // calc size - size_t joined_size=0; - STRING_PREPARED_FOREACH_ROW(*this, - if(row->item.lang==joined_lang) - joined_size+=row->item.size; - else - break; // before non-ours - ); - current+=joined_size; - - // pointers are after joined piece - // & one step back, see STRING_FOREACH_ROW - --row; ++countdown; - - result.APPEND(joined_ptr, joined_size, joined_lang, - joined_origin_file, joined_origin_line); - ); + // postmatch + if(size_t prematch_size=current-prematch_start) { + result.body=CORD_cat_char_star(result.body, prematch_start, prematch_size); + result.fragments.append(fragments, prematch_start-old_cstr, prematch_size); + } - if(acstr) - *acstr=lcstr; return result; } double String::as_double() const { double result; - const char *cstr; - char buf[MAX_NUMBER]; - if(head.chunk.rows+1==append_here) { - int size=min(head.chunk.rows[0].item.size, MAX_NUMBER-1); - memcpy(buf, head.chunk.rows[0].item.ptr, size); - buf[size]=0; - cstr=buf; - } else - cstr=this->cstr(); - while(*cstr && isspace(*cstr)) - cstr++; - if(!*cstr) + const char *str=cstr(); + + while(*str && isspace(*str)) + str++; + if(!*str) return 0; char *error_pos; // 0xABC - if(cstr[0]=='0') - if(cstr[1]=='x' || cstr[1]=='X') - result=(double)(unsigned long)strtol(cstr, &error_pos, 0); + if(str[0]=='0') + if(str[1]=='x' || str[1]=='X') + result=(double)(unsigned long)strtol(str, &error_pos, 0); else - result=(double)strtod(cstr+1/*skip leading 0*/, &error_pos); + result=(double)strtod(str+1/*skip leading 0*/, &error_pos); else - result=(double)strtod(cstr, &error_pos); + result=(double)strtod(str, &error_pos); while(char c=*error_pos++) if(!isspace(c)) @@ -741,29 +461,22 @@ double String::as_double() const { } int String::as_int() const { int result; - const char *cstr; - char buf[MAX_NUMBER]; - if(head.chunk.rows+1==append_here) { - size_t size=min(head.chunk.rows[0].item.size, MAX_NUMBER-1); - memcpy(buf, head.chunk.rows[0].item.ptr, size); - buf[size]=0; - cstr=buf; - } else - cstr=this->cstr(); - while(*cstr && isspace(*cstr)) - cstr++; - if(!*cstr) + const char *str=cstr(); + + while(*str && isspace(*str)) + str++; + if(!*str) return 0; char *error_pos; // 0xABC - if(cstr[0]=='0') - if(cstr[1]=='x' || cstr[1]=='X') - result=(int)(unsigned long)strtol(cstr, &error_pos, 0); + if(str[0]=='0') + if(str[1]=='x' || str[1]=='X') + result=(int)(unsigned long)strtol(str, &error_pos, 0); else - result=(int)strtol(cstr+1/*skip leading 0*/, &error_pos, 0); + result=(int)strtol(str+1/*skip leading 0*/, &error_pos, 0); else - result=(int)strtol(cstr, &error_pos, 0); + result=(int)strtol(str, &error_pos, 0); while(char c=*error_pos++) if(!isspace(c)) @@ -774,66 +487,89 @@ int String::as_int() const { return result; } -inline void ushort2uchars(ushort word, uchar& byte1, uchar& byte2) { - byte1=word&0xFF; - byte2=word>>8; -} -inline ushort uchars2ushort(uchar byte1, uchar byte2) { - return (byte2<<8) | byte1; -} -/* @todo maybe network order worth spending some effort? - don't bothering myself with network byte order, - am not planning to be able to move resulting file across platforms - for now -*/ -void String::serialize(size_t prolog_size, void *& buf, size_t& buf_size) const { - buf_size= +inline void uint2uchars(uint word, uchar *bytes) { + bytes[0]=word&0xFF; + bytes[1]=(word>>8)&0xFF; + bytes[2]=(word>>16)&0xFF; + bytes[3]=(word>>24)&0xFF; +} +inline uint uchars2uint(uchar *bytes) { + return bytes[3]<<24 + | bytes[2]<<16 + | bytes[1]<<8 + | bytes[0]; +} + +static int CORD_batched_iter_fn_append(const char* s, void* client_data) { + char*& cur=*static_cast(client_data); + + size_t size=strlen(s); + memcpy(cur, s, size); cur+=size; + return 0; +}; +String::C String::serialize(size_t prolog_size) const { + size_t buf_size= prolog_size - +used_rows()*(sizeof(uchar)+sizeof(ushort)) + +fragments.count()*(sizeof(Untaint_lang)+sizeof(size_t)) +size(); - buf=malloc(buf_size,15); - char *cur=(char *)buf+prolog_size; + C result(new(PointerFreeGC) char[buf_size], buf_size); - STRING_FOREACH_ROW( + // 1: prolog + char *cur=result.str+prolog_size; + + + // 2: fragments.count + size_t fragments_count=fragments.count(); + memcpy(cur, &fragments_count, sizeof(fragments_count)); cur+=sizeof(fragments_count); + + // 3: lang info + for(Array_iterator i(fragments); i.has_next(); ) { + const Fragment& fragment=i.next(); // lang - memcpy(cur, &row->item.lang, sizeof(uchar)); - cur+=sizeof(uchar); + memcpy(cur, &fragment.lang, sizeof(fragment.lang)); cur+=sizeof(fragment.lang); // size - uchar byte1; uchar byte2; - ushort2uchars(row->item.size, byte1, byte2); - memcpy(cur, &byte1, sizeof(uchar)); cur+=sizeof(uchar); - memcpy(cur, &byte2, sizeof(uchar)); cur+=sizeof(uchar); - // bytes - memcpy(cur, row->item.ptr, row->item.size); - cur+=row->item.size; - ); + memcpy(cur, &fragment.size, sizeof(fragment.size)); cur+=sizeof(fragment.size); + } + + // 4: letters + CORD_iter5(body, 0, 0, CORD_batched_iter_fn_append, &cur); + + return result; } -bool String::deserialize(size_t prolog_size, void *buf, size_t buf_size, const char *file) { +bool String::deserialize(size_t prolog_size, void *buf, size_t buf_size, const char* file) { if(buf_size<=prolog_size) return false; - - char *cur=(char *)buf+prolog_size; buf_size-=prolog_size; - while(buf_size) { - if(sizeof(uchar)+sizeof(ushort)>buf_size) // lang+size - return false; + // 1: prolog + const char* cur=(const char* )buf+prolog_size; - uchar lang=*(uchar *)(cur); - ushort size=uchars2ushort( - *(uchar*)(cur+sizeof(uchar)*1), - *(uchar*)(cur+sizeof(uchar)*2) - ); + // 2: fragments.count + if(buf_size(cur); cur+=sizeof(size_t); + buf_size-=sizeof(size_t); - size_t piece_size=sizeof(uchar)+sizeof(ushort)+size; - if(piece_size>buf_size) // buffer overrun, can be on incomplete cache files + // 3: lang info + size_t total_size=0; + for(size_t f=0; f(cur); cur+=sizeof(Untaint_lang); + size_t fragment_size=*reinterpret_cast(cur); cur+=sizeof(size_t); + fragments+=Fragment(lang, fragment_size); + total_size+=fragment_size; - cur+=piece_size; buf_size-=piece_size; } + + // 4: letters + if(buf_size!=total_size) + return false; + + body=CORD_cat_char_star(CORD_EMPTY, cur, buf_size); + return true; }